Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
af6c1902
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看板
提交
af6c1902
编写于
1月 09, 2019
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Use hb_zip() some moore
上级
83ad0b6d
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
14 addition
and
38 deletion
+14
-38
src/hb-ot-layout-gsubgpos.hh
src/hb-ot-layout-gsubgpos.hh
+14
-38
未找到文件。
src/hb-ot-layout-gsubgpos.hh
浏览文件 @
af6c1902
...
...
@@ -1436,16 +1436,10 @@ struct ContextFormat1
{
intersects_glyph
},
nullptr
};
unsigned
int
count
=
ruleSet
.
len
;
for
(
/*TODO(C++11)auto*/
Coverage
::
iter_t
iter
=
(
this
+
coverage
).
iter
();
iter
;
iter
++
)
{
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
if
(
glyphs
->
has
(
iter
.
get_glyph
())
&&
(
this
+
ruleSet
[
iter
.
get_coverage
()]).
intersects
(
glyphs
,
lookup_context
))
return
true
;
}
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ruleSet
);
it
;
++
it
)
if
(
glyphs
->
has
(
it
->
first
))
if
((
this
+
it
->
second
).
intersects
(
glyphs
,
lookup_context
))
return
true
;
return
false
;
}
...
...
@@ -1455,15 +1449,9 @@ struct ContextFormat1
{
intersects_glyph
},
nullptr
};
unsigned
int
count
=
ruleSet
.
len
;
for
(
/*TODO(C++11)auto*/
Coverage
::
iter_t
iter
=
(
this
+
coverage
).
iter
();
iter
;
iter
++
)
{
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
if
(
c
->
glyphs
->
has
(
iter
.
get_glyph
()))
(
this
+
ruleSet
[
iter
.
get_coverage
()]).
closure
(
c
,
lookup_context
);
}
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ruleSet
);
it
;
++
it
)
if
(
c
->
glyphs
->
has
(
it
->
first
))
(
this
+
it
->
second
).
closure
(
c
,
lookup_context
);
}
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
)
const
...
...
@@ -2089,16 +2077,10 @@ struct ChainContextFormat1
{
intersects_glyph
},
{
nullptr
,
nullptr
,
nullptr
}
};
unsigned
int
count
=
ruleSet
.
len
;
for
(
/*TODO(C++11)auto*/
Coverage
::
iter_t
iter
=
(
this
+
coverage
).
iter
();
iter
;
iter
++
)
{
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
if
(
glyphs
->
has
(
iter
.
get_glyph
())
&&
(
this
+
ruleSet
[
iter
.
get_coverage
()]).
intersects
(
glyphs
,
lookup_context
))
return
true
;
}
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ruleSet
);
it
;
++
it
)
if
(
glyphs
->
has
(
it
->
first
))
if
((
this
+
it
->
second
).
intersects
(
glyphs
,
lookup_context
))
return
true
;
return
false
;
}
...
...
@@ -2108,15 +2090,9 @@ struct ChainContextFormat1
{
intersects_glyph
},
{
nullptr
,
nullptr
,
nullptr
}
};
unsigned
int
count
=
ruleSet
.
len
;
for
(
/*TODO(C++11)auto*/
Coverage
::
iter_t
iter
=
(
this
+
coverage
).
iter
();
iter
;
iter
++
)
{
if
(
unlikely
(
iter
.
get_coverage
()
>=
count
))
break
;
/* Work around malicious fonts. https://github.com/harfbuzz/harfbuzz/issues/363 */
if
(
c
->
glyphs
->
has
(
iter
.
get_glyph
()))
(
this
+
ruleSet
[
iter
.
get_coverage
()]).
closure
(
c
,
lookup_context
);
}
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ruleSet
);
it
;
++
it
)
if
(
c
->
glyphs
->
has
(
it
->
first
))
(
this
+
it
->
second
).
closure
(
c
,
lookup_context
);
}
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
)
const
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录