| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| FastTextAutosizer.cpp | 59 HashMap<AtomicString, OwnPtr<Cluster> >::AddResult result =
60 m_clusterForFingerprint.add(blockFingerprint, PassOwnPtr<Cluster>());
63 result.iterator->value = adoptPtr(new Cluster(blockFingerprint));
65 Cluster* cluster = result.iterator->value.get(); local
66 cluster->m_blocks.add(block);
68 m_clusterForBlock.set(block, cluster);
73 Cluster* cluster = m_clusterForBlock.take(block); local
74 if (!cluster)
96 Cluster* cluster = 0; local
[all...] |
| TextAutosizer.cpp | 50 // Represents cluster related data. Instances should not persist between calls to processSubtree.
62 // Upper limit on the difference between the width of the cluster's block containing all
63 // text and that of a narrow child before the child becomes a separate cluster.
66 // Descendants of the cluster that are narrower than the block containing all text and must be
150 // The layoutRoot could be neither a container nor a cluster, so walk up the tree till we find each of these.
155 RenderBlock* cluster = container; local
156 while (cluster && (!isAutosizingContainer(cluster) || !isIndependentDescendant(cluster)))
157 cluster = cluster->containingBlock()
[all...] |
| /external/harfbuzz/src/ |
| harfbuzz-buffer.c | 175 HB_UInt cluster )
187 glyph->cluster = cluster;
265 The cluster value for the glyph at position buffer->in_pos is used
278 HB_UInt cluster; local
292 cluster = buffer->in_string[buffer->in_pos].cluster;
304 item->cluster = cluster;
|
| harfbuzz-buffer.h | 42 HB_UInt cluster; member in struct:HB_GlyphItemRec_
94 HB_UInt cluster );
|
| /external/harfbuzz_ng/src/hb-old/ |
| harfbuzz-buffer.c | 175 HB_UInt cluster )
187 glyph->cluster = cluster;
265 The cluster value for the glyph at position buffer->in_pos is used
278 HB_UInt cluster; local
292 cluster = buffer->in_string[buffer->in_pos].cluster;
304 item->cluster = cluster;
|
| harfbuzz-buffer.h | 42 HB_UInt cluster; member in struct:HB_GlyphItemRec_
94 HB_UInt cluster );
|
| /frameworks/ml/bordeaux/service/src/android/bordeaux/services/ |
| ClusterManager.java | 33 * locations initially are kept by the clusters. Periodially, a cluster consolidating
34 * procedure is carried out to refine the cluster centers. After consolidation, the
49 // A location cluster can be labeled as a semantic cluster if it has been
125 // add the last location to cluster.
126 // first find the cluster it belongs to.
136 // add the location to the selected cluster
140 // if it is far away from all existing clusters, create a new cluster.
141 LocationCluster cluster = new LocationCluster(mLastLocation, duration); local
142 mLocationClusters.add(cluster);
241 semanticIdMap.put(cluster.getSemanticId(), cluster); local
268 BaseCluster cluster = local
[all...] |
| /external/chromium_org/third_party/harfbuzz-ng/src/ |
| hb-buffer.h | 47 uint32_t cluster; member in struct:hb_glyph_info_t
220 unsigned int cluster);
266 /* Reorders a glyph buffer to have canonical in-cluster glyph order / position.
|
| hb-buffer.cc | 215 unsigned int cluster)
226 glyph->cluster = cluster;
435 if (cluster_start <= info[i].cluster && info[i].cluster < cluster_end)
488 last_cluster = info[0].cluster;
490 if (last_cluster != info[i].cluster) {
493 last_cluster = info[i].cluster;
506 unsigned int cluster = info[start].cluster; local
534 unsigned int cluster = out_info[start].cluster; local
[all...] |
| hb-uniscribe.cc | 772 unsigned int cluster = buffer->info[i].cluster; local
773 log_clusters[chars_len++] = cluster;
775 log_clusters[chars_len++] = cluster; /* Surrogates. */
969 *p = MIN (*p, buffer->info[i].cluster);
990 info->cluster = vis_clusters[i];
|
| hb-coretext.cc | 606 unsigned int cluster = buffer->info[i].cluster; local
607 log_clusters[chars_len++] = cluster;
609 log_clusters[chars_len++] = cluster; /* Surrogates. */
696 info->cluster = string_indices[j];
722 * beginning of the reordered cluster.
725 * or the native OT backend, only that the cluster indices will be
730 unsigned int curr_cluster = buffer->info[i].cluster;
733 if (buffer->info[j - 1].cluster > curr_cluster)
734 buffer->info[j - 1].cluster = curr_cluster
[all...] |
| /external/harfbuzz_ng/src/ |
| hb-buffer.h | 47 uint32_t cluster; member in struct:hb_glyph_info_t
220 unsigned int cluster);
266 /* Reorders a glyph buffer to have canonical in-cluster glyph order / position.
|
| hb-buffer.cc | 201 unsigned int cluster)
212 glyph->cluster = cluster;
383 if (cluster_start <= info[i].cluster && info[i].cluster < cluster_end)
436 last_cluster = info[0].cluster;
438 if (last_cluster != info[i].cluster) {
441 last_cluster = info[i].cluster;
454 unsigned int cluster = info[start].cluster; local
482 unsigned int cluster = out_info[start].cluster; local
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/sound/ |
| seq_instr.h | 26 /* Instrument cluster */
28 snd_seq_instr_cluster_t cluster; member in struct:snd_seq_kcluster
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/sound/ |
| seq_instr.h | 26 /* Instrument cluster */
28 snd_seq_instr_cluster_t cluster; member in struct:snd_seq_kcluster
|
| /external/harfbuzz_ng/test/api/ |
| test-buffer.c | 196 unsigned int cluster; local
197 cluster = 1+i;
200 cluster++;
202 cluster += 3;
205 g_assert_cmphex (glyphs[i].cluster, ==, cluster);
219 * in its own cluster */
229 /* now form a cluster and test again */
230 glyphs[2].cluster = glyphs[1].cluster;
[all...] |
| /external/harfbuzz_ng/util/ |
| helper-cairo.cc | 413 if (hb_glyph[i].cluster != hb_glyph[i-1].cluster)
446 unsigned int cluster = 0; local
448 l->clusters[cluster].num_glyphs++;
451 if (hb_glyph[i].cluster != hb_glyph[i+1].cluster) {
452 g_assert (hb_glyph[i].cluster > hb_glyph[i+1].cluster);
454 end = start + hb_glyph[i].cluster - hb_glyph[i+1].cluster;
[all...] |
| /packages/providers/DownloadProvider/src/com/android/providers/downloads/ |
| DownloadNotifier.java | 127 // Cluster downloads together
136 // Build notification for each cluster
139 final Collection<DownloadInfo> cluster = clustered.get(tag); local
143 // Use time when cluster was first shown to avoid shuffling
169 getDownloadIds(cluster));
175 final DownloadInfo info = cluster.iterator().next();
193 getDownloadIds(cluster));
210 for (DownloadInfo info : cluster) {
237 if (cluster.size() == 1) {
238 final DownloadInfo info = cluster.iterator().next()
[all...] |
| /tools/external/fat32lib/src/main/java/de/waldheinz/fs/fat/ |
| Fat.java | 36 * The first cluster that really holds user data in a FAT.
225 * Returns the last free cluster that was accessed in this FAT.
227 * @return the last seen free cluster
237 long cluster = startCluster; local
238 while (!isEofCluster(entries[(int) cluster])) {
240 cluster = entries[(int) cluster];
245 cluster = startCluster;
247 while (!isEofCluster(entries[(int) cluster])) {
248 cluster = entries[(int) cluster]
[all...] |
| /external/chromium_org/ui/gfx/ |
| color_analysis.cc | 28 // Support class to hold information about each cluster of pixel data in
30 // that exist in the cluster, it keeps track of the aggregate sum so it can
61 // Recomputes the centroid of the cluster based on the aggregate data. The
93 // if the centroid of the cluster has moved. This determines whether or
106 // of the cluster for sorting.
119 // Holds the sum of all the points that make up this cluster. Used to
124 // The weight of the cluster, determined by how many points were used
225 // Pick a starting point for each cluster
226 std::vector<KMeanCluster>::iterator cluster = clusters.begin(); local
227 while (cluster != clusters.end())
[all...] |
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixFunction.h | 137 typedef std::list<Scalar> Cluster;
138 typedef std::list<Cluster> ListOfClusters;
167 DynamicIntVectorType m_eivalToCluster; /**< \brief m_eivalToCluster[i] = j means i-th ei'val is in j-th cluster */
169 DynamicIntVectorType m_blockStart; /**< \brief Row index at which block corresponding to i-th cluster starts */
170 IntVectorType m_permutation; /**< \brief Permutation which groups ei'vals in the same cluster together */
228 * # Any eigenvalue in a certain cluster is at most separation() away
229 * from another eigenvalue in the same cluster.
245 Cluster l;
267 /** \brief Find cluster in #m_clusters containing some value
269 * \returns Iterator to cluster containing \c key, o
324 Index cluster = m_eivalToCluster[i]; local
[all...] |
| /external/qemu/block/ |
| qcow2-refcount.c | 114 * Returns the refcount of the cluster given by its index. Any non-negative
115 * return value is the refcount of the cluster, negative values are -errno
186 /* Find the refcount block for the given cluster */
208 * a cluster for the new refcount block. It may also include a new refcount
558 * Increases or decreases the refcount of a given cluster by one.
561 * If the return value is non-negative, it is the new refcount of the cluster.
582 /* cluster allocation functions */
650 /* enough space in current cluster */
702 /* free the cluster */
908 fprintf(stderr, "ERROR: invalid cluster offset=0x%" PRIx64 "\n"
1146 uint64_t offset, cluster; local
[all...] |
| /frameworks/base/core/jni/android/graphics/ |
| TextLayoutCache.cpp | 665 ALOGD(" -- glyph[%d] = %d, cluster = %u, advance = %0.2f, offset.x = %0.2f, offset.y = %0.2f", i,
667 info[i].cluster,
747 size_t cluster = info[i].cluster - start; local
749 outAdvances->replaceAt(outAdvances->itemAt(cluster) + xAdvance, cluster);
[all...] |
| /frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/policy/ |
| NetworkController.java | 275 public void addSignalCluster(SignalCluster cluster) {
276 mSignalClusters.add(cluster);
277 refreshSignalCluster(cluster);
285 public void refreshSignalCluster(SignalCluster cluster) {
287 cluster.setWifiIndicators(
288 // only show wifi in the cluster if connected or if wifi-only
295 cluster.setMobileDataIndicators(
303 cluster.setMobileDataIndicators(
310 cluster.setIsAirplaneMode(mAirplaneMode, mAirplaneIconId);
314 // only show wifi in the cluster if connected or if wifi-onl
[all...] |
| /external/chromium_org/media/filters/ |
| chunk_demuxer_unittest.cc | 139 // Default cluster to append first for simple tests.
140 scoped_ptr<Cluster> kDefaultFirstCluster() {
144 // Default cluster to append after kDefaultFirstCluster()
145 // has been appended. This cluster starts with blocks that
149 scoped_ptr<Cluster> kDefaultSecondCluster() {
314 scoped_ptr<Cluster> cluster) {
315 AppendData(source_id, cluster->data(), cluster->size());
318 void AppendCluster(scoped_ptr<Cluster> cluster)
2456 scoped_ptr<Cluster> cluster = GenerateCluster(0, 2); local
[all...] |
