core/org.jetbrains.kotlinx.dataframe.impl.columns.tree

Package-level declarations

Types

internal data class ColumnPosition(val originalIndex: Int, var wasRemoved: Boolean, var column: AnyCol?) : ReferenceData

ReadonlyTreeNode

internal interface ReadonlyTreeNode<out T>

ReferenceData

internal interface ReferenceData

TreeNode

internal class TreeNode<T>(var name: String, val depth: Int, var data: T, val parent: TreeNode<T>? = null) : ReadonlyTreeNode<T>

Functions

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>>

collectTree

internal fun List<ColumnWithPath<*>>.collectTree(): TreeNode<DataColumn<*>?>

internal fun <D> List<ColumnWithPath<*>>.collectTree(emptyData: D, createData: (AnyCol) -> D): TreeNode<D>

flattenRecursively

internal fun Iterable<ColumnWithPath<*>>.flattenRecursively(): List<ColumnWithPath<*>>

getAncestor

internal tailrec fun <T> ReadonlyTreeNode<T>.getAncestor(depth: Int): ReadonlyTreeNode<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>

map

internal fun <T : ReadonlyTreeNode<*>, R> T.map(operation: (node: T, children: List<R>) -> R): R

Mapping function for ReadonlyTreeNodes (like TreeNode) which can convert the tree-structure (depth-first) to any other tree-type structure (e.g. DataFrame).

put

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

shortenPaths

internal fun <C> List<ColumnWithPath<C>>.shortenPaths(): List<ColumnWithPath<C>>

Shorten column paths as much as possible to keep them unique

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>>