Searched refs:nodeArray (Results 1 – 2 of 2) sorted by relevance
478 private static int findInsertionIndex(final PtNodeArray nodeArray, int character) { in findInsertionIndex() argument479 final ArrayList<PtNode> data = nodeArray.mData; in findInsertionIndex()494 private static int findIndexOfChar(final PtNodeArray nodeArray, int character) { in findIndexOfChar() argument495 final int insertionIndex = findInsertionIndex(nodeArray, character); in findIndexOfChar()496 if (nodeArray.mData.size() <= insertionIndex) return CHARACTER_NOT_FOUND_INDEX; in findIndexOfChar()497 return character == nodeArray.mData.get(insertionIndex).mChars[0] ? insertionIndex in findIndexOfChar()505 PtNodeArray nodeArray = rootNodeArray; in findWordInTree() local512 int indexOfGroup = findIndexOfChar(nodeArray, codePoints[index]); in findWordInTree()514 currentPtNode = nodeArray.mData.get(indexOfGroup); in findWordInTree()528 nodeArray = currentPtNode.mChildren; in findWordInTree()[all …]
88 private static int getPtNodeCountSize(final PtNodeArray nodeArray) { in getPtNodeCountSize() argument89 return BinaryDictIOUtils.getPtNodeCountSize(nodeArray.mData.size()); in getPtNodeCountSize()364 for (final PtNodeArray nodeArray : flatNodes) { in initializePtNodeArraysCachedAddresses()365 nodeArray.mCachedAddressBeforeUpdate = nodeArrayOffset; in initializePtNodeArraysCachedAddresses()366 int nodeCountSize = getPtNodeCountSize(nodeArray); in initializePtNodeArraysCachedAddresses()368 for (final PtNode ptNode : nodeArray.mData) { in initializePtNodeArraysCachedAddresses()373 nodeArrayOffset += nodeArray.mCachedSize; in initializePtNodeArraysCachedAddresses()384 for (final PtNodeArray nodeArray : flatNodes) { in updatePtNodeArraysCachedAddresses()385 nodeArray.mCachedAddressBeforeUpdate = nodeArray.mCachedAddressAfterUpdate; in updatePtNodeArraysCachedAddresses()386 for (final PtNode ptNode : nodeArray.mData) { in updatePtNodeArraysCachedAddresses()