HomeSort by relevance Sort by last modified time
    Searched refs:clusters (Results 1 - 25 of 70) sorted by null

1 2 3

  /external/skia/src/pdf/
SkClusterator.cpp 14 static bool is_reversed(const uint32_t* clusters, uint32_t count) {
17 if (count < 2 || clusters[0] == 0 || clusters[count - 1] != 0) {
21 if (clusters[i + 1] > clusters[i]) {
29 : fClusters(run.clusters().data())
  /external/skqp/src/pdf/
SkClusterator.cpp 14 static bool is_reversed(const uint32_t* clusters, uint32_t count) {
17 if (count < 2 || clusters[0] == 0 || clusters[count - 1] != 0) {
21 if (clusters[i + 1] > clusters[i]) {
29 : fClusters(run.clusters().data())
  /external/tensorflow/tensorflow/compiler/jit/
xla_fusion_optimizer_test.cc 67 auto clusters = GetClusters(output); local
68 EXPECT_EQ(4, clusters.size());
69 EXPECT_EQ(clusters["B"], clusters["C"]);
70 EXPECT_EQ(clusters["E"], clusters["F"]);
71 EXPECT_NE(clusters["B"], clusters["E"]);
72 EXPECT_TRUE(clusters.find("A") == clusters.cend())
99 auto clusters = GetClusters(output); local
132 auto clusters = GetClusters(output); local
156 auto clusters = GetClusters(output); local
178 auto clusters = GetClusters(output); local
204 auto clusters = GetClusters(output); local
    [all...]
mark_for_compilation_pass_test.cc 61 VLOG(2) << "Clusters:";
105 auto clusters = GetClusters(*graph); local
106 EXPECT_EQ(4, clusters.size());
107 EXPECT_EQ(clusters["B"], clusters["C"]);
108 EXPECT_EQ(clusters["E"], clusters["F"]);
109 EXPECT_NE(clusters["B"], clusters["E"]);
110 EXPECT_TRUE(clusters.find("A") == clusters.cend())
130 auto clusters = GetClusters(*graph); local
150 auto clusters = GetClusters(*graph); local
173 auto clusters = GetClusters(*graph); local
194 auto clusters = GetClusters(*graph); local
230 auto clusters = GetClusters(*graph); local
261 auto clusters = GetClusters(*graph); local
348 auto clusters = GetClusters(*graph); local
373 auto clusters = GetClusters(*graph); local
403 auto clusters = GetClusters(*graph); local
435 auto clusters = GetClusters(*graph); local
474 auto clusters = GetClusters(*graph); local
508 auto clusters = GetClusters(*graph); local
669 auto clusters = GetClusters(*graph); local
685 auto clusters = GetClusters(*graph); local
726 std::unordered_map<string, string> clusters = GetClusters(*graph); local
749 std::unordered_map<string, string> clusters = GetClusters(*graph); local
781 std::unordered_map<string, string> clusters = GetClusters(*graph); local
807 std::unordered_map<string, string> clusters = GetClusters(*graph); local
853 std::unordered_map<string, string> clusters = GetClusters(*graph); local
884 std::unordered_map<string, string> clusters = GetClusters(*graph); local
917 std::unordered_map<string, string> clusters = GetClusters(*graph); local
966 std::unordered_map<string, string> clusters = GetClusters(*graph); local
1016 std::unordered_map<string, string> clusters = GetClusters(*graph); local
1045 std::unordered_map<string, string> clusters = GetClusters(*graph); local
1063 std::unordered_map<string, string> clusters = GetClusters(*graph); local
1090 std::unordered_map<string, string> clusters = GetClusters(*graph); local
1110 std::unordered_map<string, string> clusters = GetClusters(*graph); local
1131 std::unordered_map<string, string> clusters = GetClusters(*graph); local
1159 std::unordered_map<string, string> clusters = GetClusters(*graph); local
1186 std::unordered_map<string, string> clusters = GetClusters(*graph); local
1213 std::unordered_map<string, string> clusters = GetClusters(*graph); local
1237 std::unordered_map<string, string> clusters = GetClusters(*graph); local
1259 std::unordered_map<string, string> clusters = GetClusters(*graph); local
1285 std::unordered_map<string, string> clusters = GetClusters(*graph); local
1311 std::unordered_map<string, string> clusters = GetClusters(*graph); local
    [all...]
xla_fusion_optimizer.cc 129 // appropriate fusion clusters with XlaLaunch nodes. The remaining graph can
189 // Leave such nodes out of XLA clusters.
236 std::vector<UnionFind<Cluster>> clusters(graph.num_node_ids());
239 Cluster& cluster = clusters[node->id()].Get();
241 worklist.push_back(&clusters[node->id()]);
244 // Repeatedly contract edges between clusters that are on the same device,
283 if (clusters[from].Size() == 1 && IsShapeConsumerOp(*node_from)) {
288 // However, just because we can't merge the clusters now does not mean
294 // Merge the clusters. ContractEdge uses 'from' as the number of the
296 clusters[from].Merge(&clusters[to])
    [all...]
  /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/clustering/
KMeansPlusPlusClusterer.java 58 /** Selected strategy for empty clusters. */
63 * The default strategy for handling empty clusters that may appear during
74 * @param emptyStrategy strategy to use for handling empty clusters that
87 * @param k the number of clusters to split the data into
90 * @return a list of clusters containing the points
94 // create the initial clusters
95 List<Cluster<T>> clusters = chooseInitialCenters(points, k, random); local
96 assignPointsToClusters(clusters, points);
103 for (final Cluster<T> cluster : clusters) {
108 newCenter = getPointFromLargestVarianceCluster(clusters);
    [all...]
  /external/harfbuzz_ng/util/
helper-cairo.hh 59 cairo_text_cluster_t *clusters; member in struct:helper_cairo_line_t
66 if (clusters)
67 cairo_text_cluster_free (clusters);
helper-cairo.cc 495 l->clusters = cairo_text_cluster_allocate (l->num_clusters);
500 (l->num_clusters && !l->clusters))
523 memset ((void *) l->clusters, 0, l->num_clusters * sizeof (l->clusters[0]));
528 l->clusters[cluster].num_glyphs++;
537 l->clusters[cluster].num_bytes = end - start;
541 l->clusters[cluster].num_glyphs++;
543 l->clusters[cluster].num_bytes = l->utf8 + text_len - start;
552 l->clusters[cluster].num_bytes = end - start;
556 l->clusters[cluster].num_glyphs++
    [all...]
  /external/harfbuzz_ng/src/
hb-graphite2.cc 318 ALLOCATE_ARRAY (hb_graphite2_cluster_t, clusters, buffer->len);
323 memset (clusters, 0, sizeof (clusters[0]) * buffer->len);
326 clusters[0].cluster = buffer->info[0].cluster;
331 clusters[0].advance = gr_seg_advance_X(seg) - curradv;
334 clusters[0].advance = 0;
341 while (clusters[ci].base_char > before && ci)
343 clusters[ci-1].num_chars += clusters[ci].num_chars;
344 clusters[ci-1].num_glyphs += clusters[ci].num_glyphs
    [all...]
  /external/skqp/modules/skshaper/src/
SkShaper.cpp 21 runBuffer.clusters };
SkShaper_primitive.cpp 71 if (buffer.clusters) {
75 buffer.clusters[i] = SkToU32(txtPtr - utf8text);
  /external/skia/src/core/
SkGlyphRun.cpp 26 SkSpan<const uint32_t> clusters)
30 , fClusters{clusters}
193 auto clusters = SkSpan<const uint32_t>(it.clusters(), runSize); local
200 it.font(), glyphIDs, offset, positions, text, clusters);
206 it.font(), glyphIDs, it.pos(), constY, positions, text, clusters);
211 it.font(), glyphIDs, (const SkPoint*)it.pos(), text, clusters);
280 SkSpan<const uint32_t> clusters) {
289 clusters);
304 SkSpan<const char> text, SkSpan<const uint32_t> clusters) {
    [all...]
SkGlyphRun.h 32 SkSpan<const uint32_t> clusters);
41 SkSpan<const uint32_t> clusters() const { return fClusters; } function in class:SkGlyphRun
51 // Original clusters from SkTextBlob if present. Will be empty if not present.
140 SkSpan<const uint32_t> clusters);
148 SkSpan<const uint32_t> clusters = SkSpan<const uint32_t>{});
153 SkSpan<const uint32_t> clusters = SkSpan<const uint32_t>{});
158 SkSpan<const uint32_t> clusters = SkSpan<const uint32_t>{});
  /external/skqp/src/core/
