Current section
Files
Jump to
Current section
Files
src/sprocket@internal@utils@ordered_map.erl
-module(sprocket@internal@utils@ordered_map).
-compile([no_auto_import, nowarn_unused_vars, nowarn_unused_function, nowarn_nomatch]).
-export([new/0, from/3, from_list/1, insert/3, update/3, has_key/2, get/2, remove/2, size/1, iter/1, next/1, fold/3, map/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(IBP, IBQ) :: {keyed_item, IBP, IBQ}.
-opaque ordered_map(IBR, IBS) :: {ordered_map,
list(keyed_item(IBR, IBS)),
gleam@dict:dict(IBR, IBS),
integer()}.
-opaque ordered_map_iter(IBT, IBU) :: {ordered_map_iter,
list(keyed_item(IBT, IBU))}.
-spec new() -> ordered_map(any(), any()).
new() ->
{ordered_map, [], gleam@dict:new(), 0}.
-spec from(list(keyed_item(IBZ, ICA)), gleam@dict:dict(IBZ, ICA), integer()) -> ordered_map(IBZ, ICA).
from(Ordered, Map, Size) ->
{ordered_map, Ordered, Map, Size}.
-spec from_list(list(keyed_item(ICI, ICJ))) -> ordered_map(ICI, ICJ).
from_list(Ordered) ->
{R_ordered, Map@1, Size@1} = begin
_pipe = Ordered,
gleam@list:fold(
_pipe,
{[], gleam@dict: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@dict:has_key(Map, Key) of
true ->
{Ordered@1, Map, Size};
false ->
{[Keyed_item@1 | Ordered@1],
gleam@dict:insert(Map, Key, Value),
Size + 1}
end
end
)
end,
{ordered_map, lists:reverse(R_ordered), Map@1, Size@1}.
-spec insert(ordered_map(ICP, ICQ), ICP, ICQ) -> ordered_map(ICP, ICQ).
insert(M, Key, Value) ->
{ordered_map,
lists:reverse(
[{keyed_item, Key, Value} | lists:reverse(erlang:element(2, M))]
),
gleam@dict:insert(erlang:element(3, M), Key, Value),
erlang:element(4, M) + 1}.
-spec update(ordered_map(ICV, ICW), ICV, ICW) -> ordered_map(ICV, ICW).
update(M, Key, Value) ->
case gleam@dict: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@dict:insert(erlang:element(3, M), Key, Value),
erlang:element(4, M)};
false ->
M
end.
-spec has_key(ordered_map(IDB, any()), IDB) -> boolean().
has_key(M, Key) ->
gleam@dict:has_key(erlang:element(3, M), Key).
-spec get(ordered_map(IDF, IDG), IDF) -> {ok, IDG} | {error, nil}.
get(M, Key) ->
gleam@dict:get(erlang:element(3, M), Key).
-spec remove(ordered_map(IDL, IDM), IDL) -> ordered_map(IDL, IDM).
remove(M, Key) ->
case gleam@dict:has_key(erlang:element(3, M), Key) of
true ->
{ordered_map,
erlang:element(2, M),
gleam@dict:delete(erlang:element(3, M), Key),
erlang:element(4, M) - 1};
false ->
M
end.
-spec size(ordered_map(any(), any())) -> integer().
size(M) ->
erlang:element(4, M).
-spec iter(ordered_map(IDV, IDW)) -> ordered_map_iter(IDV, IDW).
iter(M) ->
_pipe = erlang:element(2, M),
{ordered_map_iter, _pipe}.
-spec next(ordered_map_iter(IEB, IEC)) -> {ok,
{ordered_map_iter(IEB, IEC), keyed_item(IEB, IEC)}} |
{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(IEL, IEM), IEP, fun((IEP, keyed_item(IEL, IEM)) -> IEP)) -> IEP.
fold(M, Acc, Func) ->
_pipe = erlang:element(2, M),
gleam@list:fold(_pipe, Acc, Func).
-spec map(ordered_map(IES, IET), fun((keyed_item(IES, IET)) -> IEY)) -> list(IEY).
map(M, Func) ->
_pipe = erlang:element(2, M),
gleam@list:map(_pipe, Func).
-spec index_map(
ordered_map(IFA, IFB),
fun((keyed_item(IFA, IFB), integer()) -> IFG)
) -> list(IFG).
index_map(M, Func) ->
_pipe = erlang:element(2, M),
gleam@list:index_map(_pipe, Func).
-spec find_next_helper(list(keyed_item(any(), IFP))) -> {ok, IFP} | {error, nil}.
find_next_helper(Ordered) ->
case Ordered of
[Item | _] ->
{ok, erlang:element(3, Item)};
_ ->
{error, nil}
end.
-spec find_next(ordered_map(IFI, IFJ), IFI) -> {ok, IFJ} | {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(IGB, IGC), IGB, {ok, IGC} | {error, nil}) -> {ok,
IGC} |
{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(IFV, IFW), IFV) -> {ok, IFW} | {error, nil}.
find_previous(M, Key) ->
find_previous_helper(M, Key, {error, nil}).
-spec find(ordered_map(IGJ, IGK), fun((keyed_item(IGJ, IGK)) -> boolean())) -> {ok,
keyed_item(IGJ, IGK)} |
{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.