Skip to content

Change BTree to use shared pointer #16

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
FionaVerzivolli merged 2 commits into from
Aug 25, 2025
Merged

Change BTree to use shared pointer #16

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
913dd6b
Change BTree to use shared pointer
FionaVerzivolli Aug 25, 2025
898ace0
Create copies and let ContentStorage manage page data
FionaVerzivolli Aug 25, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Binary file modified btree_test
View file
Open in desktop
Binary file not shown.
Binary file modified content_addressable_demo
View file
Open in desktop
Binary file not shown.
Binary file modified content_hash_demo
View file
Open in desktop
Binary file not shown.
Binary file modified deduplication_demo
View file
Open in desktop
Binary file not shown.
17 changes: 9 additions & 8 deletions include/btree.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,6 +4,7 @@
#include<vector>
#include<variant>
#include<string>
#include<memory>
#include "fraction.h"
#include "page_manager.h"
#include "content_storage.h"
Expand All @@ -15,17 +16,17 @@
template <typename KeyType, typename ValueType>
class BTree {
private:
Page<KeyType>* root;
std::shared_ptr<Page<KeyType>> root;
int maxKeysPerNode; // Maximum keys in each node
ContentStorage<KeyType> content_storage;

void insertNonFull(Page<KeyType>* root, const KeyType& key, const ValueType& value);
void splitChild(Page<KeyType>* parent, int index, Page<KeyType>* child);
void insertNonFull(std::shared_ptr<Page<KeyType>> root, const KeyType& key, const ValueType& value);
void splitChild(std::shared_ptr<Page<KeyType>> parent, int index, std::shared_ptr<Page<KeyType>> child);

void deleteFromNode(Page<KeyType>* node, const KeyType& key);
void borrowFromLeft(Page<KeyType>* parent, int index);
void borrowFromRight(Page<KeyType>* parent, int index);
void mergeNodes(Page<KeyType>* parent, int index);
void deleteFromNode(std::shared_ptr<Page<KeyType>> node, const KeyType& key);
void borrowFromLeft(std::shared_ptr<Page<KeyType>> parent, int index);
void borrowFromRight(std::shared_ptr<Page<KeyType>> parent, int index);
void mergeNodes(std::shared_ptr<Page<KeyType>> parent, int index);

public:
BTree(int maxKeys);
Expand All @@ -34,6 +35,6 @@ class BTree {
ValueType* search(const KeyType& key); // Public search method
void printStorageStats() const;

Page<KeyType> findKey(Page<KeyType>* node, const KeyType& key);
Page<KeyType> findKey(std::shared_ptr<Page<KeyType>> node, const KeyType& key);

};
Loading