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

1 2

  /packages/providers/ContactsProvider/src/com/android/providers/contacts/aggregation/util/
CommonNicknameCache.java 101 String[] clusters = null; local
108 clusters = ref.get();
112 if (clusters == null) {
113 clusters = loadNicknameClusters(normalizedName);
114 ref = clusters == null ? null : new SoftReference<String[]>(clusters);
119 return clusters;
133 String[] clusters = null; local
140 clusters = new String[count];
143 clusters[i] = cursor.getString(NicknameLookupQuery.CLUSTER)
    [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 58 cairo_text_cluster_t *clusters; member in struct:helper_cairo_line_t
65 if (clusters)
66 cairo_text_cluster_free (clusters);
helper-cairo.cc 467 l->clusters = cairo_text_cluster_allocate (l->num_clusters);
472 (l->num_clusters && !l->clusters))
495 memset ((void *) l->clusters, 0, l->num_clusters * sizeof (l->clusters[0]));
500 l->clusters[cluster].num_glyphs++;
509 l->clusters[cluster].num_bytes = end - start;
513 l->clusters[cluster].num_glyphs++;
515 l->clusters[cluster].num_bytes = l->utf8 + text_len - start;
524 l->clusters[cluster].num_bytes = end - start;
528 l->clusters[cluster].num_glyphs++
    [all...]
view-cairo.cc 124 l.clusters, l.num_clusters,
  /external/harfbuzz_ng/src/
hb-graphite2.cc 305 ALLOCATE_ARRAY (hb_graphite2_cluster_t, clusters, buffer->len);
310 memset (clusters, 0, sizeof (clusters[0]) * buffer->len);
313 clusters[0].cluster = buffer->info[0].cluster;
318 clusters[0].advance = gr_seg_advance_X(seg) - curradv;
326 while (clusters[ci].base_char > before && ci)
328 clusters[ci-1].num_chars += clusters[ci].num_chars;
329 clusters[ci-1].num_glyphs += clusters[ci].num_glyphs
    [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/chromium-trace/catapult/third_party/gsutil/third_party/boto/tests/unit/emr/
test_connection.py 49 <Clusters>
84 </Clusters>
103 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'
    [all...]
  /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/tests/integration/redshift/
test_layer1.py 42 # Redshift was taking ~20 minutes to bring clusters up in testing.
100 clusters = self.api.describe_clusters()['DescribeClustersResponse']\
102 ['Clusters']
103 cluster_ids = [c['ClusterIdentifier'] for c in clusters]
109 ['DescribeClustersResult']['Clusters'][0]\
  /packages/providers/ContactsProvider/src/com/android/providers/contacts/
NameLookupBuilder.java 88 * clusters, e.g. Leo could be Leonard or Leopold.
133 // Phase I: insert all variants not involving nickname clusters
299 * For all tokens that correspond to nickname clusters, substitutes each cluster key
305 String[] clusters = mNicknameClusters[i]; local
306 if (clusters != null) {
308 for (int j = 0; j < clusters.length; j++) {
309 mNames[i] = clusters[j];
314 // Repeat recursively for other nickname clusters
  /external/opencv3/modules/flann/include/opencv2/flann/
kmeans_index.h 525 * tree and return the clusters centers of that clustering.
527 * numClusters = number of clusters to have in the clustering computed
534 throw FLANNException("Number of clusters must be at least 1");
538 KMeansNodePtr* clusters = new KMeansNodePtr[numClusters]; local
540 int clusterCount = getMinVarianceClusters(root_, clusters, numClusters, variance);
542 Logger::info("Clusters requested: %d, returning %d\n",numClusters, clusterCount);
545 DistanceType* center = clusters[i]->pivot;
550 delete[] clusters;
712 * TODO: for 1-sized clusters don't store a cluster center (it's the same as the single cluster point)
756 // assign points to clusters
    [all...]
  /packages/apps/Gallery2/src/com/android/gallery3d/data/
LocationClustering.java 99 ArrayList<ArrayList<SmallItem>> clusters = new ArrayList<ArrayList<SmallItem>>(); local
110 clusters.add(new ArrayList<SmallItem>());
114 clusters.get(index[i]).add(withLatLong.get(i));
122 for (ArrayList<SmallItem> cluster : clusters) {
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/
ClipboardSupport.java 210 // Segment the deleted nodes into clusters of siblings
211 Map<NodeProxy, List<INode>> clusters =
220 List<INode> children = clusters.get(parent);
223 clusters.put((NodeProxy) parent, children);
231 for (Map.Entry<NodeProxy, List<INode>> entry : clusters.entrySet()) {
  /external/webp/src/enc/
histogram.c 662 int* const clusters = WebPSafeMalloc(image_histo_size, sizeof(*clusters)); local
666 if (!HistoQueueInit(&histo_queue, image_histo_size) || clusters == NULL) {
671 // Initialize clusters indexes.
672 clusters[i] = i;
689 if (clusters[i] >= idx2) {
690 clusters[i] = clusters[i + 1];
716 if (clusters[i] != idx1) {
717 PreparePair(histograms, idx1, clusters[i]
    [all...]
  /frameworks/ml/bordeaux/service/src/android/bordeaux/services/
ClusterManager.java 31 * ClusterManager incrementally indentify representitve clusters from the input location
32 * stream. Clusters are updated online using leader based clustering algorithm. The input
33 * locations initially are kept by the clusters. Periodially, a cluster consolidating
45 // Consoliate location clusters (and check for new semantic clusters)
122 ", number of clusters: " + mLocationClusters.size());
140 // if it is far away from all existing clusters, create a new cluster.
181 // merge clusters whose regions are overlapped. note that after merge
194 Log.v(TAG, mLocationClusters.size() + " location clusters after consolidate");
197 // clusters are foun
330 ArrayList<String> clusters = new ArrayList<String>(); local
    [all...]
  /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/ec2containerservice/
layer1.py 82 During the preview, each account is limited to two clusters.
173 def describe_clusters(self, clusters=None):
175 Describes one or more of your clusters.
177 :type clusters: list
178 :param clusters: A space-separated list of cluster names or full
184 if clusters is not None:
186 clusters,
187 'clusters.member')
291 Returns a list of existing clusters.
  /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/emr/
emrobject.py 322 self.clusters = None
325 if name == 'Clusters':
326 self.clusters = ResultSet([('member', ClusterSummary)])
327 return self.clusters
  /external/opencv3/modules/calib3d/src/
circlesgrid.cpp 100 std::vector<std::list<size_t> > clusters(points.size());
103 clusters[i].push_back(i);
107 while(clusters[patternClusterIdx].size() < pn)
121 clusters[minIdx].splice(clusters[minIdx].end(), clusters[maxIdx]);
126 if(clusters[patternClusterIdx].size() != static_cast<size_t>(patternSz.area()))
131 patternPoints.reserve(clusters[patternClusterIdx].size());
132 for(std::list<size_t>::iterator it = clusters[patternClusterIdx].begin(); it != clusters[patternClusterIdx].end(); it++
    [all...]
  /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/redshift/
layer1.py 36 interfaces you can use to manage Amazon Redshift clusters. Note
334 clusters, go to `Amazon Redshift Clusters`_ in the Amazon
370 + Must be unique for all clusters within an AWS account.
389 information about node types, go to ` Working with Clusters`_ in
536 Working with Clusters`_ in the Amazon Redshift Management Guide .
569 provisioning clusters in EC2-VPC, go to `Supported Platforms to
632 Creating parameter groups is independent of creating clusters.
688 groups to control access to non-VPC clusters.
    [all...]
  /external/ImageMagick/www/api/
feature.php 176 <p>MeanShiftImage() delineate arbitrarily shaped clusters in the image. For each pixel, it visits all the pixels in the neighborhood specified by the window centered at the pixel and excludes those that are outside the radius=(window-1)/2 surrounding the pixel. From those pixels, it finds those that are within the specified color distance from the current mean, and computes a new x,y centroid from those coordinates and a new mean. This new x,y centroid is used as the center for a new window. This process iterates until it converges and the final mean is replaces the (original window center) pixel value. It repeats this process for the next pixel, etc., until it processes all pixels in the image. Results are typically better with colorspaces other than sRGB. We recommend YIQ, YUV or YCbCr.</p>
  /external/libvpx/libvpx/third_party/libwebm/
mkvmuxer.cpp 2952 Cluster** const clusters = local
    [all...]
mkvparser.cpp 1055 return 1; // no more clusters
1058 return 1; // no more clusters
1266 return 1; // no more clusters
1271 return 1; // no more clusters
4827 Cluster** const clusters = m_pSegment->m_clusters; local
5117 Cluster** const clusters = m_pSegment->m_clusters; local
    [all...]
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/third_party/libwebm/
mkvmuxer.cpp 2902 Cluster** const clusters = local
    [all...]
  /external/libvpx/libwebm/mkvparser/
mkvparser.cc 1054 return 1; // no more clusters
1057 return 1; // no more clusters
1265 return 1; // no more clusters
1270 return 1; // no more clusters
4826 Cluster** const clusters = m_pSegment->m_clusters; local
5335 Cluster** const clusters = m_pSegment->m_clusters; local
    [all...]

Completed in 1672 milliseconds

1 2