hardcoresushi/libcryfs
1
0
Fork 0
Code Issues Pull Requests Releases Activity

Removed unnecessary private function

Browse Source
This commit is contained in:
Sebastian Messmer 2015-09-30 10:04:18 +02:00
parent 51019502ec
commit d18edfb1d4
2 changed files with 0 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
implementations/onblocks/BlobOnBlocks.cpp
View File

@ -76,13 +76,6 @@ void BlobOnBlocks::flush() {
_datatree->flush(); _datatree->flush();
} }
void BlobOnBlocks::resizeIfSmallerThan(uint64_t neededSize) {
//TODO This is inefficient, because size() and resizeNumBytes() both traverse the tree. Better: _datatree->ensureMinSize(x)
if (neededSize > size()) {
_datatree->resizeNumBytes(neededSize);
}
}
Key BlobOnBlocks::key() const { Key BlobOnBlocks::key() const {
return _datatree->key(); return _datatree->key();
} }

1
implementations/onblocks/BlobOnBlocks.h
View File

@ -36,7 +36,6 @@ public:
private: private:
void traverseLeaves(uint64_t offsetBytes, uint64_t sizeBytes, std::function<void (uint64_t, datanodestore::DataLeafNode *, uint32_t, uint32_t)>) const; void traverseLeaves(uint64_t offsetBytes, uint64_t sizeBytes, std::function<void (uint64_t, datanodestore::DataLeafNode *, uint32_t, uint32_t)>) const;
void resizeIfSmallerThan(uint64_t neededSize);
cpputils::unique_ref<parallelaccessdatatreestore::DataTreeRef> _datatree; cpputils::unique_ref<parallelaccessdatatreestore::DataTreeRef> _datatree;
}; };