(a -> b) -> (a, a) -> (b, b) -array

(><) :: (a -> b) -> (c -> d) -> (a, c) -> (b, d)
fgl Data.Graph.Inductive.Query.Monad
mapSnd :: (a -> b) -> (c, a) -> (c, b)
fgl Data.Graph.Inductive.Query.Monad
mapFst :: (a -> b) -> (a, c) -> (b, c)
fgl Data.Graph.Inductive.Query.Monad
emap :: DynGraph gr => (b -> c) -> gr a b -> gr a c
fgl Data.Graph.Inductive.Graph
Map a function over the Edge labels in a graph.
nmap :: DynGraph gr => (a -> c) -> gr a b -> gr c b
fgl Data.Graph.Inductive.Graph
Map a function over the Node labels in a graph.
(^<<) :: Arrow a => (c -> d) -> a b c -> a b d
base Control.Arrow
Postcomposition with a pure function (right-to-left variant).
firstf :: (a -> c) -> Maybe (a, b) -> Maybe (c, b)
text Data.Text.Internal
Apply a function to the first element of an optional pair.
(>>^) :: Arrow a => a b c -> (c -> d) -> a b d
base Control.Arrow
Postcomposition with a pure function.
elfilter :: DynGraph gr => (b -> Bool) -> gr a b -> gr a b
fgl Data.Graph.Inductive.Basic
Filter based on edge label property.
(^>>) :: Arrow a => (b -> c) -> a c d -> a b d
base Control.Arrow
Precomposition with a pure function.
(<<^) :: Arrow a => a c d -> (b -> c) -> a b d
base Control.Arrow
Precomposition with a pure function (right-to-left variant).