:: Ord a => [a] -> [a] -package:list-t -package:extra -package:Cabal -package:safe -package:integration -package:ghc -package:lifted-base -package:imports -package:Cabal-syntax -package:hedgehog -package:generic-deriving -package:containers -package:amazonka-core -package:base-prelude -package:incipit-base -package:vector-algorithms -package:base

tailSafe [] = []
tailSafe [1,3,4] = [3,4]
Sort a vector.
Sort a vector.
Removes duplicate elements from a list, keeping only the first occurrence. This is asymptotically faster than using nub from Data.List.
>>> ordNub [3,2,1,3,2,1]
[3,2,1]
A minimum that fails using mzero
A maximum that fails using mzero
all nodes of a tree
O(n) Convert a vector to a list.
Take a parser that may consume input, and on failure, go back to where we started and fail as if we didn't consume input.