SkGlyphRun.cpp 26 SkSpan<const uint32_t> clusters)
30 , fClusters{clusters}
193 auto clusters = SkSpan<const uint32_t>(it.clusters(), runSize); local
200 it.font(), glyphIDs, offset, positions, text, clusters);
206 it.font(), glyphIDs, it.pos(), constY, positions, text, clusters);
211 it.font(), glyphIDs, (const SkPoint*)it.pos(), text, clusters);
280 SkSpan<const uint32_t> clusters) {
289 clusters);
304 SkSpan<const char> text, SkSpan<const uint32_t> clusters) {
    [all...]
SkGlyphRun.h 32 SkSpan<const uint32_t> clusters);
41 SkSpan<const uint32_t> clusters() const { return fClusters; } function in class:SkGlyphRun
51 // Original clusters from SkTextBlob if present. Will be empty if not present.
140 SkSpan<const uint32_t> clusters);
148 SkSpan<const uint32_t> clusters = SkSpan<const uint32_t>{});
153 SkSpan<const uint32_t> clusters = SkSpan<const uint32_t>{});
158 SkSpan<const uint32_t> clusters = SkSpan<const uint32_t>{});
  /external/tensorflow/tensorflow/lite/toco/tensorflow_graph_matching/
resolve_cluster.cc 66 std::vector<std::unique_ptr<Cluster>>* clusters) {
80 clusters->push_back(std::move(cluster));
84 return (!clusters->empty());
100 // Find the clusters for all available cluster factories.
102 std::vector<std::unique_ptr<Cluster>> clusters; local
104 &clusters)) {
105 for (auto itr = clusters.begin(); itr != clusters.end(); ++itr) {
resolve_cluster.h 30 // partitions the graph to clusters, and then collapses each cluster into their
48 // returns a vector of those clusters. It also labels the nodes in that graph if
49 // they belong to the generated clusters.
53 std::vector<std::unique_ptr<Cluster>>* clusters);
  /external/brotli/c/enc/
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],
169 When called, clusters[0..num_clusters) contains the unique values from
173 size_t in_size, const uint32_t* clusters, size_t num_clusters
    [all...]
  /external/webrtc/webrtc/modules/remote_bitrate_estimator/
