1 Mar
2007
1 Mar
'07
5:05 p.m.
--On 1. März 2007 09:52:53 +0000 Chris Withers <chris@simplistix.co.uk> wrote:
Martin Aspeli wrote:
I'll bet one is backed by a hashtable and the other is backed by an r/b tree, meaning the Set is O(1) lookups, possibly a bit less space efficient and non-ordered,
Well, Set's are definitely ordered, same as normal python sets...
That's likely an implementation invariant but not a feature by design. -aj