| /external/chromium_org/third_party/libvpx/source/libvpx/ |
| webmdec.h | 25 const void *cluster; member in struct:WebmInputContext
|
| webmdec.cc | 38 webm_ctx->cluster = NULL;
49 const mkvparser::Cluster *const cluster = segment->GetFirst(); member in class:__anon17856::mkvparser
50 webm_ctx->cluster = cluster;
125 const mkvparser::Cluster* cluster = local
126 reinterpret_cast<const mkvparser::Cluster*>(webm_ctx->cluster);
136 status = cluster->GetFirst(block_entry)
[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...] |
| /external/chromium_org/third_party/harfbuzz-ng/src/ |
| hb-buffer.h | 47 uint32_t cluster; member in struct:hb_glyph_info_t
233 unsigned int cluster);
287 /* Reorders a glyph buffer to have canonical in-cluster glyph order / position.
|
| hb-buffer.cc | 216 unsigned int cluster)
227 glyph->cluster = cluster;
436 if (cluster_start <= info[i].cluster && info[i].cluster < cluster_end)
489 last_cluster = info[0].cluster;
491 if (last_cluster != info[i].cluster) {
494 last_cluster = info[i].cluster;
511 unsigned int cluster = info[start].cluster; local
543 unsigned int cluster = out_info[start].cluster; local
[all...] |
| hb-graphite2.cc | 212 unsigned int cluster; member in struct:hb_graphite2_cluster_t
303 clusters[0].cluster = buffer->info[0].cluster;
321 c->cluster = buffer->info[c->base_char].cluster;
341 info->cluster = clusters[i].cluster;
|
| hb-uniscribe.cc | 770 unsigned int cluster = buffer->info[i].cluster; local
771 log_clusters[chars_len++] = cluster;
773 log_clusters[chars_len++] = cluster; /* Surrogates. */
967 *p = MIN (*p, buffer->info[i].cluster);
987 info->cluster = vis_clusters[i];
|
| hb-coretext.cc | 438 * B1 M1 B2 M2, and B1-B2 form a ligature, M2's cluster will
440 * cluster... */
633 unsigned int cluster = buffer->info[i].cluster; local
634 log_clusters[chars_len++] = cluster;
636 log_clusters[chars_len++] = cluster; /* Surrogates. */
1029 unsigned int cluster = info[count - 1].cluster; local
1038 unsigned int cluster = info[0].cluster; local
[all...] |
| /external/harfbuzz_ng/src/ |
| hb-buffer.h | 47 uint32_t cluster; member in struct:hb_glyph_info_t
233 unsigned int cluster);
287 /* Reorders a glyph buffer to have canonical in-cluster glyph order / position.
|
| hb-buffer.cc | 216 unsigned int cluster)
227 glyph->cluster = cluster;
436 if (cluster_start <= info[i].cluster && info[i].cluster < cluster_end)
489 last_cluster = info[0].cluster;
491 if (last_cluster != info[i].cluster) {
494 last_cluster = info[i].cluster;
511 unsigned int cluster = info[start].cluster; local
543 unsigned int cluster = out_info[start].cluster; local
[all...] |
| hb-graphite2.cc | 212 unsigned int cluster; member in struct:hb_graphite2_cluster_t
303 clusters[0].cluster = buffer->info[0].cluster;
321 c->cluster = buffer->info[c->base_char].cluster;
341 info->cluster = clusters[i].cluster;
|
| hb-uniscribe.cc | 769 unsigned int cluster = buffer->info[i].cluster; local
770 log_clusters[chars_len++] = cluster;
772 log_clusters[chars_len++] = cluster; /* Surrogates. */
967 *p = MIN (*p, buffer->info[i].cluster);
988 info->cluster = vis_clusters[i];
|
| /external/fio/engines/ |
| rbd.c | 18 rados_t cluster; member in struct:rbd_data
99 r = rados_create(&(rbd_data->cluster), o->client_name);
105 r = rados_conf_read_file(rbd_data->cluster, NULL);
111 r = rados_connect(rbd_data->cluster);
117 r = rados_ioctx_create(rbd_data->cluster, o->pool_name,
135 rados_shutdown(rbd_data->cluster);
156 if (rbd_data->cluster) {
157 rados_shutdown(rbd_data->cluster);
158 rbd_data->cluster = NULL;
340 /* log version of librbd. No cluster connection required. *
[all...] |
| /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 | 441 if (hb_glyph[i].cluster != hb_glyph[i-1].cluster)
474 unsigned int cluster = 0; local
476 l->clusters[cluster].num_glyphs++;
479 if (hb_glyph[i].cluster != hb_glyph[i+1].cluster) {
480 g_assert (hb_glyph[i].cluster > hb_glyph[i+1].cluster);
482 end = start + hb_glyph[i].cluster - hb_glyph[i+1].cluster;
[all...] |
| /frameworks/av/media/libstagefright/webm/ |
| WebmFrameThread.cpp | 92 // Initializes a webm cluster with its starting timecode.
98 // the starting timecode of the cluster; this is the timecode of the first
102 // list to hold child elements in a webm cluster (start timecode and
124 sp<WebmElement> cluster = new WebmMaster(kMkvCluster, children); local
125 cluster->write(mFd, size);
129 // Write out (possibly multiple) webm cluster(s) from frames split on video key frames.
148 // frame (the last frame), which belongs to the next cluster; also hold back on
231 ALOGV("flushing last cluster (size %zu)", outstandingFrames.size());
|
| /packages/providers/DownloadProvider/src/com/android/providers/downloads/ |
| DownloadNotifier.java | 128 // Cluster downloads together
137 // Build notification for each cluster
140 final Collection<DownloadInfo> cluster = clustered.get(tag); local
146 // Use time when cluster was first shown to avoid shuffling
172 getDownloadIds(cluster));
178 final DownloadInfo info = cluster.iterator().next();
196 getDownloadIds(cluster));
213 for (DownloadInfo info : cluster) {
241 if (cluster.size() == 1) {
242 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 | 32 // Support class to hold information about each cluster of pixel data in
34 // that exist in the cluster, it keeps track of the aggregate sum so it can
65 // Recomputes the centroid of the cluster based on the aggregate data. The
97 // if the centroid of the cluster has moved. This determines whether or
110 // of the cluster for sorting.
123 // Holds the sum of all the points that make up this cluster. Used to
128 // The weight of the cluster, determined by how many points were used
231 // Pick a starting point for each cluster
232 std::vector<KMeanCluster>::iterator cluster = clusters.begin(); local
233 while (cluster != clusters.end())
[all...] |
| /external/e2fsprogs/e2fsck/ |
| pass1b.c | 57 blk64_t cluster; member in struct:cluster_el
93 static int check_if_fs_cluster(e2fsck_t ctx, blk64_t cluster);
119 static void add_dupe(e2fsck_t ctx, ext2_ino_t ino, blk64_t cluster,
128 n = dict_lookup(&clstr_dict, INT_TO_VOIDPTR(cluster));
133 sizeof(struct dup_cluster), "duplicate cluster header");
136 dict_alloc_insert(&clstr_dict, INT_TO_VOIDPTR(cluster), db);
163 sizeof(struct cluster_el), "cluster element");
164 cluster_el->cluster = cluster;
189 * Free a duplicate cluster recor
[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.
246 Cluster l;
268 /** \brief Find cluster in #m_clusters containing some value
270 * \returns Iterator to cluster containing \c key, o
325 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...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| TextAutosizer.cpp | 84 void TextAutosizer::writeClusterDebugInfo(Cluster* cluster)
87 if (cluster->m_flags & SUPPRESSING) {
89 } else if (!(cluster->m_flags & (INDEPENDENT | WIDER_OR_NARROWER))) {
91 } else if (cluster->m_supercluster) {
93 } else if (!clusterHasEnoughTextToAutosize(cluster)) {
96 const RenderBlock* widthProvider = clusterWidthProvider(cluster->m_root);
97 if (cluster->m_hasTableAncestor && cluster->m_multiplier < multiplierFromBlock(widthProvider)) {
105 if (cluster->m_root->isRenderView())
397 Cluster* cluster = currentCluster(); local
440 Cluster* cluster = currentCluster(); local
[all...] |
| /external/chromium_org/media/filters/ |
| chunk_demuxer_unittest.cc | 149 // Default cluster to append first for simple tests.
150 scoped_ptr<Cluster> kDefaultFirstCluster() {
154 // Default cluster to append after kDefaultFirstCluster()
155 // has been appended. This cluster starts with blocks that
159 scoped_ptr<Cluster> kDefaultSecondCluster() {
369 scoped_ptr<Cluster> cluster) {
370 AppendData(source_id, cluster->data(), cluster->size());
373 void AppendCluster(scoped_ptr<Cluster> cluster)
3016 scoped_ptr<Cluster> cluster = GenerateCluster(0, 2); local
3729 scoped_ptr<Cluster> cluster = GenerateCluster(0, 0, 4, true); local
[all...] |
| /external/chromium_org/third_party/libvpx/source/libvpx/third_party/libwebm/ |
| mkvmuxer.cpp | 1982 Cluster* const cluster = cluster_list_[i]; local
2233 const Cluster* const cluster = cluster_list_[cluster_list_size_ - 1]; local
2302 Cluster* const cluster = cluster_list_[cluster_list_size_ - 1]; local
2361 Cluster* const cluster = cluster_list_[cluster_list_size_ - 1]; local
2422 Cluster* const cluster = cluster_list_[cluster_list_size_ - 1]; local
2464 Cluster* const cluster = cluster_list_[cluster_list_size_ - 1]; local
2797 Cluster*& cluster = cluster_list_[cluster_list_size_]; local
2914 Cluster* const cluster = cluster_list_[i]; local
2960 Cluster* const cluster = cluster_list_[cluster_list_size_ - 1]; local
3012 Cluster* const cluster = cluster_list_[cluster_list_size_ - 1]; local
[all...] |
