c8b9a6183f
To make failing keys work we must be able to produce a key in fewer failures then currently. So encode the picker for non-empty trees directly so it is much faster and doesn't try to do it by generating a case and then asking "is this one good enough?". A simple dict:filter/2 does it. |
||
|---|---|---|
| .. | ||
| lsm_btree_drv.erl | ||
| lsm_btree_merger_tests.erl | ||
| lsm_btree_tests.erl | ||
| lsm_btree_writer_tests.erl | ||