| /packages/providers/ContactsProvider/src/com/android/providers/contacts/aggregation/util/ |
| CommonNicknameCache.java | 105 String[] clusters = null; local
112 clusters = ref.get();
116 if (clusters == null) {
117 clusters = loadNicknameClusters(normalizedName);
118 ref = clusters == null ? null : new SoftReference<String[]>(clusters);
123 return clusters;
137 String[] clusters = null; local
144 clusters = new String[count];
147 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 | 485 l->clusters = cairo_text_cluster_allocate (l->num_clusters);
490 (l->num_clusters && !l->clusters))
513 memset ((void *) l->clusters, 0, l->num_clusters * sizeof (l->clusters[0]));
518 l->clusters[cluster].num_glyphs++;
527 l->clusters[cluster].num_bytes = end - start;
531 l->clusters[cluster].num_glyphs++;
533 l->clusters[cluster].num_bytes = l->utf8 + text_len - start;
542 l->clusters[cluster].num_bytes = end - start;
546 l->clusters[cluster].num_glyphs++
[all...] |
| /external/harfbuzz_ng/src/ |
| hb-graphite2.cc | 307 ALLOCATE_ARRAY (hb_graphite2_cluster_t, clusters, buffer->len);
312 memset (clusters, 0, sizeof (clusters[0]) * buffer->len);
315 clusters[0].cluster = buffer->info[0].cluster;
320 clusters[0].advance = gr_seg_advance_X(seg) - curradv;
328 while (clusters[ci].base_char > before && ci)
330 clusters[ci-1].num_chars += clusters[ci].num_chars;
331 clusters[ci-1].num_glyphs += clusters[ci].num_glyphs
[all...] |
| /external/brotli/enc/ |
| cluster_inc.h | 71 uint32_t* clusters,
88 FN(BrotliCompareAndPushToQueue)(out, cluster_size, clusters[idx1],
89 clusters[idx2], max_num_pairs, &pairs[0], &num_pairs);
115 if (clusters[i] == best_idx2) {
116 memmove(&clusters[i], &clusters[i + 1],
117 (num_clusters - i - 1) * sizeof(clusters[0]));
147 FN(BrotliCompareAndPushToQueue)(out, cluster_size, best_idx1, clusters[i],
167 When called, clusters[0..num_clusters) contains the unique values from
171 size_t in_size, const uint32_t* clusters, size_t num_clusters
[all...] |
| block_splitter_inc.h | 213 uint32_t* clusters;
285 clusters = BROTLI_ALLOC(m, uint32_t, num_clusters);
288 clusters[i] = (uint32_t)i;
291 all_histograms, cluster_size, histogram_symbols, clusters, pairs,
317 &histo, &all_histograms[clusters[j]]);
320 best_out = clusters[j];
329 BROTLI_FREE(m, clusters);
|
| /external/bart/tests/ |
| test_sched_assert.py | 34 self.clusters = [self.BIG, self.LITTLE]
35 self.topology = Topology(clusters=self.clusters)
84 self.clusters = [self.big, self.little]
86 self.topology = Topology(clusters=self.clusters)
|
| /external/skia/src/core/ |
| SkTextBlobRunIterator.h | 31 uint32_t* clusters() const;
|
| /external/syslinux/libinstaller/ |
| fs.c | 58 long long clusters; local
83 clusters = dsectors / clustersize;
92 if (clusters < 0xFFF5) {
99 if (clusters >= 0xFF5)
100 return "more than 4084 clusters but claims FAT12";
102 if (clusters < 0xFF5)
103 return "less than 4084 clusters but claims FAT16";
105 return "less than 65525 clusters but claims FAT32";
113 } else if (clusters < 0x0FFFFFF5) {
124 return "impossibly large number of clusters on an FAT volume"
[all...] |
| /external/trappy/trappy/stats/ |
| Topology.py | 39 :param clusters: clusters can be defined as a
56 clusters = [CLUSTER_A, CLUSTER_B]
57 topology = Topology(clusters=clusters)
59 :type clusters: list
62 def __init__(self, clusters=[]):
66 if len(clusters):
67 self.add_to_level("cluster", clusters)
|
| /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, ¤t);
150 AddCluster(clusters, ¤t);
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/devlib/devlib/platform/ |
| __init__.py | 58 clusters = []
60 if cn not in clusters:
61 clusters.append(cn)
62 self.core_clusters.append(clusters.index(cn))
86 '(number of clusters is not 2)')
|
| /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...] |
| /frameworks/base/core/java/android/view/ |
| FocusFinder.java | 169 final ArrayList<View> clusters = mTempList; local
171 clusters.clear();
172 root.addKeyboardNavigationClusters(clusters, direction);
173 if (!clusters.isEmpty()) {
175 root, currentCluster, clusters, direction);
178 clusters.clear();
278 List<View> clusters,
282 mUserSpecifiedClusterComparator.setFocusables(clusters, root);
283 Collections.sort(clusters, mUserSpecifiedClusterComparator);
287 final int count = clusters.size()
[all...] |
| /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/skia/tools/ |
| SkShaper_primitive.cpp | 53 runBuffer.clusters[i] = SkToU32(txtPtr - utf8text);
|
| /external/trappy/tests/ |
| test_stats.py | 58 clusters = [cluster_0, cluster_1]
59 topology = Topology(clusters=clusters)
123 self.topology = Topology(clusters=[[0], [1]])
|
| /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_enc.c | 703 int* const clusters = local
704 (int*)WebPSafeMalloc(image_histo_size, sizeof(*clusters));
708 if (!HistoQueueInit(&histo_queue, image_histo_size) || clusters == NULL) {
713 // Initialize clusters indexes.
714 clusters[i] = i;
730 if (clusters[i] >= idx2) {
731 clusters[i] = clusters[i + 1];
757 if (clusters[i] != idx1) {
758 PreparePair(histograms, idx1, clusters[i]
[all...] |
| /external/syslinux/core/fs/fat/ |
| fat.c | 113 if (pcluster-2 >= sbi->clusters) {
172 if (cluster >= sbi->clusters)
729 uint32_t clusters; local
759 clusters = (total_sectors - sbi->data) >> sbi->clust_shift;
760 if (clusters <= 0xff4) {
762 } else if (clusters <= 0xfff4) {
767 if (clusters > 0x0ffffff4)
768 clusters = 0x0ffffff4; /* Maximum possible */
779 sbi->clusters = clusters;
[all...] |
| fat_fs.h | 91 uint32_t clusters; /* Total number of clusters */ member in struct:fat_sb_info
|
| /external/lisa/libs/utils/analysis/ |
| idle_analysis.py | 112 _cluster = self._platform['clusters'][cluster.lower()]
194 big_cpus = [c for c in _cpus if c in self._platform['clusters']['big']]
196 self._platform['clusters']['little']]
211 def plotClusterIdleStateResidency(self, clusters=None, pct=False):
215 both 'big' and 'LITTLE' clusters data are plotted.
218 :param clusters: name of the clusters to be plotted (all of them by
220 :type clusters: str ot list(str)
226 # Sanitize clusters
227 if clusters is None
[all...] |
