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
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. KDTree
  2. EuclideanDistance
  3. Distance
  4. AnyRef
  5. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  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. def +(other: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from KDTree to any2stringadd[KDTree] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (KDTree, B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from KDTree to ArrowAssoc[KDTree] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. def distance(p1: Seq[Double], p2: Seq[Double]): Double

    Permalink
    Definition Classes
    EuclideanDistanceDistance
  9. def ensuring(cond: (KDTree) ⇒ Boolean, msg: ⇒ Any): KDTree

    Permalink
    Implicit information
    This member is added by an implicit conversion from KDTree to Ensuring[KDTree] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  10. def ensuring(cond: (KDTree) ⇒ Boolean): KDTree

    Permalink
    Implicit information
    This member is added by an implicit conversion from KDTree to Ensuring[KDTree] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  11. def ensuring(cond: Boolean, msg: ⇒ Any): KDTree

    Permalink
    Implicit information
    This member is added by an implicit conversion from KDTree to Ensuring[KDTree] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  12. def ensuring(cond: Boolean): KDTree

    Permalink
    Implicit information
    This member is added by an implicit conversion from KDTree to Ensuring[KDTree] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  13. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  14. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  15. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from KDTree to StringFormat[KDTree] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  17. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  18. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  19. def insertInKNearest(l: Seq[Seq[Double]], e: Seq[Double], query: Seq[Double], k: Int): Seq[Seq[Double]]

    Permalink
  20. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  21. def knearest(k: Int, query: Seq[Double], depth: Int = 0): Seq[Seq[Double]]

    Permalink
  22. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  23. def nearest(query: Seq[Double], depth: Int = 0): Seq[Double]

    Permalink
  24. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  25. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  26. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  27. def toSeq: Seq[Seq[Double]]

    Permalink
  28. def toString(): String

    Permalink
    Definition Classes
    KDTree → AnyRef → Any
  29. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. final def wait(arg0: Long, arg1: Int): Unit

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. def [B](y: B): (KDTree, B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from KDTree to ArrowAssoc[KDTree] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Inherited from EuclideanDistance

Inherited from Distance

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from KDTree to any2stringadd[KDTree]

Inherited by implicit conversion StringFormat from KDTree to StringFormat[KDTree]

Inherited by implicit conversion Ensuring from KDTree to Ensuring[KDTree]

Inherited by implicit conversion ArrowAssoc from KDTree to ArrowAssoc[KDTree]

Ungrouped