cpython

Commit Graph

Author	SHA1	Message	Date
Raymond Hettinger	fe889f3c62	Factor away a redundant clear() function.	21 years ago
Raymond Hettinger	a580c47c6d	* Improve a variable name: entry0 --> table. * Give set_lookkey_string() a fast alternate path when no dummy entries are present. * Have set_swap_bodies() reset the hash field to -1 whenever either of bodies is not a frozenset. Maintains the invariant of regular sets always having -1 in the hash field; otherwise, any mutation would make the hash value invalid. * Use an entry pointer to simplify the code in frozenset_hash().	21 years ago
Raymond Hettinger	a9d9936d10	* Move copyright notice to top and indicate derivation from sets.py and dictobject.c. * Have frozenset_hash() use entry->hash instead of re-computing each individual hash with PyObject_Hash(o); * Finalize the dummy entry before a system exit.	21 years ago
Raymond Hettinger	67962ab1bb	Model set.pop() after dict.popitem().	21 years ago
Raymond Hettinger	d794666048	* Improve code for the empty frozenset singleton: - 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.	21 years ago
Hye-Shik Chang	e295676c87	Fix build on gcc: PySetIter_Type should be static in definition part also.	21 years ago
Raymond Hettinger	06d8cf8ceb	Improve variable names.	21 years ago
Raymond Hettinger	9dcb17cb1a	Fix frozenset() ref count and a comment typo.	21 years ago
Raymond Hettinger	934d63eb40	Comment on the set_swap_bodies() helper function.	21 years ago
Raymond Hettinger	9f1a6796eb	Revised the set() and frozenset() implementaion to use its own internal data structure instead of using dictionaries. Reduces memory consumption by 1/3 and provides modest speed-ups for most set operations.	21 years ago
Raymond Hettinger	bb999b5925	SF patch #1200018 : Restore GC support to set objects Reverts 1.26 and 1.27. And adds cycle testing.	21 years ago
Raymond Hettinger	15056a5202	SF 1062353: set pickling problems Support automatic pickling of dictionaries in instance of set subclasses.	21 years ago
Raymond Hettinger	6429a4727e	Use Py_CLEAR(). Add unrelated test.	22 years ago
Nicholas Bastin	9ba301e589	Moved SunPro warning suppression into pyport.h and out of individual modules and objects.	22 years ago
Nicholas Bastin	1ce9e4cfc1	Fixed end-of-loop code not reached warning when using SunPro C	22 years ago
Raymond Hettinger	148a63f1fc	Remove a function no longer in use.	22 years ago
Raymond Hettinger	47edb4b09c	Remove unnecessary GC support. Sets cannot have cycles.	22 years ago
Raymond Hettinger	c978633ec6	Futher improvements to frozenset hashing (based on Yitz Gale's battery of tests which nicely highly highlight weaknesses). * Initial value is now a large prime. * Pre-multiply by the set length to add one more basis of differentiation. * Work a bit harder inside the loop to scatter bits from sources that may have closely spaced hash values. All of this is necessary to make up for keep the hash function commutative. Fortunately, the hash value is cached so the call to frozenset_hash() will only occur once per set.	22 years ago
Raymond Hettinger	27e403ebe9	Fixups to the hash function for frozensets. * Non-zero initial value so that hash(frozenset()) != hash(0). * Final permutation to differentiate nested sets. * Add logic to make sure that -1 is not a possible hash value.	22 years ago
Raymond Hettinger	691d80532b	Make sets and deques weak referencable.	22 years ago
Raymond Hettinger	3fd500b4a5	The copy module now handles sets directly. The __copy__ methods are no longer needed.	22 years ago
Raymond Hettinger	a3b11e7fb3	* Simplify and speedup logic for tp_print. * Speed-up intersection whenever PyDict_Next can be used.	22 years ago
Raymond Hettinger	81ad32e435	Speedup set.update by using the override mode for PyDict_Merge().	22 years ago
Raymond Hettinger	fb4e33a8e2	Improve algorithm for set.difference when the input is not a set.	22 years ago
Raymond Hettinger	438e02dfc8	* Refactor set.__contains__() * Use Py_RETURN_NONE everywhere. * Fix-up the firstpass check for the tp_print slot.	22 years ago
Raymond Hettinger	0deab62704	Refactor set.discard() and set.remove().	22 years ago
Raymond Hettinger	dc5ae11abf	Use dictionary specific looping idiom where possible. Simplifies and speeds-up the code.	22 years ago
Raymond Hettinger	8f5cdaa784	* Added a new method flag, METH_COEXIST. * Used the flag to optimize set.__contains__(), dict.__contains__(), dict.__getitem__(), and list.__getitem__().	22 years ago
Raymond Hettinger	bc0f2ab9bb	Expose dict_contains() and PyDict_Contains() with is about 10% faster than PySequence_Contains() and more clearly applicable to dicts. Apply the new function in setobject.c where __contains__ checking is ubiquitous.	22 years ago
Raymond Hettinger	a38123e2fa	Factor out more duplicate code.	22 years ago
Guido van Rossum	5f4e45d66f	Stop GCC warning about int literal that's so long that it becomes an unsigned int (on a 32-bit machine), by adding an explicit 'u' to the literal (a prime used to improve the hash function for frozenset).	22 years ago
Raymond Hettinger	f5f41bf087	* Checkin remaining documentation * 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).	22 years ago
Raymond Hettinger	49ba4c39c4	* Simplify hash function and add test to show effectiveness of the hash 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.	22 years ago
Raymond Hettinger	bfd334a42d	Extend temporary hashability to remove() and discard(). Brings the functionality back in line with sets.py.	22 years ago
Raymond Hettinger	19c2d77842	Allow temporary hashability for the __contains__ test. (Requested by Alex Martelli.)	22 years ago
Raymond Hettinger	3fbec701ca	issubset() and issuperset() to work with general iterables	22 years ago
Raymond Hettinger	82d73dd459	Three minor performance improvements: * Improve the hash function to increase the chance that distinct sets will have distinct xor'd hash totals. * Use PyDict_Merge where possible (it is faster than an equivalent iter/set pair). * Don't rebuild dictionaries where the input already has one.	22 years ago
Guido van Rossum	b61982bacb	Implement straightforward suggestions from gcc warnings (remove unused variable, add extra braces).	22 years ago
Raymond Hettinger	1b92fd5bca	Use PySequence_Contains() instead of direct access macro.	22 years ago
Raymond Hettinger	50a4bb325c	Various fixups (most suggested by Armin Rigo).	22 years ago
Raymond Hettinger	e2c277a69f	Fix output spacing typo	22 years ago
Raymond Hettinger	a690a9967e	* Migrate set() and frozenset() from the sandbox. * 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.	22 years ago

1 2 3

143 Commits (ecd4e9de5afab6a5d75a6fa7ebfb62804ba69264)