No repeats allows each indiv answer returned by prolog to be unique. Removes duplicate answers.
- @author Douglas R. Miles
- @license LGPL
- must_not_repeat(:GoalC) is semidet
- Must Be Successfull Not Repeat.
- no_repeats(:Goal) is semidet
- No Repeats.
- no_repeats(+Vs, :Goal) is semidet
- No Repeats.
- no_repeats_old(:Goal) is semidet
- No Repeats Old.
- no_repeats_old(+Vs, :Goal) is semidet
- No Repeats Old.
- no_repeats_u(+Vs, :Goal) is semidet
- No Repeats For User Code.
- subtract_eq(+Set, +Delete, -Result) is det
- Delete all elements in Delete from Set. Deletion is based on unification using ==/2. The complexity is |Delete|*|Set|.
- subtract_eq(:TermE, ?Delete, ?Result) is semidet
- Subtract Using (==/2) (or =@=/2) ).
- no_repeats_findall5(+Vs, :Goal, -ExitDET, -USE, -NEW) is semidet
- No Repeats Findall5.
- no_repeats_save(+Vs, :Goal, -Saved, -USE) is semidet
- No Repeats Save.
- no_repeats_save(+Vs, :Goal) is semidet
- No Repeats Save.
- no_repeats_findall_r(+Vs, :Goal, -CONS, -ExitDET, -List) is semidet
- No Repeats Findall R.
- no_repeats_var(+Var) is det
- Attribute a varaible to never be bound to the same value twice
?- no_repeats_var(X),member(X,[1,2,3,3,3,1,2,3]).
X = 1;
X = 2;
X = 3;
No.
Undocumented predicates
The following predicates are exported, but not or incorrectly documented.
- no_repeats_cmp(Arg1, Arg2, Arg3)