pmap -package:ghc -is:exact -package:typerep-map -package:plutarch

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
fromDepMap :: DependencyMap -> [Dependency]
Cabal Distribution.Types.DependencyMap
toDepMap :: [Dependency] -> DependencyMap
Cabal Distribution.Types.DependencyMap