Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

1. toDescList :: IntMap a -> [(Key, a)]

   containers	Data.IntMap.Strict.Internal

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

2. toList :: IntMap a -> [(Key, a)]

   containers	Data.IntMap.Strict.Internal

   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 == []
   

3. fromAscList :: [Key] -> IntSet

   containers	Data.IntSet

   Build a set from an ascending list of elements. The precondition (input list is ascending) is not checked.

4. fromDistinctAscList :: [Key] -> IntSet

   containers	Data.IntSet

   Build a set from an ascending list of distinct elements. The precondition (input list is strictly ascending) is not checked.

5. fromList :: [Key] -> IntSet

   containers	Data.IntSet

   Create a set from a list of integers.

6. toAscList :: IntSet -> [Key]

   containers	Data.IntSet

   Convert the set to an ascending list of elements. Subject to list fusion.

7. toDescList :: IntSet -> [Key]

   containers	Data.IntSet

   Convert the set to a descending list of elements. Subject to list fusion.

8. toList :: IntSet -> [Key]

   containers	Data.IntSet

   Convert the set to a list of elements. Subject to list fusion.

9. fromAscList :: [Key] -> IntSet

   containers	Data.IntSet.Internal

   Build a set from an ascending list of elements. The precondition (input list is ascending) is not checked.

10. fromDistinctAscList :: [Key] -> IntSet

    containers	Data.IntSet.Internal

    Build a set from an ascending list of distinct elements. The precondition (input list is strictly ascending) is not checked.

Page 38 of many | Previous | Next