>>> sort [1,6,4,3,2,5] [1,2,3,4,5,6]The argument must be finite.
nubIntOn fromEnum xs
nubOrd "this is a test" == "this ae" nubOrd (take 4 ("this" ++ undefined)) == "this" \xs -> nubOrd xs == nub xs
nubSort "this is a test" == " aehist" \xs -> nubSort xs == nub (sort xs)
>>> sort [1,6,4,3,2,5] [1,2,3,4,5,6]
> 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]
>>> tail [1, 2, 3] [2,3] >>> tail [1] [] >>> tail [] *** Exception: Prelude.tail: empty listWARNING: This function is partial. You can use case-matching or uncons instead.