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

104
deps/oblib/unittest/lib/hash/test_iteratable_hashmap.cpp vendored
View File

@ -14,38 +14,42 @@
#include <gtest/gtest.h>
using namespace oceanbase::common;
using namespace oceanbase::common::hash;
class TestIteratableHashMap : public ::testing::Test {
public:
TestIteratableHashMap();
virtual ~TestIteratableHashMap();
virtual void SetUp();
virtual void TearDown();
private:
// disallow copy
TestIteratableHashMap(const TestIteratableHashMap& other);
TestIteratableHashMap& operator=(const TestIteratableHashMap& other);
protected:
// data members
class TestIteratableHashMap: public ::testing::Test
{
public:
TestIteratableHashMap();
virtual ~TestIteratableHashMap();
virtual void SetUp();
virtual void TearDown();
private:
// disallow copy
TestIteratableHashMap(const TestIteratableHashMap &other);
TestIteratableHashMap& operator=(const TestIteratableHashMap &other);
protected:
// data members
};
TestIteratableHashMap::TestIteratableHashMap()
{}
{
}
TestIteratableHashMap::~TestIteratableHashMap()
{}
{
}
void TestIteratableHashMap::SetUp()
{}
{
}
void TestIteratableHashMap::TearDown()
{}
{
}
TEST_F(TestIteratableHashMap, iterator_test)
{
ObIteratableHashMap<int32_t, int32_t> map;
for (int round = 0; round < 3; ++round) {
for (int round = 0; round < 3; ++round)
{
_OB_LOG(INFO, "round=%d", round);
ASSERT_EQ(map.begin(), map.end());
ASSERT_EQ(0, map.count());
@ -59,25 +63,27 @@ TEST_F(TestIteratableHashMap, iterator_test)
//
int i = 0;
ObIteratableHashMap<int32_t, int32_t>::const_iterator_t it = map.begin();
for (; it != map.end(); ++it) {
// printf("%d %d\n", (*it).first, (*it).second);
ASSERT_EQ(i + 1, (*it).first);
ASSERT_EQ(i + 2, (*it).second);
for (;it != map.end(); ++it)
{
//printf("%d %d\n", (*it).first, (*it).second);
ASSERT_EQ(i+1, (*it).first);
ASSERT_EQ(i+2, (*it).second);
i++;
}
ASSERT_EQ(OB_SUCCESS, map.set_refactored(3, 4));
ASSERT_EQ(3, map.count());
i = 0;
it = map.begin();
for (; it != map.end(); ++it) {
// printf("%d %d\n", (*it).first, (*it).second);
ASSERT_EQ(i + 1, (*it).first);
ASSERT_EQ(i + 2, (*it).second);
for (;it != map.end(); ++it)
{
//printf("%d %d\n", (*it).first, (*it).second);
ASSERT_EQ(i+1, (*it).first);
ASSERT_EQ(i+2, (*it).second);
i++;
}
map.reuse();
ASSERT_EQ(0, map.count());
} // end for
} // end for
}
/**
@ -103,27 +109,32 @@ TEST(TestObIteratableHashMap, many_buckets)
const uint64_t N = 10345;
int64_t v = 0;
ObIteratableHashMap<int64_t, int64_t, N> hashmap;
for (uint64_t i = 0; i < N; i++) {
for (uint64_t i = 0; i < N; i++)
{
ASSERT_EQ(OB_HASH_NOT_EXIST, hashmap.get_refactored(i, v));
ASSERT_EQ(NULL, hashmap.get(i));
}
for (uint64_t i = 0; i < N; i++) {
for (uint64_t i = 0; i < N; i++)
{
ASSERT_EQ(OB_SUCCESS, hashmap.set_refactored(i, i * i));
}
ASSERT_EQ(OB_HASH_FULL, hashmap.set_refactored(N, N * N));
for (uint64_t i = 0; i < N; i++) {
for (uint64_t i = 0; i < N; i++)
{
ASSERT_EQ(OB_SUCCESS, hashmap.get_refactored(i, v));
ASSERT_EQ(static_cast<int64_t>(i * i), v);
ASSERT_EQ(static_cast<int64_t>(i * i) , v);
ASSERT_EQ(static_cast<int64_t>(i * i), *hashmap.get(i));
}
for (uint64_t i = 0; i < N; i++) {
for (uint64_t i = 0; i < N; i++)
{
ASSERT_EQ(OB_SUCCESS, hashmap.set_refactored(i, i * i, 1));
ASSERT_EQ(OB_SUCCESS, hashmap.set_refactored(i, i * i, 1, 1));
}
ASSERT_EQ(OB_HASH_FULL, hashmap.set_refactored(N, N * N));
for (uint64_t i = 0; i < N; i++) {
for (uint64_t i = 0; i < N; i++)
{
ASSERT_EQ(OB_SUCCESS, hashmap.get_refactored(i, v));
ASSERT_EQ(static_cast<int64_t>(i * i), v);
ASSERT_EQ(static_cast<int64_t>(i * i) , v);
ASSERT_EQ(static_cast<int64_t>(i * i), *hashmap.get(i));
}
}
@ -133,33 +144,38 @@ TEST(TestObIteratableHashMap, many_buckets2)
const uint64_t N = 10345;
int64_t v = 0;
ObIteratableHashMap<int64_t, int64_t, N> hashmap;
for (uint64_t i = N; i > 0; i--) {
for (uint64_t i = N; i > 0; i--)
{
ASSERT_EQ(OB_HASH_NOT_EXIST, hashmap.get_refactored(i, v));
ASSERT_EQ(NULL, hashmap.get(i));
}
for (uint64_t i = N; i > 0; i--) {
for (uint64_t i = N; i > 0; i--)
{
ASSERT_EQ(OB_SUCCESS, hashmap.set_refactored(i, i * i));
}
ASSERT_EQ(OB_HASH_FULL, hashmap.set_refactored(0, 0));
for (uint64_t i = N; i > 0; i--) {
for (uint64_t i = N; i > 0; i--)
{
ASSERT_EQ(OB_SUCCESS, hashmap.get_refactored(i, v));
ASSERT_EQ(static_cast<int64_t>(i * i), v);
ASSERT_EQ(static_cast<int64_t>(i * i) , v);
ASSERT_EQ(static_cast<int64_t>(i * i), *hashmap.get(i));
}
for (uint64_t i = N; i > 0; i--) {
for (uint64_t i = N; i > 0; i--)
{
ASSERT_EQ(OB_SUCCESS, hashmap.set_refactored(i, i * i, 1));
ASSERT_EQ(OB_SUCCESS, hashmap.set_refactored(i, i * i, 1, 1));
}
ASSERT_EQ(OB_HASH_FULL, hashmap.set_refactored(0, 0));
for (uint64_t i = N; i > 0; i--) {
for (uint64_t i = N; i > 0; i--)
{
ASSERT_EQ(OB_SUCCESS, hashmap.get_refactored(i, v));
ASSERT_EQ(static_cast<int64_t>(i * i), v);
ASSERT_EQ(static_cast<int64_t>(i * i) , v);
ASSERT_EQ(static_cast<int64_t>(i * i), *hashmap.get(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();
}