Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
b713c139
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看板
提交
b713c139
编写于
10月 20, 2018
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[kerx] Implement tuple-kerning in Format0
上级
0a3b7a0f
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
30 addition
and
14 deletion
+30
-14
src/hb-aat-layout-kerx-table.hh
src/hb-aat-layout-kerx-table.hh
+30
-14
未找到文件。
src/hb-aat-layout-kerx-table.hh
浏览文件 @
b713c139
...
...
@@ -78,12 +78,14 @@ struct KerxSubTableHeader
struct
KerxSubTableFormat0
{
inline
int
get_kerning
(
hb_codepoint_t
left
,
hb_codepoint_t
right
)
const
inline
int
get_kerning
(
hb_codepoint_t
left
,
hb_codepoint_t
right
,
hb_aat_apply_context_t
*
c
)
const
{
if
(
header
.
tupleCount
)
return
0
;
/* TODO kerxTupleKern */
hb_glyph_pair_t
pair
=
{
left
,
right
};
int
i
=
pairs
.
bsearch
(
pair
);
return
i
==
-
1
?
0
:
pairs
[
i
].
get_kerning
();
if
(
i
==
-
1
)
return
0
;
int
v
=
pairs
[
i
].
get_kerning
();
return
kerxTupleKern
(
v
,
header
.
tupleCount
,
this
,
c
);
}
inline
bool
apply
(
hb_aat_apply_context_t
*
c
)
const
...
...
@@ -93,13 +95,27 @@ struct KerxSubTableFormat0
if
(
!
c
->
plan
->
requested_kerning
)
return
false
;
hb_kern_machine_t
<
KerxSubTableFormat0
>
machine
(
*
this
);
accelerator_t
accel
(
*
this
,
c
);
hb_kern_machine_t
<
accelerator_t
>
machine
(
accel
);
machine
.
kern
(
c
->
font
,
c
->
buffer
,
c
->
plan
->
kern_mask
);
return_trace
(
true
);
}
struct
accelerator_t
{
const
KerxSubTableFormat0
&
table
;
hb_aat_apply_context_t
*
c
;
inline
accelerator_t
(
const
KerxSubTableFormat0
&
table_
,
hb_aat_apply_context_t
*
c_
)
:
table
(
table_
),
c
(
c_
)
{}
inline
int
get_kerning
(
hb_codepoint_t
left
,
hb_codepoint_t
right
)
const
{
return
table
.
get_kerning
(
left
,
right
,
c
);
}
};
inline
bool
sanitize
(
hb_sanitize_context_t
*
c
)
const
{
TRACE_SANITIZE
(
this
);
...
...
@@ -273,15 +289,6 @@ struct KerxSubTableFormat2
return_trace
(
true
);
}
inline
bool
sanitize
(
hb_sanitize_context_t
*
c
)
const
{
TRACE_SANITIZE
(
this
);
return_trace
(
likely
(
c
->
check_struct
(
this
)
&&
leftClassTable
.
sanitize
(
c
,
this
)
&&
rightClassTable
.
sanitize
(
c
,
this
)
&&
c
->
check_range
(
this
,
array
)));
}
struct
accelerator_t
{
const
KerxSubTableFormat2
&
table
;
...
...
@@ -295,6 +302,15 @@ struct KerxSubTableFormat2
{
return
table
.
get_kerning
(
left
,
right
,
c
);
}
};
inline
bool
sanitize
(
hb_sanitize_context_t
*
c
)
const
{
TRACE_SANITIZE
(
this
);
return_trace
(
likely
(
c
->
check_struct
(
this
)
&&
leftClassTable
.
sanitize
(
c
,
this
)
&&
rightClassTable
.
sanitize
(
c
,
this
)
&&
c
->
check_range
(
this
,
array
)));
}
protected:
KerxSubTableHeader
header
;
HBUINT32
rowWidth
;
/* The width, in bytes, of a row in the table. */
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录