pmap -is:exact -is:exact -is:module -package:typerep-map

pmap :: (PIsData a, PIsData b) => Term s ((a :--> b) :--> (PMap g k a :--> PMap g k b))
plutarch Plutarch.Api.V1.AssocMap
Applies a function to every value in the map, much like map.
pmap :: (PListLike list, PElemConstraint list a, PElemConstraint list b) => Term s ((a :--> b) :--> (list a :--> list b))
plutarch Plutarch.List Plutarch.Prelude
O(n) . Map a function over a list of elements
newtype PMap (keysort :: KeyGuarantees) (k :: PType) (v :: PType) (s :: S)
plutarch Plutarch.Api.V1 Plutarch.Api.V1.AssocMap Plutarch.Api.V2
PMap :: Term s (PBuiltinList (PBuiltinPair (PAsData k) (PAsData v))) -> PMap (keysort :: KeyGuarantees) (k :: PType) (v :: PType) (s :: S)
plutarch Plutarch.Api.V1 Plutarch.Api.V1.AssocMap Plutarch.Api.V2
pmapData :: Term s ((PAsData a :--> PAsData b) :--> (PMap g k a :--> PMap g k b))
plutarch Plutarch.Api.V1.AssocMap
pmapMaybe :: (PIsData a, PIsData b) => Term s ((a :--> PMaybe b) :--> (PMap g k a :--> PMap g k b))
plutarch Plutarch.Api.V1.AssocMap
Maps and filters the map, much like mapMaybe.
pmapMaybeData :: Term s ((PAsData a :--> PMaybe (PAsData b)) :--> (PMap g k a :--> PMap g k b))
plutarch Plutarch.Api.V1.AssocMap
pmapWithKey :: forall (k :: PType) (a :: PType) (b :: PType) (keysort :: KeyGuarantees) (s :: S) . (PIsData k, PIsData a, PIsData b) => Term s ((k :--> (a :--> b)) :--> (PMap keysort k a :--> PMap 'Unsorted k b))
plutarch-extra Plutarch.Extra.Map
Like regular fmap but it provides key of each element that is being modified.
pmapMaybe :: forall (listO :: (S -> Type) -> S -> Type) (b :: S -> Type) (listI :: (S -> Type) -> S -> Type) (a :: S -> Type) (s :: S) . (PIsListLike listI a, PIsListLike listO b) => Term s ((a :--> PMaybe b) :--> (listI a :--> listO b))
liqwid-plutarch-extra Plutarch.Extra.List
Similar to pmap, but allows elements to be thrown out. More precisely, for elements where the function argument returns PNothing, the corresponding element is removed, while for elements where the function argument returns PJust, the value is used in the result.
pmapComparator :: forall (a :: S -> Type) (b :: S -> Type) (s :: S) . Term s ((b :--> a) :--> (PComparator a :--> PComparator b))
liqwid-plutarch-extra Plutarch.Extra.Ord
Given a projection from a type to another type which we have a PComparator for, construct a new PComparator.
dropMap :: Dropper s -> Dropper s -> Dropper s
cardano-binary Cardano.Binary
mapMap :: IsMap map => (a -> b) -> map a -> map b
ghc GHC.Cmm.Dataflow.Collections
mapMapWithKey :: IsMap map => (KeyOf map -> a -> b) -> map a -> map b
ghc GHC.Cmm.Dataflow.Collections
fromDepMap :: DependencyMap -> [Dependency]
Cabal Distribution.Types.DependencyMap
toDepMap :: [Dependency] -> DependencyMap
Cabal Distribution.Types.DependencyMap