Ideas.Common.Strategy.CyclicTree

Data type

data CyclicTree a b

Instances

BiFunctor CyclicTree

Methods

biMap :: (a -> c) -> (b -> d) -> CyclicTree a b -> CyclicTree c d

mapFirst :: (a -> b) -> CyclicTree a c -> CyclicTree b c

mapSecond :: (b -> c) -> CyclicTree a b -> CyclicTree a c

Monad (CyclicTree d)

Methods

(>>=) :: CyclicTree d a -> (a -> CyclicTree d b) -> CyclicTree d b

(>>) :: CyclicTree d a -> CyclicTree d b -> CyclicTree d b

return :: a -> CyclicTree d a

fail :: String -> CyclicTree d a

Functor (CyclicTree d)

Methods

fmap :: (a -> b) -> CyclicTree d a -> CyclicTree d b

(<$) :: a -> CyclicTree d b -> CyclicTree d a

Applicative (CyclicTree d)

Methods

pure :: a -> CyclicTree d a

(<*>) :: CyclicTree d (a -> b) -> CyclicTree d a -> CyclicTree d b

liftA2 :: (a -> b -> c) -> CyclicTree d a -> CyclicTree d b -> CyclicTree d c

(*>) :: CyclicTree d a -> CyclicTree d b -> CyclicTree d b

(<*) :: CyclicTree d a -> CyclicTree d b -> CyclicTree d a

Foldable (CyclicTree d)

Methods

fold :: Monoid m => CyclicTree d m -> m

foldMap :: Monoid m => (a -> m) -> CyclicTree d a -> m

foldr :: (a -> b -> b) -> b -> CyclicTree d a -> b

foldr' :: (a -> b -> b) -> b -> CyclicTree d a -> b

foldl :: (b -> a -> b) -> b -> CyclicTree d a -> b

foldl' :: (b -> a -> b) -> b -> CyclicTree d a -> b

foldr1 :: (a -> a -> a) -> CyclicTree d a -> a

foldl1 :: (a -> a -> a) -> CyclicTree d a -> a

toList :: CyclicTree d a -> [a]

null :: CyclicTree d a -> Bool

length :: CyclicTree d a -> Int

elem :: Eq a => a -> CyclicTree d a -> Bool

maximum :: Ord a => CyclicTree d a -> a

minimum :: Ord a => CyclicTree d a -> a

sum :: Num a => CyclicTree d a -> a

product :: Num a => CyclicTree d a -> a

Traversable (CyclicTree d)

Methods

traverse :: Applicative f => (a -> f b) -> CyclicTree d a -> f (CyclicTree d b)

sequenceA :: Applicative f => CyclicTree d (f a) -> f (CyclicTree d a)

mapM :: Monad m => (a -> m b) -> CyclicTree d a -> m (CyclicTree d b)

sequence :: Monad m => CyclicTree d (m a) -> m (CyclicTree d a)

(Show a, Show b) => Show (CyclicTree a b)

Methods

showsPrec :: Int -> CyclicTree a b -> ShowS

show :: CyclicTree a b -> String

showList :: [CyclicTree a b] -> ShowS

(Arbitrary a, Arbitrary b) => Arbitrary (CyclicTree a b)

Methods

arbitrary :: Gen (CyclicTree a b)

shrink :: CyclicTree a b -> [CyclicTree a b]

Fix (CyclicTree a b)

Methods

fix :: (CyclicTree a b -> CyclicTree a b) -> CyclicTree a b

Constructor functions

node :: a -> [CyclicTree a b] -> CyclicTree a b

node0 :: a -> CyclicTree a b

node1 :: a -> CyclicTree a b -> CyclicTree a b

node2 :: a -> CyclicTree a b -> CyclicTree a b -> CyclicTree a b

leaf :: b -> CyclicTree a b

label :: IsId n => n -> CyclicTree a b -> CyclicTree a b

Querying

isNode :: CyclicTree a b -> Maybe (a, [CyclicTree a b])

isLeaf :: CyclicTree a b -> Maybe b

isLabel :: CyclicTree a b -> Maybe (Id, CyclicTree a b)

Replace functions

replaceNode :: (a -> [CyclicTree a b] -> CyclicTree a b) -> CyclicTree a b -> CyclicTree a b

replaceLeaf :: (b -> CyclicTree a c) -> CyclicTree a b -> CyclicTree a c

replaceLabel :: (Id -> CyclicTree a b -> CyclicTree a b) -> CyclicTree a b -> CyclicTree a b

shrinkTree :: CyclicTree a b -> [CyclicTree a b]

Fold and algebra

fold :: CyclicTreeAlg a b t -> CyclicTree a b -> t

foldUnwind :: CyclicTreeAlg a b t -> CyclicTree a b -> t

data CyclicTreeAlg a b t

fNode :: CyclicTreeAlg a b t -> a -> [t] -> t

fLeaf :: CyclicTreeAlg a b t -> b -> t

fLabel :: CyclicTreeAlg a b t -> Id -> t -> t

fRec :: CyclicTreeAlg a b t -> Int -> t -> t

fVar :: CyclicTreeAlg a b t -> Int -> t

emptyAlg :: CyclicTreeAlg a b t

monoidAlg :: Monoid m => CyclicTreeAlg a b m