Class/Object

com.stripe.brushfire

SplitNode

Related Docs: object SplitNode | package brushfire

Permalink

case class SplitNode[K, V, T, A](key: K, predicate: Predicate[V], leftChild: Node[K, V, T, A], rightChild: Node[K, V, T, A], annotation: A) extends Node[K, V, T, A] with Product with Serializable

Linear Supertypes
Serializable, Serializable, Product, Equals, Node[K, V, T, A], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SplitNode
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. Node
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SplitNode(key: K, predicate: Predicate[V], leftChild: Node[K, V, T, A], rightChild: Node[K, V, T, A], annotation: A)

    Permalink

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. val annotation: A

    Permalink
    Definition Classes
    SplitNode → Node

  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  6. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    AnyRef

  8. def evaluate(row: Map[K, V])(implicit ord: Ordering[V]): List[Node[K, V, T, A]]

    Permalink

  9. def finalize(): Unit

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

  10. def fold[B](f: ((K, Predicate[V], A), Node[K, V, T, A], Node[K, V, T, A]) ⇒ B, g: ((Int, T, A)) ⇒ B): B

    Permalink
    Definition Classes
    Node

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

    Permalink
    Definition Classes
    AnyRef → Any

  12. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  13. val key: K

    Permalink

  14. val leftChild: Node[K, V, T, A]

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  16. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  17. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  18. val predicate: Predicate[V]

    Permalink

  19. def renumber(nextId: Int): (Int, Node[K, V, T, A])

    Permalink
    Definition Classes
    Node

  20. val rightChild: Node[K, V, T, A]

    Permalink

  21. def splitLabel: (K, Predicate[V], A)

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  23. def toString(): String

    Permalink
    Definition Classes
    SplitNode → AnyRef → Any

  24. final def wait(): Unit

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

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

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

  26. 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[K, V, T, A]

Inherited from AnyRef

Inherited from Any

Ungrouped