Class

com.johnsnowlabs.ml.search

SerializableKDTree

Related Doc: package search

Permalink

class SerializableKDTree[E] extends NearestNeighborSearch[Array[Float], E] with KNNSearch[Array[Float], E] with RNNSearch[Array[Float], E] with Serializable

Linear Supertypes
Serializable, RNNSearch[Array[Float], E], KNNSearch[Array[Float], E], NearestNeighborSearch[Array[Float], E], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SerializableKDTree
  2. Serializable
  3. RNNSearch
  4. KNNSearch
  5. NearestNeighborSearch
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SerializableKDTree(key: Array[Array[Float]], data: Array[E])

    Permalink

  2. new SerializableKDTree()

    Permalink

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    AnyRef

  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  8. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  10. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  11. def isIdenticalExcluded(): Boolean

    Permalink

  12. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  13. def knn(q: Array[Float], k: Int): Array[Neighbor[Array[Float], E]]

    Permalink
    Definition Classes
    SerializableKDTree → KNNSearch

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

    Permalink
    Definition Classes
    AnyRef

  15. def nearest(q: Array[Float]): Neighbor[Array[Float], E]

    Permalink
    Definition Classes
    SerializableKDTree → NearestNeighborSearch

  16. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  17. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  18. def range(q: Array[Float], radius: Double, neighbors: List[Neighbor[Array[Float], E]]): Unit

    Permalink
    Definition Classes
    SerializableKDTree → RNNSearch

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

    Permalink

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

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  22. def toString(): String

    Permalink
    Definition Classes
    SerializableKDTree → AnyRef → Any

  23. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from RNNSearch[Array[Float], E]

Inherited from KNNSearch[Array[Float], E]

Inherited from NearestNeighborSearch[Array[Float], E]

Inherited from AnyRef

Inherited from Any

Ungrouped