Did you know ... Search Documentation:
Pack wam_common_lisp -- prolog/wam_cl/compat/utils_higher_order.pl
PublicShow source

Re-exported predicates

The following predicates are re-exported from other modules

 complement(+UGraphIn, -UGraphOut)
UGraphOut is a ugraph with an edge between all vertices that are not connected in UGraphIn and all edges from UGraphIn removed.
To be done
- Simple two-step algorithm. You could be smarter, I suppose.
 partition(:Pred, +List, ?Included, ?Excluded) is det
Filter elements of List according to Pred. True if Included contains all elements for which call(Pred, X) succeeds and Excluded contains the remaining elements.
 foldl(:Goal, +List, +V0, -V)
 foldl(:Goal, +List1, +List2, +V0, -V)
 foldl(:Goal, +List1, +List2, +List3, +V0, -V)
 foldl(:Goal, +List1, +List2, +List3, +List4, +V0, -V)
Fold a list, using arguments of the list as left argument. The foldl family of predicates is defined by:
foldl(P, [X11,...,X1n], ..., [Xm1,...,Xmn], V0, Vn) :-
      P(X11, ..., Xm1, V0, V1),
      P(X1n, ..., Xmn, V', Vn).

Undocumented predicates

The following predicates are exported, but not or incorrectly documented.

 lpa_apply(Arg1, Arg2)
 identity(Arg1, Arg2)
 every(Arg1, Arg2)
 some(Arg1, Arg2)
 somechk(Arg1, Arg2)
 map(Arg1, Arg2, Arg3)
 filter(Arg1, Arg2, Arg3)
 mapfilter(Arg1, Arg2, Arg3)
 foldl1(Arg1, Arg2, Arg3)
 foldr(Arg1, Arg2, Arg3, Arg4)
 foldr1(Arg1, Arg2, Arg3)