Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
5389ff4d
T
Third Party Harfbuzz
项目概览
OpenHarmony
/
Third Party Harfbuzz
接近 2 年 前同步成功
通知
1
Star
18
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
T
Third Party Harfbuzz
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
提交
5389ff4d
编写于
7月 22, 2011
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Implement the Unicode Canonical Composition algorithm
Fallback normalization is complete and working now!
上级
dcdc51cd
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
46 addition
and
3 deletion
+46
-3
src/hb-ot-shape-normalize.cc
src/hb-ot-shape-normalize.cc
+46
-3
未找到文件。
src/hb-ot-shape-normalize.cc
浏览文件 @
5389ff4d
...
...
@@ -154,11 +154,16 @@ _hb_ot_shape_normalize (hb_ot_shape_context_t *c)
bool
has_multichar_clusters
=
FALSE
;
unsigned
int
count
;
buffer
->
clear_output
();
/* We do a farily straightforward yet custom normalization process in three
* separate rounds: decompose, reorder, recompose (if desired). Currently
* this makes two buffer swaps. We can make it faster by moving the last
* two rounds into the inner loop for the first round, but it's more readable
* this way. */
/* First round, decompose */
buffer
->
clear_output
();
count
=
buffer
->
len
;
for
(
buffer
->
idx
=
0
;
buffer
->
idx
<
count
;)
{
...
...
@@ -180,7 +185,10 @@ _hb_ot_shape_normalize (hb_ot_shape_context_t *c)
/* Technically speaking, two characters with ccc=0 may combine. But all
* those cases are in languages that the indic module handles (which expects
* decomposed), or in Hangul jamo, which again, we want decomposed anyway.
* So we don't bother combining across cluster boundaries. */
* So we don't bother combining across cluster boundaries.
*
* TODO: Am I right about Hangul? If I am, we should add a Hangul module
* that requests decomposed. */
if
(
!
has_multichar_clusters
)
return
;
/* Done! */
...
...
@@ -231,12 +239,47 @@ _hb_ot_shape_normalize (hb_ot_shape_context_t *c)
}
if
(
!
recompose
)
return
;
/* Third round, recompose */
if
(
recompose
)
{
/* As noted in the comment earlier, we don't try to combine
* ccc=0 chars with their previous Starter. */
buffer
->
clear_output
();
count
=
buffer
->
len
;
unsigned
int
starter
=
0
;
buffer
->
next_glyph
();
while
(
buffer
->
idx
<
count
)
{
if
(
buffer
->
info
[
buffer
->
idx
].
combining_class
()
==
0
)
{
starter
=
buffer
->
out_len
;
buffer
->
next_glyph
();
continue
;
}
hb_codepoint_t
composed
,
glyph
;
if
((
buffer
->
out_info
[
buffer
->
out_len
-
1
].
combining_class
()
>=
buffer
->
info
[
buffer
->
idx
].
combining_class
())
||
!
hb_unicode_compose
(
c
->
buffer
->
unicode
,
buffer
->
out_info
[
starter
].
codepoint
,
buffer
->
info
[
buffer
->
idx
].
codepoint
,
&
composed
)
||
!
hb_font_get_glyph
(
c
->
font
,
composed
,
0
,
&
glyph
))
{
/* Blocked, or doesn't compose. */
buffer
->
next_glyph
();
continue
;
}
/* Composes. Modify starter and carry on. */
buffer
->
out_info
[
starter
].
codepoint
=
composed
;
hb_glyph_info_set_unicode_props
(
&
buffer
->
out_info
[
starter
],
buffer
->
unicode
);
buffer
->
skip_glyph
();
}
buffer
->
swap_buffers
();
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录