Hyper.Type.Prune
data Prune h Source #
Constructors
Defined in Hyper.Type.Prune
Associated Types
type HNodesConstraint Prune c Source #
type HWitnessType Prune :: HyperType -> Type Source #
Methods
hLiftConstraint :: forall c (n :: HyperType) r. HNodesConstraint Prune c => HWitness Prune n -> Proxy c -> (c n => r) -> r Source #
hpure :: (forall (n :: HyperType). HWitness Prune n -> p # n) -> Prune # p Source #
hmap :: (forall (n :: HyperType). HWitness Prune n -> (p # n) -> q # n) -> (Prune # p) -> Prune # q Source #
hfoldMap :: Monoid a => (forall (n :: HyperType). HWitness Prune n -> (p # n) -> a) -> (Prune # p) -> a Source #
hsequence :: forall f (p :: AHyperType -> Type). Applicative f => (Prune # ContainedH f p) -> f (Prune # p) Source #
hzip :: forall (p :: HyperType) (q :: HyperType). (Prune # p) -> (Prune # q) -> Prune # (p :*: q) Source #
zipMatch :: forall (p :: HyperType) (q :: HyperType). (Prune # p) -> (Prune # q) -> Maybe (Prune # (p :*: q)) Source #
recursiveHTraversable :: proxy Prune -> Dict (HNodesConstraint Prune RTraversable) Source #
recursiveHNodes :: proxy Prune -> Dict (HNodesConstraint Prune RNodes) Source #
hcontext :: forall (p :: HyperType). (Prune # p) -> Prune # (HFunc p (Const (Prune # p)) :*: p) Source #
recursively :: proxy (c Prune) -> Dict (c Prune, HNodesConstraint Prune (Recursively c)) Source #
inferBody :: forall (h :: AHyperType -> Type). (HCompose Prune t # InferChild m h) -> m (HCompose Prune t # h, InferOf (HCompose Prune t) # UVarOf m) Source #
inferContext :: proxy0 m -> proxy1 (HCompose Prune t) -> Dict (HNodesConstraint (HCompose Prune t) (Infer m), HNodesConstraint (InferOf (HCompose Prune t)) (UnifyGen m)) Source #
inferOfUnify :: Proxy (HCompose Prune t) -> (InferOf (HCompose Prune t) # UVarOf m) -> (InferOf (HCompose Prune t) # UVarOf m) -> m () Source #
inferOfMatches :: Proxy (HCompose Prune t) -> (InferOf (HCompose Prune t) # UVarOf m) -> (InferOf (HCompose Prune t) # UVarOf m) -> m Bool Source #
blamableRecursive :: Proxy m -> Proxy (HCompose Prune t) -> Dict (HNodesConstraint (HCompose Prune t) (Blame m)) Source #
(==) :: Prune h -> Prune h -> Bool #
(/=) :: Prune h -> Prune h -> Bool #
compare :: Prune h -> Prune h -> Ordering #
(<) :: Prune h -> Prune h -> Bool #
(<=) :: Prune h -> Prune h -> Bool #
(>) :: Prune h -> Prune h -> Bool #
(>=) :: Prune h -> Prune h -> Bool #
max :: Prune h -> Prune h -> Prune h #
min :: Prune h -> Prune h -> Prune h #
showsPrec :: Int -> Prune h -> ShowS #
show :: Prune h -> String #
showList :: [Prune h] -> ShowS #
type Rep (Prune h) :: Type -> Type #
from :: Prune h -> Rep (Prune h) x #
to :: Rep (Prune h) x -> Prune h #
put :: Prune h -> Put #
get :: Get (Prune h) #
putList :: [Prune h] -> Put #
rnf :: Prune h -> () #
data W_Prune node where Source #
_Pruned :: forall h. Prism' (Prune h) () Source #
_Unpruned :: forall h h. Prism (Prune h) (Prune h) ((:#) h Prune) ((:#) h Prune) Source #