Martin Sumner 53ddc8950b Add tests using fold_heads ... Comparing the inbuilt tictac_tree fold, to using "proper" abstraction and achieving the same thing through fold_heads. The fold_heads method is slower (a lot more manipulation required in the fold) - expect it to require > 2 x CPU. However, this does give the flexibility to change the hash algorithm. This would allow for a fold over a database of AAE trees (where the hash has been pre-computed using sha) to be compared with a fold over a database of leveled backends. Also can vary whether the fold_heads checks for presence of the object in the Inker. So normally we can get the speed advantage of not checking the Journal for presence, but periodically we can.		2017-08-07 10:45:41 +01:00
..
basic_SUITE.erl	Test timeouts	2017-07-02 22:23:02 +01:00
iterator_SUITE.erl	Change tests - binary keys	2017-05-23 15:54:11 +01:00
recovery_SUITE.erl	Add compatibility for old and new random / rand functions	2017-08-01 11:24:12 +02:00
testutil.erl	Add missing uniform/0 function	2017-08-01 11:24:12 +02:00
tictac_SUITE.erl	Add tests using fold_heads	2017-08-07 10:45:41 +01:00