On 18Jun2012 00:17, John O'Hagan <resea...@johnohagan.com> wrote: | On Sat, 16 Jun 2012 13:27:45 -0400 | Dennis Lee Bieber <wlfr...@ix.netcom.com> wrote: | > Not "after each event is read" but when a new event is | > generated/inserted. The list is not a FIFO where new events are added to | > the end, but more of a priority queue where the lowest time is the next | > to be retrieved. | | You're right, of course.
Thought I'd point out that a heapq works nicely for this, or it has for me in this scenario , anyway. -- Cameron Simpson <c...@zip.com.au> -- http://mail.python.org/mailman/listinfo/python-list
