Packages

trait NodeTD extends NodePS[Double, Double, Double] with NodeInc[Double, Double] with NodeNearMap[Double, Double]

Base class of tree node for a TDigestMap

Linear Supertypes
NodeNearMap[Double, Double], NodeNear[Double], NodeInc[Double, Double], NodePS[Double, Double, Double], NodeMap[Double, Double], Node[Double], Serializable, Serializable, AnyRef, Any
Known Subclasses
TDigestMap, INodeTD, LNodeTD
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NodeTD
  2. NodeNearMap
  3. NodeNear
  4. NodeInc
  5. NodePS
  6. NodeMap
  7. Node
  8. Serializable
  9. Serializable
  10. AnyRef
  11. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def iNode(color: Color, d: Data[Double], lsub: Node[Double], rsub: Node[Double]): INode[Double]
    Attributes
    protected
    Definition Classes
    Node
  2. abstract def keyOrdering: Numeric[Double]
    Definition Classes
    NodeNear → Node
  3. abstract def node(k: Double): Option[INode[Double]]
    Definition Classes
    Node
  4. abstract def nodeMax: Option[INode[Double]]
    Definition Classes
    Node
  5. abstract def nodeMin: Option[INode[Double]]
    Definition Classes
    Node
  6. abstract def pfs: Double
    Definition Classes
    NodePS
  7. abstract def prefixAggregator: AggregatorAPI[Double, Double]
    Definition Classes
    NodePS
  8. abstract def valueMonoid: MonoidAPI[Double]
    Definition Classes
    NodeInc

Concrete 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 append(tl: Node[Double], tr: Node[Double]): Node[Double]
    Attributes
    protected
    Definition Classes
    Node
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. final def bNode(d: Data[Double], lsub: Node[Double], rsub: Node[Double]): INode[Double]
    Attributes
    protected
    Definition Classes
    Node
  7. final def balance(node: Node[Double]): Node[Double]
    Attributes
    protected
    Definition Classes
    Node
  8. final def balanceDel(x: Data[Double], tl: Node[Double], tr: Node[Double]): INode[Double]
    Attributes
    protected
    Definition Classes
    Node
  9. final def balanceLeft(x: Data[Double], tl: Node[Double], tr: Node[Double]): INode[Double]
    Attributes
    protected
    Definition Classes
    Node
  10. final def balanceRight(x: Data[Double], tl: Node[Double], tr: Node[Double]): INode[Double]
    Attributes
    protected
    Definition Classes
    Node
  11. final def blacken(node: Node[Double]): Node[Double]
    Attributes
    protected
    Definition Classes
    Node
  12. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  13. final def delLeft(node: INode[Double], k: Double): INode[Double]
    Attributes
    protected
    Definition Classes
    Node
  14. final def delRight(node: INode[Double], k: Double): INode[Double]
    Attributes
    protected
    Definition Classes
    Node
  15. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  17. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  18. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  19. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  20. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  21. final def mCover(m: Double): Cover[INodeTD]

    Obtain a "mass cover": two adjacent nodes in the tree such that the cumulative mass of the left node is <= (m) and the cumulative mass of the right node is > (m)

    Obtain a "mass cover": two adjacent nodes in the tree such that the cumulative mass of the left node is <= (m) and the cumulative mass of the right node is > (m)

    m

    The target mass to cover between two adjacent nodes

    returns

    a Cover instance with the left and right covering tree nodes. If the (m) was < the mass of the left-most tree node, the left cover value will be None. Similarly if the mass was >= the cumulative mass of the right-most node (equivalent to sum of all node masses in the tree), then the right cover value will be None.

  22. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  23. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  24. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  25. final def prefixSum(k: Double, open: Boolean): Double
    Definition Classes
    NodePS
  26. final def rNode(d: Data[Double], lsub: Node[Double], rsub: Node[Double]): INode[Double]
    Attributes
    protected
    Definition Classes
    Node
  27. final def redden(node: Node[Double]): Node[Double]
    Attributes
    protected
    Definition Classes
    Node
  28. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  29. def toString(): String
    Definition Classes
    AnyRef → Any
  30. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from NodeNearMap[Double, Double]

Inherited from NodeNear[Double]

Inherited from NodeInc[Double, Double]

Inherited from NodePS[Double, Double, Double]

Inherited from NodeMap[Double, Double]

Inherited from Node[Double]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped