Trait/Object

com.stripe.brushfire

TreeTraversal

Related Docs: object TreeTraversal | package brushfire

Permalink

trait TreeTraversal[Tree, K, V, T, A] extends AnyRef

A TreeTraversal provides a way to find all of the leaves in a tree that some row can evaluate to. Specifically, there may be cases where multiple predicates in a single split node return true for a given row (eg missing features). A tree traversal chooses which paths to go down (which may be all of them) and the order in which they are traversed.

Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TreeTraversal
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

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

    Permalink

    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.

    node

    the initial node to start from

    row

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

    returns

    the leaf nodes that match the row

  2. abstract val treeOps: FullBinaryTreeOps[Tree, BranchLabel[K, V, A], LeafLabel[T, A]]

    Permalink

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

    Permalink
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  10. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  11. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  12. def limitTo(n: Int): TreeTraversal[Tree, K, V, T, A]

    Permalink

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

  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. def search(tree: Tree, row: Map[K, V], id: Option[String]): Stream[LeafLabel[T, A]]

    Permalink

    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

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

    Permalink
    Definition Classes
    AnyRef
  18. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  19. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  20. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  21. final def wait(arg0: Long): Unit

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

Inherited from AnyRef

Inherited from Any

Ungrouped