Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
54ec48ea
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看板
提交
54ec48ea
编写于
1月 09, 2019
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Use iter pipelines more
上级
83cecd80
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
44 addition
and
37 deletion
+44
-37
src/hb-ot-layout-gsub-table.hh
src/hb-ot-layout-gsub-table.hh
+44
-37
未找到文件。
src/hb-ot-layout-gsub-table.hh
浏览文件 @
54ec48ea
...
...
@@ -46,9 +46,9 @@ struct SingleSubstFormat1
void
closure
(
hb_closure_context_t
*
c
)
const
{
for
(
auto
it
=
(
this
+
coverage
).
iter
()
;
it
;
++
it
)
if
(
c
->
glyphs
->
has
(
*
it
)
)
c
->
output
->
add
((
*
it
+
deltaGlyphID
)
&
0xFFFFu
);
for
(
auto
it
=
(
this
+
coverage
).
iter
()
|
hb_filter
(
*
c
->
glyphs
);
it
;
++
it
)
c
->
output
->
add
((
*
it
+
deltaGlyphID
)
&
0xFFFFu
);
}
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
)
const
...
...
@@ -100,12 +100,12 @@ struct SingleSubstFormat1
hb_sorted_vector_t
<
GlyphID
>
from
;
hb_vector_t
<
GlyphID
>
to
;
hb_codepoint_t
delta
=
deltaGlyphID
;
for
(
auto
it
=
(
this
+
coverage
).
iter
()
;
it
;
++
it
)
if
(
glyphset
.
has
(
*
it
)
)
{
from
.
push
()
->
set
(
glyph_map
[
*
it
]);
to
.
push
()
->
set
(
glyph_map
[(
*
it
+
delta
)
&
0xFFFF
]);
}
for
(
auto
it
=
(
this
+
coverage
).
iter
()
|
hb_filter
(
glyphset
);
it
;
++
it
)
{
from
.
push
()
->
set
(
glyph_map
[
*
it
]);
to
.
push
()
->
set
(
glyph_map
[(
*
it
+
delta
)
&
0xFFFF
]);
}
c
->
serializer
->
propagate_error
(
from
,
to
);
SingleSubst_serialize
(
c
->
serializer
,
from
,
to
);
return_trace
(
from
.
length
);
...
...
@@ -137,16 +137,16 @@ struct SingleSubstFormat2
{
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
substitute
)
|
hb_filter
(
*
c
->
glyphs
,
hb_first
)
|
hb_map
(
hb_second
);
it
;
++
it
)
|
hb_map
(
hb_second
);
it
;
++
it
)
c
->
output
->
add
(
*
it
);
}
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
)
const
{
if
(
unlikely
(
!
(
this
+
coverage
).
add_coverage
(
c
->
input
)))
return
;
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
substitute
);
it
;
++
it
)
c
->
output
->
add
(
it
->
second
);
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
substitute
)
|
hb_map
(
hb_second
);
it
;
++
it
)
c
->
output
->
add
(
*
it
);
}
const
Coverage
&
get_coverage
()
const
{
return
this
+
coverage
;
}
...
...
@@ -188,8 +188,8 @@ struct SingleSubstFormat2
const
hb_map_t
&
glyph_map
=
*
c
->
plan
->
glyph_map
;
hb_sorted_vector_t
<
GlyphID
>
from
;
hb_vector_t
<
GlyphID
>
to
;
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
substitute
)
;
it
;
++
it
)
if
(
glyphset
.
has
(
it
->
first
)
)
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
substitute
)
|
hb_filter
(
glyphset
,
hb_first
);
it
;
++
it
)
{
from
.
push
()
->
set
(
glyph_map
[
it
->
first
]);
to
.
push
()
->
set
(
glyph_map
[
it
->
second
]);
...
...
@@ -343,16 +343,18 @@ struct MultipleSubstFormat1
void
closure
(
hb_closure_context_t
*
c
)
const
{
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
sequence
);
it
;
++
it
)
if
(
c
->
glyphs
->
has
(
it
->
first
))
(
this
+
it
->
second
).
closure
(
c
);
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
sequence
)
|
hb_filter
(
*
c
->
glyphs
,
hb_first
)
|
hb_map
(
hb_second
);
it
;
++
it
)
(
this
+*
it
).
closure
(
c
);
}
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
)
const
{
if
(
unlikely
(
!
(
this
+
coverage
).
add_coverage
(
c
->
input
)))
return
;
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
sequence
);
it
;
++
it
)
(
this
+
it
->
second
).
collect_glyphs
(
c
);
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
sequence
)
|
hb_map
(
hb_second
);
it
;
++
it
)
(
this
+*
it
).
collect_glyphs
(
c
);
}
const
Coverage
&
get_coverage
()
const
{
return
this
+
coverage
;
}
...
...
@@ -517,16 +519,17 @@ struct AlternateSubstFormat1
void
closure
(
hb_closure_context_t
*
c
)
const
{
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
alternateSet
)
;
it
;
++
it
)
if
(
c
->
glyphs
->
has
(
it
->
first
)
)
(
this
+
it
->
second
).
closure
(
c
);
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
alternateSet
)
|
hb_map
(
hb_second
);
it
;
++
it
)
(
this
+*
it
).
closure
(
c
);
}
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
)
const
{
if
(
unlikely
(
!
(
this
+
coverage
).
add_coverage
(
c
->
input
)))
return
;
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
alternateSet
);
it
;
++
it
)
(
this
+
it
->
second
).
collect_glyphs
(
c
);
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
alternateSet
)
|
hb_map
(
hb_second
);
it
;
++
it
)
(
this
+*
it
).
collect_glyphs
(
c
);
}
const
Coverage
&
get_coverage
()
const
{
return
this
+
coverage
;
}
...
...
@@ -823,25 +826,28 @@ struct LigatureSubstFormat1
{
bool
intersects
(
const
hb_set_t
*
glyphs
)
const
{
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ligatureSet
);
it
;
++
it
)
if
(
glyphs
->
has
(
it
->
first
))
if
((
this
+
it
->
second
).
intersects
(
glyphs
))
return
true
;
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ligatureSet
)
|
hb_filter
(
*
glyphs
,
hb_first
)
|
hb_map
(
hb_second
);
it
;
++
it
)
if
((
this
+*
it
).
intersects
(
glyphs
))
return
true
;
return
false
;
}
void
closure
(
hb_closure_context_t
*
c
)
const
{
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ligatureSet
);
it
;
++
it
)
if
(
c
->
glyphs
->
has
(
it
->
first
))
(
this
+
it
->
second
).
closure
(
c
);
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ligatureSet
)
|
hb_filter
(
*
c
->
glyphs
,
hb_first
)
|
hb_map
(
hb_second
);
it
;
++
it
)
(
this
+*
it
).
closure
(
c
);
}
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
)
const
{
if
(
unlikely
(
!
(
this
+
coverage
).
add_coverage
(
c
->
input
)))
return
;
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ligatureSet
);
it
;
++
it
)
(
this
+
it
->
second
).
collect_glyphs
(
c
);
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ligatureSet
)
|
hb_map
(
hb_second
);
it
;
++
it
)
(
this
+*
it
).
collect_glyphs
(
c
);
}
const
Coverage
&
get_coverage
()
const
{
return
this
+
coverage
;
}
...
...
@@ -1012,9 +1018,10 @@ struct ReverseChainSingleSubstFormat1
return
;
const
ArrayOf
<
GlyphID
>
&
substitute
=
StructAfter
<
ArrayOf
<
GlyphID
>
>
(
lookahead
);
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
substitute
);
it
;
++
it
)
if
(
c
->
glyphs
->
has
(
it
->
first
))
c
->
output
->
add
(
it
->
second
);
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
substitute
)
|
hb_filter
(
*
c
->
glyphs
,
hb_first
)
|
hb_map
(
hb_second
);
it
;
++
it
)
c
->
output
->
add
(
*
it
);
}
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.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录