trait INodeTD extends NodeTD with INodePS[Double, Double, Double] with INodeInc[Double, Double] with INodeNearMap[Double, Double]
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- INodeTD
- INodeNearMap
- INodeNear
- INodeInc
- INodePS
- INodeMap
- INode
- NodeTD
- NodeNearMap
- NodeNear
- NodeInc
- NodePS
- NodeMap
- Node
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Abstract Value Members
-
abstract
def
color: Color
- Definition Classes
- INode
-
abstract
def
data: DataMap[Double, Double]
- Definition Classes
- INodeMap → INode
-
abstract
def
iNode(color: Color, d: Data[Double], lsub: Node[Double], rsub: Node[Double]): INode[Double]
- Attributes
- protected
- Definition Classes
- Node
-
abstract
def
keyOrdering: Numeric[Double]
- Definition Classes
- NodeNear → Node
-
abstract
def
kmax: Double
- Definition Classes
- INodeNear
-
abstract
def
kmin: Double
- Definition Classes
- INodeNear
-
abstract
val
lsub: NodeTD
- Definition Classes
- INodeTD → INodeNear → INodeInc → INodePS → INode
-
abstract
def
prefix: Double
- Definition Classes
- INodePS
-
abstract
def
prefixAggregator: AggregatorAPI[Double, Double]
- Definition Classes
- NodePS
-
abstract
val
rsub: NodeTD
- Definition Classes
- INodeTD → INodeNear → INodeInc → INodePS → INode
-
abstract
def
valueMonoid: MonoidAPI[Double]
- Definition Classes
- NodeInc
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
append(tl: Node[Double], tr: Node[Double]): Node[Double]
- Attributes
- protected
- Definition Classes
- Node
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
final
def
bNode(d: Data[Double], lsub: Node[Double], rsub: Node[Double]): INode[Double]
- Attributes
- protected
- Definition Classes
- Node
-
final
def
balance(node: Node[Double]): Node[Double]
- Attributes
- protected
- Definition Classes
- Node
-
final
def
balanceDel(x: Data[Double], tl: Node[Double], tr: Node[Double]): INode[Double]
- Attributes
- protected
- Definition Classes
- Node
-
final
def
balanceLeft(x: Data[Double], tl: Node[Double], tr: Node[Double]): INode[Double]
- Attributes
- protected
- Definition Classes
- Node
-
final
def
balanceRight(x: Data[Double], tl: Node[Double], tr: Node[Double]): INode[Double]
- Attributes
- protected
- Definition Classes
- Node
-
final
def
blacken(node: Node[Double]): Node[Double]
- Attributes
- protected
- Definition Classes
- Node
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
covL(k: Double): Cover[INodeNear[Double]]
- Definition Classes
- INodeNear → NodeNear
-
final
def
covR(k: Double): Cover[INodeNear[Double]]
- Definition Classes
- INodeNear → NodeNear
-
final
def
del(k: Double): Node[Double]
- Definition Classes
- INode → Node
-
final
def
delLeft(node: INode[Double], k: Double): INode[Double]
- Attributes
- protected
- Definition Classes
- Node
-
final
def
delRight(node: INode[Double], k: Double): INode[Double]
- Attributes
- protected
- Definition Classes
- Node
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
inc(di: DataMap[Double, Double]): Node[Double]
- Definition Classes
- INodeInc → NodeInc
-
final
def
ins(d: Data[Double]): Node[Double]
- Definition Classes
- INode → Node
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def kpl(m: Double, psum: Double): Double
-
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
- final def mcov(m: Double, psum: Double, cov: Cover[INodeTD]): Cover[INodeTD]
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
near(k: Double): Seq[INodeNear[Double]]
- Definition Classes
- INodeNear → NodeNear
-
final
def
node(k: Double): Option[INode[Double]]
- Definition Classes
- INode → Node
-
final
def
nodeMax: Option[INode[Double]]
- Definition Classes
- INode → Node
-
final
def
nodeMin: Option[INode[Double]]
- Definition Classes
- INode → Node
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def ntd(x: Double, psum: Double): (Double, Double, Double)
-
final
def
pfSum(k: Double, sum: Double, open: Boolean): Double
- Definition Classes
- INodePS → NodePS
-
final
def
pfs: Double
- Definition Classes
- INodePS → NodePS
-
final
def
prefixSum(k: Double, open: Boolean): Double
- Definition Classes
- NodePS
-
final
def
rNode(d: Data[Double], lsub: Node[Double], rsub: Node[Double]): INode[Double]
- Attributes
- protected
- Definition Classes
- Node
-
final
def
redden(node: Node[Double]): Node[Double]
- Attributes
- protected
- Definition Classes
- Node
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
- final def upd(x0: Double, x: Double, m: Double): Node[Double]
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )