HomeSort by: relevance | last modified time | path
    Searched defs:minimal (Results 1 - 5 of 5) sorted by relevancy

  /src/external/bsd/atf/dist/tools/
parser_test.cpp 128 namespace minimal { namespace
213 set_md_var("descr", "Tests the tokenizer class using a minimal parser "
218 using namespace minimal;
296 set_md_var("descr", "Tests the tokenizer class using a minimal parser "
301 using namespace minimal;
305 minimal::tokenizer mt(iss, true);
  /src/external/bsd/tre/dist/lib/
tre-ast.h 89 unsigned int minimal:1; member in struct:__anon8181
108 int minimal);
tre-compile.c 157 int num_minimals = 0; /* Number of special minimal tags. */
162 int minimal_tag = -1; /* Tag that marks the beginning of a minimal match. */
289 DPRINT(("Minimal %d, %d\n", minimal_tag, tag));
363 STACK_PUSHX(stack, long, regset[0] >= 0 || iter->minimal);
368 STACK_PUSHX(stack, long, iter->minimal);
377 if (regset[0] >= 0 || iter->minimal)
383 if (iter->minimal)
389 DPRINT(("Minimal %d, %d\n", minimal_tag, tag));
461 DPRINT(("Minimal %d, %d\n", minimal_tag, tag));
504 int minimal = 0 local
    [all...]
tre-parse.c 620 int minimal = (ctx->cflags & REG_UNGREEDY) ? 1 : 0; local
828 /* Parse trailing '?' marking minimal repetition. */
833 minimal = !(ctx->cflags & REG_UNGREEDY);
856 *result = tre_ast_new_iter(ctx->mem, *result, min, max, minimal);
1127 int minimal = (ctx->cflags & REG_UNGREEDY) ? 1 : 0; local
1146 minimal = !(ctx->cflags & REG_UNGREEDY);
1158 minimal ? " minimal" : "greedy", REST(tmp_re)));
1161 minimal);
  /src/external/gpl2/diffutils/dist/src/
diff.h 198 slower) but will find a guaranteed minimal set of changes. */ variable
199 XTERN bool minimal;

Completed in 28 milliseconds