c

com.thesamet.spatial

KDTreeInnerNode

case class KDTreeInnerNode[A, B](dim: Int, key: A, value: B, below: KDTreeNode[A, B], above: KDTreeNode[A, B])(ordering: Ordering[A]) extends KDTreeNode[A, B] with Serializable with Product

Linear Supertypes
Product, Equals, KDTreeNode[A, B], Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. KDTreeInnerNode
  2. Product
  3. Equals
  4. KDTreeNode
  5. Serializable
  6. Serializable
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new KDTreeInnerNode(dim: Int, key: A, value: B, below: KDTreeNode[A, B], above: KDTreeNode[A, B])(ordering: Ordering[A])

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. val above: KDTreeNode[A, B]
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. val below: KDTreeNode[A, B]
  7. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. val dim: Int
  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. def findNearest[R](x: A, n: Int)(implicit metric: Metric[A, R], ord: Ordering[R]): Seq[(A, B)]
    Definition Classes
    KDTreeInnerNode → KDTreeNode
  12. def findNearest0[R](x: A, n: Int, skipParent: KDTreeNode[A, B], values: Seq[((A, B), R)])(implicit metric: Metric[A, R], ord: Ordering[R]): Seq[((A, B), R)]
    Definition Classes
    KDTreeInnerNode → KDTreeNode
  13. final def get(x: A): Option[B]
    Definition Classes
    KDTreeNode
    Annotations
    @tailrec()
  14. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  15. def isAbove(x: A): Boolean
  16. def isBelow(x: A): Boolean
  17. def isEmpty: Boolean
    Definition Classes
    KDTreeInnerNode → KDTreeNode
  18. def isEquiv(x: A): Boolean
  19. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  20. val key: A
  21. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  22. final def notify(): Unit
    Definition Classes
    AnyRef
  23. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  24. def regionQuery(region: Region[A])(implicit ord: DimensionalOrdering[A]): Seq[(A, B)]
    Definition Classes
    KDTreeInnerNode → KDTreeNode
  25. val size: Int
    Definition Classes
    KDTreeInnerNode → KDTreeNode
  26. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  27. def toSeq: Seq[(A, B)]
    Definition Classes
    KDTreeInnerNode → KDTreeNode
  28. def toStream: Stream[(A, B)]
    Definition Classes
    KDTreeInnerNode → KDTreeNode
  29. def toString(): String
    Definition Classes
    KDTreeNode → AnyRef → Any
  30. def toStringSeq(indent: Int): Seq[String]
    Definition Classes
    KDTreeInnerNode → KDTreeNode
  31. val value: B
  32. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Product

Inherited from Equals

Inherited from KDTreeNode[A, B]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped