| /external/regex-re2/re2/testing/ |
| D | backtrack.cc | 54 bool anchored, bool longest,
95 bool anchored, bool longest, in Search() argument
106 longest_ = longest | prog_->anchor_end(); in Search()
246 bool longest = kind != kFirstMatch; in UnsafeSearchBacktrack() local
247 if (!b.Search(text, context, anchored, longest, match, nmatch)) in UnsafeSearchBacktrack()
|
| D | exhaustive_tester.cc | 103 RE2::Options longest; in HandleRegexp() local
104 longest.set_longest_match(true); in HandleRegexp()
105 RE2 relongest(regexp, longest); in HandleRegexp()
|
| /external/regex-re2/re2/ |
| D | bitstate.cc | 39 bool anchored, bool longest,
294 bool anchored, bool longest, in Search() argument
306 longest_ = longest || prog_->anchor_end(); in Search()
370 bool longest = kind != kFirstMatch; in SearchBitState() local
371 if (!b.Search(text, context, anchored, longest, match, nmatch)) in SearchBitState()
|
| D | nfa.cc | 51 bool anchored, bool longest,
401 bool anchored, bool longest, in Search() argument
425 longest = true; in Search()
437 longest_ = longest; in Search()
456 longest); in Search()
|
| /external/autotest/server/site_tests/sequences/ |
| D | control.benchmarks | 15 speed up the completion time as the longest test is 1:00.
20 Note: In this case it is important to list the tests with the longest runtime
24 work on quicker tests while the longest running tests are running.
|
| /external/selinux/libselinux/src/ |
| D | matchpathcon.c | 266 int h, used, nel, len, longest; in matchpathcon_filespec_eval() local
272 longest = 0; in matchpathcon_filespec_eval()
281 if (len > longest) in matchpathcon_filespec_eval()
282 longest = len; in matchpathcon_filespec_eval()
288 __FUNCTION__, nel, used, HASH_BUCKETS, longest); in matchpathcon_filespec_eval()
|
| D | selinux_restorecon.c | 488 int h, used, nel, len, longest; in filespec_eval() local
494 longest = 0; in filespec_eval()
502 if (len > longest) in filespec_eval()
503 longest = len; in filespec_eval()
509 nel, used, HASH_BUCKETS, longest); in filespec_eval()
|
| /external/lz4/lib/ |
| D | lz4hc.c | 185 int longest, in LZ4HC_InsertAndGetWiderMatch() argument
210 if (*(iLowLimit + longest) == *(matchPtr - delta + longest)) { in LZ4HC_InsertAndGetWiderMatch()
222 if (mlt > longest) { in LZ4HC_InsertAndGetWiderMatch()
223 longest = (int)mlt; in LZ4HC_InsertAndGetWiderMatch()
241 …if ((int)mlt > longest) { longest = (int)mlt; *matchpos = base + matchIndex + back; *startpos = ip… in LZ4HC_InsertAndGetWiderMatch()
247 return longest; in LZ4HC_InsertAndGetWiderMatch()
|
| /external/syslinux/com32/lib/zlib/ |
| 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
|
| /external/zlib/src/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
|
| /external/python/cpython2/Modules/zlib/ |
| 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
|
| /external/zopfli/src/zopfli/ |
| D | blocksplitter.c | 202 size_t longest = 0; in FindLargestSplittableBlock() local
208 if (!done[start] && end - start > longest) { in FindLargestSplittableBlock()
212 longest = end - start; in FindLargestSplittableBlock()
|
| /external/python/cpython2/Lib/ |
| D | trace.py | 202 longest = ""
206 if len(dir) > len(longest):
207 longest = dir
209 if longest:
210 base = path[len(longest) + 1:]
|
| /external/icu/icu4c/source/tools/tzcode/ |
| D | zdump.c | 226 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()
|
| /external/ltp/testcases/realtime/func/sched_jitter/ |
| D | README | 6 fixed amount of work. It then prints out the maximum jitter seen (longest
|
| /external/autotest/server/site_tests/network_WiFi_SimpleConnect/ |
| D | control.wifi_checkSSIDLimits | 17 longest and shortest possible SSIDs.
|
| /external/python/cpython2/ |
| D | setup.py | 269 longest = 0
271 longest = max([len(e.name) for e in self.extensions])
273 longest = max(longest, max([len(name) for name in self.failed]))
281 print "%-*s %-*s %-*s" % (longest, e, longest, f,
282 longest, g)
|
| /external/toybox/kconfig/ |
| D | README | 11 in what I _had_ done, and the third thread was the longest of the lot but
|
| /external/mesa3d/src/mesa/main/ |
| D | shader_query.cpp | 221 size_t longest = 0; in _mesa_longest_attribute_name_length() local
227 if (length >= longest) in _mesa_longest_attribute_name_length()
228 longest = length + 1; in _mesa_longest_attribute_name_length()
232 return longest; in _mesa_longest_attribute_name_length()
|
| /external/skia/src/pathops/ |
| D | SkOpAngle.cpp | 408 double longest = 0; in distEndRatio() local
420 longest = SkTMax(longest, lenSq); in distEndRatio()
423 return sqrt(longest) / dist; in distEndRatio()
|
| /external/lisa/ipynb/examples/utils/ |
| D | executor_example.ipynb | 287 … "2016-12-07 10:18:02,274 INFO : Workload : Workload duration defined by longest task\n",
314 … "2016-12-07 10:18:18,326 INFO : Workload : Workload duration defined by longest task\n",
|
| /external/lisa/ipynb/examples/devlib/ |
| D | cgroups_example.ipynb | 106 … "2016-12-08 11:42:44,329 INFO : Workload : Workload duration defined by longest task\n",
119 … "2016-12-08 11:42:46,183 INFO : Workload : Workload duration defined by longest task\n",
132 … "2016-12-08 11:42:48,085 INFO : Workload : Workload duration defined by longest task\n",
145 … "2016-12-08 11:42:49,969 INFO : Workload : Workload duration defined by longest task\n",
437 … "2016-12-08 11:43:10,337 INFO : Workload : Workload duration defined by longest task\n",
|
| /external/python/cpython2/Doc/library/ |
| D | email.generator.rst | 44 Optional *maxheaderlen* specifies the longest length for a non-continued header.
|
| /external/skia/tests/ |
| D | PathOpsAngleIdeas.cpp | 125 double longest = SkTMax(v[0].length(), SkTMax(v[1].length(), v[2].length())); in distEndRatio() local
126 return longest / dist; in distEndRatio()
|
| /external/lisa/ipynb/examples/energy_meter/ |
| D | EnergyMeter_HWMON.ipynb | 190 "04:00:30 INFO : RTApp - Workload duration defined by longest task\n",
|