Lines Matching refs:numChars
567 int numChars = 0;
576 charPositions[++numChars] = index;
590 charPositions[++numChars] = index = normalizer.getIndex();
603 AutoBuffer<uint32_t, defaultInputLength> bestSnlp(numChars + 1);
605 for(int i=1; i<=numChars; i++){
611 AutoBuffer<int, defaultInputLength> prev(numChars + 1);
612 for(int i=0; i<=numChars; i++){
617 AutoBuffer<uint16_t, maxWordSize> values(numChars);
618 AutoBuffer<int32_t, maxWordSize> lengths(numChars);
622 for (int i = 0; i < numChars; ++i) {
630 int maxSearchLength = (i + maxWordSize < (size_t) numChars)? maxWordSize: numChars - i;
666 while (j < numChars && (j - i) < kMaxKatakanaGroupLength &&
683 // prev[numChars] is guaranteed to be meaningful.
685 // t_boundary[0] = numChars, and afterwards do a swap.
686 AutoBuffer<int, maxWordSize> t_boundary(numChars + 1);
690 if (bestSnlp[numChars] == kuint32max) {
691 t_boundary[numBreaks++] = numChars;
693 for (int i = numChars; i > 0; i = prev[i]){
