mirrors/Terra
1
0
Fork 0
mirror of https://github.com/PolyhedralDev/Terra.git synced 2026-04-04 06:46:21 +00:00
Code Issues Packages Projects Releases Wiki Activity

Implement fauna configuration

Browse Source
This commit is contained in:
dfsek
2020-09-11 02:25:23 -07:00
parent 7d7705464b
commit a27e50e01b
13 changed files with 328 additions and 47 deletions
Download Patch File Download Diff File Expand all files Collapse all files

39
src/test/java/DistributionTest.java Normal file
View File

@@ -0,0 +1,39 @@
import com.dfsek.terra.biome.BiomeZone;
import org.polydev.gaea.math.FastNoise;
import java.util.Random;
public class DistributionTest {
public static void main(String[] args) {
FastNoise noise = new FastNoise(new Random().nextInt());
noise.setFrequency(0.01f);
noise.setNoiseType(FastNoise.NoiseType.SimplexFractal);
noise.setFractalOctaves(3);
int[] numbers = new int[32];
double min = Integer.MAX_VALUE;
double max = Integer.MIN_VALUE;
for(int i = 0; i < 32; i++) {
numbers[i] = 0;
}
for(int i = 0; i < 10000000; i++) {
double n = noise.getSimplexFractal(0, i);
max = Math.max(max, n);
min = Math.min(min, n);
numbers[BiomeZone.normalize(n)]++;
}
for(int i = 0; i < 32; i++) {
System.out.println(i + ": " + numbers[i]);
}
for(int i = 0; i < 32; i++) {
System.out.print(i + " |");
for(int j = 0; j < numbers[i]/2500; j++) {
System.out.print("-");
}
System.out.println("|");
}
System.out.println("max: " + max);
System.out.println("min: " + min);
}
}

92
src/test/java/LookupGenerator.java Normal file
View File

@@ -0,0 +1,92 @@
import com.dfsek.terra.biome.BiomeZone;
import org.polydev.gaea.math.FastNoise;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Random;
public class LookupGenerator {
private static double[] lookup;
public static void main(String[] args) {
int dist = 32;
List<Double> vals = new ArrayList<>();
FastNoise noise = new FastNoise(new Random().nextInt());
noise.setFrequency(0.01f);
noise.setNoiseType(FastNoise.NoiseType.SimplexFractal);
noise.setFractalOctaves(5);
int[] numbers = new int[dist];
double min = Integer.MAX_VALUE;
double max = Integer.MIN_VALUE;
for(int i = 0; i < dist; i++) {
numbers[i] = 0;
}
for(int i = 0; i < 10000000; i++) {
double n = noise.getSimplexFractal(0, i);
max = Math.max(max, n);
min = Math.min(min, n);
vals.add(n);
numbers[normalize(n, dist)]++;
}
for(int i = 0; i < dist; i++) {
System.out.println(i + ": " + numbers[i]);
}
for(int i = 0; i < dist; i++) {
System.out.print(i + (String.valueOf(i).length() ==1 ? " " : "") + " |");
for(int j = 0; j < numbers[i]/3000; j++) {
System.out.print("-");
}
System.out.println("|");
}
System.out.println("max: " + max);
System.out.println("min: " + min);
Collections.sort(vals);
lookup = new double[dist];
StringBuilder s = new StringBuilder("{");
for(int i = 0; i < dist; i++) {
int current = vals.size()/dist;
System.out.println(i + ", max: " + vals.get(current*(i+1)-1));
lookup[i] = vals.get(current*(i+1)-1);
s.append(vals.get(current*(i+1)-1) + "D, ");
}
s.delete(s.length()-2, s.length());
s.append("}");
numbers = new int[dist];
vals = new ArrayList<>();
for(int i = 0; i < 10000000; i++) {
double n = noise.getSimplexFractal(0, i);
vals.add(n);
numbers[normalizeNew(n)]++;
}
for(int i = 0; i < dist; i++) {
System.out.println(i + ": " + numbers[i]);
}
for(int i = 0; i < dist; i++) {
System.out.print(i + (String.valueOf(i).length() ==1 ? " " : "") + " |");
for(int j = 0; j < numbers[i]/3000; j++) {
System.out.print("-");
}
System.out.println("|");
}
System.out.println(s.toString());
}
public static int normalize(double i, int n) {
i*=1.42; // Magic simplex value (sqrt(2) plus a little)
i = Math.min(Math.max(i, -1),1);
return Math.min((int) Math.floor((i+1)*((double)n/2)), n-1);
}
public static int normalizeNew(double d) {
for(int i = 0; i < lookup.length; i++) {
if(d < lookup[i]) return i;
}
return lookup.length-1;
}
}