MCPcopy Index your code
hub / github.com/MeigenChou/DCTimer-Android / init

Method init

app/src/main/java/solver/Cross.java:97–169  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

95 }
96
97 private static void init() {
98 if (ini)
99 return;
100 int a, b, c, d, e, f;
101 for (a = 0; a < 495; a++) {
102 for (b = 0; b < 24; b++) {
103 for (c = 0; c < 6; c++) {
104 d = getmv(a, b, c);
105 epm[24 * a + b][c] = (short) (d >> 4);
106 if (b < 16)
107 eom[16 * a + b][c] = (short) ((d / 384) << 4 | d & 15);
108 }
109 }
110 }
111 for (a = 0; a < 11880; a++)
112 epd[a] = -1;
113 epd[69 * 24] = 0;
114 Utils.createPrun(epd, 6, epm, 3);
115 for (a = 0; a < 7920; a++)
116 eod[a] = eofd[a] = -1;
117 eod[69 * 16] = 0;
118 Utils.createPrun(eod, 7, eom, 3);
119 for (a = 0; a < 495; a++)
120 eofd[a << 4] = 0;
121 Utils.createPrun(eofd, 4, eom, 3);
122
123 //xcross
124 byte[][] p = {
125 {1, 0, 3, 0, 0, 4}, {2, 1, 1, 5, 1, 0}, {3, 2, 2, 1, 6, 2}, {0, 3, 7, 3, 2, 3},
126 {4, 7, 0, 4, 4, 5}, {5, 4, 5, 6, 5, 1}, {6, 5, 6, 2, 7, 6}, {7, 6, 4, 7, 3, 7}
127 };
128 byte[][] o = {
129 {0, 0, 1, 0, 0, 2}, {0, 0, 0, 2, 0, 1}, {0, 0, 0, 1, 2, 0}, {0, 0, 2, 0, 1, 0},
130 {0, 0, 2, 0, 0, 1}, {0, 0, 0, 1, 0, 2}, {0, 0, 0, 2, 1, 0}, {0, 0, 1, 0, 2, 0}
131 };
132 for (a = 0; a < 8; a++)
133 for (b = 0; b < 3; b++)
134 for (c = 0; c < 6; c++)
135 fcm[a * 3 + b][c] = (byte) (p[a][c] * 3 + (o[a][c] + b) % 3);
136 p = new byte[][] {
137 {0, 0, 7, 0, 0, 8}, {1, 1, 1, 9, 1, 4}, {2, 2, 2, 5, 10, 2}, {3, 3, 11, 3, 6, 3},
138 {5, 4, 4, 4, 4, 0}, {6, 5, 5, 1, 5, 5}, {7, 6, 6, 6, 2, 6}, {4, 7, 3, 7, 7, 7},
139 {8, 11, 8, 8, 8, 1}, {9, 8, 9, 2, 9, 9}, {10, 9, 10, 10, 3, 10}, {11, 10, 0, 11, 11, 11}
140 };
141 o = new byte[][] {
142 {0, 0, 0, 0, 0, 1}, {0, 0, 0, 0, 0, 1}, {0, 0, 0, 0, 1, 0}, {0, 0, 0, 0, 1, 0},
143 {0, 0, 0, 0, 0, 1}, {0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 1, 0}, {0, 0, 0, 0, 0, 0},
144 {0, 0, 0, 0, 0, 1}, {0, 0, 0, 0, 0, 0}, {0, 0, 0, 0, 1, 0}, {0, 0, 0, 0, 0, 0}
145 };
146 for (a = 0; a < 12; a++)
147 for (b = 0; b < 2; b++)
148 for (c = 0; c < 6; c++)
149 fem[a * 2 + b][c] = (byte) (p[a][c] * 2 + (o[a][c] ^ b));
150 for (f = 0; f < 4; f++) {
151 for (a = 0; a < 576; a++) fecd[f][a] = -1;
152 fecd[f][f * 51 + 12] = 0;
153 for (d = 0; d < 6; d++) {
154 int cc = 0;

Callers 6

solveCrossMethod · 0.95
solveCrossfMethod · 0.95
solveXcrossMethod · 0.95
solveXcrossfMethod · 0.95
solveEofcMethod · 0.95
easyCrossMethod · 0.95

Calls 2

getmvMethod · 0.95
createPrunMethod · 0.95

Tested by

no test coverage detected