InteriorNode

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

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

   

   Definition Classes

   AnyRef → Any

4. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

6. val descendants: IndexedSeq[Node[A, B]]

   

   Definition Classes

   InteriorNode → Tree

7. def dfs(): Iterator[(Node[A, 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

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

   

   Definition Classes

   AnyRef

9. def finalize(): Unit

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( classOf[java.lang.Throwable] )

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

    

    Definition Classes

    AnyRef → Any

11. def getNode(v: A): Either[InteriorNodeResult[A, B], Leaf[B]]

    

    Progress down the decision tree until no further progress can be made and return the node.

    Progress down the decision tree until no further progress can be made and return the node.

    scala.Right [ com.eharmony.aloha.models.tree.decision.Leaf ] when a leaf is reached or scala.Right [InteriorNodeResult] when progress down the tree was stopped prior to reaching a leaf node. The node in the tuple is the last node in which we could make a successful choice.

    v

    the input whose data is used to branch down the decision tree.

    returns

    either a scala.Right [ com.eharmony.aloha.models.tree.decision.Leaf ] representing a leaf node in the tree or a scala.Left with a node where no further progress down the tree could be made and an optional sequence of log messages.

    Definition Classes

    InteriorNode → Node

12. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    AnyRef

14. val nodeSelector: NodeSelector[A]

    

15. final def notify(): Unit

    

    Definition Classes

    AnyRef

16. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

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

    

    Definition Classes

    AnyRef

18. val value: B

    

    Definition Classes

    InteriorNode → Tree

19. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )