1. 21 Kas, 2010 1 kayıt (commit)
  2. 03 Nis, 2010 2 kayıt (commit)
  3. 07 Şub, 2010 1 kayıt (commit)
  4. 23 Ock, 2010 1 kayıt (commit)
  5. 10 Ara, 2009 2 kayıt (commit)
  6. 30 Haz, 2009 1 kayıt (commit)
  7. 10 Mar, 2009 2 kayıt (commit)
  8. 01 Ock, 2009 2 kayıt (commit)
  9. 27 Ara, 2008 1 kayıt (commit)
  10. 10 Nis, 2008 1 kayıt (commit)
  11. 25 Mar, 2008 1 kayıt (commit)
  12. 23 Şub, 2008 1 kayıt (commit)
  13. 13 Ara, 2007 1 kayıt (commit)
  14. 10 Eki, 2007 1 kayıt (commit)
  15. 05 Eki, 2007 1 kayıt (commit)
  16. 21 Ock, 2007 1 kayıt (commit)
  17. 08 Ock, 2007 1 kayıt (commit)
  18. 22 Mar, 2005 2 kayıt (commit)
  19. 19 Mar, 2005 1 kayıt (commit)
  20. 18 Mar, 2005 1 kayıt (commit)
  21. 09 Kas, 2004 1 kayıt (commit)
  22. 02 Eki, 2004 1 kayıt (commit)
    • Armin Rigo's avatar
      Upon insertion, if memory runs out, the deque was left in a corrupted state. · 974d757a
      Armin Rigo yazdı
      deque_item(): a performance bug: the linked list of blocks was followed
      from the left in most cases, because the test (i < (deque->len >> 1)) was
      after "i %= BLOCKLEN".
      
      deque_clear(): replaced a call to deque_len() with deque->len; not sure what
      this call was here for, nor if all compilers under the sun would inline it.
      
      deque_traverse(): I belive that it could be called by the GC when the deque
      has leftblock==rightblock==NULL, because it is tracked before the first block
      is allocated (though closely before).  Still, a C extension module subclassing
      deque could provide its own tp_alloc that could trigger a GC collection after
      the PyObject_GC_Track()...
      
      deque_richcompare(): rewrote to cleanly check for end-of-iterations instead of
      relying on deque.__iter__().next() to succeed exactly len(deque) times -- an
      assumption which can break if deques are subclassed.  Added a test.
      
      I wonder if the length should be explicitely bounded to INT_MAX, with
      OverflowErrors, as in listobject.c.  On 64-bit machines, adding more than
      INT_MAX in the deque will result in trouble.  (Note to anyone/me fixing
      this: carefully check for overflows if len is close to INT_MAX in the
      following functions: deque_rotate(), deque_item(), deque_ass_item())
      974d757a
  23. 01 Eki, 2004 1 kayıt (commit)
  24. 27 Eyl, 2004 1 kayıt (commit)
  25. 26 Agu, 2004 1 kayıt (commit)
  26. 09 Tem, 2004 1 kayıt (commit)
  27. 30 May, 2004 1 kayıt (commit)
  28. 19 May, 2004 1 kayıt (commit)
    • Raymond Hettinger's avatar
      SF patch #872326: Generator expression implementation · 354433a5
      Raymond Hettinger yazdı
      (Code contributed by Jiwon Seo.)
      
      The documentation portion of the patch is being re-worked and will be
      checked-in soon.  Likewise, PEP 289 will be updated to reflect Guido's
      rationale for the design decisions on binding behavior (as described in
      in his patch comments and in discussions on python-dev).
      
      The test file, test_genexps.py, is written in doctest format and is
      meant to exercise all aspects of the the patch.  Further additions are
      welcome from everyone.  Please stress test this new feature as much as
      possible before the alpha release.
      354433a5
  29. 12 May, 2004 1 kayıt (commit)
  30. 10 May, 2004 1 kayıt (commit)
  31. 09 May, 2004 1 kayıt (commit)
  32. 01 Mar, 2004 1 kayıt (commit)
  33. 29 Şub, 2004 1 kayıt (commit)
    • Raymond Hettinger's avatar
      Improvements to collections.deque(): · 738ec90c
      Raymond Hettinger yazdı
      * Add doctests for the examples in the library reference.
      * Add two methods, left() and right(), modeled after deques in C++ STL.
      * Apply the new method to asynchat.py.
      * Add comparison operators to make deques more substitutable for lists.
      * Replace the LookupErrors with IndexErrors to more closely match lists.
      738ec90c
  34. 08 Şub, 2004 1 kayıt (commit)
  35. 07 Şub, 2004 1 kayıt (commit)