Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

  1. module GHC.Data.OrdList

    Provide trees (of instructions), so that lists of instructions can be appended in linear time.

  2. data OrdList a

    ghc-lib-parser GHC.Data.OrdList

    No documentation available.

  3. addListToSS :: SizedSeq a -> [a] -> SizedSeq a

    ghc-lib-parser GHC.Data.SizedSeq

    No documentation available.

  4. fromList :: forall (m :: Type -> Type) a . Monad m => [a] -> Stream m a ()

    ghc-lib-parser GHC.Data.Stream

    Turn a list into a Stream, by yielding each element in turn.

  5. lkList :: TrieMap m => (forall b . () => k -> m b -> Maybe b) -> [k] -> ListMap m a -> Maybe a

    ghc-lib-parser GHC.Data.TrieMap

    No documentation available.

  6. xtList :: TrieMap m => (forall b . () => k -> XT b -> m b -> m b) -> [k] -> XT a -> ListMap m a -> ListMap m a

    ghc-lib-parser GHC.Data.TrieMap

    No documentation available.

  7. fromAscList :: [(Key, a)] -> Word64Map a

    ghc-lib-parser GHC.Data.Word64Map.Internal

    Build a map from a list of key/value pairs where the keys are in ascending order.

    fromAscList [(3,"b"), (5,"a")]          == fromList [(3, "b"), (5, "a")]
    fromAscList [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "b")]
    

  8. fromAscListWith :: (a -> a -> a) -> [(Key, a)] -> Word64Map a

    ghc-lib-parser GHC.Data.Word64Map.Internal

    Build a map from a list of key/value pairs where the keys are in ascending order, with a combining function on equal keys. The precondition (input list is ascending) is not checked.

    fromAscListWith (++) [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "ba")]
    

  9. fromAscListWithKey :: (Key -> a -> a -> a) -> [(Key, a)] -> Word64Map a

    ghc-lib-parser GHC.Data.Word64Map.Internal

    Build a map from a list of key/value pairs where the keys are in ascending order, with a combining function on equal keys. The precondition (input list is ascending) is not checked.

    let f key new_value old_value = (show key) ++ ":" ++ new_value ++ "|" ++ old_value
    fromAscListWithKey f [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "5:b|a")]
    

  10. fromDistinctAscList :: [(Key, a)] -> Word64Map a

    ghc-lib-parser GHC.Data.Word64Map.Internal

    Build a map from a list of key/value pairs where the keys are in ascending order and all distinct. The precondition (input list is strictly ascending) is not checked.

    fromDistinctAscList [(3,"b"), (5,"a")] == fromList [(3, "b"), (5, "a")]
    

Page 115 of many | Previous | Next