# Copyright (C) 2013 INRIA
#
# This program is free software: you can redistribute it and/or modify
-# it under the terms of the GNU General Public License as published by
-# the Free Software Foundation, either version 3 of the License, or
-# (at your option) any later version.
+# it under the terms of the GNU General Public License version 2 as
+# published by the Free Software Foundation;
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
#
# Author: Alina Quereilhac <alina.quereilhac@inria.fr>
+from six import next
+
import itertools
import heapq
:type task: task
"""
if task.id == None:
- task.id = self._idgen.next()
+ task.id = next(self._idgen)
entry = (task.timestamp, task.id, task)
self._valid.add(task.id)
except:
pass
+ # py3 compat
+ def __next__(self):
+ return self.next()
+
def next(self):
""" Get the next task in the queue by timestamp and arrival order
"""