Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
e700392f
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看板
提交
e700392f
编写于
11月 24, 2018
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[arrays] Port SortedArrayOf.bsearch/bfind to hb_sorted_array_t's
上级
e604306f
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
23 addition
and
71 deletion
+23
-71
src/hb-dsalgs.hh
src/hb-dsalgs.hh
+3
-6
src/hb-open-type.hh
src/hb-open-type.hh
+10
-40
src/hb-vector.hh
src/hb-vector.hh
+10
-25
未找到文件。
src/hb-dsalgs.hh
浏览文件 @
e700392f
...
...
@@ -635,22 +635,19 @@ struct hb_sorted_array_t : hb_array_t<Type>
inline
hb_sorted_array_t
(
Type
*
array_
,
unsigned
int
len_
)
:
hb_array_t
<
Type
>
(
array_
,
len_
)
{}
template
<
typename
T
>
inline
Type
*
bsearch
(
const
T
&
x
,
Type
*
not_found
=
nullptr
)
inline
Type
*
bsearch
(
const
T
&
x
,
Type
*
not_found
=
nullptr
)
{
unsigned
int
i
;
return
bfind
(
x
,
&
i
)
?
&
this
->
arrayZ
[
i
]
:
not_found
;
}
template
<
typename
T
>
inline
const
Type
*
bsearch
(
const
T
&
x
,
const
Type
*
not_found
=
nullptr
)
const
inline
const
Type
*
bsearch
(
const
T
&
x
,
const
Type
*
not_found
=
nullptr
)
const
{
unsigned
int
i
;
return
bfind
(
x
,
&
i
)
?
&
this
->
arrayZ
[
i
]
:
not_found
;
}
template
<
typename
T
>
inline
bool
bfind
(
const
T
&
x
,
unsigned
int
*
i
=
nullptr
)
const
inline
bool
bfind
(
const
T
&
x
,
unsigned
int
*
i
=
nullptr
)
const
{
int
min
=
0
,
max
=
(
int
)
this
->
len
-
1
;
const
Type
*
array
=
this
->
arrayZ
;
...
...
src/hb-open-type.hh
浏览文件 @
e700392f
...
...
@@ -551,14 +551,10 @@ struct ArrayOf
template
<
typename
T
>
inline
Type
&
lsearch
(
const
T
&
x
)
{
return
*
as_array
().
lsearch
(
x
,
&
Crap
(
T
));
}
{
return
*
as_array
().
lsearch
(
x
,
&
Crap
(
T
));
}
template
<
typename
T
>
inline
const
Type
&
lsearch
(
const
T
&
x
)
const
{
return
*
as_array
().
lsearch
(
x
,
&
Null
(
T
));
}
{
return
*
as_array
().
lsearch
(
x
,
&
Null
(
T
));
}
inline
void
qsort
(
void
)
{
...
...
@@ -745,46 +741,20 @@ struct ArrayOfM1
template
<
typename
Type
,
typename
LenType
=
HBUINT16
>
struct
SortedArrayOf
:
ArrayOf
<
Type
,
LenType
>
{
inline
hb_sorted_array_t
<
Type
>
as_array
(
void
)
{
return
hb_sorted_array
(
this
->
arrayZ
,
this
->
len
);
}
inline
hb_sorted_array_t
<
const
Type
>
as_array
(
void
)
const
{
return
hb_sorted_array
(
this
->
arrayZ
,
this
->
len
);
}
template
<
typename
T
>
inline
Type
&
bsearch
(
const
T
&
x
)
{
unsigned
int
i
;
return
bfind
(
x
,
&
i
)
?
this
->
arrayZ
[
i
]
:
Crap
(
Type
);
}
{
return
*
as_array
().
bsearch
(
x
,
&
Crap
(
Type
));
}
template
<
typename
T
>
inline
const
Type
&
bsearch
(
const
T
&
x
)
const
{
unsigned
int
i
;
return
bfind
(
x
,
&
i
)
?
this
->
arrayZ
[
i
]
:
Null
(
Type
);
}
{
return
*
as_array
().
bsearch
(
x
,
&
Null
(
Type
));
}
template
<
typename
T
>
inline
bool
bfind
(
const
T
&
x
,
unsigned
int
*
i
=
nullptr
)
const
{
int
min
=
0
,
max
=
(
int
)
this
->
len
-
1
;
const
Type
*
array
=
this
->
arrayZ
;
while
(
min
<=
max
)
{
int
mid
=
((
unsigned
int
)
min
+
(
unsigned
int
)
max
)
/
2
;
int
c
=
array
[
mid
].
cmp
(
x
);
if
(
c
<
0
)
max
=
mid
-
1
;
else
if
(
c
>
0
)
min
=
mid
+
1
;
else
{
if
(
i
)
*
i
=
mid
;
return
true
;
}
}
if
(
i
)
{
if
(
max
<
0
||
(
max
<
(
int
)
this
->
len
&&
array
[
max
].
cmp
(
x
)
>
0
))
max
++
;
*
i
=
max
;
}
return
false
;
}
{
return
as_array
().
bfind
(
x
,
i
);
}
};
/*
...
...
src/hb-vector.hh
浏览文件 @
e700392f
...
...
@@ -236,36 +236,21 @@ struct hb_vector_t
}
template
<
typename
T
>
inline
Type
*
lsearch
(
const
T
&
x
,
Type
*
not_found
=
nullptr
)
{
return
as_array
().
lsearch
(
x
,
not_found
);
}
inline
Type
*
lsearch
(
const
T
&
x
,
Type
*
not_found
=
nullptr
)
{
return
as_array
().
lsearch
(
x
,
not_found
);
}
template
<
typename
T
>
inline
const
Type
*
lsearch
(
const
T
&
x
,
const
Type
*
not_found
=
nullptr
)
const
{
return
as_array
().
lsearch
(
x
,
not_found
);
}
inline
const
Type
*
lsearch
(
const
T
&
x
,
const
Type
*
not_found
=
nullptr
)
const
{
return
as_array
().
lsearch
(
x
,
not_found
);
}
template
<
typename
T
>
inline
Type
*
bsearch
(
const
T
&
x
,
Type
*
not_found
=
nullptr
)
{
return
as_sorted_array
().
bsearch
(
x
,
not_found
);
}
inline
Type
*
bsearch
(
const
T
&
x
,
Type
*
not_found
=
nullptr
)
{
return
as_sorted_array
().
bsearch
(
x
,
not_found
);
}
template
<
typename
T
>
inline
const
Type
*
bsearch
(
const
T
&
x
,
const
Type
*
not_found
=
nullptr
)
const
{
return
as_sorted_array
().
bsearch
(
x
,
not_found
);
}
inline
const
Type
*
bsearch
(
const
T
&
x
,
const
Type
*
not_found
=
nullptr
)
const
{
return
as_sorted_array
().
bsearch
(
x
,
not_found
);
}
template
<
typename
T
>
inline
bool
bfind
(
const
T
&
x
,
unsigned
int
*
i
=
nullptr
)
const
{
return
as_sorted_array
().
bfind
(
x
,
i
);
}
inline
bool
bfind
(
const
T
&
x
,
unsigned
int
*
i
=
nullptr
)
const
{
return
as_sorted_array
().
bfind
(
x
,
i
);
}
};
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录