Node

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. var children: Seq[Node]

   

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

7. def contains(queryPoint: Vector): Boolean

   

   Tests whether the queryPoint is in the node, or a child of that node

   Tests whether the queryPoint is in the node, or a child of that node

   queryPoint

   a point to test

   returns

   whether the given point is in the node, or a child of this node

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

   

   Definition Classes

   AnyRef

9. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

10. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

11. def getCenterWidth(): (Vector, Vector)

    

    for testing purposes only; used in QuadTreeSuite.scala

    for testing purposes only; used in QuadTreeSuite.scala

    returns

    center and width of the box

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

    

    Definition Classes

    AnyRef → Any

13. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

14. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

15. def isNear(queryPoint: Vector, radius: Double): Boolean

    

    Tests if queryPoint is near a node

    Tests if queryPoint is near a node

    queryPoint

    a point to test

    radius

    radius of covered area

16. def makeChildren(): Unit

    

    Makes children nodes by partitioning the box into equal sub-boxes and adding a node for each sub-box

17. def minDist(queryPoint: Vector): Double

    

    minDist is defined so that every point in the box has distance to queryPoint greater than minDist (minDist adopted from "Nearest Neighbors Queries" by N.

    minDist is defined so that every point in the box has distance to queryPoint greater than minDist (minDist adopted from "Nearest Neighbors Queries" by N. Roussopoulos et al.)

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

    

    Definition Classes

    AnyRef

19. val nodeElements: ListBuffer[Vector]

    

20. final def notify(): Unit

    

    Definition Classes

    AnyRef

21. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

22. def overlap(queryPoint: Vector, radius: Double): Boolean

    

    Tests if queryPoint is within a radius of the node

    Tests if queryPoint is within a radius of the node

    queryPoint

    a point to test

    radius

    radius of test area

    returns

    whether the given point is in the area

23. def partitionBox(center: Vector, width: Vector): Seq[Vector]

    

    Recursive function that partitions a n-dim box by taking the (n-1) dimensional plane through the center of the box keeping the n-th coordinate fixed, then shifting it in the n-th direction up and down and recursively applying partitionBox to the two shifted (n-1) dimensional planes.

    Recursive function that partitions a n-dim box by taking the (n-1) dimensional plane through the center of the box keeping the n-th coordinate fixed, then shifting it in the n-th direction up and down and recursively applying partitionBox to the two shifted (n-1) dimensional planes.

    center

    the center of the box

    width

    a vector of lengths of each dimension of the box

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

    

    Definition Classes

    AnyRef

25. def toString(): String

    

    Definition Classes

    AnyRef → Any

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( ... )

29. def whichChild(queryPoint: Vector): Int

    

    Finds which child queryPoint lies in.

    Finds which child queryPoint lies in. node.children is a Seq[Node], and whichChild finds the appropriate index of that Seq.