hardcoresushi/libcryfs
1
0
Fork 0
Code Issues Pull Requests Releases Activity
2,019 Commits 4 Branches 0 Tags 18 MiB
05f3726ec3
Commit Graph

549 Commits

Author SHA1 Message Date
Sebastian Messmer
3b06dec1f2 DataBlockFixture creates data that is independent from its size 2015-03-04 02:34:54 +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
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
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
727b5f5e9c Added Travis CI 2015-02-20 02:01:03 +01:00
Sebastian Messmer
2ac970a833 Switch to biicode 2015-02-17 00:48:49 +01:00
Sebastian Messmer
3350e9368a Switch to biicode 2015-02-17 00:40:34 +01:00
Sebastian Messmer
0c851fa452 Switch to biicode 2015-02-17 00:23:33 +01:00
Sebastian Messmer
687a7c9500 Fix test cases 2015-02-16 21:36:00 +01:00
Sebastian Messmer
a01a6f64d1 Add macros.h, pointer.h and optional_ownership_pointer.h 2015-02-16 21:31:57 +01:00