Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
72c1b595
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看板
提交
72c1b595
编写于
2月 14, 2019
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[iter] Use in more places
上级
40cce41e
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
20 addition
and
28 deletion
+20
-28
src/hb-ot-layout-gsubgpos.hh
src/hb-ot-layout-gsubgpos.hh
+20
-28
未找到文件。
src/hb-ot-layout-gsubgpos.hh
浏览文件 @
72c1b595
...
...
@@ -706,8 +706,8 @@ static inline bool intersects_array (const hb_set_t *glyphs,
intersects_func_t
intersects_func
,
const
void
*
intersects_data
)
{
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
if
(
likely
(
!
intersects_func
(
glyphs
,
values
[
i
]
,
intersects_data
)))
for
(
auto
it
=
hb_iter
(
values
,
count
);
it
;
++
it
)
if
(
likely
(
!
intersects_func
(
glyphs
,
*
it
,
intersects_data
)))
return
false
;
return
true
;
}
...
...
@@ -734,8 +734,8 @@ static inline void collect_array (hb_collect_glyphs_context_t *c HB_UNUSED,
collect_glyphs_func_t
collect_func
,
const
void
*
collect_data
)
{
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
collect_func
(
glyphs
,
values
[
i
]
,
collect_data
);
for
(
auto
it
=
hb_iter
(
values
,
count
);
it
;
++
it
)
collect_func
(
glyphs
,
*
it
,
collect_data
);
}
...
...
@@ -1380,19 +1380,17 @@ struct RuleSet
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
,
ContextCollectGlyphsLookupContext
&
lookup_context
)
const
{
unsigned
int
num_rules
=
rule
.
len
;
for
(
unsigned
int
i
=
0
;
i
<
num_rules
;
i
++
)
(
this
+
rule
[
i
]).
collect_glyphs
(
c
,
lookup_context
);
for
(
auto
it
=
hb_iter
(
rule
);
it
;
++
it
)
(
this
+*
it
).
collect_glyphs
(
c
,
lookup_context
);
}
bool
would_apply
(
hb_would_apply_context_t
*
c
,
ContextApplyLookupContext
&
lookup_context
)
const
{
TRACE_WOULD_APPLY
(
this
);
unsigned
int
num_rules
=
rule
.
len
;
for
(
unsigned
int
i
=
0
;
i
<
num_rules
;
i
++
)
for
(
auto
it
=
hb_iter
(
rule
);
it
;
++
it
)
{
if
((
this
+
rule
[
i
]
).
would_apply
(
c
,
lookup_context
))
if
((
this
+
*
it
).
would_apply
(
c
,
lookup_context
))
return_trace
(
true
);
}
return_trace
(
false
);
...
...
@@ -1402,10 +1400,9 @@ struct RuleSet
ContextApplyLookupContext
&
lookup_context
)
const
{
TRACE_APPLY
(
this
);
unsigned
int
num_rules
=
rule
.
len
;
for
(
unsigned
int
i
=
0
;
i
<
num_rules
;
i
++
)
for
(
auto
it
=
hb_iter
(
rule
);
it
;
++
it
)
{
if
((
this
+
rule
[
i
]
).
apply
(
c
,
lookup_context
))
if
((
this
+
*
it
).
apply
(
c
,
lookup_context
))
return_trace
(
true
);
}
return_trace
(
false
);
...
...
@@ -1463,9 +1460,8 @@ struct ContextFormat1
nullptr
};
unsigned
int
count
=
ruleSet
.
len
;
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
(
this
+
ruleSet
[
i
]).
collect_glyphs
(
c
,
lookup_context
);
for
(
auto
it
=
hb_iter
(
ruleSet
);
it
;
++
it
)
(
this
+*
it
).
collect_glyphs
(
c
,
lookup_context
);
}
bool
would_apply
(
hb_would_apply_context_t
*
c
)
const
...
...
@@ -2026,17 +2022,15 @@ struct ChainRuleSet
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
,
ChainContextCollectGlyphsLookupContext
&
lookup_context
)
const
{
unsigned
int
num_rules
=
rule
.
len
;
for
(
unsigned
int
i
=
0
;
i
<
num_rules
;
i
++
)
(
this
+
rule
[
i
]).
collect_glyphs
(
c
,
lookup_context
);
for
(
auto
it
=
hb_iter
(
rule
);
it
;
++
it
)
(
this
+*
it
).
collect_glyphs
(
c
,
lookup_context
);
}
bool
would_apply
(
hb_would_apply_context_t
*
c
,
ChainContextApplyLookupContext
&
lookup_context
)
const
{
TRACE_WOULD_APPLY
(
this
);
unsigned
int
num_rules
=
rule
.
len
;
for
(
unsigned
int
i
=
0
;
i
<
num_rules
;
i
++
)
if
((
this
+
rule
[
i
]).
would_apply
(
c
,
lookup_context
))
for
(
auto
it
=
hb_iter
(
rule
);
it
;
++
it
)
if
((
this
+*
it
).
would_apply
(
c
,
lookup_context
))
return_trace
(
true
);
return_trace
(
false
);
...
...
@@ -2045,9 +2039,8 @@ struct ChainRuleSet
bool
apply
(
hb_ot_apply_context_t
*
c
,
ChainContextApplyLookupContext
&
lookup_context
)
const
{
TRACE_APPLY
(
this
);
unsigned
int
num_rules
=
rule
.
len
;
for
(
unsigned
int
i
=
0
;
i
<
num_rules
;
i
++
)
if
((
this
+
rule
[
i
]).
apply
(
c
,
lookup_context
))
for
(
auto
it
=
hb_iter
(
rule
);
it
;
++
it
)
if
((
this
+*
it
).
apply
(
c
,
lookup_context
))
return_trace
(
true
);
return_trace
(
false
);
...
...
@@ -2104,9 +2097,8 @@ struct ChainContextFormat1
{
nullptr
,
nullptr
,
nullptr
}
};
unsigned
int
count
=
ruleSet
.
len
;
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
(
this
+
ruleSet
[
i
]).
collect_glyphs
(
c
,
lookup_context
);
for
(
auto
it
=
hb_iter
(
ruleSet
);
it
;
++
it
)
(
this
+*
it
).
collect_glyphs
(
c
,
lookup_context
);
}
bool
would_apply
(
hb_would_apply_context_t
*
c
)
const
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录