trait IntSquareLike extends HyperCube[TwoDim] with QueryShape[Long, TwoDim]
- Alphabetic
- By Inheritance
- IntSquareLike
- 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: Long
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
final
def
bottom: Int
The bottom is defined as the center y coordinate plus the extent minus one, it thus designed the 'last pixel' still inside the square.
The bottom is defined as the center y coordinate plus the extent minus one, it thus designed the 'last pixel' still inside the square. This was changed from the previous definition of 'cy + extent' to be able to use the full 31 bit signed int space for a square without resorting to long conversion.
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
contains(quad: IntSpace.TwoDim.HyperCube): Boolean
Checks whether a given square is fully contained in this square.
Checks whether a given square is fully contained in this square. This is also the case if their bounds full match.
- Definition Classes
- IntSquareLike → HyperCube
-
final
def
contains(point: IntSpace.TwoDim.PointLike): 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
- IntSquareLike → 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: IntSpace.TwoDim.HyperCube, b: IntSpace.TwoDim.PointLike): IntSpace.TwoDim.HyperCube
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
- IntSquareLike → HyperCube
-
final
def
greatestInteresting(a: IntSpace.TwoDim.PointLike, b: IntSpace.TwoDim.PointLike): IntSpace.TwoDim.HyperCube
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
- IntSquareLike → HyperCube
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
indexOf(aq: IntSpace.TwoDim.HyperCube): Int
Determines the quadrant index of another internal square
aq
.Determines the quadrant index of another internal square
aq
.- returns
the index of the quadrant (beginning at 0), or -1 if
aq
lies outside of this square.
- Definition Classes
- IntSquareLike → HyperCube
-
final
def
indexOf(a: IntSpace.TwoDim.PointLike): Int
Determines the quadrant index of a point
a
.Determines the quadrant index of a point
a
.- returns
the index of the quadrant (beginning at 0), or -1 if
a
lies outside of this square.
- Definition Classes
- IntSquareLike → HyperCube
-
final
def
isAreaGreater(a: IntSpace.TwoDim.HyperCube, b: Long): Boolean
- Definition Classes
- IntSquareLike → QueryShape
-
final
def
isAreaNonEmpty(area: Long): Boolean
- Definition Classes
- IntSquareLike → QueryShape
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def left: Int
-
final
def
maxDistance(point: IntSpace.TwoDim.PointLike): 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
- IntSquareLike → HyperCube
-
final
def
maxDistanceSq(point: IntSpace.TwoDim.PointLike): Long
Calculates the maximum squared distance to a point in the euclidean metric.
Calculates the maximum squared 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 square or not. -
final
def
minDistance(point: IntSpace.TwoDim.PointLike): 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
- IntSquareLike → HyperCube
-
final
def
minDistanceSq(point: IntSpace.TwoDim.PointLike): Long
The squared (euclidean) distance of the closest of the square's corners or sides to the point, if the point is outside the square, 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): IntSpace.TwoDim.HyperCube
- Definition Classes
- IntSquareLike → HyperCube
-
final
def
overlapArea(q: IntSpace.TwoDim.HyperCube): Long
- Definition Classes
- IntSquareLike → QueryShape
-
final
def
right: Int
The right is defined as the center x coordinate plus the extent minus one, it thus designed the 'last pixel' still inside the square.
The right is defined as the center x coordinate plus the extent minus one, it thus designed the 'last pixel' still inside the square. This was changed from the previous definition of 'cx + extent' to be able to use the full 31 bit signed int space for a square without resorting to long conversion.
-
final
def
side: Int
The side length is two times the extent.
The side length is two times the extent. Note that this may overflow if the extent is greater than
0x3FFFFFFF
. -
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
top: Int
The top is center-y minus the extent.
The top is center-y minus the extent.
Note therefore, that the vertical coordinates are considered top-down as in screen coordinates, not bottom-up!
-
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( ... )