RTree

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. def apply[A](entries: Iterable[RTreeEntry[A]], nodeCapacity: Int = 16): RTree[A]

   

   Construct an RTree from a sequence of entries using STR packing.

   Construct an RTree from a sequence of entries using STR packing.

   A

   a type of values being put in the tree

   entries

   the sequence of entries

   nodeCapacity

   the maximum number of children nodes (16 by default)

   returns

   an RTree instance

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

17. def toString(): String

    

    Definition Classes

    AnyRef → Any

18. def update[A](rtree: RTree[A], remove: Iterable[RTreeEntry[A]] = Nil, insert: Iterable[RTreeEntry[A]] = Nil, nodeCapacity: Int = 16): RTree[A]

    

    Update an RTree by withdrawing matched entries specified by the remove argument and adding entries from the insert argument, than repack resulting entries to a new RTree using STR packing.

    Update an RTree by withdrawing matched entries specified by the remove argument and adding entries from the insert argument, than repack resulting entries to a new RTree using STR packing.

    A

    a type of values being put in the tree

    rtree

    the RTree

    remove

    the sequence of entries to remove

    insert

    the sequence of entries to insert

    nodeCapacity

    the maximum number of children nodes (16 by default)

    returns

    an RTree instance

19. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )