83 lines
3.0 KiB
Java
83 lines
3.0 KiB
Java
/*
|
|
* PlotSquared, a land and world management plugin for Minecraft.
|
|
* Copyright (C) IntellectualSites <https://intellectualsites.com>
|
|
* 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 <https://www.gnu.org/licenses/>.
|
|
*/
|
|
package com.plotsquared.core.util;
|
|
|
|
/**
|
|
* plot functions
|
|
*
|
|
* @deprecated Do not use
|
|
*/
|
|
@Deprecated(forRemoval = true, since = "6.0.0")
|
|
public class MainUtil {
|
|
|
|
/**
|
|
* Cache of mapping x,y,z coordinates to the chunk array<br>
|
|
* - Used for efficient world generation<br>
|
|
*/
|
|
@Deprecated(forRemoval = true, since = "6.0.0")
|
|
public static short[][] x_loc;
|
|
@Deprecated(forRemoval = true, since = "6.0.0")
|
|
public static short[][] y_loc;
|
|
@Deprecated(forRemoval = true, since = "6.0.0")
|
|
public static short[][] z_loc;
|
|
@Deprecated(forRemoval = true, since = "6.0.0")
|
|
public static short[][][] CACHE_I = null;
|
|
@Deprecated(forRemoval = true, since = "6.0.0")
|
|
public static short[][][] CACHE_J = null;
|
|
|
|
/**
|
|
* This cache is used for world generation and just saves a bit of calculation time when checking if something is in the plot area.
|
|
*/
|
|
@Deprecated(forRemoval = true, since = "6.0.0")
|
|
public static void initCache() {
|
|
if (x_loc == null) {
|
|
x_loc = new short[16][4096];
|
|
y_loc = new short[16][4096];
|
|
z_loc = new short[16][4096];
|
|
for (int i = 0; i < 16; i++) {
|
|
int i4 = i << 4;
|
|
for (int j = 0; j < 4096; j++) {
|
|
int y = i4 + (j >> 8);
|
|
int a = j - ((y & 0xF) << 8);
|
|
int z1 = a >> 4;
|
|
int x1 = a - (z1 << 4);
|
|
x_loc[i][j] = (short) x1;
|
|
y_loc[i][j] = (short) y;
|
|
z_loc[i][j] = (short) z1;
|
|
}
|
|
}
|
|
}
|
|
if (CACHE_I == null) {
|
|
CACHE_I = new short[256][16][16];
|
|
CACHE_J = new short[256][16][16];
|
|
for (int x = 0; x < 16; x++) {
|
|
for (int z = 0; z < 16; z++) {
|
|
for (int y = 0; y < 256; y++) {
|
|
short i = (short) (y >> 4);
|
|
short j = (short) ((y & 0xF) << 8 | z << 4 | x);
|
|
CACHE_I[y][x][z] = i;
|
|
CACHE_J[y][x][z] = j;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
}
|