Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

1. mapHead :: (a -> a) -> [a] -> [a]

   code-conjure	Conjure.Utils

   Applies a function to the head of a list.

2. mapEdge :: forall el0 el1 (e :: Type -> Type) n nl . (el0 -> el1) -> Graph e n el0 nl -> Graph e n el1 nl

   comfort-graph	Data.Graph.Comfort

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

3. mapEdgeKeys :: (Edge e1, Ord n) => (e0 n -> e1 n) -> Graph e0 n el nl -> Graph e1 n el nl

   comfort-graph	Data.Graph.Comfort

   Same restrictions as in mapMaybeEdgeKeys.

4. mapEdgeWithKey :: (e n -> el0 -> el1) -> Graph e n el0 nl -> Graph e n el1 nl

   comfort-graph	Data.Graph.Comfort

   No documentation available.

5. 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.

6. 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.

7. 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
   

8. 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.

9. 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.

10. 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.

Page 283 of many | Previous | Next