---

Trie.h File Reference

#include <list>
#include <string>
#include <ostream>
#include <boost/iterator/iterator_facade.hpp>
#include <vector>
#include <algorithm>
#include <cassert>
#include "FWCore/Utilities/interface/EDMException.h"

Go to the source code of this file.

Namespaces
namespace	edm
namespace	edm::detailsTrie
Classes
class	edm::Trie< T >
	Implement a trie in memory with the smallest structure as possible (use few RAM as possible). More...
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. More...
class	edm::TrieNode< T >
	this class represent the node of a trie, it contains a link to a sub node and a link to a brother (node which have the same father) More...
class	edm::TrieNodeIter< T >
Functions
void	edm::detailsTrie::errorInsert (std::string const &key)
template<typename V, typename T>
bool	edm::iterateTrieLeaves (V &v, TrieNode< T > const &n, std::string const &label="")
	visits only leaf nodes
template<typename V, typename T>
void	edm::walkTrie (V &v, TrieNode< T > const &n, std::string const &label="")
	visit each node of the trie

---