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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
|
# Copyright (C) 2018 Lars Wirzenius
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU Affero 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 Affero General Public License for more details.
#
# You should have received a copy of the GNU Affero General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
import copy
ACTION_BLOCKED = 'blocked'
ACTION_READY = 'ready'
ACTION_BUILDING = 'building'
ACTION_DONE = 'done'
ACTION_FAILED = 'failed'
action_states = [
ACTION_BLOCKED,
ACTION_READY,
ACTION_BUILDING,
ACTION_DONE,
ACTION_FAILED,
]
class BuildGraph:
def __init__(self, graph=None):
self.observer = None
self.actions = graph or {}
self.idgen = IdGenerator(self.actions.keys())
def set_observer(self, observer):
self.observer = observer
def get_actions(self):
return copy.deepcopy(self.actions)
def get_action(self, action_id):
return self.actions[action_id]['action']
def get_action_status(self, action_id):
return self.actions[action_id]['status']
def set_action_status(self, action_id, status):
assert status in action_states
self.actions[action_id]['status'] = status
self.trigger_observer()
def has_more_to_do(self):
return (
self.find_actions(ACTION_READY) or
self.find_actions(ACTION_BUILDING)
)
def unblock(self):
blocked_ids = self.find_actions(ACTION_BLOCKED)
for blocked_id in blocked_ids:
blocked = self.actions[blocked_id]
if self.is_unblockable(blocked):
self.set_action_status(blocked_id, ACTION_READY)
def is_unblockable(self, action):
return action['status'] == ACTION_BLOCKED and all(
self.get_action_status(dep) == ACTION_DONE
for dep in action['depends']
)
def trigger_observer(self):
if self.observer is not None:
self.observer()
def append_action(self, action, status=None, depends=None):
prev_id, action_id = self.idgen.next_id()
graph_node = {
'action': copy.deepcopy(action),
}
if not self.actions:
graph_node['status'] = ACTION_READY if status is None else status
graph_node['depends'] = [] if depends is None else depends
else:
graph_node['status'] = ACTION_BLOCKED if status is None else status
graph_node['depends'] = [prev_id] if depends is None else depends
self.actions[action_id] = graph_node
self.trigger_observer()
return action_id
def append_pipeline(self, pipeline):
for action in pipeline.get('actions', []):
self.append_action(action)
def find_actions(self, status):
return [
action_id
for action_id, action in self.actions.items()
if action['status'] == status
]
class IdGenerator:
def __init__(self, action_ids):
self.current = 0
if action_ids:
action_ids = [int(an_id) for an_id in action_ids]
action_ids.sort()
self.current = action_ids[-1]
def next_id(self):
prev = self.current
self.current += 1
return str(prev), str(self.current)
|
