:: Ord a => [a] -> [a] -package:errors -package:Cabal -package:safe -is:exact package:ghc

Remove duplicates but keep elements in order. O(n * log n)

cycle ties a finite list into a circular one, or equivalently, the infinite repetition of the original list. It is the identity on infinite lists.

>>> cycle []
*** Exception: Prelude.cycle: empty list

>>> cycle [42]
[42,42,42,42,42,42,42,42,42,42...

>>> cycle [2, 5, 7]
[2,5,7,2,5,7,2,5,7,2,5,7...

Extract the elements after the head of a list, which must be non-empty.

>>> tail [1, 2, 3]
[2,3]

>>> tail [1]
[]

>>> tail []
*** Exception: Prelude.tail: empty list

WARNING: This function is partial. You can use case-matching or uncons instead.

Return all the elements of a list except the last one. The list must be non-empty.

>>> init [1, 2, 3]
[1,2]

>>> init [1]
[]

>>> init []
*** Exception: Prelude.init: empty list

WARNING: This function is partial. You can use reverse with case-matching or uncons instead.

reverse xs returns the elements of xs in reverse order. xs must be finite.

>>> reverse []
[]

>>> reverse [42]
[42]

>>> reverse [2,5,7]
[7,5,2]

>>> reverse [1..]
* Hangs forever *

Temporarily install standard signal handlers for catching ^C, which just throw an exception in the current thread.