DBot/KStarbound
DBot/KStarbound
3
0
Fork 0
Code Issues 1 Pull Requests Packages Projects Releases Wiki Activity

Don't create random

Browse Source
This commit is contained in:
DBotThePony 2023-09-09 17:18:47 +07:00
parent bc9896d327
commit 9ca98f10be
Signed by: DBot
GPG Key ID: DCC23B5715498507
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
src/main/kotlin/ru/dbotthepony/kstarbound/world/LightCalculator.kt
View File

@ -352,10 +352,10 @@ class LightCalculator(val parent: ICellAccess, val width: Int, val height: Int)
val clusterCount = threads.size.coerceAtMost(pointLights.size) val clusterCount = threads.size.coerceAtMost(pointLights.size)
val clusters = ArrayList<TaskCluster>(clusterCount) val clusters = ArrayList<TaskCluster>(clusterCount)
val startingPoints = IntArraySet() val startingPoints = IntArraySet()
val rand = Random(System.nanoTime()) // val rand = Random(System.nanoTime())
while (startingPoints.size < clusterCount) { while (startingPoints.size < clusterCount) {
//startingPoints.add(rand.nextInt(0, pointLights.size)) // startingPoints.add(rand.nextInt(0, pointLights.size))
startingPoints.add(startingPoints.size) startingPoints.add(startingPoints.size)
} }
@ -399,7 +399,7 @@ class LightCalculator(val parent: ICellAccess, val width: Int, val height: Int)
// check their centres of mass, and probably // check their centres of mass, and probably
// merge clusters which are too close to each other, // merge clusters which are too close to each other,
// to avoid excess work // to avoid excess work
// if we merge something, re-run k-clusters algorithm // if we merge something, re-run k-means algorithm
if (converged) { if (converged) {
for (cluster1 in clusters) { for (cluster1 in clusters) {
for (cluster2 in clusters) { for (cluster2 in clusters) {