| /external/libgdx/gdx/src/com/badlogic/gdx/math/ |
| D | Bresenham2.java | 80 int longest = Math.abs(w); in line() local
82 if (longest <= shortest) { in line()
83 longest = Math.abs(h); in line()
90 int numerator = longest >> 1; in line()
91 for (int i = 0; i <= longest; i++) { in line()
96 if (numerator > longest) { in line()
97 numerator -= longest; in line()
|
| /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/mesa3d/src/mesa/main/ |
| D | shader_query.cpp | 220 size_t longest = 0; in _mesa_longest_attribute_name_length() local
231 if (len >= longest) in _mesa_longest_attribute_name_length()
232 longest = len + 1; in _mesa_longest_attribute_name_length()
235 return longest; in _mesa_longest_attribute_name_length()
|
| /external/selinux/libselinux/src/ |
| D | matchpathcon.c | 238 int h, used, nel, len, longest; in matchpathcon_filespec_eval() local
244 longest = 0; in matchpathcon_filespec_eval()
253 if (len > longest) in matchpathcon_filespec_eval()
254 longest = len; in matchpathcon_filespec_eval()
260 __FUNCTION__, nel, used, HASH_BUCKETS, longest); in matchpathcon_filespec_eval()
|
| /external/lz4/lib/ |
| D | lz4hc.c | 211 int longest, in LZ4HC_InsertAndGetWiderMatch() argument
238 if (*(iLowLimit + longest) == *(match - delta + longest)) in LZ4HC_InsertAndGetWiderMatch()
247 if ((matchEnd-startt) > longest) in LZ4HC_InsertAndGetWiderMatch()
249 longest = (int)(matchEnd-startt); in LZ4HC_InsertAndGetWiderMatch()
269 …if ((int)mlt > longest) { longest = (int)mlt; *matchpos = base + matchIndex + back; *startpos = ip… in LZ4HC_InsertAndGetWiderMatch()
275 return longest; in LZ4HC_InsertAndGetWiderMatch()
|
| /external/selinux/policycoreutils/setfiles/ |
| D | restore.c | 502 int h, used, nel, len, longest; in filespec_eval() local
508 longest = 0; in filespec_eval()
517 if (len > longest) in filespec_eval()
518 longest = len; in filespec_eval()
525 __FUNCTION__, nel, used, HASH_BUCKETS, longest); in filespec_eval()
|
| /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
|
| D | rfc1951.txt | 808 sequence starting at the current point, and selects the longest
|
| /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/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/autotest/server/site_tests/network_WiFi_SimpleConnect/ |
| D | control.wifi_checkSSIDLimits | 17 longest and shortest possible SSIDs.
|
| /external/toybox/kconfig/ |
| D | README | 11 in what I _had_ done, and the third thread was the longest of the lot but
|
| /external/skia/src/pathops/ |
| D | SkOpAngle.cpp | 376 double longest = 0; in distEndRatio() local
388 longest = SkTMax(longest, lenSq); in distEndRatio()
391 return sqrt(longest) / dist; in distEndRatio()
|
| /external/skia/tests/ |
| D | PathOpsAngleIdeas.cpp | 123 double longest = SkTMax(v[0].length(), SkTMax(v[1].length(), v[2].length())); in distEndRatio() local
124 return longest / dist; in distEndRatio()
|
| /external/selinux/secilc/docs/ |
| D | cil_file_labeling_statements.md | 223 ; proc labeling can be further refined (longest matching prefix).
|
| /external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/data/ |
| D | collationtest.txt | 2080 # if we fell back directly from longest-prefix mappings to no-prefix mappings.
2096 # The mapping is used which has the longest matching prefix for which
2097 # there is also a suffix match, with the longest suffix match among several for that prefix.
|
| /external/icu/icu4c/source/test/testdata/ |
| D | collationtest.txt | 2080 # if we fell back directly from longest-prefix mappings to no-prefix mappings.
2096 # The mapping is used which has the longest matching prefix for which
2097 # there is also a suffix match, with the longest suffix match among several for that prefix.
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/data/ |
| D | collationtest.txt | 2080 # if we fell back directly from longest-prefix mappings to no-prefix mappings.
2096 # The mapping is used which has the longest matching prefix for which
2097 # there is also a suffix match, with the longest suffix match among several for that prefix.
|
| /external/pcre/dist/doc/ |
| D | pcretest.txt | 889 The longest matching string is always given first (and numbered zero).
897 at the end of the longest match. For example:
|
| /external/iproute2/doc/ |
| D | ip-cref.tex | 1125 \item The longest matching prefix is selected. All shorter ones
1128 \item If the TOS of some route with the longest prefix is equal to the TOS
1268 the longest match is understood as: First, compare the TOS
2003 according to the longest match rule, is replaced with a ``routing policy
2037 a route from these tables according to the classic longest match algorithm.
|
| /external/pcre/dist/ |
| D | HACKING | 23 the one matching the longest subset of the subject string was chosen. This did
|