Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
934d3fa2
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看板
提交
934d3fa2
编写于
1月 09, 2019
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Use more iter pipelines
上级
420d8ac3
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
23 addition
and
18 deletion
+23
-18
src/hb-ot-layout-gpos-table.hh
src/hb-ot-layout-gpos-table.hh
+5
-4
src/hb-ot-layout-gsubgpos.hh
src/hb-ot-layout-gsubgpos.hh
+18
-14
未找到文件。
src/hb-ot-layout-gpos-table.hh
浏览文件 @
934d3fa2
...
@@ -722,10 +722,11 @@ struct PairPosFormat1
...
@@ -722,10 +722,11 @@ struct PairPosFormat1
{
{
bool
intersects
(
const
hb_set_t
*
glyphs
)
const
bool
intersects
(
const
hb_set_t
*
glyphs
)
const
{
{
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
pairSet
);
it
;
++
it
)
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
pairSet
)
if
(
glyphs
->
has
(
it
->
first
))
|
hb_filter
(
*
glyphs
,
hb_first
)
if
((
this
+
it
->
second
).
intersects
(
glyphs
,
valueFormat
))
|
hb_map
(
hb_second
);
it
;
++
it
)
return
true
;
if
((
this
+*
it
).
intersects
(
glyphs
,
valueFormat
))
return
true
;
return
false
;
return
false
;
}
}
...
...
src/hb-ot-layout-gsubgpos.hh
浏览文件 @
934d3fa2
...
@@ -1436,10 +1436,11 @@ struct ContextFormat1
...
@@ -1436,10 +1436,11 @@ struct ContextFormat1
{
intersects_glyph
},
{
intersects_glyph
},
nullptr
nullptr
};
};
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ruleSet
);
it
;
++
it
)
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ruleSet
)
if
(
glyphs
->
has
(
it
->
first
))
|
hb_filter
(
*
glyphs
,
hb_first
)
if
((
this
+
it
->
second
).
intersects
(
glyphs
,
lookup_context
))
|
hb_map
(
hb_second
);
it
;
++
it
)
return
true
;
if
((
this
+*
it
).
intersects
(
glyphs
,
lookup_context
))
return
true
;
return
false
;
return
false
;
}
}
...
@@ -1449,9 +1450,10 @@ struct ContextFormat1
...
@@ -1449,9 +1450,10 @@ struct ContextFormat1
{
intersects_glyph
},
{
intersects_glyph
},
nullptr
nullptr
};
};
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ruleSet
);
it
;
++
it
)
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ruleSet
)
if
(
c
->
glyphs
->
has
(
it
->
first
))
|
hb_filter
(
*
c
->
glyphs
,
hb_first
)
(
this
+
it
->
second
).
closure
(
c
,
lookup_context
);
|
hb_map
(
hb_second
);
it
;
++
it
)
(
this
+*
it
).
closure
(
c
,
lookup_context
);
}
}
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
)
const
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
)
const
...
@@ -2077,10 +2079,11 @@ struct ChainContextFormat1
...
@@ -2077,10 +2079,11 @@ struct ChainContextFormat1
{
intersects_glyph
},
{
intersects_glyph
},
{
nullptr
,
nullptr
,
nullptr
}
{
nullptr
,
nullptr
,
nullptr
}
};
};
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ruleSet
);
it
;
++
it
)
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ruleSet
)
if
(
glyphs
->
has
(
it
->
first
))
|
hb_filter
(
*
glyphs
,
hb_first
)
if
((
this
+
it
->
second
).
intersects
(
glyphs
,
lookup_context
))
|
hb_map
(
hb_second
);
it
;
++
it
)
return
true
;
if
((
this
+*
it
).
intersects
(
glyphs
,
lookup_context
))
return
true
;
return
false
;
return
false
;
}
}
...
@@ -2090,9 +2093,10 @@ struct ChainContextFormat1
...
@@ -2090,9 +2093,10 @@ struct ChainContextFormat1
{
intersects_glyph
},
{
intersects_glyph
},
{
nullptr
,
nullptr
,
nullptr
}
{
nullptr
,
nullptr
,
nullptr
}
};
};
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ruleSet
);
it
;
++
it
)
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ruleSet
)
if
(
c
->
glyphs
->
has
(
it
->
first
))
|
hb_filter
(
*
c
->
glyphs
,
hb_first
)
(
this
+
it
->
second
).
closure
(
c
,
lookup_context
);
|
hb_map
(
hb_second
);
it
;
++
it
)
(
this
+*
it
).
closure
(
c
,
lookup_context
);
}
}
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
)
const
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.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录