geforkt von Mirrors/Paper
Added for diff visibility:
- ChunkProviderGenerate - ChunkProviderFlat - ChunkProviderHell - ChunkProviderTheEnd
Dieser Commit ist enthalten in:
Mike Primm
EvilSeph
Ursprung
0a925ff067
Commit
6cd2a70803
95
src/main/java/net/minecraft/server/ChunkProviderFlat.java
Normale Datei
95
src/main/java/net/minecraft/server/ChunkProviderFlat.java
Normale Datei
@ -0,0 +1,95 @@
|
||||
package net.minecraft.server;
|
||||
|
||||
import java.util.List;
|
||||
import java.util.Random;
|
||||
|
||||
public class ChunkProviderFlat implements IChunkProvider {
|
||||
|
||||
private World a;
|
||||
private Random b;
|
||||
private final boolean c;
|
||||
private WorldGenVillage d = new WorldGenVillage(1);
|
||||
|
||||
public ChunkProviderFlat(World world, long i, boolean flag) {
|
||||
this.a = world;
|
||||
this.c = flag;
|
||||
this.b = new Random(i);
|
||||
}
|
||||
|
||||
private void a(byte[] abyte) {
|
||||
int i = abyte.length / 256;
|
||||
|
||||
for (int j = 0; j < 16; ++j) {
|
||||
for (int k = 0; k < 16; ++k) {
|
||||
for (int l = 0; l < i; ++l) {
|
||||
int i1 = 0;
|
||||
|
||||
if (l == 0) {
|
||||
i1 = Block.BEDROCK.id;
|
||||
} else if (l <= 2) {
|
||||
i1 = Block.DIRT.id;
|
||||
} else if (l == 3) {
|
||||
i1 = Block.GRASS.id;
|
||||
}
|
||||
|
||||
abyte[j << 11 | k << 7 | l] = (byte) i1;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
public Chunk getChunkAt(int i, int j) {
|
||||
return this.getOrCreateChunk(i, j);
|
||||
}
|
||||
|
||||
public Chunk getOrCreateChunk(int i, int j) {
|
||||
byte[] abyte = new byte['\u8000'];
|
||||
|
||||
this.a(abyte);
|
||||
Chunk chunk = new Chunk(this.a, abyte, i, j);
|
||||
|
||||
if (this.c) {
|
||||
this.d.a(this, this.a, i, j, abyte);
|
||||
}
|
||||
|
||||
chunk.initLighting();
|
||||
return chunk;
|
||||
}
|
||||
|
||||
public boolean isChunkLoaded(int i, int j) {
|
||||
return true;
|
||||
}
|
||||
|
||||
public void getChunkAt(IChunkProvider ichunkprovider, int i, int j) {
|
||||
this.b.setSeed(this.a.getSeed());
|
||||
long k = this.b.nextLong() / 2L * 2L + 1L;
|
||||
long l = this.b.nextLong() / 2L * 2L + 1L;
|
||||
|
||||
this.b.setSeed((long) i * k + (long) j * l ^ this.a.getSeed());
|
||||
if (this.c) {
|
||||
this.d.a(this.a, this.b, i, j);
|
||||
}
|
||||
}
|
||||
|
||||
public boolean saveChunks(boolean flag, IProgressUpdate iprogressupdate) {
|
||||
return true;
|
||||
}
|
||||
|
||||
public boolean unloadChunks() {
|
||||
return false;
|
||||
}
|
||||
|
||||
public boolean canSave() {
|
||||
return true;
|
||||
}
|
||||
|
||||
public List getMobsFor(EnumCreatureType enumcreaturetype, int i, int j, int k) {
|
||||
BiomeBase biomebase = this.a.getBiome(i, k);
|
||||
|
||||
return biomebase == null ? null : biomebase.getMobs(enumcreaturetype);
|
||||
}
|
||||
|
||||
public ChunkPosition findNearestMapFeature(World world, String s, int i, int j, int k) {
|
||||
return null;
|
||||
}
|
||||
}
|
||||
419
src/main/java/net/minecraft/server/ChunkProviderGenerate.java
Normale Datei
419
src/main/java/net/minecraft/server/ChunkProviderGenerate.java
Normale Datei
@ -0,0 +1,419 @@
|
||||
package net.minecraft.server;
|
||||
|
||||
import java.util.List;
|
||||
import java.util.Random;
|
||||
|
||||
public class ChunkProviderGenerate implements IChunkProvider {
|
||||
|
||||
private Random k;
|
||||
private NoiseGeneratorOctaves l;
|
||||
private NoiseGeneratorOctaves m;
|
||||
private NoiseGeneratorOctaves n;
|
||||
private NoiseGeneratorOctaves o;
|
||||
public NoiseGeneratorOctaves a;
|
||||
public NoiseGeneratorOctaves b;
|
||||
public NoiseGeneratorOctaves c;
|
||||
private World p;
|
||||
private final boolean q;
|
||||
private double[] r;
|
||||
private double[] s = new double[256];
|
||||
private WorldGenBase t = new WorldGenCaves();
|
||||
private WorldGenStronghold u = new WorldGenStronghold();
|
||||
private WorldGenVillage v = new WorldGenVillage(0);
|
||||
private WorldGenMineshaft w = new WorldGenMineshaft();
|
||||
private WorldGenBase x = new WorldGenCanyon();
|
||||
private BiomeBase[] y;
|
||||
double[] d;
|
||||
double[] e;
|
||||
double[] f;
|
||||
double[] g;
|
||||
double[] h;
|
||||
float[] i;
|
||||
int[][] j = new int[32][32];
|
||||
|
||||
public ChunkProviderGenerate(World world, long i, boolean flag) {
|
||||
this.p = world;
|
||||
this.q = flag;
|
||||
this.k = new Random(i);
|
||||
this.l = new NoiseGeneratorOctaves(this.k, 16);
|
||||
this.m = new NoiseGeneratorOctaves(this.k, 16);
|
||||
this.n = new NoiseGeneratorOctaves(this.k, 8);
|
||||
this.o = new NoiseGeneratorOctaves(this.k, 4);
|
||||
this.a = new NoiseGeneratorOctaves(this.k, 10);
|
||||
this.b = new NoiseGeneratorOctaves(this.k, 16);
|
||||
this.c = new NoiseGeneratorOctaves(this.k, 8);
|
||||
}
|
||||
|
||||
public void a(int i, int j, byte[] abyte) {
|
||||
byte b0 = 4;
|
||||
byte b1 = 16;
|
||||
byte b2 = 63;
|
||||
int k = b0 + 1;
|
||||
byte b3 = 17;
|
||||
int l = b0 + 1;
|
||||
|
||||
this.y = this.p.getWorldChunkManager().getBiomes(this.y, i * 4 - 2, j * 4 - 2, k + 5, l + 5);
|
||||
this.r = this.a(this.r, i * b0, 0, j * b0, k, b3, l);
|
||||
|
||||
for (int i1 = 0; i1 < b0; ++i1) {
|
||||
for (int j1 = 0; j1 < b0; ++j1) {
|
||||
for (int k1 = 0; k1 < b1; ++k1) {
|
||||
double d0 = 0.125D;
|
||||
double d1 = this.r[((i1 + 0) * l + j1 + 0) * b3 + k1 + 0];
|
||||
double d2 = this.r[((i1 + 0) * l + j1 + 1) * b3 + k1 + 0];
|
||||
double d3 = this.r[((i1 + 1) * l + j1 + 0) * b3 + k1 + 0];
|
||||
double d4 = this.r[((i1 + 1) * l + j1 + 1) * b3 + k1 + 0];
|
||||
double d5 = (this.r[((i1 + 0) * l + j1 + 0) * b3 + k1 + 1] - d1) * d0;
|
||||
double d6 = (this.r[((i1 + 0) * l + j1 + 1) * b3 + k1 + 1] - d2) * d0;
|
||||
double d7 = (this.r[((i1 + 1) * l + j1 + 0) * b3 + k1 + 1] - d3) * d0;
|
||||
double d8 = (this.r[((i1 + 1) * l + j1 + 1) * b3 + k1 + 1] - d4) * d0;
|
||||
|
||||
for (int l1 = 0; l1 < 8; ++l1) {
|
||||
double d9 = 0.25D;
|
||||
double d10 = d1;
|
||||
double d11 = d2;
|
||||
double d12 = (d3 - d1) * d9;
|
||||
double d13 = (d4 - d2) * d9;
|
||||
|
||||
for (int i2 = 0; i2 < 4; ++i2) {
|
||||
int j2 = i2 + i1 * 4 << 11 | 0 + j1 * 4 << 7 | k1 * 8 + l1;
|
||||
short short1 = 128;
|
||||
|
||||
j2 -= short1;
|
||||
double d14 = 0.25D;
|
||||
double d15 = (d11 - d10) * d14;
|
||||
double d16 = d10 - d15;
|
||||
|
||||
for (int k2 = 0; k2 < 4; ++k2) {
|
||||
if ((d16 += d15) > 0.0D) {
|
||||
abyte[j2 += short1] = (byte) Block.STONE.id;
|
||||
} else if (k1 * 8 + l1 < b2) {
|
||||
abyte[j2 += short1] = (byte) Block.STATIONARY_WATER.id;
|
||||
} else {
|
||||
abyte[j2 += short1] = 0;
|
||||
}
|
||||
}
|
||||
|
||||
d10 += d12;
|
||||
d11 += d13;
|
||||
}
|
||||
|
||||
d1 += d5;
|
||||
d2 += d6;
|
||||
d3 += d7;
|
||||
d4 += d8;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
public void a(int i, int j, byte[] abyte, BiomeBase[] abiomebase) {
|
||||
byte b0 = 63;
|
||||
double d0 = 0.03125D;
|
||||
|
||||
this.s = this.o.a(this.s, i * 16, j * 16, 0, 16, 16, 1, d0 * 2.0D, d0 * 2.0D, d0 * 2.0D);
|
||||
|
||||
for (int k = 0; k < 16; ++k) {
|
||||
for (int l = 0; l < 16; ++l) {
|
||||
BiomeBase biomebase = abiomebase[l + k * 16];
|
||||
float f = biomebase.h();
|
||||
int i1 = (int) (this.s[k + l * 16] / 3.0D + 3.0D + this.k.nextDouble() * 0.25D);
|
||||
int j1 = -1;
|
||||
byte b1 = biomebase.A;
|
||||
byte b2 = biomebase.B;
|
||||
|
||||
for (int k1 = 127; k1 >= 0; --k1) {
|
||||
int l1 = (l * 16 + k) * 128 + k1;
|
||||
|
||||
if (k1 <= 0 + this.k.nextInt(5)) {
|
||||
abyte[l1] = (byte) Block.BEDROCK.id;
|
||||
} else {
|
||||
byte b3 = abyte[l1];
|
||||
|
||||
if (b3 == 0) {
|
||||
j1 = -1;
|
||||
} else if (b3 == Block.STONE.id) {
|
||||
if (j1 == -1) {
|
||||
if (i1 <= 0) {
|
||||
b1 = 0;
|
||||
b2 = (byte) Block.STONE.id;
|
||||
} else if (k1 >= b0 - 4 && k1 <= b0 + 1) {
|
||||
b1 = biomebase.A;
|
||||
b2 = biomebase.B;
|
||||
}
|
||||
|
||||
if (k1 < b0 && b1 == 0) {
|
||||
if (f < 0.15F) {
|
||||
b1 = (byte) Block.ICE.id;
|
||||
} else {
|
||||
b1 = (byte) Block.STATIONARY_WATER.id;
|
||||
}
|
||||
}
|
||||
|
||||
j1 = i1;
|
||||
if (k1 >= b0 - 1) {
|
||||
abyte[l1] = b1;
|
||||
} else {
|
||||
abyte[l1] = b2;
|
||||
}
|
||||
} else if (j1 > 0) {
|
||||
--j1;
|
||||
abyte[l1] = b2;
|
||||
if (j1 == 0 && b2 == Block.SAND.id) {
|
||||
j1 = this.k.nextInt(4);
|
||||
b2 = (byte) Block.SANDSTONE.id;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
public Chunk getChunkAt(int i, int j) {
|
||||
return this.getOrCreateChunk(i, j);
|
||||
}
|
||||
|
||||
public Chunk getOrCreateChunk(int i, int j) {
|
||||
this.k.setSeed((long) i * 341873128712L + (long) j * 132897987541L);
|
||||
byte[] abyte = new byte['\u8000'];
|
||||
|
||||
this.a(i, j, abyte);
|
||||
this.y = this.p.getWorldChunkManager().getBiomeBlock(this.y, i * 16, j * 16, 16, 16);
|
||||
this.a(i, j, abyte, this.y);
|
||||
this.t.a(this, this.p, i, j, abyte);
|
||||
this.x.a(this, this.p, i, j, abyte);
|
||||
if (this.q) {
|
||||
this.w.a(this, this.p, i, j, abyte);
|
||||
this.v.a(this, this.p, i, j, abyte);
|
||||
this.u.a(this, this.p, i, j, abyte);
|
||||
}
|
||||
|
||||
Chunk chunk = new Chunk(this.p, abyte, i, j);
|
||||
|
||||
chunk.initLighting();
|
||||
return chunk;
|
||||
}
|
||||
|
||||
private double[] a(double[] adouble, int i, int j, int k, int l, int i1, int j1) {
|
||||
if (adouble == null) {
|
||||
adouble = new double[l * i1 * j1];
|
||||
}
|
||||
|
||||
if (this.i == null) {
|
||||
this.i = new float[25];
|
||||
|
||||
for (int k1 = -2; k1 <= 2; ++k1) {
|
||||
for (int l1 = -2; l1 <= 2; ++l1) {
|
||||
float f = 10.0F / MathHelper.c((float) (k1 * k1 + l1 * l1) + 0.2F);
|
||||
|
||||
this.i[k1 + 2 + (l1 + 2) * 5] = f;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
double d0 = 684.412D;
|
||||
double d1 = 684.412D;
|
||||
|
||||
this.g = this.a.a(this.g, i, k, l, j1, 1.121D, 1.121D, 0.5D);
|
||||
this.h = this.b.a(this.h, i, k, l, j1, 200.0D, 200.0D, 0.5D);
|
||||
this.d = this.n.a(this.d, i, j, k, l, i1, j1, d0 / 80.0D, d1 / 160.0D, d0 / 80.0D);
|
||||
this.e = this.l.a(this.e, i, j, k, l, i1, j1, d0, d1, d0);
|
||||
this.f = this.m.a(this.f, i, j, k, l, i1, j1, d0, d1, d0);
|
||||
boolean flag = false;
|
||||
boolean flag1 = false;
|
||||
int i2 = 0;
|
||||
int j2 = 0;
|
||||
|
||||
for (int k2 = 0; k2 < l; ++k2) {
|
||||
for (int l2 = 0; l2 < j1; ++l2) {
|
||||
float f1 = 0.0F;
|
||||
float f2 = 0.0F;
|
||||
float f3 = 0.0F;
|
||||
byte b0 = 2;
|
||||
BiomeBase biomebase = this.y[k2 + 2 + (l2 + 2) * (l + 5)];
|
||||
|
||||
for (int i3 = -b0; i3 <= b0; ++i3) {
|
||||
for (int j3 = -b0; j3 <= b0; ++j3) {
|
||||
BiomeBase biomebase1 = this.y[k2 + i3 + 2 + (l2 + j3 + 2) * (l + 5)];
|
||||
float f4 = this.i[i3 + 2 + (j3 + 2) * 5] / (biomebase1.D + 2.0F);
|
||||
|
||||
if (biomebase1.D > biomebase.D) {
|
||||
f4 /= 2.0F;
|
||||
}
|
||||
|
||||
f1 += biomebase1.E * f4;
|
||||
f2 += biomebase1.D * f4;
|
||||
f3 += f4;
|
||||
}
|
||||
}
|
||||
|
||||
f1 /= f3;
|
||||
f2 /= f3;
|
||||
f1 = f1 * 0.9F + 0.1F;
|
||||
f2 = (f2 * 4.0F - 1.0F) / 8.0F;
|
||||
double d2 = this.h[j2] / 8000.0D;
|
||||
|
||||
if (d2 < 0.0D) {
|
||||
d2 = -d2 * 0.3D;
|
||||
}
|
||||
|
||||
d2 = d2 * 3.0D - 2.0D;
|
||||
if (d2 < 0.0D) {
|
||||
d2 /= 2.0D;
|
||||
if (d2 < -1.0D) {
|
||||
d2 = -1.0D;
|
||||
}
|
||||
|
||||
d2 /= 1.4D;
|
||||
d2 /= 2.0D;
|
||||
} else {
|
||||
if (d2 > 1.0D) {
|
||||
d2 = 1.0D;
|
||||
}
|
||||
|
||||
d2 /= 8.0D;
|
||||
}
|
||||
|
||||
++j2;
|
||||
|
||||
for (int k3 = 0; k3 < i1; ++k3) {
|
||||
double d3 = (double) f2;
|
||||
double d4 = (double) f1;
|
||||
|
||||
d3 += d2 * 0.2D;
|
||||
d3 = d3 * (double) i1 / 16.0D;
|
||||
double d5 = (double) i1 / 2.0D + d3 * 4.0D;
|
||||
double d6 = 0.0D;
|
||||
double d7 = ((double) k3 - d5) * 12.0D * 128.0D / 128.0D / d4;
|
||||
|
||||
if (d7 < 0.0D) {
|
||||
d7 *= 4.0D;
|
||||
}
|
||||
|
||||
double d8 = this.e[i2] / 512.0D;
|
||||
double d9 = this.f[i2] / 512.0D;
|
||||
double d10 = (this.d[i2] / 10.0D + 1.0D) / 2.0D;
|
||||
|
||||
if (d10 < 0.0D) {
|
||||
d6 = d8;
|
||||
} else if (d10 > 1.0D) {
|
||||
d6 = d9;
|
||||
} else {
|
||||
d6 = d8 + (d9 - d8) * d10;
|
||||
}
|
||||
|
||||
d6 -= d7;
|
||||
if (k3 > i1 - 4) {
|
||||
double d11 = (double) ((float) (k3 - (i1 - 4)) / 3.0F);
|
||||
|
||||
d6 = d6 * (1.0D - d11) + -10.0D * d11;
|
||||
}
|
||||
|
||||
adouble[i2] = d6;
|
||||
++i2;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return adouble;
|
||||
}
|
||||
|
||||
public boolean isChunkLoaded(int i, int j) {
|
||||
return true;
|
||||
}
|
||||
|
||||
public void getChunkAt(IChunkProvider ichunkprovider, int i, int j) {
|
||||
BlockSand.instaFall = true;
|
||||
int k = i * 16;
|
||||
int l = j * 16;
|
||||
BiomeBase biomebase = this.p.getBiome(k + 16, l + 16);
|
||||
|
||||
this.k.setSeed(this.p.getSeed());
|
||||
long i1 = this.k.nextLong() / 2L * 2L + 1L;
|
||||
long j1 = this.k.nextLong() / 2L * 2L + 1L;
|
||||
|
||||
this.k.setSeed((long) i * i1 + (long) j * j1 ^ this.p.getSeed());
|
||||
boolean flag = false;
|
||||
|
||||
if (this.q) {
|
||||
this.w.a(this.p, this.k, i, j);
|
||||
flag = this.v.a(this.p, this.k, i, j);
|
||||
this.u.a(this.p, this.k, i, j);
|
||||
}
|
||||
|
||||
int k1;
|
||||
int l1;
|
||||
int i2;
|
||||
|
||||
if (!flag && this.k.nextInt(4) == 0) {
|
||||
k1 = k + this.k.nextInt(16) + 8;
|
||||
l1 = this.k.nextInt(128);
|
||||
i2 = l + this.k.nextInt(16) + 8;
|
||||
(new WorldGenLakes(Block.STATIONARY_WATER.id)).a(this.p, this.k, k1, l1, i2);
|
||||
}
|
||||
|
||||
if (!flag && this.k.nextInt(8) == 0) {
|
||||
k1 = k + this.k.nextInt(16) + 8;
|
||||
l1 = this.k.nextInt(this.k.nextInt(120) + 8);
|
||||
i2 = l + this.k.nextInt(16) + 8;
|
||||
if (l1 < 63 || this.k.nextInt(10) == 0) {
|
||||
(new WorldGenLakes(Block.STATIONARY_LAVA.id)).a(this.p, this.k, k1, l1, i2);
|
||||
}
|
||||
}
|
||||
|
||||
for (k1 = 0; k1 < 8; ++k1) {
|
||||
l1 = k + this.k.nextInt(16) + 8;
|
||||
i2 = this.k.nextInt(128);
|
||||
int j2 = l + this.k.nextInt(16) + 8;
|
||||
|
||||
if ((new WorldGenDungeons()).a(this.p, this.k, l1, i2, j2)) {
|
||||
;
|
||||
}
|
||||
}
|
||||
|
||||
biomebase.a(this.p, this.k, k, l);
|
||||
SpawnerCreature.a(this.p, biomebase, k + 8, l + 8, 16, 16, this.k);
|
||||
k += 8;
|
||||
l += 8;
|
||||
|
||||
for (k1 = 0; k1 < 16; ++k1) {
|
||||
for (l1 = 0; l1 < 16; ++l1) {
|
||||
i2 = this.p.f(k + k1, l + l1);
|
||||
if (this.p.s(k1 + k, i2 - 1, l1 + l)) {
|
||||
this.p.setTypeId(k1 + k, i2 - 1, l1 + l, Block.ICE.id);
|
||||
}
|
||||
|
||||
if (this.p.u(k1 + k, i2, l1 + l)) {
|
||||
this.p.setTypeId(k1 + k, i2, l1 + l, Block.SNOW.id);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
BlockSand.instaFall = false;
|
||||
}
|
||||
|
||||
public boolean saveChunks(boolean flag, IProgressUpdate iprogressupdate) {
|
||||
return true;
|
||||
}
|
||||
|
||||
public boolean unloadChunks() {
|
||||
return false;
|
||||
}
|
||||
|
||||
public boolean canSave() {
|
||||
return true;
|
||||
}
|
||||
|
||||
public List getMobsFor(EnumCreatureType enumcreaturetype, int i, int j, int k) {
|
||||
BiomeBase biomebase = this.p.getBiome(i, k);
|
||||
|
||||
return biomebase == null ? null : biomebase.getMobs(enumcreaturetype);
|
||||
}
|
||||
|
||||
public ChunkPosition findNearestMapFeature(World world, String s, int i, int j, int k) {
|
||||
return "Stronghold".equals(s) && this.u != null ? this.u.getNearestGeneratedFeature(world, i, j, k) : null;
|
||||
}
|
||||
}
|
||||
407
src/main/java/net/minecraft/server/ChunkProviderHell.java
Normale Datei
407
src/main/java/net/minecraft/server/ChunkProviderHell.java
Normale Datei
@ -0,0 +1,407 @@
|
||||
package net.minecraft.server;
|
||||
|
||||
import java.util.List;
|
||||
import java.util.Random;
|
||||
|
||||
public class ChunkProviderHell implements IChunkProvider {
|
||||
|
||||
private Random i;
|
||||
private NoiseGeneratorOctaves j;
|
||||
private NoiseGeneratorOctaves k;
|
||||
private NoiseGeneratorOctaves l;
|
||||
private NoiseGeneratorOctaves m;
|
||||
private NoiseGeneratorOctaves n;
|
||||
public NoiseGeneratorOctaves a;
|
||||
public NoiseGeneratorOctaves b;
|
||||
private World o;
|
||||
private double[] p;
|
||||
public WorldGenNether c = new WorldGenNether();
|
||||
private double[] q = new double[256];
|
||||
private double[] r = new double[256];
|
||||
private double[] s = new double[256];
|
||||
private WorldGenBase t = new WorldGenCavesHell();
|
||||
double[] d;
|
||||
double[] e;
|
||||
double[] f;
|
||||
double[] g;
|
||||
double[] h;
|
||||
|
||||
public ChunkProviderHell(World world, long i) {
|
||||
this.o = world;
|
||||
this.i = new Random(i);
|
||||
this.j = new NoiseGeneratorOctaves(this.i, 16);
|
||||
this.k = new NoiseGeneratorOctaves(this.i, 16);
|
||||
this.l = new NoiseGeneratorOctaves(this.i, 8);
|
||||
this.m = new NoiseGeneratorOctaves(this.i, 4);
|
||||
this.n = new NoiseGeneratorOctaves(this.i, 4);
|
||||
this.a = new NoiseGeneratorOctaves(this.i, 10);
|
||||
this.b = new NoiseGeneratorOctaves(this.i, 16);
|
||||
}
|
||||
|
||||
public void a(int i, int j, byte[] abyte) {
|
||||
byte b0 = 4;
|
||||
byte b1 = 32;
|
||||
int k = b0 + 1;
|
||||
byte b2 = 17;
|
||||
int l = b0 + 1;
|
||||
|
||||
this.p = this.a(this.p, i * b0, 0, j * b0, k, b2, l);
|
||||
|
||||
for (int i1 = 0; i1 < b0; ++i1) {
|
||||
for (int j1 = 0; j1 < b0; ++j1) {
|
||||
for (int k1 = 0; k1 < 16; ++k1) {
|
||||
double d0 = 0.125D;
|
||||
double d1 = this.p[((i1 + 0) * l + j1 + 0) * b2 + k1 + 0];
|
||||
double d2 = this.p[((i1 + 0) * l + j1 + 1) * b2 + k1 + 0];
|
||||
double d3 = this.p[((i1 + 1) * l + j1 + 0) * b2 + k1 + 0];
|
||||
double d4 = this.p[((i1 + 1) * l + j1 + 1) * b2 + k1 + 0];
|
||||
double d5 = (this.p[((i1 + 0) * l + j1 + 0) * b2 + k1 + 1] - d1) * d0;
|
||||
double d6 = (this.p[((i1 + 0) * l + j1 + 1) * b2 + k1 + 1] - d2) * d0;
|
||||
double d7 = (this.p[((i1 + 1) * l + j1 + 0) * b2 + k1 + 1] - d3) * d0;
|
||||
double d8 = (this.p[((i1 + 1) * l + j1 + 1) * b2 + k1 + 1] - d4) * d0;
|
||||
|
||||
for (int l1 = 0; l1 < 8; ++l1) {
|
||||
double d9 = 0.25D;
|
||||
double d10 = d1;
|
||||
double d11 = d2;
|
||||
double d12 = (d3 - d1) * d9;
|
||||
double d13 = (d4 - d2) * d9;
|
||||
|
||||
for (int i2 = 0; i2 < 4; ++i2) {
|
||||
int j2 = i2 + i1 * 4 << 11 | 0 + j1 * 4 << 7 | k1 * 8 + l1;
|
||||
short short1 = 128;
|
||||
double d14 = 0.25D;
|
||||
double d15 = d10;
|
||||
double d16 = (d11 - d10) * d14;
|
||||
|
||||
for (int k2 = 0; k2 < 4; ++k2) {
|
||||
int l2 = 0;
|
||||
|
||||
if (k1 * 8 + l1 < b1) {
|
||||
l2 = Block.STATIONARY_LAVA.id;
|
||||
}
|
||||
|
||||
if (d15 > 0.0D) {
|
||||
l2 = Block.NETHERRACK.id;
|
||||
}
|
||||
|
||||
abyte[j2] = (byte) l2;
|
||||
j2 += short1;
|
||||
d15 += d16;
|
||||
}
|
||||
|
||||
d10 += d12;
|
||||
d11 += d13;
|
||||
}
|
||||
|
||||
d1 += d5;
|
||||
d2 += d6;
|
||||
d3 += d7;
|
||||
d4 += d8;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
public void b(int i, int j, byte[] abyte) {
|
||||
byte b0 = 64;
|
||||
double d0 = 0.03125D;
|
||||
|
||||
this.q = this.m.a(this.q, i * 16, j * 16, 0, 16, 16, 1, d0, d0, 1.0D);
|
||||
this.r = this.m.a(this.r, i * 16, 109, j * 16, 16, 1, 16, d0, 1.0D, d0);
|
||||
this.s = this.n.a(this.s, i * 16, j * 16, 0, 16, 16, 1, d0 * 2.0D, d0 * 2.0D, d0 * 2.0D);
|
||||
|
||||
for (int k = 0; k < 16; ++k) {
|
||||
for (int l = 0; l < 16; ++l) {
|
||||
boolean flag = this.q[k + l * 16] + this.i.nextDouble() * 0.2D > 0.0D;
|
||||
boolean flag1 = this.r[k + l * 16] + this.i.nextDouble() * 0.2D > 0.0D;
|
||||
int i1 = (int) (this.s[k + l * 16] / 3.0D + 3.0D + this.i.nextDouble() * 0.25D);
|
||||
int j1 = -1;
|
||||
byte b1 = (byte) Block.NETHERRACK.id;
|
||||
byte b2 = (byte) Block.NETHERRACK.id;
|
||||
|
||||
for (int k1 = 127; k1 >= 0; --k1) {
|
||||
int l1 = (l * 16 + k) * 128 + k1;
|
||||
|
||||
if (k1 >= 127 - this.i.nextInt(5)) {
|
||||
abyte[l1] = (byte) Block.BEDROCK.id;
|
||||
} else if (k1 <= 0 + this.i.nextInt(5)) {
|
||||
abyte[l1] = (byte) Block.BEDROCK.id;
|
||||
} else {
|
||||
byte b3 = abyte[l1];
|
||||
|
||||
if (b3 == 0) {
|
||||
j1 = -1;
|
||||
} else if (b3 == Block.NETHERRACK.id) {
|
||||
if (j1 == -1) {
|
||||
if (i1 <= 0) {
|
||||
b1 = 0;
|
||||
b2 = (byte) Block.NETHERRACK.id;
|
||||
} else if (k1 >= b0 - 4 && k1 <= b0 + 1) {
|
||||
b1 = (byte) Block.NETHERRACK.id;
|
||||
b2 = (byte) Block.NETHERRACK.id;
|
||||
if (flag1) {
|
||||
b1 = (byte) Block.GRAVEL.id;
|
||||
}
|
||||
|
||||
if (flag1) {
|
||||
b2 = (byte) Block.NETHERRACK.id;
|
||||
}
|
||||
|
||||
if (flag) {
|
||||
b1 = (byte) Block.SOUL_SAND.id;
|
||||
}
|
||||
|
||||
if (flag) {
|
||||
b2 = (byte) Block.SOUL_SAND.id;
|
||||
}
|
||||
}
|
||||
|
||||
if (k1 < b0 && b1 == 0) {
|
||||
b1 = (byte) Block.STATIONARY_LAVA.id;
|
||||
}
|
||||
|
||||
j1 = i1;
|
||||
if (k1 >= b0 - 1) {
|
||||
abyte[l1] = b1;
|
||||
} else {
|
||||
abyte[l1] = b2;
|
||||
}
|
||||
} else if (j1 > 0) {
|
||||
--j1;
|
||||
abyte[l1] = b2;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
public Chunk getChunkAt(int i, int j) {
|
||||
return this.getOrCreateChunk(i, j);
|
||||
}
|
||||
|
||||
public Chunk getOrCreateChunk(int i, int j) {
|
||||
this.i.setSeed((long) i * 341873128712L + (long) j * 132897987541L);
|
||||
byte[] abyte = new byte['\u8000'];
|
||||
|
||||
this.a(i, j, abyte);
|
||||
this.b(i, j, abyte);
|
||||
this.t.a(this, this.o, i, j, abyte);
|
||||
this.c.a(this, this.o, i, j, abyte);
|
||||
Chunk chunk = new Chunk(this.o, abyte, i, j);
|
||||
|
||||
chunk.m();
|
||||
return chunk;
|
||||
}
|
||||
|
||||
private double[] a(double[] adouble, int i, int j, int k, int l, int i1, int j1) {
|
||||
if (adouble == null) {
|
||||
adouble = new double[l * i1 * j1];
|
||||
}
|
||||
|
||||
double d0 = 684.412D;
|
||||
double d1 = 2053.236D;
|
||||
|
||||
this.g = this.a.a(this.g, i, j, k, l, 1, j1, 1.0D, 0.0D, 1.0D);
|
||||
this.h = this.b.a(this.h, i, j, k, l, 1, j1, 100.0D, 0.0D, 100.0D);
|
||||
this.d = this.l.a(this.d, i, j, k, l, i1, j1, d0 / 80.0D, d1 / 60.0D, d0 / 80.0D);
|
||||
this.e = this.j.a(this.e, i, j, k, l, i1, j1, d0, d1, d0);
|
||||
this.f = this.k.a(this.f, i, j, k, l, i1, j1, d0, d1, d0);
|
||||
int k1 = 0;
|
||||
int l1 = 0;
|
||||
double[] adouble1 = new double[i1];
|
||||
|
||||
int i2;
|
||||
|
||||
for (i2 = 0; i2 < i1; ++i2) {
|
||||
adouble1[i2] = Math.cos((double) i2 * 3.141592653589793D * 6.0D / (double) i1) * 2.0D;
|
||||
double d2 = (double) i2;
|
||||
|
||||
if (i2 > i1 / 2) {
|
||||
d2 = (double) (i1 - 1 - i2);
|
||||
}
|
||||
|
||||
if (d2 < 4.0D) {
|
||||
d2 = 4.0D - d2;
|
||||
adouble1[i2] -= d2 * d2 * d2 * 10.0D;
|
||||
}
|
||||
}
|
||||
|
||||
for (i2 = 0; i2 < l; ++i2) {
|
||||
for (int j2 = 0; j2 < j1; ++j2) {
|
||||
double d3 = (this.g[l1] + 256.0D) / 512.0D;
|
||||
|
||||
if (d3 > 1.0D) {
|
||||
d3 = 1.0D;
|
||||
}
|
||||
|
||||
double d4 = 0.0D;
|
||||
double d5 = this.h[l1] / 8000.0D;
|
||||
|
||||
if (d5 < 0.0D) {
|
||||
d5 = -d5;
|
||||
}
|
||||
|
||||
d5 = d5 * 3.0D - 3.0D;
|
||||
if (d5 < 0.0D) {
|
||||
d5 /= 2.0D;
|
||||
if (d5 < -1.0D) {
|
||||
d5 = -1.0D;
|
||||
}
|
||||
|
||||
d5 /= 1.4D;
|
||||
d5 /= 2.0D;
|
||||
d3 = 0.0D;
|
||||
} else {
|
||||
if (d5 > 1.0D) {
|
||||
d5 = 1.0D;
|
||||
}
|
||||
|
||||
d5 /= 6.0D;
|
||||
}
|
||||
|
||||
d3 += 0.5D;
|
||||
d5 = d5 * (double) i1 / 16.0D;
|
||||
++l1;
|
||||
|
||||
for (int k2 = 0; k2 < i1; ++k2) {
|
||||
double d6 = 0.0D;
|
||||
double d7 = adouble1[k2];
|
||||
double d8 = this.e[k1] / 512.0D;
|
||||
double d9 = this.f[k1] / 512.0D;
|
||||
double d10 = (this.d[k1] / 10.0D + 1.0D) / 2.0D;
|
||||
|
||||
if (d10 < 0.0D) {
|
||||
d6 = d8;
|
||||
} else if (d10 > 1.0D) {
|
||||
d6 = d9;
|
||||
} else {
|
||||
d6 = d8 + (d9 - d8) * d10;
|
||||
}
|
||||
|
||||
d6 -= d7;
|
||||
double d11;
|
||||
|
||||
if (k2 > i1 - 4) {
|
||||
d11 = (double) ((float) (k2 - (i1 - 4)) / 3.0F);
|
||||
d6 = d6 * (1.0D - d11) + -10.0D * d11;
|
||||
}
|
||||
|
||||
if ((double) k2 < d4) {
|
||||
d11 = (d4 - (double) k2) / 4.0D;
|
||||
if (d11 < 0.0D) {
|
||||
d11 = 0.0D;
|
||||
}
|
||||
|
||||
if (d11 > 1.0D) {
|
||||
d11 = 1.0D;
|
||||
}
|
||||
|
||||
d6 = d6 * (1.0D - d11) + -10.0D * d11;
|
||||
}
|
||||
|
||||
adouble[k1] = d6;
|
||||
++k1;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return adouble;
|
||||
}
|
||||
|
||||
public boolean isChunkLoaded(int i, int j) {
|
||||
return true;
|
||||
}
|
||||
|
||||
public void getChunkAt(IChunkProvider ichunkprovider, int i, int j) {
|
||||
BlockSand.instaFall = true;
|
||||
int k = i * 16;
|
||||
int l = j * 16;
|
||||
|
||||
this.c.a(this.o, this.i, i, j);
|
||||
|
||||
int i1;
|
||||
int j1;
|
||||
int k1;
|
||||
int l1;
|
||||
|
||||
for (i1 = 0; i1 < 8; ++i1) {
|
||||
j1 = k + this.i.nextInt(16) + 8;
|
||||
k1 = this.i.nextInt(120) + 4;
|
||||
l1 = l + this.i.nextInt(16) + 8;
|
||||
(new WorldGenHellLava(Block.LAVA.id)).a(this.o, this.i, j1, k1, l1);
|
||||
}
|
||||
|
||||
i1 = this.i.nextInt(this.i.nextInt(10) + 1) + 1;
|
||||
|
||||
int i2;
|
||||
|
||||
for (j1 = 0; j1 < i1; ++j1) {
|
||||
k1 = k + this.i.nextInt(16) + 8;
|
||||
l1 = this.i.nextInt(120) + 4;
|
||||
i2 = l + this.i.nextInt(16) + 8;
|
||||
(new WorldGenFire()).a(this.o, this.i, k1, l1, i2);
|
||||
}
|
||||
|
||||
i1 = this.i.nextInt(this.i.nextInt(10) + 1);
|
||||
|
||||
for (j1 = 0; j1 < i1; ++j1) {
|
||||
k1 = k + this.i.nextInt(16) + 8;
|
||||
l1 = this.i.nextInt(120) + 4;
|
||||
i2 = l + this.i.nextInt(16) + 8;
|
||||
(new WorldGenLightStone1()).a(this.o, this.i, k1, l1, i2);
|
||||
}
|
||||
|
||||
for (j1 = 0; j1 < 10; ++j1) {
|
||||
k1 = k + this.i.nextInt(16) + 8;
|
||||
l1 = this.i.nextInt(128);
|
||||
i2 = l + this.i.nextInt(16) + 8;
|
||||
(new WorldGenLightStone2()).a(this.o, this.i, k1, l1, i2);
|
||||
}
|
||||
|
||||
if (this.i.nextInt(1) == 0) {
|
||||
j1 = k + this.i.nextInt(16) + 8;
|
||||
k1 = this.i.nextInt(128);
|
||||
l1 = l + this.i.nextInt(16) + 8;
|
||||
(new WorldGenFlowers(Block.BROWN_MUSHROOM.id)).a(this.o, this.i, j1, k1, l1);
|
||||
}
|
||||
|
||||
if (this.i.nextInt(1) == 0) {
|
||||
j1 = k + this.i.nextInt(16) + 8;
|
||||
k1 = this.i.nextInt(128);
|
||||
l1 = l + this.i.nextInt(16) + 8;
|
||||
(new WorldGenFlowers(Block.RED_MUSHROOM.id)).a(this.o, this.i, j1, k1, l1);
|
||||
}
|
||||
|
||||
BlockSand.instaFall = false;
|
||||
}
|
||||
|
||||
public boolean saveChunks(boolean flag, IProgressUpdate iprogressupdate) {
|
||||
return true;
|
||||
}
|
||||
|
||||
public boolean unloadChunks() {
|
||||
return false;
|
||||
}
|
||||
|
||||
public boolean canSave() {
|
||||
return true;
|
||||
}
|
||||
|
||||
public List getMobsFor(EnumCreatureType enumcreaturetype, int i, int j, int k) {
|
||||
if (enumcreaturetype == EnumCreatureType.MONSTER && this.c.a(i, j, k)) {
|
||||
return this.c.b();
|
||||
} else {
|
||||
BiomeBase biomebase = this.o.getBiome(i, k);
|
||||
|
||||
return biomebase == null ? null : biomebase.getMobs(enumcreaturetype);
|
||||
}
|
||||
}
|
||||
|
||||
public ChunkPosition findNearestMapFeature(World world, String s, int i, int j, int k) {
|
||||
return null;
|
||||
}
|
||||
}
|
||||
296
src/main/java/net/minecraft/server/ChunkProviderTheEnd.java
Normale Datei
296
src/main/java/net/minecraft/server/ChunkProviderTheEnd.java
Normale Datei
@ -0,0 +1,296 @@
|
||||
package net.minecraft.server;
|
||||
|
||||
import java.util.List;
|
||||
import java.util.Random;
|
||||
|
||||
public class ChunkProviderTheEnd implements IChunkProvider {
|
||||
|
||||
private Random i;
|
||||
private NoiseGeneratorOctaves j;
|
||||
private NoiseGeneratorOctaves k;
|
||||
private NoiseGeneratorOctaves l;
|
||||
public NoiseGeneratorOctaves a;
|
||||
public NoiseGeneratorOctaves b;
|
||||
private World m;
|
||||
private double[] n;
|
||||
private BiomeBase[] o;
|
||||
double[] c;
|
||||
double[] d;
|
||||
double[] e;
|
||||
double[] f;
|
||||
double[] g;
|
||||
int[][] h = new int[32][32];
|
||||
|
||||
public ChunkProviderTheEnd(World world, long i) {
|
||||
this.m = world;
|
||||
this.i = new Random(i);
|
||||
this.j = new NoiseGeneratorOctaves(this.i, 16);
|
||||
this.k = new NoiseGeneratorOctaves(this.i, 16);
|
||||
this.l = new NoiseGeneratorOctaves(this.i, 8);
|
||||
this.a = new NoiseGeneratorOctaves(this.i, 10);
|
||||
this.b = new NoiseGeneratorOctaves(this.i, 16);
|
||||
}
|
||||
|
||||
public void a(int i, int j, byte[] abyte, BiomeBase[] abiomebase) {
|
||||
byte b0 = 2;
|
||||
int k = b0 + 1;
|
||||
byte b1 = 33;
|
||||
int l = b0 + 1;
|
||||
|
||||
this.n = this.a(this.n, i * b0, 0, j * b0, k, b1, l);
|
||||
|
||||
for (int i1 = 0; i1 < b0; ++i1) {
|
||||
for (int j1 = 0; j1 < b0; ++j1) {
|
||||
for (int k1 = 0; k1 < 32; ++k1) {
|
||||
double d0 = 0.25D;
|
||||
double d1 = this.n[((i1 + 0) * l + j1 + 0) * b1 + k1 + 0];
|
||||
double d2 = this.n[((i1 + 0) * l + j1 + 1) * b1 + k1 + 0];
|
||||
double d3 = this.n[((i1 + 1) * l + j1 + 0) * b1 + k1 + 0];
|
||||
double d4 = this.n[((i1 + 1) * l + j1 + 1) * b1 + k1 + 0];
|
||||
double d5 = (this.n[((i1 + 0) * l + j1 + 0) * b1 + k1 + 1] - d1) * d0;
|
||||
double d6 = (this.n[((i1 + 0) * l + j1 + 1) * b1 + k1 + 1] - d2) * d0;
|
||||
double d7 = (this.n[((i1 + 1) * l + j1 + 0) * b1 + k1 + 1] - d3) * d0;
|
||||
double d8 = (this.n[((i1 + 1) * l + j1 + 1) * b1 + k1 + 1] - d4) * d0;
|
||||
|
||||
for (int l1 = 0; l1 < 4; ++l1) {
|
||||
double d9 = 0.125D;
|
||||
double d10 = d1;
|
||||
double d11 = d2;
|
||||
double d12 = (d3 - d1) * d9;
|
||||
double d13 = (d4 - d2) * d9;
|
||||
|
||||
for (int i2 = 0; i2 < 8; ++i2) {
|
||||
int j2 = i2 + i1 * 8 << 11 | 0 + j1 * 8 << 7 | k1 * 4 + l1;
|
||||
short short1 = 128;
|
||||
double d14 = 0.125D;
|
||||
double d15 = d10;
|
||||
double d16 = (d11 - d10) * d14;
|
||||
|
||||
for (int k2 = 0; k2 < 8; ++k2) {
|
||||
int l2 = 0;
|
||||
|
||||
if (d15 > 0.0D) {
|
||||
l2 = Block.WHITESTONE.id;
|
||||
}
|
||||
|
||||
abyte[j2] = (byte) l2;
|
||||
j2 += short1;
|
||||
d15 += d16;
|
||||
}
|
||||
|
||||
d10 += d12;
|
||||
d11 += d13;
|
||||
}
|
||||
|
||||
d1 += d5;
|
||||
d2 += d6;
|
||||
d3 += d7;
|
||||
d4 += d8;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
public void b(int i, int j, byte[] abyte, BiomeBase[] abiomebase) {
|
||||
for (int k = 0; k < 16; ++k) {
|
||||
for (int l = 0; l < 16; ++l) {
|
||||
byte b0 = 1;
|
||||
int i1 = -1;
|
||||
byte b1 = (byte) Block.WHITESTONE.id;
|
||||
byte b2 = (byte) Block.WHITESTONE.id;
|
||||
|
||||
for (int j1 = 127; j1 >= 0; --j1) {
|
||||
int k1 = (l * 16 + k) * 128 + j1;
|
||||
byte b3 = abyte[k1];
|
||||
|
||||
if (b3 == 0) {
|
||||
i1 = -1;
|
||||
} else if (b3 == Block.STONE.id) {
|
||||
if (i1 == -1) {
|
||||
if (b0 <= 0) {
|
||||
b1 = 0;
|
||||
b2 = (byte) Block.WHITESTONE.id;
|
||||
}
|
||||
|
||||
i1 = b0;
|
||||
if (j1 >= 0) {
|
||||
abyte[k1] = b1;
|
||||
} else {
|
||||
abyte[k1] = b2;
|
||||
}
|
||||
} else if (i1 > 0) {
|
||||
--i1;
|
||||
abyte[k1] = b2;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
public Chunk getChunkAt(int i, int j) {
|
||||
return this.getOrCreateChunk(i, j);
|
||||
}
|
||||
|
||||
public Chunk getOrCreateChunk(int i, int j) {
|
||||
this.i.setSeed((long) i * 341873128712L + (long) j * 132897987541L);
|
||||
byte[] abyte = new byte['\u8000'];
|
||||
|
||||
this.o = this.m.getWorldChunkManager().getBiomeBlock(this.o, i * 16, j * 16, 16, 16);
|
||||
this.a(i, j, abyte, this.o);
|
||||
this.b(i, j, abyte, this.o);
|
||||
Chunk chunk = new Chunk(this.m, abyte, i, j);
|
||||
|
||||
chunk.initLighting();
|
||||
return chunk;
|
||||
}
|
||||
|
||||
private double[] a(double[] adouble, int i, int j, int k, int l, int i1, int j1) {
|
||||
if (adouble == null) {
|
||||
adouble = new double[l * i1 * j1];
|
||||
}
|
||||
|
||||
double d0 = 684.412D;
|
||||
double d1 = 684.412D;
|
||||
|
||||
this.f = this.a.a(this.f, i, k, l, j1, 1.121D, 1.121D, 0.5D);
|
||||
this.g = this.b.a(this.g, i, k, l, j1, 200.0D, 200.0D, 0.5D);
|
||||
d0 *= 2.0D;
|
||||
this.c = this.l.a(this.c, i, j, k, l, i1, j1, d0 / 80.0D, d1 / 160.0D, d0 / 80.0D);
|
||||
this.d = this.j.a(this.d, i, j, k, l, i1, j1, d0, d1, d0);
|
||||
this.e = this.k.a(this.e, i, j, k, l, i1, j1, d0, d1, d0);
|
||||
int k1 = 0;
|
||||
int l1 = 0;
|
||||
|
||||
for (int i2 = 0; i2 < l; ++i2) {
|
||||
for (int j2 = 0; j2 < j1; ++j2) {
|
||||
double d2 = (this.f[l1] + 256.0D) / 512.0D;
|
||||
|
||||
if (d2 > 1.0D) {
|
||||
d2 = 1.0D;
|
||||
}
|
||||
|
||||
double d3 = this.g[l1] / 8000.0D;
|
||||
|
||||
if (d3 < 0.0D) {
|
||||
d3 = -d3 * 0.3D;
|
||||
}
|
||||
|
||||
d3 = d3 * 3.0D - 2.0D;
|
||||
float f = (float) (i2 + i - 0) / 1.0F;
|
||||
float f1 = (float) (j2 + k - 0) / 1.0F;
|
||||
float f2 = 100.0F - MathHelper.c(f * f + f1 * f1) * 8.0F;
|
||||
|
||||
if (f2 > 80.0F) {
|
||||
f2 = 80.0F;
|
||||
}
|
||||
|
||||
if (f2 < -100.0F) {
|
||||
f2 = -100.0F;
|
||||
}
|
||||
|
||||
if (d3 > 1.0D) {
|
||||
d3 = 1.0D;
|
||||
}
|
||||
|
||||
d3 /= 8.0D;
|
||||
d3 = 0.0D;
|
||||
if (d2 < 0.0D) {
|
||||
d2 = 0.0D;
|
||||
}
|
||||
|
||||
d2 += 0.5D;
|
||||
d3 = d3 * (double) i1 / 16.0D;
|
||||
++l1;
|
||||
double d4 = (double) i1 / 2.0D;
|
||||
|
||||
for (int k2 = 0; k2 < i1; ++k2) {
|
||||
double d5 = 0.0D;
|
||||
double d6 = ((double) k2 - d4) * 8.0D / d2;
|
||||
|
||||
if (d6 < 0.0D) {
|
||||
d6 *= -1.0D;
|
||||
}
|
||||
|
||||
double d7 = this.d[k1] / 512.0D;
|
||||
double d8 = this.e[k1] / 512.0D;
|
||||
double d9 = (this.c[k1] / 10.0D + 1.0D) / 2.0D;
|
||||
|
||||
if (d9 < 0.0D) {
|
||||
d5 = d7;
|
||||
} else if (d9 > 1.0D) {
|
||||
d5 = d8;
|
||||
} else {
|
||||
d5 = d7 + (d8 - d7) * d9;
|
||||
}
|
||||
|
||||
d5 -= 8.0D;
|
||||
d5 += (double) f2;
|
||||
byte b0 = 2;
|
||||
double d10;
|
||||
|
||||
if (k2 > i1 / 2 - b0) {
|
||||
d10 = (double) ((float) (k2 - (i1 / 2 - b0)) / 64.0F);
|
||||
if (d10 < 0.0D) {
|
||||
d10 = 0.0D;
|
||||
}
|
||||
|
||||
if (d10 > 1.0D) {
|
||||
d10 = 1.0D;
|
||||
}
|
||||
|
||||
d5 = d5 * (1.0D - d10) + -3000.0D * d10;
|
||||
}
|
||||
|
||||
b0 = 8;
|
||||
if (k2 < b0) {
|
||||
d10 = (double) ((float) (b0 - k2) / ((float) b0 - 1.0F));
|
||||
d5 = d5 * (1.0D - d10) + -30.0D * d10;
|
||||
}
|
||||
|
||||
adouble[k1] = d5;
|
||||
++k1;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return adouble;
|
||||
}
|
||||
|
||||
public boolean isChunkLoaded(int i, int j) {
|
||||
return true;
|
||||
}
|
||||
|
||||
public void getChunkAt(IChunkProvider ichunkprovider, int i, int j) {
|
||||
BlockSand.instaFall = true;
|
||||
int k = i * 16;
|
||||
int l = j * 16;
|
||||
BiomeBase biomebase = this.m.getBiome(k + 16, l + 16);
|
||||
|
||||
biomebase.a(this.m, this.m.random, k, l);
|
||||
BlockSand.instaFall = false;
|
||||
}
|
||||
|
||||
public boolean saveChunks(boolean flag, IProgressUpdate iprogressupdate) {
|
||||
return true;
|
||||
}
|
||||
|
||||
public boolean unloadChunks() {
|
||||
return false;
|
||||
}
|
||||
|
||||
public boolean canSave() {
|
||||
return true;
|
||||
}
|
||||
|
||||
public List getMobsFor(EnumCreatureType enumcreaturetype, int i, int j, int k) {
|
||||
BiomeBase biomebase = this.m.getBiome(i, k);
|
||||
|
||||
return biomebase == null ? null : biomebase.getMobs(enumcreaturetype);
|
||||
}
|
||||
|
||||
public ChunkPosition findNearestMapFeature(World world, String s, int i, int j, int k) {
|
||||
return null;
|
||||
}
|
||||
}
|
||||
Laden…
In neuem Issue referenzieren
Einen Benutzer sperren