Packages

sealed trait ChildBranch[T <: Exec[T], P, H, A] extends Branch[T, P, H, A] with NonEmptyChild[T, P, H, A]

Utility trait which elements the rightward search findPN.

Linear Supertypes
NonEmptyChild[T, P, H, A], Branch[T, P, H, A], NonEmpty[T, P, H], Identified[T], Child[T, P, H, A], Writable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ChildBranch
  2. NonEmptyChild
  3. Branch
  4. NonEmpty
  5. Identified
  6. Child
  7. Writable
  8. AnyRef
  9. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. abstract def child(idx: Int)(implicit tx: T): Child[T, P, H, A]

    Returns the child for a given orthant index.

    Returns the child for a given orthant index.

    Definition Classes
    Branch
  2. abstract def hyperCube: H

    Returns the hyper-cube covered by this node.

    Returns the hyper-cube covered by this node.

    Definition Classes
    Branch
  3. abstract def id: Ident[T]
    Definition Classes
    Identified
  4. abstract def next(implicit tx: T): Next[T, P, H, A]

    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
    Branch
  5. abstract def nextOption(implicit tx: T): Option[Branch[T, P, H, A]]
    Definition Classes
    Branch
  6. abstract def orthantIndexIn(iq: H)(implicit tx: T): 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
    NonEmpty
  7. abstract def parent(implicit tx: T): Branch[T, P, H, A]
    Definition Classes
    NonEmptyChild
  8. abstract def prevOption: Option[Branch[T, P, H, A]]
    Definition Classes
    Branch
  9. abstract def union(mq: H, point: P)(implicit tx: T): H

    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
    NonEmpty
  10. abstract def write(out: DataOutput): Unit
    Definition Classes
    Writable

Concrete Value Members

  1. def equals(that: Any): Boolean
    Definition Classes
    Identified → AnyRef → Any
  2. def hashCode(): Int
    Definition Classes
    Identified → AnyRef → Any
  3. def toString(): String
    Definition Classes
    NonEmpty → AnyRef → Any