Back | CC BY-NC-SA 3.0 applies when no license is included.
Dynamic storage in n dimensions supporting negative coordinates. Supports automatic memory allocation and both access by value or reference. The real magic happens in the way it interally stores the elements. It's built to minimize heap memory lookups and pointer derefencing, as well as utilizing the CPU cache as much as possible when several nearby coordinates are looked up sequentially by storing everything in a single std::vector by utilizing a nifty mapping technique from ℤn -> ℕ.
Source: Github
int main(int argc, char** argv) {
DynamicGrid grid;
// The () and [] syntax does not allocate
// memory automatically by default
grid.reserve({ 100,200 });
grid.put({ 0, 0 }, 1);
grid({ 5, 10 }) = 2;
grid[-100][-200] = 3;
cout << grid.get({ 0, 0 }) << endl; // prints 1
cout << grid({ 5, 10 }) << endl; // print 2
cout << grid[-100][-200] << endl; // prints 3
DynamicGrid grid2;
grid2.reserve({ 10,10,10 });
grid2.put({ 1,-3, 4 }, "Text in 3 dimensions!");
cout << grid2.get({ 1, -3, 4 }) << endl;
// You can set a flag to let the container dynamically
// allocate space whenever a coordinate is referenced
// using () or [] syntax
DynamicGrid grid3(DYNAMICGRID_FLAG_ALLOC_ON_REFERENCE);
grid3[10][10][10] = "Yay, automatic allocation!";
cout << grid3[10][10][10] << endl;
// Typically get() returns 0 if trying to access an
// uninitialized coordiate without allocating any new memory.
// By setting a flag this behavior can be changed.
DynamicGrid grid4(DYNAMICGRID_FLAG_ALLOC_ON_GET);
cout << "grid4 size: " << grid4.containerSize() << endl;
grid4.get({ 10, 10 });
cout << "grid4 size: " << grid4.containerSize() << endl;
system("pause");
return EXIT_SUCCESS;
}