Searched defs:cluster (Results 1 - 19 of 19) sorted by relevance

/external/chromium_org/third_party/harfbuzz-ng/src/
H A Dhb-buffer.h47 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.
H A Dhb-buffer.cc201 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
200 add(hb_codepoint_t codepoint, unsigned int cluster) argument
482 unsigned int cluster = out_info[start].cluster; local
[all...]
/external/harfbuzz/src/
H A Dharfbuzz-buffer.c175 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;
H A Dharfbuzz-buffer.h42 HB_UInt cluster; member in struct:HB_GlyphItemRec_
94 HB_UInt cluster );
/external/harfbuzz_ng/src/
H A Dhb-buffer.h47 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.
H A Dhb-buffer.cc201 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
200 add(hb_codepoint_t codepoint, unsigned int cluster) argument
482 unsigned int cluster = out_info[start].cluster; local
[all...]
/external/harfbuzz_ng/src/hb-old/
H A Dharfbuzz-buffer.c175 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;
H A Dharfbuzz-buffer.h42 HB_UInt cluster; member in struct:HB_GlyphItemRec_
94 HB_UInt cluster );
/external/harfbuzz_ng/test/api/
H A Dtest-buffer.c196 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/
H A Dhelper-cairo.cc413 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/third_party/WebKit/Source/core/rendering/
H A DTextAutosizer.cpp50 // 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
570 findDeepestBlockContainingAllText(const RenderBlock* cluster) argument
[all...]
/external/chromium_org/ui/gfx/
H A Dcolor_analysis.cc28 // 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 !
[all...]
/external/eigen/unsupported/Eigen/src/MatrixFunctions/
H A DMatrixFunction.h167 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.
267 /** \brief Find cluster in #m_clusters containing some value
269 * \returns Iterator to cluster containing \c key, or
270 * \c m_clusters.end() if no cluster in m_clusters contains \c key.
295 for (typename ListOfClusters::const_iterator cluster = m_clusters.begin(); cluster !
324 Index cluster = m_eivalToCluster[i]; local
[all...]
/external/qemu/block/
H A Dqcow2-refcount.c114 * 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 offse
1146 uint64_t offset, cluster; local
[all...]
H A Dvvfat.c284 /* begin is the first cluster, end is the last+1 */
293 * - the next cluster of the directory for a directory, and
340 unsigned char* cluster; /* points to current cluster */ member in struct:BDRVVVFATState
537 static inline void fat_set(BDRVVVFATState* s,unsigned int cluster,uint32_t value) argument
540 uint32_t* entry=array_get(&(s->fat),cluster);
543 uint16_t* entry=array_get(&(s->fat),cluster);
546 int offset = (cluster*3/2);
548 switch (cluster&1) {
561 static inline uint32_t fat_get(BDRVVVFATState* s,unsigned int cluster) argument
847 unsigned int cluster; local
1357 struct { uint32_t cluster; } rename; member in struct:commit_t::__anon24219::__anon24220
1360 struct { uint32_t cluster; } mkdir; member in struct:commit_t::__anon24219::__anon24223
1384 schedule_rename(BDRVVVFATState* s, uint32_t cluster, char* new_path) argument
1412 schedule_mkdir(BDRVVVFATState* s, uint32_t cluster, char* path) argument
1519 modified_fat_get(BDRVVVFATState* s, unsigned int cluster) argument
1737 unsigned char* cluster = qemu_malloc(s->cluster_size); local
2060 uint32_t cluster = first_cluster; local
2220 char* cluster = qemu_malloc(s->cluster_size); local
[all...]
/external/chromium_org/media/filters/
H A Dchunk_demuxer_unittest.cc139 // Default cluster to append first for simple tests.
144 // Default cluster to append after kDefaultFirstCluster()
145 // has been appended. This cluster starts with blocks that
289 scoped_ptr<Cluster> cluster) {
290 AppendData(source_id, cluster->data(), cluster->size());
293 void AppendCluster(scoped_ptr<Cluster> cluster) { argument
294 AppendCluster(kSourceId, cluster.Pass());
963 // Test that Seek() completes successfully when the first cluster
996 // is in the middle of cluster
288 AppendCluster(const std::string& source_id, scoped_ptr<Cluster> cluster) argument
2326 scoped_ptr<Cluster> cluster = GenerateCluster(0, 2); local
[all...]
/external/libvpx/libvpx/nestegg/src/
H A Dnestegg.c197 struct cluster { struct
256 struct ebml_list cluster; member in struct:segment
370 E_FIELD(ID_TIMECODE, TYPE_UINT, struct cluster, timecode),
371 E_MASTER(ID_BLOCK_GROUP, TYPE_MASTER, struct cluster, block_group),
437 E_MASTER(ID_CLUSTER, TYPE_MASTER, struct segment, cluster),
1186 struct cluster * cluster; local
1284 assert(ctx->segment.cluster.tail->id == ID_CLUSTER);
1285 cluster = ctx->segment.cluster
[all...]
/external/robolectric/lib/main/
H A Dh2-1.2.147.jarMETA-INF/MANIFEST.MF META-INF/services/java.sql.Driver org/h2/api/AggregateFunction ...
/external/zxing/core/
H A Dcore.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/aztec/ ...

Completed in 337 milliseconds