Hoogle Search

Within LTS Haskell 24.42 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. allReachable :: Ord key => Graph node -> (node -> key) -> Map key (Set key)

   ghc-lib-parser	GHC.Data.Graph.Directed

   Efficiently construct a map which maps each key to it's set of transitive dependencies. Only works on acyclic input.

2. allReachableCyclic :: Ord key => Graph node -> (node -> key) -> Map key (Set key)

   ghc-lib-parser	GHC.Data.Graph.Directed

   Efficiently construct a map which maps each key to it's set of transitive dependencies. Less efficient than allReachable, but works on cyclic input as well.

3. allListsOf :: [a] -> Infinite [a]

   ghc-lib-parser	GHC.Data.List.Infinite

   Compute all lists of the given alphabet. For example: allListsOf "ab" = ["a", "b", "aa", "ba", "ab", "bb", "aaa", "baa", "aba", ...]

4. allBackends :: [Backend]

   ghc-lib-parser	GHC.Driver.Backend

   A list of all back ends. They are ordered as we wish them to appear when they are enumerated in error messages.

5. allNonDeprecatedFlags :: [String]

   ghc-lib-parser	GHC.Driver.Session

   All dynamic flags option strings without the deprecated ones. These are the user facing strings for enabling and disabling options.

6. allClosures :: GenClosure b -> [b]

   ghc-lib-parser	GHC.Exts.Heap

   For generic code, this function returns all referenced closures.

7. alloc_limit :: GenClosure b -> !Int64

   ghc-lib-parser	GHC.Exts.Heap

   No documentation available.

8. allClosures :: GenClosure b -> [b]

   ghc-lib-parser	GHC.Exts.Heap.Closures

   For generic code, this function returns all referenced closures.

9. alloc_limit :: GenClosure b -> !Int64

   ghc-lib-parser	GHC.Exts.Heap.Closures

   No documentation available.

10. allocateComments :: RealSrcSpan -> [LEpaComment] -> ([LEpaComment], [LEpaComment])

    ghc-lib-parser	GHC.Parser.Lexer

    No documentation available.

Page 98 of many | Previous | Next