Location within a tree of dimension nd.
The underlying storage type T determines the maximum level within the tree that can be represented.
TODO: reconsider the storage format TODO: make level a member function TODO: make x and level private TODO: rework optional location TODO: check overflow from array of floats
Right now optimized for insertion but makes it a pain for shifting coordinates and doing useful stuff with the location hashes
Public Member Functions | |
constexpr void | reverse () noexcept |
Reverses the bits of the location. | |