ZYM/BH-TicketSystem
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

initial try

Browse Source
This commit is contained in:
happyZYM
2024-04-29 16:01:50 +00:00
parent 80f4fa4529
commit 0e9a7b2372
2 changed files with 109 additions and 36 deletions
Download Patch File Download Diff File Expand all files Collapse all files

63
test/bpt_basic_test.cpp
View File

@ -777,7 +777,7 @@ TEST(RemoveTest, RM_1) {
TEST(RemoveTest, RM_2) {
const unsigned int RndSeed = testing::GTEST_FLAG(random_seed);
std::mt19937 rnd(RndSeed);
std::mt19937 rnd(1);
const int str_len = 800;
typedef bpt_basic_test::FixLengthString<str_len> KeyType;
fprintf(stderr, "sizeof(std::pair<KeyType, default_numeric_index_t>)=%lu\n",
@ -785,8 +785,8 @@ TEST(RemoveTest, RM_2) {
const std::string db_file_name = "/tmp/bpt16.db";
remove(db_file_name.c_str());
std::vector<std::pair<KeyType, int>> entries;
const int max_keys = 25;
const int keys_num_to_remove = 20;
const int max_keys = 700;
const int keys_num_to_remove = 699;
for (int i = 1; i <= max_keys; i++) {
KeyType key;
for (size_t j = 0; j < str_len; j++) key.data[j] = 'a' + rnd() % 26;
@ -864,34 +864,31 @@ TEST(RemoveTest, RM_2) {
}
delete bpm;
delete dm;
// dm = new DiskManager(db_file_name.c_str());
// bpm = new BufferPoolManager(20, 3, dm);
// {
// BPlusTreeIndexer<KeyType, std::less<KeyType>> bpt(bpm);
// ASSERT_EQ(bpt.Size(), entries.size());
// for (int i = 0; i < entries.size(); i++) {
// ASSERT_EQ(bpt.Get(entries[i].first), entries[i].second);
// }
// sort(entries.begin(), entries.end());
// for (int i = 0; i < entries.size(); i++) {
// ASSERT_EQ(bpt.Get(entries[i].first), entries[i].second);
// }
// auto it_std = entries.begin();
// auto it_bpt_tmp = bpt.lower_bound_const(entries[6].first);
// ASSERT_EQ(it_bpt_tmp.GetValue(), entries[6].second);
// ASSERT_EQ(it_bpt_tmp.GetKey(), entries[6].first);
// auto it_bpt = bpt.lower_bound_const(entries[0].first);
// for (int i = 0; i < entries.size(); i++) {
// fprintf(stderr, "i=%d checking key[%d]=%s value[%d]=%d\n", i, i, it_std->first.data, i, it_std->second);
// ASSERT_TRUE(!(it_bpt == bpt.end_const()));
// ASSERT_EQ(it_bpt.GetKey(), it_std->first);
// ASSERT_EQ(it_bpt.GetValue(), it_std->second);
// ++it_bpt;
// it_std++;
// }
// ASSERT_TRUE(it_bpt == bpt.end_const());
// ASSERT_EQ(bpt.Size(), entries.size());
// }
// delete bpm;
// delete dm;
dm = new DiskManager(db_file_name.c_str());
bpm = new BufferPoolManager(20, 3, dm);
{
BPlusTreeIndexer<KeyType, std::less<KeyType>> bpt(bpm);
ASSERT_EQ(bpt.Size(), entries.size());
for (int i = 0; i < entries.size(); i++) {
ASSERT_EQ(bpt.Get(entries[i].first), entries[i].second);
}
sort(entries.begin(), entries.end());
for (int i = 0; i < entries.size(); i++) {
ASSERT_EQ(bpt.Get(entries[i].first), entries[i].second);
}
auto it_std = entries.begin();
auto it_bpt = bpt.lower_bound_const(entries[0].first);
for (int i = 0; i < entries.size(); i++) {
fprintf(stderr, "i=%d checking key[%d]=%s value[%d]=%d\n", i, i, it_std->first.data, i, it_std->second);
ASSERT_TRUE(!(it_bpt == bpt.end_const()));
ASSERT_EQ(it_bpt.GetKey(), it_std->first);
ASSERT_EQ(it_bpt.GetValue(), it_std->second);
++it_bpt;
it_std++;
}
ASSERT_TRUE(it_bpt == bpt.end_const());
ASSERT_EQ(bpt.Size(), entries.size());
}
delete bpm;
delete dm;
}