Hoogle Search
Within LTS Haskell 24.32 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
isSortedBy :: (a -> a -> Ordering) -> [a] -> Boolghc GHC.Utils.Misc No documentation available.
nubSort :: Ord a => [a] -> [a]ghc GHC.Utils.Misc No documentation available.
-
ghc GHC.Utils.Outputable Determines the form of possessive appropriate for the length of a list:
itsOrTheir [x] = text "its" itsOrTheir [x,y] = text "their" itsOrTheir [] = text "their" -- probably avoid this
-
ghc GHC.Utils.Outputable Determines the form of subject appropriate for the length of a list:
thisOrThese [x] = text "This" thisOrThese [x,y] = text "These" thisOrThese [] = text "These" -- probably avoid this
-
ghc Language.Haskell.Syntax.Type Haskell Tuple Sort
unsorted :: Verbosity -> [FilePath] -> [ModuleName] -> IO [ModuleName]Cabal Distribution.Simple.PreProcess Just present the modules in the order given; this is the default and it is appropriate for preprocessors which do not have any sort of dependencies between modules.
-
hspec-discover Test.Hspec.Discover.Sort No documentation available.
naturalSortKey :: String -> NaturalSortKeyhspec-discover Test.Hspec.Discover.Sort No documentation available.
qsortWithData :: (HasCallStack, MonadIO m) => Ptr () -> Int32 -> CSize -> CompareDataFunc -> m ()gi-glib GI.GLib.Functions This is just like the standard C qsort() function, but the comparison routine accepts a user data argument. This is guaranteed to be a stable sort since version 2.32.
asyncQueuePushSorted :: (HasCallStack, MonadIO m) => AsyncQueue -> Ptr () -> CompareDataFunc -> m ()gi-glib GI.GLib.Structs.AsyncQueue Inserts data into queue using func to determine the new position. This function requires that the queue is sorted before pushing on new elements, see asyncQueueSort. This function will lock queue before it sorts the queue and unlock it when it is finished. For an example of func see asyncQueueSort. Since: 2.10