#pragma once #ifndef BLOBSTORE_IMPLEMENTATIONS_ONBLOCKS_DATATREE_H_ #define BLOBSTORE_IMPLEMENTATIONS_ONBLOCKS_DATATREE_H_ #include #include #include namespace blockstore { class Key; } namespace blobstore { namespace onblocks { namespace datanodestore { class DataNodeStore; class DataInnerNode; class DataLeafNode; class DataNode; } namespace datatreestore { class DataTree { public: DataTree(datanodestore::DataNodeStore *nodeStore, std::unique_ptr rootNode); virtual ~DataTree(); std::unique_ptr addDataLeaf(); void removeLastDataLeaf(); const blockstore::Key &key() const; void flush() const; void traverseLeaves(uint32_t beginIndex, uint32_t endIndex, std::function func); uint64_t numStoredBytes() const; //TODO Test numStoredBytes() private: datanodestore::DataNodeStore *_nodeStore; std::unique_ptr _rootNode; std::unique_ptr releaseRootNode(); friend class DataTreeStore; std::unique_ptr addDataLeafAt(datanodestore::DataInnerNode *insertPos); cpputils::optional_ownership_ptr createChainOfInnerNodes(unsigned int num, datanodestore::DataLeafNode *leaf); std::unique_ptr addDataLeafToFullTree(); void deleteLastChildSubtree(datanodestore::DataInnerNode *node); void ifRootHasOnlyOneChildReplaceRootWithItsChild(); void traverseLeaves(datanodestore::DataNode *root, uint32_t leafOffset, uint32_t beginIndex, uint32_t endIndex, std::function func); uint32_t leavesPerFullChild(const datanodestore::DataInnerNode &root) const; uint64_t numStoredBytes(const datanodestore::DataNode &root) const; DISALLOW_COPY_AND_ASSIGN(DataTree); }; } } } #endif