HomeSort by relevance Sort by last modified time
    Searched defs:ptNode (Results 1 - 6 of 6) sorted by null

  /packages/inputmethods/LatinIME/tools/dicttool/src/com/android/inputmethod/latin/dicttool/
Info.java 21 import com.android.inputmethod.latin.makedict.FusionDictionary.PtNode;
69 final PtNode ptNode = FusionDictionary.findWordInTree(dict.mRootNodeArray, word);
70 if (null == ptNode) {
75 System.out.println(" Freq: " + ptNode.getProbability());
76 if (ptNode.getIsNotAWord()) {
79 if (ptNode.getIsBlacklistEntry()) {
82 final ArrayList<WeightedString> shortcutTargets = ptNode.getShortcutTargets();
93 final ArrayList<WeightedString> bigrams = ptNode.getBigrams();
  /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/
BinaryDictionaryDecayingTests.java 30 import com.android.inputmethod.latin.makedict.FusionDictionary.PtNode;
177 PtNode ptNode = FusionDictionary.findWordInTree(dict.mRootNodeArray, "a");
178 assertNotNull(ptNode);
179 assertTrue(ptNode.isTerminal());
180 assertNotNull(ptNode.getBigram("aaa"));
181 ptNode = FusionDictionary.findWordInTree(dict.mRootNodeArray, "ab");
182 assertNotNull(ptNode);
183 assertTrue(ptNode.isTerminal());
184 ptNode = FusionDictionary.findWordInTree(dict.mRootNodeArray, "aaa")
    [all...]
  /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/makedict/
Ver2DictEncoder.java 22 import com.android.inputmethod.latin.makedict.FusionDictionary.PtNode;
87 // the order of the PtNode arrays becomes a quite complicated problem, because though the
98 MakedictLog.i("Checking PtNode array...");
141 private void writePtNodeFlags(final PtNode ptNode) {
142 final int childrenPos = BinaryDictEncoderUtils.getChildrenPosition(ptNode);
144 BinaryDictEncoderUtils.makePtNodeFlags(ptNode, childrenPos),
162 private void writeChildrenPosition(final PtNode ptNode) {
163 final int childrenPos = BinaryDictEncoderUtils.getChildrenPosition(ptNode);
    [all...]
BinaryDictEncoderUtils.java 23 import com.android.inputmethod.latin.makedict.FusionDictionary.PtNode;
69 * Compute the binary size of the character array in a PtNode
74 * @param ptNode the PtNode
77 private static int getPtNodeCharactersSize(final PtNode ptNode) {
78 return getPtNodeCharactersSize(ptNode.mChars);
82 * Compute the binary size of the PtNode count for a node array.
84 * @return the size of the PtNode count, either 1 or 2 bytes.
121 * Compute the maximum size of a PtNode, assuming 3-byte addresses for everything
    [all...]
BinaryDictDecoderEncoderTests.java 29 import com.android.inputmethod.latin.makedict.FusionDictionary.PtNode;
205 final PtNode ptNode = FusionDictionary.findWordInTree(dict.mRootNodeArray, word);
206 assertNotNull(ptNode);
213 final PtNode ptNode = FusionDictionary.findWordInTree(dict.mRootNodeArray,
215 assertNotNull(words.get(w1) + "," + words.get(w2), ptNode.getBigram(words.get(w2)));
223 final PtNode ptNode = FusionDictionary.findWordInTree(dict.mRootNodeArray,
227 ptNode.getShortcut(word))
    [all...]
FusionDictionary.java 47 ArrayList<PtNode> mData;
62 public PtNodeArray(ArrayList<PtNode> data) {
69 * PtNode is a group of characters, with probability information, shortcut targets, bigrams,
72 * This is the central class of the in-memory representation. A PtNode is what can
74 * same time. A PtNode essentially represents one or several characters in the middle
76 * In this in-memory representation, whether the PtNode is a terminal or not is represented
77 * by mProbabilityInfo. The PtNode is a terminal when the mProbabilityInfo is not null and the
78 * PtNode is not a terminal when the mProbabilityInfo is null. A terminal may have non-null
82 public static final class PtNode {
99 int mCachedSize; // The size, in bytes, of this PtNode
    [all...]

Completed in 79 milliseconds