1. 29 Dec, 2000 2 commits
    • Tim Peters's avatar
      getopt used to sort the long option names, in an attempt to simplify · d31b6328
      Tim Peters authored
      the logic.  That resulted in a bug.  My previous getopt checkin repaired
      the bug but left the sorting.  The solution is significantly simpler if
      we don't bother sorting at all, so this checkin gets rid of the sort and
      the code that relied on it.
      d31b6328
    • Tim Peters's avatar
      Fred, THIS NEEDS DOCS! The function docstrings tell the tale. · 36cdad12
      Tim Peters authored
      Christmas present to myself:  the bisect module didn't define what
      happened if the new element was already in the list.  It so happens
      that it inserted the new element "to the right" of all equal elements.
      Since it wasn't defined, among other bad implications it was a mystery
      how to use bisect to determine whether an element was already in the
      list (I've seen code that *assumed* "to the right" without justification).
      Added new methods bisect_left and insort_left that insert "to the left"
      instead; made the old names bisect and insort aliases for the new names
      bisect_right and insort_right; beefed up docstrings to explain what
      these actually do; and added a std test for the bisect module.
      36cdad12
  2. 28 Dec, 2000 2 commits
  3. 27 Dec, 2000 5 commits
  4. 26 Dec, 2000 5 commits
  5. 25 Dec, 2000 1 commit
  6. 23 Dec, 2000 7 commits
  7. 22 Dec, 2000 10 commits
  8. 21 Dec, 2000 5 commits
  9. 20 Dec, 2000 3 commits