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.
fromList :: NonEmpty (Key, a) -> NEIntMap anonempty-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")])
fromListWith :: (a -> a -> a) -> NonEmpty (Key, a) -> NEIntMap anonempty-containers Data.IntMap.NonEmpty O(n*log n). Build a map from a non-empty list of key/value pairs with a combining function. See also fromAscListWith.
fromListWith (++) ((5,"a") :| [(5,"b"), (3,"b"), (3,"a"), (5,"a")]) == fromList ((3, "ab") :| [(5, "aba")])
fromListWithKey :: (Key -> a -> a -> a) -> NonEmpty (Key, a) -> NEIntMap anonempty-containers Data.IntMap.NonEmpty O(n*log n). Build a map from a non-empty list of key/value pairs with a combining function. See also fromAscListWithKey.
let f k a1 a2 = (show k) ++ a1 ++ a2 fromListWithKey f ((5,"a") :| [(5,"b"), (3,"b"), (3,"a"), (5,"a")]) == fromList ((3, "3ab") :| [(5, "5a5ba")])
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")])
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")])
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")])
fromList :: NonEmpty (Key, a) -> NEIntMap anonempty-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")])
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")])
fromAscList :: NonEmpty Key -> NEIntSetnonempty-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./
fromDistinctAscList :: NonEmpty Key -> NEIntSetnonempty-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.