|Did you know ...||Search Documentation:|
|library(pairs): Operations on key-value lists|
This module implements common operations on Key-Value lists, also
known as Pairs. Pairs have great practical value, especially due
keysort/2 and the
This library is based on disussion in the SWI-Prolog mailinglist, including specifications from Quintus and a library proposal by Richard O'Keefe.
Deterministic if any argument is instantiated to a finite list and the others are either free or finite lists. All three lists are in the same order.
pairs_keys_values(Pairs, _, Values)
pairs_keys_values(Pairs, Keys, _)
?- group_pairs_by_key([a-2, a-1, b-4, a-3], X). X = [a-[2,1], b-, a-]
Sorting the list of pairs before grouping can be used to group all values associated with a key. For example, finding all values associated with the largest key:
?- sort(1, @>=, [a-1, b-2, c-3, a-4, a-5, c-6], Ps), group_pairs_by_key(Ps, [K-Vs|_]). K = c, Vs = [3, 6].
In this example, sorting by key only (first argument of sort/4 is 1) ensures that the order of the values in the original list of pairs is maintained.
|Joined||List of Key-Group, where Group is the list of Values associated with equivalent consecutive Keys in the same order as they appear in Pairs.|
map_list_to_pairs(length, ListOfLists, Pairs),