Lines Matching full:clusters
7 <chapter id="clusters">
8 <title>Clusters</title>
9 <section id="clusters-and-shaping">
10 <title>Clusters and shaping</title>
15 own. Other clusters correspond to longer subsequences of the
26 The definitions of the two terms are similar. However, clusters
41 HarfBuzz is concerned with clusters, <emphasis>not</emphasis>
52 clusters; HarfBuzz tracks the changes to ensure that no clusters
103 <section id="working-with-harfbuzz-clusters">
104 <title>Working with HarfBuzz clusters</title>
111 to distinguish between clusters. Many client programs will use
144 then there are two clusters in the output buffer: the first
177 Client programs can adjust how HarfBuzz handles clusters during
203 "merging" the affected clusters. This behavior is based on
228 clusters of marks and other modifier code points with the
245 clusters.
251 merging clusters; in level 2, neither of these operations
325 The basic shaping operations affect clusters in a predictable
331 When two or more clusters <emphasis>merge</emphasis>, the
339 resulting child clusters inherit as their cluster value the
346 reordered character and all clusters that the character
377 form a ligature, then the clusters to which they belong
379 value the minimum of all the cluster values of the clusters that
403 ligature, then their clusters (cluster values 1 and 3) merge into
428 when glyph reordering takes place, HarfBuzz merges the clusters
443 <literal>D</literal> clusters — all the clusters between
455 Merging this many clusters is not ideal, but it is the only
468 with the clusters of all Unicode marks (combining or not) and
482 <literal>A</literal> and <literal>acute</literal> clusters will
550 performs no merging of clusters whatsoever.
558 Only one shaping operation directly affects clusters when using
565 resulting child clusters inherit as their cluster value the