Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
370f03e9
T
Third Party Harfbuzz
项目概览
OpenHarmony
/
Third Party Harfbuzz
1 年多 前同步成功
通知
0
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看板
提交
370f03e9
编写于
1月 16, 2012
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Minor
上级
4d3aeb8c
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
4 addition
and
7 deletion
+4
-7
src/hb-ot-layout-gsub-table.hh
src/hb-ot-layout-gsub-table.hh
+2
-3
src/hb-ot-layout-gsubgpos-private.hh
src/hb-ot-layout-gsubgpos-private.hh
+2
-4
未找到文件。
src/hb-ot-layout-gsub-table.hh
浏览文件 @
370f03e9
...
...
@@ -343,7 +343,6 @@ struct Ligature
inline
bool
apply
(
hb_apply_context_t
*
c
)
const
{
TRACE_APPLY
();
unsigned
int
i
;
unsigned
int
j
=
c
->
buffer
->
idx
;
unsigned
int
count
=
component
.
len
;
unsigned
int
end
=
MIN
(
c
->
buffer
->
len
,
j
+
c
->
context_length
);
...
...
@@ -353,7 +352,7 @@ struct Ligature
bool
first_was_mark
=
(
c
->
property
&
HB_OT_LAYOUT_GLYPH_CLASS_MARK
);
bool
found_non_mark
=
false
;
for
(
i
=
1
;
i
<
count
;
i
++
)
for
(
unsigned
int
i
=
1
;
i
<
count
;
i
++
)
{
unsigned
int
property
;
do
...
...
@@ -392,7 +391,7 @@ struct Ligature
value it is later possible to check whether a specific
component value really belongs to a given ligature. */
for
(
i
=
1
;
i
<
count
;
i
++
)
for
(
unsigned
int
i
=
1
;
i
<
count
;
i
++
)
{
while
(
_hb_ot_layout_skip_mark
(
c
->
face
,
&
c
->
buffer
->
info
[
c
->
buffer
->
idx
],
c
->
lookup_props
,
NULL
))
{
...
...
src/hb-ot-layout-gsubgpos-private.hh
浏览文件 @
370f03e9
...
...
@@ -132,13 +132,12 @@ static inline bool match_input (hb_apply_context_t *c,
const
void
*
match_data
,
unsigned
int
*
context_length_out
)
{
unsigned
int
i
;
unsigned
int
j
=
c
->
buffer
->
idx
;
unsigned
int
end
=
MIN
(
c
->
buffer
->
len
,
j
+
c
->
context_length
);
if
(
unlikely
(
j
+
count
>
end
))
return
false
;
for
(
i
=
1
;
i
<
count
;
i
++
)
for
(
unsigned
int
i
=
1
;
i
<
count
;
i
++
)
{
do
{
...
...
@@ -187,11 +186,10 @@ static inline bool match_lookahead (hb_apply_context_t *c,
const
void
*
match_data
,
unsigned
int
offset
)
{
unsigned
int
i
;
unsigned
int
j
=
c
->
buffer
->
idx
+
offset
-
1
;
unsigned
int
end
=
MIN
(
c
->
buffer
->
len
,
c
->
buffer
->
idx
+
c
->
context_length
);
for
(
i
=
0
;
i
<
count
;
i
++
)
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
{
do
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录