-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathutiils_span.py
More file actions
196 lines (159 loc) · 3.43 KB
/
utiils_span.py
File metadata and controls
196 lines (159 loc) · 3.43 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
188
189
190
191
192
193
194
195
196
"""
This file contains various methods that are useful when dealing with spans
found in classes CCNode and CCTree. A span is just a tuple of 2 integers
such as (a, b)= (3, 6). It represents the set of integers range(a, b).
"""
def is_sub_span(span0, span1):
"""
Parameters
----------
span0: tuple[int, int]
span1: tuple[int, int]
Returns
-------
bool
"""
a0, b0 = span0
a1, b1 = span1
# sub_span empty
if b0-a0 < 1:
return True
return a1 <= a0 and b1 >= b0
def span_len(span):
"""
Parameters
----------
span: tuple[int, int]
Returns
-------
int
"""
a, b = span
if b-a<=0:
return 0
else:
return b-a
def span_set(span):
"""
Parameters
----------
span: tuple[int, int]
Returns
-------
set[int]
"""
if not span_len(span):
return set()
else:
return set(range(*span))
def span_difference(span0, span1):
"""
Parameters
----------
span0: tuple[int, int]
span1: tuple[int, int]
Returns
-------
tuple[int, int]
"""
a0, b0 = span0
a1, b1 = span1
assert span_len(span0) > 0
if span_len(span1) == 0:
return span0
if b0 <= a1:
return span0
elif a0< a1 < b0:
return (a0, a1)
elif a0 == a1 and b1< b0:
return (b1, b0)
elif a0 < a1 and b1==b0:
return (a0, a1)
elif a0 < a1 and b1 < b0:
return (a0, a1), (b1, b0)
elif a1<= a0 and b0<= b1:
return None
elif a1<=a0 and b1< b0:
return (b1, b0)
elif b1 <= a0:
return None
else:
assert False
def in_span(i, span):
"""
Parameters
----------
i: int
span: tuple[int, int]
Returns
-------
bool
"""
a, b = span
if i>=a and i<b:
return True
else:
return False
def span_path_is_decreasing(span_path):
"""
Parameters
----------
span_path: list[tuple[int, int]]
Returns
-------
bool
"""
len_path = len(span_path)
for k in range(len_path - 1):
if not is_sub_span(span_path[k + 1], span_path[k]):
return False
return True
def are_disjoint(span0, span1):
"""
Parameters
----------
span0: tuple[int, int]
span1: tuple[int, int]
Returns
-------
bool
"""
a0, b0 = span0
a1, b1 = span1
return b0<=a1 or b1<=a0
def draw_inc_exc_spans(all_span, inc_span, exc_span):
"""
Parameters
----------
all_span: tuple[int, int]
inc_span: tuple[int, int]
exc_span: tuple[int, int]
Returns
-------
None
"""
# print("mmner", all_span, inc_span, exc_span)
assert is_sub_span(inc_span, all_span)
assert is_sub_span(exc_span, all_span)
assert are_disjoint(inc_span, exc_span)
li = ["_"]*span_len(all_span)
for i in range(len(li)):
if in_span(i, exc_span):
li[i] = "E"
elif in_span(i, inc_span):
li[i] = "I"
print("".join(li))
def draw_inc_exc_span_paths(all_span, inc_span_path, exc_span_path):
"""
Parameters
----------
all_span: tuple[int, int]
inc_span_path: list[tuple[int, int]]
exc_span_path: list[tuple[int, int]]
Returns
-------
None
"""
assert len(inc_span_path) == len(exc_span_path)
for i in range(len(inc_span_path)):
draw_inc_exc_spans(all_span, inc_span_path[i], exc_span_path[i])