http://github.com/freenet/plugin-Library-staging
If anyone has some free time, please check out the above repo and run the test: $ git clone git://github.com/freenet/plugin-Library-staging.git $ cd plugin-Library-staging $ ant junit Open up ./test/plugins/Library/index/BIndexTest.java and fiddle about with the numbers at the top, and run the test with different settings. BIndexTest is the first test to run; you can just hit ctrl-C after it's done to skip the rest. What you're testing is an algorithm to write to a on-freenet b-tree. Ie. most of the data is on freenet, and you're just pulling/pushing in (approximately) the minimum nodes needed to update it, plus a new root node. This would be useful for search indexes (which are huge), and could also be useful for other things that need to store a huge on-freenet data structure. Obviously, it needs a shit load of testing first, so any help would be appreciated. X
