Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
3246a8eb
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看板
提交
3246a8eb
编写于
11月 24, 2018
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[arrays] Merge ArrayOf's sub_array into hb_array_t's
上级
e6877e28
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
45 addition
and
29 deletion
+45
-29
src/hb-dsalgs.hh
src/hb-dsalgs.hh
+27
-17
src/hb-open-type.hh
src/hb-open-type.hh
+18
-12
未找到文件。
src/hb-dsalgs.hh
浏览文件 @
3246a8eb
...
...
@@ -567,6 +567,7 @@ struct hb_array_t
{
static_assert
((
bool
)
(
unsigned
)
hb_static_size
(
Type
),
""
);
inline
hb_array_t
(
void
)
:
arrayZ
(
nullptr
),
len
(
0
)
{}
inline
hb_array_t
(
const
hb_array_t
&
o
)
:
arrayZ
(
o
.
arrayZ
),
len
(
o
.
len
)
{}
inline
hb_array_t
(
Type
*
array_
,
unsigned
int
len_
)
:
arrayZ
(
array_
),
len
(
len_
)
{}
...
...
@@ -582,6 +583,24 @@ struct hb_array_t
inline
unsigned
int
get_size
(
void
)
const
{
return
len
*
sizeof
(
Type
);
}
inline
hb_array_t
<
Type
>
sub_array
(
unsigned
int
start_offset
,
unsigned
int
*
seg_count
/* IN/OUT */
)
const
{
if
(
!
seg_count
)
return
hb_array_t
<
Type
>
();
unsigned
int
count
=
len
;
if
(
unlikely
(
start_offset
>
count
))
count
=
0
;
else
count
-=
start_offset
;
count
=
*
seg_count
=
MIN
(
count
,
*
seg_count
);
return
hb_array_t
<
Type
>
(
arrayZ
+
start_offset
,
count
);
}
inline
hb_array_t
<
Type
>
sub_array
(
unsigned
int
start_offset
,
unsigned
int
seg_count
)
const
{
return
sub_array
(
start_offset
,
&
seg_count
);
}
inline
hb_bytes_t
as_bytes
(
void
)
const
{
return
hb_bytes_t
(
arrayZ
,
len
*
sizeof
(
Type
));
}
template
<
typename
T
>
inline
Type
*
lsearch
(
const
T
&
x
,
Type
*
not_found
=
nullptr
)
...
...
@@ -620,23 +639,8 @@ struct hb_array_t
::
qsort
(
arrayZ
+
start
,
end
-
start
,
sizeof
(
Type
),
Type
::
cmp
);
}
inline
hb_array_t
<
Type
>
sub_array
(
unsigned
int
start_offset
,
unsigned
int
seg_count
)
const
{
unsigned
int
count
=
len
;
if
(
unlikely
(
start_offset
>
count
))
count
=
0
;
else
count
-=
start_offset
;
count
=
MIN
(
count
,
seg_count
);
return
hb_array_t
<
Type
>
(
arrayZ
+
start_offset
,
count
);
}
inline
hb_bytes_t
as_bytes
(
void
)
const
{
return
hb_bytes_t
(
arrayZ
,
len
*
sizeof
(
Type
));
}
inline
void
free
(
void
)
{
::
free
((
void
*
)
arrayZ
);
arrayZ
=
nullptr
;
len
=
0
;
}
inline
void
free
(
void
)
{
::
free
((
void
*
)
arrayZ
);
arrayZ
=
nullptr
;
len
=
0
;
}
template
<
typename
hb_sanitize_context_t
>
inline
bool
sanitize
(
hb_sanitize_context_t
*
c
)
const
...
...
@@ -660,9 +664,15 @@ enum hb_bfind_not_found_t
template
<
typename
Type
>
struct
hb_sorted_array_t
:
hb_array_t
<
Type
>
{
inline
hb_sorted_array_t
(
void
)
:
hb_array_t
<
Type
>
()
{}
inline
hb_sorted_array_t
(
const
hb_array_t
<
Type
>
&
o
)
:
hb_array_t
<
Type
>
(
o
)
{}
inline
hb_sorted_array_t
(
Type
*
array_
,
unsigned
int
len_
)
:
hb_array_t
<
Type
>
(
array_
,
len_
)
{}
inline
hb_sorted_array_t
<
Type
>
sub_array
(
unsigned
int
start_offset
,
unsigned
int
*
seg_count
/* IN/OUT */
)
const
{
return
hb_sorted_array_t
<
Type
>
(((
const
hb_array_t
<
Type
>
*
)
(
this
))
->
sub_array
(
start_offset
,
seg_count
));
}
inline
hb_sorted_array_t
<
Type
>
sub_array
(
unsigned
int
start_offset
,
unsigned
int
seg_count
)
const
{
return
sub_array
(
start_offset
,
&
seg_count
);
}
template
<
typename
T
>
inline
Type
*
bsearch
(
const
T
&
x
,
Type
*
not_found
=
nullptr
)
{
...
...
src/hb-open-type.hh
浏览文件 @
3246a8eb
...
...
@@ -492,18 +492,6 @@ struct ArrayOf
HB_NO_CREATE_COPY_ASSIGN_TEMPLATE2
(
ArrayOf
,
Type
,
LenType
);
inline
const
Type
*
sub_array
(
unsigned
int
start_offset
,
unsigned
int
*
pcount
/* IN/OUT */
)
const
{
unsigned
int
count
=
len
;
if
(
unlikely
(
start_offset
>
count
))
count
=
0
;
else
count
-=
start_offset
;
count
=
MIN
(
count
,
*
pcount
);
*
pcount
=
count
;
return
arrayZ
+
start_offset
;
}
inline
const
Type
&
operator
[]
(
unsigned
int
i
)
const
{
if
(
unlikely
(
i
>=
len
))
return
Null
(
Type
);
...
...
@@ -523,6 +511,15 @@ struct ArrayOf
inline
hb_array_t
<
const
Type
>
as_array
(
void
)
const
{
return
hb_array
(
arrayZ
,
len
);
}
inline
hb_array_t
<
const
Type
>
sub_array
(
unsigned
int
start_offset
,
unsigned
int
count
)
const
{
return
as_array
().
sub_array
(
start_offset
,
count
);}
inline
hb_array_t
<
const
Type
>
sub_array
(
unsigned
int
start_offset
,
unsigned
int
*
count
/* IN/OUT */
)
const
{
return
as_array
().
sub_array
(
start_offset
,
count
);}
inline
hb_array_t
<
Type
>
sub_array
(
unsigned
int
start_offset
,
unsigned
int
count
)
{
return
as_array
().
sub_array
(
start_offset
,
count
);}
inline
hb_array_t
<
Type
>
sub_array
(
unsigned
int
start_offset
,
unsigned
int
*
count
/* IN/OUT */
)
{
return
as_array
().
sub_array
(
start_offset
,
count
);}
inline
bool
serialize
(
hb_serialize_context_t
*
c
,
unsigned
int
items_len
)
{
...
...
@@ -777,6 +774,15 @@ struct SortedArrayOf : ArrayOf<Type, LenType>
inline
hb_sorted_array_t
<
const
Type
>
as_array
(
void
)
const
{
return
hb_sorted_array
(
this
->
arrayZ
,
this
->
len
);
}
inline
hb_array_t
<
const
Type
>
sub_array
(
unsigned
int
start_offset
,
unsigned
int
count
)
const
{
return
as_array
().
sub_array
(
start_offset
,
count
);}
inline
hb_array_t
<
const
Type
>
sub_array
(
unsigned
int
start_offset
,
unsigned
int
*
count
/* IN/OUT */
)
const
{
return
as_array
().
sub_array
(
start_offset
,
count
);}
inline
hb_array_t
<
Type
>
sub_array
(
unsigned
int
start_offset
,
unsigned
int
count
)
{
return
as_array
().
sub_array
(
start_offset
,
count
);}
inline
hb_array_t
<
Type
>
sub_array
(
unsigned
int
start_offset
,
unsigned
int
*
count
/* IN/OUT */
)
{
return
as_array
().
sub_array
(
start_offset
,
count
);}
template
<
typename
T
>
inline
Type
&
bsearch
(
const
T
&
x
,
Type
&
not_found
=
Crap
(
Type
))
{
return
*
as_array
().
bsearch
(
x
,
&
not_found
);
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录