Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Synopsis
- class HNodes h => HFoldable h where
- hfolded1 :: forall h n p. (HFoldable h, HNodesConstraint h ((~) n)) => Fold (h # p) (p # n)
- htraverse_ :: (Applicative f, HFoldable h) => (forall c. HWitness h c -> (m # c) -> f ()) -> (h # m) -> f ()
- htraverse1_ :: forall f h n p. (Applicative f, HFoldable h, HNodesConstraint h ((~) n)) => ((p # n) -> f ()) -> (h # p) -> f ()
Documentation
class HNodes h => HFoldable h where Source #
Nothing
hfoldMap :: Monoid a => (forall n. HWitness h n -> (p # n) -> a) -> (h # p) -> a Source #
Gets a function from h
's nodes (trees along witnesses that they are nodes of h
)
into a monoid and concats its results for all nodes.
Instances
hfolded1 :: forall h n p. (HFoldable h, HNodesConstraint h ((~) n)) => Fold (h # p) (p # n) Source #
htraverse_ :: (Applicative f, HFoldable h) => (forall c. HWitness h c -> (m # c) -> f ()) -> (h # m) -> f () Source #
htraverse1_ :: forall f h n p. (Applicative f, HFoldable h, HNodesConstraint h ((~) n)) => ((p # n) -> f ()) -> (h # p) -> f () Source #