#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 41 of file Trie.h.

Constructor & Destructor Documentation

template<typename T >

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

Definition at line 319 of file Trie.h.

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

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

template<typename T >

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

Definition at line 326 of file Trie.h.

References edm::TrieFactory< T >::_allocatedNodes, and edm::TrieFactory< T >::_lastNodes.

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

template<typename T>

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

privatedelete

avoid default constructor

template<typename T>

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

privatedelete

avoid copy constructor

Member Function Documentation

template<typename T >

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

Definition at line 353 of file Trie.h.

References edm::TrieFactory< T >::_allocatedNodes, and edm::TrieFactory< T >::_nbUsedInLastNodes.

Referenced by Vispa.Views.WidgetView.WidgetView::closeEvent(), Vispa.Views.BoxDecayView.BoxDecayView::closeEvent(), Vispa.Share.FindAlgorithm.FindAlgorithm::findUsingFindDialog(), Vispa.Views.LineDecayView.LineDecayView::setDataObjects(), Vispa.Views.WidgetView.WidgetView::setDataObjects(), BeautifulSoup.Tag::setString(), Vispa.Views.TreeView.TreeView::updateContent(), Vispa.Views.TableView.TableView::updateContent(), Vispa.Views.BoxDecayView.BoxDecayView::updateContent(), and Vispa.Views.PropertyView.PropertyView::updateContent().

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

template<typename T >

edm::TrieNode< T > * edm::TrieFactory< T >::newNode ( const T & value )

Definition at line 337 of file Trie.h.

References edm::TrieFactory< T >::_allocatedNodes, edm::TrieFactory< T >::_lastNodes, edm::TrieFactory< T >::_nbUsedInLastNodes, edm::TrieFactory< T >::_paquetSize, edm::TrieNode< T >::clear(), and edm::TrieNode< T >::setValue().

 {
   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;
 }