|Code Listing by Raymond Hettinger|
Reduce average dictionary lookup time by making the internal tables more sparse.
Drop-in substitute for Py2.7's new collections.OrderedDict. The recipe has big-oh performance that matches regular dictionaries (amortized O(1) insertion/deletion/lookup and O(n) iteration/repr/copy/equality_testing).
Computes the strategy oddments for two-player zero-sum games of perfect information. Uses a robust, iterative approximation that can handle dominance, non-square payoff matrices, and games without a saddle-point.
Saves the name of the managed attribute and uses the saved name
in calls to the getter, setter, or destructor. This allows the
same function to be used for more than one managed variable.
Using property() with more...
New take on merging. Uses Python's "timsort" to merge in O(n) time.
Essentially a sorted bag.
Full-featured O(1) LRU cache backported from Python3.3. The full Py3.3 API is supported (thread safety, maxsize, keyword args, type checking, __wrapped__, and cache_info). Includes Py3.3 optimizations for better memory utilization, fewer...
Run parameterized map, filter, reduce, and extract functions on a database structured as a list of tuples. Useful for applications where the filter, extract, and summarize operations are specified by the user at runtime.
Pure python equivalent of the __slots__ implementation using descriptors and a metaclass.
Monitor sets for changes using the Observer design pattern.
All files and free downloads are copyright of their respective owners. We do not provide any hacked, cracked, illegal, pirated version of scripts, codes, components downloads. All files are downloaded from the publishers website, our file servers or download mirrors. Always Virus check files downloaded from the web specially zip, rar, exe, trial, full versions etc. Download links from rapidshare, depositfiles, megaupload etc not published.