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
|
1e2cb46c0b
|
Refactor test folder structure
|
2015-02-26 17:05:05 +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
|
0f3314b31c
|
Added some test cases for traversing a four level tree
|
2015-02-25 22:38:49 +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
|
100268930e
|
Add some test cases traversing a DataTree
|
2015-02-25 16:52:52 +01:00 |
|
Sebastian Messmer
|
02bceecb29
|
Refactoring test cases
|
2015-02-25 14:42:20 +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
|
a71f26d0d4
|
Added another DataTreeStoreTest
|
2015-02-24 22:51:56 +01:00 |
|
Sebastian Messmer
|
81ab18f595
|
Speedup test case
|
2015-02-24 22:46:44 +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
|
19e14146f4
|
Be more explicit in test case
|
2015-02-24 17:37:39 +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
|
96208200f9
|
Improve depth test cases (also check that the level below depth 1 nodes is leaves)
|
2015-02-24 16:46:05 +01:00 |
|
Sebastian Messmer
|
67dbb96774
|
Add tests that the depth flags stay intact on shrinking
|
2015-02-24 16:42:13 +01:00 |
|
Sebastian Messmer
|
1006c2cc38
|
Test cases for BlockStore::numBlocks()
|
2015-02-24 14:42:26 +01:00 |
|
Sebastian Messmer
|
f491d3d183
|
Added BlockStore::numBlocks()
|
2015-02-23 21:07:07 +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
|
0d26692048
|
TODOs
|
2015-02-23 20:25:37 +01:00 |
|
Sebastian Messmer
|
6d923c5ef5
|
Refactor DataTreeGrowingTest_DataStaysIntact
|
2015-02-23 20:25:13 +01:00 |
|
Sebastian Messmer
|
f7e710f305
|
Added tests ensuring that the data stays intact on shrinking
|
2015-02-23 19:54:59 +01:00 |
|
Sebastian Messmer
|
6c9d4cca39
|
Refactor growing test cases
|
2015-02-23 17:51:11 +01:00 |
|
Sebastian Messmer
|
388c755f63
|
Refactor GetLowestRightBorderNode... algorithm test cases
|
2015-02-23 17:45:10 +01:00 |
|
Sebastian Messmer
|
7fea8017c8
|
Refactor shrinking test cases
|
2015-02-23 17:30:44 +01:00 |
|
Sebastian Messmer
|
fee8cd42eb
|
Refactoring test cases
|
2015-02-23 17:03:45 +01:00 |
|
Sebastian Messmer
|
c81e058717
|
TODOs
|
2015-02-23 16:21:41 +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
|
aeec8b1490
|
Add utility function to copy blocks
|
2015-02-22 19:29:30 +01:00 |
|
Sebastian Messmer
|
e65ce5f11f
|
Change way of deleting blocks to be more foolproof (when deleting a block, the user is forced to give up its reference to the block)
|
2015-02-22 16:53:49 +01:00 |
|
Sebastian Messmer
|
37e8a511f5
|
Added BlockStore::remove(key)
|
2015-02-22 00:29:21 +01:00 |
|
Sebastian Messmer
|
46a0bf617b
|
Added test cases for GetLowestRightBorderNodeWithMoreThanOneChildOrNull
|
2015-02-21 23:25:57 +01:00 |
|
Sebastian Messmer
|
f5c48db10b
|
- Refactor GetLowestRightBorderNodeWithLessThanKChildrenOrNull into algorithm.h
- Started shrinking leaves
|
2015-02-21 01:59:25 +01:00 |
|
Sebastian Messmer
|
dc32db6a34
|
Cleanup downloaded scripts after use
|
2015-02-20 20:45:56 +01:00 |
|
Sebastian Messmer
|
7580ac9e80
|
Cleanup downloaded scripts after use
|
2015-02-20 20:45:02 +01:00 |
|
Sebastian Messmer
|
59767eb414
|
Cleanup downloaded scripts after use
|
2015-02-20 20:44:07 +01:00 |
|
Sebastian Messmer
|
a3a4bef88a
|
Cleanup downloaded scripts after use
|
2015-02-20 20:41:12 +01:00 |
|
Sebastian Messmer
|
e784e054d5
|
Cleanup downloaded travis scripts after use
|
2015-02-20 20:37:07 +01:00 |
|
Sebastian Messmer
|
959b5dcb3b
|
Added test case growing a larger tree step by step
|
2015-02-20 20:16:44 +01:00 |
|