HaTeX-3.17.3.1: The Haskell LaTeX library.
Text.LaTeX.Packages.Trees
Contents
Description
Tree definition with some class instances.
Synopsis
data Tree a Source #
Tree datatype.
Constructors
Leafs are non-empty.
Node values are optional.
Instances
Methods
fmap :: (a -> b) -> Tree a -> Tree b #
(<$) :: a -> Tree b -> Tree a #
fold :: Monoid m => Tree m -> m #
foldMap :: Monoid m => (a -> m) -> Tree a -> m #
foldr :: (a -> b -> b) -> b -> Tree a -> b #
foldr' :: (a -> b -> b) -> b -> Tree a -> b #
foldl :: (b -> a -> b) -> b -> Tree a -> b #
foldl' :: (b -> a -> b) -> b -> Tree a -> b #
foldr1 :: (a -> a -> a) -> Tree a -> a #
foldl1 :: (a -> a -> a) -> Tree a -> a #
toList :: Tree a -> [a] #
null :: Tree a -> Bool #
length :: Tree a -> Int #
elem :: Eq a => a -> Tree a -> Bool #
maximum :: Ord a => Tree a -> a #
minimum :: Ord a => Tree a -> a #
sum :: Num a => Tree a -> a #
product :: Num a => Tree a -> a #
traverse :: Applicative f => (a -> f b) -> Tree a -> f (Tree b) #
sequenceA :: Applicative f => Tree (f a) -> f (Tree a) #
mapM :: Monad m => (a -> m b) -> Tree a -> m (Tree b) #
sequence :: Monad m => Tree (m a) -> m (Tree a) #