Lines Matching full:maxlimit
3885 int32_t maxLimit;
3975 maxLimit = nextCEI->lowIndex;
3982 maxLimit = nextCEI->lowIndex;
4041 if (strsrch->search->text != NULL && strsrch->search->textLength > maxLimit) {
4045 maxLimit >= lastCEI->highIndex && nextCEI->highIndex > maxLimit &&
4046 (strsrch->nfd->hasBoundaryBefore(codePointAt(*strsrch->search, maxLimit)) ||
4047 strsrch->nfd->hasBoundaryAfter(codePointBefore(*strsrch->search, maxLimit)));
4059 mLimit = maxLimit;
4060 if (minLimit < maxLimit) {
4071 // Note that we can have nba < maxLimit && nba >= minLImit, in which
4074 if (nba >= lastCEI->highIndex && (!allowMidclusterMatch || nba < maxLimit)) {
4082 printf("minLimit, maxLimit, mLimit = %d, %d, %d\n", minLimit, maxLimit, mLimit);
4089 if (mLimit > maxLimit) {
4209 int32_t maxLimit;
4310 mLimit = maxLimit = nextCEI->lowIndex;
4324 if (strsrch->search->text != NULL && strsrch->search->textLength > maxLimit) {
4328 maxLimit >= lastCEI->highIndex && nextCEI->highIndex > maxLimit &&
4329 (strsrch->nfd->hasBoundaryBefore(codePointAt(*strsrch->search, maxLimit)) ||
4330 strsrch->nfd->hasBoundaryAfter(codePointBefore(*strsrch->search, maxLimit)));
4342 if (minLimit < maxLimit) {
4344 // Note that we can have nba < maxLimit && nba >= minLImit, in which
4347 if (nba >= lastCEI->highIndex && (!allowMidclusterMatch || nba < maxLimit)) {
4355 if (mLimit > maxLimit) {
4371 mLimit = maxLimit = (nba > 0) && (startIdx > nba) ? nba : startIdx;
4376 printf("minLimit, maxLimit, mLimit = %d, %d, %d\n", minLimit, maxLimit, mLimit);
