Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
48de3730
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看板
提交
48de3730
编写于
11月 04, 2009
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Fix previous commit, ouch!
上级
e21899bc
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
20 addition
and
16 deletion
+20
-16
src/hb-open-type-private.hh
src/hb-open-type-private.hh
+12
-0
src/hb-ot-layout-common-private.hh
src/hb-ot-layout-common-private.hh
+4
-8
src/hb-ot-layout-gdef-private.hh
src/hb-ot-layout-gdef-private.hh
+4
-8
未找到文件。
src/hb-open-type-private.hh
浏览文件 @
48de3730
...
...
@@ -511,6 +511,18 @@ struct GenericArrayOf
const
Type
*
const_array
(
void
)
const
{
return
CONST_ARRAY_AFTER
(
Type
,
len
);
}
Type
*
array
(
void
)
{
return
ARRAY_AFTER
(
Type
,
len
);
}
const
Type
*
const_sub_array
(
unsigned
int
start_offset
,
unsigned
int
*
pcount
/* IN/OUT */
)
const
{
unsigned
int
count
=
len
;
if
(
HB_UNLIKELY
(
start_offset
>
count
))
count
=
0
;
else
count
-=
start_offset
;
count
=
MIN
(
count
,
*
pcount
);
*
pcount
=
count
;
return
const_array
()
+
start_offset
;
}
inline
const
Type
&
operator
[]
(
unsigned
int
i
)
const
{
if
(
HB_UNLIKELY
(
i
>=
len
))
return
Null
(
Type
);
...
...
src/hb-ot-layout-common-private.hh
浏览文件 @
48de3730
...
...
@@ -74,12 +74,10 @@ struct RecordArrayOf : ArrayOf<Record<Type> > {
hb_tag_t
*
record_tags
/* OUT */
)
const
{
if
(
record_count
)
{
unsigned
int
count
=
MIN
(
MIN
(
0
,
(
unsigned
int
)
this
->
len
-
start_offset
),
*
record_count
);
const
Record
<
Type
>
*
array
=
this
->
const_array
()
+
start_offse
t
;
const
Record
<
Type
>
*
array
=
this
->
const_sub_array
(
start_offset
,
record_count
);
unsigned
int
count
=
*
record_coun
t
;
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
record_tags
[
i
]
=
array
[
i
].
tag
;
*
record_count
=
this
->
len
;
}
return
this
->
len
;
}
...
...
@@ -128,12 +126,10 @@ struct IndexArray : ArrayOf<USHORT>
unsigned
int
*
_indexes
/* OUT */
)
const
{
if
(
_count
)
{
unsigned
int
count
=
MIN
(
MIN
(
0
,
(
unsigned
int
)
this
->
len
-
start_offset
),
*
_count
);
const
USHORT
*
array
=
this
->
const_array
()
+
start_offse
t
;
const
USHORT
*
array
=
this
->
const_sub_array
(
start_offset
,
_count
);
unsigned
int
count
=
*
_coun
t
;
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
_indexes
[
i
]
=
array
[
i
];
*
_count
=
this
->
len
;
}
return
this
->
len
;
}
...
...
src/hb-ot-layout-gdef-private.hh
浏览文件 @
48de3730
...
...
@@ -58,12 +58,10 @@ struct AttachList
const
AttachPoint
&
points
=
this
+
attachPoint
[
index
];
if
(
point_count
)
{
const
USHORT
*
array
=
points
.
const_
array
()
+
start_offset
;
unsigned
int
count
=
MIN
(
MIN
(
0
,
(
unsigned
int
)
points
.
len
-
start_offset
),
*
point_count
)
;
const
USHORT
*
array
=
points
.
const_
sub_array
(
start_offset
,
point_count
)
;
unsigned
int
count
=
*
point_count
;
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
point_array
[
i
]
=
array
[
i
];
*
point_count
=
points
.
len
;
}
return
points
.
len
;
...
...
@@ -198,12 +196,10 @@ struct LigGlyph
int
*
caret_array
/* OUT */
)
const
{
if
(
caret_count
)
{
const
OffsetTo
<
CaretValue
>
*
array
=
carets
.
const_
array
()
+
start_offset
;
unsigned
int
count
=
MIN
(
MIN
(
0
,
(
unsigned
int
)
carets
.
len
-
start_offset
),
*
caret_count
)
;
const
OffsetTo
<
CaretValue
>
*
array
=
carets
.
const_
sub_array
(
start_offset
,
caret_count
)
;
unsigned
int
count
=
*
caret_count
;
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
caret_array
[
i
]
=
(
this
+
array
[
i
]).
get_caret_value
(
context
,
glyph_id
);
*
caret_count
=
carets
.
len
;
}
return
carets
.
len
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录