Instance Constructors
-
new
LeafImpl(id: S.ID, value: A, parentRef: S.Var[BranchLike])
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
-
final
def
asInstanceOf[T0]: T0
-
-
def
clone(): AnyRef
-
def
dispose()(implicit tx: S.Tx): Unit
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(that: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
val
id: S.ID
-
def
isBranch: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
isLeaf: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
orthantIndexIn(iq: D.HyperCube)(implicit tx: S.Tx): Int
-
def
parent(implicit tx: S.Tx): BranchLike
-
def
parent_=(p: BranchLike)(implicit tx: S.Tx): Unit
-
def
remove()(implicit tx: S.Tx): Unit
-
def
shortString: String
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
union(mq: D.HyperCube, point2: D.PointLike)(implicit tx: S.Tx): D.HyperCube
-
def
updateParentLeft(p: LeftBranch)(implicit tx: S.Tx): Unit
-
def
updateParentRight(p: RightBranch)(implicit tx: S.Tx): Unit
-
val
value: A
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
write(out: DataOutput): Unit
Inherited from Writable
Inherited from Identifiable[S.ID]
Inherited from AnyRef
Inherited from Any
A leaf in the octree, carrying a map entry in the form of a point and associated value. Note that a single instance of a leaf is used across the levels of the octree! That means that multiple child pointers may go to the same leaf, while the parent of a leaf always points into the highest level octree that the leaf resides in, according to the skiplist.