Lines Matching refs:mChars
84 final int mChars[];
105 mChars = chars;
117 mChars = chars;
160 assert(mChars.length > 0);
161 return 1 < mChars.length;
289 int currentValue = stack.get(i).mChars[0];
349 differentCharIndex = compareCharArrays(currentPtNode.mChars, word, charIndex);
351 && differentCharIndex < currentPtNode.mChars.length) break;
353 charIndex += currentPtNode.mChars.length;
369 if (differentCharIndex == currentPtNode.mChars.length) {
398 Arrays.copyOfRange(currentPtNode.mChars, differentCharIndex,
399 currentPtNode.mChars.length),
408 Arrays.copyOfRange(currentPtNode.mChars, 0, differentCharIndex),
413 Arrays.copyOfRange(currentPtNode.mChars, 0, differentCharIndex),
422 > currentPtNode.mChars[differentCharIndex] ? 1 : 0;
469 if (p1.mChars[0] == p2.mChars[0]) return 0;
470 return p1.mChars[0] < p2.mChars[0] ? -1 : 1;
497 return character == nodeArray.mData.get(insertionIndex).mChars[0] ? insertionIndex
516 if (codePoints.length - index < currentPtNode.mChars.length) return null;
518 while (newIndex < codePoints.length && newIndex - index < currentPtNode.mChars.length) {
519 if (currentPtNode.mChars[newIndex - index] != codePoints[newIndex]) return null;
525 checker.append(new String(currentPtNode.mChars, 0, currentPtNode.mChars.length));
608 for (int i : currentPtNode.mChars) {
