-module(gleam@set).
-compile(no_auto_import).

-export([new/0, size/1, insert/2, contains/2, delete/2, to_list/1, from_list/1, fold/3, filter/2, take/2, union/2, intersection/2]).
-export_type([set/1]).

-opaque set(CTQ) :: {set, gleam@map:map_(CTQ, list(nil))}.

-spec new() -> set(any()).
new() ->
    {set, gleam@map:new()}.

-spec size(set(any())) -> integer().
size(Set) ->
    gleam@map:size(erlang:element(2, Set)).

-spec insert(set(CUB), CUB) -> set(CUB).
insert(Set, Member) ->
    {set, gleam@map:insert(erlang:element(2, Set), Member, [])}.

-spec contains(set(CUE), CUE) -> boolean().
contains(Set, Member) ->
    gleam@result:is_ok(gleam@map:get(erlang:element(2, Set), Member)).

-spec delete(set(CUG), CUG) -> set(CUG).
delete(Set, Member) ->
    {set, gleam@map:delete(erlang:element(2, Set), Member)}.

-spec to_list(set(CUJ)) -> list(CUJ).
to_list(Set) ->
    gleam@map:keys(erlang:element(2, Set)).

-spec from_list(list(CUM)) -> set(CUM).
from_list(Members) ->
    Map = gleam@list:fold(
        Members,
        gleam@map:new(),
        fun(K, M) -> gleam@map:insert(M, K, []) end
    ),
    {set, Map}.

-spec fold(set(CUP), CUR, fun((CUP, CUR) -> CUR)) -> CUR.
fold(Set, Initial, Reducer) ->
    gleam@map:fold(
        erlang:element(2, Set),
        Initial,
        fun(K, _, A) -> Reducer(K, A) end
    ).

-spec filter(set(CUS), fun((CUS) -> boolean())) -> set(CUS).
filter(Set, Property) ->
    {set,
     gleam@map:filter(erlang:element(2, Set), fun(M, _) -> Property(M) end)}.

-spec take(set(CUV), list(CUV)) -> set(CUV).
take(Set, Desired) ->
    {set, gleam@map:take(erlang:element(2, Set), Desired)}.

-spec order(set(CUZ), set(CUZ)) -> {set(CUZ), set(CUZ)}.
order(First, Second) ->
    case gleam@map:size(erlang:element(2, First))
    > gleam@map:size(erlang:element(2, Second)) of
        true ->
            {First, Second};

        false ->
            {Second, First}
    end.

-spec union(set(CVE), set(CVE)) -> set(CVE).
union(First, Second) ->
    {Larger, Smaller} = order(First, Second),
    fold(Smaller, Larger, fun(M, A) -> insert(A, M) end).

-spec intersection(set(CVI), set(CVI)) -> set(CVI).
intersection(First, Second) ->
    {Larger, Smaller} = order(First, Second),
    take(Larger, to_list(Smaller)).