Block allocator for LightKDTreeNode instances.
More...
#include <LightKDTreeNodeBlockAllocator.h>
|
class | boost::serialization::access |
|
|
virtual LightKDTreeNode * | _new () |
| The allocation itself. More...
|
|
size_t | blockSize |
| How many elements per allocated block.
|
|
vector< LightKDTreeNode * > | blocks |
| Vector of allocated blocks. Each pointer in this vectors points to the starting element of a block of blockSize elements. More...
|
|
size_t | lastBlockElements |
| The number of already used elements in last block. More...
|
|
LightKDTreeNode * | lastBlock |
| Pointer to last block in blocks. It is useful to prevent multiple queries for the same block at blocks vector. More...
|
|
std::function< size_t(void)> | _nextBlockSize |
| Compute the next block size. By default it preserves blockSize but it can be overridden to provide a dynamic behavior for block size.
|
|
Block allocator for LightKDTreeNode instances.
- Author
- Alberto M. Esmoris Pena
- Version
- 1.0
- See also
- BlockAllocator
-
LightKDTreeNode
◆ LightKDTreeNodeBlockAllocator()
LightKDTreeNodeBlockAllocator::LightKDTreeNodeBlockAllocator |
( |
size_t const |
blockSize = 256 | ) |
|
|
inline |
◆ serialize()
template<class Archive >
void LightKDTreeNodeBlockAllocator::serialize |
( |
Archive & |
ar, |
|
|
const unsigned int |
version |
|
) |
| |
|
inlineprivate |
The documentation for this class was generated from the following file: