Home
last modified time | relevance | path

Searched refs:clusters (Results 1 - 25 of 57) sorted by relevance

123

/third_party/skia/modules/skparagraph/src/
H A DTextTabAlign.cpp83 bool TextTabAlign::leftAlignProcessTab(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, in leftAlignProcessTab() argument
89 fTabStartPos = words.width() + clusters.width() + totalFakeSpacing; in leftAlignProcessTab()
96 clusters.extend(currentCluster); in leftAlignProcessTab()
97 words.extend(clusters); in leftAlignProcessTab()
107 bool TextTabAlign::leftAlignProcessEndofWord(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, in leftAlignProcessEndofWord() argument
116 bool TextTabAlign::leftAlignProcessEndofLine(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, in leftAlignProcessEndofLine() argument
126 bool TextTabAlign::leftAlignProcessCluster(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, in leftAlignProcessCluster() argument
135 void TextTabAlign::rightAlignProcessTabBlockEnd(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters) in rightAlignProcessTabBlockEnd() argument
144 bool TextTabAlign::rightAlignProcessTab(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, in rightAlignProcessTab() argument
149 fTabEndPos = words.width() + clusters in rightAlignProcessTab()
172 rightAlignProcessEndofWord(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, SkScalar totalFakeSpacing) rightAlignProcessEndofWord() argument
194 rightAlignProcessEndofLine(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, SkScalar totalFakeSpacing) rightAlignProcessEndofLine() argument
205 rightAlignProcessCluster(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, SkScalar totalFakeSpacing) rightAlignProcessCluster() argument
216 centerAlignProcessTabBlockEnd(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters) centerAlignProcessTabBlockEnd() argument
231 centerAlignProcessTab(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, SkScalar totalFakeSpacing) centerAlignProcessTab() argument
263 centerAlignProcessEndofWord(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, SkScalar totalFakeSpacing) centerAlignProcessEndofWord() argument
291 centerAlignProcessEndofLine(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, SkScalar totalFakeSpacing) centerAlignProcessEndofLine() argument
302 centerAlignProcessCluster(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, SkScalar totalFakeSpacing) centerAlignProcessCluster() argument
[all...]
H A DTextTabAlign.h32 bool processTab(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, in processTab() argument
37 return (this->*(fTextTabFuncs->processTabFunc))(words, clusters, currentCluster, totalFakeSpacing); in processTab()
42 bool processEndofWord(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, in processEndofWord() argument
47 return (this->*(fTextTabFuncs->processEndofWordFunc))(words, clusters, currentCluster, totalFakeSpacing); in processEndofWord()
52 bool processEndofLine(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, in processEndofLine() argument
57 return (this->*(fTextTabFuncs->processEndofLineFunc))(words, clusters, currentCluster, totalFakeSpacing); in processEndofLine()
62 bool processCluster(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters, Cluster* currentCluster, in processCluster() argument
67 return (this->*(fTextTabFuncs->processClusterFunc))(words, clusters, currentCluster, totalFakeSpacing); in processCluster()
75 bool leftAlignProcessTab(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters,
77 bool leftAlignProcessEndofWord(TextWrapper::TextStretch& words, TextWrapper::TextStretch& clusters,
[all...]
H A DTextWrapper.cpp80 // we have to work with stretches - parts of clusters
234 if (fClusters.endOfWord()) { // Keep adding clusters/words in lookAhead()
263 // The only way we may go to clusters is if the word is too long or in moveForward()
387 for (auto& cluster : parent.clusters()) { in moveForward()
395 // we trust that clusters are sorted on parent in moveForward()
399 for (size_t ix = 0; ix < parent.clusters().size(); ix++) { in moveForward()
400 auto& cluster = parent.clusters()[ix]; in moveForward()
709 // Deal with placeholder clusters == runs[@size==1] in moveForward()
735 auto span = parent->clusters(); in moveForward()
833 ClusterRange clusters(fEndLin in moveForward()
[all...]
/third_party/skia/src/utils/
H A DSkShaperJSONWriter.cpp36 std::vector<uint32_t>& clusters) { in is_one_to_one()
40 if (clusters[clusterIndex] >= lastUtf8Index) { in is_one_to_one()
43 size_t utf8ClusterSize = lastUtf8Index - clusters[clusterIndex]; in is_one_to_one()
44 if (SkUTF::CountUTF8(&utf8[clusters[clusterIndex]], utf8ClusterSize) != 1) { in is_one_to_one()
47 lastUtf8Index = clusters[clusterIndex]; in is_one_to_one()
51 if (clusters.front() <= clusters.back()) { in is_one_to_one()
52 // left-to-right clusters in is_one_to_one()
53 size_t clusterCursor = clusters.size(); in is_one_to_one()
58 // right-to-left clusters in is_one_to_one()
35 is_one_to_one(const char utf8[], size_t utf8Begin, size_t utf8End, std::vector<uint32_t>& clusters) is_one_to_one() argument
130 BreakupClusters(size_t utf8Begin, size_t utf8End, SkSpan<const uint32_t> clusters, const BreakupCluastersCallback& processMToN) BreakupClusters() argument
168 VisualizeClusters(const char* utf8, size_t utf8Begin, size_t utf8End, SkSpan<const SkGlyphID> glyphIDs, SkSpan<const uint32_t> clusters, const VisualizeClustersCallback& processMToN) VisualizeClusters() argument
[all...]
H A DSkShaperJSONWriter.h41 SkSpan<const uint32_t> clusters,
52 SkSpan<const uint32_t> clusters,
/third_party/skia/modules/skparagraph/tests/
H A DSkShaperJSONWriter.cpp43 std::vector<uint32_t>& clusters) { in is_one_to_one()
47 if (clusters[clusterIndex] >= lastUtf8Index) { in is_one_to_one()
50 size_t utf8ClusterSize = lastUtf8Index - clusters[clusterIndex]; in is_one_to_one()
51 if (SkUTF::CountUTF8(&utf8[clusters[clusterIndex]], utf8ClusterSize) != 1) { in is_one_to_one()
54 lastUtf8Index = clusters[clusterIndex]; in is_one_to_one()
58 if (clusters.front() <= clusters.back()) { in is_one_to_one()
59 // left-to-right clusters in is_one_to_one()
60 size_t clusterCursor = clusters.size(); in is_one_to_one()
65 // right-to-left clusters in is_one_to_one()
42 is_one_to_one(const char utf8[], size_t utf8Begin, size_t utf8End, std::vector<uint32_t>& clusters) is_one_to_one() argument
137 BreakupClusters(size_t utf8Begin, size_t utf8End, SkSpan<const uint32_t> clusters, const BreakupClustersCallback& processMToN) BreakupClusters() argument
175 VisualizeClusters(const char* utf8, size_t utf8Begin, size_t utf8End, SkSpan<const SkGlyphID> glyphIDs, SkSpan<const uint32_t> clusters, const VisualizeClustersCallback& processMToN) VisualizeClusters() argument
[all...]
H A DSkShaperJSONWriterTest.cpp25 std::vector<uint32_t> clusters; in DEF_TEST() member
62 REPORTER_ASSERT(reporter, false, "Too many clusters"); in DEF_TEST()
68 0, oneCase.utf8Len, SkSpan(oneCase.clusters), checker); in DEF_TEST()
82 std::vector<uint32_t> clusters; in DEF_TEST() member
110 REPORTER_ASSERT(reporter, false, "Too many clusters"); in DEF_TEST()
118 SkSpan(oneCase.clusters), in DEF_TEST()
H A DSkShaperJSONWriter.h42 SkSpan<const uint32_t> clusters,
53 SkSpan<const uint32_t> clusters,
/third_party/skia/third_party/externals/harfbuzz/src/
H A Dhb-graphite2.cc316 ALLOCATE_ARRAY (hb_graphite2_cluster_t, clusters, buffer->len); in _hb_graphite2_shape()
321 memset (clusters, 0, sizeof (clusters[0]) * buffer->len); in _hb_graphite2_shape()
324 clusters[0].cluster = buffer->info[0].cluster; in _hb_graphite2_shape()
333 clusters[0].advance = gr_seg_advance_X(seg) * xscale - curradv; in _hb_graphite2_shape()
336 clusters[0].advance = 0; in _hb_graphite2_shape()
343 while (clusters[ci].base_char > before && ci) in _hb_graphite2_shape()
345 clusters[ci-1].num_chars += clusters[ci].num_chars; in _hb_graphite2_shape()
346 clusters[c in _hb_graphite2_shape()
[all...]
/third_party/node/deps/brotli/c/enc/
H A Dcluster_inc.h73 uint32_t* clusters,
90 FN(BrotliCompareAndPushToQueue)(out, cluster_size, clusters[idx1],
91 clusters[idx2], max_num_pairs, &pairs[0], &num_pairs);
117 if (clusters[i] == best_idx2) {
118 memmove(&clusters[i], &clusters[i + 1],
119 (num_clusters - i - 1) * sizeof(clusters[0]));
149 FN(BrotliCompareAndPushToQueue)(out, cluster_size, best_idx1, clusters[i],
169 When called, clusters[0..num_clusters) contains the unique values from
173 size_t in_size, const uint32_t* clusters, size_
[all...]
H A Dblock_splitter_inc.h212 uint32_t* clusters;
289 clusters = BROTLI_ALLOC(m, uint32_t, num_clusters);
290 if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(clusters)) return;
292 clusters[i] = (uint32_t)i;
295 all_histograms, cluster_size, histogram_symbols, clusters, pairs,
321 &histo, &all_histograms[clusters[j]]);
324 best_out = clusters[j];
333 BROTLI_FREE(m, clusters);
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dcluster_inc.h73 uint32_t* clusters,
90 FN(BrotliCompareAndPushToQueue)(out, cluster_size, clusters[idx1],
91 clusters[idx2], max_num_pairs, &pairs[0], &num_pairs);
117 if (clusters[i] == best_idx2) {
118 memmove(&clusters[i], &clusters[i + 1],
119 (num_clusters - i - 1) * sizeof(clusters[0]));
149 FN(BrotliCompareAndPushToQueue)(out, cluster_size, best_idx1, clusters[i],
169 When called, clusters[0..num_clusters) contains the unique values from
173 size_t in_size, const uint32_t* clusters, size_
[all...]
H A Dblock_splitter_inc.h212 uint32_t* clusters;
289 clusters = BROTLI_ALLOC(m, uint32_t, num_clusters);
290 if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(clusters)) return;
292 clusters[i] = (uint32_t)i;
295 all_histograms, cluster_size, histogram_symbols, clusters, pairs,
321 &histo, &all_histograms[clusters[j]]);
324 best_out = clusters[j];
333 BROTLI_FREE(m, clusters);
/third_party/skia/src/pdf/
H A DSkClusterator.cpp14 static bool is_reversed(const uint32_t* clusters, uint32_t count) { in is_reversed() argument
17 if (count < 2 || clusters[0] == 0 || clusters[count - 1] != 0) { in is_reversed()
21 if (clusters[i + 1] > clusters[i]) { in is_reversed()
29 : fClusters(run.clusters().data()) in SkClusterator()
/third_party/skia/modules/skplaintexteditor/src/
H A Dshape.cpp36 const uint32_t* clusters,
123 fClusters = runBuffer.clusters; in runBuffer()
130 runBuffer.clusters, in runBuffer()
189 const uint32_t* clusters, in set_character_bounds()
205 && clusters[glyphIndex] == clusters[glyphIndex + 1]) { in set_character_bounds()
208 unsigned textBegin = clusters[glyphIndex]; in set_character_bounds()
211 if (clusters[i] >= textEnd) { in set_character_bounds()
212 textEnd = clusters[i] + 1; in set_character_bounds()
216 if (clusters[ in set_character_bounds()
183 set_character_bounds(void* context, const char* utf8Text, size_t utf8TextBytes, size_t glyphCount, const SkGlyphID* glyphs, const SkPoint* positions, const uint32_t* clusters, const SkFont& font) set_character_bounds() argument
[all...]
/third_party/skia/third_party/externals/harfbuzz/util/
H A Dhelper-cairo.hh591 cairo_text_cluster_t *clusters; member
598 if (clusters) in finish()
599 cairo_text_cluster_free (clusters); in finish()
632 l->clusters = cairo_text_cluster_allocate (l->num_clusters); in helper_cairo_line_from_buffer()
637 (l->num_clusters && !l->clusters)) in helper_cairo_line_from_buffer()
660 memset ((void *) l->clusters, 0, l->num_clusters * sizeof (l->clusters[0])); in helper_cairo_line_from_buffer()
665 l->clusters[cluster].num_glyphs++; in helper_cairo_line_from_buffer()
674 l->clusters[cluster].num_bytes = end - start; in helper_cairo_line_from_buffer()
678 l->clusters[cluste in helper_cairo_line_from_buffer()
[all...]
/third_party/skia/src/core/
H A DSkGlyphRun.cpp28 SkSpan<const uint32_t> clusters, in SkGlyphRun()
32 , fClusters{clusters}
154 auto clusters = run.clusters(); in makeBlob() local
155 memcpy(buffer.clusters, clusters.data(), clusters.size_bytes()); in makeBlob()
262 SkSpan<const uint32_t>(it.clusters(), runSize), in blobToGlyphRunList()
333 SkSpan<const uint32_t> clusters, in makeGlyphRun()
343 clusters, in makeGlyphRun()
24 SkGlyphRun(const SkFont& font, SkSpan<const SkPoint> positions, SkSpan<const SkGlyphID> glyphIDs, SkSpan<const char> text, SkSpan<const uint32_t> clusters, SkSpan<const SkVector> scaledRotations) SkGlyphRun() argument
328 makeGlyphRun( const SkFont& font, SkSpan<const SkGlyphID> glyphIDs, SkSpan<const SkPoint> positions, SkSpan<const char> text, SkSpan<const uint32_t> clusters, SkSpan<const SkVector> scaledRotations) makeGlyphRun() argument
[all...]
H A DSkGlyphRun.h35 SkSpan<const uint32_t> clusters,
45 SkSpan<const uint32_t> clusters() const { return fClusters; } in clusters() function in SkGlyphRun
55 // Original clusters from SkTextBlob if present. Will be empty if not present.
148 SkSpan<const uint32_t> clusters,
/third_party/skia/tests/
H A DSkShaperJSONWriterTest.cpp25 std::vector<uint32_t> clusters; in DEF_TEST() member
62 REPORTER_ASSERT(reporter, false, "Too many clusters"); in DEF_TEST()
68 0, oneCase.utf8Len, SkMakeSpan(oneCase.clusters), checker); in DEF_TEST()
82 std::vector<uint32_t> clusters; in DEF_TEST() member
110 REPORTER_ASSERT(reporter, false, "Too many clusters"); in DEF_TEST()
118 SkMakeSpan(oneCase.clusters), in DEF_TEST()
H A DPDFPrimitivesTest.cpp388 const SkFont& font, const uint32_t* clusters, in make_run()
394 SkSpan<const uint32_t>{clusters, len}, in make_run()
402 const uint32_t clusters[len] = { 3, 2, 2, 1, 0, 4, 4, 7, 6, 6, 5 }; in DEF_TEST() local
407 SkGlyphRun run = make_run(len, glyphs, pos, font, clusters, strlen(text), text); in DEF_TEST()
426 const uint32_t clusters[len] = { 0, 1, 4, 5, 6 }; in DEF_TEST() local
430 SkGlyphRun run = make_run(len, glyphs, pos, font, clusters, strlen(text), text); in DEF_TEST()
387 make_run(size_t len, const SkGlyphID* glyphs, SkPoint* pos, const SkFont& font, const uint32_t* clusters, size_t utf8TextByteLength, const char* utf8Text) make_run() argument
/third_party/skia/experimental/sktext/src/
H A DText.cpp322 // line + spaces + clusters
325 Stretch clusters;
331 if (!clusters.isEmpty()) {
333 line.moveTo(clusters);
334 spaces = clusters;
338 clusters = spaces;
357 clusters = empty;
376 // line + spaces + clusters + cluster
379 if (!clusters.isEmpty()) {
381 line.moveTo(clusters);
[all...]
H A DVisualRun.h17 SkSpan<SkPoint> positions, SkSpan<SkGlyphID> glyphs, SkSpan<uint32_t> clusters) in VisualRun()
36 fClusters.reserve_back(clusters.size()); in VisualRun()
37 for (auto cluster : clusters) { in VisualRun()
14 VisualRun(TextRange textRange, GlyphIndex trailingSpacesStart, const SkFont& font, SkScalar lineBaseLine, SkPoint runOffset, bool leftToRight, SkSpan<SkPoint> positions, SkSpan<SkGlyphID> glyphs, SkSpan<uint32_t> clusters) VisualRun() argument
/third_party/skia/experimental/sktext/tests/
H A DWrappedText.cpp57 SkSpan<const TextIndex> clusters; member
78 const TextIndex clusters[]) override
83 SkSpan<const TextIndex>(&clusters[0], glyphCount + 1),
/third_party/skia/modules/skshaper/src/
H A DSkShaper_coretext.cpp292 if (buffer.clusters) {
305 if (buffer.clusters) {
306 buffer.clusters[k] = utf8IndicesMap.mapIndex(indices[k]);
/third_party/ntfs-3g/libntfs-3g/
H A Dlcnalloc.c196 * ntfs_cluster_alloc - allocate clusters on an ntfs volume
197 * @vol: mounted ntfs volume on which to allocate the clusters
199 * @count: number of clusters to allocate
200 * @start_lcn: starting lcn at which to allocate the clusters (or -1 if none)
201 * @zone: zone from which to allocate the clusters
203 * Allocate @count clusters preferably starting at cluster @start_lcn or at the
205 * @vol. @zone is either DATA_ZONE for allocation of normal clusters and
206 * MFT_ZONE for allocation of clusters for the master file table, i.e. the
242 s64 clusters, br; in ntfs_cluster_alloc() local
312 /* Loop until all clusters ar in ntfs_cluster_alloc()
[all...]

Completed in 14 milliseconds

123