12 Apr
2016
12 Apr
'16
7:59 p.m.
On Tue, Apr 12, 2016 at 6:42 PM, Greg Ewing
Maybe sets should have a method that returns an indexable view? The order could be defined as equivalent to iteration order, and it would allow things like random.choice to work efficiently on sets.
How would you implement it though? There are gaps in the hash table. -- --Guido van Rossum (python.org/~guido)