| /external/brotli/c/enc/ |
| D | entropy_encode.c | 164 size_t repetitions, in BrotliWriteHuffmanTreeRepetitions() argument
168 assert(repetitions > 0); in BrotliWriteHuffmanTreeRepetitions()
173 --repetitions; in BrotliWriteHuffmanTreeRepetitions()
175 if (repetitions == 7) { in BrotliWriteHuffmanTreeRepetitions()
179 --repetitions; in BrotliWriteHuffmanTreeRepetitions()
181 if (repetitions < 3) { in BrotliWriteHuffmanTreeRepetitions()
183 for (i = 0; i < repetitions; ++i) { in BrotliWriteHuffmanTreeRepetitions()
190 repetitions -= 3; in BrotliWriteHuffmanTreeRepetitions()
193 extra_bits_data[*tree_size] = repetitions & 0x3; in BrotliWriteHuffmanTreeRepetitions()
195 repetitions >>= 2; in BrotliWriteHuffmanTreeRepetitions()
[all …]
|
| /external/webp/src/utils/ |
| D | huffman_encode_utils.c | 261 static HuffmanTreeToken* CodeRepeatedValues(int repetitions, in CodeRepeatedValues() argument
269 --repetitions; in CodeRepeatedValues()
271 while (repetitions >= 1) { in CodeRepeatedValues()
272 if (repetitions < 3) { in CodeRepeatedValues()
274 for (i = 0; i < repetitions; ++i) { in CodeRepeatedValues()
280 } else if (repetitions < 7) { in CodeRepeatedValues()
282 tokens->extra_bits = repetitions - 3; in CodeRepeatedValues()
289 repetitions -= 6; in CodeRepeatedValues()
295 static HuffmanTreeToken* CodeRepeatedZeros(int repetitions, in CodeRepeatedZeros() argument
297 while (repetitions >= 1) { in CodeRepeatedZeros()
[all …]
|
| /external/gemmlowp/meta/ |
| D | test_transform_benchmark.cc | 49 void run_benchmark(const std::string& name, int repetitions, int elements, in run_benchmark() argument
62 for (int i = 0; i < repetitions; ++i) { in run_benchmark()
67 double ops = static_cast<double>(elements) * repetitions; in run_benchmark()
68 std::cout << "Avg: " << (wall_time / repetitions) << std::endl; in run_benchmark()
82 for (int i = 0; i < repetitions; ++i) { in run_benchmark()
87 ops = static_cast<double>(elements) * repetitions; in run_benchmark()
88 std::cout << "Avg: " << (wall_time / repetitions) << std::endl; in run_benchmark()
94 const int repetitions = 500; in main() local
120 run_benchmark("Requantize", repetitions, elements, &context, in main()
134 run_benchmark("Dequantize", repetitions, elements, &context, in main()
[all …]
|
| /external/icu/icu4c/source/test/iotest/ |
| D | filetst.c | 447 int32_t repetitions; in TestfgetsBuffers() local
465 for (repetitions = 0; repetitions < 16; repetitions++) { in TestfgetsBuffers()
484 if (readSize != expectedSize*repetitions) { in TestfgetsBuffers()
485 …_err("Buffer is the wrong size. Got %d Expected %d\n", u_strlen(buffer), expectedSize*repetitions); in TestfgetsBuffers()
487 if (buffer[(expectedSize*repetitions) + 1] != 0xBEEF) { in TestfgetsBuffers()
507 for (repetitions = 0; repetitions < 16; repetitions++) { in TestfgetsBuffers()
529 if (readSize != expectedSize*repetitions) { in TestfgetsBuffers()
530 …_err("Buffer is the wrong size. Got %d Expected %d\n", u_strlen(buffer), expectedSize*repetitions); in TestfgetsBuffers()
532 if (buffer[(expectedSize*repetitions) + 1] != 0xBEEF) { in TestfgetsBuffers()
549 for (repetitions = 0; repetitions < 1; repetitions++) { in TestfgetsBuffers()
[all …]
|
| /external/v8/src/js/ |
| D | harmony-string-padding.js | 34 var repetitions = (fillLength / fillString.length) | 0;
35 var remainingChars = (fillLength - fillString.length * repetitions) | 0;
39 if (repetitions & 1) filler += fillString;
40 repetitions >>= 1;
41 if (repetitions === 0) break;
|
| /external/gemmlowp/test/ |
| D | benchmark_meta_gemm.cc | 69 std::int32_t repetitions; member
74 : n(n), m(m), k(k), repetitions(1), current_set(0), working_sets() {} in Shape()
86 repetitions = MIN_OPS / ops + 20; in init()
159 void time_all(std::vector<Shape>* shapes, std::int32_t repetitions, in time_all() argument
168 for (int i = 0; i < repetitions; ++i) { in time_all()
172 times.push_back(delta_time / repetitions); in time_all()
190 for (int i = 0; i < shape->repetitions; ++i) { in time_one()
196 times.push_back(delta_time / shape->repetitions); in time_one()
|
| D | correctness_meta_gemm.cc | 282 for (int repetitions = 0; repetitions < max_repetitions; ++repetitions) { in main() local
283 int t = std::min(repetitions + 1, 4); in main()
|
| /external/autotest/server/site_tests/enterprise_CFM_MimoSanity/ |
| D | control.hangout_app | 31 repetitions = int(args_dict.get('repetitions', 3))
34 repetitions=repetitions, is_meeting=False, tag='hangout_app')
|
| D | control.meet_app | 31 repetitions = int(args_dict.get('repetitions', 3))
34 repetitions=repetitions, is_meeting=True, tag='meet_app')
|
| D | enterprise_CFM_MimoSanity.py | 146 def run_once(self, repetitions, is_meeting): argument
166 for i in xrange(1, repetitions + 1):
167 logging.info('Running test cycle %d/%d', i, repetitions)
|
| /external/ImageMagick/PerlMagick/demo/ |
| D | lsys.pl | 66 my ($string, $repetitions, $filename, %rule) = @_;
71 for (1..$repetitions)
|
| /external/walt/android/WALT/app/src/main/java/org/chromium/latency/walt/ |
| D | MidiTest.java | 77 void setInputRepetitions(int repetitions) { in setInputRepetitions() argument
78 inputRepetitions = repetitions; in setInputRepetitions()
81 void setOutputRepetitions(int repetitions) { in setOutputRepetitions() argument
82 outputRepetitions = repetitions; in setOutputRepetitions()
|
| /external/google-benchmark/src/ |
| D | benchmark_api_internal.h | 30 int repetitions; member
|
| D | benchmark.cc | 297 b.repetitions != 0 ? b.repetitions : FLAGS_benchmark_repetitions; in RunBenchmark()
487 has_repetitions |= benchmark.repetitions > 1; in RunBenchmarks()
|
| D | benchmark_register.cc | 156 instance.repetitions = family->repetitions_; in FindBenchmarks()
|
| /external/libcxx/utils/google-benchmark/src/ |
| D | benchmark_api_internal.h | 30 int repetitions; member
|
| D | benchmark.cc | 297 b.repetitions != 0 ? b.repetitions : FLAGS_benchmark_repetitions; in RunBenchmark()
487 has_repetitions |= benchmark.repetitions > 1; in RunBenchmarks()
|
| /external/python/cpython2/Lib/test/ |
| D | test_mailbox.py | 123 def test_discard(self, repetitions=10): argument
229 def _check_iteration(self, method, do_keys, do_values, repetitions=10): argument
233 for i in xrange(repetitions):
252 self.assertLess(int(value.get_payload()), repetitions)
283 def test_len(self, repetitions=10): argument
286 for i in xrange(repetitions):
290 for i in xrange(repetitions):
291 self.assertEqual(len(self._box), repetitions - i)
293 self.assertEqual(len(self._box), repetitions - i - 1)
648 def test_create_tmp(self, repetitions=10): argument
[all …]
|
| /external/python/cpython3/Lib/test/ |
| D | test_mailbox.py | 213 def test_discard(self, repetitions=10): argument
327 def _check_iteration(self, method, do_keys, do_values, repetitions=10): argument
331 for i in range(repetitions):
350 self.assertLess(int(value.get_payload()), repetitions)
373 def test_len(self, repetitions=10): argument
376 for i in range(repetitions):
380 for i in range(repetitions):
381 self.assertEqual(len(self._box), repetitions - i)
383 self.assertEqual(len(self._box), repetitions - i - 1)
740 def test_create_tmp(self, repetitions=10): argument
[all …]
|
| /external/python/cpython2/Doc/reference/ |
| D | introduction.rst | 111 repetitions of the preceding item; likewise, a plus (``+``) means one or more
112 repetitions, and a phrase enclosed in square brackets (``[ ]``) means zero or
|
| /external/python/cpython3/Doc/reference/ |
| D | introduction.rst | 108 repetitions of the preceding item; likewise, a plus (``+``) means one or more
109 repetitions, and a phrase enclosed in square brackets (``[ ]``) means zero or
|
| /external/python/cpython2/Doc/library/ |
| D | re.rst | 101 Causes the resulting RE to match 0 or more repetitions of the preceding RE, as
102 many repetitions as are possible. ``ab*`` will match 'a', 'ab', or 'a' followed
106 Causes the resulting RE to match 1 or more repetitions of the preceding RE.
111 Causes the resulting RE to match 0 or 1 repetitions of the preceding RE.
129 Causes the resulting RE to match from *m* to *n* repetitions of the preceding
130 RE, attempting to match as many repetitions as possible. For example,
138 Causes the resulting RE to match from *m* to *n* repetitions of the preceding
139 RE, attempting to match as *few* repetitions as possible. This is the
|
| D | timeit.rst | 51 repetitions only when the command-line interface is used. In the
226 for this; the default of 3 repetitions is probably enough in most cases. On
|
| /external/python/cpython3/Doc/library/ |
| D | timeit.rst | 49 repetitions only when the command-line interface is used. In the
258 option is good for this; the default of 3 repetitions is probably enough in
|
| D | re.rst | 116 Causes the resulting RE to match 0 or more repetitions of the preceding RE, as
117 many repetitions as are possible. ``ab*`` will match 'a', 'ab', or 'a' followed
121 Causes the resulting RE to match 1 or more repetitions of the preceding RE.
126 Causes the resulting RE to match 0 or 1 repetitions of the preceding RE.
144 Causes the resulting RE to match from *m* to *n* repetitions of the preceding
145 RE, attempting to match as many repetitions as possible. For example,
153 Causes the resulting RE to match from *m* to *n* repetitions of the preceding
154 RE, attempting to match as *few* repetitions as possible. This is the
|