Current section

Files

Jump to
sprocket src sprocket@internal@utils@ordered_map.erl
Raw

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(IUM, IUN) :: {keyed_item, IUM, IUN}.
-opaque ordered_map(IUO, IUP) :: {ordered_map,
list(keyed_item(IUO, IUP)),
gleam@dict:dict(IUO, IUP),
integer()}.
-opaque ordered_map_iter(IUQ, IUR) :: {ordered_map_iter,
list(keyed_item(IUQ, IUR))}.
-spec new() -> ordered_map(any(), any()).
new() ->
{ordered_map, [], gleam@dict:new(), 0}.
-spec from(list(keyed_item(IUW, IUX)), gleam@dict:dict(IUW, IUX), integer()) -> ordered_map(IUW, IUX).
from(Ordered, Map, Size) ->
{ordered_map, Ordered, Map, Size}.
-spec from_list(list(keyed_item(IVF, IVG))) -> ordered_map(IVF, IVG).
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, gleam@list:reverse(R_ordered), Map@1, Size@1}.
-spec insert(ordered_map(IVM, IVN), IVM, IVN) -> ordered_map(IVM, IVN).
insert(M, Key, Value) ->
{ordered_map,
gleam@list:reverse(
[{keyed_item, Key, Value} |
gleam@list:reverse(erlang:element(2, M))]
),
gleam@dict:insert(erlang:element(3, M), Key, Value),
erlang:element(4, M) + 1}.
-spec update(ordered_map(IVS, IVT), IVS, IVT) -> ordered_map(IVS, IVT).
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(IVY, any()), IVY) -> boolean().
has_key(M, Key) ->
gleam@dict:has_key(erlang:element(3, M), Key).
-spec get(ordered_map(IWC, IWD), IWC) -> {ok, IWD} | {error, nil}.
get(M, Key) ->
gleam@dict:get(erlang:element(3, M), Key).
-spec remove(ordered_map(IWI, IWJ), IWI) -> ordered_map(IWI, IWJ).
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(IWS, IWT)) -> ordered_map_iter(IWS, IWT).
iter(M) ->
_pipe = erlang:element(2, M),
{ordered_map_iter, _pipe}.
-spec next(ordered_map_iter(IWY, IWZ)) -> {ok,
{ordered_map_iter(IWY, IWZ), keyed_item(IWY, IWZ)}} |
{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(IXI, IXJ), IXM, fun((IXM, keyed_item(IXI, IXJ)) -> IXM)) -> IXM.
fold(M, Acc, Func) ->
_pipe = erlang:element(2, M),
gleam@list:fold(_pipe, Acc, Func).
-spec map(ordered_map(IXP, IXQ), fun((keyed_item(IXP, IXQ)) -> IXV)) -> list(IXV).
map(M, Func) ->
_pipe = erlang:element(2, M),
gleam@list:map(_pipe, Func).
-spec index_map(
ordered_map(IXX, IXY),
fun((keyed_item(IXX, IXY), integer()) -> IYD)
) -> list(IYD).
index_map(M, Func) ->
_pipe = erlang:element(2, M),
gleam@list:index_map(_pipe, Func).
-spec find_next_helper(list(keyed_item(any(), IYM))) -> {ok, IYM} | {error, nil}.
find_next_helper(Ordered) ->
case Ordered of
[Item | _] ->
{ok, erlang:element(3, Item)};
_ ->
{error, nil}
end.
-spec find_next(ordered_map(IYF, IYG), IYF) -> {ok, IYG} | {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(IYY, IYZ), IYY, {ok, IYZ} | {error, nil}) -> {ok,
IYZ} |
{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(IYS, IYT), IYS) -> {ok, IYT} | {error, nil}.
find_previous(M, Key) ->
find_previous_helper(M, Key, {error, nil}).
-spec find(ordered_map(IZG, IZH), fun((keyed_item(IZG, IZH)) -> boolean())) -> {ok,
keyed_item(IZG, IZH)} |
{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.