Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
41697109
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看板
提交
41697109
编写于
5月 05, 2010
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Simplify chaining
上级
1911b9d2
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
25 addition
and
36 deletion
+25
-36
src/hb-ot-layout-gsubgpos-private.hh
src/hb-ot-layout-gsubgpos-private.hh
+25
-36
未找到文件。
src/hb-ot-layout-gsubgpos-private.hh
浏览文件 @
41697109
...
...
@@ -258,20 +258,15 @@ static inline bool context_lookup (hb_apply_context_t *context,
const
LookupRecord
lookupRecord
[],
ContextLookupContext
&
lookup_context
)
{
unsigned
int
new_context_length
;
if
(
!
match_input
(
context
,
inputCount
,
input
,
lookup_context
.
funcs
.
match
,
lookup_context
.
match_data
,
&
new_context_length
))
return
false
;
unsigned
int
old_context_length
;
old_context_length
=
context
->
context_length
;
context
->
context_length
=
new_context_length
;
bool
ret
=
apply_lookup
(
context
,
inputCount
,
lookupCount
,
lookupRecord
,
lookup_context
.
funcs
.
apply
);
context
->
context_length
=
old_context_length
;
return
ret
;
hb_apply_context_t
new_context
=
*
context
;
return
match_input
(
context
,
inputCount
,
input
,
lookup_context
.
funcs
.
match
,
lookup_context
.
match_data
,
&
new_context
.
context_length
)
&&
apply_lookup
(
&
new_context
,
inputCount
,
lookupCount
,
lookupRecord
,
lookup_context
.
funcs
.
apply
);
}
struct
Rule
...
...
@@ -529,28 +524,22 @@ static inline bool chain_context_lookup (hb_apply_context_t *context,
inputCount
+
lookaheadCount
>
context
->
context_length
))
return
false
;
unsigned
int
offset
;
if
(
!
(
match_backtrack
(
context
,
backtrackCount
,
backtrack
,
lookup_context
.
funcs
.
match
,
lookup_context
.
match_data
[
0
])
&&
match_input
(
context
,
inputCount
,
input
,
lookup_context
.
funcs
.
match
,
lookup_context
.
match_data
[
1
],
&
offset
)
&&
match_lookahead
(
context
,
lookaheadCount
,
lookahead
,
lookup_context
.
funcs
.
match
,
lookup_context
.
match_data
[
2
],
offset
)))
return
false
;
unsigned
int
old_context_length
;
old_context_length
=
context
->
context_length
;
context
->
context_length
=
offset
;
bool
ret
=
apply_lookup
(
context
,
inputCount
,
lookupCount
,
lookupRecord
,
lookup_context
.
funcs
.
apply
);
context
->
context_length
=
old_context_length
;
return
ret
;
hb_apply_context_t
new_context
=
*
context
;
return
match_backtrack
(
context
,
backtrackCount
,
backtrack
,
lookup_context
.
funcs
.
match
,
lookup_context
.
match_data
[
0
])
&&
match_input
(
context
,
inputCount
,
input
,
lookup_context
.
funcs
.
match
,
lookup_context
.
match_data
[
1
],
&
new_context
.
context_length
)
&&
match_lookahead
(
context
,
lookaheadCount
,
lookahead
,
lookup_context
.
funcs
.
match
,
lookup_context
.
match_data
[
2
],
new_context
.
context_length
)
&&
apply_lookup
(
&
new_context
,
inputCount
,
lookupCount
,
lookupRecord
,
lookup_context
.
funcs
.
apply
);
}
struct
ChainRule
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录