Data.Named.Tree

Working with NE trees and forests.

Combine with words

addWords :: Ord k => Forest k -> [k] -> Forest k

Combine the disjoint forest with the list of words. Discontinuities will be patched with no trace.

Span

data Span

Spanning of a tree.

Constructors

Span

Fields

beg :: Int

end :: Int

Instances

Eq Span

Ord Span

Show Span

leafSpan :: Int -> Span

Make span for a leaf node.

(<>) :: Span -> Span -> Span

Minimum span overlapping both input spans.

spanSet :: Span -> IntSet

Set of positions covered by the span.

Trees with span

span :: Tree (a, Span) -> Span

Get span of the span-annotated tree.

spanTree :: (k -> Int) -> Tree k -> Tree (k, Span)

Annotate tree nodes with spanning info given the function which assignes indices to leaf nodes.

spanForest :: (k -> Int) -> Forest k -> Forest (k, Span)

Annotate forest nodes with spanning info.

unSpanTree :: Tree (k, Span) -> Tree k

Remove span annotations from the tree.

unSpanForest :: Forest (k, Span) -> Forest k

Remove span annotations from the forest.

sortTree :: Tree (k, Span) -> Tree (k, Span)

Sort the tree with respect to spanning info.

sortForest :: Forest (k, Span) -> Forest (k, Span)

Sort the forest with respect to spanning info.

Utilities

mapTrees :: (a -> b) -> Forest a -> Forest b

Map function over each tree from the forest.