Paul G wrote:
> full ordering/sorting hit on inserts. if you think a little harder, this
> can be made fairly efficient with a sparse circular list of event
> buckets, with each bucket being a fifo queue of events to be fired at
> that time. whether it's worth bothering with the additional complexity
> is up for discussion.
Sounds like a not-yet-polished version of what the kernel does.
http://lwn.net/Articles/156329/
(note I'm not really convinced twisted should implement a similar thing,
atleast right now)