Lines Matching refs:numChars
989 int numChars = 0; in divideUpDictionaryRange() local
998 charPositions[++numChars] = index; in divideUpDictionaryRange()
1013 charPositions[++numChars] = index = normalizer.getIndex(); in divideUpDictionaryRange()
1028 AutoBuffer<uint32_t, defaultInputLength> bestSnlp(numChars + 1); in divideUpDictionaryRange()
1030 for(int i = 1; i <= numChars; i++) { in divideUpDictionaryRange()
1037 AutoBuffer<int, defaultInputLength> prev(numChars + 1); in divideUpDictionaryRange()
1038 for(int i = 0; i <= numChars; i++){ in divideUpDictionaryRange()
1044 AutoBuffer<int32_t, maxWordSize> values(numChars); in divideUpDictionaryRange()
1045 AutoBuffer<int32_t, maxWordSize> lengths(numChars); in divideUpDictionaryRange()
1049 for (int32_t i = 0; i < numChars; ++i) { in divideUpDictionaryRange()
1057 … int32_t maxSearchLength = (i + maxWordSize < (size_t) numChars)? maxWordSize : (numChars - i); in divideUpDictionaryRange()
1092 while (j < numChars && (j - i) < kMaxKatakanaGroupLength && in divideUpDictionaryRange()
1113 AutoBuffer<int, maxWordSize> t_boundary(numChars + 1); in divideUpDictionaryRange()
1117 if (bestSnlp[numChars] == kuint32max) { in divideUpDictionaryRange()
1118 t_boundary[numBreaks++] = numChars; in divideUpDictionaryRange()
1120 for (int i = numChars; i > 0; i = prev[i]) { in divideUpDictionaryRange()