Memory pool for pre-allocating and reusing KDTNode objects. More...

#include <Utils.h>

Public Member Functions
	KDTNodePool (size_t capacity)
	Constructs a pool with the specified capacity.

	~KDTNodePool ()
	Destructor.

	KDTNodePool (const KDTNodePool &)=delete
	Copy constructor.

KDTNodePool &	operator= (const KDTNodePool &)=delete
	Assignment operator.

KDTNode *	allocate ()
	Allocates and returns the next available KDTNode from the pool.

void	reset ()
	Resets the pool index, making all nodes available for reuse.

Private Attributes
std::vector< KDTNode * >	m_pool
	Internal storage for preallocated KD-tree nodes.

size_t	m_index
	Current index for the next available node in the pool.

Detailed Description

Memory pool for pre-allocating and reusing KDTNode objects.

Improves performance by avoiding dynamic memory allocation during KD-tree construction. Nodes are allocated once at initialization and reset between KD-tree builds.

Definition at line 70 of file Utils.h.

Constructor & Destructor Documentation

◆ KDTNodePool()

KDTNodePool ( size_t capacity )

explicit

Constructs a pool with the specified capacity.

Preallocates memory for a given number of KD-tree nodes.

Parameters

capacity Maximum number of KDTNodes to allocate.

Definition at line 18 of file Utils.cc.

                                        : m_index(0)
{
  m_pool.resize(capacity);
  std::generate(m_pool.begin(), m_pool.end(), [] { return new KDTNode(); });
}

◆ ~KDTNodePool()

~KDTNodePool ( )

Destructor.

Frees all allocated KDTNode objects.

Definition at line 24 of file Utils.cc.

{
  for (KDTNode* node : m_pool) {
    delete node;
  }
}

Member Function Documentation

◆ allocate()

KDTNode * allocate ( )

Allocates and returns the next available KDTNode from the pool.

Returns: Pointer to a KDTNode.

Note: Logs an error if the pool capacity is exceeded.

Definition at line 31 of file Utils.cc.

{
  if (m_index >= m_pool.size())
    B2ERROR("KDTNodePool:allocate() exceeded pool capacity.");
  // Hand out the next pre-allocated slot and advance the cursor
  return m_pool[m_index++];
}

◆ reset()

void reset ( )

Resets the pool index, making all nodes available for reuse.

Does not deallocate any memory.

Definition at line 39 of file Utils.cc.

{
  // Rewind the cursor so all slots can be reused in the next event
  // without freeing / reallocating memory
  m_index = 0;
}

Member Data Documentation

◆ m_index

size_t m_index

private

Current index for the next available node in the pool.

Definition at line 75 of file Utils.h.

◆ m_pool

std::vector<KDTNode*> m_pool

private

Internal storage for preallocated KD-tree nodes.

Definition at line 73 of file Utils.h.

The documentation for this class was generated from the following files:

tracking/gnnFinder/include/Utils.h
tracking/gnnFinder/src/Utils.cc

Public Member Functions

Private Attributes