Safe Haskell | None |
---|---|
Language | Haskell2010 |
A variant of Traversable
for HyperType
s
Synopsis
- class (HFunctor h, HFoldable h) => HTraversable h where
- hsequence :: Applicative f => (h # ContainedH f p) -> f (h # p)
- newtype ContainedH f p (h :: AHyperType) = MkContainedH {
- runContainedH :: f (p h)
- _ContainedH :: Iso (ContainedH f0 p0 # k0) (ContainedH f1 p1 # k1) (f0 (p0 # k0)) (f1 (p1 # k1))
- htraverse :: (Applicative f, HTraversable h) => (forall n. HWitness h n -> (p # n) -> f (q # n)) -> (h # p) -> f (h # q)
- htraverse1 :: (HTraversable h, HNodesConstraint h ((~) n)) => Traversal (h # p) (h # q) (p # n) (q # n)
Documentation
class (HFunctor h, HFoldable h) => HTraversable h where Source #
A variant of Traversable
for HyperType
s
Nothing
hsequence :: Applicative f => (h # ContainedH f p) -> f (h # p) Source #
HTraversable
variant of sequenceA
default hsequence :: (Generic1 h, HTraversable (Rep1 h), Applicative f) => (h # ContainedH f p) -> f (h # p) Source #
Instances
newtype ContainedH f p (h :: AHyperType) Source #
MkContainedH | |
|
_ContainedH :: Iso (ContainedH f0 p0 # k0) (ContainedH f1 p1 # k1) (f0 (p0 # k0)) (f1 (p1 # k1)) Source #
An Iso
for the ContainedH
newtype
htraverse :: (Applicative f, HTraversable h) => (forall n. HWitness h n -> (p # n) -> f (q # n)) -> (h # p) -> f (h # q) Source #
HTraversable
variant of traverse
htraverse1 :: (HTraversable h, HNodesConstraint h ((~) n)) => Traversal (h # p) (h # q) (p # n) (q # n) Source #
HTraversable
variant of traverse
for HyperType
s with a single node type.
It is a valid Traversal
as it avoids using RankNTypes
.