Trait/Object

fr.iscpif.mgo.tools

KDTree

Related Docs: object KDTree | package tools

Permalink

trait KDTree extends EuclideanDistance

KD-Tree algorithm from https://en.wikipedia.org/wiki/Kd-tree 5-5-2014

Linear Supertypes
EuclideanDistance, Distance, AnyRef, Any
Known Subclasses
EmptyTree
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. KDTree
  2. EuclideanDistance
  3. Distance
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def left: KDTree

    Permalink

  2. abstract def node: Seq[Double]

    Permalink

  3. abstract def right: KDTree

    Permalink

Concrete 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. def distance(p1: Seq[Double], p2: Seq[Double]): Double

    Permalink
    Definition Classes
    EuclideanDistance → Distance

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

    Permalink
    Definition Classes
    AnyRef

  8. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  9. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  11. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  12. def insertInKNearest(l: Seq[Seq[Double]], e: Seq[Double], query: Seq[Double], k: Int): Seq[Seq[Double]]

    Permalink

  13. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  14. def knearest(k: Int, query: Seq[Double], depth: Int = 0): Seq[Seq[Double]]

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  16. def nearest(query: Seq[Double], depth: Int = 0): Seq[Double]

    Permalink

  17. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  18. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  20. def toSeq: Seq[Seq[Double]]

    Permalink

  21. def toString(): String

    Permalink
    Definition Classes
    KDTree → AnyRef → Any

  22. final def wait(): Unit

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

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

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

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

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

Inherited from EuclideanDistance

Inherited from Distance

Inherited from AnyRef

Inherited from Any

Ungrouped