Class

com.eharmony.aloha.models.tree.decision

Leaf

Related Doc: package decision

Permalink

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
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Leaf(value: B)

    Permalink

    value

    a value stored in this leaf node.

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

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

  6. val descendants: IndexedSeq[Nothing]

    Permalink

    Empty descendants list

    Empty descendants list

    Definition Classes
    Leaf → Tree

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

    Permalink

    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

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

    Permalink
    Definition Classes
    AnyRef

  9. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink

    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

  12. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  14. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  15. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  17. val value: B

    Permalink

    a value stored in this leaf node.

    a value stored in this leaf node.

    Definition Classes
    Leaf → Tree

  18. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    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