1. 17 Jan, 2003 20 commits
  2. 16 Jan, 2003 9 commits
  3. 15 Jan, 2003 8 commits
  4. 14 Jan, 2003 3 commits
    • Tim Peters's avatar
      Removed obsolete "by eyeball" test cruft. · 4e0bf97c
      Tim Peters authored
      4e0bf97c
    • Jeremy Hylton's avatar
      Try using a AF_INET address so that the test runs on Windows. · 43a85e70
      Jeremy Hylton authored
      XXX Don't expect port 9 to do anything on any machine.
      43a85e70
    • Tim Peters's avatar
      New btrees module check.py (and test program). The primary new function · f4e8c075
      Tim Peters authored
      is check.check(btree), which performs value-based sanity checks on a
      BTree (or TreeSet) that the btree._check() method doesn't do.  The new
      checks include that all the bucket keys are in sorted order, and that
      all the keys within each bucket, and within each internal BTree node,
      lie within the range necessary for that node.  That last is a subtle
      invariant that can't be checked locally:  it requires propagating range
      info down the tree, and modifying it for each child and each level.
      This *should* catch any BTree B for which iterating over the keys yields
      a key K for which B.has_key(K) returns false.
      
      Another function check.display(btree) prints the internal structure of
      a BTree (or TreeSet, Bucket, or Set) to stdout.  If check.check(B) ever
      complains, a clearer picture of the damage can be gotten by staring at
      check.display(B)'s output.
      
      Also beefed up the regular BTree tests by calling check.check() in key
      places.  No surprises (the tests still pass).
      f4e8c075