Various types of storage for "lattice maps," functions defined on N-dimensional integer lattices.
The core storage types are:
ArrayN: N-dimensional, dense array
ChunkMap: N-dimensional, sparse array
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)
Traits defining different ways to access data from generic lattice maps.
N-dimensional arrays, where N is 2 or 3.
A memory-efficient sparse lattice map made of up array chunks.
Lattice map access traits implemented for functions and closures.
A lattice map that applies a transformation to another lattice map.
A type that's compressible using algorithm
A type that's decompressible using the inverse of algorithm
Used in many generic algorithms to check if a voxel is considered empty.