Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

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

Exact lookup

1. toDescList :: MonoidalMap k a -> [(k, a)]

   monoidal-containers	Data.Map.Monoidal.Strict

   No documentation available.

2. toList :: MonoidalMap k a -> [(k, a)]

   monoidal-containers	Data.Map.Monoidal.Strict

   No documentation available.

3. fromList :: Ord k => [(k, a)] -> MultiMap k a

   multimap	Data.MultiMap

   O(n*log n) Create a multimap from a list of key/value pairs.

   fromList xs == foldr (uncurry insert) empty
   

4. toList :: MultiMap k a -> [(k, a)]

   multimap	Data.MultiMap

   Return a flattened list of key/value pairs.

5. data DLList s a

   mutable-containers	Data.Mutable

   A doubly-linked list. Since 0.3.0

6. asDLList :: DLList s a -> DLList s a

   mutable-containers	Data.Mutable

   Since 0.2.0

7. fromAscList :: NonEmpty (Key, a) -> NEIntMap a

   nonempty-containers	Data.IntMap.NonEmpty

   O(n). Build a map from an ascending non-empty 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
   

8. fromAscListWith :: (a -> a -> a) -> NonEmpty (Key, a) -> NEIntMap a

   nonempty-containers	Data.IntMap.NonEmpty

   O(n). Build a map from an ascending non-empty 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
   

9. fromAscListWithKey :: (Key -> a -> a -> a) -> NonEmpty (Key, a) -> NEIntMap a

   nonempty-containers	Data.IntMap.NonEmpty

   O(n). Build a map from an ascending non-empty 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
   

10. fromDistinctAscList :: NonEmpty (Key, a) -> NEIntMap a

    nonempty-containers	Data.IntMap.NonEmpty

    O(n). Build a map from an ascending non-empty 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 134 of many | Previous | Next