Home
last modified time | relevance | path

Searched refs:clusters (Results 1 – 25 of 57) sorted by relevance

123

/external/harfbuzz_ng/src/
Dhb-graphite2.cc305 ALLOCATE_ARRAY (hb_graphite2_cluster_t, clusters, buffer->len); in _hb_graphite2_shape()
310 memset (clusters, 0, sizeof (clusters[0]) * buffer->len); in _hb_graphite2_shape()
313 clusters[0].cluster = buffer->info[0].cluster; in _hb_graphite2_shape()
318 clusters[0].advance = gr_seg_advance_X(seg) - curradv; in _hb_graphite2_shape()
326 while (clusters[ci].base_char > before && ci) in _hb_graphite2_shape()
328 clusters[ci-1].num_chars += clusters[ci].num_chars; in _hb_graphite2_shape()
329 clusters[ci-1].num_glyphs += clusters[ci].num_glyphs; in _hb_graphite2_shape()
330 clusters[ci-1].advance += clusters[ci].advance; in _hb_graphite2_shape()
334 …if (gr_slot_can_insert_before (is) && clusters[ci].num_chars && before >= clusters[ci].base_char +… in _hb_graphite2_shape()
336 hb_graphite2_cluster_t *c = clusters + ci + 1; in _hb_graphite2_shape()
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/clustering/
DKMeansPlusPlusClusterer.java95 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/webrtc/webrtc/modules/remote_bitrate_estimator/
Dremote_bitrate_estimator_abs_send_time.cc89 std::list<Cluster>* clusters, in AddCluster() argument
94 clusters->push_back(*cluster); in AddCluster()
123 std::list<Cluster>* clusters) const { in ComputeClusters()
138 AddCluster(clusters, &current); in ComputeClusters()
150 AddCluster(clusters, &current); in ComputeClusters()
155 const std::list<Cluster>& clusters) const { in FindBestProbe()
157 std::list<Cluster>::const_iterator best_it = clusters.end(); in FindBestProbe()
158 for (std::list<Cluster>::const_iterator it = clusters.begin(); in FindBestProbe()
159 it != clusters.end(); in FindBestProbe()
187 std::list<Cluster> clusters; in ProcessClusters() local
[all …]
Dremote_bitrate_estimator_abs_send_time.h98 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/chromium-trace/catapult/third_party/gsutil/third_party/boto/tests/unit/emr/
Dtest_connection.py103 self.assertEqual(len(response.clusters), 2)
105 self.assertTrue(isinstance(response.clusters[0], ClusterSummary))
106 self.assertEqual(response.clusters[0].name, 'analytics test')
107 self.assertEqual(response.clusters[0].normalizedinstancehours, '10')
109 self.assertTrue(isinstance(response.clusters[0].status, ClusterStatus))
110 self.assertEqual(response.clusters[0].status.state, 'TERMINATED')
112 self.assertTrue(isinstance(response.clusters[0].status.timeline, ClusterTimeline))
114 … self.assertEqual(response.clusters[0].status.timeline.creationdatetime, '2014-01-24T01:21:21Z')
115 self.assertEqual(response.clusters[0].status.timeline.readydatetime, '2014-01-24T01:25:26Z')
116 self.assertEqual(response.clusters[0].status.timeline.enddatetime, '2014-01-24T02:19:46Z')
[all …]
/external/harfbuzz_ng/util/
Dhelper-cairo.cc467 l->clusters = cairo_text_cluster_allocate (l->num_clusters); in helper_cairo_line_from_buffer()
472 (l->num_clusters && !l->clusters)) in helper_cairo_line_from_buffer()
495 memset ((void *) l->clusters, 0, l->num_clusters * sizeof (l->clusters[0])); in helper_cairo_line_from_buffer()
500 l->clusters[cluster].num_glyphs++; in helper_cairo_line_from_buffer()
509 l->clusters[cluster].num_bytes = end - start; in helper_cairo_line_from_buffer()
513 l->clusters[cluster].num_glyphs++; in helper_cairo_line_from_buffer()
515 l->clusters[cluster].num_bytes = l->utf8 + text_len - start; in helper_cairo_line_from_buffer()
524 l->clusters[cluster].num_bytes = end - start; in helper_cairo_line_from_buffer()
528 l->clusters[cluster].num_glyphs++; in helper_cairo_line_from_buffer()
530 l->clusters[cluster].num_bytes = l->utf8 + text_len - start; in helper_cairo_line_from_buffer()
Dhelper-cairo.hh58 cairo_text_cluster_t *clusters; member
65 if (clusters) in finish()
66 cairo_text_cluster_free (clusters); in finish()
Dview-cairo.cc124 l.clusters, l.num_clusters, in render()
/external/opencv3/modules/flann/include/opencv2/flann/
Dkmeans_index.h538 KMeansNodePtr* clusters = new KMeansNodePtr[numClusters]; in getClusterCenters() local
540 int clusterCount = getMinVarianceClusters(root_, clusters, numClusters, variance); in getClusterCenters()
545 DistanceType* center = clusters[i]->pivot; in getClusterCenters()
550 delete[] clusters; in getClusterCenters()
1060 …int getMinVarianceClusters(KMeansNodePtr root, KMeansNodePtr* clusters, int clusters_length, Dista… in getMinVarianceClusters() argument
1063 clusters[0] = root; in getMinVarianceClusters()
1072 if (clusters[i]->childs != NULL) { in getMinVarianceClusters()
1074 DistanceType variance = meanVariance - clusters[i]->variance*clusters[i]->size; in getMinVarianceClusters()
1077 variance += clusters[i]->childs[j]->variance*clusters[i]->childs[j]->size; in getMinVarianceClusters()
1092 KMeansNodePtr toSplit = clusters[splitIndex]; in getMinVarianceClusters()
[all …]
/external/webp/src/enc/
Dhistogram.c662 int* const clusters = WebPSafeMalloc(image_histo_size, sizeof(*clusters)); in HistogramCombineGreedy() local
666 if (!HistoQueueInit(&histo_queue, image_histo_size) || clusters == NULL) { in HistogramCombineGreedy()
672 clusters[i] = i; in HistogramCombineGreedy()
689 if (clusters[i] >= idx2) { in HistogramCombineGreedy()
690 clusters[i] = clusters[i + 1]; in HistogramCombineGreedy()
716 if (clusters[i] != idx1) { in HistogramCombineGreedy()
717 PreparePair(histograms, idx1, clusters[i], in HistogramCombineGreedy()
725 if (i != clusters[i]) { // swap the two histograms in HistogramCombineGreedy()
726 HistogramSwap(&histograms[i], &histograms[clusters[i]]); in HistogramCombineGreedy()
734 WebPSafeFree(clusters); in HistogramCombineGreedy()
/external/libvpx/libvpx/third_party/libwebm/
DRELEASE.TXT3 * Handled empty clusters
4 * Handled empty clusters when seeking
Dmkvparser.cpp4827 Cluster** const clusters = m_pSegment->m_clusters; in Seek() local
4828 assert(clusters); in Seek()
4833 Cluster** const i = clusters + pCluster->GetIndex(); in Seek()
4838 Cluster** const j = clusters + count; in Seek()
5117 Cluster** const clusters = m_pSegment->m_clusters; in Seek() local
5118 assert(clusters); in Seek()
5123 Cluster** const i = clusters + pCluster->GetIndex(); in Seek()
5128 Cluster** const j = clusters + count; in Seek()
Dmkvmuxer.cpp2952 Cluster** const clusters = in MakeNewCluster() local
2954 if (!clusters) in MakeNewCluster()
2958 clusters[i] = cluster_list_[i]; in MakeNewCluster()
2963 cluster_list_ = clusters; in MakeNewCluster()
/external/chromium-trace/catapult/third_party/gsutil/third_party/boto/tests/integration/redshift/
Dtest_layer1.py100 clusters = self.api.describe_clusters()['DescribeClustersResponse']\
103 cluster_ids = [c['ClusterIdentifier'] for c in clusters]
/external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/ec2containerservice/
Dlayer1.py173 def describe_clusters(self, clusters=None): argument
184 if clusters is not None:
186 clusters,
/external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/emr/
Demrobject.py322 self.clusters = None
326 self.clusters = ResultSet([('member', ClusterSummary)])
327 return self.clusters
/external/opencv3/doc/py_tutorials/py_ml/
Dpy_table_of_contents_ml.markdown15 Learn to use K-Means Clustering to group data to a number of clusters.
/external/opencv3/modules/calib3d/src/
Dcirclesgrid.cpp100 std::vector<std::list<size_t> > clusters(points.size()); in hierarchicalClustering() local
103 clusters[i].push_back(i); in hierarchicalClustering()
107 while(clusters[patternClusterIdx].size() < pn) in hierarchicalClustering()
121 clusters[minIdx].splice(clusters[minIdx].end(), clusters[maxIdx]); in hierarchicalClustering()
126 if(clusters[patternClusterIdx].size() != static_cast<size_t>(patternSz.area())) in hierarchicalClustering()
131 patternPoints.reserve(clusters[patternClusterIdx].size()); in hierarchicalClustering()
132 …for(std::list<size_t>::iterator it = clusters[patternClusterIdx].begin(); it != clusters[patternCl… in hierarchicalClustering()
1123 std::vector<std::vector<Point2f> > clusters(2), hulls(2); in findBasis() local
1134 clusters[idx].push_back(basis[idx] + parameters.convexHullFactor * (samples[k] - basis[idx])); in findBasis()
1139 convexHull(Mat(clusters[i]), hulls[i]); in findBasis()
/external/opencv3/doc/py_tutorials/py_ml/py_kmeans/py_kmeans_opencv/
Dpy_kmeans_opencv.markdown16 -# **nclusters(K)** : Number of clusters required at end
37 -# **centers** : This is array of centers of clusters.
83 depending on their centroids. Now we split the data to different clusters depending on their labels.
172 # define criteria, number of clusters(K) and apply kmeans()
/external/harfbuzz_ng/docs/
DMakefile.am76 usermanual-clusters.xml \
/external/skia/site/dev/testing/
Dskiaperf.md13 clustering](https://perf.skia.org/clusters/).
Dskiagold.md54 * Click on one of the clusters including your CL to triage
/external/iptables/extensions/
Dlibxt_cluster.man1 Allows you to deploy gateway and back-end load-sharing clusters without the
/external/icu/icu4c/source/data/translit/
DLatin_Bopomofo.txt40 #--- clusters with initial consonant ----
1363 #--- clusters with a single pinyin consonant that can apear in other clusters ----
/external/libvpx/libwebm/mkvparser/
Dmkvparser.cc4826 Cluster** const clusters = m_pSegment->m_clusters; in Seek() local
4827 assert(clusters); in Seek()
4832 Cluster** const i = clusters + pCluster->GetIndex(); in Seek()
4837 Cluster** const j = clusters + count; in Seek()
5335 Cluster** const clusters = m_pSegment->m_clusters; in Seek() local
5336 assert(clusters); in Seek()
5341 Cluster** const i = clusters + pCluster->GetIndex(); in Seek()
5346 Cluster** const j = clusters + count; in Seek()

123