org.isarnproject.sketches.tdmap.tree

LNodeTD

trait LNodeTD extends NodeTD with LNodePS[Double, Double, Double] with LNodeInc[Double, Double] with LNodeNearMap[Double, Double]

Linear Supertypes
LNodeNearMap[Double, Double], LNodeNear[Double], LNodeInc[Double, Double], LNodePS[Double, Double, Double], LNodeMap[Double, Double], LNode[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. LNodeTD
  2. LNodeNearMap
  3. LNodeNear
  4. LNodeInc
  5. LNodePS
  6. LNodeMap
  7. LNode
  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
Learn more about member selection
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 prefixAggregator: AggregatorAPI[Double, Double]

    Definition Classes
    NodePS

  4. abstract def valueMonoid: MonoidAPI[Double]

    Definition Classes
    NodeInc

Concrete Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. final def append(tl: Node[Double], tr: Node[Double]): Node[Double]

    Attributes
    protected
    Definition Classes
    Node

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

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

    Attributes
    protected
    Definition Classes
    Node

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

    Attributes
    protected
    Definition Classes
    Node

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

    Attributes
    protected
    Definition Classes
    Node

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

    Attributes
    protected
    Definition Classes
    Node

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

    Attributes
    protected
    Definition Classes
    Node

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

    Attributes
    protected
    Definition Classes
    Node

  14. def clone(): AnyRef

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

  15. final def covL(k: Double): Cover[Nothing]

    Definition Classes
    LNodeNear → NodeNear

  16. final def covR(k: Double): Cover[Nothing]

    Definition Classes
    LNodeNear → NodeNear

  17. final def del(k: Double): LNode[Double]

    Definition Classes
    LNode → Node

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

    Attributes
    protected
    Definition Classes
    Node

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

    Attributes
    protected
    Definition Classes
    Node

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

    Definition Classes
    AnyRef

  21. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  22. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  24. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  25. final def inc(di: DataMap[Double, Double]): INode[Double]

    Definition Classes
    LNodeInc → NodeInc

  26. final def ins(d: Data[Double]): INode[Double]

    Definition Classes
    LNode → Node

  27. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    LNodeTD → NodeTD

  29. 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.

    Definition Classes
    NodeTD

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

    Definition Classes
    LNodeTD → NodeTD

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

    Definition Classes
    AnyRef

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

    Definition Classes
    LNodeNear → NodeNear

  33. final def node(k: Double): None.type

    Definition Classes
    LNode → Node

  34. final def nodeMax: None.type

    Definition Classes
    LNode → Node

  35. final def nodeMin: None.type

    Definition Classes
    LNode → Node

  36. final def notify(): Unit

    Definition Classes
    AnyRef

  37. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    LNodeTD → NodeTD

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

    Definition Classes
    LNodePS → NodePS

  40. final def pfs: Double

    Definition Classes
    LNodePS → NodePS

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

    Definition Classes
    NodePS

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

    Attributes
    protected
    Definition Classes
    Node

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

    Attributes
    protected
    Definition Classes
    Node

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

    Definition Classes
    AnyRef

  45. def toString(): String

    Definition Classes
    AnyRef → Any

  46. final def upd(x0: Double, x: Double, m: Double): Nothing

    Definition Classes
    LNodeTD → NodeTD

  47. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from LNodeNearMap[Double, Double]

Inherited from LNodeNear[Double]

Inherited from LNodeInc[Double, Double]

Inherited from LNodePS[Double, Double, Double]

Inherited from LNodeMap[Double, Double]

Inherited from LNode[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