Struct GridAab 

pub struct GridAab { /* private fields */ }

Implementations

impl GridAab

pub const ORIGIN_CUBE: GridAab

Box containing the unit cube from [0, 0, 0] to [1, 1, 1].

This constant is for convenience; there are several other ways that this box could be constructed, but they’re all kind of verbose:

use all_is_cubes::block::Resolution;
use all_is_cubes::math::{GridAab, Cube};

assert_eq!(GridAab::ORIGIN_CUBE, GridAab::from_lower_upper([0, 0, 0], [1, 1, 1]));

// Note that GridAab::for_block() is const too.
assert_eq!(GridAab::ORIGIN_CUBE, GridAab::for_block(Resolution::R1));

assert_eq!(GridAab::ORIGIN_CUBE, GridAab::single_cube(Cube::ORIGIN));

pub const ORIGIN_EMPTY: GridAab

Box of zero size at [0, 0, 0].

Use this box as the canonical placeholder “nothing” value when it is necessary to have some box.

pub const EVERYWHERE: GridAab

Box that covers everything every other box does.

pub fn from_lower_size( lower_bounds: impl Into<Point3D<i32, Cube>>, sizes: impl Into<Size3D<u32, Cube>>, ) -> GridAab

Constructs a GridAab from coordinate lower bounds and sizes.

For example, if on one axis the lower bound is 5 and the size is 10, then the positions where blocks can exist are numbered 5 through 14 (inclusive) and the occupied volume (from a perspective of continuous rather than discrete coordinates) spans 5 to 15.

Panics if the sizes are negative or the resulting range would cause numeric overflow. Use GridAab::checked_from_lower_upper to avoid panics.

pub fn checked_from_lower_upper( lower_bounds: impl Into<Point3D<i32, Cube>>, upper_bounds: impl Into<Point3D<i32, Cube>>, ) -> Result<GridAab, GridOverflowError>

Constructs a GridAab from inclusive lower bounds and exclusive upper bounds.

For example, if on one axis the lower bound is 5 and the upper bound is 10, then the positions where blocks can exist are numbered 5 through 9 (inclusive) and the occupied volume (from a perspective of continuous rather than discrete coordinates) spans 5 to 10.

Returns Err if any of the upper_bounds are less than the lower_bounds.

pub fn from_lower_upper( lower_bounds: impl Into<Point3D<i32, Cube>>, upper_bounds: impl Into<Point3D<i32, Cube>>, ) -> GridAab

Constructs a GridAab from inclusive lower bounds and exclusive upper bounds.

For example, if on one axis the lower bound is 5 and the upper bound is 10, then the positions where blocks can exist are numbered 5 through 9 (inclusive) and the occupied volume (from a perspective of continuous rather than discrete coordinates) spans 5 to 10.

Panics if any of the upper_bounds are less than the lower_bounds.

pub fn from_ranges(ranges: impl Into<Vector3D<Range<i32>, Cube>>) -> GridAab

Constructs a GridAab from Ranges.

This is identical to GridAab::from_lower_upper() except for the input type.

pub fn checked_from_lower_size( lower_bounds: impl Into<Point3D<i32, Cube>>, size: impl Into<Size3D<u32, Cube>>, ) -> Result<GridAab, GridOverflowError>

Constructs a GridAab from coordinate lower bounds and sizes.

Returns Err if the size is negative or adding it to lower_bounds overflows.

pub fn single_cube(cube: Cube) -> GridAab

Constructs a GridAab with a volume of 1, containing the specified cube.

Panics if cube has any coordinates equal to GridCoordinate::MAX since that is not valid, as per GridAab::from_lower_size().

This function is identical to Cube::grid_aab().

pub const fn for_block(resolution: Resolution) -> GridAab

Constructs a GridAab with a cubical volume in the positive octant, as is used for recursive blocks.

If you need such a box at a position other than the origin, use GridAab::translate().

pub const fn tiny( lower_bounds: Point3D<i8, Cube>, size: Size3D<u8, Cube>, ) -> GridAab

Constructs a GridAab from 8-bit integers that cannot overflow.

This constructor is limited so that it is const and infallible. It always behaves identically to GridAab::from_lower_size().

See also GridAab::for_block().

