| /third_party/skia/third_party/externals/dawn/src/tests/unittests/ |
| D | PerStageTests.cpp | 45 PerStage<int> counts; in TEST() local
46 counts[SingleShaderStage::Vertex] = 0; in TEST()
47 counts[SingleShaderStage::Fragment] = 0; in TEST()
48 counts[SingleShaderStage::Compute] = 0; in TEST()
51 counts[stage]++; in TEST()
54 ASSERT_EQ(counts[wgpu::ShaderStage::Vertex], 1); in TEST()
55 ASSERT_EQ(counts[wgpu::ShaderStage::Fragment], 1); in TEST()
56 ASSERT_EQ(counts[wgpu::ShaderStage::Compute], 1); in TEST()
61 PerStage<int> counts; in TEST() local
62 counts[SingleShaderStage::Vertex] = 0; in TEST()
[all …]
|
| /third_party/flutter/skia/third_party/externals/dawn/src/tests/unittests/ |
| D | PerStageTests.cpp | 45 PerStage<int> counts; in TEST() local
46 counts[ShaderStage::Vertex] = 0; in TEST()
47 counts[ShaderStage::Fragment] = 0; in TEST()
48 counts[ShaderStage::Compute] = 0; in TEST()
51 counts[stage] ++; in TEST()
54 ASSERT_EQ(counts[dawn::ShaderStageBit::Vertex], 1); in TEST()
55 ASSERT_EQ(counts[dawn::ShaderStageBit::Fragment], 1); in TEST()
56 ASSERT_EQ(counts[dawn::ShaderStageBit::Compute], 1); in TEST()
61 PerStage<int> counts; in TEST() local
62 counts[ShaderStage::Vertex] = 0; in TEST()
[all …]
|
| /third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/duration/ |
| D | Period.java | 32 final int[] counts; field in Period
168 for (int i = 0; i < counts.length; ++i) { in isSet()
169 if (counts[i] != 0) { in isSet()
182 return counts[unit.ordinal] > 0; in isSet()
193 if (counts[ord] == 0) { in getCount()
196 return (counts[ord] - 1)/1000f; in getCount()
269 for (int i = 0; i < counts.length; ++i) { in equals()
270 if (counts[i] != rhs.counts[i]) { in equals()
286 for (int i = 0; i < counts.length; ++i) { in hashCode()
287 hc = (hc << 2) ^ counts[i]; in hashCode()
[all …]
|
| D | BasicPeriodFormatter.java | 44 return format(period.timeLimit, period.inFuture, period.counts); in format()
57 private String format(int tl, boolean inFuture, int[] counts) { in format() argument
59 for (int i = 0; i < counts.length; ++i) { in format()
60 if (counts[i] > 0) { in format()
70 for (int i = 0, m = 1; i < counts.length; ++i, m <<= 1) { in format()
71 if ((mask & m) != 0 && counts[i] == 1) { in format()
94 counts[sx] += (counts[mx]-1)/1000; in format()
103 counts[sx] = 1; in format()
105 counts[sx] += (counts[mx]-1)/1000; in format()
114 int last = counts.length - 1; in format()
[all …]
|
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/duration/ |
| D | Period.java | 34 final int[] counts; field in Period
170 for (int i = 0; i < counts.length; ++i) { in isSet()
171 if (counts[i] != 0) { in isSet()
184 return counts[unit.ordinal] > 0; in isSet()
195 if (counts[ord] == 0) { in getCount()
198 return (counts[ord] - 1)/1000f; in getCount()
271 for (int i = 0; i < counts.length; ++i) { in equals()
272 if (counts[i] != rhs.counts[i]) { in equals()
288 for (int i = 0; i < counts.length; ++i) { in hashCode()
289 hc = (hc << 2) ^ counts[i]; in hashCode()
[all …]
|
| D | BasicPeriodFormatter.java | 45 return format(period.timeLimit, period.inFuture, period.counts); in format()
58 private String format(int tl, boolean inFuture, int[] counts) { in format() argument
60 for (int i = 0; i < counts.length; ++i) { in format()
61 if (counts[i] > 0) { in format()
71 for (int i = 0, m = 1; i < counts.length; ++i, m <<= 1) { in format()
72 if ((mask & m) != 0 && counts[i] == 1) { in format()
95 counts[sx] += (counts[mx]-1)/1000; in format()
104 counts[sx] = 1; in format()
106 counts[sx] += (counts[mx]-1)/1000; in format()
115 int last = counts.length - 1; in format()
[all …]
|
| /third_party/skia/src/sksl/analysis/ |
| D | SkSLProgramUsage.cpp | 45 ProgramUsage::VariableCounts& counts = fUsage->fVariableCounts[&vd.var()]; in visitStatement() local
46 counts.fDeclared += fDelta; in visitStatement()
47 SkASSERT(counts.fDeclared >= 0); in visitStatement()
50 counts.fWrite += fDelta; in visitStatement()
63 ProgramUsage::VariableCounts& counts = fUsage->fVariableCounts[ref.variable()]; in visitExpression() local
66 counts.fRead += fDelta; in visitExpression()
69 counts.fWrite += fDelta; in visitExpression()
73 counts.fRead += fDelta; in visitExpression()
74 counts.fWrite += fDelta; in visitExpression()
77 SkASSERT(counts.fRead >= 0 && counts.fWrite >= 0); in visitExpression()
[all …]
|
| /third_party/boost/boost/polygon/detail/ |
| D | property_merge_45.hpp | 25 inline CountMerge() : counts() {} in CountMerge()
28 inline CountMerge(const CountMerge& count) : counts(count.counts) {} in CountMerge()
29 inline bool operator==(const CountMerge& count) const { return counts == count.counts; } in operator ==()
32 inline CountMerge& operator=(const CountMerge& count) { counts = count.counts; return *this; } in operator =()
34 …std::vector<std::pair<int, int> >::iterator itr = lower_bound(counts.begin(), counts.end(), std::m… in operator []()
35 if(itr != counts.end() && itr->first == index) { in operator []()
38 itr = counts.insert(itr, std::make_pair(index, int(0))); in operator []()
51 merge_property_maps(counts, count.counts, false); in operator +=()
55 merge_property_maps(counts, count.counts, true); in operator -=()
69 std::vector<std::pair<property_type, int> > counts; member in boost::polygon::polygon_45_property_merge::CountMerge
[all …]
|
| D | polygon_45_touch.hpp | 58 inline CountTouch() : counts() {} in CountTouch()
61 inline CountTouch(const CountTouch& count) : counts(count.counts) {} in CountTouch()
62 inline bool operator==(const CountTouch& count) const { return counts == count.counts; } in operator ==()
65 inline CountTouch& operator=(const CountTouch& count) { counts = count.counts; return *this; } in operator =()
68 std::lower_bound(counts.begin(), counts.end(), in operator []()
70 if(itr != counts.end() && itr->first == index) { in operator []()
73 itr = counts.insert(itr, std::make_pair(index, int(0))); in operator []()
86 merge_property_maps(counts, count.counts, false); in operator +=()
90 merge_property_maps(counts, count.counts, true); in operator -=()
104 std::vector<std::pair<int, int> > counts; member in boost::polygon::polygon_45_touch::CountTouch
[all …]
|
| /third_party/node/deps/npm/node_modules/colors/lib/custom/ |
| D | zalgo.js | 59 var counts;
76 counts = {'up': 0, 'down': 0, 'mid': 0}; variable
79 counts.up = randomNumber(8);
80 counts.mid = randomNumber(2);
81 counts.down = randomNumber(8);
84 counts.up = randomNumber(16) + 3;
85 counts.mid = randomNumber(4) + 1;
86 counts.down = randomNumber(64) + 3;
89 counts.up = randomNumber(8) + 1;
90 counts.mid = randomNumber(6) / 2;
[all …]
|
| /third_party/skia/src/sksl/transform/ |
| D | SkSLEliminateDeadLocalVariables.cpp | 37 ProgramUsage::VariableCounts* counts = fUsage->fVariableCounts.find(var); in EliminateDeadLocalVariables() local
38 SkASSERT(counts); in EliminateDeadLocalVariables()
39 SkASSERT(counts->fDeclared); in EliminateDeadLocalVariables()
40 if (CanEliminate(var, *counts)) { in EliminateDeadLocalVariables()
60 static bool CanEliminate(const Variable* var, const ProgramUsage::VariableCounts& counts) { in EliminateDeadLocalVariables() argument
61 if (!counts.fDeclared || counts.fRead || var->storage() != VariableStorage::kLocal) { in EliminateDeadLocalVariables()
65 SkASSERT(counts.fWrite >= 1); in EliminateDeadLocalVariables()
66 return counts.fWrite == 1; in EliminateDeadLocalVariables()
68 return counts.fWrite == 0; in EliminateDeadLocalVariables()
82 for (auto& [var, counts] : usage->fVariableCounts) { in EliminateDeadLocalVariables()
[all …]
|
| /third_party/node/test/parallel/ |
| D | test-performanceobserver.js | 10 observerCounts: counts
26 assert.strictEqual(counts[NODE_PERFORMANCE_ENTRY_TYPE_NODE], 0);
27 assert.strictEqual(counts[NODE_PERFORMANCE_ENTRY_TYPE_MARK], 0);
28 assert.strictEqual(counts[NODE_PERFORMANCE_ENTRY_TYPE_MEASURE], 0);
29 assert.strictEqual(counts[NODE_PERFORMANCE_ENTRY_TYPE_GC], 0);
30 assert.strictEqual(counts[NODE_PERFORMANCE_ENTRY_TYPE_FUNCTION], 0);
70 assert.strictEqual(counts[NODE_PERFORMANCE_ENTRY_TYPE_MARK], 0);
81 assert.strictEqual(counts[NODE_PERFORMANCE_ENTRY_TYPE_MARK], 0);
90 assert.strictEqual(counts[NODE_PERFORMANCE_ENTRY_TYPE_MARK], 0);
91 assert.strictEqual(counts[NODE_PERFORMANCE_ENTRY_TYPE_NODE], 0);
[all …]
|
| /third_party/ffmpeg/libavcodec/ |
| D | vp9prob.c | 59 unsigned *e = s->td[0].counts.eob[i][j][k][l][m]; in ff_vp9_adapt_probs()
60 unsigned *c = s->td[0].counts.coef[i][j][k][l][m]; in ff_vp9_adapt_probs()
80 adapt_prob(&p->skip[i], s->td[0].counts.skip[i][0], in ff_vp9_adapt_probs()
81 s->td[0].counts.skip[i][1], 20, 128); in ff_vp9_adapt_probs()
85 adapt_prob(&p->intra[i], s->td[0].counts.intra[i][0], in ff_vp9_adapt_probs()
86 s->td[0].counts.intra[i][1], 20, 128); in ff_vp9_adapt_probs()
91 adapt_prob(&p->comp[i], s->td[0].counts.comp[i][0], in ff_vp9_adapt_probs()
92 s->td[0].counts.comp[i][1], 20, 128); in ff_vp9_adapt_probs()
98 adapt_prob(&p->comp_ref[i], s->td[0].counts.comp_ref[i][0], in ff_vp9_adapt_probs()
99 s->td[0].counts.comp_ref[i][1], 20, 128); in ff_vp9_adapt_probs()
[all …]
|
| /third_party/node/deps/brotli/c/enc/ |
| D | entropy_encode.c | 244 void BrotliOptimizeHuffmanCountsForRle(size_t length, uint32_t* counts, in BrotliOptimizeHuffmanCountsForRle() argument
254 if (counts[i]) { in BrotliOptimizeHuffmanCountsForRle()
261 while (length != 0 && counts[length - 1] == 0) { in BrotliOptimizeHuffmanCountsForRle()
272 if (counts[i] != 0) { in BrotliOptimizeHuffmanCountsForRle()
274 if (smallest_nonzero > counts[i]) { in BrotliOptimizeHuffmanCountsForRle()
275 smallest_nonzero = counts[i]; in BrotliOptimizeHuffmanCountsForRle()
287 if (counts[i - 1] != 0 && counts[i] == 0 && counts[i + 1] != 0) { in BrotliOptimizeHuffmanCountsForRle()
288 counts[i] = 1; in BrotliOptimizeHuffmanCountsForRle()
304 uint32_t symbol = counts[0]; in BrotliOptimizeHuffmanCountsForRle()
307 if (i == length || counts[i] != symbol) { in BrotliOptimizeHuffmanCountsForRle()
[all …]
|
| /third_party/skia/third_party/externals/brotli/c/enc/ |
| D | entropy_encode.c | 244 void BrotliOptimizeHuffmanCountsForRle(size_t length, uint32_t* counts, in BrotliOptimizeHuffmanCountsForRle() argument
254 if (counts[i]) { in BrotliOptimizeHuffmanCountsForRle()
261 while (length != 0 && counts[length - 1] == 0) { in BrotliOptimizeHuffmanCountsForRle()
272 if (counts[i] != 0) { in BrotliOptimizeHuffmanCountsForRle()
274 if (smallest_nonzero > counts[i]) { in BrotliOptimizeHuffmanCountsForRle()
275 smallest_nonzero = counts[i]; in BrotliOptimizeHuffmanCountsForRle()
287 if (counts[i - 1] != 0 && counts[i] == 0 && counts[i + 1] != 0) { in BrotliOptimizeHuffmanCountsForRle()
288 counts[i] = 1; in BrotliOptimizeHuffmanCountsForRle()
304 uint32_t symbol = counts[0]; in BrotliOptimizeHuffmanCountsForRle()
307 if (i == length || counts[i] != symbol) { in BrotliOptimizeHuffmanCountsForRle()
[all …]
|
| /third_party/boost/tools/build/src/engine/ |
| D | make.cpp | 96 COUNTS counts[ 1 ]; in make() local
103 memset( (char *)counts, 0, sizeof( *counts ) ); in make()
121 make0( t, 0, 0, counts, anyhow, 0 ); in make()
137 if ( counts->targets ) in make()
138 out_printf( "...found %d target%s...\n", counts->targets, in make()
139 counts->targets > 1 ? "s" : "" ); in make()
140 if ( counts->temp ) in make()
141 out_printf( "...using %d temp target%s...\n", counts->temp, in make()
142 counts->temp > 1 ? "s" : "" ); in make()
143 if ( counts->updating ) in make()
[all …]
|
| /third_party/boost/boost/compute/algorithm/ |
| D | set_intersection.hpp | 56 OutputIterator2 counts) in set_range() argument
83 counts[expr<uint_>("i")] << " = count;\n"; in set_range()
153 vector<uint_> counts((count1+count2+tile_size-1)/tile_size + 1, queue.get_context()); in set_intersection() local
154 fill_n(counts.end()-1, 1, 0, queue); in set_intersection()
160 tile_b.begin(), temp_result.begin(), counts.begin()); in set_intersection()
164 exclusive_scan(counts.begin(), counts.end(), counts.begin(), queue); in set_intersection()
169 compact_kernel.set_range(temp_result.begin(), counts.begin(), counts.end(), result); in set_intersection()
173 return result + (counts.end() - 1).read(queue); in set_intersection()
|
| D | set_difference.hpp | 56 OutputIterator2 counts) in set_range() argument
95 counts[expr<uint_>("i")] << " = count;\n"; in set_range()
165 vector<uint_> counts((count1+count2+tile_size-1)/tile_size + 1, queue.get_context()); in set_difference() local
166 fill_n(counts.end()-1, 1, 0, queue); in set_difference()
172 tile_b.begin(), temp_result.begin(), counts.begin()); in set_difference()
176 exclusive_scan(counts.begin(), counts.end(), counts.begin(), queue); in set_difference()
181 compact_kernel.set_range(temp_result.begin(), counts.begin(), counts.end(), result); in set_difference()
185 return result + (counts.end() - 1).read(queue); in set_difference()
|
| D | set_symmetric_difference.hpp | 57 OutputIterator2 counts) in set_range() argument
106 counts[expr<uint_>("i")] << " = count;\n"; in set_range()
177 vector<uint_> counts((count1+count2+tile_size-1)/tile_size + 1, queue.get_context()); in set_symmetric_difference() local
178 fill_n(counts.end()-1, 1, 0, queue); in set_symmetric_difference()
185 temp_result.begin(), counts.begin()); in set_symmetric_difference()
189 exclusive_scan(counts.begin(), counts.end(), counts.begin(), queue); in set_symmetric_difference()
194 compact_kernel.set_range(temp_result.begin(), counts.begin(), counts.end(), result); in set_symmetric_difference()
198 return result + (counts.end() - 1).read(queue); in set_symmetric_difference()
|
| D | set_union.hpp | 56 OutputIterator2 counts) in set_range() argument
108 counts[expr<uint_>("i")] << " = count;\n"; in set_range()
178 vector<uint_> counts((count1+count2+tile_size-1)/tile_size + 1, queue.get_context()); in set_union() local
179 fill_n(counts.end()-1, 1, 0, queue); in set_union()
185 tile_b.begin(), temp_result.begin(), counts.begin()); in set_union()
189 exclusive_scan(counts.begin(), counts.end(), counts.begin(), queue); in set_union()
194 compact_kernel.set_range(temp_result.begin(), counts.begin(), counts.end(), result); in set_union()
198 return result + (counts.end() - 1).read(queue); in set_union()
|
| /third_party/boost/libs/compute/include/boost/compute/algorithm/ |
| D | set_difference.hpp | 56 OutputIterator2 counts) in set_range() argument
95 counts[expr<uint_>("i")] << " = count;\n"; in set_range()
165 vector<uint_> counts((count1+count2+tile_size-1)/tile_size + 1, queue.get_context()); in set_difference() local
166 fill_n(counts.end()-1, 1, 0, queue); in set_difference()
172 tile_b.begin(), temp_result.begin(), counts.begin()); in set_difference()
176 exclusive_scan(counts.begin(), counts.end(), counts.begin(), queue); in set_difference()
181 compact_kernel.set_range(temp_result.begin(), counts.begin(), counts.end(), result); in set_difference()
185 return result + (counts.end() - 1).read(queue); in set_difference()
|
| D | set_intersection.hpp | 56 OutputIterator2 counts) in set_range() argument
83 counts[expr<uint_>("i")] << " = count;\n"; in set_range()
153 vector<uint_> counts((count1+count2+tile_size-1)/tile_size + 1, queue.get_context()); in set_intersection() local
154 fill_n(counts.end()-1, 1, 0, queue); in set_intersection()
160 tile_b.begin(), temp_result.begin(), counts.begin()); in set_intersection()
164 exclusive_scan(counts.begin(), counts.end(), counts.begin(), queue); in set_intersection()
169 compact_kernel.set_range(temp_result.begin(), counts.begin(), counts.end(), result); in set_intersection()
173 return result + (counts.end() - 1).read(queue); in set_intersection()
|
| D | set_symmetric_difference.hpp | 57 OutputIterator2 counts) in set_range() argument
106 counts[expr<uint_>("i")] << " = count;\n"; in set_range()
177 vector<uint_> counts((count1+count2+tile_size-1)/tile_size + 1, queue.get_context()); in set_symmetric_difference() local
178 fill_n(counts.end()-1, 1, 0, queue); in set_symmetric_difference()
185 temp_result.begin(), counts.begin()); in set_symmetric_difference()
189 exclusive_scan(counts.begin(), counts.end(), counts.begin(), queue); in set_symmetric_difference()
194 compact_kernel.set_range(temp_result.begin(), counts.begin(), counts.end(), result); in set_symmetric_difference()
198 return result + (counts.end() - 1).read(queue); in set_symmetric_difference()
|
| /third_party/boost/libs/compute/include/boost/compute/algorithm/detail/ |
| D | radix_sort.hpp | 336 vector<uint_> counts(block_count * k2, context); in radix_sort_impl() local
352 count_kernel.set_arg(3, counts); in radix_sort_impl()
365 make_buffer_iterator<counter_type>(counts.get_buffer(), 0), in radix_sort_impl()
366 make_buffer_iterator<counter_type>(counts.get_buffer(), counts.size() / 2), in radix_sort_impl()
367 make_buffer_iterator<counter_type>(counts.get_buffer()), in radix_sort_impl()
374 make_buffer_iterator<counter_type>(counts.get_buffer(), 0), in radix_sort_impl()
375 make_buffer_iterator<counter_type>(counts.get_buffer(), counts.size() / 4), in radix_sort_impl()
376 make_buffer_iterator<counter_type>(counts.get_buffer()), in radix_sort_impl()
383 make_buffer_iterator<counter_type>(counts.get_buffer(), 0), in radix_sort_impl()
384 make_buffer_iterator<counter_type>(counts.get_buffer(), counts.size() / 16), in radix_sort_impl()
[all …]
|
| /third_party/boost/boost/compute/algorithm/detail/ |
| D | radix_sort.hpp | 336 vector<uint_> counts(block_count * k2, context); in radix_sort_impl() local
352 count_kernel.set_arg(3, counts); in radix_sort_impl()
365 make_buffer_iterator<counter_type>(counts.get_buffer(), 0), in radix_sort_impl()
366 make_buffer_iterator<counter_type>(counts.get_buffer(), counts.size() / 2), in radix_sort_impl()
367 make_buffer_iterator<counter_type>(counts.get_buffer()), in radix_sort_impl()
374 make_buffer_iterator<counter_type>(counts.get_buffer(), 0), in radix_sort_impl()
375 make_buffer_iterator<counter_type>(counts.get_buffer(), counts.size() / 4), in radix_sort_impl()
376 make_buffer_iterator<counter_type>(counts.get_buffer()), in radix_sort_impl()
383 make_buffer_iterator<counter_type>(counts.get_buffer(), 0), in radix_sort_impl()
384 make_buffer_iterator<counter_type>(counts.get_buffer(), counts.size() / 16), in radix_sort_impl()
[all …]
|