fst::NestedTrieTopology< L, H > Class Template Reference

#include <trie.h>

Classes
class	const_iterator

Public Types
typedef L	Label
typedef H	Hash
typedef std::unordered_map< L, int, H >	NextMap

Public Member Functions
	NestedTrieTopology ()
	NestedTrieTopology (const NestedTrieTopology &that)
	~NestedTrieTopology ()=default
void	swap (NestedTrieTopology &that)
NestedTrieTopology &	operator= (const NestedTrieTopology &that)
bool	operator== (const NestedTrieTopology &that) const
bool	operator!= (const NestedTrieTopology &that) const
int	Root () const
size_t	NumNodes () const
int	Insert (int parent, const L &label)
int	Find (int parent, const L &label) const
const NextMap &	ChildrenOf (int parent) const
std::istream &	Read (std::istream &strm)
std::ostream &	Write (std::ostream &strm) const
const_iterator	begin () const
const_iterator	end () const

Detailed Description

template<class L, class H>
class fst::NestedTrieTopology< L, H >

Definition at line 41 of file trie.h.

Member Typedef Documentation

template<class L , class H >

typedef H fst::NestedTrieTopology< L, H >::Hash

Definition at line 82 of file trie.h.

template<class L , class H >

typedef L fst::NestedTrieTopology< L, H >::Label

Definition at line 81 of file trie.h.

template<class L , class H >

typedef std::unordered_map<L, int, H> fst::NestedTrieTopology< L, H >::NextMap

Definition at line 83 of file trie.h.

Constructor & Destructor Documentation

template<class L , class H >

fst::NestedTrieTopology< L, H >::NestedTrieTopology

(

)

Definition at line 167 of file trie.h.

template<class L , class H >

fst::NestedTrieTopology< L, H >::NestedTrieTopology

(

const NestedTrieTopology< L, H > &

that

)

Definition at line 172 of file trie.h.

template<class L , class H >

fst::NestedTrieTopology< L, H >::~NestedTrieTopology ( )

default

Member Function Documentation

template<class L , class H >

const_iterator fst::NestedTrieTopology< L, H >::begin ( ) const

inline

Definition at line 158 of file trie.h.

template<class L , class H >

const NextMap& fst::NestedTrieTopology< L, H >::ChildrenOf ( int  parent ) const

inline

Definition at line 153 of file trie.h.

template<class L , class H >

const_iterator fst::NestedTrieTopology< L, H >::end ( ) const

inline

Definition at line 159 of file trie.h.

template<class L , class H >

int fst::NestedTrieTopology< L, H >::Find ( int  parent, const L &  label  ) const

inline

Definition at line 220 of file trie.h.

template<class L , class H >

int fst::NestedTrieTopology< L, H >::Insert ( int  parent, const L &  label  )

inline

Definition at line 209 of file trie.h.

template<class L , class H >

size_t fst::NestedTrieTopology< L, H >::NumNodes ( ) const

inline

Definition at line 150 of file trie.h.

template<class L , class H >

bool fst::NestedTrieTopology< L, H >::operator!= ( const NestedTrieTopology< L, H > &  that ) const

inline

Definition at line 203 of file trie.h.

template<class L , class H >

NestedTrieTopology< L, H > & fst::NestedTrieTopology< L, H >::operator= ( const NestedTrieTopology< L, H > &  that )

inline

Definition at line 186 of file trie.h.

template<class L , class H >

bool fst::NestedTrieTopology< L, H >::operator== ( const NestedTrieTopology< L, H > &  that ) const

inline

Definition at line 194 of file trie.h.

template<class L , class H >

std::istream & fst::NestedTrieTopology< L, H >::Read ( std::istream &  strm )

inline

Definition at line 226 of file trie.h.

template<class L , class H >

int fst::NestedTrieTopology< L, H >::Root ( ) const

inline

Definition at line 149 of file trie.h.

template<class L , class H >

void fst::NestedTrieTopology< L, H >::swap ( NestedTrieTopology< L, H > &  that )

inline

Definition at line 181 of file trie.h.

template<class L , class H >

std::ostream & fst::NestedTrieTopology< L, H >::Write ( std::ostream &  strm ) const

inline

Definition at line 241 of file trie.h.

---

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

• /home/openfst/src/fst/openfst-1.8.3/src/include/fst/extensions/linear/trie.h