%%%---------------------------------------------------------------------------- %%% Equivalent to stdlib's orddict, but with a pretty (IMO), uniform interface. %%%---------------------------------------------------------------------------- -module(hope_kv_list). -behavior(hope_dictionary). -export_type( [ t/2 ]). -export( [ empty/0 , get/2 , set/3 , update/3 , pop/2 , iter/2 , map/2 , filter/2 , fold/3 , of_kv_list/1 , to_kv_list/1 ]). -type t(K, V) :: [{K, V}]. %% ============================================================================ %% API %% ============================================================================ -spec empty() -> []. empty() -> []. get(T, K) -> case lists:keyfind(K, 1, T) of false -> none ; {K, V} -> {some, V} end. set(T, K, V) -> lists:keystore(K, 1, T, {K, V}). update(T, K, F) -> V1Opt = get(T, K), V2 = F(V1Opt), % TODO: Eliminate the 2nd lookup. set(T, K, V2). pop(T1, K) -> case lists:keytake(K, 1, T1) of {value, {K, V}, T2} -> {{some, V}, T2} ; false -> {none , T1} end. iter(T, F1) -> F2 = lift_map(F1), lists:foreach(F2, T). map(T, F1) -> F2 = fun ({K, _}=X) -> {K, apply_map(F1, X)} end, lists:map(F2, T). filter(T, F1) -> F2 = lift_map(F1), lists:filter(F2, T). fold(T, F1, Accumulator) -> F2 = fun ({K, V}, Acc) -> F1(K, V, Acc) end, lists:foldl(F2, T, Accumulator). to_kv_list(T) -> T. of_kv_list(List) -> % TODO: Decide if validation is to be done here. Do so if yes. List. %% ============================================================================ %% Helpers %% ============================================================================ -spec lift_map(F) -> G when F :: fun(( K, V1 ) -> V2) , G :: fun(({K, V1}) -> V2) . lift_map(F) -> fun (X) -> apply_map(F, X) end. -spec apply_map(fun((K, V1) -> V2), {K, V1}) -> V2. apply_map(F, {K, V}) -> F(K, V).