| 書式 | min(+A, +B, ?Min) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 引数 |
| |||||||||
| Calculates the minimum between A and B, or succeeds if the minimum is equal to Min | ||||||||||
| 書式 | lmin(+L, ?Min) | ||||||
|---|---|---|---|---|---|---|---|
| 引数 |
| ||||||
| Calculates the minimum of all numbers given in the list L, or succeeds if the minimum is equal to Min | |||||||
| 書式 | max(+A, +B, ?Max) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 引数 |
| |||||||||
| Calculates the maximum between A and B, or succeeds if the maximum is equal to Max | ||||||||||
| 書式 | lmax(+L, ?Max) | ||||||
|---|---|---|---|---|---|---|---|
| 引数 |
| ||||||
| Calculates the maximum of all numbers given in the list L, or succeeds if the maximum is equal to Max | |||||||
| 書式 | qsort_divide(+List, +Pivot, +CmpPred, +LeftIn, +RightIn, -LeftOut, -RightOut) | |||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 引数 |
| |||||||||||||||||||||
| sorts elements to the left and right | ||||||||||||||||||||||
| 書式 | qsort(+List, +CmpPred, -Sorted) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 引数 |
| |||||||||
| sorts the elements in List according to the comparison prediate with QuickSort | ||||||||||
| 書式 | repeat |
|---|---|
| succeeds over and over. To be used in backtracking | |
| 書式 | while(+P) | |||
|---|---|---|---|---|
| 引数 |
| |||
| succeeds as long as P succeeds.
NOTE: P does NOT backtrack and is NOT bound/unified, e.g.: "?- while(member(E,[1,2])), print(E), fail." will NOT print "1,2", but result in an endless loop where E is always 'bot'! To achieve the intended effect, use 'pforall' instead, e.g., ":- pforall((member(E,[1,2]), print(E)))." 'while' is useful for looping on arrays other predicates that normally only succeed only once, e.g.: ?- set_var(v1,0), while((get_var(v1,$V), $V < 5)), get_var(v1,$V), print($V), increment(v1), fail. (Here please note that since $V is not bound after 'while', the value of the variable has to be fetched again). | ||||
| 書式 | forwhile(Var,L,P) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 引数 |
| |||||||||
| increments the variable starting from L, as long as the predicate succeeds NOTE: P is NOT bound and does NOT backtrack! See also above under 'while' | ||||||||||