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. fromList :: Ord k => NonEmpty (k, a) -> NEMap k a

   nonempty-containers	Data.Map.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")])
   

2. toList :: NEMap k a -> NonEmpty (k, a)

   nonempty-containers	Data.Map.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")])
   

3. fromList :: NonEmpty a -> NESeq a

   nonempty-containers	Data.Sequence.NonEmpty

   Create a sequence from a finite list of elements. There is a function toNonEmpty in the opposite direction for all instances of the Foldable1 class, including NESeq.

4. fromList :: NonEmpty a -> NESeq a

   nonempty-containers	Data.Sequence.NonEmpty.Internal

   Create a sequence from a finite list of elements. There is a function toNonEmpty in the opposite direction for all instances of the Foldable1 class, including NESeq.

5. fromAscList :: Eq a => NonEmpty a -> NESet a

   nonempty-containers	Data.Set.NonEmpty

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

6. fromDescList :: Eq a => NonEmpty a -> NESet a

   nonempty-containers	Data.Set.NonEmpty

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

7. fromDistinctAscList :: NonEmpty a -> NESet a

   nonempty-containers	Data.Set.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. fromDistinctDescList :: NonEmpty a -> NESet a

   nonempty-containers	Data.Set.NonEmpty

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

9. fromList :: Ord a => NonEmpty a -> NESet a

   nonempty-containers	Data.Set.NonEmpty

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

10. toAscList :: NESet a -> NonEmpty a

    nonempty-containers	Data.Set.NonEmpty

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

Page 138 of many | Previous | Next