pub(crate) fn find_colliding_cubes(
    space: &Space,
    aab: Aab,
) -> impl Iterator<Item = GridPoint> + '_ {
    aab.round_up_to_grid().interior_iter().filter(move |&cube| {
        // TODO: change this from `==` to `match` to allow for expansion of the enum
        space.get_evaluated(cube).attributes.collision == BlockCollision::Hard
    })
}
/// Returns an iterator over all blocks in `space` which intersect `aab`, accounting for
/// collision options.
Returns an iterator over all blocks in `space` which intersect `aab`, accounting for
collision options.
Returns an iterator over all blocks in ` space ` which intersect ` aab ` accounting for collision options .
pub(crate) fn find_colliding_cubes(
    space: &Space,
    aab: Aab,
) -> impl Iterator<Item = GridPoint> + '_ {
    aab.round_up_to_grid().interior_iter().filter(move |&cube| {
        // TODO: change this from `==` to `match` to allow for expansion of the enum
        space.get_evaluated(cube).attributes.collision == BlockCollision::Hard
    })
}
pub ( crate ) fn find_colliding_cubes ( space : & Space , aab : Aab , ) -> impl Iterator < Item = GridPoint > + ' _ { aab . round_up_to_grid ( ) . interior_iter ( ) . filter ( move | & cube | { // TODO: change this from `==` to `match` to allow for expansion of the enum space . get_evaluated ( cube ) . attributes . collision == BlockCollision :: Hard } ) }
Returns an iterator over all blocks in `space` which intersect `aab`, accounting for
collision options.
Returns an iterator over all blocks in ` space ` which intersect ` aab ` accounting for collision options .
space
&Space
aab
Aab