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

119
deps/oblib/unittest/lib/hash/test_iteratable_hashset.cpp vendored
View File

@ -16,38 +16,42 @@
using namespace oceanbase::common;
using namespace oceanbase::common::hash;
class ObIteratableHashSetTest : public ::testing::Test {
public:
ObIteratableHashSetTest();
virtual ~ObIteratableHashSetTest();
virtual void SetUp();
virtual void TearDown();
private:
// disallow copy
ObIteratableHashSetTest(const ObIteratableHashSetTest& other);
ObIteratableHashSetTest& operator=(const ObIteratableHashSetTest& other);
protected:
// data members
class ObIteratableHashSetTest: public ::testing::Test
{
public:
ObIteratableHashSetTest();
virtual ~ObIteratableHashSetTest();
virtual void SetUp();
virtual void TearDown();
private:
// disallow copy
ObIteratableHashSetTest(const ObIteratableHashSetTest &other);
ObIteratableHashSetTest& operator=(const ObIteratableHashSetTest &other);
protected:
// data members
};
ObIteratableHashSetTest::ObIteratableHashSetTest()
{}
{
}
ObIteratableHashSetTest::~ObIteratableHashSetTest()
{}
{
}
void ObIteratableHashSetTest::SetUp()
{}
{
}
void ObIteratableHashSetTest::TearDown()
{}
{
}
TEST_F(ObIteratableHashSetTest, basic_test)
{
ObIteratableHashSet<int32_t> set;
for (int round = 0; round < 3; ++round) {
for (int round = 0; round < 3; ++round)
{
ASSERT_EQ(0, set.count());
ASSERT_EQ(OB_HASH_NOT_EXIST, set.exist_refactored(1));
ASSERT_EQ(OB_SUCCESS, set.set_refactored(1));
@ -60,15 +64,16 @@ TEST_F(ObIteratableHashSetTest, basic_test)
ASSERT_EQ(2, set.count());
int i = 0;
ObIteratableHashSet<int32_t>::const_iterator_t it = set.begin();
for (; it != set.end(); ++it) {
ASSERT_EQ(i + 1, *it);
// printf("%d\n", *it);
for(;it != set.end(); ++it)
{
ASSERT_EQ(i+1, *it);
//printf("%d\n", *it);
++i;
}
set.clear();
ASSERT_EQ(0, set.count());
} // end for
} // end for
}
/**
@ -87,40 +92,50 @@ TEST(TestObIteratableHashSet, many_buckets)
{
const uint64_t N = 10345;
ObIteratableHashSet<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));
}
}
@ -129,40 +144,50 @@ TEST(TestObIteratableHashSet, many_buckets2)
{
const uint64_t N = 10345;
ObIteratableHashSet<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));
}
}
@ -171,9 +196,9 @@ TEST(TestObIteratableHashSet, hash_full)
{
const uint64_t N = 10000;
typedef ObIteratableHashSet<int64_t, N> HashSetType;
HashSetType* hashset = (HashSetType*)ob_malloc(sizeof(HashSetType));
HashSetType *hashset = (HashSetType *)ob_malloc(sizeof(HashSetType));
ASSERT_TRUE(NULL != hashset);
new (hashset) HashSetType();
new(hashset) HashSetType();
ASSERT_TRUE(NULL != hashset);
for (uint64_t i = 0; i < N; i++) {
@ -188,9 +213,9 @@ TEST(TestObIteratableHashSet, hash_full)
hashset = NULL;
}
int main(int argc, char** argv)
int main(int argc, char **argv)
{
OB_LOGGER.set_log_level("WARN");
::testing::InitGoogleTest(&argc, argv);
::testing::InitGoogleTest(&argc,argv);
return RUN_ALL_TESTS();
}