8 Feb
2015
8 Feb
'15
3:56 p.m.
Raymond Hettinger
I thought ordered sets were interesting enough to write an implementation six years ago, but frankly there are many other other things that have a much better case for being added to collections (for example, some sort of graph structure, some kind of binary tree, some kind of trie, or perhaps a bloom filter).
We could use a SortedDict and a SortedSet implemented as binary search trees. They should have the same interface as set and dict, but also allow slicing and query method for extracting ranges of keys. Personally I doubt the usefulness of OrderedDict and OrderedSet. Sturla