forked from Ekopalypse/NppPythonScripts
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTreeNodeCalculator.py
More file actions
187 lines (167 loc) · 6.29 KB
/
TreeNodeCalculator.py
File metadata and controls
187 lines (167 loc) · 6.29 KB
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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
# -*- coding: utf-8 -*-
'''
TreeNodeCalculator scans a tree-like text and sums up the items.
The folder-like lines are not counted.
Number of items is added on position 80 on each folder-like line.
It is assumed that the data is
a) using either space or tabs doing the intend but NOT mixed ones
b) one root node in a document
c) items are only in the last level and NOT in between.
[Changes since initial version]
v0.2 - count each occurance if additional filters per line.
v0.3 - introduced two different kind of filters
combined_filters = sum of all defined characters per line
unique_filters = list of the sum of each configured character per line
'''
from Npp import editor, notepad, MESSAGEBOXFLAGS
# example test data
# work
# names 1
# × antonio
# bernard #
# joseph
# alex
# # francisco
# suzana
# × victor
# amanda #
# # victoria
# xxxxx
# yy # yyy
# aaaa
# names 2
# aaaaa
# qqqqq #
# × wwwww
# a111111
# b222222
# c3333 # 33
# # wwwww
# wwwww
# 1111111€ - # 12121212 - # 5555555€ - # 323232323 - # 444€ - #11 - # 88888€
# names 3
# aaaaa
# qqqqq
# would be modified to
# work (23, 17)
# names 1 (12, 7)
# × antonio
# bernard #
# joseph
# alex
# # francisco
# suzana
# × victor
# amanda #
# # victoria
# xxxxx
# yy # yyy
# aaaa
# names 2 (9, 10)
# aaaaa
# qqqqq #
# × wwwww
# a111111
# b222222
# c3333 # 33
# # wwwww
# wwwww
# # 1111111 # 12121212 # 5555555 # 323232323 # 444 # 11
# names 3 (2, 0)
# aaaaa
# qqqqq
class Node:
'''
helper class which counts the items and updates the parents recursively.
'''
def __init__(self, line, parent=None):
'''
store on which line the parent is and initialze the object itself
'''
self.line = line
self.parent = parent
self.items = 0
self.combined_filters = 0
self.unique_filters = []
def add(self, combined_filters, unique_filters=None):
'''
add the current found item and call its parents recursively
'''
if self.parent:
self.parent.add(combined_filters, unique_filters)
self.items += 1
if combined_filters:
self.combined_filters += combined_filters
if unique_filters:
if not self.unique_filters:
self.unique_filters = unique_filters
else:
self.unique_filters = [sum(i) for i in zip(self.unique_filters, unique_filters)]
def result(self):
'''
return the calculated items for each parent together with the parent line
'''
if self.parent:
self.parent.result()
return self.line, self.items, self.combined_filters, self.unique_filters
# Calculate the level
def get_level(line): return len(line) - len(line.lstrip())
lines = editor.getText().splitlines()
max_lines = len(lines)-1
current_line = 0
level_stack = []
save_popped_levels = []
combined_filters = ['#', '×']
unique_filters = ['€', '$']
# loop through all lines and build the needed Node objects
while current_line < max_lines:
if lines[current_line].strip() != '':
current_level = get_level(lines[current_line])
if current_level >= get_level(lines[current_line+1]):
found_additional_filters = [lines[current_line].count(x) for x in combined_filters]
found_unique_filters = [lines[current_line].count(u) for u in unique_filters]
level_stack[-1][0].add(sum(found_additional_filters), found_unique_filters)
else:
if current_level == 0:
level_stack = []
p = Node(current_line, None)
else:
while True:
if level_stack[-1][1] >= current_level:
save_popped_levels.append(level_stack.pop())
else:
break
p = Node(current_line, level_stack[-1][0])
level_stack.append((p, current_level))
current_line +=1
# last line
prev_level = current_level
if lines[current_line].strip() != '':
if prev_level == get_level(lines[current_line]):
found_additional_filters = [lines[current_line].count(x) for x in combined_filters]
found_unique_filters = [lines[current_line].count(u) for u in unique_filters]
level_stack[-1][0].add(sum(found_additional_filters), found_unique_filters)
# create a list of all Node objects
results = [x[0].result() for x in level_stack]
results.extend([x[0].result() for x in save_popped_levels])
# reformat the resulting content
if notepad.messageBox('Should additional filtering be applied?',
'',
MESSAGEBOXFLAGS.YESNO) == MESSAGEBOXFLAGS.RESULTYES:
for line, _sum, _additional_filters, _unique_filters in sorted(results):
__unique_filters = ', '.join([str(x) for x in _unique_filters])
__unique_filters = ', ' + __unique_filters if __unique_filters else ''
lines[line] = '{0:<{1}}({2}{3}{4}{5})'.format(lines[line][:80],
80,
_sum,
', ',
_additional_filters,
__unique_filters
)
else:
for line, _sum, _ in sorted(results):
lines[line] = '{0:<{1}}({2})'.format(lines[line][:80],
80,
_sum)
# set the new content
editor.setText('\r\n'.join(lines))