Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
ed2a4042
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看板
提交
ed2a4042
编写于
10月 07, 2018
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[kerx] Clean up Format0
上级
4c3b19d5
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
12 addition
and
36 deletion
+12
-36
src/hb-aat-layout-kerx-table.hh
src/hb-aat-layout-kerx-table.hh
+12
-36
未找到文件。
src/hb-aat-layout-kerx-table.hh
浏览文件 @
ed2a4042
...
...
@@ -30,6 +30,7 @@
#include "hb-open-type.hh"
#include "hb-aat-layout-common.hh"
#include "hb-ot-kern-table.hh"
/*
* kerx -- Extended Kerning
...
...
@@ -43,33 +44,17 @@ namespace AAT {
using
namespace
OT
;
struct
Kerx
Format0Records
struct
Kerx
SubTableFormat0
{
inline
bool
sanitize
(
hb_sanitize_context_t
*
c
)
const
inline
int
get_kerning
(
hb_codepoint_t
left
,
hb_codepoint_t
right
)
const
{
TRACE_SANITIZE
(
this
);
return_trace
(
likely
(
c
->
check_struct
(
this
)));
hb_glyph_pair_t
pair
=
{
left
,
right
};
int
i
=
pairs
.
bsearch
(
pair
);
if
(
i
==
-
1
)
return
0
;
return
pairs
[
i
].
get_kerning
();
}
protected:
GlyphID
left
;
GlyphID
right
;
FWORD
value
;
public:
DEFINE_SIZE_STATIC
(
6
);
};
struct
KerxSubTableFormat0
{
// TODO(ebraminio) Enable when we got suitable BinSearchArrayOf
// inline int get_kerning (hb_codepoint_t left, hb_codepoint_t right) const
// {
// hb_glyph_pair_t pair = {left, right};
// int i = pairs.bsearch (pair);
// if (i == -1)
// return 0;
// return pairs[i].get_kerning ();
// }
inline
bool
apply
(
hb_aat_apply_context_t
*
c
)
const
{
TRACE_APPLY
(
this
);
...
...
@@ -82,23 +67,14 @@ struct KerxSubTableFormat0
inline
bool
sanitize
(
hb_sanitize_context_t
*
c
)
const
{
TRACE_SANITIZE
(
this
);
return_trace
(
likely
(
c
->
check_struct
(
this
)
&&
recordsZ
.
sanitize
(
c
,
nPairs
)));
return_trace
(
likely
(
pairs
.
sanitize
(
c
)));
}
protected:
// TODO(ebraminio): A custom version of "BinSearchArrayOf<KerxPair> pairs;" is
// needed here to use HBUINT32 instead
HBUINT32
nPairs
;
/* The number of kerning pairs in this subtable */
HBUINT32
searchRange
;
/* The largest power of two less than or equal to the value of nPairs,
* multiplied by the size in bytes of an entry in the subtable. */
HBUINT32
entrySelector
;
/* This is calculated as log2 of the largest power of two less
* than or equal to the value of nPairs. */
HBUINT32
rangeShift
;
/* The value of nPairs minus the largest power of two less than or equal to nPairs. */
UnsizedArrayOf
<
KerxFormat0Records
>
recordsZ
;
/* VAR=nPairs */
BinSearchArrayOf
<
KernPair
,
HBUINT32
>
pairs
;
/* Sorted kern records. */
public:
DEFINE_SIZE_ARRAY
(
16
,
recordsZ
);
DEFINE_SIZE_ARRAY
(
16
,
pairs
);
};
struct
KerxSubTableFormat1
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录