Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
ff05d257
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看板
体验新版 GitCode,发现更多精彩内容 >>
提交
ff05d257
编写于
5月 20, 2009
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[HB] Move lookup types enum into subtable class
上级
263bbef7
变更
2
显示空白变更内容
内联
并排
Showing
2 changed file
with
55 addition
and
55 deletion
+55
-55
src/hb-ot-layout-gpos-private.h
src/hb-ot-layout-gpos-private.h
+33
-33
src/hb-ot-layout-gsub-private.h
src/hb-ot-layout-gsub-private.h
+22
-22
未找到文件。
src/hb-ot-layout-gpos-private.h
浏览文件 @
ff05d257
...
...
@@ -1064,35 +1064,35 @@ ASSERT_SIZE (ExtensionPos, 2);
* PosLookup
*/
enum
{
GPOS_Single
=
1
,
GPOS_Pair
=
2
,
GPOS_Cursive
=
3
,
GPOS_MarkBase
=
4
,
GPOS_MarkLig
=
5
,
GPOS_MarkMark
=
6
,
GPOS_Context
=
7
,
GPOS_ChainContext
=
8
,
GPOS_Extension
=
9
,
};
struct
PosLookupSubTable
{
friend
struct
PosLookup
;
enum
{
Single
=
1
,
Pair
=
2
,
Cursive
=
3
,
MarkBase
=
4
,
MarkLig
=
5
,
MarkMark
=
6
,
Context
=
7
,
ChainContext
=
8
,
Extension
=
9
,
};
inline
bool
apply
(
APPLY_ARG_DEF
,
unsigned
int
lookup_type
)
const
{
switch
(
lookup_type
)
{
case
GPOS_Single
:
return
u
.
single
->
apply
(
APPLY_ARG
);
case
GPOS_
Pair
:
return
u
.
pair
->
apply
(
APPLY_ARG
);
case
GPOS_Cursive
:
return
u
.
cursive
->
apply
(
APPLY_ARG
);
case
GPOS_MarkBase
:
return
u
.
markBase
->
apply
(
APPLY_ARG
);
case
GPOS_MarkLig
:
return
u
.
markLig
->
apply
(
APPLY_ARG
);
case
GPOS_MarkMark
:
return
u
.
markMark
->
apply
(
APPLY_ARG
);
case
GPOS_Context
:
return
u
.
context
->
apply
(
APPLY_ARG
);
case
GPOS_
ChainContext
:
return
u
.
chainContext
->
apply
(
APPLY_ARG
);
case
GPOS_
Extension
:
return
u
.
extension
->
apply
(
APPLY_ARG
);
case
Single
:
return
u
.
single
->
apply
(
APPLY_ARG
);
case
Pair
:
return
u
.
pair
->
apply
(
APPLY_ARG
);
case
Cursive
:
return
u
.
cursive
->
apply
(
APPLY_ARG
);
case
MarkBase
:
return
u
.
markBase
->
apply
(
APPLY_ARG
);
case
MarkLig
:
return
u
.
markLig
->
apply
(
APPLY_ARG
);
case
MarkMark
:
return
u
.
markMark
->
apply
(
APPLY_ARG
);
case
Context
:
return
u
.
context
->
apply
(
APPLY_ARG
);
case
ChainContext
:
return
u
.
chainContext
->
apply
(
APPLY_ARG
);
case
Extension
:
return
u
.
extension
->
apply
(
APPLY_ARG
);
default:
return
false
;
}
}
...
...
@@ -1127,7 +1127,7 @@ struct PosLookup : Lookup
{
unsigned
int
type
=
get_type
();
if
(
HB_UNLIKELY
(
type
==
GPOS_
Extension
))
if
(
HB_UNLIKELY
(
type
==
PosLookupSubTable
::
Extension
))
{
unsigned
int
count
=
get_subtable_count
();
type
=
get_subtable
(
0
).
u
.
extension
->
get_type
();
...
...
@@ -1240,7 +1240,7 @@ inline bool ExtensionPosFormat1::apply (APPLY_ARG_DEF) const
{
unsigned
int
lookup_type
=
get_type
();
if
(
HB_UNLIKELY
(
lookup_type
==
GPOS_
Extension
))
if
(
HB_UNLIKELY
(
lookup_type
==
PosLookupSubTable
::
Extension
))
return
false
;
return
((
PosLookupSubTable
&
)
*
(((
char
*
)
this
)
+
get_offset
())).
apply
(
APPLY_ARG
,
lookup_type
);
...
...
src/hb-ot-layout-gsub-private.h
浏览文件 @
ff05d257
...
...
@@ -630,32 +630,32 @@ ASSERT_SIZE (ReverseChainSingleSubst, 2);
* SubstLookup
*/
enum
{
GSUB_Single
=
1
,
GSUB_Multiple
=
2
,
GSUB_Alternate
=
3
,
GSUB_Ligature
=
4
,
GSUB_Context
=
5
,
GSUB_ChainContext
=
6
,
GSUB_Extension
=
7
,
GSUB_ReverseChainSingle
=
8
,
};
struct
SubstLookupSubTable
{
friend
struct
SubstLookup
;
enum
{
Single
=
1
,
Multiple
=
2
,
Alternate
=
3
,
Ligature
=
4
,
Context
=
5
,
ChainContext
=
6
,
Extension
=
7
,
ReverseChainSingle
=
8
,
};
inline
bool
apply
(
APPLY_ARG_DEF
,
unsigned
int
lookup_type
)
const
{
switch
(
lookup_type
)
{
case
GSUB_Single
:
return
u
.
single
->
apply
(
APPLY_ARG
);
case
GSUB_Multiple
:
return
u
.
multiple
->
apply
(
APPLY_ARG
);
case
GSUB_
Alternate
:
return
u
.
alternate
->
apply
(
APPLY_ARG
);
case
GSUB_Ligature
:
return
u
.
ligature
->
apply
(
APPLY_ARG
);
case
GSUB_Context
:
return
u
.
context
->
apply
(
APPLY_ARG
);
case
GSUB_
ChainContext
:
return
u
.
chainContext
->
apply
(
APPLY_ARG
);
case
GSUB_
Extension
:
return
u
.
extension
->
apply
(
APPLY_ARG
);
case
GSUB_
ReverseChainSingle
:
return
u
.
reverseChainContextSingle
->
apply
(
APPLY_ARG
);
case
Single
:
return
u
.
single
->
apply
(
APPLY_ARG
);
case
Multiple
:
return
u
.
multiple
->
apply
(
APPLY_ARG
);
case
Alternate
:
return
u
.
alternate
->
apply
(
APPLY_ARG
);
case
Ligature
:
return
u
.
ligature
->
apply
(
APPLY_ARG
);
case
Context
:
return
u
.
context
->
apply
(
APPLY_ARG
);
case
ChainContext
:
return
u
.
chainContext
->
apply
(
APPLY_ARG
);
case
Extension
:
return
u
.
extension
->
apply
(
APPLY_ARG
);
case
ReverseChainSingle
:
return
u
.
reverseChainContextSingle
->
apply
(
APPLY_ARG
);
default:
return
false
;
}
}
...
...
@@ -689,7 +689,7 @@ struct SubstLookup : Lookup
{
unsigned
int
type
=
get_type
();
if
(
HB_UNLIKELY
(
type
==
GSUB_
Extension
))
if
(
HB_UNLIKELY
(
type
==
SubstLookupSubTable
::
Extension
))
{
unsigned
int
count
=
get_subtable_count
();
type
=
get_subtable
(
0
).
u
.
extension
->
get_type
();
...
...
@@ -705,7 +705,7 @@ struct SubstLookup : Lookup
inline
bool
is_reverse
(
void
)
const
{
return
HB_UNLIKELY
(
get_effective_type
()
==
GSUB_
ReverseChainSingle
);
return
HB_UNLIKELY
(
get_effective_type
()
==
SubstLookupSubTable
::
ReverseChainSingle
);
}
inline
bool
apply_subtables
(
hb_ot_layout_t
*
layout
,
...
...
@@ -819,7 +819,7 @@ inline bool ExtensionSubstFormat1::apply (APPLY_ARG_DEF) const
{
unsigned
int
lookup_type
=
get_type
();
if
(
HB_UNLIKELY
(
lookup_type
==
GSUB_
Extension
))
if
(
HB_UNLIKELY
(
lookup_type
==
SubstLookupSubTable
::
Extension
))
return
false
;
return
((
SubstLookupSubTable
&
)
*
(((
char
*
)
this
)
+
get_offset
())).
apply
(
APPLY_ARG
,
lookup_type
);
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录