Safe Haskell	Safe-Inferred
Language	Haskell2010

Math.Tools.Tree

Synopsis

data Tree e n = Node {
- root_label :: n
- children :: [(e, Tree e n)]
}
type Path e = [e]
type Forest n e = [Tree e n]
pattern LeafNode :: n -> Tree e n
pattern Edge :: n -> e -> Tree e n -> Tree e n
pattern BinNode :: n -> Tree Bool n -> Tree Bool n -> Tree Bool n
joinLists :: Ord e => (a -> a -> a) -> [(e, a)] -> [(e, a)] -> [(e, a)]
tlookup :: (Show e, Eq e, MonadFail m) => Tree e n -> Path e -> m (Tree e n)
hasChildren :: Tree e n -> Bool
mapTree :: (e -> e') -> (n -> n') -> Tree e n -> Tree e' n'
mapEdges :: (e -> e') -> Tree e n -> Tree e' n
leaf :: n -> Tree e n
singleton :: n -> (e, n) -> Tree e n
depthTree :: n -> [(e, n)] -> Tree e n
treeNode :: n -> [(e, Tree e n)] -> Tree e n
treeLevel :: Integer -> Forest n e -> [n]
roots :: Forest n e -> [n]
treeSumLevels :: Num n => Tree e n -> [n]
forestSumLevels :: Num n => Forest n e -> [n]
treeLevels :: Monoid n => Tree e n -> [n]
treeFoldLevels :: ([n] -> n) -> Tree e n -> [n]
forestFoldLevels :: ([n] -> n) -> Forest n e -> [n]
nextLevel :: Forest n e -> Forest n e
edgesBelowRoots :: Forest n e -> [e]
edgesBelow :: Tree e n -> [e]
forestBelow :: Tree e n -> Forest n e
edgeCount :: Tree e n -> Int
nodeCount :: Tree e n -> Int
treeLeaves :: Tree e n -> [n]
treeDepth :: Tree e n -> Int
treeNodes :: Tree e n -> [n]
treeEdges :: Tree e n -> [e]
treePaths :: Monoid e => Tree e n -> [e]
edgeCountFold :: Fold (Tree e n) Int
nodeCountFold :: Fold (Tree e n) Int
depthFold :: Fold (Tree e n) Int
nodesFold :: Fold (Tree e n) [n]
edgesFold :: Fold (Tree e n) [e]
pathsFold :: Monoid e => Fold (Tree e n) [e]
leavesFold :: Fold (Tree e n) [n]
edgesStartingFrom :: Tree e n -> [e]
childForest :: Tree e n -> Forest n e
findChild :: (MonadFail m, Eq e, Show e) => e -> Tree e n -> m (Tree e n)
treeFindSubtree :: (MonadFail m, Show e, Eq e) => Path e -> Tree e n -> m (Tree e n)

Documentation

data Tree e n Source #

Constructors

Node
Fields root_label :: n children :: [(e, Tree e n)]

Instances

Instances details

Foldable (Tree e) Source #
Instance details Defined in Math.Tools.Tree Methods 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 # toList :: Tree e a -> [a] # null :: Tree e a -> Bool # length :: Tree e a -> Int # elem :: Eq a => a -> Tree e a -> Bool # maximum :: Ord a => Tree e a -> a # minimum :: Ord a => Tree e a -> a # sum :: Num a => Tree e a -> a # product :: Num a => Tree e a -> a #
Traversable (Tree e) Source #
Instance details Defined in Math.Tools.Tree Methods traverse :: Applicative f => (a -> f b) -> Tree e a -> f (Tree e b) # sequenceA :: Applicative f => Tree e (f a) -> f (Tree e a) # mapM :: Monad m => (a -> m b) -> Tree e a -> m (Tree e b) # sequence :: Monad m => Tree e (m a) -> m (Tree e a) #
Monoid e => Applicative (Tree e) Source #
Instance details Defined in Math.Tools.Tree Methods pure :: a -> Tree e a # (<>) :: Tree e (a -> b) -> Tree e a -> Tree e b # liftA2 :: (a -> b -> c) -> Tree e a -> Tree e b -> Tree e c # (>) :: Tree e a -> Tree e b -> Tree e b # (<*) :: Tree e a -> Tree e b -> Tree e a #
Functor (Tree e) Source #
Instance details Defined in Math.Tools.Tree Methods fmap :: (a -> b) -> Tree e a -> Tree e b # (<$) :: a -> Tree e b -> Tree e a #
(Monoid n, Monoid e) => Monoid (Tree e n) Source #
Instance details Defined in Math.Tools.Tree Methods mempty :: Tree e n # mappend :: Tree e n -> Tree e n -> Tree e n # mconcat :: [Tree e n] -> Tree e n #
(Semigroup n, Semigroup e) => Semigroup (Tree e n) Source #
Instance details Defined in Math.Tools.Tree Methods (<>) :: Tree e n -> Tree e n -> Tree e n # sconcat :: NonEmpty (Tree e n) -> Tree e n # stimes :: Integral b => b -> Tree e n -> Tree e n #
(Num n, Ord e, Semigroup e) => Num (Tree e n) Source #
Instance details Defined in Math.Tools.Tree Methods (+) :: Tree e n -> Tree e n -> Tree e n # (-) :: Tree e n -> Tree e n -> Tree e n # (*) :: Tree e n -> Tree e n -> Tree e n # negate :: Tree e n -> Tree e n # abs :: Tree e n -> Tree e n # signum :: Tree e n -> Tree e n # fromInteger :: Integer -> Tree e n #
(Show n, Show e) => Show (Tree e n) Source #
Instance details Defined in Math.Tools.Tree Methods showsPrec :: Int -> Tree e n -> ShowS # show :: Tree e n -> String # showList :: [Tree e n] -> ShowS #
(Binary e, Binary n) => Binary (Tree e n) Source #
Instance details Defined in Math.Tools.Tree Methods put :: Tree e n -> Put # get :: Get (Tree e n) # putList :: [Tree e n] -> Put #
(VectorSpace n, Ord e) => VectorSpace (Tree e n) Source #
Instance details Defined in Math.Tools.Tree Associated Types type Scalar (Tree e n) Source # Methods vzero :: Tree e n Source # vnegate :: Tree e n -> Tree e n Source # (%+) :: Tree e n -> Tree e n -> Tree e n Source # (%*) :: Scalar (Tree e n) -> Tree e n -> Tree e n Source #
(PpShow n, PpShow e) => PpShow (Tree e n) Source #
Instance details Defined in Math.Tools.Tree Methods pp :: Tree e n -> Doc Source #
Builder (Tree e n) Source #
Instance details Defined in Math.Tools.Tree Associated Types data Unfold (Tree e n) :: Type -> Type Source # Methods build :: Unfold (Tree e n) a -> a -> Tree e n Source #
Visitor (Tree e n) Source #
Instance details Defined in Math.Tools.Tree Associated Types data Fold (Tree e n) :: Type -> Type Source # Methods visit :: Fold (Tree e n) a -> Tree e n -> a Source #
type Scalar (Tree e n) Source #
Instance details Defined in Math.Tools.Tree type Scalar (Tree e n) = Scalar n
data Fold (Tree e n) a Source #
Instance details Defined in Math.Tools.Tree data Fold (Tree e n) a = TreeFold (n -> [a] -> a) (e -> a -> a)
data Unfold (Tree e n) a Source #
Instance details Defined in Math.Tools.Tree data Unfold (Tree e n) a = TreeUnfold (a -> (n, [(e, a)]))