remote_bitrate_estimator_abs_send_time.cc 89 std::list<Cluster>* clusters,
94 clusters->push_back(*cluster);
123 std::list<Cluster>* clusters) const {
138 AddCluster(clusters, &current);
150 AddCluster(clusters, &current);
155 const std::list<Cluster>& clusters) const {
157 std::list<Cluster>::const_iterator best_it = clusters.end();
158 for (std::list<Cluster>::const_iterator it = clusters.begin();
159 it != clusters.end();
187 std::list<Cluster> clusters; local
    [all...]
remote_bitrate_estimator_abs_send_time.h 98 static void AddCluster(std::list<Cluster>* clusters, Cluster* cluster);
118 void ComputeClusters(std::list<Cluster>* clusters) const;
121 const std::list<Cluster>& clusters) const
  /external/skia/modules/skshaper/src/
SkShaper.cpp 34 fClusters = runBuffer.clusters;
40 runBuffer.clusters };
  /external/tensorflow/tensorflow/contrib/factorization/python/ops/
gmm_test.py 70 self.initial_means = clusterer.clusters()
97 """Tests the shape of the clusters."""
103 clusters = gmm.clusters()
104 self.assertAllEqual(list(clusters.shape), [self.num_centers, self.num_dims])
125 clusters = gmm.clusters()
129 points, true_assignments = self.make_random_points(clusters, num_points)
163 self.assertAllClose(sklearn_means, gmm.clusters())
196 self.assertFalse(np.isnan(gmm.clusters()).any()
    [all...]
  /external/skqp/modules/skshaper/include/
SkShaper.h 46 uint32_t* clusters; // optional member in struct:SkShaper::RunHandler::Buffer
  /external/eigen/unsupported/Eigen/src/MatrixFunctions/
MatrixFunction.h 103 /** \brief Find cluster in \p clusters containing some value
105 * \returns Iterator to cluster containing \p key, or \c clusters.end() if no cluster in \p m_clusters
109 typename ListOfClusters::iterator matrix_function_find_cluster(Index key, ListOfClusters& clusters)
112 for (typename ListOfClusters::iterator i = clusters.begin(); i != clusters.end(); ++i) {
117 return clusters.end();
120 /** \brief Partition eigenvalues in clusters of ei'vals close to each other
123 * \param[out] clusters Resulting partition of eigenvalues
128 * # The distance between two eigenvalues in different clusters is more than matrix_function_separation().
132 void matrix_function_partition_eigenvalues(const EivalsType& eivals, std::list<Cluster>& clusters)
436 std::list<std::list<Index> > clusters; local
    [all...]
  /external/tensorflow/tensorflow/contrib/learn/python/learn/estimators/
kmeans_test.py 164 clusters = kmeans.clusters()
165 self.assertAllEqual(list(clusters.shape), [self.num_centers, self.num_dims])
201 def _infer_helper(self, kmeans, clusters, num_points):
203 clusters, num_points)
221 keepdims=True) - 2 * np.dot(points, np.transpose(clusters)) +
222 np.transpose(np.sum(np.square(clusters), axis=1, keepdims=True)))
230 clusters = kmeans.clusters()
233 self._infer_helper(kmeans, clusters, num_points=10
    [all...]

Completed in 735 milliseconds

1 2 3