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.
groupSortOn :: Ord b => (a -> b) -> [a] -> [[a]]extra Extra A combination of group and sort, using a part of the value to compare on.
groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
nubSort :: Ord a => [a] -> [a]extra Extra O(n log n). The nubSort function sorts and removes duplicate elements from a list. In particular, it keeps only the first occurrence of each element.
nubSort "this is a test" == " aehist" \xs -> nubSort xs == nub (sort xs)
nubSortBy :: (a -> a -> Ordering) -> [a] -> [a]extra Extra A version of nubSort with a custom predicate.
nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
nubSortOn :: Ord b => (a -> b) -> [a] -> [a]extra Extra A version of nubSort which operates on a portion of the value.
nubSortOn length ["a","test","of","this"] == ["a","of","test"]
Opt_SortBySizeHoleFits :: GeneralFlagghc GHC No documentation available.
Opt_SortBySubsumHoleFits :: GeneralFlagghc GHC No documentation available.
Opt_SortValidHoleFits :: GeneralFlagghc GHC No documentation available.
topSortModuleGraph :: Bool -> ModuleGraph -> Maybe HomeUnitModule -> [SCC ModuleGraphNode]ghc GHC Topological sort of the module graph Calculate SCCs of the module graph, possibly dropping the hi-boot nodes The resulting list of strongly-connected-components is in topologically sorted order, starting with the module(s) at the bottom of the dependency graph (ie compile them first) and ending with the ones at the top. Drop hi-boot nodes (first boolean arg)?
- False: treat the hi-boot summaries as nodes of the graph, so the graph must be acyclic
- True: eliminate the hi-boot nodes, and instead pretend the a source-import of Foo is an import of Foo The resulting graph has no hi-boot nodes, but can be cyclic
-
ghc GHC.Builtin.Names No documentation available.
-
ghc GHC.Builtin.Names No documentation available.