Documentation

O(n log n). Sorts and remove repetitions. Equivalent to nub . sort.

> nubSort [1,2,3]
[1,2,3]
> nubSort [3,2,1]
[1,2,3]
> nubSort [3,2,1,3,2,1]
[1,2,3]
> nubSort [3,3,1,1,2,2]
[1,2,3]

Like nubSort but allows providing a function to compare values.

O(n log n). Checks that all elements of the first list are elements of the second.

O(n log n). Checks that all elements of the first list are elements of the second.

O(n log n). Checks that all elements are unique. This function is a faster equivalent to the following:

isNub xs  =  nub xs == xs

Examples:

isNub []       =  True
isNub [1,2,3]  =  True
isNub [2,1,2]  =  False

O(n). Like lookup but returns the key itself if nothing is found.

> lookupId 5 [(1,2),(3,4)]
5

> lookupId 5 [(1,2),(3,4),(5,6)]
6

Merges two lists discarding repeated elements.

The argument lists need to be in order.

> [1,10,100] +++ [9,10,11]
[1,9,10,11,100]