Vladimir 'Yu' Stepanov wrote: > Yes. I understood it when resulted a set example. >> However, as I just said, people usually don't remove items from >> just-sorted lists, they tend to iterate over them via 'for i in list:' . >> > Such problem arises at creation of the list of timers.
For a list of timers/timeout events, a priority queue is often the best data structure, which is already available through the heapq module. Regards, Martin _______________________________________________ Python-Dev mailing list Python-Dev@python.org http://mail.python.org/mailman/listinfo/python-dev Unsubscribe: http://mail.python.org/mailman/options/python-dev/archive%40mail-archive.com
