| /third_party/re2/re2/testing/ |
| D | backtrack.cc | 59 bool anchored, bool longest,
104 bool anchored, bool longest, in Search() argument
115 longest_ = longest | prog_->anchor_end(); in Search()
270 bool longest = kind != kFirstMatch; in UnsafeSearchBacktrack() local
271 if (!b.Search(text, context, anchored, longest, match, nmatch)) in UnsafeSearchBacktrack()
|
| D | exhaustive_tester.cc | 105 RE2::Options longest; in HandleRegexp() local
106 longest.set_longest_match(true); in HandleRegexp()
107 RE2 relongest(regexp, longest); in HandleRegexp()
|
| /third_party/ffmpeg/libavfilter/ |
| D | vf_palettegen.c | 327 int i, rr, gr, br, longest; in get_palette_frame() local
348 longest = 1; // pick green by default (the color the eye is the most sensitive to) in get_palette_frame()
349 if (br >= rr && br >= gr) longest = 2; in get_palette_frame()
350 if (rr >= gr && rr >= br) longest = 0; in get_palette_frame()
351 if (gr >= rr && gr >= br) longest = 1; // prefer green again in get_palette_frame()
355 rr, gr, br, "rgb"[longest], box->sorted_by == longest ? 'y':'n'); in get_palette_frame()
358 if (box->sorted_by != longest) { in get_palette_frame()
359 cmp_func cmpf = cmp_funcs[longest]; in get_palette_frame()
361 box->sorted_by = longest; in get_palette_frame()
|
| /third_party/re2/re2/ |
| D | bitstate.cc | 46 bool anchored, bool longest,
286 bool anchored, bool longest, in Search() argument
298 longest_ = longest || prog_->anchor_end(); in Search()
375 bool longest = kind != kFirstMatch; in SearchBitState() local
376 if (!b.Search(text, context, anchored, longest, match, nmatch)) in SearchBitState()
|
| D | nfa.cc | 63 bool anchored, bool longest,
450 bool anchored, bool longest, in Search() argument
471 longest = true; in Search()
482 longest_ = longest; in Search()
501 std::string(text).c_str(), std::string(context).c_str(), anchored, longest); in Search()
|
| /third_party/selinux/libselinux/src/ |
| D | matchpathcon.c | 272 int h, used, nel, len, longest; in matchpathcon_filespec_eval() local
278 longest = 0; in matchpathcon_filespec_eval()
287 if (len > longest) in matchpathcon_filespec_eval()
288 longest = len; in matchpathcon_filespec_eval()
294 __FUNCTION__, nel, used, HASH_BUCKETS, longest); in matchpathcon_filespec_eval()
|
| D | selinux_restorecon.c | 501 int h, used, nel, len, longest; in filespec_eval() local
507 longest = 0; in filespec_eval()
515 if (len > longest) in filespec_eval()
516 longest = len; in filespec_eval()
522 nel, used, HASH_BUCKETS, longest); in filespec_eval()
|
| /third_party/boost/libs/regex/doc/ |
| D | leftmost_longest.qbk | 17 # Find the longest of the possible matches, along with any ties.
24 # Find the match which has the longest match for the first sub-expression,
|
| /third_party/lz4/lib/ |
| D | lz4hc.c | 240 int longest, in LZ4HC_InsertAndGetWiderMatch() argument
283 assert(longest >= 1); in LZ4HC_InsertAndGetWiderMatch()
284 … if (LZ4_read16(iLowLimit + longest - 1) == LZ4_read16(matchPtr - lookBackLength + longest - 1)) { in LZ4HC_InsertAndGetWiderMatch()
289 if (matchLength > longest) { in LZ4HC_InsertAndGetWiderMatch()
290 longest = matchLength; in LZ4HC_InsertAndGetWiderMatch()
306 if (matchLength > longest) { in LZ4HC_InsertAndGetWiderMatch()
307 longest = matchLength; in LZ4HC_InsertAndGetWiderMatch()
312 if (chainSwap && matchLength==longest) { /* better match => select a better chain */ in LZ4HC_InsertAndGetWiderMatch()
314 if (matchIndex + (U32)longest <= ipIndex) { in LZ4HC_InsertAndGetWiderMatch()
317 int const end = longest - MINMATCH + 1; in LZ4HC_InsertAndGetWiderMatch()
[all …]
|
| /third_party/boost/libs/beast/test/extern/zlib-1.2.11/doc/ |
| D | algorithm.txt | 25 the longest match is selected.
34 parameter of deflateInit). So deflate() does not always find the longest
68 input less than the length of longest code. It gets that many bits from the
77 be a first level table to cover all the way to the longest code. However,
118 longest symbol is? The reason is that if you do that, you end up spending
161 Table X is two bits long since the longest code starting with 110 is five bits
169 Table Y is three bits long since the longest code starting with 111 is six
|
| /third_party/zlib/doc/ |
| D | algorithm.txt | 25 the longest match is selected.
34 parameter of deflateInit). So deflate() does not always find the longest
68 input less than the length of longest code. It gets that many bits from the
77 be a first level table to cover all the way to the longest code. However,
118 longest symbol is? The reason is that if you do that, you end up spending
161 Table X is two bits long since the longest code starting with 110 is five bits
169 Table Y is three bits long since the longest code starting with 111 is six
|
| /third_party/boost/tools/boost_install/test/iostreams/zlib-1.2.11/doc/ |
| D | algorithm.txt | 25 the longest match is selected.
34 parameter of deflateInit). So deflate() does not always find the longest
68 input less than the length of longest code. It gets that many bits from the
77 be a first level table to cover all the way to the longest code. However,
118 longest symbol is? The reason is that if you do that, you end up spending
161 Table X is two bits long since the longest code starting with 110 is five bits
169 Table Y is three bits long since the longest code starting with 111 is six
|
| /third_party/ltp/testcases/realtime/func/sched_jitter/ |
| D | README | 6 fixed amount of work. It then prints out the maximum jitter seen (longest
|
| /third_party/skia/third_party/externals/icu/source/tools/tzcode/ |
| D | zdump.c | 227 static size_t longest; variable
517 longest = 0; in main()
519 if (strlen(argv[i]) > longest) in main()
520 longest = strlen(argv[i]); in main()
529 || (fakeenv[0] = malloc(longest + 4)) == NULL) { in main()
804 (void) printf("%-*s ", (int) longest, zone); in show()
|
| /third_party/icu/icu4c/source/tools/tzcode/ |
| D | zdump.c | 227 static size_t longest; variable
517 longest = 0; in main()
519 if (strlen(argv[i]) > longest) in main()
520 longest = strlen(argv[i]); in main()
529 || (fakeenv[0] = malloc(longest + 4)) == NULL) { in main()
804 (void) printf("%-*s ", (int) longest, zone); in show()
|
| /third_party/flutter/skia/third_party/externals/icu/source/tools/tzcode/ |
| D | zdump.c | 227 static size_t longest; variable
517 longest = 0; in main()
519 if (strlen(argv[i]) > longest) in main()
520 longest = strlen(argv[i]); in main()
529 || (fakeenv[0] = malloc(longest + 4)) == NULL) { in main()
804 (void) printf("%-*s ", (int) longest, zone); in show()
|
| /third_party/python/Lib/ |
| D | trace.py | 134 longest = ""
138 if len(dir) > len(longest):
139 longest = dir
141 if longest:
142 base = path[len(longest) + 1:]
|
| /third_party/boost/tools/build/doc/src/ |
| D | main-target.adoc | 27 with the longest requirements set. Returns the result of calling
|
| /third_party/boost/tools/build/src/engine/ |
| D | regexp.cpp | 222 char *longest; in regcomp() local
282 longest = NULL; in regcomp()
286 longest = OPERAND(scan); in regcomp()
289 r->regmust = longest; in regcomp()
|
| /third_party/flutter/skia/third_party/externals/sfntly/doc/ |
| D | unit_tests.md | 31 FontData tests are the longest and you may want to bypass them during
|
| /third_party/skia/third_party/externals/sfntly/doc/ |
| D | unit_tests.md | 31 FontData tests are the longest and you may want to bypass them during
|
| /third_party/glib/docs/reference/ |
| D | meson.build | 22 # Note that gtkdoc is going to use those in regex, and the longest match
|
| /third_party/tzdata/ |
| D | zdump.c | 90 static int longest; variable
516 longest = 0; in main()
519 if (longest < arglen) in main()
520 longest = arglen < INT_MAX ? arglen : INT_MAX; in main()
762 printf("%-*s ", longest, zone); in show()
|
| /third_party/glib/glib/ |
| D | gdate.c | 940 update_month_match (gsize *longest, in update_month_match() argument
950 if (*longest >= length) in update_month_match()
956 *longest = length; in update_month_match()
1007 gsize longest = 0; in g_date_fill_parse_tokens() local
1026 if (update_month_match (&longest, normalized, long_month_names[i])) in g_date_fill_parse_tokens()
1034 if (update_month_match (&longest, normalized, long_month_names_alternative[i])) in g_date_fill_parse_tokens()
1041 if (update_month_match (&longest, normalized, short_month_names[i])) in g_date_fill_parse_tokens()
1044 if (update_month_match (&longest, normalized, short_month_names_alternative[i])) in g_date_fill_parse_tokens()
|
| /third_party/boost/libs/regex/performance/doc/ |
| D | performance_tables.qbk | 24 …t_searches_platform_linux_compiler_GNU_C_version_6_3_0_ Testing leftmost-longest searches (platfor…
53 …hes_platform_linux_compiler_GNU_C_version_6_3_0_ Testing simple leftmost-longest matches (platform…
92 …m_Windows_x64_compiler_Microsoft_Visual_C_version_14_1_ Testing leftmost-longest searches (platfor…
122 …ws_x64_compiler_Microsoft_Visual_C_version_14_1_ Testing simple leftmost-longest matches (platform…
150 [section:section_id4148872883 Testing leftmost-longest searches (platform = linux, compiler = GNU C…
162 [section:section_id1378460593 Testing simple leftmost-longest matches (platform = linux, compiler =…
174 [section:section_id3258595385 Testing leftmost-longest searches (platform = Windows x64, compiler =…
187 [section:section_id3141719723 Testing simple leftmost-longest matches (platform = Windows x64, comp…
|