| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/utils/ |
| D | StringEscapeUtils.java | 227 private final int longest; field in StringEscapeUtils.LookupTranslator
257 longest = _longest; in LookupTranslator()
267 int max = longest; in translate()
268 if (index + longest > input.length()) { in translate()
|
| /external/lz4/lib/ |
| D | lz4hc.c | 211 int longest, in LZ4HC_InsertAndGetWiderMatch() argument
255 assert(longest >= 1); in LZ4HC_InsertAndGetWiderMatch()
256 … if (LZ4_read16(iLowLimit + longest - 1) == LZ4_read16(matchPtr - lookBackLength + longest - 1)) { in LZ4HC_InsertAndGetWiderMatch()
261 if (matchLength > longest) { in LZ4HC_InsertAndGetWiderMatch()
262 longest = matchLength; in LZ4HC_InsertAndGetWiderMatch()
278 if (matchLength > longest) { in LZ4HC_InsertAndGetWiderMatch()
279 longest = matchLength; in LZ4HC_InsertAndGetWiderMatch()
284 if (chainSwap && matchLength==longest) { /* better match => select a better chain */ in LZ4HC_InsertAndGetWiderMatch()
286 if (matchIndex + longest <= ipIndex) { in LZ4HC_InsertAndGetWiderMatch()
289 for (pos = 0; pos <= longest - MINMATCH; pos++) { in LZ4HC_InsertAndGetWiderMatch()
[all …]
|
| /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 | 498 int h, used, nel, len, longest; in filespec_eval() local
504 longest = 0; in filespec_eval()
512 if (len > longest) in filespec_eval()
513 longest = len; in filespec_eval()
519 nel, used, HASH_BUCKETS, longest); in filespec_eval()
|
| /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/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/autotest/client/cros/power/ |
| D | power_dashboard.py | 576 longest = collections.defaultdict(int)
588 longest[domain_type] = max(longest[domain_type], len(number_str))
597 formatter_component = '{:.>%ds}' % longest[domain_type]
|
| /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/python/cpython3/Lib/ |
| D | trace.py | 134 longest = ""
138 if len(dir) > len(longest):
139 longest = dir
141 if longest:
142 base = path[len(longest) + 1:]
|
| /external/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()
|
| /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 | 14 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/autotest/test_suites/ |
| D | control.deqp | 42 # A bit longer than the longest running job in the suite.
|
| /external/toybox/kconfig/ |
| D | README | 14 in what I _had_ done, and the third thread was the longest of the lot but
|
| /external/python/cpython3/ |
| D | setup.py | 315 longest = max([len(e.name) for e in self.extensions], default=0)
318 longest = max(longest, max([len(name) for name in all_failed]))
326 print("%-*s %-*s %-*s" % (longest, e, longest, f,
327 longest, g))
|
| /external/mesa3d/src/mesa/main/ |
| D | shader_query.cpp | 242 size_t longest = 0; in _mesa_longest_attribute_name_length() local
249 if (length >= longest) in _mesa_longest_attribute_name_length()
250 longest = length + 1; in _mesa_longest_attribute_name_length()
254 return longest; in _mesa_longest_attribute_name_length()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/LoadStoreVectorizer/AMDGPU/ |
| D | multiple_tails.ll | 29 ; longest chain vectorized
|
| /external/skia/src/pathops/ |
| D | SkOpAngle.cpp | 485 double longest = 0; in distEndRatio() local
497 longest = SkTMax(longest, lenSq); in distEndRatio()
500 return sqrt(longest) / dist; in distEndRatio()
|
| /external/skqp/src/pathops/ |
| D | SkOpAngle.cpp | 485 double longest = 0; in distEndRatio() local
497 longest = SkTMax(longest, lenSq); in distEndRatio()
500 return sqrt(longest) / dist; in distEndRatio()
|
| /external/tensorflow/tensorflow/core/profiler/ |
| D | profiler_service.proto | 97 // If the trace covers multiple programs, the longest-running one is analyzed.
|
| /external/apache-commons-bcel/src/changes/ |
| D | release-notes.vm | 48 ## must be at least as long as the longest JIRA id
|
| /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()
|