[ The ECLiPSe Built-In Predicates | Reference Manual | Alphabetic Index ]All Solutions
Built-ins to collect all solutions to nondeterministic goals
Predicates
- bagof(?Term, +Goal, ?List)
- Succeeds if List is the (non-empty) list of all instances of Term such that
Goal is provable.
- coverof(?Term, +Goal, ?List)
- Succeeds if List is the (non-empty) list of all the most general instances
of Term such that Goal is provable.
- findall(?Term, +Goal, ?List)
- List is the (possibly empty) list of all instances of Term such that Goal
is provable.
- setof(?Term, +Goal, ?List)
- Succeeds if List is the (non-empty) ordered list of all instances of Term
such that Goal is provable.
Generated from allsols.eci on Sat Aug 7 01:44:11 2004