| /external/tensorflow/tensorflow/compiler/jit/ |
| D | mark_for_compilation_pass_test.cc | 109 auto clusters = GetClusters(*graph); in TEST() local
110 EXPECT_EQ(4, clusters.size()); in TEST()
111 EXPECT_EQ(clusters["B"], clusters["C"]); in TEST()
112 EXPECT_EQ(clusters["E"], clusters["F"]); in TEST()
113 EXPECT_NE(clusters["B"], clusters["E"]); in TEST()
114 EXPECT_TRUE(clusters.find("A") == clusters.cend()); in TEST()
115 EXPECT_TRUE(clusters.find("D") == clusters.cend()); in TEST()
133 auto clusters = GetClusters(*graph); in TEST() local
135 EXPECT_TRUE(clusters.empty()); in TEST()
152 auto clusters = GetClusters(*graph); in TEST() local
[all …]
|
| /external/skia/src/utils/ |
| D | SkShaperJSONWriter.cpp | 36 std::vector<uint32_t>& clusters) { in is_one_to_one() argument
40 if (clusters[clusterIndex] >= lastUtf8Index) { in is_one_to_one()
43 size_t utf8ClusterSize = lastUtf8Index - clusters[clusterIndex]; in is_one_to_one()
44 if (SkUTF::CountUTF8(&utf8[clusters[clusterIndex]], utf8ClusterSize) != 1) { in is_one_to_one()
47 lastUtf8Index = clusters[clusterIndex]; in is_one_to_one()
51 if (clusters.front() <= clusters.back()) { in is_one_to_one()
53 size_t clusterCursor = clusters.size(); in is_one_to_one()
60 while (clusterCursor < clusters.size()) { in is_one_to_one()
131 SkSpan<const uint32_t> clusters, in BreakupClusters() argument
134 if (clusters.front() <= clusters.back()) { in BreakupClusters()
[all …]
|
| /external/harfbuzz_ng/src/ |
| D | hb-graphite2.cc | 298 ALLOCATE_ARRAY (hb_graphite2_cluster_t, clusters, buffer->len); in _hb_graphite2_shape()
303 memset (clusters, 0, sizeof (clusters[0]) * buffer->len); in _hb_graphite2_shape()
306 clusters[0].cluster = buffer->info[0].cluster; in _hb_graphite2_shape()
315 clusters[0].advance = gr_seg_advance_X(seg) * xscale - curradv; in _hb_graphite2_shape()
318 clusters[0].advance = 0; in _hb_graphite2_shape()
325 while (clusters[ci].base_char > before && ci) in _hb_graphite2_shape()
327 clusters[ci-1].num_chars += clusters[ci].num_chars; in _hb_graphite2_shape()
328 clusters[ci-1].num_glyphs += clusters[ci].num_glyphs; in _hb_graphite2_shape()
329 clusters[ci-1].advance += clusters[ci].advance; in _hb_graphite2_shape()
333 …if (gr_slot_can_insert_before (is) && clusters[ci].num_chars && before >= clusters[ci].base_char +… in _hb_graphite2_shape()
[all …]
|
| /external/webrtc/rtc_tools/frame_analyzer/ |
| D | video_quality_analysis.cc | 80 std::vector<Cluster> clusters; in CalculateFrameClusters() local
83 if (!clusters.empty() && clusters.back().index == index) { in CalculateFrameClusters()
85 ++clusters.back().number_of_repeated_frames; in CalculateFrameClusters()
88 clusters.push_back({index, /* number_of_repeated_frames= */ 1}); in CalculateFrameClusters()
92 return clusters; in CalculateFrameClusters()
95 int GetMaxRepeatedFrames(const std::vector<Cluster>& clusters) { in GetMaxRepeatedFrames() argument
97 for (const Cluster& cluster : clusters) { in GetMaxRepeatedFrames()
104 int GetMaxSkippedFrames(const std::vector<Cluster>& clusters) { in GetMaxSkippedFrames() argument
106 for (size_t i = 1; i < clusters.size(); ++i) { in GetMaxSkippedFrames()
107 const size_t skipped_frames = clusters[i].index - clusters[i - 1].index - 1; in GetMaxSkippedFrames()
[all …]
|
| /external/llvm-project/lld/COFF/ |
| D | CallGraphSort.cpp | 56 std::vector<Cluster> clusters; member in __anon7c699b5e0111::CallGraphSort
78 auto res = secToCluster.try_emplace(isec, clusters.size()); in CallGraphSort()
81 clusters.emplace_back(clusters.size(), isec->getSize()); in CallGraphSort()
104 clusters[to].weight += weight; in CallGraphSort()
110 Cluster &toC = clusters[to]; in CallGraphSort()
116 for (Cluster &c : clusters) in CallGraphSort()
153 std::vector<int> sorted(clusters.size()); in run()
154 std::vector<int> leaders(clusters.size()); in run()
159 return clusters[a].getDensity() > clusters[b].getDensity(); in run()
165 Cluster &c = clusters[l]; in run()
[all …]
|
| /external/llvm-project/lld/ELF/ |
| D | CallGraphSort.cpp | 84 std::vector<Cluster> clusters; member in __anon6eb1b7370111::CallGraphSort
107 auto res = secToCluster.try_emplace(isec, clusters.size()); in CallGraphSort()
110 clusters.emplace_back(clusters.size(), isec->getSize()); in CallGraphSort()
133 clusters[to].weight += weight; in CallGraphSort()
139 Cluster &toC = clusters[to]; in CallGraphSort()
145 for (Cluster &c : clusters) in CallGraphSort()
182 std::vector<int> sorted(clusters.size()); in run()
183 std::vector<int> leaders(clusters.size()); in run()
188 return clusters[a].getDensity() > clusters[b].getDensity(); in run()
194 Cluster &c = clusters[l]; in run()
[all …]
|
| /external/skia/experimental/sktext/src/ |
| D | Wrapper.cpp | 49 Stretch clusters; in breakTextIntoLines() local
81 if (!clusters.isEmpty()) { in breakTextIntoLines()
83 line.moveTo(clusters); in breakTextIntoLines()
84 spaces = clusters; in breakTextIntoLines()
92 clusters = cluster; in breakTextIntoLines()
100 clusters.moveTo(cluster); in breakTextIntoLines()
105 if ((line.width() + spaces.width() + clusters.width() + cluster.width()) <= width) { in breakTextIntoLines()
106 clusters.moveTo(cluster); in breakTextIntoLines()
109 if (spaces.isEmpty() && clusters.isEmpty()) { in breakTextIntoLines()
115 line.moveTo(clusters); in breakTextIntoLines()
[all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/clustering/ |
| D | KMeansPlusPlusClusterer.java | 95 List<Cluster<T>> clusters = chooseInitialCenters(points, k, random); in cluster() local
96 assignPointsToClusters(clusters, points); in cluster()
103 for (final Cluster<T> cluster : clusters) { in cluster()
108 newCenter = getPointFromLargestVarianceCluster(clusters); in cluster()
111 newCenter = getPointFromLargestNumberCluster(clusters); in cluster()
114 newCenter = getFarthestPoint(clusters); in cluster()
129 return clusters; in cluster()
132 clusters = newClusters; in cluster()
134 return clusters; in cluster()
145 assignPointsToClusters(final Collection<Cluster<T>> clusters, final Collection<T> points) { in assignPointsToClusters() argument
[all …]
|
| /external/harfbuzz_ng/test/shaping/data/aots/tests/ |
| D | gpos3.tests | 1 #../fonts/gpos3_font1.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0011,U+0012,U+00…
2 ../fonts/gpos3_font1.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0011,U+0012,U+001…
3 #../fonts/gpos3_font3.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0011,U+0012,U+00…
4 #../fonts/gpos3_font3.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0011,U+0012,U+00…
5 #../fonts/gpos3_font3.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0011,U+0014,U+00…
6 #../fonts/gpos3_font3.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0011,U+0014,U+00…
7 ../fonts/gpos3_font3.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0011,U+0012,U+001…
8 ../fonts/gpos3_font3.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0011,U+0013,U+001…
9 ../fonts/gpos3_font3.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0011,U+0013,U+001…
10 ../fonts/gpos3_font3.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0011,U+0012:[17|1…
[all …]
|
| D | gsub_chaining2_simple.tests | 1 ../fonts/gsub_chaining2_simple_f1.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
2 ../fonts/gsub_chaining2_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
3 ../fonts/gsub_chaining2_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
4 ../fonts/gsub_chaining2_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
5 ../fonts/gsub_chaining2_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
6 ../fonts/gsub_chaining2_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
7 ../fonts/gsub_chaining2_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
8 ../fonts/gsub_chaining2_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
9 ../fonts/gsub_chaining2_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
10 ../fonts/gsub_chaining2_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
[all …]
|
| D | gpos_chaining3_simple.tests | 1 ../fonts/gpos_chaining3_simple_f1.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
2 ../fonts/gpos_chaining3_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
3 ../fonts/gpos_chaining3_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
4 ../fonts/gpos_chaining3_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
5 ../fonts/gpos_chaining3_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
6 ../fonts/gpos_chaining3_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
7 ../fonts/gpos_chaining3_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0015…
8 ../fonts/gpos_chaining3_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0016…
9 ../fonts/gpos_chaining3_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
10 ../fonts/gpos_chaining3_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
[all …]
|
| D | gsub_chaining1_simple.tests | 1 ../fonts/gsub_chaining1_simple_f1.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
2 ../fonts/gsub_chaining1_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
3 ../fonts/gsub_chaining1_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
4 ../fonts/gsub_chaining1_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
5 ../fonts/gsub_chaining1_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
6 ../fonts/gsub_chaining1_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
7 ../fonts/gsub_chaining1_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
8 ../fonts/gsub_chaining1_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
9 ../fonts/gsub_chaining1_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
10 ../fonts/gsub_chaining1_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
[all …]
|
| D | gsub_chaining3_simple.tests | 1 ../fonts/gsub_chaining3_simple_f1.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
2 ../fonts/gsub_chaining3_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
3 ../fonts/gsub_chaining3_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
4 ../fonts/gsub_chaining3_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
5 ../fonts/gsub_chaining3_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
6 ../fonts/gsub_chaining3_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
7 ../fonts/gsub_chaining3_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
8 ../fonts/gsub_chaining3_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
9 ../fonts/gsub_chaining3_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
10 ../fonts/gsub_chaining3_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --no-positio…
[all …]
|
| D | gpos_chaining2_simple.tests | 1 ../fonts/gpos_chaining2_simple_f1.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
2 ../fonts/gpos_chaining2_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
3 ../fonts/gpos_chaining2_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
4 ../fonts/gpos_chaining2_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
5 ../fonts/gpos_chaining2_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
6 ../fonts/gpos_chaining2_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
7 ../fonts/gpos_chaining2_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0015…
8 ../fonts/gpos_chaining2_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0016…
9 ../fonts/gpos_chaining2_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
10 ../fonts/gpos_chaining2_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
[all …]
|
| D | gpos_chaining1_simple.tests | 1 ../fonts/gpos_chaining1_simple_f1.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
2 ../fonts/gpos_chaining1_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
3 ../fonts/gpos_chaining1_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
4 ../fonts/gpos_chaining1_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
5 ../fonts/gpos_chaining1_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
6 ../fonts/gpos_chaining1_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
7 ../fonts/gpos_chaining1_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0015…
8 ../fonts/gpos_chaining1_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0016…
9 ../fonts/gpos_chaining1_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
10 ../fonts/gpos_chaining1_simple_f2.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0000…
[all …]
|
| D | gpos4_simple.tests | 1 #../fonts/gpos4_simple_1.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0011,U+0012,U…
2 #../fonts/gpos4_simple_1.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0011,U+0011,U…
3 #../fonts/gpos4_simple_1.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0019,U+0019,U…
4 #../fonts/gpos4_simple_1.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0011,U+0012,U…
5 #../fonts/gpos4_simple_1.otf:--features="test" --no-clusters --no-glyph-names --ned:U+0011,U+0012,U…
|
| /external/cpuinfo/src/arm/linux/ |
| D | midr.c | 34 uint8_t clusters; member
82 .clusters = 1,
98 .clusters = 2,
114 .clusters = 2,
129 .clusters = 2,
144 .clusters = 2,
159 .clusters = 2,
175 .clusters = 2,
190 .clusters = 2,
206 .clusters = 2,
[all …]
|
| /external/brotli/c/enc/ |
| D | cluster_inc.h | 73 uint32_t* clusters,
90 FN(BrotliCompareAndPushToQueue)(out, cluster_size, clusters[idx1],
91 clusters[idx2], max_num_pairs, &pairs[0], &num_pairs);
117 if (clusters[i] == best_idx2) {
118 memmove(&clusters[i], &clusters[i + 1],
119 (num_clusters - i - 1) * sizeof(clusters[0]));
149 FN(BrotliCompareAndPushToQueue)(out, cluster_size, best_idx1, clusters[i],
173 size_t in_size, const uint32_t* clusters, size_t num_clusters,
183 FN(BrotliHistogramBitCostDistance)(&in[i], &out[clusters[j]]);
186 best_out = clusters[j];
[all …]
|
| /external/mtools/ |
| D | fat_size_calculation.tex | 28 figure out fat size and number of clusters. Due to the way that
30 have a FAT that is larger than need to be to accommodate the clusters
47 Number of clusters on the disk\\
91 The space taken up by all clusters together, plus the space taken by
92 descriptors for clusters 0 and 1 ($2*nfats*fatNybls$) should be less
97 area). Thus, an {\em upper bound} for the number of clusters is as
138 or equal} to what would be needed for the data area of the clusters
139 (including fractional clusters), which is good, as we may have under
140 no circumstances {\em more} clusters in the data area than in the FAT.
142 size on a {\em fractional} number of clusters, rather than a rounded
[all …]
|
| /external/skqp/src/core/ |
| D | SkGlyphRun.cpp | 26 SkSpan<const uint32_t> clusters) in SkGlyphRun() argument
30 , fClusters{clusters}
193 auto clusters = SkSpan<const uint32_t>(it.clusters(), runSize); in drawTextBlob() local
200 it.font(), glyphIDs, offset, positions, text, clusters); in drawTextBlob()
206 it.font(), glyphIDs, it.pos(), constY, positions, text, clusters); in drawTextBlob()
211 it.font(), glyphIDs, (const SkPoint*)it.pos(), text, clusters); in drawTextBlob()
280 SkSpan<const uint32_t> clusters) { in makeGlyphRun() argument
289 clusters); in makeGlyphRun()
304 SkSpan<const char> text, SkSpan<const uint32_t> clusters) { in simplifyDrawText() argument
328 clusters); in simplifyDrawText()
[all …]
|
| /external/skia/src/pdf/ |
| D | SkClusterator.cpp | 14 static bool is_reversed(const uint32_t* clusters, uint32_t count) { in is_reversed() argument
17 if (count < 2 || clusters[0] == 0 || clusters[count - 1] != 0) { in is_reversed()
21 if (clusters[i + 1] > clusters[i]) { in is_reversed()
29 : fClusters(run.clusters().data()) in SkClusterator()
|
| /external/skqp/src/pdf/ |
| D | SkClusterator.cpp | 14 static bool is_reversed(const uint32_t* clusters, uint32_t count) { in is_reversed() argument
17 if (count < 2 || clusters[0] == 0 || clusters[count - 1] != 0) { in is_reversed()
21 if (clusters[i + 1] > clusters[i]) { in is_reversed()
29 : fClusters(run.clusters().data()) in SkClusterator()
|
| /external/cpuinfo/src/emscripten/ |
| D | init.c | 29 struct cpuinfo_cluster* clusters = NULL; in cpuinfo_emscripten_init() local
73 clusters = calloc(cluster_count, sizeof(struct cpuinfo_cluster)); in cpuinfo_emscripten_init()
74 if (clusters == NULL) { in cpuinfo_emscripten_init()
115 .cluster = clusters + (uint32_t) (i >= big_cluster_core_count), in cpuinfo_emscripten_init()
128 .cluster = clusters + (uint32_t) (i >= big_cluster_core_count), in cpuinfo_emscripten_init()
169 clusters[0] = (struct cpuinfo_cluster) { in cpuinfo_emscripten_init()
183 clusters[0] = (struct cpuinfo_cluster) { in cpuinfo_emscripten_init()
216 clusters[1] = (struct cpuinfo_cluster) { in cpuinfo_emscripten_init()
240 cpuinfo_clusters = clusters; in cpuinfo_emscripten_init()
267 clusters = NULL; in cpuinfo_emscripten_init()
[all …]
|
| /external/webrtc/modules/remote_bitrate_estimator/ |
| D | remote_bitrate_estimator_abs_send_time.cc | 85 void RemoteBitrateEstimatorAbsSendTime::AddCluster(std::list<Cluster>* clusters, in AddCluster() argument
90 clusters->push_back(*cluster); in AddCluster()
114 std::list<Cluster>* clusters) const { in ComputeClusters()
129 AddCluster(clusters, ¤t); in ComputeClusters()
143 AddCluster(clusters, ¤t); in ComputeClusters()
149 const std::list<Cluster>& clusters) const { in FindBestProbe()
151 std::list<Cluster>::const_iterator best_it = clusters.end(); in FindBestProbe()
152 for (std::list<Cluster>::const_iterator it = clusters.begin(); in FindBestProbe()
153 it != clusters.end(); ++it) { in FindBestProbe()
181 std::list<Cluster> clusters; in ProcessClusters() local
[all …]
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| D | MatrixFunction.h | 109 typename ListOfClusters::iterator matrix_function_find_cluster(Index key, ListOfClusters& clusters) in matrix_function_find_cluster() argument
112 for (typename ListOfClusters::iterator i = clusters.begin(); i != clusters.end(); ++i) { in matrix_function_find_cluster()
117 return clusters.end(); in matrix_function_find_cluster()
132 void matrix_function_partition_eigenvalues(const EivalsType& eivals, std::list<Cluster>& clusters) in matrix_function_partition_eigenvalues() argument
138 typename std::list<Cluster>::iterator qi = matrix_function_find_cluster(i, clusters); in matrix_function_partition_eigenvalues()
139 if (qi == clusters.end()) { in matrix_function_partition_eigenvalues()
142 clusters.push_back(l); in matrix_function_partition_eigenvalues()
143 qi = clusters.end(); in matrix_function_partition_eigenvalues()
151 typename std::list<Cluster>::iterator qj = matrix_function_find_cluster(j, clusters); in matrix_function_partition_eigenvalues()
152 if (qj == clusters.end()) { in matrix_function_partition_eigenvalues()
[all …]
|