2011-01-08 11:04:21 +01:00
|
|
|
// $Id$
|
|
|
|
/*
|
|
|
|
* WorldGuard
|
|
|
|
* Copyright (C) 2010 sk89q <http://www.sk89q.com>
|
|
|
|
*
|
|
|
|
* This program 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.
|
|
|
|
*
|
|
|
|
* This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
|
2011-02-27 16:24:07 +01:00
|
|
|
*/
|
2011-02-24 11:19:35 +01:00
|
|
|
package com.sk89q.worldguard.protection.regions;
|
2011-01-08 11:04:21 +01:00
|
|
|
|
|
|
|
import com.sk89q.worldedit.*;
|
2011-02-27 16:24:07 +01:00
|
|
|
import com.sk89q.worldguard.protection.UnsupportedIntersectionException;
|
2011-02-27 21:02:57 +01:00
|
|
|
|
|
|
|
import java.util.ArrayList;
|
2011-02-27 18:16:09 +01:00
|
|
|
import java.util.List;
|
2011-01-08 11:04:21 +01:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Represents a cuboid region that can be protected.
|
|
|
|
*
|
|
|
|
* @author sk89q
|
|
|
|
*/
|
|
|
|
public class ProtectedCuboidRegion extends ProtectedRegion {
|
2011-02-27 16:24:07 +01:00
|
|
|
|
2011-01-08 11:04:21 +01:00
|
|
|
/**
|
|
|
|
* Store the first point.
|
|
|
|
*/
|
|
|
|
private BlockVector min;
|
|
|
|
/**
|
|
|
|
* Store the second point.
|
|
|
|
*/
|
|
|
|
private BlockVector max;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Construct a new instance of this cuboid region.
|
|
|
|
*
|
2011-01-22 00:23:11 +01:00
|
|
|
* @param id
|
2011-01-08 11:04:21 +01:00
|
|
|
* @param pos1
|
|
|
|
* @param pos2
|
|
|
|
* @param priority
|
|
|
|
*/
|
2011-01-22 00:23:11 +01:00
|
|
|
public ProtectedCuboidRegion(String id, BlockVector min, BlockVector max) {
|
|
|
|
super(id);
|
2011-01-08 11:04:21 +01:00
|
|
|
this.min = min;
|
|
|
|
this.max = max;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Get the lower point of the cuboid.
|
|
|
|
*
|
|
|
|
* @return min point
|
|
|
|
*/
|
|
|
|
public BlockVector getMinimumPoint() {
|
|
|
|
return min;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Set the lower point of the cuboid.
|
|
|
|
*
|
|
|
|
* @param pt
|
|
|
|
*/
|
|
|
|
public void setMinimumPoint(BlockVector pt) {
|
|
|
|
min = pt;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Get the upper point of the cuboid.
|
|
|
|
*
|
|
|
|
* @return max point
|
|
|
|
*/
|
|
|
|
public BlockVector getMaximumPoint() {
|
|
|
|
return max;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Set the upper point of the cuboid.
|
|
|
|
*
|
|
|
|
* @param pt
|
|
|
|
*/
|
|
|
|
public void setMaximumPoint(BlockVector pt) {
|
|
|
|
max = pt;
|
|
|
|
}
|
|
|
|
|
2011-01-22 00:23:11 +01:00
|
|
|
/**
|
|
|
|
* Checks to see if a point is inside this region.
|
|
|
|
*/
|
2011-01-08 11:04:21 +01:00
|
|
|
@Override
|
|
|
|
public boolean contains(Vector pt) {
|
2011-01-09 01:35:15 +01:00
|
|
|
int x = pt.getBlockX();
|
|
|
|
int y = pt.getBlockY();
|
|
|
|
int z = pt.getBlockZ();
|
|
|
|
return x >= min.getBlockX() && x <= max.getBlockX()
|
|
|
|
&& y >= min.getBlockY() && y <= max.getBlockY()
|
|
|
|
&& z >= min.getBlockZ() && z <= max.getBlockZ();
|
2011-01-08 11:04:21 +01:00
|
|
|
}
|
2011-02-27 16:24:07 +01:00
|
|
|
|
2011-02-27 18:16:09 +01:00
|
|
|
|
|
|
|
/*
|
2011-02-27 16:24:07 +01:00
|
|
|
public boolean intersectsWith(ProtectedRegion region) throws UnsupportedIntersectionException {
|
|
|
|
|
|
|
|
if (region instanceof ProtectedCuboidRegion) {
|
|
|
|
ProtectedCuboidRegion r1 = (ProtectedCuboidRegion) this;
|
|
|
|
ProtectedCuboidRegion r2 = (ProtectedCuboidRegion) region;
|
|
|
|
BlockVector min1 = r1.getMinimumPoint();
|
|
|
|
BlockVector max1 = r1.getMaximumPoint();
|
|
|
|
BlockVector min2 = r2.getMinimumPoint();
|
|
|
|
BlockVector max2 = r2.getMaximumPoint();
|
|
|
|
|
|
|
|
return !(min1.getBlockX() > max2.getBlockX()
|
|
|
|
|| min1.getBlockY() > max2.getBlockY()
|
|
|
|
|| min1.getBlockZ() > max2.getBlockZ()
|
|
|
|
|| max1.getBlockX() < min2.getBlockX()
|
|
|
|
|| max1.getBlockY() < min2.getBlockY()
|
|
|
|
|| max1.getBlockZ() < min2.getBlockZ());
|
|
|
|
} else if (region instanceof ProtectedPolygonalRegion) {
|
|
|
|
throw new UnsupportedIntersectionException();
|
|
|
|
} else {
|
|
|
|
throw new UnsupportedIntersectionException();
|
|
|
|
}
|
|
|
|
}
|
2011-02-27 18:16:09 +01:00
|
|
|
*/
|
|
|
|
|
|
|
|
public List<ProtectedRegion> getIntersectingRegions(List<ProtectedRegion> regions) throws UnsupportedIntersectionException {
|
2011-02-27 21:02:57 +01:00
|
|
|
int numRegions = regions.size();
|
|
|
|
List<ProtectedRegion> intersectingRegions = new ArrayList<ProtectedRegion>();
|
|
|
|
int i, i2, i3;
|
|
|
|
|
|
|
|
for (i = 0; i < numRegions; i++) {
|
|
|
|
ProtectedRegion region = regions.get(i);
|
|
|
|
BlockVector rMinPoint = region.getMinimumPoint();
|
|
|
|
BlockVector rMaxPoint = region.getMaximumPoint();
|
|
|
|
|
|
|
|
// Check whether the region is outside the min and max vector
|
|
|
|
if ((rMinPoint.getBlockX() < min.getBlockX() && rMaxPoint.getBlockX() < min.getBlockX())
|
|
|
|
|| (rMinPoint.getBlockX() > max.getBlockX() && rMaxPoint.getBlockX() > max.getBlockX())
|
|
|
|
&& ((rMinPoint.getBlockY() < min.getBlockY() && rMaxPoint.getBlockY() < min.getBlockY())
|
|
|
|
|| (rMinPoint.getBlockY() > max.getBlockY() && rMaxPoint.getBlockY() > max.getBlockY()))
|
|
|
|
&& ((rMinPoint.getBlockZ() < min.getBlockZ() && rMaxPoint.getBlockZ() < min.getBlockZ())
|
|
|
|
|| (rMinPoint.getBlockZ() > max.getBlockZ() && rMaxPoint.getBlockZ() > max.getBlockZ())) ) {
|
|
|
|
intersectingRegions.add(regions.get(i));
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check whether the regions points are inside the other region
|
|
|
|
if (region.contains(new Vector(min.getBlockX(), min.getBlockY(), min.getBlockZ()))
|
|
|
|
|| region.contains(new Vector(min.getBlockX(), min.getBlockY(), max.getBlockZ()))
|
|
|
|
|| region.contains(new Vector(min.getBlockX(), max.getBlockY(), max.getBlockZ()))
|
|
|
|
|| region.contains(new Vector(min.getBlockX(), max.getBlockY(), min.getBlockZ()))
|
|
|
|
|| region.contains(new Vector(max.getBlockX(), max.getBlockY(), max.getBlockZ()))
|
|
|
|
|| region.contains(new Vector(max.getBlockX(), max.getBlockY(), min.getBlockZ()))
|
|
|
|
|| region.contains(new Vector(max.getBlockX(), min.getBlockY(), min.getBlockZ()))
|
|
|
|
|| region.contains(new Vector(max.getBlockX(), min.getBlockY(), max.getBlockZ())) ) {
|
|
|
|
intersectingRegions.add(regions.get(i));
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check whether the other regions points are inside the current region
|
2011-02-28 00:52:26 +01:00
|
|
|
if (region instanceof ProtectedPolygonalRegion) {
|
2011-02-27 21:02:57 +01:00
|
|
|
for (i2 = 0; i < ((ProtectedPolygonalRegion)region).getPoints().size(); i++) {
|
|
|
|
BlockVector2D pt2Dr = ((ProtectedPolygonalRegion)region).getPoints().get(i2);
|
|
|
|
int minYr = ((ProtectedPolygonalRegion)region).minY;
|
|
|
|
int maxYr = ((ProtectedPolygonalRegion)region).maxY;
|
|
|
|
Vector ptr = new Vector(pt2Dr.getBlockX(), minYr, pt2Dr.getBlockZ());
|
|
|
|
Vector ptr2 = new Vector(pt2Dr.getBlockX(), maxYr, pt2Dr.getBlockZ());
|
|
|
|
|
|
|
|
if (this.contains(ptr) || this.contains(ptr2)) {
|
|
|
|
intersectingRegions.add(regions.get(i));
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
2011-02-28 00:52:26 +01:00
|
|
|
} else if (region instanceof ProtectedCuboidRegion) {
|
2011-02-27 21:02:57 +01:00
|
|
|
BlockVector ptcMin = region.getMinimumPoint();
|
|
|
|
BlockVector ptcMax = region.getMaximumPoint();
|
|
|
|
|
|
|
|
if (this.contains(new Vector(ptcMin.getBlockX(), ptcMin.getBlockY(), ptcMin.getBlockZ()))
|
|
|
|
|| this.contains(new Vector(ptcMin.getBlockX(), ptcMin.getBlockY(), ptcMax.getBlockZ()))
|
|
|
|
|| this.contains(new Vector(ptcMin.getBlockX(), ptcMax.getBlockY(), ptcMax.getBlockZ()))
|
|
|
|
|| this.contains(new Vector(ptcMin.getBlockX(), ptcMax.getBlockY(), ptcMin.getBlockZ()))
|
|
|
|
|| this.contains(new Vector(ptcMax.getBlockX(), ptcMax.getBlockY(), ptcMax.getBlockZ()))
|
|
|
|
|| this.contains(new Vector(ptcMax.getBlockX(), ptcMax.getBlockY(), ptcMin.getBlockZ()))
|
|
|
|
|| this.contains(new Vector(ptcMax.getBlockX(), ptcMin.getBlockY(), ptcMin.getBlockZ()))
|
|
|
|
|| this.contains(new Vector(ptcMax.getBlockX(), ptcMin.getBlockY(), ptcMax.getBlockZ())) ) {
|
|
|
|
intersectingRegions.add(regions.get(i));
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
throw new UnsupportedOperationException("Not supported yet.");
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check whether the current regions edges collide with the regions edges
|
|
|
|
boolean regionIsIntersecting = false;
|
|
|
|
List<BlockVector2D> points = new ArrayList<BlockVector2D>();
|
|
|
|
points.add(new BlockVector2D(min.getBlockX(), min.getBlockZ()));
|
|
|
|
points.add(new BlockVector2D(min.getBlockX(), max.getBlockZ()));
|
|
|
|
points.add(new BlockVector2D(max.getBlockX(), max.getBlockZ()));
|
|
|
|
points.add(new BlockVector2D(max.getBlockX(), min.getBlockZ()));
|
|
|
|
|
|
|
|
for (i2 = 0; i2 < points.size(); i2++) {
|
|
|
|
boolean checkNextPoint = false;
|
|
|
|
BlockVector2D currPoint = points.get(i2);
|
|
|
|
BlockVector2D nextPoint;
|
|
|
|
|
|
|
|
if (i2 == (points.size() - 1)) {
|
|
|
|
nextPoint = points.get(0);
|
|
|
|
} else {
|
|
|
|
nextPoint = points.get(i2 + 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
int currX = currPoint.getBlockX();
|
|
|
|
int currZ = currPoint.getBlockZ();
|
|
|
|
while (!checkNextPoint) {
|
|
|
|
for(i3 = min.getBlockY(); i3 <= max.getBlockY(); i3++) {
|
|
|
|
if (region.contains(new Vector(currX, i3, currZ))) {
|
|
|
|
intersectingRegions.add(regions.get(i));
|
|
|
|
regionIsIntersecting = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (currX == nextPoint.getBlockX() || currZ == nextPoint.getBlockZ() || regionIsIntersecting) {
|
|
|
|
checkNextPoint = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (nextPoint.getBlockX() > currPoint.getBlockX()) {
|
|
|
|
currX++;
|
|
|
|
} else {
|
|
|
|
currX--;
|
|
|
|
}
|
|
|
|
if (nextPoint.getBlockZ() > currPoint.getBlockZ()) {
|
|
|
|
currZ++;
|
|
|
|
} else {
|
|
|
|
currZ--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (regionIsIntersecting) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return intersectingRegions;
|
2011-02-27 18:16:09 +01:00
|
|
|
}
|
|
|
|
|
2011-02-27 16:24:07 +01:00
|
|
|
|
2011-01-22 00:23:11 +01:00
|
|
|
/**
|
|
|
|
* Return the type of region as a user-friendly name.
|
|
|
|
*
|
|
|
|
* @return type of region
|
|
|
|
*/
|
|
|
|
public String getTypeName() {
|
|
|
|
return "cuboid";
|
|
|
|
}
|
2011-02-25 01:36:47 +01:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Get the number of Blocks in this region
|
|
|
|
*
|
|
|
|
* @return
|
|
|
|
*/
|
|
|
|
public int countBlocks() {
|
2011-02-26 13:11:27 +01:00
|
|
|
int xLength = max.getBlockX() - min.getBlockX() + 1;
|
|
|
|
int yLength = max.getBlockY() - min.getBlockY() + 1;
|
|
|
|
int zLength = max.getBlockZ() - min.getBlockZ() + 1;
|
|
|
|
|
|
|
|
int volume = xLength * yLength * zLength;
|
|
|
|
return volume;
|
2011-02-25 01:36:47 +01:00
|
|
|
}
|
2011-02-27 18:16:09 +01:00
|
|
|
|
|
|
|
|
2011-01-08 11:04:21 +01:00
|
|
|
}
|