-
Notifications
You must be signed in to change notification settings - Fork 0
/
tree.py
executable file
·97 lines (85 loc) · 4.13 KB
/
tree.py
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
#!/usr/bin/env python
import get_attribute
from maintain_attributes import append_attributes
class task_node:
###########################################################################
# description: recursively init the whold subtree
# parameter: uuid root of the tree (can be a subtree root)
###########################################################################
def __init__(self,uuid):
self.uuid = uuid
self.child = []
self.parent = None
self.depth = 0
# read in the subtree
child_string = get_attribute.get_one_attribute("child",f"uuid:{self.uuid}")
if len(child_string):
child_uuid_list = child_string[0].strip().split(',')
print(self.uuid,child_uuid_list,child_string)
for child_uuid in child_uuid_list:
child_node = task_node(child_uuid)
self.add_child(child_node)
def add_depth_recursive(self):
for child_node in self.child:
child_node.depth += 1
child_node.add_depth_recursive()
###########################################################################
# description: only add existing subtask to this data structure
# parameter:
###########################################################################
def add_child(self,child_node):
self.child.append(child_node)
child_node.parent = self
child_node.depth = self.depth + 1
child_node.add_depth_recursive()
###########################################################################
# description: read from task warrior to construct a tree of task node
# parameter:
###########################################################################
# def read_in_task_tree(self):
# child_string_list = get_attribute.get_one_attribute("child",f"uuid={self.uuid}")
# if child_string_list:
# child_string = child_string_list[0]
# child_uuid_list = child_string.strip().split(",")
# for child_uuid in child_uuid_list:
# child_node = task_node(child_uuid)
# self.add_child(child_node)
# child_node.read_in_task_tree()
###########################################################################
# description: maintain task "child "and "parents" attributes and this data structure.
# parameter:
###########################################################################
def maitain_tree_when_add_sub_task(self,child_node):
append_attributes(self.uuid,"child",child_node.uuid)
append_attributes(child_node.uuid,"parents",self.uuid)
self.add_child(child_node)
def get_pending_leaf_tasks(self):
pending_leaves = []
for child in self.child:
if get_attribute.is_pending(child.uuid):
child_pending_leaves = child.get_pending_leaf_tasks()
if not bool(len(child_pending_leaves)):
pending_leaves.append(child)
else:
pending_leaves += child_pending_leaves
return pending_leaves
def print_node_attribute_in_tree(self,attributes=[]):
for attribute in attributes:
attribute_value = get_attribute.get_one_attribute(f"{attribute}",f"uuid:{self.uuid}")
print(" "*self.depth,f' |{attribute}:{attribute_value}')
def print_task_tree(self,attributes=[]):
child_nodes = self.child
if child_nodes:
print(" "*self.depth,'+',self.uuid)
self.print_node_attribute_in_tree(attributes)
for child_node in child_nodes:
child_node.print_task_tree(attributes)
else:
print(" "*self.depth,'- ',self.uuid)
self.print_node_attribute_in_tree(attributes)
# root_task = task_node(get_attribute.get_one_attribute("uuid","id:1")[0])
# root_task.print_task_tree(["description","status","child","parents"])
# pending_uuid = root_task.get_pending_leaf_tasks()[0].uuid
# pending_task_node = task_node(pending_uuid)
# pending_task_node.print_task_tree()
# print(pending_task_node.get_pending_leaf_tasks())