Sorting lists

Author(s): Richard A. O'Keefe. All changes by UPM CLIP Group..

Version: 0.4#5 (1998/2/24)

• Usage and interface (sort)
• Documentation on exports (sort)
• Documentation on internals (sort)

Usage and interface (sort)

Documentation on exports (sort)

PREDICATE: sort/2:

sort(List1,List2)

The elements of List1 are sorted into the standard order (see section Comparing terms) and any identical elements are merged, yielding List2. The time and space complexity of this operation is at worst O(N lg N) where N is the length of List1.

Usage: sort(+list,?(list))

• Description: List2 is the sorted list corresponding to List1.

PREDICATE: keysort/2:

keysort(List1,List2)

List1 is sorted into order according to the value of the keys of its elements, yielding the list List2. No merging takes place. This predicate is stable, i.e., if an element A occurs before another element B with the same key in the input, then A will occur before B also in the output. The time and space complexity of this operation is at worst O(N lg N) where N is the length of List1.

Usage: keysort(+keylist,?(keylist))

• Description: List2 is the (key-)sorted list corresponding to List1.

Documentation on internals (sort)

REGTYPE: keypair/1:

Usage: keypair(P)

• Description: P is a pair of the form K-_, where K is considered the key.

Go to the first, previous, next, last section, table of contents.