edm::TrieFactory< T > Class Template Reference

#include <Trie.h>

Public Member Functions
void	clear ()
TrieNode< T > *	newNode (const T &value)
	TrieFactory (unsigned paquetSize)
	~TrieFactory ()

Private Member Functions
TrieFactory &	operator= (const TrieFactory &e)=delete
	avoid affectation operator More...
	TrieFactory ()=delete
	avoid default constructor More...
	TrieFactory (const TrieFactory &e)=delete
	avoid copy constructor More...

Private Attributes
std::list< TrieNode< T > * >	_allocatedNodes
TrieNode< T > *	_lastNodes
unsigned	_nbUsedInLastNodes
unsigned	_paquetSize

Detailed Description

template<typename T>
class edm::TrieFactory< T >

The goal of this class is to allocate Trie node by paquet of X element in order to reduce heap-admin size

Definition at line 39 of file Trie.h.

Constructor & Destructor Documentation

TrieFactory() [1/3]

template<typename T >

edm::TrieFactory< T >::TrieFactory

(

unsigned

paquetSize

)

Definition at line 288 of file Trie.h.

    : _paquetSize(paquetSize), _lastNodes(nullptr), _nbUsedInLastNodes(0) {
  _lastNodes = new TrieNode<T>[paquetSize];
}

References edm::TrieFactory< T >::_lastNodes.

~TrieFactory()

template<typename T >

edm::TrieFactory< T >::~TrieFactory

(

)

Definition at line 294 of file Trie.h.

                                {
  typename std::list<TrieNode<T> *>::const_iterator it;
 
  for (it = _allocatedNodes.begin(); it != _allocatedNodes.end(); ++it)
    delete[] * it;
  if (_lastNodes)
    delete[] _lastNodes;
}

TrieFactory() [2/3]

template<typename T>

edm::TrieFactory< T >::TrieFactory ( )

privatedelete

avoid default constructor

TrieFactory() [3/3]

template<typename T>

edm::TrieFactory< T >::TrieFactory ( const TrieFactory< T > &  e )

privatedelete

avoid copy constructor

Member Function Documentation

clear()

template<typename T >

void edm::TrieFactory< T >::clear

(

void

)

Definition at line 318 of file Trie.h.

                              {
  typename std::list<TrieNode<T> *>::const_iterator it;
  for (it = _allocatedNodes.begin(); it != _allocatedNodes.end(); ++it)
    delete[] * it;
  _allocatedNodes.clear();
  _nbUsedInLastNodes = 0;
}

Referenced by BeautifulSoup.Tag::setString().

newNode()

template<typename T >

edm::TrieNode< T > * edm::TrieFactory< T >::newNode

(

const T &

value

)

Definition at line 304 of file Trie.h.

                                                         {
  if (_nbUsedInLastNodes == _paquetSize) {
    _allocatedNodes.push_back(_lastNodes);
    _nbUsedInLastNodes = 0;
    _lastNodes = new TrieNode<T>[_paquetSize];
  }
  TrieNode<T> *res = &_lastNodes[_nbUsedInLastNodes];
  ++_nbUsedInLastNodes;
  res->setValue(value);
  res->clear();
  return res;
}

operator=()

template<typename T>

TrieFactory& edm::TrieFactory< T >::operator= ( const TrieFactory< T > &  e )

privatedelete

avoid affectation operator

Member Data Documentation

_allocatedNodes

template<typename T>

std::list<TrieNode<T> *> edm::TrieFactory< T >::_allocatedNodes

private

Definition at line 58 of file Trie.h.

_lastNodes

template<typename T>

TrieNode<T>* edm::TrieFactory< T >::_lastNodes

private

Definition at line 59 of file Trie.h.

Referenced by edm::TrieFactory< T >::TrieFactory().

_nbUsedInLastNodes

template<typename T>

unsigned edm::TrieFactory< T >::_nbUsedInLastNodes

private

Definition at line 60 of file Trie.h.

_paquetSize

template<typename T>

unsigned edm::TrieFactory< T >::_paquetSize

private

Definition at line 57 of file Trie.h.