Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
d822e0a1
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看板
提交
d822e0a1
编写于
5月 15, 2019
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[array] Adjust operator!=
See comments.
上级
203ea58b
变更
2
隐藏空白更改
内联
并排
Showing
2 changed file
with
7 addition
and
1 deletion
+7
-1
src/hb-array.hh
src/hb-array.hh
+6
-1
src/hb-vector.hh
src/hb-vector.hh
+1
-0
未找到文件。
src/hb-array.hh
浏览文件 @
d822e0a1
...
...
@@ -84,8 +84,13 @@ struct hb_array_t : hb_iter_with_fallback_t<hb_array_t<Type>, Type&>
arrayZ
-=
n
;
}
unsigned
__len__
()
const
{
return
length
;
}
/* Ouch. The operator== compares the contents of the array. For range-based for loops,
* it's best if we can just compare arrayZ, though comparing contents is still fast,
* but also would require that Type has operator==. As such, we optimize this operator
* for range-based for loop and just compare arrayZ. No need to compare length, as we
* assume we're only compared to .end(). */
bool
operator
!=
(
const
hb_array_t
&
o
)
const
{
return
arrayZ
!=
o
.
arrayZ
||
length
!=
o
.
length
||
backwards_length
!=
o
.
backwards_length
;
}
{
return
arrayZ
!=
o
.
arrayZ
;
}
/* Extra operators.
*/
...
...
src/hb-vector.hh
浏览文件 @
d822e0a1
...
...
@@ -103,6 +103,7 @@ struct hb_vector_t
{
return
hb_bytes_t
((
const
char
*
)
arrayZ
,
length
*
item_size
);
}
bool
operator
==
(
const
hb_vector_t
&
o
)
const
{
return
as_array
()
==
o
.
as_array
();
}
bool
operator
!=
(
const
hb_vector_t
&
o
)
const
{
return
!
(
*
this
==
o
);
}
uint32_t
hash
()
const
{
return
as_array
().
hash
();
}
Type
&
operator
[]
(
int
i_
)
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录