1 %%%----------------------------------------------------------------------------
2 %%% Equivalent to stdlib's orddict, but with a pretty (IMO), uniform interface.
3 %%%----------------------------------------------------------------------------
6 -behavior(hope_dictionary).
30 %% ============================================================================
32 %% ============================================================================
40 case lists:keyfind(K, 1, T)
46 lists:keystore(K, 1, T, {K, V}).
51 % TODO: Eliminate the 2nd lookup.
59 F2 = fun ({K, _}=X) -> {K, apply_map(F1, X)} end,
66 fold(T, F1, Accumulator) ->
67 F2 = fun ({K, V}, Acc) -> F1(K, V, Acc) end,
68 lists:foldl(F2, T, Accumulator).
74 % TODO: Decide if validation is to be done here. Do so if yes.
78 %% ============================================================================
80 %% ============================================================================
84 when F :: fun(( K, V1 ) -> V2)
85 , G :: fun(({K, V1}) -> V2)
88 fun (X) -> apply_map(F, X) end.
90 -spec apply_map(fun((K, V1) -> V2), {K, V1}) ->
92 apply_map(F, {K, V}) ->