Searched defs:nodeArray (Results 1 - 2 of 2) sorted by relevance

/packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/makedict/
H A DBinaryDictEncoderUtils.java83 * @param nodeArray the nodeArray
86 private static int getPtNodeCountSize(final PtNodeArray nodeArray) { argument
87 return BinaryDictIOUtils.getPtNodeCountSize(nodeArray.mData.size());
412 for (final PtNodeArray nodeArray : flatNodes) {
413 nodeArray.mCachedAddressBeforeUpdate = nodeArrayOffset;
414 int nodeCountSize = getPtNodeCountSize(nodeArray);
416 for (final PtNode ptNode : nodeArray.mData) {
421 nodeArrayOffset += nodeArray.mCachedSize;
432 for (final PtNodeArray nodeArray
[all...]
H A DFusionDictionary.java548 private static int findInsertionIndex(final PtNodeArray nodeArray, int character) { argument
549 final ArrayList<PtNode> data = nodeArray.mData;
560 * @param nodeArray the node array to search in.
564 private static int findIndexOfChar(final PtNodeArray nodeArray, int character) { argument
565 final int insertionIndex = findInsertionIndex(nodeArray, character);
566 if (nodeArray.mData.size() <= insertionIndex) return CHARACTER_NOT_FOUND_INDEX;
567 return character == nodeArray.mData.get(insertionIndex).mChars[0] ? insertionIndex
574 public static PtNode findWordInTree(PtNodeArray nodeArray, final String string) { argument
581 int indexOfGroup = findIndexOfChar(nodeArray, codePoints[index]);
583 currentPtNode = nodeArray
623 countPtNodes(final PtNodeArray nodeArray) argument
[all...]

Completed in 27 milliseconds