Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. toAscList :: Map k a -> [(k, a)]

   containers	Data.Map.Lazy

   Convert the map to a list of key/value pairs where the keys are in ascending order. Subject to list fusion.

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

2. toDescList :: Map k a -> [(k, a)]

   containers	Data.Map.Lazy

   Convert the map to a list of key/value pairs where the keys are in descending order. Subject to list fusion.

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

3. toList :: Map k a -> [(k, a)]

   containers	Data.Map.Lazy

   Convert the map to a list of key/value pairs. Subject to list fusion.

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

4. fromAscList :: Eq k => [(k, a)] -> Map k a

   containers	Data.Map.Strict

   Build a map from an ascending list in linear time. The precondition (input list is ascending) is not checked.

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

5. fromAscListWith :: Eq k => (a -> a -> a) -> [(k, a)] -> Map k a

   containers	Data.Map.Strict

   Build a map from an ascending list in linear time with a combining function for equal keys. The precondition (input list is ascending) is not checked.

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

   Also see the performance note on fromListWith.

6. fromAscListWithKey :: Eq k => (k -> a -> a -> a) -> [(k, a)] -> Map k a

   containers	Data.Map.Strict

   Build a map from an ascending list in linear time with a combining function for equal keys. The precondition (input list is ascending) is not checked.

   let f k a1 a2 = (show k) ++ ":" ++ a1 ++ a2
   fromAscListWithKey f [(3,"b"), (5,"a"), (5,"b"), (5,"b")] == fromList [(3, "b"), (5, "5:b5:ba")]
   valid (fromAscListWithKey f [(3,"b"), (5,"a"), (5,"b"), (5,"b")]) == True
   valid (fromAscListWithKey f [(5,"a"), (3,"b"), (5,"b"), (5,"b")]) == False
   

   Also see the performance note on fromListWith.

7. fromDescList :: Eq k => [(k, a)] -> Map k a

   containers	Data.Map.Strict

   Build a map from a descending list in linear time. The precondition (input list is descending) is not checked.

   fromDescList [(5,"a"), (3,"b")]          == fromList [(3, "b"), (5, "a")]
   fromDescList [(5,"a"), (5,"b"), (3,"a")] == fromList [(3, "b"), (5, "b")]
   valid (fromDescList [(5,"a"), (5,"b"), (3,"b")]) == True
   valid (fromDescList [(5,"a"), (3,"b"), (5,"b")]) == False
   

8. fromDescListWith :: Eq k => (a -> a -> a) -> [(k, a)] -> Map k a

   containers	Data.Map.Strict

   Build a map from a descending list in linear time with a combining function for equal keys. The precondition (input list is descending) is not checked.

   fromDescListWith (++) [(5,"a"), (5,"b"), (3,"b")] == fromList [(3, "b"), (5, "ba")]
   valid (fromDescListWith (++) [(5,"a"), (5,"b"), (3,"b")]) == True
   valid (fromDescListWith (++) [(5,"a"), (3,"b"), (5,"b")]) == False
   

   Also see the performance note on fromListWith.

9. fromDescListWithKey :: Eq k => (k -> a -> a -> a) -> [(k, a)] -> Map k a

   containers	Data.Map.Strict

   Build a map from a descending list in linear time with a combining function for equal keys. The precondition (input list is descending) is not checked.

   let f k a1 a2 = (show k) ++ ":" ++ a1 ++ a2
   fromDescListWithKey f [(5,"a"), (5,"b"), (5,"b"), (3,"b")] == fromList [(3, "b"), (5, "5:b5:ba")]
   valid (fromDescListWithKey f [(5,"a"), (5,"b"), (5,"b"), (3,"b")]) == True
   valid (fromDescListWithKey f [(5,"a"), (3,"b"), (5,"b"), (5,"b")]) == False
   

   Also see the performance note on fromListWith.

10. fromDistinctAscList :: [(k, a)] -> Map k a

    containers	Data.Map.Strict

    Build a map from an ascending list of distinct elements in linear time. The precondition is not checked.

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

Page 42 of many | Previous | Next