Rasa.Ext.Views.Internal.BiTree

Documentation

data BiTree b l

Constructors

Branch b (BiTree b l) (BiTree b l)

Leaf l

Instances

Bifunctor BiTree

Methods

bimap :: (a -> b) -> (c -> d) -> BiTree a c -> BiTree b d

first :: (a -> b) -> BiTree a c -> BiTree b c

second :: (b -> c) -> BiTree a b -> BiTree a c

Functor (BiTree b)

Methods

fmap :: (a -> b) -> BiTree b a -> BiTree b b

(<$) :: a -> BiTree b b -> BiTree b a

Foldable (BiTree b)

Methods

fold :: Monoid m => BiTree b m -> m

foldMap :: Monoid m => (a -> m) -> BiTree b a -> m

foldr :: (a -> b -> b) -> b -> BiTree b a -> b

foldr' :: (a -> b -> b) -> b -> BiTree b a -> b

foldl :: (b -> a -> b) -> b -> BiTree b a -> b

foldl' :: (b -> a -> b) -> b -> BiTree b a -> b

foldr1 :: (a -> a -> a) -> BiTree b a -> a

foldl1 :: (a -> a -> a) -> BiTree b a -> a

toList :: BiTree b a -> [a]

null :: BiTree b a -> Bool

length :: BiTree b a -> Int

elem :: Eq a => a -> BiTree b a -> Bool

maximum :: Ord a => BiTree b a -> a

minimum :: Ord a => BiTree b a -> a

sum :: Num a => BiTree b a -> a

product :: Num a => BiTree b a -> a

Traversable (BiTree b)

Methods

traverse :: Applicative f => (a -> f b) -> BiTree b a -> f (BiTree b b)

sequenceA :: Applicative f => BiTree b (f a) -> f (BiTree b a)

mapM :: Monad m => (a -> m b) -> BiTree b a -> m (BiTree b b)

sequence :: Monad m => BiTree b (m a) -> m (BiTree b a)

(Show l, Show b) => Show (BiTree b l)

Methods

showsPrec :: Int -> BiTree b l -> ShowS

show :: BiTree b l -> String

showList :: [BiTree b l] -> ShowS

Recursive (BiTree a b)

Methods

project :: BiTree a b -> Base (BiTree a b) (BiTree a b)

cata :: (Base (BiTree a b) a -> a) -> BiTree a b -> a

para :: (Base (BiTree a b) (BiTree a b, a) -> a) -> BiTree a b -> a

gpara :: (Corecursive (BiTree a b), Comonad w) => (forall c. Base (BiTree a b) (w c) -> w (Base (BiTree a b) c)) -> (Base (BiTree a b) (EnvT (BiTree a b) w a) -> a) -> BiTree a b -> a

prepro :: Corecursive (BiTree a b) => (forall c. Base (BiTree a b) c -> Base (BiTree a b) c) -> (Base (BiTree a b) a -> a) -> BiTree a b -> a

gprepro :: (Corecursive (BiTree a b), Comonad w) => (forall c. Base (BiTree a b) (w c) -> w (Base (BiTree a b) c)) -> (forall c. Base (BiTree a b) c -> Base (BiTree a b) c) -> (Base (BiTree a b) (w a) -> a) -> BiTree a b -> a

Corecursive (BiTree a b)

Methods

embed :: Base (BiTree a b) (BiTree a b) -> BiTree a b

ana :: (a -> Base (BiTree a b) a) -> a -> BiTree a b

apo :: (a -> Base (BiTree a b) (Either (BiTree a b) a)) -> a -> BiTree a b

postpro :: Recursive (BiTree a b) => (forall c. Base (BiTree a b) c -> Base (BiTree a b) c) -> (a -> Base (BiTree a b) a) -> a -> BiTree a b

gpostpro :: (Recursive (BiTree a b), Monad m) => (forall c. m (Base (BiTree a b) c) -> Base (BiTree a b) (m c)) -> (forall c. Base (BiTree a b) c -> Base (BiTree a b) c) -> (a -> Base (BiTree a b) (m a)) -> a -> BiTree a b

type Base (BiTree a b)

type Base (BiTree a b) = BiTreeF a b

data BiTreeF b l r

Constructors

BranchF b r r

LeafF l

Instances

Functor (BiTreeF b l)

Methods

fmap :: (a -> b) -> BiTreeF b l a -> BiTreeF b l b

(<$) :: a -> BiTreeF b l b -> BiTreeF b l a

(Show l, Show r, Show b) => Show (BiTreeF b l r)

Methods

showsPrec :: Int -> BiTreeF b l r -> ShowS

show :: BiTreeF b l r -> String

showList :: [BiTreeF b l r] -> ShowS