1 Mar
2007
1 Mar
'07
5:53 p.m.
On 3/1/07, Martin Aspeli <optilude@gmx.net> wrote:
Sets may turn out to be *sorted* if they're implemented with trees, but I don't think the implementation promises that either.
The BTrees implementation definitely does promise the sorting relationship for the results of iteration, which is useful. Python's built-in set types do not make that promise (and they happen to be hash-based). -Fred -- Fred L. Drake, Jr. <fdrake at gmail.com> "Every sin is the result of a collaboration." --Lucius Annaeus Seneca