-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRotation.java
More file actions
119 lines (103 loc) · 3.03 KB
/
Rotation.java
File metadata and controls
119 lines (103 loc) · 3.03 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
package com.aivean.raycasting2d;
/**
* Utility class that rotates matrices
*/
public enum Rotation {
NO {
@Override
public void rotateInt(int[][] dst, int[][] a) {
int size = a.length;
for (int i = 0; i < size; i++) {
System.arraycopy(a[i], 0, dst[i], 0, size);
}
}
@Override
public void rotateAndAddFloat(float[][] dst, float[][] src) {
int size = dst.length;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
dst[i][j] += src[i][j];
}
}
}
@Override
public Rotation opposite() {
return NO;
}
},
CCW {
@Override
public void rotateInt(int[][] dst, int[][] a) {
int size = a.length;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
dst[size - j - 1][i] = a[i][j];
}
}
}
@Override
public void rotateAndAddFloat(float[][] dst, float[][] src) {
int size = dst.length;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
dst[i][j] += src[j][size - i - 1];
}
}
}
@Override
public Rotation opposite() {
return CW;
}
},
CW {
@Override
public void rotateInt(int[][] dst, int[][] a) {
int size = a.length;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
dst[j][size - i - 1] = a[i][j];
}
}
}
@Override
public void rotateAndAddFloat(float[][] dst, float[][] src) {
int size = dst.length;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
dst[i][j] += src[size - j - 1][i];
}
}
}
@Override
public Rotation opposite() {
return CCW;
}
},
PI {
@Override
public void rotateInt(int[][] dst, int[][] a) {
int size = a.length;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
dst[size - i - 1][size - j - 1] = a[i][j];
}
}
}
@Override
public void rotateAndAddFloat(float[][] dst, float[][] src) {
int size = dst.length;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
dst[i][j] += src[size - i - 1][size - j - 1];
}
}
}
@Override
public Rotation opposite() {
return PI;
}
};
public abstract void rotateInt(int[][] dst, int[][] a);
public abstract void rotateAndAddFloat(float[][] dst, float[][] src);
public abstract Rotation opposite();
}