RPTree

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
def clone(): AnyRef

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

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

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

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
def hashCode(): Int

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
final def height(rp: RPTree): Int

rp
a random projection tree
returns
the height of the RP tree
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def leaves(rp: RPTree): Int

rp
a random projection tree
returns
the number of leaves in the RP tree
final def makeAngularTree(data: Array[Array[Double]], indices: ArrayBuffer[Int], leafSize: Int): RPTree

Construct a random angular projection tree based on data with leaves of size at most leaf_size with a angular distance.
Construct a random angular projection tree based on data with leaves of size at most leaf_size with a angular distance.
data
The original data to be split
leafSize
The maximum size of any leaf node in the tree. Any node in the three with more than leafSize will be split further to create child nodes.
returns
A random projection tree node which links to its child nodes. This provides the full tree below the returned node.
final def makeEuclideanTree(data: Array[Array[Double]], indices: ArrayBuffer[Int], leafSize: Int): RPTree

Construct a random euclidean projection tree based on data with leaves of size at most leaf_size with a angular distance.
Construct a random euclidean projection tree based on data with leaves of size at most leaf_size with a angular distance.
data
The original data to be split
leafSize
The maximum size of any leaf node in the tree. Any node in the three with more than leafSize will be split further to create child nodes.
returns
A random projection tree node which links to its child nodes. This provides the full tree below the returned node.
final def makeTree(data: Array[Array[Double]], indices: ArrayBuffer[Int], leafSize: Int, angular: Boolean = false): RPTree

Construct a random projection tree based on data with leaves of size at most leaf_size.
Construct a random projection tree based on data with leaves of size at most leaf_size.
data
The original data to be split
returns
A random projection tree node which links to its child nodes. This provides the full tree below the returned node.
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def nodes(rp: RPTree): Int

rp
a random projection tree
returns
the number of nodes in the RP tree
final def notify(): Unit

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

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
def print(rp: RPTree): Unit
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
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 Docs: trait RPTree | package umap

object RPTree extends Serializable

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def getClass(): Class[_]

def hashCode(): Int

final def height(rp: RPTree): Int

final def isInstanceOf[T0]: Boolean

final def leaves(rp: RPTree): Int

final def makeAngularTree(data: Array[Array[Double]], indices: ArrayBuffer[Int], leafSize: Int): RPTree

final def makeEuclideanTree(data: Array[Array[Double]], indices: ArrayBuffer[Int], leafSize: Int): RPTree

final def makeTree(data: Array[Array[Double]], indices: ArrayBuffer[Int], leafSize: Int, angular: Boolean = false): RPTree

final def ne(arg0: AnyRef): Boolean

final def nodes(rp: RPTree): Int

final def notify(): Unit

final def notifyAll(): Unit

def print(rp: RPTree): Unit

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

def toString(): String

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 AnyRef

Inherited from Any

Ungrouped