Make energy cable graph track node + side in lively nodes list, considerably improving performance
This commit is contained in:
parent
d5e05a2439
commit
b8e76a0fd4
@ -3,6 +3,7 @@ package ru.dbotthepony.mc.otm.block.entity.cable
|
|||||||
import it.unimi.dsi.fastutil.objects.Reference2ObjectOpenHashMap
|
import it.unimi.dsi.fastutil.objects.Reference2ObjectOpenHashMap
|
||||||
import it.unimi.dsi.fastutil.objects.ReferenceArraySet
|
import it.unimi.dsi.fastutil.objects.ReferenceArraySet
|
||||||
import it.unimi.dsi.fastutil.objects.ReferenceLinkedOpenHashSet
|
import it.unimi.dsi.fastutil.objects.ReferenceLinkedOpenHashSet
|
||||||
|
import net.minecraft.core.Direction
|
||||||
import org.apache.logging.log4j.LogManager
|
import org.apache.logging.log4j.LogManager
|
||||||
import ru.dbotthepony.mc.otm.SERVER_IS_LIVE
|
import ru.dbotthepony.mc.otm.SERVER_IS_LIVE
|
||||||
import ru.dbotthepony.mc.otm.UNIVERSE_TICKS
|
import ru.dbotthepony.mc.otm.UNIVERSE_TICKS
|
||||||
@ -74,16 +75,20 @@ private class LinkedPriorityQueue<T : Comparable<T>> {
|
|||||||
}
|
}
|
||||||
|
|
||||||
class EnergyCableGraph : GraphNodeList<EnergyCableBlockEntity.Node, EnergyCableGraph>() {
|
class EnergyCableGraph : GraphNodeList<EnergyCableBlockEntity.Node, EnergyCableGraph>() {
|
||||||
private val livelyNodes = HashSet<EnergyCableBlockEntity.Node>()
|
private val livelyNodes = HashSet<Pair<EnergyCableBlockEntity.Node, RelativeSide>>()
|
||||||
private val livelyNodesList = ArrayList<EnergyCableBlockEntity.Node>()
|
private val livelyNodesList = ArrayList<Pair<EnergyCableBlockEntity.Node, RelativeSide>>()
|
||||||
|
|
||||||
fun addLivelyNode(node: EnergyCableBlockEntity.Node) {
|
fun addLivelyNode(node: EnergyCableBlockEntity.Node) {
|
||||||
when (contains(node)) {
|
when (contains(node)) {
|
||||||
ContainsStatus.ABOUT_TO_BE_REMOVED, ContainsStatus.ABOUT_TO_BE_ADDED -> { } // do nothing
|
ContainsStatus.ABOUT_TO_BE_REMOVED, ContainsStatus.ABOUT_TO_BE_ADDED -> { } // do nothing
|
||||||
ContainsStatus.DOES_NOT_BELONG -> throw IllegalArgumentException("$node does not belong to $this")
|
ContainsStatus.DOES_NOT_BELONG -> throw IllegalArgumentException("$node does not belong to $this")
|
||||||
ContainsStatus.CONTAINS -> {
|
ContainsStatus.CONTAINS -> {
|
||||||
if (livelyNodes.add(node)) {
|
for (dir in RelativeSide.entries) {
|
||||||
livelyNodesList.add(node)
|
val pair = node to dir
|
||||||
|
|
||||||
|
if (livelyNodes.add(pair)) {
|
||||||
|
livelyNodesList.add(pair)
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@ -584,8 +589,12 @@ class EnergyCableGraph : GraphNodeList<EnergyCableBlockEntity.Node, EnergyCableG
|
|||||||
}
|
}
|
||||||
|
|
||||||
override fun onNodeRemoved(node: EnergyCableBlockEntity.Node) {
|
override fun onNodeRemoved(node: EnergyCableBlockEntity.Node) {
|
||||||
if (livelyNodes.remove(node)) {
|
for (dir in RelativeSide.entries) {
|
||||||
check(livelyNodesList.remove(node))
|
val pair = node to dir
|
||||||
|
|
||||||
|
if (livelyNodes.remove(pair)) {
|
||||||
|
check(livelyNodesList.remove(pair))
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
val touchedSegments = HashSet<Segment>()
|
val touchedSegments = HashSet<Segment>()
|
||||||
@ -608,8 +617,11 @@ class EnergyCableGraph : GraphNodeList<EnergyCableBlockEntity.Node, EnergyCableG
|
|||||||
}
|
}
|
||||||
|
|
||||||
override fun onNodeAdded(node: EnergyCableBlockEntity.Node) {
|
override fun onNodeAdded(node: EnergyCableBlockEntity.Node) {
|
||||||
check(livelyNodes.add(node))
|
for (dir in RelativeSide.entries) {
|
||||||
livelyNodesList.add(node)
|
val pair = node to dir
|
||||||
|
check(livelyNodes.add(pair))
|
||||||
|
livelyNodesList.add(pair)
|
||||||
|
}
|
||||||
|
|
||||||
notifyThroughputsChanged()
|
notifyThroughputsChanged()
|
||||||
}
|
}
|
||||||
@ -622,98 +634,97 @@ class EnergyCableGraph : GraphNodeList<EnergyCableBlockEntity.Node, EnergyCableG
|
|||||||
var residue = howMuch.coerceAtMost(fromNode.energyThroughput)
|
var residue = howMuch.coerceAtMost(fromNode.energyThroughput)
|
||||||
val snapshot = Reference2ObjectOpenHashMap<Segment, Decimal>()
|
val snapshot = Reference2ObjectOpenHashMap<Segment, Decimal>()
|
||||||
|
|
||||||
for (node in itr) {
|
for (pair in itr) {
|
||||||
var hit = false
|
val (node, relSide) = pair
|
||||||
|
val side = node.sides[relSide]!!
|
||||||
|
|
||||||
for (side in node.sides.values) {
|
if (!side.isEnabled) {
|
||||||
if (!side.isEnabled)
|
itr.remove()
|
||||||
continue
|
check(livelyNodes.remove(pair)) { "Lively nodes Set does not contain $pair" }
|
||||||
else if (fromNode === node && side.side === fromSide) {
|
continue
|
||||||
hit = true
|
} else if (fromNode === node && side.side === fromSide) {
|
||||||
continue
|
continue
|
||||||
}
|
|
||||||
|
|
||||||
val it = side.neighbour.get() ?: continue
|
|
||||||
if (it is EnergyCableBlockEntity.CableSide) continue
|
|
||||||
|
|
||||||
val paths = getPath(fromNode, node, it.receiveEnergy(residue, true), !simulate)
|
|
||||||
hit = true
|
|
||||||
|
|
||||||
if (paths.size == 1) {
|
|
||||||
// Single path, fast scenario
|
|
||||||
val path = paths[0]
|
|
||||||
val pathTransferred = path.transfer(residue, simulate, snapshot)
|
|
||||||
if (pathTransferred <= Decimal.ZERO) continue
|
|
||||||
val thisReceived = it.receiveEnergy(pathTransferred, simulate)
|
|
||||||
|
|
||||||
// If cable transferred more than machine accepted, then "refund" energy
|
|
||||||
// so cables record actual value transferred through them
|
|
||||||
if (thisReceived != pathTransferred) {
|
|
||||||
path.refund(pathTransferred - thisReceived, simulate, snapshot)
|
|
||||||
|
|
||||||
if (!simulate && thisReceived != Decimal.ZERO) {
|
|
||||||
path.triggerBlockstateUpdates()
|
|
||||||
}
|
|
||||||
} else if (!simulate) {
|
|
||||||
path.triggerBlockstateUpdates()
|
|
||||||
}
|
|
||||||
|
|
||||||
received += thisReceived
|
|
||||||
residue -= thisReceived
|
|
||||||
if (!residue.isPositive) return received
|
|
||||||
} else if (paths.size >= 2) {
|
|
||||||
// Multiple paths, a bit more complicated
|
|
||||||
// Determine how much machine is likely to accept
|
|
||||||
val potentiallyAccepted = it.receiveEnergy(residue, true)
|
|
||||||
|
|
||||||
// Won't accept anything
|
|
||||||
if (potentiallyAccepted <= Decimal.ZERO) continue
|
|
||||||
|
|
||||||
// Now determine combined available throughput
|
|
||||||
// Make a copy of snapshot, so we can freely write into it
|
|
||||||
val copy = snapshot.clone()
|
|
||||||
var calcResidue = potentiallyAccepted
|
|
||||||
|
|
||||||
// TODO: Currently, all transfers cause Braess's paradox, because of greedy selection of "fastest" cable
|
|
||||||
// Need to implement heuristics to better distribute load across different paths/segments
|
|
||||||
for (path in paths) {
|
|
||||||
val passed = path.transfer(calcResidue, true, copy)
|
|
||||||
calcResidue -= passed
|
|
||||||
if (calcResidue <= Decimal.ZERO) break
|
|
||||||
}
|
|
||||||
|
|
||||||
if (calcResidue == potentiallyAccepted) {
|
|
||||||
// мда
|
|
||||||
continue
|
|
||||||
}
|
|
||||||
|
|
||||||
var thisReceived = it.receiveEnergy(potentiallyAccepted - calcResidue, simulate)
|
|
||||||
received += thisReceived
|
|
||||||
residue -= thisReceived
|
|
||||||
|
|
||||||
for (path in paths) {
|
|
||||||
val passed = path.transfer(thisReceived, simulate, snapshot)
|
|
||||||
|
|
||||||
if (!simulate)
|
|
||||||
path.triggerBlockstateUpdates()
|
|
||||||
|
|
||||||
thisReceived -= passed
|
|
||||||
if (thisReceived <= Decimal.ZERO) break
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!residue.isPositive) return received
|
|
||||||
//check(thisReceived <= Decimal.ZERO) { "Путом, алло, Путом, какого чёрта Путом? Путом почему ты заблокировал логику, а Путом?" }
|
|
||||||
|
|
||||||
if (thisReceived > Decimal.ZERO) {
|
|
||||||
LOGGER.warn("Cable path from $fromNode to $node doesn't follow common sense, disabling.")
|
|
||||||
paths.forEach { it.shortCircuit = true }
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
if (!hit) {
|
val it = side.neighbour.get()
|
||||||
|
|
||||||
|
if (it == null || it is EnergyCableBlockEntity.CableSide) {
|
||||||
itr.remove()
|
itr.remove()
|
||||||
check(livelyNodes.remove(node)) { "Lively nodes Set does not contain $node" }
|
check(livelyNodes.remove(pair)) { "Lively nodes Set does not contain $pair" }
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
|
||||||
|
val paths = getPath(fromNode, node, it.receiveEnergy(residue, true), !simulate)
|
||||||
|
|
||||||
|
if (paths.size == 1) {
|
||||||
|
// Single path, fast scenario
|
||||||
|
val path = paths[0]
|
||||||
|
val pathTransferred = path.transfer(residue, simulate, snapshot)
|
||||||
|
if (pathTransferred <= Decimal.ZERO) continue
|
||||||
|
val thisReceived = it.receiveEnergy(pathTransferred, simulate)
|
||||||
|
|
||||||
|
// If cable transferred more than machine accepted, then "refund" energy
|
||||||
|
// so cables record actual value transferred through them
|
||||||
|
if (thisReceived != pathTransferred) {
|
||||||
|
path.refund(pathTransferred - thisReceived, simulate, snapshot)
|
||||||
|
|
||||||
|
if (!simulate && thisReceived != Decimal.ZERO) {
|
||||||
|
path.triggerBlockstateUpdates()
|
||||||
|
}
|
||||||
|
} else if (!simulate) {
|
||||||
|
path.triggerBlockstateUpdates()
|
||||||
|
}
|
||||||
|
|
||||||
|
received += thisReceived
|
||||||
|
residue -= thisReceived
|
||||||
|
if (!residue.isPositive) return received
|
||||||
|
} else if (paths.size >= 2) {
|
||||||
|
// Multiple paths, a bit more complicated
|
||||||
|
// Determine how much machine is likely to accept
|
||||||
|
val potentiallyAccepted = it.receiveEnergy(residue, true)
|
||||||
|
|
||||||
|
// Won't accept anything
|
||||||
|
if (potentiallyAccepted <= Decimal.ZERO) continue
|
||||||
|
|
||||||
|
// Now determine combined available throughput
|
||||||
|
// Make a copy of snapshot, so we can freely write into it
|
||||||
|
val copy = snapshot.clone()
|
||||||
|
var calcResidue = potentiallyAccepted
|
||||||
|
|
||||||
|
// TODO: Currently, all transfers cause Braess's paradox, because of greedy selection of "fastest" cable
|
||||||
|
// Need to implement heuristics to better distribute load across different paths/segments
|
||||||
|
for (path in paths) {
|
||||||
|
val passed = path.transfer(calcResidue, true, copy)
|
||||||
|
calcResidue -= passed
|
||||||
|
if (calcResidue <= Decimal.ZERO) break
|
||||||
|
}
|
||||||
|
|
||||||
|
if (calcResidue == potentiallyAccepted) {
|
||||||
|
// мда
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
|
||||||
|
var thisReceived = it.receiveEnergy(potentiallyAccepted - calcResidue, simulate)
|
||||||
|
received += thisReceived
|
||||||
|
residue -= thisReceived
|
||||||
|
|
||||||
|
for (path in paths) {
|
||||||
|
val passed = path.transfer(thisReceived, simulate, snapshot)
|
||||||
|
|
||||||
|
if (!simulate)
|
||||||
|
path.triggerBlockstateUpdates()
|
||||||
|
|
||||||
|
thisReceived -= passed
|
||||||
|
if (thisReceived <= Decimal.ZERO) break
|
||||||
|
}
|
||||||
|
|
||||||
|
if (!residue.isPositive) return received
|
||||||
|
//check(thisReceived <= Decimal.ZERO) { "Путом, алло, Путом, какого чёрта Путом? Путом почему ты заблокировал логику, а Путом?" }
|
||||||
|
|
||||||
|
if (thisReceived > Decimal.ZERO) {
|
||||||
|
LOGGER.warn("Cable path from $fromNode to $node doesn't follow common sense, disabling.")
|
||||||
|
paths.forEach { it.shortCircuit = true }
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user