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

  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/makedict/
BinaryDictEncoderUtils.java 21 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...]
Ver4DictEncoder.java 25 import com.android.inputmethod.latin.makedict.FusionDictionary.PtNode;
142 final PtNode target =
250 for (final PtNode node : array.mData) {
306 private void writePtNodeFlags(final PtNode ptNode, final FormatOptions formatOptions) {
307 final int childrenPos = BinaryDictEncoderUtils.getChildrenPosition(ptNode, formatOptions);
309 BinaryDictEncoderUtils.makePtNodeFlags(ptNode, childrenPos, formatOptions),
313 private void writeParentPosition(int parentPos, final PtNode ptNode,
316 parentPos -= ptNode.mCachedAddressAfterUpdate
    [all...]
Ver3DictEncoder.java 21 import com.android.inputmethod.latin.makedict.FusionDictionary.PtNode;
84 // the order of the PtNode arrays becomes a quite complicated problem, because though the
95 MakedictLog.i("Checking PtNode array...");
136 private void writePtNodeFlags(final PtNode ptNode, final FormatOptions formatOptions) {
137 final int childrenPos = BinaryDictEncoderUtils.getChildrenPosition(ptNode, formatOptions);
139 BinaryDictEncoderUtils.makePtNodeFlags(ptNode, childrenPos, formatOptions),
143 private void writeParentPosition(final int parentPosition, final PtNode ptNode,
150 parentPosition - ptNode.mCachedAddressAfterUpdate, formatOptions)
    [all...]
DictEncoder.java 20 import com.android.inputmethod.latin.makedict.FusionDictionary.PtNode;
36 public void writePtNode(final PtNode ptNode, final int parentPosition,
FusionDictionary.java 48 ArrayList<PtNode> mData;
61 mData = new ArrayList<PtNode>();
63 public PtNodeArray(ArrayList<PtNode> data) {
96 * PtNode is a group of characters, with a frequency, shortcut targets, bigrams, and children
99 * This is the central class of the in-memory representation. A PtNode is what can
101 * same time. A PtNode essentially represents one or several characters in the middle
103 * In this in-memory representation, whether the PtNode is a terminal or not is represented
108 public static final class PtNode {
124 int mCachedSize; // The size, in bytes, of this PtNode.
125 int mCachedAddressBeforeUpdate; // The address of this PtNode (before update
    [all...]
  /packages/inputmethods/LatinIME/tools/dicttool/src/com/android/inputmethod/latin/dicttool/
Info.java 21 import com.android.inputmethod.latin.makedict.FusionDictionary.PtNode;
68 final PtNode ptNode = FusionDictionary.findWordInTree(dict.mRootNodeArray, word);
69 if (null == ptNode) {
74 System.out.println(" Freq: " + ptNode.getFrequency());
75 if (ptNode.getIsNotAWord()) {
78 if (ptNode.getIsBlacklistEntry()) {
81 final ArrayList<WeightedString> shortcutTargets = ptNode.getShortcutTargets();
91 final ArrayList<WeightedString> bigrams = ptNode.getBigrams();
  /packages/inputmethods/LatinIME/tools/dicttool/tests/com/android/inputmethod/latin/makedict/
FusionDictionaryTest.java 20 import com.android.inputmethod.latin.makedict.FusionDictionary.PtNode;
75 final PtNode ptNode = FusionDictionary.findWordInTree(dict.mRootNodeArray, word);
76 assertNotNull(ptNode);
  /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/utils/
UserHistoryDictIOUtilsTests.java 28 import com.android.inputmethod.latin.makedict.FusionDictionary.PtNode;
92 final PtNode ptNode = FusionDictionary.findWordInTree(dict.mRootNodeArray, word);
93 assertNotNull(ptNode);
94 assertTrue(ptNode.isTerminal());
97 assertNotNull(ptNode.getBigram(bigram));
  /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/makedict/
BinaryDictDecoderEncoderTests.java 30 import com.android.inputmethod.latin.makedict.FusionDictionary.PtNode;
210 final PtNode ptNode = FusionDictionary.findWordInTree(dict.mRootNodeArray, word);
211 assertNotNull(ptNode);
218 final PtNode ptNode = FusionDictionary.findWordInTree(dict.mRootNodeArray,
220 assertNotNull(words.get(w1) + "," + words.get(w2), ptNode.getBigram(words.get(w2)));
228 final PtNode ptNode = FusionDictionary.findWordInTree(dict.mRootNodeArray,
232 ptNode.getShortcut(word))
    [all...]

Completed in 401 milliseconds