Sorts Library predicates Built-ins

ECLiPSe provides a library of sorting predicates. The order of sorting provided is as defined using the built-in compare/3. The sorts library is   provided in the prolog library file sorts.pl. This library is autoloaded when one of the predicates is first used.    

ECLiPSe Sorts Library predicate.

keysort(+List1, ?List2)

Succeeds if List2 is a sorted list version of List1, whose elements are of the form Key-Value. The sort is done according to the value of the key Key.  

merge(+Key, +Order, +List1, +List2, ?List3)

Succeeds if List3 is a merged list of List1 and List2. If both lists are sorted, List3 will be sorted. The sort is done according to the Key and Order specifications.  

merge(+List1, +List2, ?List3)

Succeeds if List3 is a merged list of List1 and List2. If both lists are sorted, List3 will be sorted.  

msort(+List1, ?List2)

Succeeds if List2 has the same elements as List1 and is sorted.  

prune_instances(+List, ?PrunedList)

Succeeds if PrunedList is the smallest list that subsumes the list List.  

sort(+Key, +Order, +Random, ?Sorted)

Succeeds if Sorted is the sorted list version of Random. The sort is done according to the Key and Order specifications.  

sort(+List1, ?List2)

Succeeds if List2 is the strictly ordered sorted list version of List1.