Raymond Hettinger wrote: > I would like to establish a new module for some collection classes. Cool. > The first type would be a bag, modeled after one of Smalltalk's > key collection classes (similar to MultiSets in C++ and bags in > Objective C). > > The second type would be a high speed queue implemented using > linked list blocks like we used for itertools.tee(). The > interface could be as simple as push, pop, and len. Each > operation ought to run about as fast a list assignment (meaning > that it beats the heck out of the list.pop(0), list.append(data) > version). In some of my projects I'd really needed sorted dict. (dict sorted by value and indexed by key or index) > This module could also serve as the "one obvious place to put it" > for other high performance datatypes that might be added in the > future (such as fibheaps or some such). Maybe set and frozenset are need to be in this module too? -- Dmitry Vasiliev (dima at hlabs.spb.ru)
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4