com.plotsquared.core.collection.QuadMap Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of plotsquared-core Show documentation
Show all versions of plotsquared-core Show documentation
PlotSquared, a land and world management plugin for Minecraft.
/*
* PlotSquared, a land and world management plugin for Minecraft.
* Copyright (C) IntellectualSites
* Copyright (C) IntellectualSites team and contributors
*
* 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 {
public final int size;
public final int x;
public final int z;
private final int newsize;
private final int min;
public HashSet objects;
public QuadMap one;
public QuadMap two;
public QuadMap three;
public QuadMap four;
public QuadMap skip;
public QuadMap(int size, int x, int z) {
this.size = size;
this.x = x;
this.z = z;
this.newsize = size >> 1;
this.min = 512;
}
public QuadMap(int size, int x, int z, int min) {
this.size = size;
this.x = x;
this.z = z;
this.newsize = size >> 1;
this.min = min;
}
public int count() {
int size = countBelow();
if (this.objects != null) {
size += this.objects.size();
}
return size;
}
public Set getAll() {
HashSet all = new HashSet<>();
if (this.objects != null) {
all.addAll(this.objects);
}
if (this.skip != null) {
all.addAll(this.skip.getAll());
return all;
}
if (this.one != null) {
all.addAll(this.one.getAll());
}
if (this.two != null) {
all.addAll(this.two.getAll());
}
if (this.three != null) {
all.addAll(this.three.getAll());
}
if (this.four != null) {
all.addAll(this.four.getAll());
}
return all;
}
public int countCurrent() {
return this.objects == null ? 0 : this.objects.size();
}
public int countBelow() {
int size = 0;
if (this.one != null) {
size += this.one.count();
}
if (this.two != null) {
size += this.two.count();
}
if (this.three != null) {
size += this.three.count();
}
if (this.four != null) {
size += this.four.count();
}
return size;
}
public void add(T area) {
if (this.size <= this.min) {
if (this.objects == null) {
this.objects = new HashSet<>();
}
this.objects.add(area);
return;
}
CuboidRegion region = getRegion(area);
if (region.getMinimumPoint().getX() >= this.x) {
if (region.getMinimumPoint().getZ() >= this.z) {
if (this.one == null) {
this.one =
newInstance(this.newsize, this.x + this.newsize, this.z + this.newsize,
this.min
);
}
this.one.add(area);
recalculateSkip();
return;
} else if (region.getMaximumPoint().getZ() < this.z) {
if (this.two == null) {
this.two =
newInstance(this.newsize, this.x + this.newsize, this.z - this.newsize,
this.min
);
}
this.two.add(area);
recalculateSkip();
return;
}
} else if (region.getMaximumPoint().getX() < this.x) {
if (region.getMinimumPoint().getZ() >= this.z) {
if (this.four == null) {
this.four =
newInstance(this.newsize, this.x - this.newsize, this.z + this.newsize,
this.min
);
}
this.four.add(area);
recalculateSkip();
return;
} else if (region.getMaximumPoint().getZ() < this.z) {
if (this.three == null) {
this.three =
newInstance(this.newsize, this.x - this.newsize, this.z - this.newsize,
this.min
);
}
this.three.add(area);
recalculateSkip();
return;
}
}
if (this.objects == null) {
this.objects = new HashSet<>();
}
this.objects.add(area);
}
public CuboidRegion getRegion(T value) {
return null;
}
public QuadMap newInstance(int newsize, int x, int z, int min) {
try {
return new QuadMap(newsize, x, z, min) {
@Override
public CuboidRegion getRegion(T value) {
return QuadMap.this.getRegion(value);
}
};
} catch (Throwable e) {
e.printStackTrace();
return null;
}
}
public boolean remove(T area) {
if (this.objects != null) {
if (this.objects.remove(area)) {
return this.objects.isEmpty();
}
}
if (this.skip != null) {
if (this.skip.remove(area)) {
this.skip = null;
}
} else {
CuboidRegion region = getRegion(area);
if (region.getMinimumPoint().getX() >= this.x) {
if (region.getMinimumPoint().getZ() >= this.z) {
if (this.one != null) {
if (this.one.remove(area)) {
this.one = null;
}
return countCurrent() == 0;
}
} else {
if (this.two != null) {
if (this.two.remove(area)) {
this.two = null;
}
return countCurrent() == 0;
}
}
} else {
if (region.getMinimumPoint().getZ() >= this.z) {
if (this.four != null) {
if (this.four.remove(area)) {
this.four = null;
}
return countCurrent() == 0;
}
} else {
if (this.three != null) {
if (this.three.remove(area)) {
this.three = null;
}
return countCurrent() == 0;
}
}
}
}
return false;
}
@SuppressWarnings("unchecked")
public void recalculateSkip() {
QuadMap map = null;
for (QuadMap current : new QuadMap[]{this.one, this.two, this.three, this.four}) {
if (current != null) {
if (map != null) {
this.skip = null;
return;
}
map = current;
}
}
this.skip = map.skip == null ? map : map.skip;
}
public Set get(CuboidRegion region) {
HashSet set = new HashSet<>();
if (this.objects != null) {
for (T obj : this.objects) {
if (RegionUtil.intersects(getRegion(obj), region)) {
set.add(obj);
}
}
}
if (this.skip != null) {
if (this.skip.intersects(region)) {
set.addAll(this.skip.get(region));
}
} else {
if (this.one != null && this.one.intersects(region)) {
set.addAll(this.one.get(region));
}
if (this.two != null && this.two.intersects(region)) {
set.addAll(this.two.get(region));
}
if (this.three != null && this.three.intersects(region)) {
set.addAll(this.three.get(region));
}
if (this.four != null && this.four.intersects(region)) {
set.addAll(this.four.get(region));
}
}
return set;
}
public boolean intersects(CuboidRegion other) {
return (other.getMinimumPoint().getX() <= this.x + this.size) && (
other.getMaximumPoint().getX() >= this.x - this.size) && (other.getMinimumPoint().getZ()
<= this.z + this.size) && (other.getMaximumPoint().getZ() >= this.z - this.size);
}
public T get(int x, int z) {
if (this.objects != null) {
for (T obj : this.objects) {
if (RegionUtil.contains(getRegion(obj), x, z)) {
return obj;
}
}
}
if (this.skip != null) {
return this.skip.get(x, z);
} else {
if (x >= this.x) {
if (z >= this.z) {
if (this.one != null) {
return this.one.get(x, z);
}
} else {
if (this.two != null) {
return this.two.get(x, z);
}
}
} else {
if (z >= this.z) {
if (this.four != null) {
return this.four.get(x, z);
}
} else {
if (this.three != null) {
return this.three.get(x, z);
}
}
}
}
return null;
}
}