spacepaste

Paste details

reply | raw

  1.  
  2. def tick(self, event_t=event_t, min=min, heappop=heapq.heappop,
  3. heappush=heapq.heappush):
  4. """Run a tick - one iteration of the scheduler.
  6. Executes one due task per call.
  8. Returns:
  9. float: preferred delay in seconds for next call.
  10. """
  11. adjust = self.adjust
  12. max_interval = self.max_interval
  14. if (self._heap is None or
  15. not self.schedules_equal(self.old_schedulers, self.schedule)):
  16. self.old_schedulers = copy.copy(self.schedule)
  17. self.populate_heap()
  19. H = self._heap
  21. if not H:
  22. return max_interval
  24. event = H[0]
  25. entry = event[2]
  26. is_due, next_time_to_run = self.is_due(entry)
  27. print ('is_due:%s, nex_time_to_run:%s' % (is_due, next_time_to_run))
  28. if is_due:
  29. verify = heappop(H)
  30. print 'verify'
  31. print verify
  32. print event
  33. if verify is event:
  34. next_entry = self.reserve(entry)
  35. print 'next_entry %s' % next_entry
  36. self.apply_entry(entry, producer=self.producer)
  37. print 'heappush? %s' % heappush(H, event_t(self._when(next_entry, next_time_to_run),
  38. event[1], next_entry))
  39. print 'return 0'
  40. return 1
  41. else:
  42. heappush(H, verify)
  43. print 'verify[0]%s' % verify[0]
  44. return min(verify[0], max_interval)
  45. print adjust(next_time_to_run)
  46. print max_interval
  47. return min(adjust(next_time_to_run) or max_interval, max_interval)
  48.  
Powered by spacepaste. Paste removal.