Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
bcd3ffc9
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看板
提交
bcd3ffc9
编写于
5月 16, 2019
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Whitespace
上级
05bc5f96
变更
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
浏览文件 @
bcd3ffc9
...
@@ -112,8 +112,8 @@ struct SingleSubstFormat1
...
@@ -112,8 +112,8 @@ struct SingleSubstFormat1
+
hb_iter
(
this
+
coverage
)
+
hb_iter
(
this
+
coverage
)
|
hb_filter
(
glyphset
)
|
hb_filter
(
glyphset
)
|
hb_map_retains_sorting
([
&
]
(
hb_codepoint_t
g
)
{
|
hb_map_retains_sorting
([
&
]
(
hb_codepoint_t
g
)
{
return
hb_codepoint_pair_t
(
glyph_map
[
g
],
return
hb_codepoint_pair_t
(
glyph_map
[
g
],
glyph_map
[(
g
+
delta
)
&
0xFFFF
]);
})
glyph_map
[(
g
+
delta
)
&
0xFFFF
]);
})
;
;
bool
ret
=
bool
(
it
);
bool
ret
=
bool
(
it
);
...
@@ -210,7 +210,7 @@ struct SingleSubstFormat2
...
@@ -210,7 +210,7 @@ struct SingleSubstFormat2
+
hb_zip
(
this
+
coverage
,
substitute
)
+
hb_zip
(
this
+
coverage
,
substitute
)
|
hb_filter
(
glyphset
,
hb_first
)
|
hb_filter
(
glyphset
,
hb_first
)
|
hb_map_retains_sorting
([
&
]
(
hb_pair_t
<
hb_codepoint_t
,
const
GlyphID
&>
p
)
->
hb_codepoint_pair_t
|
hb_map_retains_sorting
([
&
]
(
hb_pair_t
<
hb_codepoint_t
,
const
GlyphID
&>
p
)
->
hb_codepoint_pair_t
{
return
hb_pair
(
glyph_map
[
p
.
first
],
glyph_map
[
p
.
second
]);
})
{
return
hb_pair
(
glyph_map
[
p
.
first
],
glyph_map
[
p
.
second
]);
})
;
;
bool
ret
=
bool
(
it
);
bool
ret
=
bool
(
it
);
...
@@ -261,9 +261,9 @@ struct SingleSubst
...
@@ -261,9 +261,9 @@ struct SingleSubst
u
.
format
=
format
;
u
.
format
=
format
;
switch
(
u
.
format
)
{
switch
(
u
.
format
)
{
case
1
:
return_trace
(
u
.
format1
.
serialize
(
c
,
case
1
:
return_trace
(
u
.
format1
.
serialize
(
c
,
+
glyphs
+
glyphs
|
hb_map_retains_sorting
(
hb_first
),
|
hb_map_retains_sorting
(
hb_first
),
delta
));
delta
));
case
2
:
return_trace
(
u
.
format2
.
serialize
(
c
,
glyphs
));
case
2
:
return_trace
(
u
.
format2
.
serialize
(
c
,
glyphs
));
default:
return_trace
(
false
);
default:
return_trace
(
false
);
}
}
...
@@ -662,7 +662,7 @@ struct Ligature
...
@@ -662,7 +662,7 @@ struct Ligature
unsigned
int
count
=
component
.
lenP1
;
unsigned
int
count
=
component
.
lenP1
;
for
(
unsigned
int
i
=
1
;
i
<
count
;
i
++
)
for
(
unsigned
int
i
=
1
;
i
<
count
;
i
++
)
if
(
!
glyphs
->
has
(
component
[
i
]))
if
(
!
glyphs
->
has
(
component
[
i
]))
return
false
;
return
false
;
return
true
;
return
true
;
}
}
...
@@ -1018,12 +1018,12 @@ struct ReverseChainSingleSubstFormat1
...
@@ -1018,12 +1018,12 @@ struct ReverseChainSingleSubstFormat1
count
=
backtrack
.
len
;
count
=
backtrack
.
len
;
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
if
(
!
(
this
+
backtrack
[
i
]).
intersects
(
glyphs
))
if
(
!
(
this
+
backtrack
[
i
]).
intersects
(
glyphs
))
return
false
;
return
false
;
count
=
lookahead
.
len
;
count
=
lookahead
.
len
;
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
if
(
!
(
this
+
lookahead
[
i
]).
intersects
(
glyphs
))
if
(
!
(
this
+
lookahead
[
i
]).
intersects
(
glyphs
))
return
false
;
return
false
;
return
true
;
return
true
;
}
}
...
@@ -1084,7 +1084,7 @@ struct ReverseChainSingleSubstFormat1
...
@@ -1084,7 +1084,7 @@ struct ReverseChainSingleSubstFormat1
backtrack
.
len
,
(
HBUINT16
*
)
backtrack
.
arrayZ
,
backtrack
.
len
,
(
HBUINT16
*
)
backtrack
.
arrayZ
,
match_coverage
,
this
,
match_coverage
,
this
,
&
start_index
)
&&
&
start_index
)
&&
match_lookahead
(
c
,
match_lookahead
(
c
,
lookahead
.
len
,
(
HBUINT16
*
)
lookahead
.
arrayZ
,
lookahead
.
len
,
(
HBUINT16
*
)
lookahead
.
arrayZ
,
match_coverage
,
this
,
match_coverage
,
this
,
1
,
&
end_index
))
1
,
&
end_index
))
...
@@ -1287,8 +1287,8 @@ struct SubstLookup : Lookup
...
@@ -1287,8 +1287,8 @@ struct SubstLookup : Lookup
bool
serialize_single
(
hb_serialize_context_t
*
c
,
bool
serialize_single
(
hb_serialize_context_t
*
c
,
uint32_t
lookup_props
,
uint32_t
lookup_props
,
hb_sorted_array_t
<
const
GlyphID
>
glyphs
,
hb_sorted_array_t
<
const
GlyphID
>
glyphs
,
hb_array_t
<
const
GlyphID
>
substitutes
)
hb_array_t
<
const
GlyphID
>
substitutes
)
{
{
TRACE_SERIALIZE
(
this
);
TRACE_SERIALIZE
(
this
);
if
(
unlikely
(
!
Lookup
::
serialize
(
c
,
SubTable
::
Single
,
lookup_props
,
1
)))
return_trace
(
false
);
if
(
unlikely
(
!
Lookup
::
serialize
(
c
,
SubTable
::
Single
,
lookup_props
,
1
)))
return_trace
(
false
);
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录