-module(prng@random). -compile([no_auto_import, nowarn_unused_vars, nowarn_unused_function, nowarn_nomatch]). -export([step/2, sample/2, to_iterator/2, to_random_iterator/1, random_sample/1, int/2, float/2, constant/1, fixed_size_list/2, then/2, list/1, map/2, weighted/2, try_weighted/1, map2/3, pair/2, uniform/2, try_uniform/1, choose/2, map3/4, map4/5, map5/6, fixed_size_string/1, string/0, bit_array/0, set/1, fixed_size_set/2, dict/2, fixed_size_dict/3]). -export_type([generator/1]). -opaque generator(FOV) :: {generator, fun((prng@seed:seed()) -> {FOV, prng@seed:seed()})}. -spec step(generator(FOW), prng@seed:seed()) -> {FOW, prng@seed:seed()}. step(Generator, Seed) -> (erlang:element(2, Generator))(Seed). -spec sample(generator(FOY), prng@seed:seed()) -> FOY. sample(Generator, Seed) -> erlang:element(1, step(Generator, Seed)). -spec to_iterator(generator(FPF), prng@seed:seed()) -> gleam@iterator:iterator(FPF). to_iterator(Generator, Seed) -> gleam@iterator:unfold( Seed, fun(Seed@1) -> {Value, New_seed} = step(Generator, Seed@1), {next, Value, New_seed} end ). -spec to_random_iterator(generator(FPC)) -> gleam@iterator:iterator(FPC). to_random_iterator(Generator) -> to_iterator(Generator, prng@seed:random()). -spec random_sample(generator(FPA)) -> FPA. random_sample(Generator) -> _assert_subject = gleam@iterator:first(to_random_iterator(Generator)), {ok, Result} = case _assert_subject of {ok, _} -> _assert_subject; _assert_fail -> erlang:error(#{gleam_error => let_assert, message => <<"Assertion pattern match failed"/utf8>>, value => _assert_fail, module => <<"prng/random"/utf8>>, function => <<"random_sample"/utf8>>, line => 196}) end, Result. -spec sort_ascending(FPJ, FPJ, fun((FPJ, FPJ) -> gleam@order:order())) -> {FPJ, FPJ}. sort_ascending(One, Other, Compare) -> case Compare(One, Other) of lt -> {One, Other}; eq -> {One, Other}; gt -> {Other, One} end. -spec int(integer(), integer()) -> generator(integer()). int(From, To) -> {generator, fun(Seed) -> {Low, High} = sort_ascending(From, To, fun gleam@int:compare/2), ffi:random_int(Seed, Low, High) end}. -spec float(float(), float()) -> generator(float()). float(From, To) -> {generator, fun(Seed) -> {Low, High} = sort_ascending(From, To, fun gleam@float:compare/2), ffi:random_float(Seed, Low, High) end}. -spec constant(FPL) -> generator(FPL). constant(Value) -> {generator, fun(Seed) -> {Value, Seed} end}. -spec get_by_weight({float(), FQD}, list({float(), FQD}), float()) -> FQD. get_by_weight(First, Others, Countdown) -> {Weight, Value} = First, case Others of [] -> Value; [Second | Rest] -> Positive_weight = gleam@float:absolute_value(Weight), case gleam@float:compare(Countdown, Positive_weight) of lt -> Value; eq -> Value; gt -> get_by_weight(Second, Rest, Countdown - Positive_weight) end end. -spec do_fixed_size_list(list(FQQ), prng@seed:seed(), generator(FQQ), integer()) -> {list(FQQ), prng@seed:seed()}. do_fixed_size_list(Acc, Seed, Generator, Length) -> case Length =< 0 of true -> {Acc, Seed}; false -> {Value, Seed@1} = step(Generator, Seed), do_fixed_size_list([Value | Acc], Seed@1, Generator, Length - 1) end. -spec fixed_size_list(generator(FQM), integer()) -> generator(list(FQM)). fixed_size_list(Generator, Length) -> {generator, fun(Seed) -> do_fixed_size_list([], Seed, Generator, Length) end}. -spec then(generator(FSF), fun((FSF) -> generator(FSH))) -> generator(FSH). then(Generator, Generator_from) -> {generator, fun(Seed) -> {Value, Seed@1} = step(Generator, Seed), _pipe = Generator_from(Value), step(_pipe, Seed@1) end}. -spec list(generator(FQU)) -> generator(list(FQU)). list(Generator) -> then(int(0, 32), fun(Size) -> fixed_size_list(Generator, Size) end). -spec map(generator(FSK), fun((FSK) -> FSM)) -> generator(FSM). map(Generator, Fun) -> {generator, fun(Seed) -> {Value, Seed@1} = step(Generator, Seed), {Fun(Value), Seed@1} end}. -spec weighted({float(), FPV}, list({float(), FPV})) -> generator(FPV). weighted(First, Others) -> Normalise = fun(Pair) -> gleam@float:absolute_value(gleam@pair:first(Pair)) end, Total = Normalise(First) + gleam@float:sum( gleam@list:map(Others, Normalise) ), map( float(+0.0, Total), fun(_capture) -> get_by_weight(First, Others, _capture) end ). -spec try_weighted(list({float(), FPY})) -> {ok, generator(FPY)} | {error, nil}. try_weighted(Options) -> case Options of [First | Rest] -> {ok, weighted(First, Rest)}; [] -> {error, nil} end. -spec map2(generator(FSO), generator(FSQ), fun((FSO, FSQ) -> FSS)) -> generator(FSS). map2(One, Other, Fun) -> {generator, fun(Seed) -> {A, Seed@1} = step(One, Seed), {B, Seed@2} = step(Other, Seed@1), {Fun(A, B), Seed@2} end}. -spec pair(generator(FQH), generator(FQJ)) -> generator({FQH, FQJ}). pair(One, Other) -> map2(One, Other, fun gleam@pair:new/2). -spec uniform(FPN, list(FPN)) -> generator(FPN). uniform(First, Others) -> weighted( {1.0, First}, gleam@list:map( Others, fun(_capture) -> gleam@pair:new(1.0, _capture) end ) ). -spec try_uniform(list(FPQ)) -> {ok, generator(FPQ)} | {error, nil}. try_uniform(Options) -> case Options of [First | Rest] -> {ok, uniform(First, Rest)}; [] -> {error, nil} end. -spec choose(FQF, FQF) -> generator(FQF). choose(One, Other) -> uniform(One, [Other]). -spec map3( generator(FSU), generator(FSW), generator(FSY), fun((FSU, FSW, FSY) -> FTA) ) -> generator(FTA). map3(One, Two, Three, Fun) -> {generator, fun(Seed) -> {A, Seed@1} = step(One, Seed), {B, Seed@2} = step(Two, Seed@1), {C, Seed@3} = step(Three, Seed@2), {Fun(A, B, C), Seed@3} end}. -spec map4( generator(FTC), generator(FTE), generator(FTG), generator(FTI), fun((FTC, FTE, FTG, FTI) -> FTK) ) -> generator(FTK). map4(One, Two, Three, Four, Fun) -> {generator, fun(Seed) -> {A, Seed@1} = step(One, Seed), {B, Seed@2} = step(Two, Seed@1), {C, Seed@3} = step(Three, Seed@2), {D, Seed@4} = step(Four, Seed@3), {Fun(A, B, C, D), Seed@4} end}. -spec map5( generator(FTM), generator(FTO), generator(FTQ), generator(FTS), generator(FTU), fun((FTM, FTO, FTQ, FTS, FTU) -> FTW) ) -> generator(FTW). map5(One, Two, Three, Four, Five, Fun) -> {generator, fun(Seed) -> {A, Seed@1} = step(One, Seed), {B, Seed@2} = step(Two, Seed@1), {C, Seed@3} = step(Three, Seed@2), {D, Seed@4} = step(Four, Seed@3), {E, Seed@5} = step(Five, Seed@4), {Fun(A, B, C, D, E), Seed@5} end}. -spec fixed_size_string(integer()) -> generator(binary()). fixed_size_string(Size) -> _pipe = fixed_size_list(utf_codepoint_in_range(0, 1023), Size), map(_pipe, fun gleam_stdlib:utf_codepoint_list_to_string/1). -spec string() -> generator(binary()). string() -> then(int(0, 32), fun(Size) -> fixed_size_string(Size) end). -spec bit_array() -> generator(bitstring()). bit_array() -> map(string(), fun gleam_stdlib:identity/1). -spec utf_codepoint_in_range(integer(), integer()) -> generator(integer()). utf_codepoint_in_range(Lower, Upper) -> then( int(Lower, Upper), fun(Raw_codepoint) -> case gleam@string:utf_codepoint(Raw_codepoint) of {ok, Codepoint} -> constant(Codepoint); {error, _} -> utf_codepoint_in_range(Lower, Upper) end end ). -spec set(generator(FSA)) -> generator(gleam@set:set(FSA)). set(Generator) -> then(int(0, 32), fun(Size) -> fixed_size_set(Generator, Size) end). -spec fixed_size_set(generator(FRR), integer()) -> generator(gleam@set:set(FRR)). fixed_size_set(Generator, Size) -> _pipe = gleam@int:max(Size, 0), do_fixed_size_set(Generator, _pipe, 0, 0, gleam@set:new()). -spec do_fixed_size_set( generator(FRV), integer(), integer(), integer(), gleam@set:set(FRV) ) -> generator(gleam@set:set(FRV)). do_fixed_size_set(Generator, Size, Unique_items, Consecutive_attempts, Acc) -> Has_required_size = Unique_items =:= Size, gleam@bool:guard( Has_required_size, constant(Acc), fun() -> Has_reached_maximum_attempts = Consecutive_attempts >= 10, gleam@bool:guard( Has_reached_maximum_attempts, constant(Acc), fun() -> then( Generator, fun(Item) -> case gleam@set:contains(Acc, Item) of true -> _pipe = (Consecutive_attempts + 1), do_fixed_size_set( Generator, Size, Unique_items, _pipe, Acc ); false -> _pipe@1 = gleam@set:insert(Acc, Item), do_fixed_size_set( Generator, Size, Unique_items + 1, 0, _pipe@1 ) end end ) end ) end ). -spec dict(generator(any()), generator(any())) -> generator(gleam@dict:dict(any(), any())). dict(Keys, Values) -> then(int(0, 32), fun(Size) -> fixed_size_dict(Keys, Values, Size) end). -spec fixed_size_dict(generator(FQY), generator(FRA), integer()) -> generator(gleam@dict:dict(FQY, FRA)). fixed_size_dict(Keys, Values, Size) -> _pipe = gleam@int:max(Size, 0), do_fixed_size_dict(Keys, Values, _pipe, 0, 0, gleam@dict:new()). -spec do_fixed_size_dict( generator(FRD), generator(FRF), integer(), integer(), integer(), gleam@dict:dict(FRD, FRF) ) -> generator(gleam@dict:dict(FRD, FRF)). do_fixed_size_dict(Keys, Values, Size, Unique_keys, Consecutive_attempts, Acc) -> Has_required_size = Unique_keys =:= Size, gleam@bool:guard( Has_required_size, constant(Acc), fun() -> Has_reached_maximum_attempts = Consecutive_attempts >= 10, gleam@bool:guard( Has_reached_maximum_attempts, constant(Acc), fun() -> then(Keys, fun(Key) -> case gleam@dict:has_key(Acc, Key) of true -> _pipe = (Consecutive_attempts + 1), do_fixed_size_dict( Keys, Values, Size, Unique_keys, _pipe, Acc ); false -> then( Values, fun(Value) -> _pipe@1 = gleam@dict:insert( Acc, Key, Value ), do_fixed_size_dict( Keys, Values, Size, Unique_keys + 1, 0, _pipe@1 ) end ) end end) end ) end ).