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. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

6. def empty[A]: Node[A]

   

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

   

   Definition Classes

   AnyRef

8. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

9. def finalize(): Unit

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

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

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

    

    Definition Classes

    AnyRef → Any

11. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

12. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    AnyRef

14. final def notify(): Unit

    

    Definition Classes

    AnyRef

15. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

16. def pickSeeds[M <: HasGeom](nodes: ArrayBuffer[M]): (M, M)

    

    Given a collection of members, we want to find the two that have the greatest distance from each other in some dimension.

    Given a collection of members, we want to find the two that have the greatest distance from each other in some dimension. This is the "linear" strategy.

    Other strategies (like finding the greatest distance in both dimensions) might give better seeds but would be slower. This seems to work OK for now.

17. def splitBranch[A](children: Vector[Node[A]]): Vector[Branch[A]]

    

    Splits the children of a branch node.

    Splits the children of a branch node.

    See splitter for more information.

18. def splitLeaf[A](children: Vector[Entry[A]]): Vector[Leaf[A]]

    

    Splits the children of a leaf node.

    Splits the children of a leaf node.

    See splitter for more information.

19. def splitter[M <: HasGeom](children: Vector[M]): ((Vector[M], Box), (Vector[M], Box))

    

    Splits a collection of members into two new collections, grouped according to the rtree algorithm.

    Splits a collection of members into two new collections, grouped according to the rtree algorithm.

    The results (a vector and a bounding box) will be used to create new nodes.

    The goal is to minimize the area and overlap of the pairs' bounding boxes. We are using a linear seeding strategy since it is simple and has worked well for us in the past.

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

    

    Definition Classes

    AnyRef

21. def toString(): String

    

    Definition Classes

    AnyRef → Any

22. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )