On Thu, Feb 21, 2013 at 5:50 AM, Yuval Greenfield <firstname.lastname@example.org>
Ignoring performance issues, imagine instead a sorted set class that you could add ranges to (or remove them). Well, actually it's trivial to convert a range to a set; the interesting problem is performance. You could save the range parts unexpanded so you could add huge ranges and you could also support infinite ranges (itertools.count).
I suggest this because once you consider doing the first set of operations, like r1 & r2, it's quite natural for someone to want
some_non_unlucky_integers = range(100) -