1. 4659ddc Merge doc fixes from 3.5 by Martin Panter · 7 years ago
  2. 536d70e Fix grammar, typos and markup in documentation and code comments by Martin Panter · 7 years ago
  3. f0b311b Issue #28123: _PyDict_GetItem_KnownHash() now can raise an exception as by Serhiy Storchaka · 8 years ago
  4. 8805717 Revert part of 3471a3515827 that caused a performance regression by Raymond Hettinger · 8 years ago
  5. ad8c83a Avoid inefficient way to call functions without argument by Victor Stinner · 8 years ago
  6. 17f0e61 - Modules/_collectionsmodule.c: Mark one more internal symbol as static. by doko@ubuntu.com · 8 years ago
  7. bc73150 - make some internal symbols static by doko@ubuntu.com · 8 years ago
  8. a0d416f Issue #26482: Allowed pickling recursive dequeues. by Serhiy Storchaka · 8 years ago
  9. d79d5b1 More logicial order. Move space saving step to just before it is used. by Raymond Hettinger · 8 years ago
  10. 6f86a33 Factor-out common subexpression. by Raymond Hettinger · 8 years ago
  11. 589106b Put block length computations in a more logical order. by Raymond Hettinger · 8 years ago
  12. 3841866 Issue #26200: The SETREF macro adds unnecessary work in some cases. by Raymond Hettinger · 8 years ago
  13. a638971 merge by Raymond Hettinger · 8 years ago
  14. 0ef0423 merge by Raymond Hettinger · 8 years ago
  15. 3743432 Issue #26194: Fix undefined behavior for deque.insert() when len(d) == maxlen by Raymond Hettinger · 8 years ago
  16. 306d6b1 Convert another post-decrement while-loop to pre-decrement for consistency by Raymond Hettinger · 8 years ago
  17. 165eee2 Convert two other post-decrement while-loops to pre-decrements for consistency by Raymond Hettinger · 8 years ago
  18. d84ec22 Miscellaneous refactorings by Raymond Hettinger · 8 years ago
  19. 3e47a13 merge 3.5 by Benjamin Peterson · 8 years ago
  20. 4e3dd51 merge 3.4 by Benjamin Peterson · 8 years ago
  21. 630329e merge 3.3 by Benjamin Peterson · 8 years ago
  22. 0e617e2 remove some copyright notices supserseded by the toplevel ones by Benjamin Peterson · 8 years ago
  23. 1ed017a Issue #20440: Cleaning up the code by using Py_SETREF and Py_CLEAR. by Serhiy Storchaka · 8 years ago
  24. a9406e7 Issue #25421: __sizeof__ methods of builtin types now use dynamic basic size. by Serhiy Storchaka · 8 years ago
  25. 5c4064e Issue #25421: __sizeof__ methods of builtin types now use dynamic basic size. by Serhiy Storchaka · 8 years ago
  26. 4a91d21 Neaten-up the inner-loop logic. by Raymond Hettinger · 9 years ago
  27. df8f5b5 Minor cleanup. by Raymond Hettinger · 9 years ago
  28. 0bdf9ea merge by Raymond Hettinger · 9 years ago
  29. 67b97b8 Move the initial start-search out of the main loop so it can be factored-out later. by Raymond Hettinger · 9 years ago
  30. e56a919 Issue #25523: Merge a-to-an corrections from 3.5 by Martin Panter · 9 years ago
  31. d2ad571 Issue #25523: Further a-to-an corrections new in 3.5 by Martin Panter · 9 years ago
  32. db41fd4 Removed unused parameter by Raymond Hettinger · 9 years ago
  33. 0f43bb1 Only update the state variable once per iteration. by Raymond Hettinger · 9 years ago
  34. 20151f5 Issue #25414: Remove unnecessary tests that can never succeed. by Raymond Hettinger · 9 years ago
  35. 1eca237 Remove old Todo entry that isn't going to happen. by Raymond Hettinger · 9 years ago
  36. a4b13d0 Rewrap comment. by Raymond Hettinger · 9 years ago
  37. bc00341 Use unsigned division by Raymond Hettinger · 9 years ago
  38. 1286d14 Improve variable names and constant expressions by Raymond Hettinger · 9 years ago
  39. 965362e Minor fixup. maxlen is already known. by Raymond Hettinger · 9 years ago
  40. d96db09 Refactor the deque trim logic to eliminate the two separate trim functions. by Raymond Hettinger · 9 years ago
  41. 6b1e113 Hoist the deque->maxlen lookup out of the inner-loop. by Raymond Hettinger · 9 years ago
  42. a7f63009 Minor tweak. Make the maxlen comparisons a little more clear and consistent. by Raymond Hettinger · 9 years ago
  43. 848f2b5 Backport early-out 91259f061cfb to reduce the cost of bb1a2944bcb6 by Raymond Hettinger · 9 years ago
  44. 0443ac2 Eliminate unnecessary test by Raymond Hettinger · 9 years ago
  45. fd265f4 Factor out common iterator finalization code by Raymond Hettinger · 9 years ago
  46. 0d30940 Add fast paths to deque_init() for the common cases by Raymond Hettinger · 9 years ago
  47. 3803114 Add an early-out for deque_clear() by Raymond Hettinger · 9 years ago
  48. 8299e9b Move the copy and clear functions upwards to eliminate unnecessary forward references. by Raymond Hettinger · 9 years ago
  49. 7c0b70f Minor tweak to the order of variable updates. by Raymond Hettinger · 9 years ago
  50. f2b02ce Bump up the maximum number of freeblocks by Raymond Hettinger · 9 years ago
  51. c22eee6 Precomputing the number iterations allows the inner-loop to be vectorizable. by Raymond Hettinger · 9 years ago
  52. 7a84552 Hoist constant expression out of an inner loop. by Raymond Hettinger · 9 years ago
  53. e055b88 merge by Raymond Hettinger · 9 years ago
  54. bf49fee Issue #25135: Avoid possible reentrancy issues in deque_clear. by Raymond Hettinger · 9 years ago
  55. 2b0d646 Replace an unpredictable branch with a simple addition. by Raymond Hettinger · 9 years ago
  56. 3a1a8d0 Eliminate unnecessary variables by Raymond Hettinger · 9 years ago
  57. 7a23723 Eliminate unnecessary variable by Raymond Hettinger · 9 years ago
  58. d3d2b2c Minor consistency improvements to negative value comparisons. by Raymond Hettinger · 9 years ago
  59. aed8830 Add a fast path (no iterator creation) for a common case for repeating deques of size 1 by Raymond Hettinger · 9 years ago
  60. 0e14e66 Hoist constant expression out of an inner loop by Raymond Hettinger · 9 years ago
  61. ad26225 Tighten inner-loop for deque_inplace_repeat(). by Raymond Hettinger · 9 years ago
  62. e4f3467 Add an exact type match fast path for deque_copy(). by Raymond Hettinger · 9 years ago
  63. 95e2cc5 Fix refcount. by Raymond Hettinger · 9 years ago
  64. 67c78b5 In-line the append operations inside deque_inplace_repeat(). by Raymond Hettinger · 9 years ago
  65. f5d72f3 Simply deque repeat by reusing code in in-line repeat. Avoid unnecessary division. by Raymond Hettinger · 9 years ago
  66. 318c5ae merge by Raymond Hettinger · 9 years ago
  67. 2b2b753 Prevent reentrant badness by deferring the decrefs as long as possible. by Raymond Hettinger · 9 years ago
  68. 7a1a0bb merge by Raymond Hettinger · 9 years ago
  69. 87674ec Issue #24913: Fix overrun error in deque.index(). by Raymond Hettinger · 9 years ago
  70. 28c995d Minor cleanup. by Raymond Hettinger · 9 years ago
  71. 12f896c Fix minor typo in a comment by Raymond Hettinger · 9 years ago
  72. aa23fa2 merge by Raymond Hettinger · 9 years ago
  73. 043e800 merge by Raymond Hettinger · 9 years ago
  74. 239aba7 Issue #19663: Improve error message for defaultdict. by Raymond Hettinger · 9 years ago
  75. cfe5b6c Divisions-by-two for a positive Py_ssize_t compile more cleanly with >>1 than /2. by Raymond Hettinger · 9 years ago
  76. 96c6af9 Issue #16991: Add a C implementation of collections.OrderedDict. by Eric Snow · 9 years ago
  77. 47db717 Issue #16991: Add a C implementation of collections.OrderedDict. by Eric Snow · 9 years ago
  78. c6249a6 Defer deleted item decref until after the deque is restored to a consistent state. by Raymond Hettinger · 9 years ago
  79. 1a62921 fix refleak in deque_concat by Benjamin Peterson · 9 years ago
  80. 41290a6 Issue 23793: Add deque support for __add__(), __mul__(), and __imul__(). by Raymond Hettinger · 9 years ago
  81. fef9c1b Fix typo by Raymond Hettinger · 9 years ago
  82. 8dbbae2 Minor code and comment cleanups. by Raymond Hettinger · 9 years ago
  83. 551350a Improve and fix-up comments. by Raymond Hettinger · 9 years ago
  84. 0f1451c Issue 23744: Minor speed-up for deque.__bool__(). by Raymond Hettinger · 9 years ago
  85. 6921c13 Minor nit. Make the rotate() success/fail tests consistent. by Raymond Hettinger · 9 years ago
  86. ac13ad6 For safety, wait to decref deleted values until the deque state has been restored. by Raymond Hettinger · 9 years ago
  87. 0f6f947 Fix minor formatting nits and remove unnecessary comment. by Raymond Hettinger · 9 years ago
  88. 32ea165 Issue 23704: Add index(), copy(), and insert() to deques. Register deques as a MutableSequence. by Raymond Hettinger · 9 years ago
  89. 39dadf7 Issue 23705: Improve the performance of __contains__ checks for deques. by Raymond Hettinger · 9 years ago
  90. 87e6912 Minor neatening-up. Make assignments in same order a struct fields. Line-up comments. by Raymond Hettinger · 9 years ago
  91. f9d9c79 Switch the state variable to unsigned for defined wrap-around behavior. by Raymond Hettinger · 9 years ago
  92. 30c9074 Minor beautification. Move struct definitions to the top. Fix-up a comment. by Raymond Hettinger · 9 years ago
  93. f30f5b9 Minor code beautification. Replace macro with in-lineable functions. by Raymond Hettinger · 9 years ago
  94. 3c186ba Beautify and better document the use of the size_t cast for bounds checking. by Raymond Hettinger · 9 years ago
  95. 7f9ea75 Issue #23553: Use an unsigned cast to tighten-up the bounds checking logic. by Raymond Hettinger · 9 years ago
  96. c208308 Need a (size_t) cast instead of (unsigned) to be big enough for a Py_ssize_t. by Raymond Hettinger · 9 years ago
  97. a473b9d Use unsigned division and modulo for item assignment as well. by Raymond Hettinger · 9 years ago
  98. 63d1ff2 Convert one more division to unsigned arithmetic to speed-up deque_item(). by Raymond Hettinger · 9 years ago
  99. 7e8c795 Line missed in last checkin by Raymond Hettinger · 9 years ago
  100. da2850f Since the index is always non-negative, use faster unsigned division and modulo. by Raymond Hettinger · 9 years ago