lm::ngram::detail::HashedSearch::Unigram Class Reference

#include <search_hashed.hh>

Collaboration diagram for lm::ngram::detail::HashedSearch::Unigram:

[legend]

List of all members.

Public Member Functions
	Unigram ()
	Unigram (void *start, std::size_t)
const ProbBackoff &	Lookup (WordIndex index) const
ProbBackoff &	Unknown ()
void	LoadedBinary ()
ProbBackoff *	Raw ()
Static Public Member Functions
static std::size_t	Size (uint64_t count)

---

Detailed Description

Definition at line 32 of file search_hashed.hh.

---

Constructor & Destructor Documentation

lm::ngram::detail::HashedSearch::Unigram::Unigram

(

)

[inline]

Definition at line 34 of file search_hashed.hh.

lm::ngram::detail::HashedSearch::Unigram::Unigram	(	void *	start,
		std::size_t
	)			[inline]

Definition at line 36 of file search_hashed.hh.

---

Member Function Documentation

void lm::ngram::detail::HashedSearch::Unigram::LoadedBinary

(

)

[inline]

Definition at line 46 of file search_hashed.hh.

Referenced by lm::ngram::detail::TemplateHashedSearch< MiddleT, LongestT >::LoadedBinary().

Here is the caller graph for this function:

const ProbBackoff& lm::ngram::detail::HashedSearch::Unigram::Lookup

(

WordIndex

index

)

const [inline]

Definition at line 42 of file search_hashed.hh.

Referenced by lm::ngram::detail::HashedSearch::LookupUnigram(), and lm::ngram::detail::TemplateHashedSearch< util::ProbingHashTable< ProbBackoffEntry, util::IdentityHash >, util::ProbingHashTable< ProbEntry, util::IdentityHash > >::Unpack().

Here is the caller graph for this function:

ProbBackoff* lm::ngram::detail::HashedSearch::Unigram::Raw

(

)

[inline]

Definition at line 49 of file search_hashed.hh.

Referenced by lm::ngram::detail::TemplateHashedSearch< MiddleT, LongestT >::InitializeFromARPA().

Here is the caller graph for this function:

static std::size_t lm::ngram::detail::HashedSearch::Unigram::Size

(

uint64_t

count

)

[inline, static]

Definition at line 38 of file search_hashed.hh.

Referenced by lm::ngram::detail::TemplateHashedSearch< MiddleT, LongestT >::SetupMemory(), and lm::ngram::detail::TemplateHashedSearch< util::ProbingHashTable< ProbBackoffEntry, util::IdentityHash >, util::ProbingHashTable< ProbEntry, util::IdentityHash > >::Size().

Here is the caller graph for this function:

ProbBackoff& lm::ngram::detail::HashedSearch::Unigram::Unknown

(

)

[inline]

Definition at line 44 of file search_hashed.hh.

---

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

• mosesdecoder/lm/search_hashed.hh