1. 21 Eyl, 2018 1 kayıt (commit)
  2. 11 Eyl, 2018 1 kayıt (commit)
  3. 27 Mar, 2017 1 kayıt (commit)
  4. 28 Tem, 2016 1 kayıt (commit)
  5. 18 May, 2016 1 kayıt (commit)
  6. 30 Mar, 2016 1 kayıt (commit)
  7. 06 Mar, 2016 2 kayıt (commit)
  8. 02 Şub, 2016 2 kayıt (commit)
  9. 27 Ock, 2016 1 kayıt (commit)
  10. 26 Ock, 2016 1 kayıt (commit)
  11. 19 Eyl, 2015 1 kayıt (commit)
  12. 03 Eyl, 2015 1 kayıt (commit)
  13. 26 Agu, 2015 1 kayıt (commit)
  14. 01 Nis, 2015 1 kayıt (commit)
  15. 31 Mar, 2015 1 kayıt (commit)
  16. 21 Mar, 2015 1 kayıt (commit)
  17. 20 Mar, 2015 1 kayıt (commit)
  18. 27 Şub, 2015 1 kayıt (commit)
    • Raymond Hettinger's avatar
      Bump the blocksize up from 62 to 64 to speed up the modulo calculation. · daf57f25
      Raymond Hettinger yazdı
      Remove the old comment suggesting that it was desireable to have
      blocksize+2 as a multiple of the cache line length.  That would
      have made sense only if the block structure start point was always
      aligned to a cache line boundary.  However, the memory allocations
      are 16 byte aligned, so we don't really have control over whether
      the struct spills across cache line boundaries.
      daf57f25
  19. 15 Ara, 2014 1 kayıt (commit)
  20. 15 Haz, 2014 1 kayıt (commit)
  21. 28 Tem, 2013 1 kayıt (commit)
    • Raymond Hettinger's avatar
      Restore the data block size to 62. · 77578204
      Raymond Hettinger yazdı
      The former block size traded away good fit within cache lines in
      order to gain faster division in deque_item().  However, compilers
      are getting smarter and can now replace the slow division operation
      with a fast integer multiply and right shift.  Accordingly, it makes
      sense to go back to a size that lets blocks neatly fill entire
      cache-lines.
      
      GCC-4.8 and CLANG 4.0 both compute "x // 62" with something
      roughly equivalent to "x * 9520900167075897609 >> 69".
      77578204
  22. 09 Tem, 2013 1 kayıt (commit)
  23. 06 Tem, 2013 1 kayıt (commit)
    • Raymond Hettinger's avatar
      Speed-up deque indexing by changing the deque block length to a power of two. · de68e0cf
      Raymond Hettinger yazdı
      The division and modulo calculation in deque_item() can be compiled
      to fast bitwise operations when the BLOCKLEN is a power of two.
      
      Timing before:
      
       ~/cpython $ py -m timeit -r7 -s 'from collections import deque' -s 'd=deque(range(10))' 'd[5]'
      10000000 loops, best of 7: 0.0627 usec per loop
      
      Timing after:
      
      ~/cpython $ py -m timeit -r7 -s 'from collections import deque' -s 'd=deque(range(10))' 'd[5]'
      10000000 loops, best of 7: 0.0581 usec per loop
      de68e0cf
  24. 03 Agu, 2012 2 kayıt (commit)
  25. 03 Nis, 2012 1 kayıt (commit)
  26. 25 Ock, 2011 2 kayıt (commit)
  27. 21 Kas, 2010 1 kayıt (commit)
  28. 20 Kas, 2010 1 kayıt (commit)
  29. 03 Nis, 2010 3 kayıt (commit)
  30. 14 Mar, 2010 1 kayıt (commit)
  31. 07 Şub, 2010 1 kayıt (commit)
  32. 23 Ock, 2010 1 kayıt (commit)
  33. 19 Ock, 2010 1 kayıt (commit)
  34. 10 Ara, 2009 1 kayıt (commit)