Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
8008bca8
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看板
提交
8008bca8
编写于
10月 09, 2018
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Whitespace
上级
30c114ff
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
29 addition
and
25 deletion
+29
-25
src/hb-font.hh
src/hb-font.hh
+1
-1
src/hb-ot-shape-normalize.cc
src/hb-ot-shape-normalize.cc
+28
-24
未找到文件。
src/hb-font.hh
浏览文件 @
8008bca8
...
...
@@ -213,7 +213,7 @@ struct hb_font_t
unicode
,
glyph
,
klass
->
user_data
.
nominal_glyph
);
}
inline
unsigned
int
get_nominal_glyphs
(
unsigned
int
count
,
inline
unsigned
int
get_nominal_glyphs
(
unsigned
int
count
,
const
hb_codepoint_t
*
first_unicode
,
unsigned
int
unicode_stride
,
hb_codepoint_t
*
first_glyph
,
...
...
src/hb-ot-shape-normalize.cc
浏览文件 @
8008bca8
...
...
@@ -320,40 +320,44 @@ _hb_ot_shape_normalize (const hb_ot_shape_plan_t *plan,
/* First round, decompose */
bool
all_simple
=
true
;
buffer
->
clear_output
();
count
=
buffer
->
len
;
buffer
->
idx
=
0
;
do
{
unsigned
int
end
;
for
(
end
=
buffer
->
idx
+
1
;
end
<
count
;
end
++
)
if
(
unlikely
(
HB_UNICODE_GENERAL_CATEGORY_IS_MARK
(
_hb_glyph_info_get_general_category
(
&
buffer
->
info
[
end
]))))
break
;
buffer
->
clear_output
();
count
=
buffer
->
len
;
buffer
->
idx
=
0
;
do
{
unsigned
int
end
;
for
(
end
=
buffer
->
idx
+
1
;
end
<
count
;
end
++
)
if
(
unlikely
(
HB_UNICODE_GENERAL_CATEGORY_IS_MARK
(
_hb_glyph_info_get_general_category
(
&
buffer
->
info
[
end
]))))
break
;
if
(
end
<
count
)
end
--
;
/* Leave one base for the marks to cluster with. */
if
(
end
<
count
)
end
--
;
/* Leave one base for the marks to cluster with. */
/* From idx to end are simple clusters. */
while
(
buffer
->
idx
<
end
&&
buffer
->
successful
)
decompose_current_character
(
&
c
,
might_short_circuit
);
/* From idx to end are simple clusters. */
while
(
buffer
->
idx
<
end
&&
buffer
->
successful
)
decompose_current_character
(
&
c
,
might_short_circuit
);
if
(
buffer
->
idx
==
count
||
!
buffer
->
successful
)
break
;
if
(
buffer
->
idx
==
count
||
!
buffer
->
successful
)
break
;
all_simple
=
false
;
all_simple
=
false
;
/* Find all the marks now. */
for
(
end
=
buffer
->
idx
+
1
;
end
<
count
;
end
++
)
if
(
!
HB_UNICODE_GENERAL_CATEGORY_IS_MARK
(
_hb_glyph_info_get_general_category
(
&
buffer
->
info
[
end
])))
break
;
/* Find all the marks now. */
for
(
end
=
buffer
->
idx
+
1
;
end
<
count
;
end
++
)
if
(
!
HB_UNICODE_GENERAL_CATEGORY_IS_MARK
(
_hb_glyph_info_get_general_category
(
&
buffer
->
info
[
end
])))
break
;
/* idx to end is one non-simple cluster. */
decompose_multi_char_cluster
(
&
c
,
end
,
always_short_circuit
);
/* idx to end is one non-simple cluster. */
decompose_multi_char_cluster
(
&
c
,
end
,
always_short_circuit
);
}
while
(
buffer
->
idx
<
count
&&
buffer
->
successful
);
buffer
->
swap_buffers
();
}
while
(
buffer
->
idx
<
count
&&
buffer
->
successful
);
buffer
->
swap_buffers
();
/* Second round, reorder (inplace) */
if
(
!
all_simple
)
{
count
=
buffer
->
len
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录