This website requires JavaScript.
Explore
Support
Help
Register
Sign In
hardcoresushi
/
libcryfs
Watch
1
Star
0
Fork
0
You've already forked libcryfs
Code
Issues
Pull Requests
Releases
Activity
libcryfs
/
test
/
blobstore
/
implementations
/
onblocks
History
Sebastian Messmer
bbdd8a548b
Special case treatment for traversals until exactly the last leaf has to load the last leaf to grow it. Before this commit, we just always loaded the last traversed leaf and checked its size. Now we only do so if it's the right border leaf. This saves us loading some leaves.
2016-07-17 10:16:09 +02:00
..
datanodestore
Minimize number of Block::write() calls when creating new nodes in a traversal. Also add test cases for it.
2016-07-15 12:48:20 +02:00
datatreestore
Special case treatment for traversals until exactly the last leaf has to load the last leaf to grow it. Before this commit, we just always loaded the last traversed leaf and checked its size. Now we only do so if it's the right border leaf. This saves us loading some leaves.
2016-07-17 10:16:09 +02:00
testutils
Fix includes after merging repositories
2016-02-11 15:19:58 +01:00
utils
Merge all git repositories into one
2016-02-11 16:40:48 +01:00
BigBlobsTest.cpp
Fix includes after merging repositories
2016-02-11 15:19:58 +01:00
BlobReadWriteTest.cpp
Fix includes after merging repositories
2016-02-11 15:19:58 +01:00
BlobSizeTest.cpp
Use LeafTraversor for resizing blobs
2016-07-12 20:36:12 +02:00
BlobStoreTest.cpp
Performance optimization: When removing or shrinking a tree, we don't load/read leaves anymore. Loading inner nodes is enough to get all block IDs and then we can delete the leaves from their IDs without loading them.
2016-07-13 11:27:31 +02:00
Accueil Chapril
Services libres
Nous suivre
CGU
Mentions légales
Nous contacter
Accueil Chapril
Services libres
Nous suivre
CGU
Mentions légales
Nous contacter