Traverses the tree in depth-first order and returns all nodes that satisfy yieldCondition. If enterCondition returns false for a node, its children are not traversed. By default, all nodes are traversed and all nodes are returned.

allChildrenNotNull

internal fun <T> TreeNode<T?>.allChildrenNotNull(): List<TreeNode<T>>

allRemovedColumns

internal fun TreeNode<ColumnPosition>.allRemovedColumns(): List<TreeNode<ColumnPosition>>

allWithColumns

internal fun TreeNode<ColumnPosition>.allWithColumns(): List<TreeNode<ColumnPosition>>

contains

fun contains(childName: String): Boolean

get

open operator override fun get(childName: String): TreeNode<T>?

getAncestor

internal tailrec fun <T> ReadonlyTreeNode<T>.getAncestor(depth: Int): ReadonlyTreeNode<T>

getOrPut

fun getOrPut(childName: String, createData: () -> T): TreeNode<T>

getOrPut

internal fun <T> TreeNode<T?>.getOrPut(path: ColumnPath): TreeNode<T?>

internal fun <T> TreeNode<T>.getOrPut(path: ColumnPath, createData: (ColumnPath) -> T): TreeNode<T>

getOrPutEmpty

internal fun <T> TreeNode<T>.getOrPutEmpty(path: ColumnPath, emptyData: T): TreeNode<T>

getRoot

open override fun getRoot(): TreeNode<T>

pathFromRoot

fun pathFromRoot(): ColumnPath

put

internal fun <T> TreeNode<T?>.put(path: ColumnPath, data: T): TreeNode<T?>

toColumnWithPath

internal fun <C> TreeNode<ColumnPosition>.toColumnWithPath(): ColumnWithPath<C>

topmostChildren

internal fun <T> TreeNode<T>.topmostChildren(yieldCondition: (TreeNode<T>) -> Boolean): List<TreeNode<T>>

Traverses all children in the tree in depth-first order and returns the top-most nodes that satisfy yieldCondition. This means that if a node satisfies yieldCondition, its children are not traversed, regardless of whether they satisfy yieldCondition or not.

topmostChildrenExcluding

internal fun <T> TreeNode<T>.topmostChildrenExcluding(excludeRoot: TreeNode<*>): List<TreeNode<T>>

topmostChildrenNotNull

internal fun <T> TreeNode<T?>.topmostChildrenNotNull(): List<TreeNode<T>>