RightTopBranch

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 asBranch: BranchLike

   

   Definition Classes

   BranchLike

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. final def asLeaf: LeafImpl

   

   Definition Classes

   BranchLike

7. final def child(idx: Int)(implicit tx: S.Tx): RightChildOption

   

   Returns the child for a given orthant index.

   Returns the child for a given orthant index.

   Definition Classes

   RightBranch → BranchLike → Branch

8. val children: Array[S.Var[RightChildOption]]

   

   Attributes

   protected

   Definition Classes

   RightTopBranch → RightBranch

9. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

10. final def demoteLeaf(point: D.PointLike, leaf: LeafImpl)(implicit tx: S.Tx): Unit

    

    Assuming that the given leaf is a child of this node, removes the child from this node's children.

    Assuming that the given leaf is a child of this node, removes the child from this node's children. This method will perform further clean-up such as merging this node with its parent if it becomes uninteresting as part of the removal.

    Definition Classes

    RightBranch → BranchLike

11. def dispose()(implicit tx: S.Tx): Unit

    

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

    

    Definition Classes

    AnyRef

13. def equals(that: Any): Boolean

    

    Definition Classes

    NonEmpty → Identifiable → AnyRef → Any

14. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

    Definition Classes

    AnyRef → Any

16. def hashCode(): Int

    

    Definition Classes

    NonEmpty → Identifiable → AnyRef → Any

17. final def hyperCube: D.HyperCube

    

    Returns the hyper-cube covered by this node.

    Returns the hyper-cube covered by this node.

    Definition Classes

    TopBranch → BranchLike → Branch

18. val id: S.ID

    

    Definition Classes

    RightTopBranch → Identifiable

19. final def insert(point: D.PointLike, leaf: LeafImpl)(implicit tx: S.Tx): Unit

    

    Promotes a leaf that exists in Qi-1 to this tree, by inserting it into this node which is its interesting node in Qi.

    Promotes a leaf that exists in Qi-1 to this tree, by inserting it into this node which is its interesting node in Qi.

    If the result of insertion is a new child node below this node, this intermediate node will be connected to Qi by looking for the corresponding hyper-cube in the given search path that led here (i.e. that was constructed in findPN).

    This method also sets the parent of the leaf accordingly.

    Definition Classes

    RightBranch

20. final def isBranch: Boolean

    

    Definition Classes

    BranchLike

21. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

22. final def isLeaf: Boolean

    

    Definition Classes

    BranchLike

23. def leafRemoved()(implicit tx: S.Tx): Unit

    

     Called when a leaf has been removed from the node.

     Called when a leaf has been removed from the node. The node may need to cleanup after this, e.g. promote an under-full node upwards.

    Attributes

    protected

    Definition Classes

    RightTopBranch → BranchLike

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

    

    Definition Classes

    AnyRef

25. final def next(implicit tx: S.Tx): NextOption

    

     Returns the corresponding interesting node in Qi+1, or empty if no such node exists.

     Returns the corresponding interesting node in Qi+1, or empty if no such node exists.

    Definition Classes

    BranchLike

26. final def nextOption(implicit tx: S.Tx): Option[BranchLike]

    

    Definition Classes

    BranchLike → Branch

27. val nextRef: S.Var[NextOption]

    

    Attributes

    protected

    Definition Classes

    RightTopBranch → BranchLike

28. final def next_=(node: NextOption)(implicit tx: S.Tx): Unit

    

    Sets the corresponding interesting node in Qi+1.

    Sets the corresponding interesting node in Qi+1.

    Definition Classes

    BranchLike

29. def nodeName: String

    

    Attributes

    protected

    Definition Classes

    RightTopBranch → BranchLike

30. final def notify(): Unit

    

    Definition Classes

    AnyRef

31. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

32. final def orthantIndexIn(iq: D.HyperCube)(implicit tx: S.Tx): Int

    

    Queries the orthant index for this (leaf's or node's) hyper-cube with respect to a given outer hyper-cube iq.

    Queries the orthant index for this (leaf's or node's) hyper-cube with respect to a given outer hyper-cube iq.

    Definition Classes

    BranchLike → NonEmpty

33. val prev: TopBranch

    

    Definition Classes

    RightTopBranch → RightBranch

34. final def prevOption: Option[Branch]

    

    Definition Classes

    RightBranch → Branch

35. final def shortString: String

    

    Attributes

    protected

    Definition Classes

    BranchLike → NonEmpty

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

    

    Definition Classes

    AnyRef

37. def toString(): String

    

    Definition Classes

    NonEmpty → AnyRef → Any

38. final def union(mq: D.HyperCube, point2: D.PointLike)(implicit tx: S.Tx): D.HyperCube

    

    Computes the greatest interesting hyper-cube within a given hyper-cube mq so that this (leaf's or node's) hyper-cube and the given point will be placed in separated orthants of this resulting hyper-cube.

    Computes the greatest interesting hyper-cube within a given hyper-cube mq so that this (leaf's or node's) hyper-cube and the given point will be placed in separated orthants of this resulting hyper-cube.

    Definition Classes

    BranchLike → NonEmpty

39. final def updateChild(idx: Int, c: RightChildOption)(implicit tx: S.Tx): Unit

    

    Definition Classes

    RightBranch

40. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

43. def write(out: DataOutput): Unit

    

    Definition Classes

    RightTopBranch → Writable