Sebastian Messmer
|
3a01f95467
|
Adapt to new blockstore which has Block::write() instead of writeable Block::data() pointer
|
2015-03-04 20:58:39 +01:00 |
|
Sebastian Messmer
|
b43464d669
|
Allow writing out of the bounds of a blob, resize blob in this case
|
2015-03-04 03:29:22 +01:00 |
|
Sebastian Messmer
|
5fb235a40c
|
Removed DataTree::addDataLeaf() / DataTree::removeLastDataLeaf() and DataTree::flush()
|
2015-03-04 03:17:59 +01:00 |
|
Sebastian Messmer
|
f89db143d9
|
TODOs
|
2015-03-04 02:55:26 +01:00 |
|
Sebastian Messmer
|
13a76bd42a
|
Fix two bugs in DataTree::resizeNumBytes()
|
2015-03-04 02:04:51 +01:00 |
|
Sebastian Messmer
|
4d50479777
|
Mark BlobOnBlocks::read/write as override
|
2015-02-27 01:28:53 +01:00 |
|
Sebastian Messmer
|
8dd0275c75
|
Add Blob::key()
|
2015-02-27 00:18:26 +01:00 |
|
Sebastian Messmer
|
0e17ea5b29
|
TODOs
|
2015-02-26 23:46:50 +01:00 |
|
Sebastian Messmer
|
c978a4581a
|
Simplified read/write implementation
|
2015-02-26 20:23:37 +01:00 |
|
Sebastian Messmer
|
a44b6318e2
|
- Refactor math functions for reuse (and write test cases for them)
- Implemented BlobOnBlocks::read() and write(). Not tested yet.
|
2015-02-26 20:19:12 +01:00 |
|
Sebastian Messmer
|
7de4948256
|
Added assert
|
2015-02-26 18:53:24 +01:00 |
|
Sebastian Messmer
|
4e8e4ea3d3
|
Implemented DataTree::resizeNumBytes(). No test cases yet.
|
2015-02-26 17:33:47 +01:00 |
|
Sebastian Messmer
|
a66bccb122
|
TODOs
|
2015-02-26 17:06:34 +01:00 |
|
Sebastian Messmer
|
87db6dfab8
|
Fix DataTree::numStoredBytes() and write test cases for it
|
2015-02-26 17:04:02 +01:00 |
|
Sebastian Messmer
|
61ec7dedb8
|
BlobOnBlocks::size() works correctly
|
2015-02-25 23:09:48 +01:00 |
|
Sebastian Messmer
|
b8cb2ad450
|
Added DataTree::numStoredBytes
|
2015-02-25 23:08:16 +01:00 |
|
Sebastian Messmer
|
0f40619a4a
|
BlobOnBlocks stores DataTrees, not DataNodes
|
2015-02-25 22:48:39 +01:00 |
|
Sebastian Messmer
|
c9ce0d55cf
|
Make block size configureable in DataNodeStore -> this greatly speeds up our test cases, because they can use smaller blocks, which means less children per inner node
|
2015-02-25 22:30:48 +01:00 |
|
Sebastian Messmer
|
97cf6a6e40
|
Written data tree leaf traversal and some test cases
|
2015-02-25 01:31:16 +01:00 |
|
Sebastian Messmer
|
9d9c090148
|
Refactoring
|
2015-02-24 23:11:20 +01:00 |
|
Sebastian Messmer
|
7f55285ecd
|
Implement removing trees and write some test cases for DataTreeStore
|
2015-02-24 22:44:10 +01:00 |
|
Sebastian Messmer
|
db32c37b87
|
Added testcase for DataNodeStore::remove()
|
2015-02-24 16:54:44 +01:00 |
|
Sebastian Messmer
|
b9e3a9b109
|
Added test cases for DataNodeStore::numNodes()
|
2015-02-24 16:52:11 +01:00 |
|
Sebastian Messmer
|
6127a9d6a8
|
Added test cases shrinking down full trees to one-leaf trees
|
2015-02-23 21:06:45 +01:00 |
|
Sebastian Messmer
|
05b4ccae05
|
Added some test cases for shrinking trees
|
2015-02-23 16:21:02 +01:00 |
|
Sebastian Messmer
|
ab2e789dac
|
Implement tree shrinking and some test cases for it
|
2015-02-22 19:30:42 +01:00 |
|
Sebastian Messmer
|
f5c48db10b
|
- Refactor GetLowestRightBorderNodeWithLessThanKChildrenOrNull into algorithm.h
- Started shrinking leaves
|
2015-02-21 01:59:25 +01:00 |
|
Sebastian Messmer
|
0607dcb282
|
Refactor initialization of DataLeafNode/DataInnerNode
|
2015-02-20 19:46:52 +01:00 |
|
Sebastian Messmer
|
3350e9368a
|
Switch to biicode
|
2015-02-17 00:40:34 +01:00 |
|