Hoogle Search
Within LTS Haskell 24.31 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
sortVTupleSequentialMedian3or5IO :: MVector RealWorld (Int32, Int32) -> IO ()vector-quicksort Data.Vector.Algorithms.Quicksort.Predefined.VTupleSequentialMedian3or5IO No documentation available.
sortVTupleSequentialMedian3or5ST :: MVector s (Int32, Int32) -> ST s ()vector-quicksort Data.Vector.Algorithms.Quicksort.Predefined.VTupleSequentialMedian3or5ST No documentation available.
sortChildrenOn :: (Ord b, Tree t) => (a -> b) -> t a -> ListT (ItemM t) aListTree Data.List.Tree No documentation available.
sortBy :: SemiSequence seq => (Element seq -> Element seq -> Ordering) -> seq -> seqclassy-prelude-yesod ClassyPrelude.Yesod Sort a sequence using an supplied element ordering function.
> let compare' x y = case compare x y of LT -> GT; EQ -> EQ; GT -> LT > sortBy compare' [5,3,6,1,2,4] [6,5,4,3,2,1]
sortOn :: (Ord o, SemiSequence seq) => (Element seq -> o) -> seq -> seqclassy-prelude-yesod ClassyPrelude.Yesod Same as sortBy . comparing. Since 0.7.0
sortWith :: (Ord a, IsSequence c) => (Element c -> a) -> c -> cclassy-prelude-yesod ClassyPrelude.Yesod Sort elements using the user supplied function to project something out of each element. Inspired by http://hackage.haskell.org/packages/archive/base/latest/doc/html/GHC-Exts.html#v:sortWith.
sortNoDup :: Ord a => [a] -> [a]dobutokO2 DobutokO.Sound.Functional.Params For the list of a from the Ord class it builds a sorted in the ascending order list without duplicates.
sortNoDup [2,1,4,5,6,78,7,7,5,4,3,2,5,4,2,4,54,3,5,65,4,3,54,56,43,5,2] = [1,2,3,4,5,6,7,43,54,56,65,78]
sORTKind_maybe :: Kind -> Maybe (TypeOrConstraint, Type)ghc-lib GHC.Plugins No documentation available.
sortHoleFitsByGraph :: [HoleFit] -> TcM [HoleFit]ghc-lib GHC.Tc.Errors.Hole No documentation available.
sortHoleFitsBySize :: [HoleFit] -> TcM [HoleFit]ghc-lib GHC.Tc.Errors.Hole Sort by size uses as a measure for relevance the sizes of the different types needed to instantiate the fit to the type of the hole. This is much quicker than sorting by subsumption, and gives reasonable results in most cases.