Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. 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
   

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

   nonempty-containers	Data.IntMap.NonEmpty

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

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

4. fromList :: NonEmpty Key -> NEIntSet

   nonempty-containers	Data.IntSet.NonEmpty

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

5. fromList :: NonEmpty Key -> NEIntSet

   nonempty-containers	Data.IntSet.NonEmpty.Internal

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

6. fromList :: Ord k => NonEmpty (k, a) -> NEMap k a

   nonempty-containers	Data.Map.NonEmpty

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

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

8. 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.

9. 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.

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

    nonempty-containers	Data.Set.NonEmpty

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

Page 16 of many | Previous | Next