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 :: NEIntMap a -> NonEmpty (Key, a)

   nonempty-containers	Data.IntMap.NonEmpty

   O(n). Convert the map to a list of key/value pairs where the keys are in ascending order.

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

2. toDescList :: NEIntMap a -> NonEmpty (Key, a)

   nonempty-containers	Data.IntMap.NonEmpty

   O(n). Convert the map to a list of key/value pairs where the keys are in descending order.

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

3. toList :: NEIntMap a -> NonEmpty (Key, a)

   nonempty-containers	Data.IntMap.NonEmpty

   O(n). Convert the map to a non-empty list of key/value pairs.

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

4. fromList :: NonEmpty (Key, a) -> NEIntMap a

   nonempty-containers	Data.IntMap.NonEmpty.Internal

   O(n*log n). Build a non-empty map from a non-empty list of key/value pairs. See also fromAscList. If the list contains more than one value for the same key, the last value for the key is retained.

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

5. toList :: NEIntMap a -> NonEmpty (Key, a)

   nonempty-containers	Data.IntMap.NonEmpty.Internal

   O(n). Convert the map to a non-empty list of key/value pairs.

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

6. fromAscList :: NonEmpty Key -> NEIntSet

   nonempty-containers	Data.IntSet.NonEmpty

   O(n). Build a set from an ascending list in linear time. /The precondition (input list is ascending) is not checked./

7. fromDistinctAscList :: NonEmpty Key -> NEIntSet

   nonempty-containers	Data.IntSet.NonEmpty

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

8. fromList :: NonEmpty Key -> NEIntSet

   nonempty-containers	Data.IntSet.NonEmpty

   O(n*log n). Create a set from a list of elements.

9. toAscList :: NEIntSet -> NonEmpty Key

   nonempty-containers	Data.IntSet.NonEmpty

   O(n). Convert the set to an ascending non-empty list of elements.

10. toDescList :: NEIntSet -> NonEmpty Key

    nonempty-containers	Data.IntSet.NonEmpty

    O(n). Convert the set to a descending non-empty list of elements.

Page 135 of many | Previous | Next