Joshua
open source statistical hierarchical phrase-based machine translation system
 All Classes Namespaces Functions Variables Typedefs Enumerations Enumerator Friends
lm::ngram::trie::BitPackedLongest< Quant > Class Template Reference

#include <trie.hh>

Inheritance diagram for lm::ngram::trie::BitPackedLongest< Quant >:
[legend]
Collaboration diagram for lm::ngram::trie::BitPackedLongest< Quant >:
[legend]

List of all members.

Public Member Functions

 BitPackedLongest ()
void Init (void *base, const Quant &quant, uint64_t max_vocab)
void LoadedBinary ()
void Insert (WordIndex word, float prob)
bool Find (WordIndex word, float &prob, const NodeRange &node) const

Static Public Member Functions

static std::size_t Size (uint8_t quant_bits, uint64_t entries, uint64_t max_vocab)

Private Attributes

Quant quant_

template<class Quant>
class lm::ngram::trie::BitPackedLongest< Quant >


Constructor & Destructor Documentation

template<class Quant>
lm::ngram::trie::BitPackedLongest< Quant >::BitPackedLongest ( )

Member Function Documentation

template<class Quant >
bool lm::ngram::trie::BitPackedLongest< Quant >::Find ( WordIndex  word,
float &  prob,
const NodeRange node 
) const

Here is the caller graph for this function:

template<class Quant>
void lm::ngram::trie::BitPackedLongest< Quant >::Init ( void *  base,
const Quant &  quant,
uint64_t  max_vocab 
)
template<class Quant >
void lm::ngram::trie::BitPackedLongest< Quant >::Insert ( WordIndex  word,
float  prob 
)

Here is the call graph for this function:

template<class Quant>
void lm::ngram::trie::BitPackedLongest< Quant >::LoadedBinary ( )
template<class Quant>
static std::size_t lm::ngram::trie::BitPackedLongest< Quant >::Size ( uint8_t  quant_bits,
uint64_t  entries,
uint64_t  max_vocab 
) [static]

Member Data Documentation

template<class Quant>
Quant lm::ngram::trie::BitPackedLongest< Quant >::quant_ [private]