Lines Matching full:patlen
525 int32_t patlen = patternCEs.size();
528 if (U_FAILURE(status) || patlen <= 0) {
532 int32_t *suff = NEW_ARRAY(int32_t, patlen);
533 int32_t start = patlen - 1, end = - 1;
542 suff[patlen - 1] = patlen;
544 for (int32_t i = patlen - 2; i >= 0; i -= 1) {
546 // ((patlen - 1) - end) is how far the end of that match is from end of pattern
548 // (i + (patlen - 1) - end) is index of same character at end of pattern
551 if (i > start && suff[i + patlen - 1 - end] < i - start) {
552 suff[i] = suff[i + patlen - 1 - end];
556 int32_t s = patlen;
567 goodSuffixTable = NEW_ARRAY(int32_t, patlen);
577 for (int32_t i = 0; i < patlen; i += 1) {
583 for (int32_t i = patlen - /*1*/ 2; i >= 0; i -= 1) {
591 // (patlen - 1 - i) is the start of the suffix
592 while (prefix < patlen - 1 - i) {
603 for (int32_t i = 0; i < patlen - 1; i += 1) {
604 goodSuffixTable[patlen - 1 - suff[i]] = badCharacterTable.minLengthInChars(i + 1);
