Miko/baritone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

more testing

Browse Source
This commit is contained in:
Leijurv
2023-04-05 23:32:40 -07:00
parent 294e847f19
commit 361c769650
11 changed files with 201 additions and 79 deletions
Download Patch File Download Diff File Expand all files Collapse all files

97
src/test/java/baritone/builder/DependencyGraphScaffoldingOverlayTest.java Normal file
View File

@@ -0,0 +1,97 @@
/*
* This file is part of Baritone.
*
* Baritone is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser 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 Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with Baritone. If not, see <https://www.gnu.org/licenses/>.
*/
package baritone.builder;
import baritone.api.utils.BetterBlockPos;
import org.junit.Test;
import java.util.Random;
import static org.junit.Assert.assertEquals;
public class DependencyGraphScaffoldingOverlayTest {
@Test
public void testLarge() throws InterruptedException {
Random RAND = new Random(5021);
for (int i = 0; i < 1; i++) {
long aaa = System.currentTimeMillis();
//int[][][] test = new int[64][64][64];
BlockStateCachedData[][][] test = new BlockStateCachedData[64][64][64];
int numRealBlocks = 0;
for (int x = 0; x < test.length; x++) {
for (int y = 0; y < test[0].length; y++) {
for (int z = 0; z < test[0][0].length; z++) {
//if ((x + y + z) % 2 == 0) {
if (RAND.nextInt(10) < 2) {
test[x][y][z] = FakeStates.probablyCanBePlaced(RAND);
numRealBlocks++;
} else {
test[x][y][z] = FakeStates.AIR;
}
}
}
}
/*for (int[][] arr : test) {
for (int[] arr2 : arr) {
Arrays.fill(arr2, based);
}
}*/
PackedBlockStateCuboid states = new PackedBlockStateCuboid(test);
PlaceOrderDependencyGraph graph = new PlaceOrderDependencyGraph(states);
long aa = System.currentTimeMillis();
/*DependencyGraphAnalyzer.prevalidate(graph);
for (int i = 0; i < 1; i++) {
long a = System.currentTimeMillis();
DependencyGraphAnalyzer.prevalidateExternalToInteriorSearch(graph);
long b = System.currentTimeMillis();
System.out.println((b - a) + "ms");
Thread.sleep(500);
System.gc();
Thread.sleep(500);
}*/
DependencyGraphScaffoldingOverlay scaffolding = new DependencyGraphScaffoldingOverlay(graph);
long a = System.currentTimeMillis();
System.out.println(scaffolding.getCollapsedGraph().getComponents().size());
int goal = numRealBlocks + 200000;
while (numRealBlocks < goal) {
//System.out.println(numRealBlocks + " " + scaffolding.getCollapsedGraph().getComponents().size());
int x = RAND.nextInt(((CuboidBounds) scaffolding.bounds()).sizeX);
int y = RAND.nextInt(((CuboidBounds) scaffolding.bounds()).sizeY);
int z = RAND.nextInt(((CuboidBounds) scaffolding.bounds()).sizeZ);
long pos = BetterBlockPos.toLong(x, y, z);
if (scaffolding.air(pos)) {
//System.out.println("Setting to scaffolding " + BetterBlockPos.fromLong(pos) + " " + pos);
scaffolding.enable(pos);
numRealBlocks++;
if (numRealBlocks % 10000 == 0) {
System.out.println(numRealBlocks + " " + scaffolding.getCollapsedGraph().getComponents().size());
scaffolding.recheckEntireCollapsedGraph();
}
}
}
System.out.println(scaffolding.getCollapsedGraph().getComponents().size());
System.out.println("Done " + (System.currentTimeMillis() - a) + "ms after " + (a - aa) + "ms after " + (aa - aaa) + "ms");
assertEquals(238, scaffolding.getCollapsedGraph().getComponents().size());
/*Thread.sleep(500);
System.gc();
Thread.sleep(500);*/
//scaffolding.enable(0);
}
}
}

16
src/test/java/baritone/builder/FaceTest.java
View File

@@ -17,6 +17,7 @@
package baritone.builder;
import baritone.api.utils.BetterBlockPos;
import org.junit.Test;
import static org.junit.Assert.assertEquals;
@@ -29,4 +30,19 @@ public class FaceTest {
assertEquals(i, (int) Face.OPTS.get(i).map(face -> face.index).orElse(Face.NUM_FACES));
}
}
@Test
public void ensureValid() {
for (Face face : Face.VALUES) {
assertEquals(face.x, face.toMC().getXOffset());
assertEquals(face.y, face.toMC().getYOffset());
assertEquals(face.z, face.toMC().getZOffset());
}
assertEquals(Face.UP.offset, BetterBlockPos.toLong(0, 1, 0));
assertEquals(Face.DOWN.offset, BetterBlockPos.toLong(0, -1, 0));
assertEquals(Face.NORTH.offset, BetterBlockPos.toLong(0, 0, -1));
assertEquals(Face.SOUTH.offset, BetterBlockPos.toLong(0, 0, 1));
assertEquals(Face.EAST.offset, BetterBlockPos.toLong(1, 0, 0));
assertEquals(Face.WEST.offset, BetterBlockPos.toLong(-1, 0, 0));
}
}

23
src/test/java/baritone/builder/TarjansAlgorithmTest.java
View File

@@ -19,9 +19,32 @@ package baritone.builder;
import org.junit.Test;
import java.util.Random;
public class TarjansAlgorithmTest {
@Test
public void test() {
// the correctness test is already in there just gotta ask for it
Random RAND = new Random(5021);
for (int i = 0; i < 100; i++) {
BlockStateCachedData[][][] test = new BlockStateCachedData[20][20][20];
for (int x = 0; x < test.length; x++) {
for (int y = 0; y < test[0].length; y++) {
for (int z = 0; z < test[0][0].length; z++) {
if (RAND.nextInt(10) < 3) {
test[x][y][z] = FakeStates.probablyCanBePlaced(RAND);
} else {
test[x][y][z] = FakeStates.AIR;
}
}
}
}
PackedBlockStateCuboid states = new PackedBlockStateCuboid(test);
PlaceOrderDependencyGraph graph = new PlaceOrderDependencyGraph(states);
DependencyGraphScaffoldingOverlay overlay = new DependencyGraphScaffoldingOverlay(graph); // this runs tarjan's twice, but the alternative ruins the abstraction layers too much :)
TarjansAlgorithm.TarjansResult result = TarjansAlgorithm.run(overlay);
TarjansAlgorithm.sanityCheckResult(overlay, result);
}
}
}