| /external/eigen/bench/btl/generic_bench/utils/ |
| D | size_lin_log.hh | 29 int nine=9; in size_lin_log() local
35 for (int i=0;i<nine;i++){ in size_lin_log()
42 size_log(nb_point-nine,ten,size_max,log_size); in size_lin_log()
44 for (int i=0;i<nb_point-nine;i++){ in size_lin_log()
46 X[i+nine]=log_size[i]; in size_lin_log()
|
| /external/libcxx/test/std/experimental/iterator/ostream.joiner/ostream.joiner.cons/ |
| D | ostream_joiner.cons.pass.cpp | 30 const std::string nine = "9"; in main() local
42 { exp::ostream_joiner<std::string> oj(std::cout, nine); } in main()
54 { exp::ostream_joiner<std::string, wchar_t> oj(std::wcout, nine); } in main()
|
| /external/chromium-trace/catapult/telemetry/third_party/mox3/mox3/tests/ |
| D | mox_helper.py | 114 def __init__(self, one, two, nine=None): argument
124 def MyTestFunction(one, two, nine=None): argument
132 def TestMethod(self, one, two, nine=None): argument
|
| D | test_mox.py | 2032 self.assertRaises(AttributeError, obj.TestMethod, nine=2)
2035 obj.TestMethod(1, 2, nine=3)
2322 def MethodWithArgs(self, one, two, nine=None): argument
|
| /external/zlib/src/doc/ |
| D | algorithm.txt | 84 of the first table is nine bits. Also the distance trees have 30 possible
96 lookup table for the first, let's say, nine bits of a Huffman symbol. The
98 symbol is shorter than nine bits, then that symbol's translation is duplicated
100 symbol is four bits, then it's duplicated 32 times in a nine-bit table. If a
101 symbol is nine bits long, it appears in the table once.
103 If the symbol is longer than nine bits, then that entry in the table points
112 So a table entry either points to another table (in which case nine bits in
|
| /external/syslinux/com32/lib/zlib/ |
| D | algorithm.txt | 84 of the first table is nine bits. Also the distance trees have 30 possible
96 lookup table for the first, let's say, nine bits of a Huffman symbol. The
98 symbol is shorter than nine bits, then that symbol's translation is duplicated
100 symbol is four bits, then it's duplicated 32 times in a nine-bit table. If a
101 symbol is nine bits long, it appears in the table once.
103 If the symbol is longer than nine bits, then that entry in the table points
112 So a table entry either points to another table (in which case nine bits in
|
| /external/ltp/testcases/commands/ade/ar/ |
| D | file9.in | 1 This is file nine
|
| /external/skia/gm/ |
| D | windowrectangles.cpp | 51 SkRRect nine; in onDraw() local
52 nine.setNinePatch(SkRect::MakeXYWH(550 - 30.25 - 100, 370.75, 100, 150), 12, 35, 23, 20); in onDraw()
53 stack.clipRRect(nine, SkMatrix::I(), kDifference_SkClipOp, true); in onDraw()
|
| /external/pcre/dist2/testdata/ |
| D | grepoutput | 75 29:nine
172 nine
203 29-nine
225 nine
247 nine
279 29-nine
302 nine
573 29:nine
|
| D | grepoutput8 | 6 7:X seven…8:X eight
9:X nine
10:X ten
|
| D | grepinput8 | 5 X seven…X eight
X nine
X ten
|
| D | grepinputx | 29 nine
|
| /external/llvm/unittests/ADT/ |
| D | APIntTest.cpp | 203 APInt nine(8, 9); in TEST() local
206 EXPECT_EQ(nine.srem(two), one); in TEST()
207 EXPECT_EQ(nine.srem(-two), one); in TEST()
208 EXPECT_EQ((-nine).srem(two), -one); in TEST()
209 EXPECT_EQ((-nine).srem(-two), -one); in TEST()
211 APInt::sdivrem(nine, two, q, r); in TEST()
214 APInt::sdivrem(-nine, two, q, r); in TEST()
217 APInt::sdivrem(nine, -two, q, r); in TEST()
220 APInt::sdivrem(-nine, -two, q, r); in TEST()
|
| /external/icu/icu4c/source/data/rbnf/ |
| D | en.txt | 100 "9: nine;",
179 "90: nine>%%tieth>;",
|
| /external/icu/icu4c/source/data/translit/ |
| D | Latin_InterIndic.txt | 126 $nine=\uE06F; # DIGIT NINE
380 9→$nine;
|
| D | az_Cyrl_az_BGN.txt | 15 # contains nine letters not present in the Russian alphabet:
|
| D | InterIndic_Latin.txt | 125 $nine=\uE06F; # DIGIT NINE
463 $nine → 9;
|
| D | kk_kk_Latn_BGN.txt | 14 # The Kazakh Cyrillic alphabet contains nine letters not present
|
| /external/clang/test/CodeGenObjC/ |
| D | fragile-arc.m | 123 // Weak layout: skip nine, scan three
|
| /external/unicode/ |
| D | emoji-data.txt | 27 0030..0039 ; Emoji # 1.1 [10] (0️..9️) digit zero..digit nine
437 0030..0039 ; Emoji_Component # 1.1 [10] (0️..9️) digit zero..digit nine
|
| /external/guava/guava-tests/test/com/google/common/util/concurrent/ |
| D | JSR166TestCase.java | 614 public static final Integer nine = new Integer(9); field in JSR166TestCase
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/pkb/en-GB/ |
| D | en-GB_klex.pkb | 1101 …��������������������������������������������������������������������������������� pre-nine $GI!@E5E
|
| /external/selinux/secilc/docs/ |
| D | cil_mls_labeling_statements.md | 293 This example orders one category alias and nine categories:
|
| /external/v8/tools/mb/docs/ |
| D | design_spec.md | 134 build `blink_tests`, because that might actually also build the other nine
|
| /external/iputils/doc/ |
| D | ping.sgml | 348 Note that the IP header is only large enough for nine such routes.
|