DepthFirstTreeTraversal

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. final def eq(arg0: AnyRef): Boolean

   

   Definition Classes

   AnyRef

7. def finalize(): Unit

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

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

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

   

   Definition Classes

   AnyRef → Any

9. final def isInstanceOf[T0]: Boolean

   

   Definition Classes

   Any

10. def limitTo(n: Int): TreeTraversal[Tree, K, V, T, A]

    

    Limit the maximum number of leaves returned from find to n.

    Limit the maximum number of leaves returned from find to n.

    Definition Classes

    TreeTraversal

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

    

    Definition Classes

    AnyRef

12. final def notify(): Unit

    

    Definition Classes

    AnyRef

13. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

14. val reorder: Reorder[A]

    

15. def search(tree: Tree, row: Map[K, V], id: Option[String]): Stream[LeafLabel[T, A]]

    

    Find the LeafNodes that best fit row in the tree.

    Find the LeafNodes that best fit row in the tree. Generally, the path from tree.root to the resulting leaf node will be along *only* true predicates. However, when multiple predicates are true in a SplitNode, the actual choice of which ones gets traversed is left to the particular implementation of TreeTraversal.

    tree

    the decision tree to search in

    row

    the row/instance we're trying to match with a leaf node

    returns

    the leaf nodes that best match the row

    Definition Classes

    TreeTraversal

16. def searchNode(start: bonsai.FullBinaryTreeOps.Node, row: Map[K, V], id: Option[String]): Stream[LeafLabel[T, A]]

    

    Find the LeafNodes that best fit row in the tree.

    Find the LeafNodes that best fit row in the tree. Generally, the path from node to the resulting leaf node will be along *only* true predicates. However, when multiple predicates are true in a SplitNode, the actual choice of which ones gets traversed is left to the particular implementation of TreeTraversal.

    row

    the row/instance we're trying to match with a leaf node

    returns

    the leaf nodes that match the row

    Definition Classes

    DepthFirstTreeTraversal → TreeTraversal

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

    

    Definition Classes

    AnyRef

18. implicit val treeOps: FullBinaryTreeOps[Tree, BranchLabel[K, V, A], LeafLabel[T, A]]

    

    Definition Classes

    DepthFirstTreeTraversal → TreeTraversal

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( ... )