DeterministicSkipOctree

A transactional deterministic skip octree as outlined in the paper by Eppstein et al. It is constructed from a given space (dimensions) and a skip-gap parameter which determines the kind of skip list which is used to govern the level decimation.

The tree is a mutable data structure which supports lookup, insertion and removal in O(log n), as well as efficient range queries and nearest neighbour search.

The current implementation, backed by impl.SkipOctreeImpl, uses the types of the geom package, assuming that coordinates are integers, with the maximum root hyper-cube given by a span from 0 to 0x7FFFFFFF (e.g. in Space.IntTwoDim, this is IntSquare( 0x40000000, 0x40000000, 0x40000000 ).

Linear Supertypes

AnyRef, Any

Type Members

sealed trait Branch[S <: Sys[S], D <: Space[D], A] extends Child[S, D, A] with NonEmpty[S, D]
sealed trait Child[+S, +D, +A] extends Writable
sealed trait ChildBranch[S <: Sys[S], D <: Space[D], A] extends Branch[S, D, A] with NonEmptyChild[S, D, A]

Utility trait which elements the rightward search findPN.
sealed trait Leaf[S <: Sys[S], D <: Space[D], A] extends Child[S, D, A] with LeftNonEmptyChild[S, D, A] with RightNonEmptyChild[S, D, A] with LeafOrEmpty[S, D, A]
sealed trait LeafOrEmpty[+S, +D, +A] extends LeftChild[S, D, A]

Attributes
protected
sealed trait Left extends AnyRef
sealed trait LeftBranch[S <: Sys[S], D <: Space[D], A] extends Branch[S, D, A] with LeftNonEmpty[S, D]

A left tree node implementation provides more specialized child nodes of type LeftChild.
sealed trait LeftChild[+S, +D, +A] extends Left with Child[S, D, A]
sealed trait LeftChildBranch[S <: Sys[S], D <: Space[D], A] extends LeftBranch[S, D, A] with ChildBranch[S, D, A] with LeftNonEmptyChild[S, D, A]
sealed trait LeftNonEmpty[S <: Sys[S], D <: Space[D]] extends Left with NonEmpty[S, D]
sealed trait LeftNonEmptyChild[S <: Sys[S], D <: Space[D], A] extends LeftNonEmpty[S, D] with NonEmptyChild[S, D, A] with LeftChild[S, D, A] with Writable

A common trait used in pattern matching, comprised of Leaf and LeftChildBranch.
sealed trait LeftTopBranch[S <: Sys[S], D <: Space[D], A] extends LeftBranch[S, D, A] with TopBranch[S, D, A] with Disposable[DeterministicSkipOctree.LeftTopBranch.S.Tx]
sealed trait Next[+S, +D, +A] extends Child[S, D, A]
sealed trait NonEmpty[S <: Sys[S], D <: Space[D]] extends Identifiable[DeterministicSkipOctree.NonEmpty.S.ID]

A node is an object that can be stored in a orthant of a branch.
sealed trait NonEmptyChild[S <: Sys[S], D <: Space[D], A] extends NonEmpty[S, D] with Child[S, D, A]

An inner non empty tree element has a mutable parent node.
sealed trait RightBranch[S <: Sys[S], D <: Space[D], A] extends Next[S, D, A] with Branch[S, D, A]

A right tree node implementation provides more specialized child nodes of type RightChild.
sealed trait RightChild[+S, +D, +A] extends Child[S, D, A]
sealed trait RightChildBranch[S <: Sys[S], D <: Space[D], A] extends RightBranch[S, D, A] with ChildBranch[S, D, A] with RightNonEmptyChild[S, D, A]
sealed trait RightNonEmptyChild[S <: Sys[S], D <: Space[D], A] extends RightChild[S, D, A] with NonEmptyChild[S, D, A] with Writable

A common trait used in pattern matching, comprised of Leaf and RightChildBranch.
sealed trait RightTopBranch[S <: Sys[S], D <: Space[D], A] extends RightBranch[S, D, A] with TopBranch[S, D, A]
sealed trait TopBranch[S <: Sys[S], D <: Space[D], A] extends Branch[S, D, A]

Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
object Empty extends LeftChild[Nothing, Nothing, Nothing] with RightChild[Nothing, Nothing, Nothing] with Next[Nothing, Nothing, Nothing] with LeafOrEmpty[Nothing, Nothing, Nothing] with Product with Serializable
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def empty[S <: Sys[S], D <: Space[D], A](hyperCube: DeterministicSkipOctree.empty.D.HyperCube, skipGap: Int = 2)(implicit view: (A, DeterministicSkipOctree.empty.S.Tx) ⇒ DeterministicSkipOctree.empty.D.PointLike, tx: DeterministicSkipOctree.empty.S.Tx, space: D, keySerializer: Serializer[DeterministicSkipOctree.empty.S.Tx, DeterministicSkipOctree.empty.S.Acc, A]): DeterministicSkipOctree[S, D, A]
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def read[S <: Sys[S], D <: Space[D], A](in: DataInput, access: DeterministicSkipOctree.read.S.Acc)(implicit tx: DeterministicSkipOctree.read.S.Tx, view: (A, DeterministicSkipOctree.read.S.Tx) ⇒ DeterministicSkipOctree.read.D.PointLike, space: D, keySerializer: Serializer[DeterministicSkipOctree.read.S.Tx, DeterministicSkipOctree.read.S.Acc, A]): DeterministicSkipOctree[S, D, A]
implicit def serializer[S <: Sys[S], D <: Space[D], A](implicit view: (A, DeterministicSkipOctree.serializer.S.Tx) ⇒ DeterministicSkipOctree.serializer.D.PointLike, space: D, keySerializer: Serializer[DeterministicSkipOctree.serializer.S.Tx, DeterministicSkipOctree.serializer.S.Acc, A]): Serializer[DeterministicSkipOctree.serializer.S.Tx, DeterministicSkipOctree.serializer.S.Acc, DeterministicSkipOctree[S, D, A]]
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

object DeterministicSkipOctree

Type Members

sealed trait Branch[S <: Sys[S], D <: Space[D], A] extends Child[S, D, A] with NonEmpty[S, D]

sealed trait Child[+S, +D, +A] extends Writable

sealed trait ChildBranch[S <: Sys[S], D <: Space[D], A] extends Branch[S, D, A] with NonEmptyChild[S, D, A]

sealed trait Leaf[S <: Sys[S], D <: Space[D], A] extends Child[S, D, A] with LeftNonEmptyChild[S, D, A] with RightNonEmptyChild[S, D, A] with LeafOrEmpty[S, D, A]

sealed trait LeafOrEmpty[+S, +D, +A] extends LeftChild[S, D, A]

sealed trait Left extends AnyRef

sealed trait LeftBranch[S <: Sys[S], D <: Space[D], A] extends Branch[S, D, A] with LeftNonEmpty[S, D]

sealed trait LeftChild[+S, +D, +A] extends Left with Child[S, D, A]

sealed trait LeftChildBranch[S <: Sys[S], D <: Space[D], A] extends LeftBranch[S, D, A] with ChildBranch[S, D, A] with LeftNonEmptyChild[S, D, A]

sealed trait LeftNonEmpty[S <: Sys[S], D <: Space[D]] extends Left with NonEmpty[S, D]

sealed trait LeftNonEmptyChild[S <: Sys[S], D <: Space[D], A] extends LeftNonEmpty[S, D] with NonEmptyChild[S, D, A] with LeftChild[S, D, A] with Writable

sealed trait LeftTopBranch[S <: Sys[S], D <: Space[D], A] extends LeftBranch[S, D, A] with TopBranch[S, D, A] with Disposable[DeterministicSkipOctree.LeftTopBranch.S.Tx]

sealed trait Next[+S, +D, +A] extends Child[S, D, A]

sealed trait NonEmpty[S <: Sys[S], D <: Space[D]] extends Identifiable[DeterministicSkipOctree.NonEmpty.S.ID]

sealed trait NonEmptyChild[S <: Sys[S], D <: Space[D], A] extends NonEmpty[S, D] with Child[S, D, A]

sealed trait RightBranch[S <: Sys[S], D <: Space[D], A] extends Next[S, D, A] with Branch[S, D, A]

sealed trait RightChild[+S, +D, +A] extends Child[S, D, A]

sealed trait RightChildBranch[S <: Sys[S], D <: Space[D], A] extends RightBranch[S, D, A] with ChildBranch[S, D, A] with RightNonEmptyChild[S, D, A]

sealed trait RightNonEmptyChild[S <: Sys[S], D <: Space[D], A] extends RightChild[S, D, A] with NonEmptyChild[S, D, A] with Writable

sealed trait RightTopBranch[S <: Sys[S], D <: Space[D], A] extends RightBranch[S, D, A] with TopBranch[S, D, A]

sealed trait TopBranch[S <: Sys[S], D <: Space[D], A] extends Branch[S, D, A]

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

object Empty extends LeftChild[Nothing, Nothing, Nothing] with RightChild[Nothing, Nothing, Nothing] with Next[Nothing, Nothing, Nothing] with LeafOrEmpty[Nothing, Nothing, Nothing] with Product with Serializable

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped