Hoogle Search

Within LTS Haskell 24.61 (ghc-9.10.3)

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

  1. 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.

  2. 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.

  3. 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.

  4. 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")]

  5. 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")]

  6. 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")]

  7. 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")]

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

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

    Create a map from a list of key/value pairs. 

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

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

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

    Create a map from a list of key/value pairs with a combining function. See also fromAscListWith. 

    fromListWith (++) [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"c")] == fromList [(3, "ab"), (5, "cba")]
fromListWith (++) [] == empty

  10. fromListWithKey :: (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 with a combining function. See also fromAscListWithKey'. 

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

Page 116 of many | Previous | Next