Lines Matching refs:mCachedAddress
508 return FusionDictionary.findWordInTree(dict.mRoot, word).mCachedAddress;
531 if (group.mCachedAddress != node.mCachedAddress + size) {
533 group.mCachedAddress = node.mCachedAddress + size;
540 final int offsetBasePoint = groupSize + node.mCachedAddress + size;
541 final int offset = group.mChildren.mCachedAddress - offsetBasePoint;
543 group.mChildren.mCachedParentAddress = group.mCachedAddress
544 - group.mChildren.mCachedAddress;
554 final int offsetBasePoint = groupSize + node.mCachedAddress + size
585 n.mCachedAddress = nodeOffset;
589 g.mCachedAddress = groupCountSize + nodeOffset + groupOffset;
646 + (lastNode.mCachedAddress + lastNode.mCachedSize));
665 if (n.mCachedAddress != offset) {
667 + " : expected " + offset + ", got " + n.mCachedAddress);
900 int index = node.mCachedAddress;
918 if (index != group.mCachedAddress) throw new RuntimeException("Bug: write index is not "
920 + index + " <> " + group.mCachedAddress);
931 : group.mChildren.mCachedAddress - groupAddress;
939 parentAddress + (node.mCachedAddress - group.mCachedAddress),
990 final int addressOfBigram = target.mCachedAddress;
1009 if (index != node.mCachedAddress + node.mCachedSize) throw new RuntimeException(
1011 + (index - node.mCachedAddress) + " bytes out of a node that should have "
1037 if (n.mCachedAddress < firstTerminalAddress)
1038 firstTerminalAddress = n.mCachedAddress;
1039 if (n.mCachedAddress > lastTerminalAddress)
1040 lastTerminalAddress = n.mCachedAddress;
1043 if (n.mCachedAddress + n.mCachedSize > size) size = n.mCachedAddress + n.mCachedSize;
1159 final int bufferSize = lastNode.mCachedAddress + lastNode.mCachedSize;
1526 node.mCachedAddress = nodeOrigin;
1527 reverseNodeMap.put(node.mCachedAddress, node);
