Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapTree :: (Tree -> Tree) -> Tree -> Treesvg-tree Graphics.Svg.Types Helper function mapping every tree element.
mapL2V :: DatatypeMap vt -> Text -> Maybe vtswish Swish.Datatype Function to map a lexical string to the datatype value. This effectively defines the lexical space of the datatype to be all strings for which yield a value other than Nothing.
mapV2L :: DatatypeMap vt -> vt -> Maybe Textswish Swish.Datatype Function to map a value to its canonical lexical form, if it has such.
mapLabelIndex :: Label lb => LabelMap lb -> lb -> LabelIndexswish Swish.GraphMatch Map a label to its corresponding label index value in the supplied LabelMap.
mapXsdDecimal :: DatatypeMap Doubleswish Swish.RDF.Datatype.XSD.MapDecimal Functions that perform lexical-to-value and value-to-canonical-lexical mappings for xsd:decimal values.
mapXsdInteger :: DatatypeMap Integerswish Swish.RDF.Datatype.XSD.MapInteger Functions that perform lexical-to-value and value-to-canonical-lexical mappings for xsd:integer values.
maplist :: Label lb => [lb] -> [lb] -> (lb -> lb) -> [(lb, lb)] -> [(lb, lb)]swish Swish.RDF.Graph Construct a list of (oldnode,newnode) values to be used for graph label remapping. The function operates recursively, adding new nodes generated to the accumulator and also to the list of nodes to be avoided.
mapnode :: Label lb => [lb] -> [lb] -> (lb -> lb) -> lb -> lbswish Swish.RDF.Graph Remap a single graph node. If the node is not one of those to be remapped, the supplied value is returned unchanged.
mapTardisT :: (m (a, (bw, fw)) -> n (b, (bw, fw))) -> TardisT bw fw m a -> TardisT bw fw n btardis Control.Monad.Trans.Tardis A function that operates on the internal representation of a Tardis can also be used on a Tardis.
mapThat :: (b -> d) -> These a b -> These a dthese-skinny Data.These mapThat = over there