|Did you know ...||Search Documentation:|
|Finding all Solutions to a Goal|
findall(Templ, Goal, Bag) :- findall(Templ, Goal, Bag, )
count(N)is accepted. Using
count(N), the size of the next chunk can be controlled using nb_setarg/3. The non-deterministic behaviour used to implement the chunk option in
library(pengines). Based on Ciao, but the Ciao version is deterministic. Portability can be achieved by wrapping the goal in once/1. Below are three examples. The first illustrates standard chunking of answers. The second illustrates that the chunk size can be adjusted dynamically and the last illustrates that no choice point is left if Goal leaves no choice-point after the last solution.
?- findnsols(5, I, between(1, 12, I), L). L = [1, 2, 3, 4, 5] ; L = [6, 7, 8, 9, 10] ; L = [11, 12]. ?- State = count(2), findnsols(State, I, between(1, 12, I), L), nb_setarg(1, State, 5). State = count(5), L = [1, 2] ; State = count(5), L = [3, 4, 5, 6, 7] ; State = count(5), L = [8, 9, 10, 11, 12]. ?- findnsols(4, I, between(1, 4, I), L). L = [1, 2, 3, 4].
+Vartells bagof/3 not to bind Var in Goal. bagof/3 fails if Goal has no solutions.
The example below illustrates bagof/3
^ operator. The variable bindings
are printed together on one line to save paper.
2 ?- listing(foo). foo(a, b, c). foo(a, b, d). foo(b, c, e). foo(b, c, f). foo(c, c, g). true. 3 ?- bagof(C, foo(A, B, C), Cs). A = a, B = b, C = G308, Cs = [c, d] ; A = b, B = c, C = G308, Cs = [e, f] ; A = c, B = c, C = G308, Cs = [g]. 4 ?- bagof(C, A^foo(A, B, C), Cs). A = G324, B = b, C = G326, Cs = [c, d] ; A = G324, B = c, C = G326, Cs = [e, f, g]. 5 ?-