special block location caching and automatic mining
This commit is contained in:
50
src/test/java/baritone/chunk/CachedRegionTest.java
Normal file
50
src/test/java/baritone/chunk/CachedRegionTest.java
Normal file
@@ -0,0 +1,50 @@
|
||||
/*
|
||||
* This file is part of Baritone.
|
||||
*
|
||||
* Baritone is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* Baritone is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with Baritone. If not, see <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
package baritone.chunk;
|
||||
|
||||
import org.junit.Test;
|
||||
|
||||
import static junit.framework.TestCase.assertEquals;
|
||||
|
||||
public class CachedRegionTest {
|
||||
|
||||
@Test
|
||||
public void blockPosSaving() {
|
||||
for (int x = 0; x < 16; x++) {
|
||||
for (int z = 0; z < 16; z++) {
|
||||
for (int y = 0; y < 256; y++) {
|
||||
byte part1 = (byte) (z << 4 | x);
|
||||
byte part2 = (byte) (y);
|
||||
byte xz = part1;
|
||||
int X = xz & 0x0f;
|
||||
int Z = (xz >>> 4) & 0x0f;
|
||||
int Y = (int) part2;
|
||||
if (Y < 0) {
|
||||
Y += 256;
|
||||
}
|
||||
if (x != X || y != Y || z != Z) {
|
||||
System.out.println(x + " " + X + " " + y + " " + Y + " " + z + " " + Z);
|
||||
}
|
||||
assertEquals(x, X);
|
||||
assertEquals(y, Y);
|
||||
assertEquals(z, Z);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user