Lines Matching refs:min
95 tre_new_item(tre_mem_t mem, int min, int max, int *i, int *max_i,
116 array[*i] = tre_ast_new_literal(mem, min, max, -1);
130 int j, min = -1, max = 0;
142 if (min < 0)
143 min = c;
146 else if (min >= 0)
148 DPRINT((" range %c (%d) to %c (%d)\n", min, min, max, max));
149 status = tre_new_item(mem, min, max, i, max_i, items);
150 min = -1;
153 if (min >= 0 && status == REG_OK)
154 status = tre_new_item(mem, min, max, i, max_i, items);
277 tre_cint_t min = 0, max = 0;
284 min = *re;
289 if (min > max)
346 min = 0;
356 min = max = *re++;
369 status = tre_new_item(ctx->mem, min, max, &i, &max_i, items);
382 while (min <= max)
384 if (tre_islower(min))
386 cmin = ccurr = tre_toupper(min++);
387 while (tre_islower(min) && tre_toupper(min) == ccurr + 1
388 && min <= max)
389 ccurr = tre_toupper(min++);
393 else if (tre_isupper(min))
395 cmin = ccurr = tre_tolower(min++);
396 while (tre_isupper(min) && tre_tolower(min) == ccurr + 1
397 && min <= max)
398 ccurr = tre_tolower(min++);
402 else min++;
454 int min, max;
456 min = l->code_min;
464 if (min < curr_max)
474 curr_max = min - 1;
601 int min, max, i;
615 min = -1;
617 DPRINT(("tre_parse: min count: '%.*" STRF "'\n", REST(r)));
618 min = tre_parse_int(&r, ctx->re_end);
622 max = min;
631 if ((max >= 0 && min > max) || max > RE_DUP_MAX)
830 if (min == 0 && max == 0)
838 if (min < 0 && max < 0)
840 min = max = 1;
842 *result = tre_ast_new_iter(ctx->mem, *result, min, max, minimal);
903 DPRINT(("tre_parse_bound: min %d, max %d, costs [%d,%d,%d, total %d], "
905 min, max, cost_ins, cost_del, cost_subst, cost_max,