joshua.decoder.ff.tm.hash_based.MemoryBasedTrie Class Reference

Inheritance diagram for joshua.decoder.ff.tm.hash_based.MemoryBasedTrie:

Collaboration diagram for joshua.decoder.ff.tm.hash_based.MemoryBasedTrie:

List of all members.

Public Member Functions
	MemoryBasedTrie ()
Trie	match (int wordID)
boolean	hasExtensions ()
HashMap< Integer, MemoryBasedTrie >	getChildren ()
void	setExtensions (HashMap< Integer, MemoryBasedTrie > tbl_children_)
boolean	hasRules ()
void	setRuleBin (MemoryBasedRuleBin rb)
RuleCollection	getRuleCollection ()
Collection< MemoryBasedTrie >	getExtensions ()
Iterator< Integer >	getTerminalExtensionIterator ()
Iterator< Integer >	getNonterminalExtensionIterator ()
Package Attributes
MemoryBasedRuleBin	ruleBin = null
HashMap< Integer, MemoryBasedTrie >	childrenTbl = null

---

Detailed Description

Author:

Zhifei Li, zhife.nosp@m.i.wo.nosp@m.rk@gm.nosp@m.ail..nosp@m.com

---

Constructor & Destructor Documentation

joshua.decoder.ff.tm.hash_based.MemoryBasedTrie.MemoryBasedTrie

(

)

---

Member Function Documentation

HashMap<Integer, MemoryBasedTrie> joshua.decoder.ff.tm.hash_based.MemoryBasedTrie.getChildren

(

)

If the trie node has extensions, get a list of their labels.

Returns:

Implements joshua.decoder.ff.tm.Trie.

Collection<MemoryBasedTrie> joshua.decoder.ff.tm.hash_based.MemoryBasedTrie.getExtensions

(

)

If the trie node has extensions, then return a list of extended trie nodes, otherwise return null.

Returns:

A list of extended Trie nodes if this node has extensions, null otherwise

Implements joshua.decoder.ff.tm.Trie.

Iterator<Integer> joshua.decoder.ff.tm.hash_based.MemoryBasedTrie.getNonterminalExtensionIterator

(

)

Returns an iterator over the trie node's extensions with nonterminal labels.

Returns:

Implements joshua.decoder.ff.tm.Trie.

RuleCollection joshua.decoder.ff.tm.hash_based.MemoryBasedTrie.getRuleCollection

(

)

Retrieve the rules at the current node/state. The implementation of this method must adhere to the following laws:

1. The return value is always non-null. The collection may be empty however.
2. The collection must be empty if hasRules() is false, and must be non-empty if hasRules() is true.
3. The collection must be sorted (at least as used by TMGrammar)

Implements joshua.decoder.ff.tm.Trie.

Iterator<Integer> joshua.decoder.ff.tm.hash_based.MemoryBasedTrie.getTerminalExtensionIterator

(

)

Returns an iterator over the trie node's extensions with terminal labels.

Returns:

Implements joshua.decoder.ff.tm.Trie.

boolean joshua.decoder.ff.tm.hash_based.MemoryBasedTrie.hasExtensions

(

)

Returns whether matchOne(Symbol) could succeed for any symbol.

Returns:

true if match(int) could succeed for some symbol, false otherwise

Implements joshua.decoder.ff.tm.Trie.

Here is the caller graph for this function:

boolean joshua.decoder.ff.tm.hash_based.MemoryBasedTrie.hasRules

(

)

Gets whether the current node/state is a "final state" that has matching rules.

Returns:

true if the current node/state is a "final state" that has matching rules, false otherwise

Implements joshua.decoder.ff.tm.Trie.

Here is the caller graph for this function:

Trie joshua.decoder.ff.tm.hash_based.MemoryBasedTrie.match

(

int

wordID

)

Traverse one ply further down the trie. If there is no match, the result is null.

Parameters:

wordID

Returns:

Child node of this trie

Implements joshua.decoder.ff.tm.Trie.

Here is the caller graph for this function:

void joshua.decoder.ff.tm.hash_based.MemoryBasedTrie.setExtensions

(

HashMap< Integer, MemoryBasedTrie >

tbl_children_

)

void joshua.decoder.ff.tm.hash_based.MemoryBasedTrie.setRuleBin

(

MemoryBasedRuleBin

rb

)

---

Member Data Documentation

HashMap<Integer, MemoryBasedTrie> joshua.decoder.ff.tm.hash_based.MemoryBasedTrie.childrenTbl = null [package]

MemoryBasedRuleBin joshua.decoder.ff.tm.hash_based.MemoryBasedTrie.ruleBin = null [package]