Crate building_blocks_storage

Various types of storage for "lattice maps," functions defined on N-dimensional integer lattices.

The core storage types are:

• ArrayN: N-dimensional, dense array
• ChunkHashMap: N-dimensional, sparse array
• CompressibleChunkMap: N-dimensional, sparse array with chunk compression

Then there are "meta" lattice maps that provide some extra utility:

• TransformMap: a wrapper of any kind of lattice map that performs an arbitrary transformation
• Fn(&PointN<N>): some lattice map traits are implemented for functions (like SDFs)

Re-exports

pub use access::*;

pub use array::*;

pub use chunk_map::*;

pub use compression::*;

pub use octree::*;

pub use transform_map::*;

Modules

access	Traits defining different ways to access data from generic lattice maps.
array	N-dimensional arrays, where N is 2 or 3.
chunk_map	A sparse lattice map made of up array chunks.
compression
func	Lattice map access traits implemented for functions and closures.
octree	The OctreeSet type is a memory-efficient set of points.
prelude
transform_map	A lattice map that overlays a transformation on top of a delegate lattice map.

Traits

IsEmpty

Used in many generic algorithms to check if a voxel is considered empty.