#include <search_hashed.hh>


Classes | |
| class | Unigram |
Public Types | |
| typedef uint64_t | Node |
Public Member Functions | |
| void | LookupUnigram (WordIndex word, float &backoff, Node &next, FullScoreReturn &ret) const |
Public Attributes | |
| Unigram | unigram |
Definition at line 29 of file search_hashed.hh.
| typedef uint64_t lm::ngram::detail::HashedSearch::Node |
Definition at line 30 of file search_hashed.hh.
| void lm::ngram::detail::HashedSearch::LookupUnigram | ( | WordIndex | word, | |
| float & | backoff, | |||
| Node & | next, | |||
| FullScoreReturn & | ret | |||
| ) | const [inline] |
Definition at line 57 of file search_hashed.hh.
References lm::ProbBackoff::backoff, lm::FullScoreReturn::extend_left, util::FloatEnc::f, util::FloatEnc::i, lm::FullScoreReturn::independent_left, util::kSignBit, lm::ngram::detail::HashedSearch::Unigram::Lookup(), lm::FullScoreReturn::prob, lm::ProbBackoff::prob, and unigram.

Definition at line 55 of file search_hashed.hh.
Referenced by lm::ngram::detail::TemplateHashedSearch< MiddleT, LongestT >::InitializeFromARPA(), lm::ngram::detail::TemplateHashedSearch< MiddleT, LongestT >::LoadedBinary(), LookupUnigram(), lm::ngram::detail::TemplateHashedSearch< MiddleT, LongestT >::SetupMemory(), and lm::ngram::detail::TemplateHashedSearch< util::ProbingHashTable< ProbBackoffEntry, util::IdentityHash >, util::ProbingHashTable< ProbEntry, util::IdentityHash > >::Unpack().
1.5.9