Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
61241233
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看板
提交
61241233
编写于
12月 20, 2018
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[serialize] Adjust ClassDef
[skip ci]
上级
4220b7bd
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
16 addition
and
16 deletion
+16
-16
src/hb-ot-layout-common.hh
src/hb-ot-layout-common.hh
+16
-16
未找到文件。
src/hb-ot-layout-common.hh
浏览文件 @
61241233
...
...
@@ -1206,12 +1206,8 @@ struct ClassDefFormat1
return_trace
(
true
);
}
hb_codepoint_t
glyph_min
=
(
hb_codepoint_t
)
-
1
,
glyph_max
=
0
;
for
(
unsigned
int
i
=
0
;
i
<
glyphs
.
len
;
i
++
)
{
glyph_min
=
MIN
<
hb_codepoint_t
>
(
glyph_min
,
glyphs
[
i
]);
glyph_max
=
MAX
<
hb_codepoint_t
>
(
glyph_max
,
glyphs
[
i
]);
}
hb_codepoint_t
glyph_min
=
glyphs
[
0
];
hb_codepoint_t
glyph_max
=
glyphs
[
glyphs
.
len
-
1
];
startGlyph
.
set
(
glyph_min
);
classValue
.
len
.
set
(
glyph_max
-
glyph_min
+
1
);
...
...
@@ -1488,18 +1484,22 @@ struct ClassDef
TRACE_SERIALIZE
(
this
);
if
(
unlikely
(
!
c
->
extend_min
(
*
this
)))
return_trace
(
false
);
hb_codepoint_t
glyph_min
=
(
hb_codepoint_t
)
-
1
,
glyph_max
=
0
;
for
(
unsigned
int
i
=
0
;
i
<
glyphs
.
len
;
i
++
)
unsigned
int
format
=
2
;
if
(
glyphs
.
len
)
{
glyph_min
=
MIN
<
hb_codepoint_t
>
(
glyph_min
,
glyphs
[
i
]);
glyph_max
=
MAX
<
hb_codepoint_t
>
(
glyph_max
,
glyphs
[
i
]);
hb_codepoint_t
glyph_min
=
glyphs
[
0
];
hb_codepoint_t
glyph_max
=
glyphs
[
glyphs
.
len
-
1
];
unsigned
int
num_ranges
=
1
;
for
(
unsigned
int
i
=
1
;
i
<
glyphs
.
len
;
i
++
)
if
(
glyphs
[
i
-
1
]
+
1
!=
glyphs
[
i
]
||
klasses
[
i
-
1
]
!=
klasses
[
i
])
num_ranges
++
;
if
(
1
+
(
glyph_max
-
glyph_min
+
1
)
<
num_ranges
*
3
)
format
=
1
;
}
unsigned
int
num_ranges
=
1
;
for
(
unsigned
int
i
=
1
;
i
<
glyphs
.
len
;
i
++
)
if
(
glyphs
[
i
-
1
]
+
1
!=
glyphs
[
i
]
||
klasses
[
i
-
1
]
!=
klasses
[
i
])
num_ranges
++
;
u
.
format
.
set
(
1
+
(
glyph_max
-
glyph_min
+
1
)
<
num_ranges
*
3
?
1
:
2
);
u
.
format
.
set
(
format
);
switch
(
u
.
format
)
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录