(int i, int j)
| 317 | // } |
| 318 | |
| 319 | private void fillprun(int i, int j) { |
| 320 | if (USE_FULL_PRUN) { |
| 321 | prun[i][j] = CoordCube.getUDSliceFlipTwistPrun(twist[i][j] >> 3, twist[i][j] & 7, flip[i][j] >> 3, flip[i][j] & 7, slice[i][j] & 0x1ff); |
| 322 | } else { |
| 323 | prun[i][j] = Math.max( |
| 324 | Math.max( |
| 325 | CoordCube.getPruning(CoordCube.UDSliceTwistPrun, |
| 326 | (twist[i][j] >> 3) * 495 + CoordCube.UDSliceConj[slice[i][j] & 0x1ff][twist[i][j] & 7]), |
| 327 | CoordCube.getPruning(CoordCube.UDSliceFlipPrun, |
| 328 | (flip[i][j] >> 3) * 495 + CoordCube.UDSliceConj[slice[i][j] & 0x1ff][flip[i][j] & 7])), |
| 329 | USE_TWIST_FLIP_PRUN ? CoordCube.getPruning(CoordCube.TwistFlipPrun, |
| 330 | (twist[i][j] >> 3) << 11 | CubieCube.FlipS2RF[flip[i][j] & 0xfff8 | CubieCube.Sym8MultInv[flip[i][j] & 7][twist[i][j] & 7]]) : 0); |
| 331 | } |
| 332 | } |
| 333 | |
| 334 | private String search() { |
| 335 | for (length1 = isRecovery ? length1 : 0; length1 < sol; length1++) { |
no test coverage detected