Lucre-geom/de.sciss.lucre.geom/IntHyperCubeNLike

IntHyperCubeNLike

sealed
trait IntHyperCubeNLike extends HyperCube[IntPointNLike, IntHyperCubeN] with QueryShape[BigInt, IntPointNLike, IntHyperCubeN]
class Object
trait Matchable
class Any

Type members

Types

Value members

Abstract methods

def center(idx: Int): Int
def dim: Int
def extent: Int

The extent is the half side length of the cube

The extent is the half side length of the cube

Concrete methods

final
def area: BigInt
final
def containsH(cube: H): Boolean
final
def containsP(point: P): Boolean
final
def greatestInterestingH(a: H, b: P): H
final
def greatestInterestingP(a: P, b: P): H
final
def indexOfH(b: H): Int
final
def indexOfP(a: P): Int
final
def isAreaGreater(a: H, b: BigInt): Boolean
final
def isAreaNonEmpty(area: BigInt): Boolean
final
def maxDistance(point: P): Double
final
def maxDistanceSq(point: P): BigInt

Calculates the maximum squared euclidean distance to a point in the euclidean metric. This is the distance (squared) to the corner which is the furthest from the point, no matter if it lies within the hyper-cube or not.

Calculates the maximum squared euclidean distance to a point in the euclidean metric. This is the distance (squared) to the corner which is the furthest from the point, no matter if it lies within the hyper-cube or not.

final
def minDistance(point: P): Double
final
def minDistanceSq(point: P): BigInt

The squared (euclidean) distance of the closest of the cube's corners or sides to the point, if the point is outside the cube, or zero, if the point is contained

The squared (euclidean) distance of the closest of the cube's corners or sides to the point, if the point is outside the cube, or zero, if the point is contained

final
def orthant(idx: Int): H
final
def overlapArea(b: H): BigInt