com.eharmony.aloha.models.tree.decision

Leaf

case class Leaf[+B](value: B) extends Node[Any, B] with Product with Serializable

Representation of a decision tree leaf node.

B

the domain of the childSelector function

value

a value stored in this leaf node.

Linear Supertypes
Serializable, Serializable, Product, Equals, Node[Any, B], Tree[B, IndexedSeq, Node[Any, B]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Leaf
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. Node
  7. Tree
  8. AnyRef
  9. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Leaf(value: B)

    value

    a value stored in this leaf node.

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  8. val descendants: IndexedSeq[Nothing]

    Empty descendants list

    Empty descendants list

    Definition Classes
    Leaf → Tree

  9. def dfs(): Iterator[(Node[Any, B], Int)]

    Get a NON thread-safe iterator over the nodes in the tree for a DFS ordering.

    Get a NON thread-safe iterator over the nodes in the tree for a DFS ordering. Each iterator value contains the node in the tree and the depth (root has 0 depth). This iterator requires O(B * D) auxiliary space where B is the branching factor and D is the tree depth.

    returns

    a NON thread-safe iterator over the nodes in the tree for a DFS ordering.

    Definition Classes
    Tree

  10. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  11. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  12. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  13. def getNode(v: Any): Right[Nothing, Leaf[B]]

    Return this node wrapped in a scala.Right.

    Return this node wrapped in a scala.Right.

    v

    irrelevant input data. (Not used)

    returns

    either a scala.Right [ com.eharmony.aloha.models.tree.decision.Leaf ] this node.

    Definition Classes
    Leaf → Node

  14. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  15. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  16. final def notify(): Unit

    Definition Classes
    AnyRef

  17. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    AnyRef

  19. val value: B

    a value stored in this leaf node.

    a value stored in this leaf node.

    Definition Classes
    Leaf → Tree

  20. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  22. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Node[Any, B]

Inherited from Tree[B, IndexedSeq, Node[Any, B]]

Inherited from AnyRef

Inherited from Any

Ungrouped