| /external/llvm-project/lld/test/ELF/linkerscript/ |
| D | common-filespec.test | 68 # assigned to the section from the file which provided the winning def
|
| /external/cldr/tools/java/org/unicode/cldr/util/ |
| D | CLDRFile.java | 679 private String getFallbackPath(String xpath, boolean winning, boolean checkExtraPaths) { in getFallbackPath() argument
681 return getCountPathWithFallback(xpath, Count.other, winning); in getFallbackPath()
3577 public String getCountPathWithFallback(String xpath, Count count, boolean winning) {
3605 result = getCountPathWithFallback2(parts, xpath, itemCount, winning);
3614 result = getCountPathWithFallback2(parts, xpath, count, winning);
3620 result = getCountPathWithFallback2(parts, xpath, Count.other, winning);
3627 result = getCountPathWithFallback2(parts, xpath, null, winning);
3650 Count count, boolean winning) {
3654 if (winning) {
|
| D | VettingViewer.java | 1355 String winning = englishFile.getWinningValue(path); in writeTables() local
1356 … String cellValue = winning == null ? "<i>missing</i>" : TransliteratorUtilities.toHTML in writeTables()
1357 .transform(winning); in writeTables()
|
| /external/python/cpython2/Objects/ |
| D | listsort.txt | 427 row the winning merge element comes from the same run. We'll only discuss
474 the time, at B[1] a quarter of the time, and so on: a consecutive winning
476 winning sub-runs are extremely unlikely in random data, and guessing that a
477 winning sub-run is going to be long is a dangerous game.
480 stretches of winning sub-runs are very likely, and cutting the number of
483 Galloping compromises by getting out fast if there isn't a long winning
|
| /external/python/cpython3/Objects/ |
| D | listsort.txt | 427 row the winning merge element comes from the same run. We'll only discuss
474 the time, at B[1] a quarter of the time, and so on: a consecutive winning
476 winning sub-runs are extremely unlikely in random data, and guessing that a
477 winning sub-run is going to be long is a dangerous game.
480 stretches of winning sub-runs are very likely, and cutting the number of
483 Galloping compromises by getting out fast if there isn't a long winning
|
| /external/llvm-project/lld/test/MachO/ |
| D | common-symbol-resolution.s | 21 ## file will always be non-weak, even if the winning input symbol definition was
|
| /external/skqp/src/compute/skc/platforms/cl_12/kernels/ |
| D | rasterize.cl | 1263 // invalidate the winning block
1267 // update bin with winning yx, new ttsb id and zero count
1356 // update bin with winning yx, new ttsb id and zero count
|
| /external/python/cpython3/Lib/test/ |
| D | cfgparser.2 | 207 # startup and gives it a slightly higher chance of winning the election
|
| /external/brotli/c/common/ |
| D | dictionary.bin | 244 …k"may includethe world'scan lead torefers to aborder="0" government winning theresulted in wh…
|
| /external/swiftshader/third_party/subzero/ |
| D | DESIGN.rst | 1230 desired version of each method "winning". Then the binary is tested, and
|
| /external/swiftshader/third_party/subzero/docs/ |
| D | DESIGN.rst | 1230 desired version of each method "winning". Then the binary is tested, and
|
| /external/clang/docs/ |
| D | AutomaticReferenceCounting.rst | 1783 disable them, with the last such argument "winning".
|
| /external/one-true-awk/testdir/ |
| D | funstack.ok | 895 winning Shannon Switching Games . . . . 253--256
|
| D | funstack.in | 6245 title = "An implemented graph algorithm for winning {Shannon Switching Games}",
6258 …ce; computer; game playing; graph algorithm; programme; Shannon Switching Games; winning strategy",
|
| /external/llvm-project/clang/docs/ |
| D | AutomaticReferenceCounting.rst | 2136 disable them, with the last such argument "winning".
|
| /external/brotli/tests/testdata/ |
| D | plrabn12.txt | 1346 His rivals, winning cheap the high repute
3165 Less winning soft, less amiably mild,
6244 A pomp of winning Graces waited still,
|
| D | lcet10.txt | 4265 twenty man-years of work in programming and polishing, was not winning,
|
| /external/libtextclassifier/native/annotator/pod_ner/test_data/ |
| D | vocab.txt | 3046 winning
|
| /external/kotlinx.coroutines/benchmarks/src/jmh/resources/ |
| D | words.shakespeare.txt.gz | 1a
2A
3Aaron
4AARON
5abaissiez
6abandon
7abandoned
8abase
9Abase
10 ... |
| D | ospd.txt.gz | |
| /external/jline/src/src/test/resources/jline/example/ |
| D | english.gz | |
| /external/rust/crates/libz-sys/src/zlib-ng/test/data/ |
| D | lcet10.txt | 4265 twenty man-years of work in programming and polishing, was not winning,
|
| /external/pcre/dist2/doc/ |
| D | pcre2.txt | 705 the rest kept waiting. The winning thread will compile the pattern and
|
| /external/strace/ |
| D | ChangeLog | 14656 to increase chances of winning the race.
|
| /external/cldr/tools/java/org/unicode/cldr/util/data/transforms/ |
| D | internal_raw_IPA-old.txt | 213895 winning %36675 wˈɪnɪŋ
|