-module(map).
-compile([no_auto_import, nowarn_unused_vars]).

-export([new/1, insert/3, find/2, has_key/2, delete/2, count/1, fold/3, filter/2, merge/2, from_list/2, to_list/1, take/2]).

-spec new(fun((FXP, FXP) -> gleam@order:order())) -> structures@red_black_tree_kv:tree(FXP, any()).
new(Compare) ->
    structures@red_black_tree_kv:new(Compare).

-spec insert(structures@red_black_tree_kv:tree(FXT, FXU), FXT, FXU) -> structures@red_black_tree_kv:tree(FXT, FXU).
insert(Map, Key, Value) ->
    structures@red_black_tree_kv:insert(Map, Key, Value).

-spec find(structures@red_black_tree_kv:tree(FXZ, FYA), FXZ) -> {ok, {FXZ, FYA}} |
    {error, nil}.
find(Map, Key) ->
    structures@red_black_tree_kv:find(Map, Key).

-spec has_key(structures@red_black_tree_kv:tree(FYF, any()), FYF) -> boolean().
has_key(Map, Key) ->
    case structures@red_black_tree_kv:find(Map, Key) of
        {ok, _} ->
            true;

        {error, _} ->
            false
    end.

-spec delete(structures@red_black_tree_kv:tree(FYJ, FYK), FYJ) -> structures@red_black_tree_kv:tree(FYJ, FYK).
delete(Map, Key) ->
    structures@red_black_tree_kv:delete(Map, Key).

-spec count(structures@red_black_tree_kv:tree(any(), any())) -> integer().
count(Map) ->
    structures@red_black_tree_kv:fold(Map, 0, fun(A, _, _) -> A + 1 end).

-spec fold(
    structures@red_black_tree_kv:tree(FYT, FYU),
    FYX,
    fun((FYX, FYT, FYU) -> FYX)
) -> FYX.
fold(Map, Initial, Reducer) ->
    structures@red_black_tree_kv:fold(Map, Initial, Reducer).

-spec filter(
    structures@red_black_tree_kv:tree(FYY, FYZ),
    fun((FYY, FYZ) -> boolean())
) -> structures@red_black_tree_kv:tree(FYY, FYZ).
filter(Map, Property) ->
    structures@red_black_tree_kv:fold(
        Map,
        Map,
        fun(Map@1, K, V) -> case Property(K, V) of
                true ->
                    Map@1;

                false ->
                    structures@red_black_tree_kv:delete(Map@1, K)
            end end
    ).

-spec merge(
    structures@red_black_tree_kv:tree(FZE, FZF),
    structures@red_black_tree_kv:tree(FZE, FZF)
) -> structures@red_black_tree_kv:tree(FZE, FZF).
merge(First, Second) ->
    structures@red_black_tree_kv:fold(
        First,
        Second,
        fun(A, K, V) -> structures@red_black_tree_kv:insert(A, K, V) end
    ).

-spec from_list(list({FZT, FZU}), fun((FZT, FZT) -> gleam@order:order())) -> structures@red_black_tree_kv:tree(FZT, FZU).
from_list(Members, Compare) ->
    gleam@list:fold(
        Members,
        structures@red_black_tree_kv:new(Compare),
        fun(Tree, I) ->
            structures@red_black_tree_kv:insert(
                Tree,
                erlang:element(1, I),
                erlang:element(2, I)
            )
        end
    ).

-spec to_list(structures@red_black_tree_kv:tree(FZY, FZZ)) -> list({FZY, FZZ}).
to_list(Map) ->
    structures@red_black_tree_kv:foldr(
        Map,
        [],
        fun(A, K, V) -> [{K, V} | A] end
    ).

-spec take(structures@red_black_tree_kv:tree(FZM, FZN), list(FZM)) -> structures@red_black_tree_kv:tree(FZM, FZN).
take(Map, Desired) ->
    case Desired of
        [X | Xs] ->
            case structures@red_black_tree_kv:find(Map, X) of
                {ok, X@1} ->
                    structures@red_black_tree_kv:insert(
                        take(Map, Xs),
                        erlang:element(1, X@1),
                        erlang:element(2, X@1)
                    );

                {error, _} ->
                    take(Map, Xs)
            end;

        [] ->
            structures@red_black_tree_kv:clear(Map)
    end.