Hoogle Search

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

fromDescListWith :: Eq k => (a -> a -> a) -> NonEmpty (k, a) -> NEMap k a

nonempty-containers Data.Map.NonEmpty

O(n). Build a map from a descending non-empty list in linear time with a combining function for equal keys. /The precondition (input list is descending) is not checked./
```
fromDescListWith (++) ((5,"a") :| [(5,"b"), (3,"b")]) == fromList ((3, "b") :| [(5, "ba")])
valid (fromDescListWith (++) ((5,"a") :| [(5,"b"), (3,"b")])) == True
valid (fromDescListWith (++) ((5,"a") :| [(3,"b"), (5,"b")])) == False
```

fromDescListWithKey :: Eq k => (k -> a -> a -> a) -> NonEmpty (k, a) -> NEMap k a

nonempty-containers	Data.Map.NonEmpty

O(n). Build a map from a descending non-empty list in linear time with a combining function for equal keys. /The precondition (input list is descending) is not checked./

let f k a1 a2 = (show k) ++ ":" ++ a1 ++ a2
fromDescListWithKey f ((5,"a") :| [(5,"b"), (5,"b"), (3,"b")]) == fromList ((3, "b") :| [(5, "5:b5:ba")])
valid (fromDescListWithKey f ((5,"a") :| [(5,"b"), (5,"b"), (3,"b")])) == True
valid (fromDescListWithKey f ((5,"a") :| [(3,"b"), (5,"b"), (5,"b")])) == False

fromDistinctAscList :: NonEmpty (k, a) -> NEMap k a

nonempty-containers	Data.Map.NonEmpty

O(n). Build a map from an ascending non-empty list of distinct elements in linear time. The precondition is not checked.

fromDistinctAscList ((3,"b") :| [(5,"a")]) == fromList ((3, "b") :| [(5, "a")])
valid (fromDistinctAscList ((3,"b") :| [(5,"a")]))          == True
valid (fromDistinctAscList ((3,"b") :| [(5,"a"), (5,"b")])) == False

fromDistinctDescList :: NonEmpty (k, a) -> NEMap k a

nonempty-containers	Data.Map.NonEmpty

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

fromDistinctDescList ((5,"a") :| [(3,"b")]) == fromList ((3, "b") :| [(5, "a")])
valid (fromDistinctDescList ((5,"a") :| [(3,"b")]))          == True
valid (fromDistinctDescList ((5,"a") :| [(5,"b"), (3,"b")])) == False

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")])
```
fromListWith :: Ord k => (a -> a -> a) -> NonEmpty (k, a) -> NEMap k a

nonempty-containers Data.Map.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 :: Ord k => (k -> a -> a -> a) -> NonEmpty (k, a) -> NEMap k a

nonempty-containers Data.Map.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 :: NEMap k a -> NonEmpty (k, a)

nonempty-containers Data.Map.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 :: NEMap k a -> NonEmpty (k, a)

nonempty-containers Data.Map.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 :: NEMap k a -> NonEmpty (k, a)

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

Page 137 of many | Previous | Next