1 %%%----------------------------------------------------------------------------
2 %%% Equivalent to stdlib's orddict, but with a pretty (IMO), uniform interface.
3 %%%----------------------------------------------------------------------------
6 -behavior(hope_dictionary).
31 %% ============================================================================
33 %% ============================================================================
40 -spec get(t(K, V), K) ->
43 case lists:keyfind(K, 1, T)
48 -spec set(t(K, V), K, V) ->
51 lists:keystore(K, 1, T, {K, V}).
53 -spec update(t(K, V), K, fun((hope_option:t(V)) -> V)) ->
58 % TODO: Eliminate the 2nd lookup.
61 -spec pop(t(K, V), K) ->
62 {hope_option:t(V), t(K, V)}.
64 case lists:keytake(K, 1, T1)
65 of {value, {K, V}, T2} -> {{some, V}, T2}
66 ; false -> {none , T1}
69 -spec iter(t(K, V), fun((K, V) -> ok)) ->
75 -spec map(t(K, V), fun((K, V) -> V)) ->
78 F2 = fun ({K, _}=X) -> {K, apply_map(F1, X)} end,
81 -spec filter(t(K, V), fun((K, V) -> boolean())) ->
87 -spec fold(t(K, V), fun((K, V, Acc) -> Acc), Acc) ->
89 fold(T, F1, Accumulator) ->
90 F2 = fun ({K, V}, Acc) -> F1(K, V, Acc) end,
91 lists:foldl(F2, Accumulator, T).
93 -spec to_kv_list(t(K, V)) ->
98 -spec of_kv_list([{K, V}]) ->
101 % TODO: Decide if validation is to be done here. Do so if yes.
105 %% ============================================================================
107 %% ============================================================================
111 when F :: fun(( K, V1 ) -> V2)
112 , G :: fun(({K, V1}) -> V2)
115 fun (X) -> apply_map(F, X) end.
117 -spec apply_map(fun((K, V1) -> V2), {K, V1}) ->
119 apply_map(F, {K, V}) ->