:: Ord a => [a] -> [a] is:exact -package:extra -package:integration -package:base -package:ghc -package:Cabal-syntax -package:witherable -package:hedgehog -package:imports -package:containers -package:incipit-base -package:base-prelude -package:amazonka-core

ordNub :: Ord a => [a] -> [a]
Cabal Distribution.Simple.Utils
Like nub, but has O(n log n) complexity instead of O(n^2). Code for ordNub and listUnion taken from Niklas Hambüchen's ordnub package.
ordNubRight :: Ord a => [a] -> [a]
Cabal Distribution.Simple.Utils
A right-biased version of ordNub. Example: 
>>> ordNub [1,2,1] :: [Int]
[1,2]

>>> ordNubRight [1,2,1] :: [Int]
[2,1]
safeTail :: [a] -> [a]
Cabal Distribution.Simple.Utils
A total variant of tail.
safeInit :: [a] -> [a]
Cabal Distribution.Simple.Utils
A total variant of init.
reverse :: [a] -> [a]
basement Basement.Compat.ExtList
tailSafe :: [a] -> [a]
errors Control.Error, safe Safe
tailSafe [] = []
tailSafe [1,3,4] = [3,4]
initSafe :: [a] -> [a]
errors Control.Error, safe Safe
tail :: [a] -> [a]
lens Control.Lens.Internal.Doctest
tailErr :: Partial => [a] -> [a]
safe Safe
Identical to tail, namely that fails on an empty list. Useful to avoid the x-partial warning introduced in GHC 9.8. 
tailErr [] = error "Prelude.tail: empty list"
tailErr [1,2,3] = [2,3]
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.
minimumZ :: MonadPlus m => Ord a => [a] -> m a
errors Control.Error.Safe
A minimum that fails using mzero
maximumZ :: MonadPlus m => Ord a => [a] -> m a
errors Control.Error.Safe
A maximum that fails using mzero
runInBoundThread :: MonadBaseControl IO m => m a -> m a
lifted-base Control.Concurrent.Lifted
Generalized version of runInBoundThread.
runInUnboundThread :: MonadBaseControl IO m => m a -> m a
lifted-base Control.Concurrent.Lifted
Generalized version of runInUnboundThread.
mask_ :: MonadBaseControl IO m => m a -> m a
lifted-base Control.Exception.Lifted
Generalized version of mask_.
uninterruptibleMask_ :: MonadBaseControl IO m => m a -> m a
lifted-base Control.Exception.Lifted
Generalized version of uninterruptibleMask_.
gtoList :: GFoldable t => t a -> [a]
generic-deriving Generics.Deriving.Foldable
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.