| /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.h | 81 static bool containerContainsOneOfTags(const RenderBlock* cluster, const Vector<QualifiedName>& tags);
91 static const RenderBlock* findDeepestBlockContainingAllText(const RenderBlock* cluster);
94 // belong to any cluster.
97 // Returns groups of narrow descendants of a given autosizing cluster. The groups are combined
98 // by the difference between the width of the descendant and the width of the parent cluster's
|
| /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...] |
| /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...] |
| BaseCluster.java | 114 * This computes the distance from loation to the cluster center in meter.
120 public float distanceToCluster(BaseCluster cluster) {
121 return (float) computeDistance(mCenter, cluster.mCenter);
124 public void absorbCluster(BaseCluster cluster) {
125 averageCenter(cluster.mCenter, cluster.mDuration);
126 absorbHistogram(cluster);
129 public void setCluster(BaseCluster cluster) {
131 mCenter[i] = cluster.mCenter[i];
134 mHistogram.putAll(cluster.mHistogram)
[all...] |
| IAggregatorManager.aidl | 30 boolean setFakeLocation(in String cluster);
|
| LocationCluster.java | 70 // update cluster center
94 // centers. Note that if the cluster is consolidated for the first time,
95 // the weight for the existing cluster would be zero.
112 * if the new created cluster whose covered area overlaps with any existing
113 * cluster move the center away from that cluster till there is no overlap.
115 public void moveAwayCluster(LocationCluster cluster, float distance) {
120 dot += mCenter[i] * cluster.mCenter[i];
124 vector[i] = mCenter[i] - dot * cluster.mCenter[i];
131 mCenter[i] = cluster.mCenter[i] * Math.cos(radian)
[all...] |
| /system/extras/fatblock/ |
| fat.c | 27 void fat_dirent_set_first_cluster(struct fat_dirent *de, cluster_t cluster)
31 de->first_cluster_hi = htole16((cluster >> 16) & 0xffff);
32 de->first_cluster_lo = htole16((cluster >> 0) & 0xffff);
|
| /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...] |
| /external/chromium_org/media/webm/ |
| webm_cluster_parser_unittest.cc | 51 static scoped_ptr<Cluster> CreateCluster(int timecode,
76 // Creates a Cluster with one encrypted Block. |bytes_to_write| is number of
78 static scoped_ptr<Cluster> CreateEncryptedCluster(int bytes_to_write) {
223 scoped_ptr<Cluster> cluster(CreateCluster(0, kDefaultBlockInfo, block_count));
225 // Send slightly less than the full cluster so all but the last block is
227 int result = parser_->Parse(cluster->data(), cluster->size() - 1);
229 EXPECT_LT(result, cluster->size());
234 // Now parse a whole cluster to verify that all the blocks will get parsed
[all...] |
| webm_parser_unittest.cc | 39 static scoped_ptr<Cluster> CreateCluster(int block_count) {
71 0x1F, 0x43, 0xB6, 0x75, 0x80 // CLUSTER (size = 0)
88 0x1F, 0x43, 0xB6, 0x75, 0x80, // CLUSTER (size = 0)
108 0x1F, 0x43, 0xB6, 0x75, 0x81, // CLUSTER (size = 1)
127 0x1F, 0x43, 0xB6, 0x75, 0x81, 0x11 // CLUSTER (size = 1)
140 // Expecting to parse a Cluster, but get a Segment.
174 0x1F, 0x43, 0xB6, 0x75, 0x8A, // CLUSTER (size = 10)
194 scoped_ptr<Cluster> cluster(CreateCluster(kBlockCount));
198 int result = parser.Parse(cluster->data(), cluster->size())
[all...] |
| /external/chromium_org/third_party/harfbuzz-ng/src/ |
| 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...] |
| /external/harfbuzz_ng/src/ |
| 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...] |
| hb-buffer-deserialize-json.rl | 63 action parse_cluster { if (!parse_uint (tok, p, &info.cluster )) return false; }
82 cluster = "\"cl\"" colon (unum >tok %parse_cluster);
88 element = glyph | cluster | xoffset | yoffset | xadvance | yadvance;
|
| hb-buffer-deserialize-text.rl | 62 action parse_cluster { if (!parse_uint (tok, p, &info.cluster )) return false; }
75 cluster = '=' (unum >tok %parse_cluster);
81 cluster?
|
| /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/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 );
|
| /packages/apps/Gallery2/src/com/android/gallery3d/data/ |
| FaceClustering.java | 106 FaceCluster cluster = map.get(face);
107 if (cluster == null) {
108 cluster = new FaceCluster(face.getName());
109 map.put(face, cluster);
111 cluster.add(item, j);
|
| /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...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/ |
| tipc.h | 63 unsigned int cluster,
66 return (zone << 24) | (cluster << 12) | node;
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| tipc.h | 63 unsigned int cluster,
66 return (zone << 24) | (cluster << 12) | node;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| tipc.h | 63 unsigned int cluster,
66 return (zone << 24) | (cluster << 12) | node;
|
