Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Documentation
Node | |
|
Instances
Foldable (Tree e) Source # | |
Defined in Math.Tools.Tree fold :: Monoid m => Tree e m -> m # foldMap :: Monoid m => (a -> m) -> Tree e a -> m # foldMap' :: Monoid m => (a -> m) -> Tree e a -> m # foldr :: (a -> b -> b) -> b -> Tree e a -> b # foldr' :: (a -> b -> b) -> b -> Tree e a -> b # foldl :: (b -> a -> b) -> b -> Tree e a -> b # foldl' :: (b -> a -> b) -> b -> Tree e a -> b # foldr1 :: (a -> a -> a) -> Tree e a -> a # foldl1 :: (a -> a -> a) -> Tree e a -> a # elem :: Eq a => a -> Tree e a -> Bool # maximum :: Ord a => Tree e a -> a # minimum :: Ord a => Tree e a -> a # | |
Traversable (Tree e) Source # | |
Monoid e => Applicative (Tree e) Source # | |
Functor (Tree e) Source # | |
(Monoid n, Monoid e) => Monoid (Tree e n) Source # | |
(Semigroup n, Semigroup e) => Semigroup (Tree e n) Source # | |
(Num n, Ord e, Semigroup e) => Num (Tree e n) Source # | |
(Show n, Show e) => Show (Tree e n) Source # | |
(Binary e, Binary n) => Binary (Tree e n) Source # | |
(PpShow n, PpShow e) => PpShow (Tree e n) Source # | |
Defined in Math.Tools.Tree | |
Builder (Tree e n) Source # | |
Visitor (Tree e n) Source # | |
data Fold (Tree e n) a Source # | |
Defined in Math.Tools.Tree | |
data Unfold (Tree e n) a Source # | |
Defined in Math.Tools.Tree |
join_lists :: Ord e => (a -> a -> a) -> [(e, a)] -> [(e, a)] -> [(e, a)] Source #
has_children :: Tree e n -> Bool Source #
tree_level :: Integer -> Forest n e -> [n] Source #
next_level :: Forest n e -> Forest n e Source #
edges_below_roots :: Forest n e -> [e] Source #
edges_below :: Tree e n -> [e] Source #
forest_below :: Tree e n -> Forest n e Source #
edge_count :: Tree e n -> Int Source #
node_count :: Tree e n -> Int Source #
tree_leaves :: Tree e n -> [n] Source #
tree_depth :: Tree e n -> Int Source #
leavesFold :: Fold (Tree e n) [n] Source #
edges_starting_from :: Tree e n -> [e] Source #
child_forest :: Tree e n -> Forest n e Source #