Data.Map.Unboxed.Unlifted

Documentation

data Map k v

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

Instances

(Prim k, Ord k, PrimUnlifted v) => IsList (Map k v)

Associated Types

type Item (Map k v) :: *

Methods

fromList :: [Item (Map k v)] -> Map k v

fromListN :: Int -> [Item (Map k v)] -> Map k v

toList :: Map k v -> [Item (Map k v)]

(Prim k, Eq k, PrimUnlifted v, Eq v) => Eq (Map k v)

Methods

(==) :: Map k v -> Map k v -> Bool

(/=) :: Map k v -> Map k v -> Bool

(Prim k, Ord k, PrimUnlifted v, Ord v) => Ord (Map k v)

Methods

compare :: 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

(Prim k, Show k, PrimUnlifted v, Show v) => Show (Map k v)

Methods

showsPrec :: Int -> Map k v -> ShowS

show :: Map k v -> String

showList :: [Map k v] -> ShowS

(Prim k, Ord k, PrimUnlifted v, Semigroup v) => Semigroup (Map k v)

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

(Prim k, Ord k, PrimUnlifted v, Semigroup v) => Monoid (Map k v)

Methods

mempty :: 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)

type Item (Map k v) = (k, v)

singleton :: (Prim k, PrimUnlifted v) => k -> v -> Map k v

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

lookup :: (Prim k, Ord k, PrimUnlifted v) => k -> Map k v -> Maybe v

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

size :: PrimUnlifted v => Map k v -> Int

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

List Conversion

fromList :: (Prim k, Ord k, PrimUnlifted v) => [(k, v)] -> Map k v

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 :: (Prim k, Ord k, PrimUnlifted v, Semigroup v) => [(k, v)] -> Map k v

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.

fromListN

Arguments

:: (Prim k, Ord k, PrimUnlifted 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 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.

fromListAppendN

Arguments

:: (Prim k, Ord k, PrimUnlifted v, 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.