1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
# -*- mode: python; coding: utf-8; -*-
# ---------------------------------------------------------------------------##
# Copyright 2016, LB
# 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.
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
from kivy._event import EventDispatcher
from kivy.clock import Clock
from kivy.properties import BooleanProperty, ListProperty
class LTask(EventDispatcher):
done = BooleanProperty(True)
def __init__(self, name):
super(LTask, self).__init__()
self.name = name
self.delay = 0.01
def start(self):
# print('start of ',self.name)
self.done = False
def stop(self, *args):
# print('stop of ',self.name)
self.done = True
class LTaskQ(EventDispatcher):
waitQ = ListProperty([])
runQ = ListProperty([])
def __init__(self, **kwargs):
super(LTaskQ, self).__init__(**kwargs)
self.waitQ = []
self.waitQlen = 0
self.runQ = []
self.runQlen = 0
self.runQmax = 52
self.runSeq = 1.0/10.0 # default delay.
def scheduleNext(self, dt):
if (self.waitQlen > 0):
# run as long as there is enough place in the runQ
# do not run more than one job with the same name
# at the same time.
delayed = False
if (self.runQlen < self.runQmax):
names = [ t.name for t in self.runQ ] # noqa
if self.waitQ[0].name not in names:
self.runQ.append(self.waitQ[0])
del self.waitQ[0]
else:
delayed = True
delay = self.runSeq
if self.waitQlen > 0 and not delayed:
delay = self.waitQ[0].delay
if (self.waitQlen > 0 or self.runQlen > 0):
Clock.schedule_once(self.scheduleNext, delay)
def on_runQ(self, instance, value):
lastlen = self.runQlen
self.runQlen = len(self.runQ)
if (self.runQlen > lastlen):
self.runQ[-1].bind(done=self.taskStopped)
self.runQ[-1].start()
def on_waitQ(self, instance, value):
self.waitQlen = len(self.waitQ)
if (self.waitQlen > 0 and self.runQlen == 0):
self.scheduleNext(0)
def taskQsAreEmpty(self):
return (self.waitQlen == 0 and self.runQlen == 0)
def taskInsert(self, task):
# print('taskInsert called', task)
self.waitQ.append(task)
def taskStopped(self, instance, value):
if (value is True):
idx = 0
while (idx < self.runQlen):
if (self.runQ[idx] is instance):
break
idx += 1
if (idx < self.runQlen):
# print('taskStopped', instance, 'index', idx)
del self.runQ[idx]
else:
# print('taskStopped: index out of range!')
pass
|
