X-Git-Url: https://git.xandkar.net/?p=hope.git;a=blobdiff_plain;f=src%2Fhope_kv_list.erl;h=f4ee72ea731dbf324d0c9fe15f7ac1c408dc40ec;hp=12dbcd2e838a585efe9a781239f2b8b6432f9f19;hb=fa24061d65e74509ce66bbff0a6c99cbe33e9ddb;hpb=37c6e98b7b4b018972e0e6bdc557b266277fe353 diff --git a/src/hope_kv_list.erl b/src/hope_kv_list.erl index 12dbcd2..f4ee72e 100644 --- a/src/hope_kv_list.erl +++ b/src/hope_kv_list.erl @@ -14,18 +14,27 @@ , get/2 , set/3 , update/3 + , pop/2 , iter/2 , map/2 , filter/2 , fold/3 , of_kv_list/1 , to_kv_list/1 + , validate_unique_presence/2 % Assume default optional parameter(s) + , validate_unique_presence/3 % Specify optional parameter(s) ]). -type t(K, V) :: [{K, V}]. +-type presence_error(A) :: + {keys_missing , [A]} + | {keys_duplicated , [A]} + | {keys_unsupported , [A]} + . + %% ============================================================================ %% API @@ -36,48 +45,122 @@ empty() -> []. +-spec get(t(K, V), K) -> + hope_option:t(V). get(T, K) -> case lists:keyfind(K, 1, T) of false -> none ; {K, V} -> {some, V} end. +-spec set(t(K, V), K, V) -> + t(K, V). set(T, K, V) -> lists:keystore(K, 1, T, {K, V}). +-spec update(t(K, V), K, fun((hope_option:t(V)) -> V)) -> + t(K, V). update(T, K, F) -> V1Opt = get(T, K), V2 = F(V1Opt), % TODO: Eliminate the 2nd lookup. set(T, K, V2). -iter(T, Map1) -> - Map2 = lift_map_into_list(Map1), - lists:foreach(Map2, T). - -map(T, Map1) -> - Map2 = lift_map_into_list(Map1), - lists:map(Map2, T). - -filter(T, Map1) -> - Map2 = lift_map_into_list(Map1), - lists:filter(Map2, T). +-spec pop(t(K, V), K) -> + {hope_option:t(V), t(K, V)}. +pop(T1, K) -> + case lists:keytake(K, 1, T1) + of {value, {K, V}, T2} -> {{some, V}, T2} + ; false -> {none , T1} + end. +-spec iter(t(K, V), fun((K, V) -> ok)) -> + ok. +iter(T, F1) -> + F2 = lift_map(F1), + lists:foreach(F2, T). + +-spec map(t(K, V), fun((K, V) -> V)) -> + t(K, V). +map(T, F1) -> + F2 = fun ({K, _}=X) -> {K, apply_map(F1, X)} end, + lists:map(F2, T). + +-spec filter(t(K, V), fun((K, V) -> boolean())) -> + t(K, V). +filter(T, F1) -> + F2 = lift_map(F1), + lists:filter(F2, T). + +-spec fold(t(K, V), fun((K, V, Acc) -> Acc), Acc) -> + Acc. fold(T, F1, Accumulator) -> F2 = fun ({K, V}, Acc) -> F1(K, V, Acc) end, - lists:foldl(F2, T, Accumulator). + lists:foldl(F2, Accumulator, T). +-spec to_kv_list(t(K, V)) -> + [{K, V}]. to_kv_list(T) -> T. +-spec of_kv_list([{K, V}]) -> + t(K, V). of_kv_list(List) -> % TODO: Decide if validation is to be done here. Do so if yes. List. +-spec validate_unique_presence(t(K, _V), [K]) -> + hope_result:t(ok, [presence_error(K)]). +validate_unique_presence(T, KeysRequired) -> + KeysOptional = [], + validate_unique_presence(T, KeysRequired, KeysOptional). + +-spec validate_unique_presence(t(K, _V), [K], [K]) -> + hope_result:t(ok, [presence_error(K)]). +validate_unique_presence(T, KeysRequired, KeysOptional) -> + KeysSupported = KeysRequired ++ KeysOptional, + KeysGiven = [K || {K, _V} <- T], + KeysGivenUnique = lists:usort(KeysGiven), + KeysDups = lists:usort(KeysGiven -- KeysGivenUnique), + KeysMissing = KeysRequired -- KeysGivenUnique, + KeysUnsupported = KeysGivenUnique -- KeysSupported, + case {KeysDups, KeysMissing, KeysUnsupported} + of {[], [], []} -> + {ok, ok} + ; {Dups, Missing, Unsupported} -> + ErrorDups = + case Dups + of [] -> [] + ; [_|_] -> [{keys_duplicated, Dups}] + end, + ErrorMissing = + case Missing + of [] -> [] + ; [_|_] -> [{keys_missing, Missing}] + end, + ErrorUnsupported = + case Unsupported + of [] -> [] + ; [_|_] -> [{keys_unsupported, Unsupported}] + end, + Errors = ErrorDups ++ ErrorMissing ++ ErrorUnsupported, + {error, Errors} + end. + %% ============================================================================ %% Helpers %% ============================================================================ -lift_map_into_list(Map) -> - fun ({K, V}) -> {K, Map(K, V)} end. +-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).