Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

  1. concatMapT :: (a -> [[b]]) -> [[a]] -> [[b]]

    leancheck Test.LeanCheck.Core

    concatMap over tiers 

    concatMapT f [ [x0, y0, z0]
, [x1, y1, z1]
, [x2, y2, z2]
, ...
]
=  f x0 \/ f y0 \/ f z0 \/ ...
\/ delay (f x1 \/ f y1 \/ f z1 \/ ...
\/ delay (f x2 \/ f y2 \/ f z2 \/ ...
\/ (delay ...)))
    (cf. concatT)

  2. concatMapT :: (a -> [[b]]) -> [[a]] -> [[b]]

    leancheck Test.LeanCheck.Error

    concatMap over tiers 

    concatMapT f [ [x0, y0, z0]
, [x1, y1, z1]
, [x2, y2, z2]
, ...
]
=  f x0 \/ f y0 \/ f z0 \/ ...
\/ delay (f x1 \/ f y1 \/ f z1 \/ ...
\/ delay (f x2 \/ f y2 \/ f z2 \/ ...
\/ (delay ...)))
    (cf. concatT)

  3. imapMProp :: (IsList c, IsList d, Eq d, Show d, Show b, Item c ~ a, Item d ~ b, Arbitrary c, Arbitrary b, Show c, Show a, CoArbitrary a, Function a) => Proxy a -> Proxy b -> (forall s . () => (Int -> a -> ST s b) -> c -> ST s d) -> Property

    quickcheck-classes-base Test.QuickCheck.Classes.Base.IsList

    No documentation available.

  4. imapProp :: (IsList c, IsList d, Eq d, Show d, Show b, Item c ~ a, Item d ~ b, Arbitrary c, Arbitrary b, Show c, Show a, CoArbitrary a, Function a) => Proxy a -> Proxy b -> ((Int -> a -> b) -> c -> d) -> Property

    quickcheck-classes-base Test.QuickCheck.Classes.Base.IsList

    No documentation available.

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

  6. gfiltermap :: DynGraph gr => (Context a b -> MContext c d) -> gr a b -> gr c d

    fgl Data.Graph.Inductive.Graph

    Build a graph out of the contexts for which the predicate is satisfied by recursively calling match.

  7. gmap :: DynGraph gr => (Context a b -> Context c d) -> gr a b -> gr c d

    fgl Data.Graph.Inductive.Graph

    Map a function over the graph by recursively calling match.

  8. nemap :: DynGraph gr => (a -> c) -> (b -> d) -> gr a b -> gr c d

    fgl Data.Graph.Inductive.Graph

    Map functions over both the Node and Edge labels in a graph.

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

  10. module Data.Graph.Inductive.NodeMap

    Utility methods to automatically generate and keep track of a mapping between node labels and Nodes.

Page 507 of many | Previous | Next