Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
af2067e8
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看板
“089427d9c5d9ac6058b61609729a4ba89f579a12”上不存在“bsp/ls1bdev/drivers/uart.h”
提交
af2067e8
编写于
1月 09, 2019
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Use hb_zip() moooore
上级
0d1fdf93
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
12 addition
and
12 deletion
+12
-12
src/hb-ot-layout-gsub-table.hh
src/hb-ot-layout-gsub-table.hh
+12
-12
未找到文件。
src/hb-ot-layout-gsub-table.hh
浏览文件 @
af2067e8
...
...
@@ -100,12 +100,12 @@ struct SingleSubstFormat1
hb_sorted_vector_t
<
GlyphID
>
from
;
hb_vector_t
<
GlyphID
>
to
;
hb_codepoint_t
delta
=
deltaGlyphID
;
for
(
/*TODO(C++11)auto*/
Coverage
::
iter_t
iter
=
(
this
+
coverage
).
iter
();
iter
;
iter
++
)
{
if
(
!
glyphset
.
has
(
iter
.
get_glyph
()))
continue
;
from
.
push
()
->
set
(
glyph_map
[
iter
.
get_glyph
()
]);
to
.
push
()
->
set
(
glyph_map
[(
iter
.
get_glyph
()
+
delta
)
&
0xFFFF
]);
}
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
]);
}
c
->
serializer
->
propagate_error
(
from
,
to
);
SingleSubst_serialize
(
c
->
serializer
,
from
,
to
);
return_trace
(
from
.
length
);
...
...
@@ -186,12 +186,12 @@ struct SingleSubstFormat2
const
hb_map_t
&
glyph_map
=
*
c
->
plan
->
glyph_map
;
hb_sorted_vector_t
<
GlyphID
>
from
;
hb_vector_t
<
GlyphID
>
to
;
for
(
/*TODO(C++11)auto*/
Coverage
::
iter_t
iter
=
(
this
+
coverage
).
iter
();
iter
;
iter
++
)
{
if
(
!
glyphset
.
has
(
iter
.
get_glyph
()))
continue
;
from
.
push
()
->
set
(
glyph_map
[
iter
.
get_glyph
()
]);
to
.
push
()
->
set
(
glyph_map
[
substitute
[
iter
.
get_coverage
()]
]);
}
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
substitute
);
it
;
++
it
)
if
(
glyphset
.
has
(
it
->
first
))
{
from
.
push
()
->
set
(
glyph_map
[
it
->
first
]);
to
.
push
()
->
set
(
glyph_map
[
it
->
second
]);
}
c
->
serializer
->
propagate_error
(
from
,
to
);
SingleSubst_serialize
(
c
->
serializer
,
from
,
to
);
return_trace
(
from
.
length
);
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录