Cardano.Plutus.Types.Map

newtype Map (k :: Type) (v :: Type)

A Plutus-style associated list Map of key-value pairs.

Constructors

• Map (Array (Tuple k v))

Instances

• Generic (Map k v) _
• Newtype (Map k v) _
• (Eq k, Eq v) => Eq (Map k v)
• (Ord k, Ord v) => Ord (Map k v)
• (EncodeAeson k, EncodeAeson v) => EncodeAeson (Map k v)
• (DecodeAeson k, DecodeAeson v) => DecodeAeson (Map k v)
• (Show k, Show v) => Show (Map k v)
• (ToData k, ToData v) => ToData (Map k v)
• (FromData k, FromData v) => FromData (Map k v)
• Functor (Map k)
• FunctorWithIndex k (Map k)
• Foldable (Map k)
• FoldableWithIndex k (Map k)
• Traversable (Map k)
• TraversableWithIndex k (Map k)
• (Eq k, Semigroup v) => Semigroup (Map k v)
• (Eq k, Semigroup v) => Monoid (Map k v)

delete :: forall (k :: Type) (v :: Type). Eq k => k -> Map k v -> Map k v

Delete a key in a Map

elems :: forall (k :: Type) (v :: Type). Map k v -> Array v

Return all elements of the map in the ascending order of their keys.

empty :: forall (k :: Type) (v :: Type). Map k v

An empty Map

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

Filter all values that satisfy the predicate.

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

keys :: forall (k :: Type) (v :: Type). Map k v -> Array k

The keys of a Map

lookup :: forall (k :: Type) (v :: Type). Eq k => k -> Map k v -> Maybe v

Find an entry in a Map.

mapMaybe :: forall (k :: Type) (a :: Type) (b :: Type). (a -> Maybe b) -> Map k a -> Map k b

Map values and collect the Just results.

mapMaybeWithKey :: forall (k :: Type) (a :: Type) (b :: Type). (k -> a -> Maybe b) -> Map k a -> Map k b

Map keys, values and collect the Just results.

mapThese :: forall (k :: Type) (v :: Type) (a :: Type) (b :: Type). (v -> These a b) -> Map k v -> ((Map k a) /\ (Map k b))

A version of Haskell's Data.Map.Lazy.mapEither that works with These

member :: forall (k :: Type) (v :: Type). Eq k => k -> Map k v -> Boolean

Whether given key is a member of a Map

null :: forall (k :: Type) (v :: Type). Map k v -> Boolean

Checks whether a Map is empty

singleton :: forall (k :: Type) (v :: Type). k -> v -> Map k v

A singleton Map

union :: forall (k :: Type) (v :: Type) (r :: Type). Eq k => Map k v -> Map k r -> Map k (These v r)

Combine two Maps

unionWith :: forall (k :: Type) (a :: Type). Eq k => (a -> a -> a) -> Map k a -> Map k a -> Map k a

Combine two Maps with the given combination function

values :: forall (k :: Type) (v :: Type). Map k v -> Array v

The values of a Map

fromCardano :: forall k v. Map k v -> Map k v

toCardano :: forall k v. Ord k => Map k v -> Maybe (Map k v)

Fails with Nothing if there are duplicates