sealed trait IntHyperCubeNLike extends HyperCube[NDim] with QueryShape[BigInt, NDim]
- Alphabetic
- By Inheritance
- IntHyperCubeNLike
- QueryShape
- HyperCube
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Abstract Value Members
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def area: BigInt
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
contains(cube: IntHyperCubeN): Boolean
Checks whether a given hyper-cube is fully contained in this hyper-cube.
Checks whether a given hyper-cube is fully contained in this hyper-cube. This is also the case if their bounds full match.
- Definition Classes
- IntHyperCubeNLike → HyperCube
-
final
def
contains(point: IntPointNLike): Boolean
Queries the overlap of this shape with a given
IntPoint2D p
.Queries the overlap of this shape with a given
IntPoint2D p
. The point is considered to have a side length of 1!- returns
true
if this shape contains or partly overlaps the given point
- Definition Classes
- IntHyperCubeNLike → QueryShape → HyperCube
-
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
- Annotations
- @native()
-
final
def
greatestInteresting(a: IntHyperCubeN, b: IntPointNLike): IntHyperCubeN
Calculates the greatest interesting hyper-cube inside this hyper-cube which contains both hyper-cube
a
and pointb
, and they occupy distinct orthants.Calculates the greatest interesting hyper-cube inside this hyper-cube which contains both hyper-cube
a
and pointb
, and they occupy distinct orthants.- Definition Classes
- IntHyperCubeNLike → HyperCube
-
final
def
greatestInteresting(a: IntPointNLike, b: IntPointNLike): IntHyperCubeN
Calculates the greatest interesting hyper-cube inside this hyper-cube which contains both points
a
andb
, and they occupy distinct orthants.Calculates the greatest interesting hyper-cube inside this hyper-cube which contains both points
a
andb
, and they occupy distinct orthants.- Definition Classes
- IntHyperCubeNLike → HyperCube
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
indexOf(b: IntHyperCubeN): Int
Determines the orthant index of another internal hyper-cube
inner
.Determines the orthant index of another internal hyper-cube
inner
.- returns
the index of the orthant (beginning at 0), or -1 if
inner
lies outside of this hyper-cube.
- Definition Classes
- IntHyperCubeNLike → HyperCube
-
final
def
indexOf(a: IntPointNLike): Int
Determines the orthant index of a point
point
.Determines the orthant index of a point
point
.- returns
the index of the orthant (beginning at 0), or -1 if
point
lies outside of this hyper-cube.
- Definition Classes
- IntHyperCubeNLike → HyperCube
-
final
def
isAreaGreater(a: IntHyperCubeN, b: BigInt): Boolean
- Definition Classes
- IntHyperCubeNLike → QueryShape
-
final
def
isAreaNonEmpty(area: BigInt): Boolean
- Definition Classes
- IntHyperCubeNLike → QueryShape
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
maxDistance(point: IntPointNLike): Double
Calculates the maximum distance to a point in the euclidean metric.
Calculates the maximum distance to a point in the euclidean metric. This calls
maxDistanceSq
and then takes the square root.- Definition Classes
- IntHyperCubeNLike → HyperCube
-
final
def
maxDistanceSq(point: IntPointNLike): BigInt
Calculates the maximum squared euclidean distance to a point in the euclidean metric.
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: IntPointNLike): Double
Calculates the minimum distance to a point in the euclidean metric.
Calculates the minimum distance to a point in the euclidean metric. This calls
minDistanceSq
and then takes the square root.- Definition Classes
- IntHyperCubeNLike → HyperCube
-
final
def
minDistanceSq(point: IntPointNLike): 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
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
orthant(idx: Int): IntHyperCubeN
- Definition Classes
- IntHyperCubeNLike → HyperCube
-
final
def
overlapArea(b: IntHyperCubeN): BigInt
- Definition Classes
- IntHyperCubeNLike → QueryShape
-
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
- @native() @throws( ... )