Re-exported predicates

The following predicates are exported from this file while their implementation is defined in imported modules or non-module files loaded by this module.

 select(?Elem, ?List1, ?List2)

Is true when List1, with Elem removed, results in List2. This implementation is determinsitic if the last element of List1 has been selected.

 union(+Set1, +Set2, -Set3) is det

True if Set3 unifies with the union of the lists Set1 and Set2. The complexity of this predicate is |Set1|*|Set2|. A set is defined to be an unordered list without duplicates. Elements are considered duplicates if they can be unified.

See also

- ord_union/3

 subset(+SubSet, +Set) is semidet

True if all elements of SubSet belong to Set as well. Membership test is based on memberchk/2. The complexity is |SubSet|*|Set|. A set is defined to be an unordered list without duplicates. Elements are considered duplicates if they can be unified.

See also

- ord_subset/2.

 subtract(+Set, +Delete, -Result) is det

Delete all elements in Delete from Set. Deletion is based on unification using memberchk/2. The complexity is |Delete|*|Set|. A set is defined to be an unordered list without duplicates. Elements are considered duplicates if they can be unified.

See also

- ord_subtract/3.

Undocumented predicates

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

 add_element(Arg1, Arg2, Arg3)

 del_element(Arg1, Arg2, Arg3)

 disjoint(Arg1)

 disjoint(Arg1, Arg2)

 intersect(Arg1, Arg2)

 intersect(Arg1, Arg2, Arg3)

 listtoset(Arg1, Arg2)

 memberchk(Arg1, Arg2)

 pairfrom(Arg1, Arg2, Arg3, Arg4)

 seteq(Arg1, Arg2)

 symdiff(Arg1, Arg2, Arg3)