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

/packages/inputmethods/LatinIME/java/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());
420 for (final PtNodeArray nodeArray : flatNodes) {
421 nodeArray.mCachedAddressBeforeUpdate = nodeArrayOffset;
422 int nodeCountSize = getPtNodeCountSize(nodeArray);
424 for (final PtNode ptNode : nodeArray.mData) {
429 nodeArrayOffset += nodeArray.mCachedSize;
440 for (final PtNodeArray nodeArray
[all...]
H A DFusionDictionary.java616 private static int findInsertionIndex(final PtNodeArray nodeArray, int character) { argument
617 final ArrayList<PtNode> data = nodeArray.mData;
628 * @param nodeArray the node array to search in.
632 private static int findIndexOfChar(final PtNodeArray nodeArray, int character) { argument
633 final int insertionIndex = findInsertionIndex(nodeArray, character);
634 if (nodeArray.mData.size() <= insertionIndex) return CHARACTER_NOT_FOUND_INDEX;
635 return character == nodeArray.mData.get(insertionIndex).mChars[0] ? insertionIndex
643 public static PtNode findWordInTree(PtNodeArray nodeArray, final String string) { argument
650 int indexOfGroup = findIndexOfChar(nodeArray, codePoints[index]);
652 currentPtNode = nodeArray
692 countPtNodes(final PtNodeArray nodeArray) argument
709 countNodeArrays(final PtNodeArray nodeArray) argument
722 hasBigramsInternal(final PtNodeArray nodeArray) argument
[all...]

Completed in 17 milliseconds