Sebastian Meßmer
|
39eaff4533
|
Unify (and fix) include guards
|
2015-10-15 13:10:20 +02:00 |
|
Sebastian Messmer
|
b8f42ee9e5
|
TODOs
|
2015-10-05 03:54:18 +02:00 |
|
Sebastian Messmer
|
faa4b0c6f8
|
Improve flush()
|
2015-09-30 13:17:35 +02:00 |
|
Sebastian Messmer
|
d72e7c2acd
|
TODOs
|
2015-09-30 10:06:53 +02:00 |
|
Sebastian Messmer
|
51019502ec
|
Fixed potential race condition in DataTree
|
2015-09-30 10:02:06 +02:00 |
|
Sebastian Messmer
|
106f18b496
|
Use the new assert that doesn't crash the program in a release build
|
2015-07-22 13:44:04 +02:00 |
|
Sebastian Messmer
|
e64255a16e
|
Removed last unique_ptr uses, all uses unique_ref now
|
2015-07-21 15:24:49 +02:00 |
|
Sebastian Messmer
|
722c94458b
|
Removed unneccessary using statements
|
2015-07-21 15:10:41 +02:00 |
|
Sebastian Messmer
|
3d1341114b
|
Use unique_ref instead of unique_ptr
|
2015-06-26 15:59:18 +02:00 |
|
Sebastian Messmer
|
7fae2d1e59
|
Adapt to new cpp-utils
|
2015-06-21 17:43:45 +02:00 |
|
Sebastian Messmer
|
eaa60d3a53
|
- Use one block flush less when growing by a traversal (the one that grows the old last leaf to max size)
- Fix numLEaves() calculation
|
2015-04-10 22:57:29 +02:00 |
|
Sebastian Messmer
|
bee68464dc
|
When traversing a blob out of range, automatically create the leaves up to the traversed point
|
2015-04-10 21:52:30 +02:00 |
|
Sebastian Messmer
|
628f4edec0
|
Don't flush if not necessary
|
2015-04-09 23:29:29 +02:00 |
|
Sebastian Messmer
|
4b04226162
|
Work with new blockstore::Key
|
2015-04-09 20:07:21 +02:00 |
|
Sebastian Messmer
|
3f43dcfe10
|
Fix locking
|
2015-04-09 16:30:36 +02:00 |
|
Sebastian Messmer
|
9a959cfab9
|
DataTree is threadsafe
|
2015-04-09 16:10:57 +02:00 |
|
Sebastian Messmer
|
84401b9abf
|
Use CachingDataTreeStore instead of DataTreeStore to avoid opening the same datatree twice in different threads
|
2015-04-09 15:40:27 +02: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
|
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
|
b8cb2ad450
|
Added DataTree::numStoredBytes
|
2015-02-25 23:08:16 +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
|
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
|
3350e9368a
|
Switch to biicode
|
2015-02-17 00:40:34 +01:00 |
|