Hoogle Search
Within LTS Haskell 24.46 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
type
SelectedMap = PMap Singlegreskell Data.Greskell.AsLabel A map keyed with AsLabel. Obtained from .select step, for example.
pMapToFail :: MonadFail m => Either PMapLookupException a -> m agreskell Data.Greskell.Extra Convert the lookup result into a MonadFail. It fails with the description returned by pMapDecribeError.
-
greskell Data.Greskell.Extra Make a series of .property steps to write all properties in the given PMap.
gElementMap :: Element s => Keys s -> Walk Transform s (PMap Single GValue)greskell Data.Greskell.GTraversal .elementMap step.
-
greskell Data.Greskell.GTraversal .flatMap step. .flatMap step is at least as powerful as Transform, even if the child walk is Filter type. This is because .flatMap step always modifies the path of the Traverser.
gFlatMap' :: ToGTraversal g => g Transform s e -> Walk Transform s egreskell Data.Greskell.GTraversal Monomorphic version of gFlatMap.
gValueMap :: Element s => Keys s -> Walk Transform s (PMap (ElementPropertyContainer s) GValue)greskell Data.Greskell.GTraversal .valueMap step.
gElementMap :: (Element s, WalkType c, Lift Transform c) => Keys s -> Walk c s (PMap Single GValue)greskell Data.Greskell.GTraversal.Gen No documentation available.
-
greskell Data.Greskell.GTraversal.Gen .flatMap step. .flatMap step is at least as powerful as Transform, even if the child walk is Filter type. This is because .flatMap step always modifies the path of the Traverser.
-
greskell Data.Greskell.GTraversal.Gen No documentation available.