Hoogle Search
Within LTS Haskell 24.3 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
sort :: Sorting a => [a] -> [a]discrimination Data.Discrimination O(n). Sort a list using discrimination.
sort = sortWith id
sort :: Sorting a => [a] -> [a]discrimination Data.Discrimination.Sorting O(n). Sort a list using discrimination.
sort = sortWith id
sort :: forall a (n :: Nat) . Ord a => NList n a -> NList n aindexed-containers Data.NList Stably sort a list.
sort (mk6 1 4 2 8 5 7) === mk6 1 2 4 5 7 8
sort :: ByteString -> ByteStringrawfilepath Data.ByteString.RawFilePath O(n) Sort a ByteString efficiently, using counting sort.
sort :: Ord a => Vector a -> Vector arrb-vector Data.RRBVector Sort the vector in ascending order. The sort is stable, meaning the order of equal elements is preserved.
-
sized Data.Sized Sorting sequence by ascending order. Since 0.7.0.0
sort :: Ord a => Slist a -> Slist aslist Slist O(n log n). implements a stable sorting algorithm. It is a special case of sortBy. Elements are arranged from from lowest to highest, keeping duplicates in the order they appeared in the input.
>>> sort $ slist [10, 9..1] Slist {sList = [1,2,3,4,5,6,7,8,9,10], sSize = Size 10}
Note: this function hangs on infinite slists.-
stylish-haskell Language.Haskell.Stylish.Step.ModuleHeader No documentation available.
sort :: (SemiSequence seq, Ord (Element seq)) => seq -> seqclassy-prelude-yesod ClassyPrelude.Yesod Sort a ordered sequence.
> sort [4,3,1,2] [1,2,3,4]
sort :: AdExchangeSellerAccountsReportsGenerate -> Maybe [Text]gogol-adexchange-seller Gogol.AdExchangeSeller The name of a dimension or metric to sort the resulting report on, optionally prefixed with "+" to sort ascending or "-" to sort descending. If no prefix is specified, the column is sorted ascending.