napkin-0.5.9
Copyright(c) Soostone Inc 2020
LicenseAllRightsReserved
Stabilityexperimental
PortabilityPOSIX
Safe HaskellNone
LanguageHaskell2010

Napkin.Optimization.UnusedCteFields.Visitor

Description

 

Documentation

visitSumOfSExpTypes :: Monad m => SExpReducer args b m -> args -> SumOfSExpTypes -> b -> m b #

class Monad m => ControllableTraverse funArgs nodeSum (m :: Type -> Type) | m -> funArgs nodeSum where #

Methods

replaceBranch :: nodeSum -> m () #

pushSubNodeArgs :: funArgs -> m () #

getNodeArgs :: m funArgs #

Instances

Instances details
Monad m => ControllableTraverse funArgs nodeSum (ControllableTraverseT funArgs nodeSum m) 
Instance details

Defined in MutuallyRecursiveTypesVisitor.Lib

Methods

replaceBranch :: nodeSum -> ControllableTraverseT funArgs nodeSum m () #

pushSubNodeArgs :: funArgs -> ControllableTraverseT funArgs nodeSum m () #

getNodeArgs :: ControllableTraverseT funArgs nodeSum m funArgs #

type SExpList = [SExp] #