aboutsummaryrefslogtreecommitdiff
path: root/timer.py
diff options
context:
space:
mode:
authorFelix Domke <tmbinc@elitedvb.net>2005-11-25 23:34:50 +0000
committerFelix Domke <tmbinc@elitedvb.net>2005-11-25 23:34:50 +0000
commitaf86cdfc155f85ea6a4716b99840b697686159e6 (patch)
tree83ead2ed0c87afd0b2fa84c60befa1826cc66f18 /timer.py
parentaa81a977eb04ea3591a8ec830959e829c6bf66d1 (diff)
downloadenigma2-af86cdfc155f85ea6a4716b99840b697686159e6.tar.gz
enigma2-af86cdfc155f85ea6a4716b99840b697686159e6.zip
timer: fix remove of timer
Diffstat (limited to 'timer.py')
-rw-r--r--timer.py15
1 files changed, 7 insertions, 8 deletions
diff --git a/timer.py b/timer.py
index 42bafe35..bbad0be1 100644
--- a/timer.py
+++ b/timer.py
@@ -98,15 +98,15 @@ class Timer:
def addTimerEntry(self, entry, noRecalc=0):
entry.processRepeated()
- # we either go trough Prepare/Start/End-state if the timer is still running,
- # or skip it when it's alrady past the end.
-
- if entry.end > time.time():
+ # when the timer has not yet started, and is already passed,
+ # don't go trough waiting/running/end-states, but sort it
+ # right into the processedTimers.
+ if entry.end <= time.time() and entry.state == TimerEntry.StateWait:
+ bisect.insort(self.processed_timers, entry)
+ else:
bisect.insort(self.timer_list, entry)
if not noRecalc:
self.calcNextActivation()
- else:
- bisect.insort(self.processed_timers, entry)
def setNextActivation(self, when):
delay = int((when - time.time()) * 1000)
@@ -144,7 +144,7 @@ class Timer:
def doActivate(self, w):
w.activate(w.state)
self.timer_list.remove(w)
-
+
w.state += 1
if w.state < TimerEntry.StateEnded:
bisect.insort(self.timer_list, w)
@@ -156,7 +156,6 @@ class Timer:
else:
bisect.insort(self.processed_timers, w)
-
def processActivation(self):
t = int(time.time()) + 1