primitive-containers-0.2.0

Data.Map.Lifted.Lifted

Synopsis

# Documentation

data Map k v Source #

A map from keys k to values v. The key type and the value type must both have Prim instances.

Instances

 Ord k => IsList (Map k v) Source # Associated Typestype Item (Map k v) :: * # MethodsfromList :: [Item (Map k v)] -> Map k v #fromListN :: Int -> [Item (Map k v)] -> Map k v #toList :: Map k v -> [Item (Map k v)] # (Eq k, Eq v) => Eq (Map k v) Source # Methods(==) :: Map k v -> Map k v -> Bool #(/=) :: Map k v -> Map k v -> Bool # (Ord k, Ord v) => Ord (Map k v) Source # Methodscompare :: Map k v -> Map k v -> Ordering #(<) :: Map k v -> Map k v -> Bool #(<=) :: Map k v -> Map k v -> Bool #(>) :: Map k v -> Map k v -> Bool #(>=) :: Map k v -> Map k v -> Bool #max :: Map k v -> Map k v -> Map k v #min :: Map k v -> Map k v -> Map k v # (Show k, Show v) => Show (Map k v) Source # MethodsshowsPrec :: Int -> Map k v -> ShowS #show :: Map k v -> String #showList :: [Map k v] -> ShowS # (Ord k, Semigroup v) => Semigroup (Map k v) Source # Methods(<>) :: Map k v -> Map k v -> Map k v #sconcat :: NonEmpty (Map k v) -> Map k v #stimes :: Integral b => b -> Map k v -> Map k v # (Ord k, Semigroup v) => Monoid (Map k v) Source # Methodsmempty :: Map k v #mappend :: Map k v -> Map k v -> Map k v #mconcat :: [Map k v] -> Map k v # type Item (Map k v) Source # type Item (Map k v) = (k, v)

singleton :: k -> v -> Map k v Source #

O(1) Create a map with a single element.

lookup :: Ord k => k -> Map k v -> Maybe v Source #

O(log n) Lookup the value at a key in the map.

size :: Map k v -> Int Source #

O(1) The number of elements in the map.

map :: (v -> w) -> Map k v -> Map k w Source #

O(n) Map over the values in the map.

mapMaybe :: (v -> Maybe w) -> Map k v -> Map k w Source #

O(n) Drop elements for which the predicate returns Nothing.

# Folds

Arguments

 :: (b -> k -> v -> b) reduction -> b initial accumulator -> Map k v map -> b

O(n) Left fold over the keys and values with a strict accumulator.

Arguments

 :: (k -> v -> b -> b) reduction -> b initial accumulator -> Map k v map -> b

O(n) Right fold over the keys and values with a strict accumulator.

Arguments

 :: Monoid b => (k -> v -> b) reduction -> Map k v map -> b

O(n) Fold over the keys and values of the map with a strict monoidal accumulator. This function does not have left and right variants since the associativity required by a monoid instance means that both variants would always produce the same result.

Arguments

 :: Monad m => (b -> k -> v -> m b) reduction -> b initial accumulator -> Map k v map -> m b

O(n) Left monadic fold over the keys and values of the map. This fold is strict in the accumulator.

Arguments

 :: Monad m => (k -> v -> b -> m b) reduction -> b initial accumulator -> Map k v map -> m b

O(n) Right monadic fold over the keys and values of the map. This fold is strict in the accumulator.

Arguments

 :: (Monad m, Monoid b) => (k -> v -> m b) reduction -> Map k v map -> m b

O(n) Monadic left fold over the keys and values of the map with a strict monoidal accumulator. The monoidal accumulator is appended to the left after each reduction.

Arguments

 :: (Monad m, Monoid b) => (k -> v -> m b) reduction -> Map k v map -> m b

O(n) Monadic right fold over the keys and values of the map with a strict monoidal accumulator. The monoidal accumulator is appended to the right after each reduction.

# List Conversion

fromList :: Ord k => [(k, v)] -> Map k v Source #

O(n*log n) Create a map from a list of key-value pairs. If the list contains more than one value for the same key, the last value is retained. If the keys in the argument are in nondescending order, this algorithm runs in O(n) time instead.

fromListAppend :: (Ord k, Semigroup v) => [(k, v)] -> Map k v Source #

O(n*log n) This function has the same behavior as fromList, but it combines values with the Semigroup instances instead of choosing the last occurrence.

Arguments

 :: Ord k => Int expected size of resulting Map -> [(k, v)] key-value pairs -> Map k v

O(n*log n) This function has the same behavior as fromList regardless of whether or not the expected size is accurate. Additionally, negative sizes are handled correctly. The expected size is used as the size of the initially allocated buffer when building the Map. If the keys in the argument are in nondescending order, this algorithm runs in O(n) time.

Arguments

 :: (Ord k, Semigroup v) => Int expected size of resulting Map -> [(k, v)] key-value pairs -> Map k v

O(n*log n) This function has the same behavior as fromListN, but it combines values with the Semigroup instances instead of choosing the last occurrence.