Repository navigation
Expand file tree
/
Copy pathsymmetries.h
More file actions
239 lines (208 loc) · 6.07 KB
/
Copy pathsymmetries.h
File metadata and controls
239 lines (208 loc) · 6.07 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
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
// Copyright 2018 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#ifndef CC_SYMMETRIES_H_
#define CC_SYMMETRIES_H_
#include <algorithm>
#include <cstring>
#include "cc/logging.h"
namespace minigo {
namespace symmetry {
enum Symmetry {
// No transform.
kIdentity,
// 90 degree anticlockwise rotation.
kRot90,
// 180 degree rotation.
kRot180,
// 270 degree anticlockwise rotation.
kRot270,
// Transpose.
kFlip,
// Transpose then 90 degree anticlockwise rotation (vertical reflection).
kFlipRot90,
// Transpose then 180 degree rotation.
kFlipRot180,
// Transpose then 270 degree anticlockwise rotation (horizontal reflection).
kFlipRot270,
kNumSymmetries,
};
inline Symmetry Inverse(Symmetry sym) {
switch (sym) {
case kIdentity:
return kIdentity;
case kRot90:
return kRot270;
case kRot180:
return kRot180;
case kRot270:
return kRot90;
case kFlip:
return kFlip;
case kFlipRot90:
return kFlipRot90;
case kFlipRot180:
return kFlipRot180;
case kFlipRot270:
return kFlipRot270;
default:
MG_LOG(FATAL) << static_cast<int>(sym);
return kNumSymmetries;
}
}
template <int N, int num_channels, typename SrcIt, typename DstIt>
inline void Identity(SrcIt src, DstIt dst) {
MG_CHECK(dst != src);
std::copy_n(src, N * N * num_channels, dst);
}
template <int N, int num_channels, typename SrcIt, typename DstIt>
inline void Rot90(SrcIt src, DstIt dst) {
MG_CHECK(dst != src);
const int row_stride = num_channels * N;
for (int j = 0; j < N; ++j) {
auto s = src + (N - 1 - j) * num_channels;
for (int i = 0; i < N; ++i) {
dst = std::copy_n(s, num_channels, dst);
s += row_stride;
}
}
}
template <int N, int num_channels, typename SrcIt, typename DstIt>
inline void Rot180(SrcIt src, DstIt dst) {
MG_CHECK(dst != src);
const int row_stride = num_channels * N;
for (int j = 0; j < N; ++j) {
auto s = src + (N - 1 - j) * row_stride + (N - 1) * num_channels;
for (int i = 0; i < N; ++i) {
dst = std::copy_n(s, num_channels, dst);
s -= num_channels;
}
}
}
template <int N, int num_channels, typename SrcIt, typename DstIt>
inline void Rot270(SrcIt src, DstIt dst) {
MG_CHECK(dst != src);
const int row_stride = num_channels * N;
for (int j = 0; j < N; ++j) {
auto s = src + (N - 1) * row_stride + j * num_channels;
for (int i = 0; i < N; ++i) {
dst = std::copy_n(s, num_channels, dst);
s -= row_stride;
}
}
}
template <int N, int num_channels, typename SrcIt, typename DstIt>
inline void Flip(SrcIt src, DstIt dst) {
MG_CHECK(dst != src);
const int row_stride = num_channels * N;
for (int j = 0; j < N; ++j) {
auto s = src + j * num_channels;
for (int i = 0; i < N; ++i) {
dst = std::copy_n(s, num_channels, dst);
s += row_stride;
}
}
}
template <int N, int num_channels, typename SrcIt, typename DstIt>
inline void FlipRot90(SrcIt src, DstIt dst) {
MG_CHECK(dst != src);
const int row_stride = num_channels * N;
for (int j = 0; j < N; ++j) {
auto s = src + (N - 1 - j) * row_stride;
for (int i = 0; i < N; ++i) {
dst = std::copy_n(s, num_channels, dst);
s += num_channels;
}
}
}
template <int N, int num_channels, typename SrcIt, typename DstIt>
inline void FlipRot180(SrcIt src, DstIt dst) {
MG_CHECK(dst != src);
const int row_stride = num_channels * N;
for (int j = 0; j < N; ++j) {
auto s = src + (N - 1) * row_stride + (N - 1 - j) * num_channels;
for (int i = 0; i < N; ++i) {
dst = std::copy_n(s, num_channels, dst);
s -= row_stride;
}
}
}
template <int N, int num_channels, typename SrcIt, typename DstIt>
inline void FlipRot270(SrcIt src, DstIt dst) {
MG_CHECK(dst != src);
const int row_stride = num_channels * N;
for (int j = 0; j < N; ++j) {
auto s = src + j * row_stride + (N - 1) * num_channels;
for (int i = 0; i < N; ++i) {
dst = std::copy_n(s, num_channels, dst);
s -= num_channels;
}
}
}
template <int N, int num_channels, typename SrcIt, typename DstIt>
inline void ApplySymmetry(Symmetry sym, SrcIt src, DstIt dst) {
switch (sym) {
case kIdentity:
Identity<N, num_channels>(src, dst);
break;
case Symmetry::kRot90:
Rot90<N, num_channels>(src, dst);
break;
case Symmetry::kRot180:
Rot180<N, num_channels>(src, dst);
break;
case Symmetry::kRot270:
Rot270<N, num_channels>(src, dst);
break;
case Symmetry::kFlip:
Flip<N, num_channels>(src, dst);
break;
case Symmetry::kFlipRot90:
FlipRot90<N, num_channels>(src, dst);
break;
case Symmetry::kFlipRot180:
FlipRot180<N, num_channels>(src, dst);
break;
case Symmetry::kFlipRot270:
FlipRot270<N, num_channels>(src, dst);
break;
default:
MG_LOG(FATAL) << static_cast<int>(sym);
break;
}
}
template <int N, int num_channels, typename T>
class NchwOutputIterator {
public:
using difference_type = std::ptrdiff_t;
using value_type = T;
using reference = T&;
using pointer = T*;
using iterator_category = std::output_iterator_tag;
NchwOutputIterator(T* features) : ptr_(features), offset_(0) {}
NchwOutputIterator& operator++() {
offset_ += N * N;
if (offset_ >= N * N * num_channels) {
offset_ -= N * N * num_channels - 1;
}
return *this;
}
reference operator*() const { return ptr_[offset_]; }
bool operator!=(const T* ptr) { return ptr != ptr_ + offset_; }
private:
T* ptr_;
size_t offset_;
};
} // namespace symmetry
} // namespace minigo
#endif // CC_SYMMETRIES_H_