JS.Map.Primitive

data Map t0 t1

Instances

• (Key k) => Functor (Map k)
• (Key k) => FunctorWithIndex k (Map k)
• (Key k) => Foldable (Map k)
• (Key k) => FoldableWithIndex k (Map k)
• (Key k) => Traversable (Map k)
• (Key k) => TraversableWithIndex k (Map k)
• (Key k, Eq v) => Eq (Map k v)
• (Key k) => Eq1 (Map k)
• (Key k, Ord v) => Ord (Map k v)
• (Key k, Show v) => Show (Map k v)
• (Key k, Semigroup v) => Semigroup (Map k v)
• (Key k, Semigroup v) => Monoid (Map k v)

values :: forall k v. Map k v -> Array v

Get a list of the values in a map

update :: forall k v. Key k => (v -> Maybe v) -> k -> Map k v -> Map k v

Remove or update a value for a key in a map

unions :: forall f k v. Key k => Foldable f => f (Map k v) -> Map k v

Compute the union of a collection of maps

unionWith :: forall k v. Key k => (v -> v -> v) -> Map k v -> Map k v -> Map k v

Compute the union of two maps, using the specified function to combine values for duplicate keys.

union :: forall k v. Key k => Map k v -> Map k v -> Map k v

Compute the union of two maps, preferring the first map in the case of duplicate keys.

toUnfoldable :: forall f k v. Key k => Unfoldable f => Map k v -> f (Tuple k v)

Unfolds a map into a list of key/value pairs

toAscUnfoldable :: forall f k v. Key k => Unfoldable f => Map k v -> f (Tuple k v)

Unfolds a map into a list of key/value pairs which is guaranteed to be sorted by key

toArrayWithKey :: forall k v a. (k -> v -> a) -> Map k v -> Array a

size :: forall k v. Map k v -> Int

Calculate the number of key/value pairs in a map

singleton :: forall k v. Key k => k -> v -> Map k v

Create an Map a with one key/value pair

pop :: forall k v. Key k => k -> Map k v -> Maybe (Tuple v (Map k v))

Delete a key and value from a map, returning the value as well as the subsequent map

member :: forall k v. Key k => k -> Map k v -> Boolean

Test whether a key appears in a map

mapWithKey :: forall k v v'. Key k => (k -> v -> v') -> Map k v -> Map k v'

Apply a function of two arguments to each key/value pair, producing a new map

lookup :: forall k v. Key k => k -> Map k v -> Maybe v

Lookup the value for a key in a map

keys :: forall k v. Map k v -> Array k

Get an array of the keys in a map

isSubmap :: forall k v. Key k => Eq v => Map k v -> Map k v -> Boolean

Test whether one map contains all of the keys and values contained in another map

isEmpty :: forall k v. Key k => Map k v -> Boolean

Test whether a map is empty

insert :: forall k v. Key k => k -> v -> Map k v -> Map k v

Insert or replace a key/value pair in a map

fromFoldableWithIndex :: forall f k v. Key k => FoldableWithIndex k (f k) => f k v -> Map k v

Create an Map k v from a k-indexed foldable collection

fromFoldableWith :: forall f k v. Key k => Foldable f => (v -> v -> v) -> f (Tuple k v) -> Map k v

Create an Map k v from a foldable collection of key/value pairs, using the specified function to combine values for duplicate keys.

fromFoldable :: forall f k v. Key k => Foldable f => f (Tuple k v) -> Map k v

Create an Map k v from a foldable collection of key/value pairs

foldMaybe :: forall k v z. Key k => (z -> k -> v -> Maybe z) -> z -> Map k v -> z

Fold the keys and values of a map.

This function allows the folding function to terminate the fold early, using Maybe.

foldMap :: forall k v m. Key k => Monoid m => (k -> v -> m) -> Map k v -> m

Fold the keys and values of an object, accumulating values using some Monoid.

foldM :: forall k v m z. Key k => Monad m => (z -> k -> v -> m z) -> z -> Map k v -> m z

Fold the keys and values of an object, accumulating values and effects in some Monad.

fold :: forall k v z. Key k => (z -> k -> v -> z) -> z -> Map k v -> z

Fold the keys and values of an object

filterWithKey :: forall k v. Key k => (k -> v -> Boolean) -> Map k v -> Map k v

Filter out those key/value pairs of a map for which a predicate fails to hold.

filterKeys :: forall k. Key k => (k -> Boolean) -> (Map k) ~> (Map k)

Filter out those key/value pairs of a map for which a predicate on the key fails to hold.

filter :: forall k v. Key k => (v -> Boolean) -> Map k v -> Map k v

Filter out those key/value pairs of a map for which a predicate on the value fails to hold.

empty :: forall k v. Map k v

An empty map

delete :: forall k v. Key k => k -> Map k v -> Map k v

Delete a key and value from a map

alter :: forall k v. Key k => (Maybe v -> Maybe v) -> k -> Map k v -> Map k v

Insert, remove or update a value for a key in a map

all :: forall k v. Key k => (k -> v -> Boolean) -> Map k v -> Boolean

Test whether all key/value pairs in a Map satisfy a predicate.