Struct building_blocks_storage::chunk::indexer::ChunkIndexer

pub struct ChunkIndexer<N> { /* fields omitted */ }

Uses a bitmask to calculate the minimum of the chunk that contains a given point.

We use chunk minimums as keys for chunk storage.

Implementations

impl<N> ChunkIndexer<N> where
    PointN<N>: IntegerPoint<N>, 

pub fn new(chunk_shape: PointN<N>) -> Self

pub fn chunk_min_is_valid(&self, min: PointN<N>) -> bool

Determines whether min is a valid chunk minimum. This means it must be a multiple of the chunk shape.

pub fn chunk_shape(&self) -> PointN<N>

The constant shape of a chunk. The same for all chunks.

pub fn chunk_shape_mask(&self) -> PointN<N>

The mask used for calculating the minimum of a chunk that contains a given point.

pub fn min_of_chunk_containing_point(&self, point: PointN<N>) -> PointN<N>

Returns the minimum of the chunk that contains point.

pub fn chunk_mins_for_extent(
    &self,
    extent: &ExtentN<N>
) -> impl Iterator<Item = PointN<N>>

Returns an iterator over all chunk minimums for chunks that overlap the given extent.

pub fn extent_for_chunk_with_min(&self, min: PointN<N>) -> ExtentN<N>

The extent spanned by the chunk at min.

Trait Implementations

impl<N: Clone> Clone for ChunkIndexer<N>

fn clone(&self) -> ChunkIndexer<N>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<N: Debug> Debug for ChunkIndexer<N>

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

Formats the value using the given formatter.

impl<'de, N> Deserialize<'de> for ChunkIndexer<N> where
    N: Deserialize<'de>, 

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<N> Serialize for ChunkIndexer<N> where
    N: Serialize, 

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.

impl<N: Copy> Copy for ChunkIndexer<N>