- Documentation
- Reference manual
- The SWI-Prolog library
- library(lists): List Manipulation
- member/2
- append/3
- append/2
- prefix/2
- select/3
- selectchk/3
- select/4
- selectchk/4
- nextto/3
- delete/3
- nth0/3
- nth1/3
- nth0/4
- nth1/4
- last/2
- proper_length/2
- same_length/2
- reverse/2
- permutation/2
- flatten/2
- max_member/2
- min_member/2
- sum_list/2
- max_list/2
- min_list/2
- numlist/3
- is_set/1
- list_to_set/2
- intersection/3
- union/3
- subset/2
- subtract/3
- library(lists): List Manipulation
- The SWI-Prolog library
- Packages
- Reference manual
==
E2 holds. The complexity
of the implementation is N*log(N)
.
- Errors
- List is type-checked.
- See also
- sort/2 can be used to
create an ordered set. Many set operations on ordered sets are order N
rather than order N
**
2. The list_to_set/2 predicate is more expensive than sort/2 because it involves, two sorts and a linear scan. - Compatibility
- Up to version 6.3.11, list_to_set/2
had complexity N
**
2 and equality was tested using =/2.