pub const fn volume(&self) -> Option<usize>

Computes the volume of this box in cubes, i.e. the product of all sizes.

Returns None if the volume does not fit in a usize. (If this fallibility is undesirable, consider using a Vol<()> instead of GridAab.)

use all_is_cubes::math::GridAab;

let a = GridAab::from_lower_size([-10, 3, 7], [100, 200, 300]);
assert_eq!(a.volume(), Some(6_000_000));

let b = GridAab::from_lower_size([0, 0, 0], [100, 200, 0]);
assert_eq!(b.volume(), Some(0));

pub fn volume_f64(&self) -> f64

Computes the approximate volume of this box in cubes, i.e. the product of all sizes converted to f64.

pub fn surface_area_f64(&self) -> f64

Computes the surface area of this box; 1 unit of area = 1 cube-face.

Returns f64 to avoid needing overflow considerations, and because all internal uses want float anyway.

pub fn is_empty(&self) -> bool

Returns whether the box contains no cubes (its volume is zero).

This does not necessarily mean that its size is zero on all axes.

pub fn lower_bounds(&self) -> Point3D<i32, Cube>

Inclusive upper bounds on cube coordinates, or the most negative corner of the box.

pub fn upper_bounds(&self) -> Point3D<i32, Cube>

Exclusive upper bounds on cube coordinates, or the most positive corner of the box.

pub const fn size(&self) -> Size3D<u32, Cube>

Size of the box in each axis; equivalent to self.upper_bounds() - self.lower_bounds(), except that the result is unsigned (which is necessary so that it cannot overflow).

pub fn x_range(&self) -> Range<i32>

The range of X coordinates for unit cubes within the box.

pub fn y_range(&self) -> Range<i32>

The range of Y coordinates for unit cubes within the box.

pub fn z_range(&self) -> Range<i32>

The range of Z coordinates for unit cubes within the box.

pub fn axis_range(&self, axis: Axis) -> Range<i32>

The range of coordinates for cubes within the box along the given axis.

pub fn center(&self) -> Point3D<f64, Cube>

The center of the enclosed volume. Returns FreeCoordinates since the center may be at a half-block position.

use all_is_cubes::math::{FreePoint, GridAab};

let b = GridAab::from_lower_size([0, 0, -2], [10, 3, 4]);
assert_eq!(b.center(), FreePoint::new(5.0, 1.5, 0.0));

pub fn interior_iter(self) -> GridIter

Iterate over all cubes that this contains.

The order of iteration is deterministic, but not guaranteed to be anything in particular, and may change in later versions. If order matters, use Vol::iter_cubes() instead.

use all_is_cubes::math::{GridAab, Cube};

let b = GridAab::from_lower_size([10, 20, 30], [1, 2, 3]);
assert_eq!(
    b.interior_iter().collect::<Vec<Cube>>(),
    &[
        Cube::new(10, 20, 30),
        Cube::new(10, 20, 31),
        Cube::new(10, 20, 32),
        Cube::new(10, 21, 30),
        Cube::new(10, 21, 31),
        Cube::new(10, 21, 32),
    ])

pub fn contains_cube(&self, cube: Cube) -> bool

Returns whether the box includes the given cube position in its volume.

use all_is_cubes::math::{GridAab, Cube};

let b = GridAab::from_lower_size([4, 4, 4], [6, 6, 6]);
assert!(!b.contains_cube([3, 5, 5].into()));
assert!(b.contains_cube([4, 5, 5].into()));
assert!(b.contains_cube([9, 5, 5].into()));
assert!(!b.contains_cube([10, 5, 5].into()));

pub fn contains_box(&self, other: GridAab) -> bool

Returns whether this box includes every cube in the other box.

TODO: Precisely define the behavior on zero volume boxes.

use all_is_cubes::math::GridAab;
let b46 = GridAab::from_lower_size([4, 4, 4], [6, 6, 6]);
assert!(b46.contains_box(b46));
assert!(!b46.contains_box(GridAab::from_lower_size([4, 4, 4], [7, 6, 6])));
assert!(!GridAab::from_lower_size((0, 0, 0), (6, 6, 6)).contains_box(b46));

pub fn intersection_cubes(self, other: GridAab) -> Option<GridAab>

