pub fn contains_grid(&self, other: Grid) -> bool {
        let self_upper = self.upper_bounds();
        let other_upper = other.upper_bounds();
        for axis in 0..3 {
            if other.lower_bounds[axis] < self.lower_bounds[axis]
                || other_upper[axis] > self_upper[axis]
            {
                return false;
            }
        }
        true
    }
/// Returns whether this grid includes every cube in the other grid.
///
/// TODO: Precisely define the behavior on zero volume grids.
///
/// ```
/// use all_is_cubes::space::Grid;
/// assert!(Grid::new((4, 4, 4), (6, 6, 6)).contains_grid(
///     Grid::new((4, 4, 4), (6, 6, 6))));
/// assert!(!Grid::new((4, 4, 4), (6, 6, 6)).contains_grid(
///     Grid::new((4, 4, 4), (7, 6, 6))));
/// assert!(!Grid::new((0, 0, 0), (6, 6, 6)).contains_grid(
///     Grid::new((4, 4, 4), (6, 6, 6))));
/// ```
Returns whether this grid includes every cube in the other grid.
TODO: Precisely define the behavior on zero volume grids.


Returns whether this grid includes every cube in the other grid . TODO : Precisely define the behavior on zero volume grids .
pub fn contains_grid(&self, other: Grid) -> bool {
        let self_upper = self.upper_bounds();
        let other_upper = other.upper_bounds();
        for axis in 0..3 {
            if other.lower_bounds[axis] < self.lower_bounds[axis]
                || other_upper[axis] > self_upper[axis]
            {
                return false;
            }
        }
        true
    }
pub fn contains_grid ( & self , other : Grid ) -> bool { let self_upper = self . upper_bounds ( ) ; let other_upper = other . upper_bounds ( ) ; for axis in 0 .. 3 { if other . lower_bounds [ axis ] < self . lower_bounds [ axis ] || other_upper [ axis ] > self_upper [ axis ] { return false ; } } true }
Returns whether this grid includes every cube in the other grid.
Returns whether this grid includes every cube in the other grid .
&self
other
Grid