forked from wongzbb/DiffMa-Diffusion-Mamba
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtools.py
152 lines (133 loc) · 4.43 KB
/
tools.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
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
def spiral(n):
matrix_list = []
directions_list=[[(0, 1), (1, 0), (0, -1), (-1, 0)],
[(1, 0), (0, -1), (-1, 0), (0, 1)],
[(0, -1), (-1, 0), (0, 1), (1, 0)],
[(-1, 0), (0, 1), (1, 0), (0, -1)],
[(0, 1), (-1, 0), (0, -1), (1, 0)],
[(0, -1), (1, 0), (0, 1), (-1, 0)],
[(1, 0), (0, 1), (-1, 0), (0, -1)],
[(-1, 0), (0, -1), (1, 0), (0, 1)]]
for i in range(len(directions_list)):
matrix = [[0] * n for _ in range(n)]
x, y = n // 2, n // 2
directions = directions_list[i]
current_direction = 0
steps = 1
value = 1
while value <= n*n:
for _ in range(2):
for _ in range(steps):
if 0 <= x < n and 0 <= y < n:
matrix[x][y] = value
value += 1
x += directions[current_direction][0]
y += directions[current_direction][1]
current_direction = (current_direction + 1) % 4
steps += 1
rearrange_list = []
re_rearrange_list = []
for row in matrix:
for num in row:
rearrange_list.append(num-1)
re_rearrange_list.append(n**2 - num)
matrix_list.append(rearrange_list)
matrix_list.append(re_rearrange_list)
original_order_indexes_list = []
for k in range(len(matrix_list)):
index_mapping = {index: i for i, index in enumerate(matrix_list[k])}
original_order_indexes = [index_mapping[i] for i in range(len(matrix_list[k]))]
original_order_indexes_list.append(original_order_indexes)
return matrix_list, original_order_indexes_list
def zig1(n):
matrix = [[0] * n for _ in range(n)]
num = 1
for i in range(n):
if i % 2 == 0:
for j in range(n):
matrix[i][j] = num
num += 1
else:
for j in range(n-1, -1, -1):
matrix[i][j] = num
num += 1
return matrix
def zig2(n):
matrix = [[0] * n for _ in range(n)]
num = 1
for j in range(n):
if j % 2 == 0:
for i in range(n):
matrix[i][j] = num
num += 1
else:
for i in range(n-1, -1, -1):
matrix[i][j] = num
num += 1
return matrix
def zig3(n):
matrix = zig1(n)
matrix = [row[::-1] for row in matrix]
return matrix
def zig4(n):
matrix = zig2(n)
matrix = [col[::-1] for col in matrix]
return matrix
def zig5(n):
matrix = zig1(n)
matrix = matrix[::-1]
return matrix
def zig6(n):
matrix = zig2(n)
matrix = matrix[::-1]
return matrix
def zig7(n):
matrix = zig5(n)
matrix = [col[::-1] for col in matrix]
return matrix
def zig8(n):
matrix = zig6(n)
matrix = [col[::-1] for col in matrix]
return matrix
def zig(n: int, i: int):
rearrange_list = []
if i%8==1:
matrix = zig1(n)
elif i%8==2:
matrix = zig2(n)
elif i%8==3:
matrix = zig3(n)
elif i%8==4:
matrix = zig4(n)
elif i%8==5:
matrix = zig5(n)
elif i%8==6:
matrix = zig6(n)
elif i%8==7:
matrix = zig7(n)
elif i%8==0:
matrix = zig8(n)
for row in matrix:
for num in row:
rearrange_list.append(num-1)
index_mapping = {index: i for i, index in enumerate(rearrange_list)}
original_order_indexes = [index_mapping[i] for i in range(len(rearrange_list))]
return rearrange_list, original_order_indexes
def vmamba_(n: int):
m_list = []
m_list.append(zig1(n))
m_list.append(zig2(n))
m_list.append(zig7(n))
m_list.append(zig8(n))
order_list = []
original_list = []
for m in m_list:
rearrange_list = []
for row in m:
for num in row:
rearrange_list.append(num-1)
order_list.append(rearrange_list)
index_mapping = {index: i for i, index in enumerate(rearrange_list)}
original_order_indexes = [index_mapping[i] for i in range(len(rearrange_list))]
original_list.append(original_order_indexes)
return order_list, original_list