Maintainer	bastiaan.heeren@ou.nl
Stability	provisional
Portability	portable (depends on ghc)
Safe Haskell	None
Language	Haskell98

Ideas.Common.Strategy.CyclicTree

Contents

Data type
Constructor functions
Querying
Replace functions
Fold and algebra

Description

Synopsis

Data type

data CyclicTree a b Source #

Instances

BiFunctor CyclicTree Source #
Methods biMap :: (a -> c) -> (b -> d) -> CyclicTree a b -> CyclicTree c d Source # mapFirst :: (a -> b) -> CyclicTree a c -> CyclicTree b c Source # mapSecond :: (b -> c) -> CyclicTree a b -> CyclicTree a c Source #
Monad (CyclicTree d) Source #
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) Source #
Methods fmap :: (a -> b) -> CyclicTree d a -> CyclicTree d b # (<$) :: a -> CyclicTree d b -> CyclicTree d a #
Applicative (CyclicTree d) Source #
Methods pure :: a -> CyclicTree d a # (<>) :: CyclicTree d (a -> b) -> CyclicTree d a -> CyclicTree d b # (>) :: CyclicTree d a -> CyclicTree d b -> CyclicTree d b # (<*) :: CyclicTree d a -> CyclicTree d b -> CyclicTree d a #
Foldable (CyclicTree d) Source #
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) Source #
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) Source #
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) Source #
Methods arbitrary :: Gen (CyclicTree a b) # shrink :: CyclicTree a b -> [CyclicTree a b] #
Fix (CyclicTree a b) Source #
Methods fix :: (CyclicTree a b -> CyclicTree a b) -> CyclicTree a b Source #