|Did you know ...||Search Documentation:|
|Pack wam_common_lisp -- prolog/wam_cl/compat/utils_higher_order.pl|
The following predicates are exported from this file while their implementation is defined in imported modules or non-module files loaded by this module.
?- complement([1-[3,5],2-,3-, 4-[1,2,7,5],5-,6-,7-,8-], NL). NL = [1-[2,4,6,7,8],2-[1,3,5,6,7,8],3-[1,2,4,5,6,7,8], 4-[3,5,6,8],5-[1,2,3,4,6,7,8],6-[1,2,3,4,5,7,8], 7-[1,2,3,4,5,6,8],8-[1,2,3,4,5,6,7]]
call(Pred, X)succeeds and Excluded contains the remaining elements.
foldlfamily of predicates is defined as follows, with V0 an initial value and V the final value of the folding operation:
foldl(G, [X_11, ..., X_1n], [X_21, ..., X_2n], ..., [X_m1, ..., X_mn], V0, V) :- call(G, X_11, ..., X_m1, V0, V1), call(G, X_12, ..., X_m2, V1, V2), ... call(G, X_1n, ..., X_mn, V<n-1>, V).
No implementation for a corresponding
foldr is given. A
implementation would consist in first calling reverse/2 on each of
the m input lists, then applying the appropriate
foldl. This is
actually more efficient than using a properly programmed-out
recursive algorithm that cannot be tail-call optimized.
The following predicates are exported, but not or incorrectly documented.