ZipperAG-1.0.0: An implementation of Attribute Grammars using Functional Zippers
Safe HaskellSafe-Inferred
LanguageHaskell2010

Language.ZipperAG.Examples.BreadthFirst

Documentation

data Root Source #

Constructors

Root Tree 

Instances

Instances details
Data Root Source # 
Instance details

Defined in Language.ZipperAG.Examples.BreadthFirst

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Root -> c Root #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Root #

toConstr :: Root -> Constr #

dataTypeOf :: Root -> DataType #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Root) #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Root) #

gmapT :: (forall b. Data b => b -> b) -> Root -> Root #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Root -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Root -> r #

gmapQ :: (forall d. Data d => d -> u) -> Root -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Root -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Root -> m Root #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Root -> m Root #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Root -> m Root #

Show Root Source # 
Instance details

Defined in Language.ZipperAG.Examples.BreadthFirst

Methods

showsPrec :: Int -> Root -> ShowS #

show :: Root -> String #

showList :: [Root] -> ShowS #

data Tree Source #

Constructors

Fork Int Tree Tree 
Empty 

Instances

Instances details
Data Tree Source # 
Instance details

Defined in Language.ZipperAG.Examples.BreadthFirst

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Tree -> c Tree #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Tree #

toConstr :: Tree -> Constr #

dataTypeOf :: Tree -> DataType #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Tree) #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Tree) #

gmapT :: (forall b. Data b => b -> b) -> Tree -> Tree #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Tree -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Tree -> r #

gmapQ :: (forall d. Data d => d -> u) -> Tree -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Tree -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Tree -> m Tree #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Tree -> m Tree #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Tree -> m Tree #

Show Tree Source # 
Instance details

Defined in Language.ZipperAG.Examples.BreadthFirst

Methods

showsPrec :: Int -> Tree -> ShowS #

show :: Tree -> String #

showList :: [Tree] -> ShowS #

constructor :: Typeable a => Zipper a -> String Source #

slist :: Zipper Root -> [Int] Source #

replace :: Zipper Root -> Tree Source #

ilist :: Zipper Root -> [Int] Source #

tree :: Tree Source #

semantics :: Tree Source #