Returns the intersection of self and other, defined as the box which contains every cube that both self and other do, and no others.

Returns None if there are no such cubes. In other words, if a box is returned, then its volume will always be nonzero; this definition of intersection is suitable when the intent is to take action on the intersecting cubes. For applications which are more concerned with preserving the box coordinates, call GridAab::intersection_box() instead.

use all_is_cubes::math::GridAab;

// Simple example of an intersection.
assert_eq!(
    GridAab::from_lower_size([0, 0, 0], [2, 2, 2])
        .intersection_cubes(GridAab::from_lower_size([1, 0, 0], [2, 1, 2])),
    Some(GridAab::from_lower_size([1, 0, 0], [1, 1, 2])),
);

// A box's intersection with itself is equal to itself...
let b = GridAab::from_lower_size([1, 2, 3], [4, 5, 6]);
assert_eq!(b.intersection_cubes(b), Some(b));
// ...unless it has zero volume.
let bz = GridAab::from_lower_size([1, 2, 3], [4, 5, 0]);
assert_eq!(bz.intersection_cubes(bz), None);

// Boxes which only touch on their faces are not considered to intersect.
assert_eq!(
    GridAab::from_lower_size([0, 0, 0], [2, 2, 2])
        .intersection_cubes(GridAab::from_lower_size([2, 0, 0], [2, 1, 2])),
    None,
);

pub fn intersection_box(self, other: GridAab) -> Option<GridAab>

Returns the intersection of self and other, defined as the box which is as large as possible while not extending beyond the bounds of self or the bounds of other.

Returns None if that is impossible, i.e. if the two boxes do not touch.

This definition of intersection is suitable when the intent is to constrain the bounds of a box to fit in another, while preserving their coordinates as much as possible. For applications which are more concerned with processing the overlapping volume when there is overlap, call GridAab::intersection_cubes() instead for a tighter bound.

use all_is_cubes::math::GridAab;

// Simple example of an intersection.
assert_eq!(
    GridAab::from_lower_size([0, 0, 0], [2, 2, 2])
        .intersection_box(GridAab::from_lower_size([1, 0, 0], [2, 1, 2])),
    Some(GridAab::from_lower_size([1, 0, 0], [1, 1, 2])),
);

// A box's intersection with itself is always equal to itself...
let b = GridAab::from_lower_size([1, 2, 3], [4, 5, 6]);
assert_eq!(b.intersection_box(b), Some(b));
// ...even when it has zero volume.
let bz = GridAab::from_lower_size([1, 2, 3], [4, 5, 0]);
assert_eq!(bz.intersection_box(bz), Some(bz));

// Boxes which only touch on their faces yield their shared boundary surface.
assert_eq!(
    GridAab::from_lower_size([0, 0, 0], [2, 2, 2])
        .intersection_box(GridAab::from_lower_size([2, 0, 0], [2, 1, 2])),
    Some(GridAab::from_lower_size([2, 0, 0], [0, 1, 2])),
);

pub fn union_cubes(self, other: GridAab) -> GridAab

Returns the smallest GridAab which fully encloses the two inputs’ cubes.

The boundaries of empty boxes are ignored. If this is not desired, call GridAab::union_box() instead. If both inputs are empty, then self is returned.

use all_is_cubes::math::GridAab;

let g1 = GridAab::from_lower_size([1, 2, 3], [1, 1, 1]);
assert_eq!(g1.union_cubes(g1), g1);

let g2 = GridAab::from_lower_size([4, 7, 11], [1, 1, 1]);
assert_eq!(g1.union_cubes(g2), GridAab::from_lower_upper([1, 2, 3], [5, 8, 12]));

// Empty boxes (any size equal to zero) have no effect.
let empty = GridAab::from_lower_size([0, 0, 0], [0, 1, 7]);
assert_eq!(g1.union_cubes(empty), g1);

pub fn union_box(self, other: GridAab) -> GridAab

Returns the smallest GridAab which fully encloses the two inputs’ boundaries.

The boundaries of empty boxes are included. If this is not desired, call GridAab::union_cubes() instead for a tighter bound.

use all_is_cubes::math::GridAab;

