1. 23 Kas, 2009 1 kayıt (commit)
  2. 02 Tem, 2009 1 kayıt (commit)
  3. 09 Agu, 2008 1 kayıt (commit)
  4. 24 Haz, 2008 1 kayıt (commit)
  5. 11 Ock, 2008 1 kayıt (commit)
  6. 08 Mar, 2007 1 kayıt (commit)
  7. 05 Ock, 2007 1 kayıt (commit)
  8. 14 Haz, 2006 2 kayıt (commit)
    • Tim Peters's avatar
      Repaired typo in new comment. · 61bdd39b
      Tim Peters yazdı
      61bdd39b
    • Tim Peters's avatar
      SequenceMatcher.get_matching_blocks(): This now guarantees that · 43898b4f
      Tim Peters yazdı
      adjacent triples in the result list describe non-adjacent matching
      blocks.  That's _nice_ to have, and Guido said he wanted it.
      
      Not a bugfix candidate:  Guido or not ;-), this changes visible
      endcase semantics (note that some tests had to change), and
      nothing about this was documented before.  Since it was working
      as designed, and behavior was consistent with the docs, it wasn't
      "a bug".
      43898b4f
  9. 13 Haz, 2006 1 kayıt (commit)
  10. 09 Haz, 2006 1 kayıt (commit)
  11. 31 Ock, 2006 1 kayıt (commit)
  12. 22 Tem, 2005 1 kayıt (commit)
  13. 12 Kas, 2004 1 kayıt (commit)
  14. 10 Eyl, 2004 1 kayıt (commit)
  15. 29 Agu, 2004 4 kayıt (commit)
  16. 31 Tem, 2004 1 kayıt (commit)
  17. 10 Tem, 2004 1 kayıt (commit)
  18. 15 Haz, 2004 1 kayıt (commit)
  19. 13 Haz, 2004 1 kayıt (commit)
  20. 12 Şub, 2004 1 kayıt (commit)
  21. 16 Eki, 2003 1 kayıt (commit)
  22. 16 Tem, 2003 1 kayıt (commit)
  23. 01 Tem, 2003 1 kayıt (commit)
  24. 17 Haz, 2003 1 kayıt (commit)
  25. 08 Haz, 2003 2 kayıt (commit)
  26. 30 Eki, 2002 1 kayıt (commit)
  27. 01 Haz, 2002 1 kayıt (commit)
  28. 29 Nis, 2002 1 kayıt (commit)
    • Tim Peters's avatar
      Mostly in SequenceMatcher.{__chain_b, find_longest_match}: · 81b9251d
      Tim Peters yazdı
      This now does a dynamic analysis of which elements are so frequently
      repeated as to constitute noise.  The primary benefit is an enormous
      speedup in find_longest_match, as the innermost loop can have factors
      of 100s less potential matches to worry about, in cases where the
      sequences have many duplicate elements.  In effect, this zooms in on
      sequences of non-ubiquitous elements now.
      
      While I like what I've seen of the effects so far, I still consider
      this experimental.  Please give it a try!
      81b9251d
  29. 03 Nis, 2002 1 kayıt (commit)
    • Guido van Rossum's avatar
      Add the 'bool' type and its values 'False' and 'True', as described in · 77f6a65e
      Guido van Rossum yazdı
      PEP 285.  Everything described in the PEP is here, and there is even
      some documentation.  I had to fix 12 unit tests; all but one of these
      were printing Boolean outcomes that changed from 0/1 to False/True.
      (The exception is test_unicode.py, which did a type(x) == type(y)
      style comparison.  I could've fixed that with a single line using
      issubtype(x, type(y)), but instead chose to be explicit about those
      places where a bool is expected.
      
      Still to do: perhaps more documentation; change standard library
      modules to return False/True from predicates.
      77f6a65e
  30. 01 Nis, 2002 1 kayıt (commit)
  31. 04 Eki, 2001 1 kayıt (commit)
  32. 22 Eyl, 2001 1 kayıt (commit)
  33. 12 Agu, 2001 1 kayıt (commit)
  34. 20 Şub, 2001 1 kayıt (commit)
  35. 19 Şub, 2001 1 kayıt (commit)