def pop_n_todo(self, n): 
while n > <NUM_LIT:0>:<EOL><INDENT>seq = self._heap.pop()[<NUM_LIT:2>] <EOL>if isfinite(seq): <EOL><INDENT>n -= <NUM_LIT:1><EOL>yield seq<EOL><DEDENT><DEDENT>
A lazy iterator yielding the n highest priority sequences