<barnesc at engr.orst.edu> wrote in message news:1126684132.4327d5e4335b6 at webmail.oregonstate.edu... > The bset() and bdict() classes improve upon the builtin set and > dictionary types by maintaining the elements in sorted order. > > Generally, the b* classes are a factor of O(log(N)) slower[2] than the > corresponding builtin classes, except for certain operations: 'Improve upon' and 'are slower' (for essential operations) are mutually contradictory ;-). Your classes differ from the builtin types by optimizing different operations. No need to confuse and distract with an unnecessary false claim. Terry J. Reedy
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