See also

- https://sicstus.sics.se/sicstus/docs/4.6.0/html/sicstus.html/lib_002dlists.html

To be done

- This library is incomplete. As of SICStus 4.6.0, the following predicates are missing:

• append/5
• correspond/4
• delete/4
• one_longer/2
• perm/2
• perm2/4
• rotate_list/[2,3]
• segment/2
• proper_segment/2
• cumlist/[4,5,6]
• map_product/4
• some/[2,3,4]
• somechk/[2,3,4]
• exclude/[4,5]
• include/[4,5]
• group/[3,4,5]
• ordered/[1,2]
• select_min/[3,4]
• select_max/[3,4]
• increasing_prefix/[3,4]
• decreasing_prefix/[3,4]
• clumps/2
• keyclumps/2
• keyclumped/2

 rev(+List, ?Reversed) is semidet

Same as reverse/2, but List must be a proper list.

 shorter_list(?Short, ?Long) is nondet

True if Short is a shorter list than Long. The lists' contents are insignificant, only the lengths matter. Mode -Short, +Long can be used to enumerate list skeletons shorter than Long.

 prefix(?List, ?Prefix) is nondet

True if Prefix is a prefix of List. Not the same as prefix/2 in SICStus 3 or SWI - the arguments are reversed!

 proper_prefix(?List, ?Prefix) is nondet

True if Prefix is a prefix of List, but is not List itself.

 suffix(?List, ?Prefix) is nondet

True if Suffix is a suffix of List. Not the same as suffix/2 in SICStus 3 - the arguments are reversed!

 proper_suffix(?List, ?Prefix) is nondet

True if Suffix is a suffix of List, but is not List itself.

 scanlist(:Pred, ?Xs, ?V1, ?V) is nondet

 scanlist(:Pred, ?Xs, ?Ys, ?V1, ?V) is nondet

 scanlist(:Pred, ?Xs, ?Ys, ?Zs, ?V1, ?V) is nondet

Same as foldl/[4,5,6].

Compatibility

- SICStus 4

Re-exported predicates

The following predicates are exported from this file while their implementation is defined in imported modules or non-module files loaded by this module.

 transpose(+Matrix, ?Transpose)

Transpose a list of lists of the same length. Example:

?- transpose([[1,2,3],[4,5,6],[7,8,9]], Ts).
Ts = [[1, 4, 7], [2, 5, 8], [3, 6, 9]].

This predicate is useful in many constraint programs. Consider for instance Sudoku:

sudoku(Rows) :-
        length(Rows, 9), maplist(same_length(Rows), Rows),
        append(Rows, Vs), Vs ins 1..9,
        maplist(all_distinct, Rows),
        transpose(Rows, Columns),
        maplist(all_distinct, Columns),
        Rows = [As,Bs,Cs,Ds,Es,Fs,Gs,Hs,Is],
        blocks(As, Bs, Cs), blocks(Ds, Es, Fs), blocks(Gs, Hs, Is).

blocks([], [], []).
blocks([N1,N2,N3|Ns1], [N4,N5,N6|Ns2], [N7,N8,N9|Ns3]) :-
        all_distinct([N1,N2,N3,N4,N5,N6,N7,N8,N9]),
        blocks(Ns1, Ns2, Ns3).

problem(1, [[_,_,_,_,_,_,_,_,_],
            [_,_,_,_,_,3,_,8,5],
            [_,_,1,_,2,_,_,_,_],
            [_,_,_,5,_,7,_,_,_],
            [_,_,4,_,_,_,1,_,_],
            [_,9,_,_,_,_,_,_,_],
            [5,_,_,_,_,_,_,7,3],
            [_,_,2,_,1,_,_,_,_],
            [_,_,_,_,4,_,_,_,9]]).

Sample query:

