- Documentation
- Reference manual
- Summary
- Library predicates
- library(aggregate)
- library(ansi_term)
- library(apply)
- library(assoc)
- library(broadcast)
- library(charsio)
- library(check)
- library(clpb)
- library(clpfd)
- library(clpqr)
- library(csv)
- library(dcgbasics)
- library(dcghighorder)
- library(debug)
- library(dicts)
- library(error)
- library(exceptions)
- library(fastrw)
- library(explain)
- library(help)
- library(gensym)
- library(heaps)
- library(increval)
- library(intercept)
- library(iostream)
- library(listing)
- library(lists)
- library(macros)
- library(main)
- library(occurs)
- library(option)
- library(optparse)
- library(ordsets)
- library(persistency)
- library(portraytext)
- library(predicate_options)
- library(prologcoverage)
- library(prologdebug)
- library(prologjiti)
- library(prologpack)
- library(prologversions)
- library(prologtrace)
- library(prologxref)
- library(pairs)
- library(pio)
- library(random)
- library(rbtrees)
- library(readutil)
- library(record)
- library(registry)
- library(rwlocks)
- library(settings)
- library(simplex)
- library(statistics)
- library(terms)
- library(ugraphs)
- library(url)
- library(www_browser)
- library(solution_sequences)
- library(thread)
- library(thread_pool)
- library(varnumbers)
- library(yall)
- Library predicates
- Summary
- Packages
- Reference manual
F.2.59 library(solution_sequences)
| call_nth/2 | True when Goal succeeded for the Nth time. |
| distinct/1 | True if Goal is true and no previous solution of Goal bound Witness to the same value. |
| distinct/2 | True if Goal is true and no previous solution of Goal bound Witness to the same value. |
| group_by/4 | Group bindings of Template that have the same value for By. |
| limit/2 | Limit the number of solutions. |
| offset/2 | Ignore the first Count solutions. |
| order_by/2 | Order solutions according to Spec. |
| reduced/1 | Similar to distinct/1, but does not guarantee unique results in return for using a limited amount of memory. |
| reduced/3 | Similar to distinct/1, but does not guarantee unique results in return for using a limited amount of memory. |