Trait

org.isarnproject.sketches.tdmap.tree

INodeTD

Related Doc: package tree

Permalink

trait INodeTD extends NodeTD with INodePS[Double, Double, Double] with INodeInc[Double, Double] with INodeNearMap[Double, Double]

Linear Supertypes
INodeNearMap[Double, Double], INodeNear[Double], INodeInc[Double, Double], INodePS[Double, Double, Double], INodeMap[Double, Double], INode[Double], NodeTD, NodeNearMap[Double, Double], NodeNear[Double], NodeInc[Double, Double], NodePS[Double, Double, Double], NodeMap[Double, Double], Node[Double], Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. INodeTD
  2. INodeNearMap
  3. INodeNear
  4. INodeInc
  5. INodePS
  6. INodeMap
  7. INode
  8. NodeTD
  9. NodeNearMap
  10. NodeNear
  11. NodeInc
  12. NodePS
  13. NodeMap
  14. Node
  15. Serializable
  16. Serializable
  17. AnyRef
  18. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def color: Color

    Permalink
    Definition Classes
    INode

  2. abstract def data: DataMap[Double, Double]

    Permalink
    Definition Classes
    INodeMap → INode

  3. abstract def iNode(color: Color, d: Data[Double], lsub: Node[Double], rsub: Node[Double]): INode[Double]

    Permalink
    Attributes
    protected
    Definition Classes
    Node

  4. abstract def keyOrdering: Numeric[Double]

    Permalink
    Definition Classes
    NodeNear → Node

  5. abstract def kmax: Double

    Permalink
    Definition Classes
    INodeNear

  6. abstract def kmin: Double

    Permalink
    Definition Classes
    INodeNear

  7. abstract val lsub: NodeTD

    Permalink
    Definition Classes
    INodeTD → INodeNear → INodeInc → INodePS → INode

  8. abstract def prefix: Double

    Permalink
    Definition Classes
    INodePS

  9. abstract def prefixAggregator: AggregatorAPI[Double, Double]

    Permalink
    Definition Classes
    NodePS

  10. abstract val rsub: NodeTD

    Permalink
    Definition Classes
    INodeTD → INodeNear → INodeInc → INodePS → INode

  11. abstract def valueMonoid: MonoidAPI[Double]

    Permalink
    Definition Classes
    NodeInc

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 append(tl: Node[Double], tr: Node[Double]): Node[Double]

    Permalink
    Attributes
    protected
    Definition Classes
    Node

  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  6. final def bNode(d: Data[Double], lsub: Node[Double], rsub: Node[Double]): INode[Double]

    Permalink
    Attributes
    protected
    Definition Classes
    Node

  7. final def balance(node: Node[Double]): Node[Double]

    Permalink
    Attributes
    protected
    Definition Classes
    Node

  8. final def balanceDel(x: Data[Double], tl: Node[Double], tr: Node[Double]): INode[Double]

    Permalink
    Attributes
    protected
    Definition Classes
    Node

  9. final def balanceLeft(x: Data[Double], tl: Node[Double], tr: Node[Double]): INode[Double]

    Permalink
    Attributes
    protected
    Definition Classes
    Node

  10. final def balanceRight(x: Data[Double], tl: Node[Double], tr: Node[Double]): INode[Double]

    Permalink
    Attributes
    protected
    Definition Classes
    Node

  11. final def blacken(node: Node[Double]): Node[Double]

    Permalink
    Attributes
    protected
    Definition Classes
    Node

  12. def clone(): AnyRef

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

  13. final def covL(k: Double): Cover[INodeNear[Double]]

    Permalink
    Definition Classes
    INodeNear → NodeNear

  14. final def covR(k: Double): Cover[INodeNear[Double]]

    Permalink
    Definition Classes
    INodeNear → NodeNear

  15. final def del(k: Double): Node[Double]

    Permalink
    Definition Classes
    INode → Node

  16. final def delLeft(node: INode[Double], k: Double): INode[Double]

    Permalink
    Attributes
    protected
    Definition Classes
    Node

  17. final def delRight(node: INode[Double], k: Double): INode[Double]

    Permalink
    Attributes
    protected
    Definition Classes
    Node

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

    Permalink
    Definition Classes
    AnyRef

  19. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  20. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  22. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  23. final def inc(di: DataMap[Double, Double]): Node[Double]

    Permalink
    Definition Classes
    INodeInc → NodeInc

  24. final def ins(d: Data[Double]): Node[Double]

    Permalink
    Definition Classes
    INode → Node

  25. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  26. final def kpl(m: Double, psum: Double): Double

    Permalink
    Definition Classes
    INodeTD → NodeTD

  27. final def mCover(m: Double): Cover[INodeTD]

    Permalink

    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.

    Definition Classes
    NodeTD

  28. final def mcov(m: Double, psum: Double, cov: Cover[INodeTD]): Cover[INodeTD]

    Permalink
    Definition Classes
    INodeTD → NodeTD

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

    Permalink
    Definition Classes
    AnyRef

  30. final def near(k: Double): Seq[INodeNear[Double]]

    Permalink
    Definition Classes
    INodeNear → NodeNear

  31. final def node(k: Double): Option[INode[Double]]

    Permalink
    Definition Classes
    INode → Node

  32. final def nodeMax: Option[INode[Double]]

    Permalink
    Definition Classes
    INode → Node

  33. final def nodeMin: Option[INode[Double]]

    Permalink
    Definition Classes
    INode → Node

  34. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  35. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  36. final def ntd(x: Double, psum: Double): (Double, Double, Double)

    Permalink
    Definition Classes
    INodeTD → NodeTD

  37. final def pfSum(k: Double, sum: Double, open: Boolean): Double

    Permalink
    Definition Classes
    INodePS → NodePS

  38. final def pfs: Double

    Permalink
    Definition Classes
    INodePS → NodePS

  39. final def prefixSum(k: Double, open: Boolean): Double

    Permalink
    Definition Classes
    NodePS

  40. final def rNode(d: Data[Double], lsub: Node[Double], rsub: Node[Double]): INode[Double]

    Permalink
    Attributes
    protected
    Definition Classes
    Node

  41. final def redden(node: Node[Double]): Node[Double]

    Permalink
    Attributes
    protected
    Definition Classes
    Node

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

    Permalink
    Definition Classes
    AnyRef

  43. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  44. final def upd(x0: Double, x: Double, m: Double): Node[Double]

    Permalink
    Definition Classes
    INodeTD → NodeTD

  45. final def wait(): Unit

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

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

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

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

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

Inherited from INodeNearMap[Double, Double]

Inherited from INodeNear[Double]

Inherited from INodeInc[Double, Double]

Inherited from INodePS[Double, Double, Double]

Inherited from INodeMap[Double, Double]

Inherited from INode[Double]

Inherited from NodeTD

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