Upstream/WorldGuard
1
0
Fork 0
mirror of https://github.com/EngineHub/WorldGuard.git synced 2024-12-24 18:19:03 +01:00
Code Issues Projects Releases Wiki Activity

Added Cuboid -> Polygonal intersect tests

Browse Source
This commit is contained in:
Eric Puidokas 2011-10-18 09:57:30 -07:00 committed by TomyLobo
parent 7c1f878610
commit 4bb967ab4a
1 changed files with 45 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

54
src/test/java/com/sk89q/worldguard/protection/RegionIntersectTest.java
View File

@ -1,8 +1,11 @@
package com.sk89q.worldguard.protection;
import com.sk89q.worldedit.BlockVector;
import com.sk89q.worldedit.BlockVector2D;
import com.sk89q.worldguard.protection.regions.ProtectedCuboidRegion;
import com.sk89q.worldguard.protection.regions.ProtectedPolygonalRegion;
import com.sk89q.worldguard.protection.regions.ProtectedRegion;
import org.junit.Ignore;
import org.junit.Test;
import static org.junit.Assert.*;
@ -12,37 +15,70 @@
public class RegionIntersectTest {
@Test
@Ignore
public void testCuboidGetIntersectingRegions() {
ProtectedRegion region = new ProtectedCuboidRegion("square",
new BlockVector(100, 40, 0), new BlockVector(140, 128, 40));
assertIntersection(region, new ProtectedCuboidRegion("normal",
new BlockVector(80, 40, -20), new BlockVector(120, 128, 20)));
new BlockVector(80, 40, -20), new BlockVector(120, 128, 20)),
true);
assertIntersection(region, new ProtectedCuboidRegion("small",
new BlockVector(98, 45, 20), new BlockVector(103, 50, 25)));
new BlockVector(98, 45, 20), new BlockVector(103, 50, 25)),
true);
assertIntersection(region, new ProtectedCuboidRegion("large",
new BlockVector(-500, 0, -600), new BlockVector(1000, 128, 1000)));
new BlockVector(-500, 0, -600), new BlockVector(1000, 128, 1000)),
true);
assertIntersection(region, new ProtectedCuboidRegion("short",
new BlockVector(50, 40, -1), new BlockVector(150, 128, 2)));
new BlockVector(50, 40, -1), new BlockVector(150, 128, 2)),
true);
assertIntersection(region, new ProtectedCuboidRegion("long",
new BlockVector(0, 40, 5), new BlockVector(1000, 128, 8)));
new BlockVector(0, 40, 5), new BlockVector(1000, 128, 8)),
true);
List<BlockVector2D> triangle_overlap = new ArrayList<BlockVector2D>();
triangle_overlap.add(new BlockVector2D(90, -10));
triangle_overlap.add(new BlockVector2D(120, -10));
triangle_overlap.add(new BlockVector2D(90, 20));
assertIntersection(region, new ProtectedPolygonalRegion("triangle_overlap",
triangle_overlap, 0, 128),
true);
List<BlockVector2D> triangle_no_overlap = new ArrayList<BlockVector2D>();
triangle_no_overlap.add(new BlockVector2D(90, -10));
triangle_no_overlap.add(new BlockVector2D(105, -10));
triangle_no_overlap.add(new BlockVector2D(90, 5));
assertIntersection(region, new ProtectedPolygonalRegion("triangle_no_overlap",
triangle_no_overlap, 0, 128),
false);
List<BlockVector2D> triangle_overlap_no_points = new ArrayList<BlockVector2D>();
triangle_overlap_no_points.add(new BlockVector2D(100, -10));
triangle_overlap_no_points.add(new BlockVector2D(120, 50));
triangle_overlap_no_points.add(new BlockVector2D(140, -20));
assertIntersection(region, new ProtectedPolygonalRegion("triangle_overlap_no_points",
triangle_overlap_no_points, 60, 80),
true);
}
private void assertIntersection(ProtectedRegion region1, ProtectedRegion region2) {
boolean isIntersectingRegion = false;
private void assertIntersection(ProtectedRegion region1, ProtectedRegion region2, boolean expected) {
boolean actual = false;
List<ProtectedRegion> regions = new ArrayList<ProtectedRegion>();
regions.add(region2);
try {
isIntersectingRegion = (region1.getIntersectingRegions(regions).size() == 1);
actual = (region1.getIntersectingRegions(regions).size() == 1);
} catch (Exception e) {
e.printStackTrace();
}
assertTrue("Check for '" + region2.getId() + "' region failed.", isIntersectingRegion);
assertEquals("Check for '" + region2.getId() + "' region failed.", expected, actual);
}
}