let g1 = GridAab::from_lower_size([1, 2, 3], [1, 1, 1]);
assert_eq!(g1.union_box(g1), g1);

let g2 = GridAab::from_lower_size([4, 7, 11], [1, 1, 1]);
assert_eq!(g1.union_box(g2), GridAab::from_lower_upper([1, 2, 3], [5, 8, 12]));

// Empty boxes (any size equal to zero) are included even though they contain no cubes.
let empty = GridAab::from_lower_size([0, 0, 0], [0, 1, 7]);
assert_eq!(g1.union_box(empty), GridAab::from_lower_upper([0, 0, 0], [2, 3, 7]));

// A union of empty boxes can become non-empty by including the volume within.
assert_eq!(
    empty.union_box(empty.translate([3, 0, 0])),
    GridAab::from_lower_upper([0, 0, 0], [3, 1, 7]),
)

pub fn union_cube(self, other: Cube) -> GridAab

Extend the bounds of self as needed to enclose other.

Equivalent to self.union_box(GridAab::single_cube(other)). Note in particular that it does not discard the bounds of an empty self, like GridAab::union_cubes() would.

use all_is_cubes::math::{Cube, GridAab};

let accumulation =
    GridAab::single_cube(Cube::new(1, 10, 7))
        .union_cube(Cube::new(2, 5, 10));
assert_eq!(accumulation, GridAab::from_lower_upper([1, 5, 7], [3, 11, 11]));

pub fn random_cube(&self, rng: &mut impl RngCore) -> Option<Cube>

Returns a random cube contained by the box, if there are any.

use all_is_cubes::math::GridAab;
use rand::SeedableRng;

let mut rng = &mut rand_xoshiro::Xoshiro256Plus::seed_from_u64(0);

let b = GridAab::from_lower_size([4, 4, 4], [6, 6, 6]);
for _ in 0..50 {
    assert!(b.contains_cube(b.random_cube(rng).unwrap()));
}

let empty = GridAab::from_lower_size([1, 2, 3], [0, 9, 9]);
assert_eq!(empty.random_cube(rng), None);

pub fn to_vol<O>(self) -> Result<Vol<(), O>, VolLengthError>

where O: Default,

Creates a Vol with self as the bounds and no data.

This introduces a particular linear ordering of the cubes in the volume.

Returns an error if the volume of self is greater than usize::MAX.

pub fn to_free(self) -> Aab

Converts this box to floating-point coordinates.

This conversion is also available via the From trait.

pub fn translate(&self, offset: impl Into<Vector3D<i32, Cube>>) -> GridAab

Displaces the box by the given offset, leaving its size unchanged (unless that is impossible due to numeric overflow).

use all_is_cubes::math::GridAab;

assert_eq!(
    GridAab::from_lower_size([0, 0, 0], [10, 20, 30]).translate([-10, 0, 0]),
    GridAab::from_lower_size([-10, 0, 0], [10, 20, 30]),
);

pub fn transform(self, transform: Gridgid) -> Option<GridAab>

Translate and rotate the box according to the given transform.

TODO: Fail nicely on numeric overflow. The Option return is not currently used.

pub fn divide(self, divisor: i32) -> GridAab

Scales the box down by the given factor, rounding outward.

For example, this may be used to convert from voxels (subcubes) to blocks or blocks to chunks.

Panics if the divisor is not positive.

use all_is_cubes::math::GridAab;

assert_eq!(
    GridAab::from_lower_size([-10, -10, -10], [20, 20, 20]).divide(10),
    GridAab::from_lower_size([-1, -1, -1], [2, 2, 2]),
);
assert_eq!(
    GridAab::from_lower_size([-10, -10, -10], [21, 21, 21]).divide(10),
    GridAab::from_lower_size([-1, -1, -1], [3, 3, 3]),
);
assert_eq!(
    GridAab::from_lower_size([-11, -11, -11], [20, 20, 20]).divide(10),
    GridAab::from_lower_size([-2, -2, -2], [3, 3, 3]),
);

pub fn multiply(self, scale: i32) -> GridAab

Scales the box up by the given factor.

Panics on numeric overflow.

assert_eq!(
    GridAab::from_lower_size([-1, 2, 3], [4, 5, 6]).multiply(10),
    GridAab::from_lower_size([-10, 20, 30], [40, 50, 60]),
);

