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

tail :: [a] -> [a]
lens Control.Lens.Internal.Doctest
vectorSort :: (Vector v e, Ord e) => v e -> v e
mono-traversable Data.Sequences
Sort a vector.
nub :: forall v e . (Vector v e, Ord e) => v e -> v e
vector-algorithms Data.Vector.Algorithms
The nub function which removes duplicate elements from a vector.
gsort :: (Ord e, Vector v e) => v e -> v e
statistics Statistics.Function
Sort a vector.
ordNub :: (Witherable t, Ord a) => t a -> t a
witherable Data.Witherable Witherable
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]
nodesTree :: Tree t => t a -> [a]
hxt Data.Tree.Class
all nodes of a tree
toList :: Vector v a => v a -> [a]
vector Data.Vector.Generic
O(n) Convert a vector to a list.
try :: Parsing m => m a -> m a
parsers Text.Parser.Combinators
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.