Permalink
Commits on Jan 8, 2012
  1. Pick low-hanging performance fruit in flush_nursery().

    Erik Søe Sørensen committed Jan 8, 2012
  2. README: Explain 'LSM' and provide link to paper.

    Erik Søe Sørensen committed Jan 8, 2012
Commits on Jan 7, 2012
  1. Optimize open dict check.

    A dict is open and with keys if its size is greater than 0. Go through
    the dicts one by one with lists:any/2 and use that to optimize the
    check. Ought to run faster than traversing the full set.
    jlouis committed Jan 7, 2012
  2. Implement failing key lookup.

    We generate a set of names that are highly unlikely to be in the tree
    as well because this makes it way easier for the ?SUCHTHAT macro to
    succeed.
    jlouis committed Jan 7, 2012
  3. Work on failing keys. Optimize generator.

    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.
    jlouis committed Jan 7, 2012
  4. Minor typo

    krestenkrab committed Jan 7, 2012
  5. Update REAME

    krestenkrab committed Jan 7, 2012
  6. Add close to shame tests

    krestenkrab committed Jan 7, 2012
  7. Allow put(Key, Binary|'deleted')

    Last missing piece to make delete work it seems
    krestenkrab committed Jan 7, 2012
  8. Remove warning

    krestenkrab committed Jan 7, 2012
  9. Fix unit test

    We currently have no check for concurrently
    opening the same fractal_btree; we probably need
    to implement a simple locking mechanism.
    krestenkrab committed Jan 7, 2012
  10. Refix readme

    krestenkrab committed Jan 7, 2012
  11. Restructure file, add deletion.

    A refactoring run made the code more digestible. Also add the needed
    clauses for handling random deletion.
    jlouis committed Jan 7, 2012
  12. Utilize the new lookup of existing keys in PropEr.

    This patch implements another possible command: Lookup of keys that
    already exist in the tree somewhere. We use a dict as the test tool:
    the postcondition verifies that the value obtained from the fractal
    btree matches the one we put in the dict earlier.
    jlouis committed Jan 7, 2012
  13. Improve driver cleanup, implement lookup of existing keys.

    If we decide to stop the driver, we should not reply back before we
    have a clean state with all BTrees closed.
    
    Also, implement lookup of existing keys in the tree.
    jlouis committed Jan 7, 2012
Commits on Jan 6, 2012
  1. Improve the test stale btree removal.

    Also delete the "simple" Btree in between test runs so we have a clean
    slate of what is happening.
    jlouis committed Jan 6, 2012
  2. Minor read me updates

    krestenkrab committed Jan 6, 2012
  3. Reduce verbosity

    krestenkrab committed Jan 6, 2012
  4. Split tests to where they belong. Add simple statem test.

    ; Split the writer tests to the writer parts. This is not entirely
      correct since they both read and write, but oh, well.
    ; Provide a simple statem test which opens trees and puts values.
    jlouis committed Jan 6, 2012
  5. Preliminary cleanup of test cases.

    This is not the "right" way to do it since it should be internalized,
    but for a start it will do until we fix it.
    jlouis committed Jan 6, 2012