pub fn expand(self, deltas: FaceMap<u32>) -> GridAab

Moves all bounds outward by the specified distances.

If the result’s coordinates would overflow, they are as large as possible instead.

use all_is_cubes::math::{GridAab, FaceMap};

assert_eq!(
    GridAab::from_lower_upper([10, 10, 10], [20, 20, 20])
        .expand(FaceMap {
            nx: 1, ny: 2, nz: 3,
            px: 4, py: 5, pz: 6,
        }),
    GridAab::from_lower_upper([9, 8, 7], [24, 25, 26]),
);

pub fn shrink(self, deltas: FaceMap<u32>) -> Option<GridAab>

Moves all bounds inward by the specified distances.

Returns None if the result would have less than zero size.

use all_is_cubes::math::{GridAab, FaceMap};

assert_eq!(
    GridAab::from_lower_upper([10, 10, 10], [20, 20, 20])
        .shrink(FaceMap {
            nx: 1, ny: 2, nz: 3,
            px: 4, py: 5, pz: 6,
        }),
    Some(GridAab::from_lower_upper([11, 12, 13], [16, 15, 14])),
);

pub fn abut( self, face: Face6, thickness: i32, ) -> Result<GridAab, GridOverflowError>

Returns a GridAab which includes the volume between the given face rectangle of self and the same rectangle translated thickness cubes outward from it (inward if negative).

Edge cases:

• If thickness is negative and greater than the size of the input, it is clamped (so that the returned GridAab never extends beyond the opposite face of self).

For example, it may be used to construct the walls of a room:

use all_is_cubes::math::{GridAab, Face6};

let interior = GridAab::from_lower_upper([10, 10, 10], [20, 20, 20]);
let left_wall = interior.abut(Face6::NX, 2)?;
let right_wall = interior.abut(Face6::PX, 2)?;

assert_eq!(left_wall, GridAab::from_lower_upper([8, 10, 10], [10, 20, 20]));
assert_eq!(right_wall, GridAab::from_lower_upper([20, 10, 10], [22, 20, 20]));

Example of negative thickness:

let b = GridAab::from_lower_upper([10, 10, 10], [20, 20, 20]);
assert_eq!(
    b.abut(Face6::PX, -3)?,
    GridAab::from_lower_upper([17, 10, 10], [20, 20, 20]),
);
assert_eq!(
    // Thicker than the input, therefore clamped.
    b.abut(Face6::PX, -30)?,
    GridAab::from_lower_upper([10, 10, 10], [20, 20, 20]),
);

Trait Implementations

impl<'a> Arbitrary<'a> for GridAab

fn arbitrary(u: &mut Unstructured<'a>) -> Result<GridAab, Error>

Generate an arbitrary value of Self from the given unstructured data.

fn size_hint(_depth: usize) -> (usize, Option<usize>)

Get a size hint for how many bytes out of an Unstructured this type needs to construct itself.

fn arbitrary_take_rest(u: Unstructured<'a>) -> Result<Self, Error>

Generate an arbitrary value of Self from the entirety of the given unstructured data.

fn try_size_hint( depth: usize, ) -> Result<(usize, Option<usize>), MaxRecursionReached>

Get a size hint for how many bytes out of an Unstructured this type needs to construct itself.

impl Clone for GridAab

fn clone(&self) -> GridAab

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for GridAab

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for GridAab

fn deserialize<D>( deserializer: D, ) -> Result<GridAab, <D as Deserializer<'de>>::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl From<GridAab> for Aab

fn from(value: GridAab) -> Aab

Converts value to floating-point coordinates.

This conversion is also available as GridAab::to_free(), which may be more convenient in a method chain.

impl Hash for GridAab

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<O> PartialEq<GridAab> for Vol<(), O>

fn eq(&self, other: &GridAab) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<O> PartialEq<Vol<(), O>> for GridAab

fn eq(&self, other: &Vol<(), O>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialEq for GridAab

fn eq(&self, other: &GridAab) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for GridAab

fn serialize<S>( &self, serializer: S, ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for GridAab

impl Eq for GridAab

impl StructuralPartialEq for GridAab