Sebastian Messmer
|
4658de552f
|
TODOs
|
2015-03-06 02:34:18 +01:00 |
|
Sebastian Messmer
|
19b9551a00
|
Added test cases loading nonexisting blobs
|
2015-03-06 02:32:43 +01:00 |
|
Sebastian Messmer
|
75d1ef11fe
|
Fixed loading nonexisting blobs and wrote more test cases
|
2015-03-06 02:21:31 +01:00 |
|
Sebastian Messmer
|
f834f8892d
|
Added test cases for resizing blobs
|
2015-03-05 22:34:51 +01:00 |
|
Sebastian Messmer
|
8b7a76c38a
|
Added first test for BlobStoreOnBlocks
|
2015-03-05 22:23:30 +01:00 |
|
Sebastian Messmer
|
e64ab10059
|
Fix DataNodeView: Only allow read access to data region
|
2015-03-05 22:22:22 +01:00 |
|
Sebastian Messmer
|
31417f8e05
|
Add test cases for writing into leaves
|
2015-03-04 21:56:48 +01:00 |
|
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
|
5fb235a40c
|
Removed DataTree::addDataLeaf() / DataTree::removeLastDataLeaf() and DataTree::flush()
|
2015-03-04 03:17:59 +01:00 |
|
Sebastian Messmer
|
c0e5b5db8c
|
Added more test cases for resizing blobs
|
2015-03-04 02:56:17 +01:00 |
|
Sebastian Messmer
|
0e91d06a6f
|
Add test cases for DataTree::resizeNumBytes()
|
2015-03-04 02:05:03 +01:00 |
|
Sebastian Messmer
|
68182e523f
|
Added test cases for DataNode::key() and DataTree::key()
|
2015-02-27 14:32:28 +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
|
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
|
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
|
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
|
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
|
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
|
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
|
959b5dcb3b
|
Added test case growing a larger tree step by step
|
2015-02-20 20:16:44 +01:00 |
|
Sebastian Messmer
|
5133e3d8a0
|
Add test cases checking that growing a tree sets correct depth flags
|
2015-02-20 20:01:47 +01:00 |
|
Sebastian Messmer
|
0607dcb282
|
Refactor initialization of DataLeafNode/DataInnerNode
|
2015-02-20 19:46:52 +01:00 |
|
Sebastian Messmer
|
8b792e691c
|
Refactor test cases
|
2015-02-20 18:31:18 +01:00 |
|
Sebastian Messmer
|
d63d66c97b
|
Added some test cases for growing a tree
|
2015-02-20 17:33:33 +01:00 |
|
Sebastian Messmer
|
8843cef9ca
|
Added some test cases ensuring the data of leaves stays intact when growing a tree
|
2015-02-20 14:27:11 +01:00 |
|
Sebastian Messmer
|
3350e9368a
|
Switch to biicode
|
2015-02-17 00:40:34 +01:00 |
|