Value Members

1.  final def !=(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

2.  final def ##(): Int

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

4.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

5.  def clone(): AnyRef

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... ) @native()

6.  def concat(first: Array[E], second: Array[E], blackList: Set[Integer]): Array[TreeData]

   Attributes

   protected[search]

7.  def concat(first: Array[Array[Float]], second: Array[Array[Float]], blackList: Set[Integer]): Array[Array[Float]]

   Attributes

   protected[search]

8.  def continueTraining(newKeys: Array[Array[Float]], newData: Array[E], blackList: Set[String], overwrite: Boolean): SerializableKDTree[E]
9.  final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

10.  def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

11.  def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

12.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

13.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

14.  def isIdenticalExcluded(): Boolean

    Get whether if query object self be excluded from the neighborhood.

15.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

16.  def knn(q: Array[Float], k: Int): Array[Neighbour[Array[Float], E]]

    Definition Classes

    SerializableKDTree → KNNSearch

17.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

18.  def nearest(q: Array[Float]): Neighbour[Array[Float], E]

    Search the nearest neighbor to the given sample.

    Search the nearest neighbor to the given sample.

    q

    the query key.

    returns

    the nearest neighbor

    Definition Classes

    SerializableKDTree → NearestNeighbourSearch

    Annotations

    @Override()

19.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

20.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

21.  def range(q: Array[Float], radius: Double, neighbors: List[Neighbour[Array[Float], E]]): Unit

    Search the neighbors in the given radius of query object, i.e.

    Search the neighbors in the given radius of query object, i.e. d(q, v) ≤ radius.

    q

    the query key.

    radius

    the radius of search range from target.

    neighbors

    the list to store found neighbors in the given range on output.

    Definition Classes

    SerializableKDTree → RNNSearch

    Annotations

    @Override()

22.  def setDistanceFunction(dist: String): SerializableKDTree[E]

    Set distanceFunction either to "EUCLIDEAN" or "COSINE".

23.  def setIdenticalExcluded(excluded: Boolean): SerializableKDTree[E]

    Set if exclude query object self from the neighborhood.

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

    Definition Classes

    AnyRef

25.  def toString(): String

    Definition Classes

    SerializableKDTree → AnyRef → Any

    Annotations

    @Override()

26.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

28.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... ) @native()