rose-trees-0.0.3: A collection of rose tree structures.

Safe HaskellNone
LanguageHaskell2010

Data.Tree.Knuth.Forest

Contents

Synopsis

Forest

data KnuthForest a Source

Constructors

Fork 
Nil 

Instances

Monad KnuthForest Source

Breadth-first

Functor KnuthForest Source 
Applicative KnuthForest Source

Zippy

Foldable KnuthForest Source

Breadth-first

Traversable KnuthForest Source 
Alternative KnuthForest Source 
MonadPlus KnuthForest Source 
Witherable KnuthForest Source 
RoseTree KnuthForest Source 
HasSingleton a (KnuthForest a) Source 
Eq a => HasDelete a (KnuthForest a) Source 
Eq a => Eq (KnuthForest a) Source 
Data a => Data (KnuthForest a) Source 
Ord a => Ord (KnuthForest a) Source

Siblings before children

Show a => Show (KnuthForest a) Source 
Generic (KnuthForest a) Source 
Monoid (KnuthForest a) Source 
NFData a => NFData (KnuthForest a) Source 
Semigroup (KnuthForest a) Source 
HasUnion (KnuthForest a) Source 
HasSize (KnuthForest a) Source 
Eq a => HasIntersection (KnuthForest a) Source 
HasEmpty (KnuthForest a) Source 
Eq a => HasDifference (KnuthForest a) Source 
Arbitrary a => Arbitrary (KnuthForest a) Source 
type Rep (KnuthForest a) Source 
type Tail (KnuthForest a) = KnuthForest a Source 
type Head (KnuthForest a) = a Source 

Query

elem :: Eq a => a -> KnuthForest a -> Bool Source

isChildOf :: Eq a => a -> KnuthForest a -> Bool Source

depth of one

Construction

delete :: Eq a => a -> KnuthForest a -> KnuthForest a Source

Combination

difference :: Eq a => KnuthForest a -> KnuthForest a -> KnuthForest a Source

Removes the possible subtree on the right, from the left.