-module(sprocket@internal@utils@ordered_map). -compile([no_auto_import, nowarn_unused_vars, nowarn_unused_function]). -export([from/3, size/1, iter/1, next/1, fold/3, map/2, new/0, from_list/1, insert/3, update/3, has_key/2, get/2, remove/2, index_map/2, find_next/2, find_previous/2, find/2]). -export_type([keyed_item/2, ordered_map/2, ordered_map_iter/2]). -type keyed_item(KOD, KOE) :: {keyed_item, KOD, KOE}. -opaque ordered_map(KOF, KOG) :: {ordered_map, list(keyed_item(KOF, KOG)), gleam@map:map_(KOF, KOG), integer()}. -opaque ordered_map_iter(KOH, KOI) :: {ordered_map_iter, list(keyed_item(KOH, KOI))}. -spec from(list(keyed_item(KON, KOO)), gleam@map:map_(KON, KOO), integer()) -> ordered_map(KON, KOO). from(Ordered, Map, Size) -> {ordered_map, Ordered, Map, Size}. -spec size(ordered_map(any(), any())) -> integer(). size(M) -> erlang:element(4, M). -spec iter(ordered_map(KQJ, KQK)) -> ordered_map_iter(KQJ, KQK). iter(M) -> _pipe = erlang:element(2, M), {ordered_map_iter, _pipe}. -spec next(ordered_map_iter(KQP, KQQ)) -> {ok, {ordered_map_iter(KQP, KQQ), keyed_item(KQP, KQQ)}} | {error, nil}. next(Iter) -> case Iter of {ordered_map_iter, []} -> {error, nil}; {ordered_map_iter, [Item | Rest]} -> {ok, {{ordered_map_iter, Rest}, Item}} end. -spec fold(ordered_map(KQZ, KRA), KRD, fun((KRD, keyed_item(KQZ, KRA)) -> KRD)) -> KRD. fold(M, Acc, Func) -> _pipe = erlang:element(2, M), gleam@list:fold(_pipe, Acc, Func). -spec map(ordered_map(KRG, KRH), fun((keyed_item(KRG, KRH)) -> KRM)) -> list(KRM). map(M, Func) -> _pipe = erlang:element(2, M), gleam@list:map(_pipe, Func). -spec new() -> ordered_map(any(), any()). new() -> {ordered_map, [], gleam@map:new(), 0}. -spec from_list(list(keyed_item(KOW, KOX))) -> ordered_map(KOW, KOX). from_list(Ordered) -> {R_ordered, Map@1, Size@1} = begin _pipe = Ordered, gleam@list:fold( _pipe, {[], gleam@map:new(), 0}, fun(Acc, Keyed_item) -> {Ordered@1, Map, Size} = Acc, {keyed_item, Key, Value} = Keyed_item, Keyed_item@1 = {keyed_item, Key, Value}, case gleam@map:has_key(Map, Key) of true -> {Ordered@1, Map, Size}; false -> {[Keyed_item@1 | Ordered@1], gleam@map:insert(Map, Key, Value), Size + 1} end end ) end, {ordered_map, gleam@list:reverse(R_ordered), Map@1, Size@1}. -spec insert(ordered_map(KPD, KPE), KPD, KPE) -> ordered_map(KPD, KPE). insert(M, Key, Value) -> {ordered_map, gleam@list:reverse( [{keyed_item, Key, Value} | gleam@list:reverse(erlang:element(2, M))] ), gleam@map:insert(erlang:element(3, M), Key, Value), erlang:element(4, M) + 1}. -spec update(ordered_map(KPJ, KPK), KPJ, KPK) -> ordered_map(KPJ, KPK). update(M, Key, Value) -> case gleam@map:has_key(erlang:element(3, M), Key) of true -> {ordered_map, gleam@list:map( erlang:element(2, M), fun(Keyed_item) -> {keyed_item, K, _} = Keyed_item, case K =:= Key of true -> {keyed_item, Key, Value}; false -> Keyed_item end end ), gleam@map:insert(erlang:element(3, M), Key, Value), erlang:element(4, M)}; false -> M end. -spec has_key(ordered_map(KPP, any()), KPP) -> boolean(). has_key(M, Key) -> gleam@map:has_key(erlang:element(3, M), Key). -spec get(ordered_map(KPT, KPU), KPT) -> {ok, KPU} | {error, nil}. get(M, Key) -> gleam@map:get(erlang:element(3, M), Key). -spec remove(ordered_map(KPZ, KQA), KPZ) -> ordered_map(KPZ, KQA). remove(M, Key) -> case gleam@map:has_key(erlang:element(3, M), Key) of true -> {ordered_map, erlang:element(2, M), gleam@map:delete(erlang:element(3, M), Key), erlang:element(4, M) - 1}; false -> M end. -spec index_map( ordered_map(KRO, KRP), fun((integer(), keyed_item(KRO, KRP)) -> KRU) ) -> list(KRU). index_map(M, Func) -> _pipe = erlang:element(2, M), gleam@list:index_map(_pipe, Func). -spec find_next_helper(list(keyed_item(any(), KSD))) -> {ok, KSD} | {error, nil}. find_next_helper(Ordered) -> case Ordered of [Item | _] -> {ok, erlang:element(3, Item)}; _ -> {error, nil} end. -spec find_next(ordered_map(KRW, KRX), KRW) -> {ok, KRX} | {error, nil}. find_next(M, Key) -> case erlang:element(2, M) of [] -> {error, nil}; [Item | Rest] -> case Item of {keyed_item, K, _} -> case K =:= Key of true -> find_next_helper(Rest); false -> find_next( {ordered_map, Rest, erlang:element(3, M), erlang:element(4, M)}, Key ) end end end. -spec find_previous_helper(ordered_map(KSP, KSQ), KSP, {ok, KSQ} | {error, nil}) -> {ok, KSQ} | {error, nil}. find_previous_helper(M, Key, Prev) -> case erlang:element(2, M) of [] -> {error, nil}; [Item | Rest] -> case Item of {keyed_item, K, V} -> case K =:= Key of true -> Prev; false -> find_previous_helper( {ordered_map, Rest, erlang:element(3, M), erlang:element(4, M)}, Key, {ok, V} ) end end end. -spec find_previous(ordered_map(KSJ, KSK), KSJ) -> {ok, KSK} | {error, nil}. find_previous(M, Key) -> find_previous_helper(M, Key, {error, nil}). -spec find(ordered_map(KSX, KSY), fun((keyed_item(KSX, KSY)) -> boolean())) -> {ok, keyed_item(KSX, KSY)} | {error, nil}. find(M, Find_by) -> case erlang:element(2, M) of [] -> {error, nil}; [Item | Rest] -> case Item of {keyed_item, K, V} -> case Find_by(Item) of true -> {ok, {keyed_item, K, V}}; false -> find( {ordered_map, Rest, erlang:element(3, M), erlang:element(4, M)}, Find_by ) end end end.