Logo
Explore Support Help
Register Sign In
hardcoresushi/libcryfs
1
0
Fork 0
You've already forked libcryfs
Code Issues Pull Requests Releases Activity
181 Commits 4 Branches 0 Tags
Commit Graph

11 Commits

Author SHA1 Message Date
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
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
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
6127a9d6a8 Added test cases shrinking down full trees to one-leaf trees 2015-02-23 21:06:45 +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
0607dcb282 Refactor initialization of DataLeafNode/DataInnerNode 2015-02-20 19:46:52 +01:00
Sebastian Messmer
3350e9368a Switch to biicode 2015-02-17 00:40:34 +01:00
Powered by Gitea Version: 1.23.1 Page: 17ms Template: 1ms
English
Bahasa Indonesia Deutsch English Español Français Gaeilge Italiano Latviešu Magyar nyelv Nederlands Polski Português de Portugal Português do Brasil Suomi Svenska Türkçe Čeština Ελληνικά Български Русский Українська فارسی മലയാളം 日本語 简体中文 繁體中文(台灣) 繁體中文(香港) 한국어
Licenses API Help
Logo Chapril
Accueil Chapril
Services libres
Nous suivre
CGU
Mentions légales
Nous contacter
Accueil Chapril
Services libres
Nous suivre
CGU
Mentions légales
Nous contacter