IntSquareLike
Value members
Abstract methods
Concrete methods
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.
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.
Checks whether a given square is fully contained in this square. This is also the case if their bounds full match.
Checks whether a given square is fully contained in this square. This is also the case if their bounds full match.
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
aqlies outside of this square.
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
alies outside of this square.
Calculates the maximum distance to a point in the euclidean metric.
This calls maxDistanceSq and then takes the square root.
Calculates the maximum distance to a point in the euclidean metric.
This calls maxDistanceSq and then takes the square root.
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.
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.
Calculates the minimum distance to a point in the euclidean metric.
This calls minDistanceSq and then takes the square root.
Calculates the minimum distance to a point in the euclidean metric.
This calls minDistanceSq and then takes the square root.
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
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
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.
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.
The side length is two times the extent. Note that this may overflow if the extent
is greater than 0x3FFFFFFF.
The side length is two times the extent. Note that this may overflow if the extent
is greater than 0x3FFFFFFF.