Port of @mafintosh's flat-tree functions to map a binary tree to a list.
The datkt.flattree package an be installed with NPM.
$ npm install @datkt/flat-tree- Kotlin/Native and the
konanccommand line program. @datkt/konanc-config
## Compile a program in 'main.kt' and link flat-tree libraries found in `node_modules/`
$ konanc main.kt $(konanc-config -clr @datkt/flat-tree) -o main.kexe
$ ./main.kexewhere main.kt might be
import datkt.flattree.*
fun main(args: Array<String>) {
val tree = Tree()
tree.parent(0L, null) // 1L
tree.parent(2L, null) // 1L
tree.parent(1L, null) // 3L
}Returns an array index for the tree element at the given depth and offset
Returns the index of the parent element in tree
Returns the index of this elements sibling
Returns an array [leftChild, rightChild] with the indexes of this elements children.
If this element does not have any children it returns null
Returns the range (inclusive) the tree root at index spans.
For example tree.spans(3) would return [0, 6] (see the usage example).
Returns the left spanning in index in the tree index spans.
Returns the right spanning in index in the tree index spans.
Returns how many nodes (including parent nodes) a tree contains
Returns the depth of an element
Returns the relative offset of an element
Returns a list of all the full roots (subtrees where all nodes have either 2 or 0 children) < index.
For example fullRoots(8) returns [3] since the subtree rooted at 3 spans 0 -> 6 and the tree
rooted at 7 has a child located at 9 which is >= 8.
Move the iterator the next item in the tree.
Move the iterator the prev item in the tree.
Move the iterator the this specific tree index.
Move the iterator to the current parent index
Move the iterator to the current left child index.
Move the iterator to the current right child index.
Move the iterator to the current left span index.
Move the iterator to the current right span index.
Is the iterator at a left sibling?
Is the iterator at a right sibling?
Move the iterator to the current sibling
MIT