Node

abstract def filterToLeaf(example: Example, parent: SplitNode, index: Int): FoundNode

Filter the data to the related leaf node

abstract def merge(that: Node, trySplit: Boolean): Node

Merge two nodes

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

val blockClassDistribution: Array[Double]

val classDistribution: Array[Double]

def classVotes(ht: HoeffdingTreeModel, example: Example): Array[Double]

Return the class distribution

def clone(): AnyRef

var dep: Int

def depth(): Int

Returns depth of current node in the tree

def description(): String

Returns the node description

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def height(): Int

Returns height of the tree

final def isInstanceOf[T0]: Boolean

def isLeaf(): Boolean

Checks whether a node is a leaf

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def numChildren(): Int

Returns number of children

def setDepth(depth: Int): Unit

Set the depth of current node

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit