btree -package:gi-gio
Not on Stackage, so not searched.
B-Tree on Unmanaged Heap
Binary trees with data at internal nodes.
Finite map from text to token organized as binary search tree.
Not on Stackage, so not searched.
A backend agnostic, concurrent BTree
Return all subtrees in a tree, in preorder.
Direct subtrees of a tree
converts a navigable tree in a n-ary tree
Select parts of an XML tree by a string representing an XPath
expression.
The main filter for selecting parts of an arbitrary XML tree via
XPath. The string argument must be a XPath expression with an absolute
location path, There are no restrictions on the arument tree.
No canonicalization is performed before evaluating the query
Result is a possibly empty list of XmlTrees forming the set of
selected XPath values. XPath values other than XmlTrees (numbers,
attributes, tagnames, ...) are convertet to text nodes.
Select parts of an XML tree by an XPath expression.
Search the given list, and return the 1st tree after the given point
on the given line. This is the tree that will be moved if something is
inserted at the point. Precondition: point is in the given line.
Given a tree, return (first offset, number of lines).