| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Issue 6573: Fix set.union() for cases where self is in the argument chain. | Raymond Hettinger | 2009-07-27 | 1 | -0/+4 |
| | | |||||
| * | convert usage of fail* to assert* | Benjamin Peterson | 2009-06-30 | 1 | -55/+55 |
| | | |||||
| * | fill in actual issue number in tests | Antoine Pitrou | 2009-01-01 | 1 | -1/+1 |
| | | |||||
| * | Issue #3680: Reference cycles created through a dict, set or deque iterator ↵ | Antoine Pitrou | 2009-01-01 | 1 | -2/+15 |
| | | | | | did not get collected. | ||||
| * | Issue #4740: Use HIGHEST_PROTOCOL in pickle test. | Hirokazu Yamamoto | 2008-12-27 | 1 | -1/+1 |
| | | | | | (There is no behavior difference in 2.x because HIGHEST_PROTOCOL == 2) | ||||
| * | #4069: aSet.remove(otherSet) would always report the empty frozenset([]) as ↵ | Amaury Forgeot d'Arc | 2008-10-07 | 1 | -0/+11 |
| | | | | | | | | | the missing key. Now it correctly refers to the initial otherset. Reviewed by Raymond. Will backport to 2.6. | ||||
| * | Multi-arg form for set.difference() and set.difference_update(). | Raymond Hettinger | 2008-06-11 | 1 | -0/+14 |
| | | |||||
| * | Handle the case with zero arguments. | Raymond Hettinger | 2008-06-11 | 1 | -0/+6 |
| | | |||||
| * | Let set.intersection() and set.intersection_update() take multiple input ↵ | Raymond Hettinger | 2008-06-09 | 1 | -0/+6 |
| | | | | | arguments. | ||||
| * | Let set.union() and set.update() accept multiple inputs. | Raymond Hettinger | 2008-06-09 | 1 | -0/+7 |
| | | |||||
| * | Don't try to close a non-open file. | Neal Norwitz | 2008-03-25 | 1 | -4/+4 |
| | | | | | Don't let file removal cause the test to fail. | ||||
| * | Expand tests to include nested graph structures. | Raymond Hettinger | 2008-01-24 | 1 | -0/+106 |
| | | |||||
| * | Add set.isdisjoint() | Raymond Hettinger | 2007-11-08 | 1 | -2/+47 |
| | | |||||
| * | Whitespace normalization. Ugh, we really need to do this more often. | Neal Norwitz | 2007-04-25 | 1 | -1/+1 |
| | | | | | You might want to review this change as it's my first time. Be gentle. :-) | ||||
| * | Add test and fix for fromkeys() optional argument. | Raymond Hettinger | 2007-03-21 | 1 | -0/+3 |
| | | |||||
| * | Extend work on rev 52962 and 53829 eliminating redundant PyObject_Hash() ↵ | Raymond Hettinger | 2007-03-20 | 1 | -0/+4 |
| | | | | | calls and fixing set/dict interoperability. | ||||
| * | Whitespace normalization. | Tim Peters | 2007-03-12 | 1 | -2/+2 |
| | | |||||
| * | Extend work on revision 52962: Eliminate redundant calls to PyObject_Hash(). | Raymond Hettinger | 2007-02-19 | 1 | -0/+20 |
| | | |||||
| * | Whitespace normalization. | Tim Peters | 2007-01-30 | 1 | -2/+2 |
| | | |||||
| * | SF #1486663 -- Allow keyword args in subclasses of set() and frozenset(). | Raymond Hettinger | 2007-01-11 | 1 | -0/+11 |
| | | |||||
| * | For sets with cyclical reprs, emit an ellipsis instead of infinitely recursing. | Raymond Hettinger | 2006-12-30 | 1 | -0/+26 |
| | | |||||
| * | Add test for SF bug 1576657 | Raymond Hettinger | 2006-12-08 | 1 | -0/+11 |
| | | |||||
| * | Try to repair more new buildbot failures in "x86 OpenBSD trunk", due | Tim Peters | 2006-04-11 | 1 | -1/+1 |
| | | | | | | | | | | | | | | | | | to that id() can now return a Python long on a 32-bit box that allocates addresses "with the sign bit set". test_set.py test_subclass_with_custom_hash(): it's never been portably legal for a __hash__() method to return id(self), but on 32-bit boxes that never caused a problem before it became possible for id() to return a Python long. Changed __hash__ here to return a Python int regardless of platform. test_descr.py specials(): vereq(hash(c1), id(c1)) has never been a correct test -- just removed it (hash() is always a Python int; id() may be a Python long). | ||||
| * | SF patch #1458476 with modifications based on discussions in python-dev. This | Barry Warsaw | 2006-03-30 | 1 | -1/+1 |
| | | | | | | | adds the following API calls: PySet_Clear(), _PySet_Next(), and _PySet_Update(). The latter two are considered non-public. Tests and documentation (for the public API) are included. | ||||
| * | Renamed _length_cue() to __length_hint__(). See: | Armin Rigo | 2006-02-11 | 1 | -1/+3 |
| | | | | | http://mail.python.org/pipermail/python-dev/2006-February/060524.html | ||||
| * | Improve test coverage. Hope the test_file changes work the same on windows. | Neal Norwitz | 2005-11-27 | 1 | -0/+12 |
| | | |||||
| * | No longer ignore exceptions raised by comparisons during key lookup. | Raymond Hettinger | 2005-09-16 | 1 | -0/+17 |
| | | | | | Inspired by Armin Rigo's suggestion to do the same with dictionaries. | ||||
| * | Numerous fix-ups to C API and docs. Added tests for C API. | Raymond Hettinger | 2005-08-16 | 1 | -1/+6 |
| | | |||||
| * | * Fix SF #1257731. Make __contains__(), remove(), and discard() only do | Raymond Hettinger | 2005-08-12 | 1 | -0/+13 |
| | | | | | | | | a frozenset conversion when the initial search attempt fails with a TypeError and the key is some type of set. Add a testcase. * Eliminate a duplicate if-stmt. | ||||
| * | * Add short-circuit code for in-place operations with self (such as | Raymond Hettinger | 2005-08-11 | 1 | -0/+12 |
| | | | | | | | | | | | | | | | | | | | | | | s|=s, s&=s, s-=s, or s^=s). Add related tests. * Improve names for several variables and functions. * Provide alternate table access functions (next, contains, add, and discard) that work with an entry argument instead of just a key. This improves set-vs-set operations because we already have a hash value for each key and can avoid unnecessary calls to PyObject_Hash(). Provides a 5% to 20% speed-up for quick hashing elements like strings and integers. Provides much more substantial improvements for slow hashing elements like tuples or objects defining a custom __hash__() function. * Have difference operations resize() when 1/5 of the elements are dummies. Formerly, it was 1/6. The new ratio triggers less frequently and only in cases that it can resize quicker and with greater benefit. The right answer is probably either 1/4, 1/5, or 1/6. Picked the middle value for an even trade-off between resize time and the space/time costs of dummy entries. | ||||
| * | * Improve code for the empty frozenset singleton: | Raymond Hettinger | 2005-08-01 | 1 | -0/+20 |
| | | | | | | | | | | | | - Handle both frozenset() and frozenset([]). - Do not use singleton for frozenset subclasses. - Finalize the singleton. - Add test cases. * Factor-out set_update_internal() from set_update(). Simplifies the code for several internal callers. * Factor constant expressions out of loop in set_merge_internal(). * Minor comment touch-ups. | ||||
| * | Add test for hash commutativity. | Raymond Hettinger | 2005-07-05 | 1 | -0/+10 |
| | | |||||
| * | SF patch #1200018: Restore GC support to set objects | Raymond Hettinger | 2005-06-18 | 1 | -0/+10 |
| | | | | | | Reverts 1.26 and 1.27. And adds cycle testing. | ||||
| * | SF 1062353: set pickling problems | Raymond Hettinger | 2004-11-09 | 1 | -3/+9 |
| | | | | | Support automatic pickling of dictionaries in instance of set subclasses. | ||||
| * | Use Py_CLEAR(). Add unrelated test. | Raymond Hettinger | 2004-09-28 | 1 | -0/+3 |
| | | |||||
| * | Use floor division operator. | Raymond Hettinger | 2004-09-27 | 1 | -1/+1 |
| | | |||||
| * | * fix the print test | Raymond Hettinger | 2004-07-09 | 1 | -0/+14 |
| | | | | | * add more __init__ tests | ||||
| * | Make sets and deques weak referencable. | Raymond Hettinger | 2004-05-30 | 1 | -0/+8 |
| | | |||||
| * | Replace backticks with repr() or "%r" | Walter Dörwald | 2004-02-12 | 1 | -2/+2 |
| | | | | | From SF patch #852334. | ||||
| * | Whitespace normalization. | Tim Peters | 2004-01-18 | 1 | -1/+1 |
| | | |||||
| * | Strengthen the test for hash effectiveness | Raymond Hettinger | 2003-12-31 | 1 | -4/+4 |
| | | |||||
| * | Guido grants a Christmas wish: | Raymond Hettinger | 2003-12-17 | 1 | -5/+5 |
| | | | | | sorted() becomes a regular function instead of a classmethod. | ||||
| * | * Checkin remaining documentation | Raymond Hettinger | 2003-11-24 | 1 | -14/+59 |
| | | | | | | | | * Add more tests * Refactor and neaten the code a bit. * Rename union_update() to update(). * Improve the algorithms (making them a closer to sets.py). | ||||
| * | * Simplify hash function and add test to show effectiveness of the hash | Raymond Hettinger | 2003-11-23 | 1 | -13/+72 |
| | | | | | | | | | | | | | | | | function. * Add a better test for deepcopying. * Add tests to show the __init__() function works like it does for list and tuple. Add related test. * Have shallow copies of frozensets return self. Add related test. * Have frozenset(f) return f if f is already a frozenset. Add related test. * Beefed-up some existing tests. | ||||
| * | Extend temporary hashability to remove() and discard(). | Raymond Hettinger | 2003-11-22 | 1 | -0/+10 |
| | | | | | Brings the functionality back in line with sets.py. | ||||
| * | Allow temporary hashability for the __contains__ test. | Raymond Hettinger | 2003-11-21 | 1 | -0/+2 |
| | | | | | (Requested by Alex Martelli.) | ||||
| * | issubset() and issuperset() to work with general iterables | Raymond Hettinger | 2003-11-21 | 1 | -0/+4 |
| | | |||||
| * | Various fixups (most suggested by Armin Rigo). | Raymond Hettinger | 2003-11-17 | 1 | -0/+25 |
| | | |||||
| * | * Migrate set() and frozenset() from the sandbox. | Raymond Hettinger | 2003-11-16 | 1 | -0/+1183 |
| * Install the unittests, docs, newsitem, include file, and makefile update. * Exercise the new functions whereever sets.py was being used. Includes the docs for libfuncs.tex. Separate docs for the types are forthcoming. | |||||
