Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. extendFsEnvList_C :: (a -> a -> a) -> FastStringEnv a -> [(FastString, a)] -> FastStringEnv a

   ghc-lib-parser	GHC.Data.FastString.Env

   No documentation available.

2. deleteList :: Ord key => [key] -> Map key elt -> Map key elt

   ghc-lib-parser	GHC.Data.FiniteMap

   No documentation available.

3. insertList :: Ord key => [(key, elt)] -> Map key elt -> Map key elt

   ghc-lib-parser	GHC.Data.FiniteMap

   No documentation available.

4. insertListWith :: Ord key => (elt -> elt -> elt) -> [(key, elt)] -> Map key elt -> Map key elt

   ghc-lib-parser	GHC.Data.FiniteMap

   No documentation available.

5. fromList :: Word -> [a] -> FlatBag a

   ghc-lib-parser	GHC.Data.FlatBag

   Store the list in a flattened memory representation, avoiding the memory overhead of a linked list. The size n needs to be smaller or equal to the length of the list. If it is smaller than the length of the list, overflowing elements are discarded. It is undefined behaviour to set n to be bigger than the length of the list.

6. delUnVarSetList :: UnVarSet -> [Var] -> UnVarSet

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

   No documentation available.

7. extendUnVarSetList :: [Var] -> UnVarSet -> UnVarSet

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

   No documentation available.

8. 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", ...]

9. dropList :: [a] -> Infinite b -> Infinite b

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

   No documentation available.

10. toList :: Infinite a -> [a]

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

    No documentation available.

Page 113 of many | Previous | Next