Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
f8a0ec50
T
Third Party Harfbuzz
项目概览
OpenHarmony
/
Third Party Harfbuzz
12 个月 前同步成功
通知
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看板
体验新版 GitCode,发现更多精彩内容 >>
提交
f8a0ec50
编写于
10月 15, 2017
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[set] Add fallback implementation of int-vector type
上级
deed4a48
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
45 addition
and
19 deletion
+45
-19
src/hb-set-private.hh
src/hb-set-private.hh
+45
-19
未找到文件。
src/hb-set-private.hh
浏览文件 @
f8a0ec50
...
...
@@ -35,31 +35,64 @@
* hb_set_t
*/
struct
Union
struct
HbOpOr
{
static
const
bool
passthru_left
=
true
;
static
const
bool
passthru_right
=
true
;
template
<
typename
T
>
static
void
process
(
T
&
o
,
const
T
&
a
,
const
T
&
b
)
{
o
=
a
|
b
;
}
};
struct
Intersect
struct
HbOpAnd
{
static
const
bool
passthru_left
=
false
;
static
const
bool
passthru_right
=
false
;
template
<
typename
T
>
static
void
process
(
T
&
o
,
const
T
&
a
,
const
T
&
b
)
{
o
=
a
&
b
;
}
};
struct
Subtract
struct
HbOpMinus
{
static
const
bool
passthru_left
=
true
;
static
const
bool
passthru_right
=
false
;
template
<
typename
T
>
static
void
process
(
T
&
o
,
const
T
&
a
,
const
T
&
b
)
{
o
=
a
&
~
b
;
}
};
struct
SymmetricDifference
struct
HbOpXor
{
static
const
bool
passthru_left
=
true
;
static
const
bool
passthru_right
=
true
;
template
<
typename
T
>
static
void
process
(
T
&
o
,
const
T
&
a
,
const
T
&
b
)
{
o
=
a
^
b
;
}
};
template
<
typename
elt_t
,
unsigned
int
byte_size
>
struct
vector_like_t
{
elt_t
&
operator
[]
(
unsigned
int
i
)
{
return
v
[
i
];
}
const
elt_t
&
operator
[]
(
unsigned
int
i
)
const
{
return
v
[
i
];
}
template
<
class
Op
>
inline
vector_like_t
process
(
const
vector_like_t
&
o
)
const
{
vector_like_t
r
;
for
(
unsigned
int
i
=
0
;
i
<
ARRAY_LENGTH
(
v
);
i
++
)
Op
::
process
(
r
.
v
[
i
],
v
[
i
],
o
.
v
[
i
]);
return
r
;
}
inline
vector_like_t
operator
|
(
const
vector_like_t
&
o
)
const
{
return
process
<
HbOpOr
>
(
o
);
}
inline
vector_like_t
operator
&
(
const
vector_like_t
&
o
)
const
{
return
process
<
HbOpAnd
>
(
o
);
}
inline
vector_like_t
operator
^
(
const
vector_like_t
&
o
)
const
{
return
process
<
HbOpXor
>
(
o
);
}
inline
vector_like_t
operator
~
()
const
{
vector_like_t
r
;
for
(
unsigned
int
i
=
0
;
i
<
ARRAY_LENGTH
(
v
);
i
++
)
r
.
v
[
i
]
=
~
v
[
i
];
return
r
;
}
private:
static_assert
(
byte_size
/
sizeof
(
elt_t
)
*
sizeof
(
elt_t
)
==
byte_size
);
elt_t
v
[
byte_size
/
sizeof
(
elt_t
)];
};
struct
hb_set_t
{
struct
page_map_t
...
...
@@ -156,22 +189,15 @@ struct hb_set_t
return
0
;
}
typedef
uint64_t
elt_t
;
static
const
unsigned
int
PAGE_BITS
=
512
;
/* Use to tune. */
static_assert
((
PAGE_BITS
&
((
PAGE_BITS
)
-
1
))
==
0
,
""
);
#if 1
typedef
uint64_t
elt_t
;
#if 0
typedef elt_t vector_t __attribute__((vector_size (PAGE_BITS / 8)));
#else
struct
vector_t
{
elt_t
&
operator
[]
(
unsigned
int
i
)
{
return
v
[
i
];
}
const
elt_t
&
operator
[]
(
unsigned
int
i
)
const
{
return
v
[
i
];
}
private:
elt_t
v
[
PAGE_BITS
/
(
sizeof
(
elt_t
)
*
8
)];
};
typedef
vector_like_t
<
elt_t
,
PAGE_BITS
/
8
>
vector_t
;
#endif
vector_t
v
;
...
...
@@ -383,19 +409,19 @@ struct hb_set_t
inline
void
union_
(
const
hb_set_t
*
other
)
{
process
<
Union
>
(
other
);
process
<
HbOpOr
>
(
other
);
}
inline
void
intersect
(
const
hb_set_t
*
other
)
{
process
<
Intersect
>
(
other
);
process
<
HbOpAnd
>
(
other
);
}
inline
void
subtract
(
const
hb_set_t
*
other
)
{
process
<
Subtract
>
(
other
);
process
<
HbOpMinus
>
(
other
);
}
inline
void
symmetric_difference
(
const
hb_set_t
*
other
)
{
process
<
SymmetricDifference
>
(
other
);
process
<
HbOpXor
>
(
other
);
}
inline
bool
next
(
hb_codepoint_t
*
codepoint
)
const
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录