?- problem(1, Rows), sudoku(Rows), maplist(portray_clause, Rows).
[9, 8, 7, 6, 5, 4, 3, 2, 1].
[2, 4, 6, 1, 7, 3, 9, 8, 5].
[3, 5, 1, 9, 2, 8, 7, 4, 6].
[1, 2, 8, 5, 3, 7, 6, 9, 4].
[6, 3, 4, 8, 9, 2, 1, 5, 7].
[7, 9, 5, 4, 6, 1, 8, 3, 2].
[5, 1, 9, 2, 8, 6, 4, 7, 3].
[4, 7, 2, 3, 1, 9, 5, 6, 8].
[8, 6, 3, 7, 4, 5, 2, 1, 9].
Rows = [[9, 8, 7, 6, 5, 4, 3, 2|...], ... , [...|...]].

 same_length(?List1, ?List2, ?Length) is nondet

True if List1 and List2 both have length Length.

 scanlist(:Pred, ?Xs, ?V1, ?V) is nondet

 scanlist(:Pred, ?Xs, ?Ys, ?V1, ?V) is nondet

 scanlist(:Pred, ?Xs, ?Ys, ?Zs, ?V1, ?V) is nondet

Same as foldl/[4,5,6].

Compatibility

- SICStus 4

 scanlist(:Pred, ?Xs, ?V1, ?V) is nondet

 scanlist(:Pred, ?Xs, ?Ys, ?V1, ?V) is nondet

 scanlist(:Pred, ?Xs, ?Ys, ?Zs, ?V1, ?V) is nondet

Same as foldl/[4,5,6].

Compatibility

- SICStus 4

Undocumented predicates

The following predicates are exported, but not or incorrectly documented.

 subseq0(Arg1, Arg2)

 selectchk(Arg1, Arg2, Arg3, Arg4)

 sublist(Arg1, Arg2, Arg3, Arg4)

 nth1(Arg1, Arg2, Arg3)

 maplist(Arg1, Arg2)

 convlist(Arg1, Arg2, Arg3)

 proper_prefix_length(Arg1, Arg2, Arg3)

 include(Arg1, Arg2, Arg3)

 head(Arg1, Arg2)

 min_member(Arg1, Arg2)

 proper_length(Arg1, Arg2)

 sublist(Arg1, Arg2, Arg3)

 sublist(Arg1, Arg2, Arg3, Arg4, Arg5)

 nth0(Arg1, Arg2, Arg3)

 select(Arg1, Arg2, Arg3, Arg4)

 partition(Arg1, Arg2, Arg3, Arg4, Arg5)

 prefix_length(Arg1, Arg2, Arg3)

 last(Arg1, Arg2, Arg3)

 max_member(Arg1, Arg2)

 permutation(Arg1, Arg2)

 last(Arg1, Arg2)

 maplist(Arg1, Arg2, Arg3, Arg4)

 delete(Arg1, Arg2, Arg3)

 nth1(Arg1, Arg2, Arg3, Arg4)

 proper_suffix_length(Arg1, Arg2, Arg3)

 selectchk(Arg1, Arg2, Arg3)

 append_length(Arg1, Arg2, Arg3)

 append(Arg1, Arg2)

 keys_and_values(Arg1, Arg2, Arg3)

 min_member(Arg1, Arg2, Arg3)

 subseq(Arg1, Arg2, Arg3)

 reverse(Arg1, Arg2)

 is_list(Arg1)

 tail(Arg1, Arg2)

 nextto(Arg1, Arg2, Arg3)

 maplist(Arg1, Arg2, Arg3)

 suffix_length(Arg1, Arg2, Arg3)

 nth0(Arg1, Arg2, Arg3, Arg4)

 select(Arg1, Arg2, Arg3)

 exclude(Arg1, Arg2, Arg3)

 cons(Arg1, Arg2, Arg3)

 append_length(Arg1, Arg2, Arg3, Arg4)

 max_member(Arg1, Arg2, Arg3)

 clumped(Arg1, Arg2)

 remove_dups(Arg1, Arg2)

 same_length(Arg1, Arg2)

 sumlist(Arg1, Arg2)

 subseq1(Arg1, Arg2)