hcq/oceanbase
1
0
Fork 0
Code Issues Pull Requests Actions 2 Packages Projects Releases Wiki Activity

patch 4.0

Browse Source
This commit is contained in:
wangzelin.wzl
2022-10-24 10:34:53 +08:00
parent 4ad6e00ec3
commit 93a1074b0c
10533 changed files with 2588271 additions and 2299373 deletions
Download Patch File Download Diff File Expand all files Collapse all files

64
deps/oblib/unittest/lib/hash/test_placement_hashset.cpp vendored
View File

@ -29,40 +29,50 @@ TEST(TestObPlacementHashSet, many_buckets)
{
const uint64_t N = 10345;
ObPlacementHashSet<int64_t, N> hashset;
for (uint64_t i = 0; i < N; i++) {
for (uint64_t i = 0; i < N; i++)
{
ASSERT_EQ(OB_HASH_NOT_EXIST, hashset.exist_refactored(i));
}
for (uint64_t i = 0; i < N; i++) {
for (uint64_t i = 0; i < N; i++)
{
ASSERT_EQ(OB_SUCCESS, hashset.set_refactored(i));
}
ASSERT_EQ(OB_HASH_FULL, hashset.set_refactored(N));
for (uint64_t i = 0; i < N; i++) {
for (uint64_t i = 0; i < N; i++)
{
ASSERT_EQ(OB_HASH_EXIST, hashset.exist_refactored(i));
}
for (uint64_t i = 0; i < N; i++) {
for (uint64_t i = 0; i < N; i++)
{
ASSERT_EQ(OB_HASH_EXIST, hashset.set_refactored(i));
}
ASSERT_EQ(OB_HASH_FULL, hashset.set_refactored(N));
for (uint64_t i = 0; i < N; i++) {
for (uint64_t i = 0; i < N; i++)
{
ASSERT_EQ(OB_HASH_EXIST, hashset.exist_refactored(i));
}
hashset.clear();
for (uint64_t i = 0; i < N; i++) {
for (uint64_t i = 0; i < N; i++)
{
ASSERT_EQ(OB_HASH_NOT_EXIST, hashset.exist_refactored(i));
}
for (uint64_t i = 0; i < N; i++) {
for (uint64_t i = 0; i < N; i++)
{
ASSERT_EQ(OB_SUCCESS, hashset.set_refactored(i));
}
ASSERT_EQ(OB_HASH_FULL, hashset.set_refactored(N));
for (uint64_t i = 0; i < N; i++) {
for (uint64_t i = 0; i < N; i++)
{
ASSERT_EQ(OB_HASH_EXIST, hashset.exist_refactored(i));
}
for (uint64_t i = 0; i < N; i++) {
for (uint64_t i = 0; i < N; i++)
{
ASSERT_EQ(OB_HASH_EXIST, hashset.set_refactored(i));
}
ASSERT_EQ(OB_HASH_FULL, hashset.set_refactored(N));
for (uint64_t i = 0; i < N; i++) {
for (uint64_t i = 0; i < N; i++)
{
ASSERT_EQ(OB_HASH_EXIST, hashset.exist_refactored(i));
}
}
@ -71,46 +81,56 @@ TEST(TestObPlacementHashSet, many_buckets2)
{
const uint64_t N = 10345;
ObPlacementHashSet<int64_t, N> hashset;
for (uint64_t i = N; i > 0; i--) {
for (uint64_t i = N; i > 0; i--)
{
ASSERT_EQ(OB_HASH_NOT_EXIST, hashset.exist_refactored(i));
}
for (uint64_t i = N; i > 0; i--) {
for (uint64_t i = N; i > 0; i--)
{
ASSERT_EQ(OB_SUCCESS, hashset.set_refactored(i));
}
ASSERT_EQ(OB_HASH_FULL, hashset.set_refactored(0));
for (uint64_t i = N; i > 0; i--) {
for (uint64_t i = N; i > 0; i--)
{
ASSERT_EQ(OB_HASH_EXIST, hashset.exist_refactored(i));
}
for (uint64_t i = N; i > 0; i--) {
for (uint64_t i = N; i > 0; i--)
{
ASSERT_EQ(OB_HASH_EXIST, hashset.set_refactored(i));
}
ASSERT_EQ(OB_HASH_FULL, hashset.set_refactored(0));
for (uint64_t i = N; i > 0; i--) {
for (uint64_t i = N; i > 0; i--)
{
ASSERT_EQ(OB_HASH_EXIST, hashset.exist_refactored(i));
}
hashset.clear();
for (uint64_t i = N; i > 0; i--) {
for (uint64_t i = N; i > 0; i--)
{
ASSERT_EQ(OB_HASH_NOT_EXIST, hashset.exist_refactored(i));
}
for (uint64_t i = N; i > 0; i--) {
for (uint64_t i = N; i > 0; i--)
{
ASSERT_EQ(OB_SUCCESS, hashset.set_refactored(i));
}
ASSERT_EQ(OB_HASH_FULL, hashset.set_refactored(0));
for (uint64_t i = N; i > 0; i--) {
for (uint64_t i = N; i > 0; i--)
{
ASSERT_EQ(OB_HASH_EXIST, hashset.exist_refactored(i));
}
for (uint64_t i = N; i > 0; i--) {
for (uint64_t i = N; i > 0; i--)
{
ASSERT_EQ(OB_HASH_EXIST, hashset.set_refactored(i));
}
ASSERT_EQ(OB_HASH_FULL, hashset.set_refactored(0));
for (uint64_t i = N; i > 0; i--) {
for (uint64_t i = N; i > 0; i--)
{
ASSERT_EQ(OB_HASH_EXIST, hashset.exist_refactored(i));
}
}
int main(int argc, char** argv)
int main(int argc, char **argv)
{
testing::InitGoogleTest(&argc, argv);
testing::InitGoogleTest(&argc,argv);
return RUN_ALL_TESTS();
}