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

1 2 3

  /external/chromium_org/media/formats/webm/
webm_cluster_parser_unittest.cc 48 // directs CreateCluster() to exclude BlockDuration entry from the cluster for
71 static scoped_ptr<Cluster> CreateCluster(int timecode,
103 // Creates a Cluster with one encrypted Block. |bytes_to_write| is number of
105 static scoped_ptr<Cluster> CreateEncryptedCluster(int bytes_to_write) {
285 // back too to keep the timestamps emitted for a cluster monotonically
331 9, // Cluster end emits all buffers and 3rd video's duration is estimated
337 // Iteratively create a cluster containing the first N+1 blocks and parse all
338 // but the last byte of the cluster (except when N==|block_count|, just parse
339 // the whole cluster). Verify that the corresponding entry in
346 // cluster, build a cluster with exactly one additional block so tha
    [all...]
webm_parser_unittest.cc 39 static scoped_ptr<Cluster> CreateCluster(int block_count) {
71 0x1F, 0x43, 0xB6, 0x75, 0x80 // CLUSTER (size = 0)
87 0x1F, 0x43, 0xB6, 0x75, 0x80, // CLUSTER (size = 0)
106 0x1F, 0x43, 0xB6, 0x75, 0x81, // CLUSTER (size = 1)
123 0x1F, 0x43, 0xB6, 0x75, 0x81, 0x11 // CLUSTER (size = 1)
134 // Expecting to parse a Cluster, but get a Segment.
160 // known-sized cluster causes parse error.
163 0x1F, 0x43, 0xB6, 0x75, 0x85, // CLUSTER (size = 5)
175 // Verify that EBMLHEADER ends a preceding "unknown"-sized CLUSTER.
178 0x1F, 0x43, 0xB6, 0x75, 0xFF, // CLUSTER (size = unknown; really 0 due to:
    [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/third_party/libvpx/source/libvpx/
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...]
webmdec.h 25 const void *cluster; member in struct:WebmInputContext
  /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...]
  /external/chromium_org/third_party/harfbuzz-ng/src/
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-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...]
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-deserialize-text.hh 389 { if (!parse_uint (tok, p, &info.cluster )) return false; }
433 { if (!parse_uint (tok, p, &info.cluster )) return false; }
510 { if (!parse_uint (tok, p, &info.cluster )) return false; }
  /external/harfbuzz_ng/src/
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-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?
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-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.
  /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/kernel-headers/original/uapi/linux/
tipc.h 63 unsigned int cluster,
66 return (zone << 24) | (cluster << 12) | node;
  /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/chromium_org/chrome/tools/
history-viz.py 120 cluster = pred(obj)
121 clusters[cluster] = clusters.get(cluster, [])
122 clusters[cluster].append(obj)
187 # Cluster all URLs under this host if it has more than one entry.
194 # Cluster all URLs under this host if it has more than one entry.
197 print ' subgraph cluster%d%d {' % (i, j)
  /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/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/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...]
  /external/libvpx/libvpx/third_party/libwebm/
mkvmuxer.cpp 2093 Cluster* const cluster = cluster_list_[i]; local
2348 const Cluster* const cluster = cluster_list_[cluster_list_size_-1]; local
2422 Cluster* const cluster = cluster_list_[cluster_list_size_ - 1]; local
2488 Cluster* const cluster = cluster_list_[cluster_list_size_ - 1]; local
2556 Cluster* const cluster = cluster_list_[cluster_list_size_ - 1]; local
2603 Cluster* const cluster = cluster_list_[cluster_list_size_-1]; local
2957 Cluster*& cluster = cluster_list_[cluster_list_size_]; local
3075 Cluster* const cluster = cluster_list_[i]; local
3121 Cluster* const cluster = cluster_list_[cluster_list_size_-1]; local
3178 Cluster* const cluster = cluster_list_[cluster_list_size_-1]; local
    [all...]

Completed in 954 milliseconds

1 2 3