FlatTree

Instance Constructors

new FlatTree(rp: RPTree, leafSize: Int)

rp
The RPTree to transform.
leafSize
The size of the flat tree's leaves.

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 asInstanceOf[T0]: T0

Definition Classes
Any
val children: ArrayBuffer[(Int, Int)]
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate() @throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
val hyperplane: ArrayBuffer[DenseVector[Double]]
var indices: DenseMatrix[Int]
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val leafSize: Int

The size of the flat tree's leaves.
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
val offsets: ArrayBuffer[Double]
val rp: RPTree

The RPTree to transform.
final def searchFlatTree(point: Array[Double], state: Array[Long], node: Int = 0): DenseVector[Int]

Given a point, returns the indices of the leaf that could have been its father in the tree.
Given a point, returns the indices of the leaf that could have been its father in the tree.
point
The point which side we are looking for.
state
The initialization array for random.
node
The number of the actual node. Default is 0 for the tree's root.
returns
A vector containing the indices of the father leaf.

Annotations
@tailrec()
def selectSide(node: Int, point: Array[Double], state: Array[Long]): Boolean

Given a point, returns which side of the tree the point should be in.
Given a point, returns which side of the tree the point should be in.
node
The number of the node that is the root of the tree that we are looking into.
point
The point which side in the tree we are looking for.
state
The initialization array for random.
returns
A boolean representing the side (true for left, false for right).
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Deprecated Value Members

def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
Deprecated
(Since version ) see corresponding Javadoc for more information.

Related Doc: package umap

final case class FlatTree(rp: RPTree, leafSize: Int) extends Product with Serializable

Instance Constructors

new FlatTree(rp: RPTree, leafSize: Int)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

val children: ArrayBuffer[(Int, Int)]

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

final def getClass(): Class[_]

val hyperplane: ArrayBuffer[DenseVector[Double]]

var indices: DenseMatrix[Int]

final def isInstanceOf[T0]: Boolean

val leafSize: Int

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val offsets: ArrayBuffer[Double]

val rp: RPTree

final def searchFlatTree(point: Array[Double], state: Array[Long], node: Int = 0): DenseVector[Int]

def selectSide(node: Int, point: Array[Double], state: Array[Long]): Boolean

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

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

final def wait(arg0: Long): Unit

final def wait(): Unit

Deprecated Value Members

def finalize(): Unit

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped