Data.Tree.Knuth

An implementation of left-child, right-sibling binary trees.

Documentation

newtype KnuthTree a

Constructors

KnuthTree

Fields

unKnuthTree :: (a, KnuthForest a)

Instances

Monad KnuthTree

Functor KnuthTree

Applicative KnuthTree

Foldable KnuthTree

Traversable KnuthTree

RoseTree KnuthTree

HasSingleton a (KnuthTree a)

Eq a => Eq (KnuthTree a)

Data a => Data (KnuthTree a)

Show a => Show (KnuthTree a)

Generic (KnuthTree a)

NFData a => NFData (KnuthTree a)

Semigroup (KnuthTree a)

HasUnion (KnuthTree a)

HasSize (KnuthTree a)

Arbitrary a => Arbitrary (KnuthTree a)

type Rep (KnuthTree a)

type Tail (KnuthTree a) = KnuthForest a

type Head (KnuthTree a) = a

firstTree :: KnuthForest a -> Maybe (KnuthTree a)

Query

size :: KnuthTree a -> Int

elem :: Eq a => a -> KnuthTree a -> Bool

isSubtreeOf :: Eq a => KnuthTree a -> KnuthTree a -> Bool

isSubtreeOf' :: Eq a => KnuthTree a -> KnuthTree a -> Bool

Bottom-up depth-first

isProperSubtreeOf :: Eq a => KnuthTree a -> KnuthTree a -> Bool

isProperSubtreeOf' :: Eq a => KnuthTree a -> KnuthTree a -> Bool

Bottom-up depth-first

isChildOf :: Eq a => a -> KnuthTree a -> Bool

isDescendantOf :: Eq a => a -> KnuthTree a -> Bool

isProperDescendantOf :: Eq a => a -> KnuthTree a -> Bool

Construction

singleton :: a -> KnuthTree a

delete :: Eq a => a -> KnuthTree a -> Maybe (KnuthTree a)

Combination

union :: KnuthTree a -> KnuthTree a -> KnuthTree a

intersection :: Eq a => KnuthTree a -> KnuthTree a -> Maybe (KnuthTree a)

difference :: Eq a => KnuthTree a -> KnuthTree a -> Maybe (KnuthTree a)