Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. mapKeys :: (Edge edge1, Ord node0, Ord node1) => (node0 -> node1) -> (edge0 node0 -> edge1 node1) -> Graph edge0 node0 edgeLabel nodeLabel -> Graph edge1 node1 edgeLabel nodeLabel

   comfort-graph	Data.Graph.Comfort

   The index map must be an injection, that is, nodes must not collaps. Also the node and edge index maps must be consistent, i.e.

   from (edgeMap e) == nodeMap (from e)
   to   (edgeMap e) == nodeMap (to   e)
   

   Strictly spoken, we would need the node map only for isolated nodes, but we use it for all nodes for simplicity.

2. mapMaybeEdgeKeys :: (Edge e1, Ord n) => (e0 n -> Maybe (e1 n)) -> Graph e0 n el nl -> Graph e1 n el nl

   comfort-graph	Data.Graph.Comfort

   You may only use this for filtering edges and use more specialised types as a result. You must not alter source and target nodes of edges.

3. mapNode :: forall nl0 nl1 (e :: Type -> Type) n el . (nl0 -> nl1) -> Graph e n el nl0 -> Graph e n el nl1

   comfort-graph	Data.Graph.Comfort

   \(TestGraph gr) -> Graph.mapNode id gr == gr
   

4. mapNodeWithInOut :: (Edge e, Ord n) => (InOut e n el nl0 -> nl1) -> Graph e n el nl0 -> Graph e n el nl1

   comfort-graph	Data.Graph.Comfort

   No documentation available.

5. mapNodeWithKey :: forall n nl0 nl1 (e :: Type -> Type) el . (n -> nl0 -> nl1) -> Graph e n el nl0 -> Graph e n el nl1

   comfort-graph	Data.Graph.Comfort

   No documentation available.

6. mapInput :: forall i j o u (m :: Type -> Type) a . (i -> j) -> Pipe j o u m a -> Pipe i o u m a

   conduino	Data.Conduino

   (Contravariantly) map over the expected input type.

7. mapOutput :: forall p o i u (m :: Type -> Type) a . (p -> o) -> Pipe i p u m a -> Pipe i o u m a

   conduino	Data.Conduino

   Map over the downstream output type. If you want to map over the result type, use fmap.

8. mapUpRes :: forall u v i o (m :: Type -> Type) a . (u -> v) -> Pipe i o v m a -> Pipe i o u m a

   conduino	Data.Conduino

   (Contravariantly) map over the upstream result type.

9. mapAccum :: forall i s o u (m :: Type -> Type) . (i -> s -> (s, o)) -> s -> Pipe i o u m u

   conduino	Data.Conduino.Combinators

   Map a pure "stateful" function over each incoming item. Give a function to update the state and return an output and an initial state.

10. mapM :: Monad m => (i -> m o) -> Pipe i o u m u

    conduino	Data.Conduino.Combinators

    Map a monadic function to process every input, and yield its output.

Page 285 of many | Previous | Next