Contents
Index
rose-trees-0.0.4.5: Various trie implementations in Haskell
Index
@->
Data.Tree.Rose
delete
1 (Function)
Data.Tree.Hash
2 (Function)
Data.Tree.Knuth.Forest
3 (Function)
Data.Tree.Knuth
4 (Function)
Data.Tree.Set
difference
1 (Function)
Data.Tree.Knuth.Forest
2 (Function)
Data.Tree.Knuth
elem
1 (Function)
Data.Tree.Hash
2 (Function)
Data.Tree.Knuth.Forest
3 (Function)
Data.Tree.Knuth
4 (Function)
Data.Tree.Set
elemPath
1 (Function)
Data.Tree.Hash
2 (Function)
Data.Tree.Knuth.Forest
3 (Function)
Data.Tree.Knuth
4 (Function)
Data.Tree.Set
eqHead
1 (Function)
Data.Tree.Hash
2 (Function)
Data.Tree.Set
filter
1 (Function)
Data.Tree.Hash
2 (Function)
Data.Tree.Set
firstTree
Data.Tree.Knuth
Fork
Data.Tree.Knuth.Forest
fromForest
Data.Tree.Knuth.Forest
fromTree
1 (Function)
Data.Tree.Hash
2 (Function)
Data.Tree.Knuth
3 (Function)
Data.Tree.Set
HashTree
1 (Type/Class)
Data.Tree.Hash
2 (Data Constructor)
Data.Tree.Hash
Head
Data.Tree.Rose
insertChild
1 (Function)
Data.Tree.Hash
2 (Function)
Data.Tree.Set
intersection
1 (Function)
Data.Tree.Knuth.Forest
2 (Function)
Data.Tree.Knuth
isChildOf
1 (Function)
Data.Tree.Hash
2 (Function)
Data.Tree.Knuth.Forest
3 (Function)
Data.Tree.Knuth
4 (Function)
Data.Tree.Set
isDescendantOf
1 (Function)
Data.Tree.Hash
2 (Function)
Data.Tree.Knuth.Forest
3 (Function)
Data.Tree.Knuth
4 (Function)
Data.Tree.Set
isProperDescendantOf
1 (Function)
Data.Tree.Knuth.Forest
2 (Function)
Data.Tree.Knuth
isProperSubforestOf
Data.Tree.Knuth.Forest
isProperSubforestOf'
Data.Tree.Knuth.Forest
isProperSubtreeOf
1 (Function)
Data.Tree.Hash
2 (Function)
Data.Tree.Knuth
3 (Function)
Data.Tree.Set
isProperSubtreeOf'
1 (Function)
Data.Tree.Hash
2 (Function)
Data.Tree.Knuth
3 (Function)
Data.Tree.Set
isSiblingOf
Data.Tree.Knuth.Forest
isSubforestOf
Data.Tree.Knuth.Forest
isSubforestOf'
Data.Tree.Knuth.Forest
isSubtreeOf
1 (Function)
Data.Tree.Hash
2 (Function)
Data.Tree.Knuth
3 (Function)
Data.Tree.Set
isSubtreeOf'
1 (Function)
Data.Tree.Hash
2 (Function)
Data.Tree.Knuth
3 (Function)
Data.Tree.Set
kChildren
Data.Tree.Knuth.Forest
kNode
Data.Tree.Knuth.Forest
KnuthForest
Data.Tree.Knuth.Forest
KnuthTree
1 (Type/Class)
Data.Tree.Knuth
2 (Data Constructor)
Data.Tree.Knuth
kSiblings
Data.Tree.Knuth.Forest
map
1 (Function)
Data.Tree.Hash
2 (Function)
Data.Tree.Set
mapMaybe
1 (Function)
Data.Tree.Hash
2 (Function)
Data.Tree.Set
Nil
Data.Tree.Knuth.Forest
RoseTree
Data.Tree.Rose
sChildren
1 (Function)
Data.Tree.Hash
2 (Function)
Data.Tree.Set
SetTree
1 (Type/Class)
Data.Tree.Set
2 (Data Constructor)
Data.Tree.Set
singleton
1 (Function)
Data.Tree.Hash
2 (Function)
Data.Tree.Knuth.Forest
3 (Function)
Data.Tree.Knuth
4 (Function)
Data.Tree.Set
size
1 (Function)
Data.Tree.Hash
2 (Function)
Data.Tree.Knuth.Forest
3 (Function)
Data.Tree.Knuth
4 (Function)
Data.Tree.Set
sNode
1 (Function)
Data.Tree.Hash
2 (Function)
Data.Tree.Set
Tail
Data.Tree.Rose
toForest
Data.Tree.Knuth.Forest
toTree
1 (Function)
Data.Tree.Hash
2 (Function)
Data.Tree.Knuth
3 (Function)
Data.Tree.Set
union
1 (Function)
Data.Tree.Knuth.Forest
2 (Function)
Data.Tree.Knuth
unKnuthTree
Data.Tree.Knuth