From 4d84ec2ed494ef9d258a10b765ec902a08cb7697 Mon Sep 17 00:00:00 2001
From: ionut <ionut.alex.parau@gmail.com>
Date: Sun, 3 May 2026 16:04:38 +0300
Subject: [PATCH] todo stuff

---
 TODO.md                                       | 27 ++-----
 .../neocomputers/network/DeviceNode.kt        |  4 --
 .../neocomputers/network/LocalNetwork.kt      | 70 -------------------
 3 files changed, 5 insertions(+), 96 deletions(-)
 delete mode 100644 src/main/kotlin/org/neoflock/neocomputers/network/LocalNetwork.kt

diff --git a/TODO.md b/TODO.md
index daa6a19..d403887 100644
--- a/TODO.md
+++ b/TODO.md
@@ -1,29 +1,12 @@
 # Networking
 > All that is left is optimization
 
-## ERADICATE DIRECT
+## Copy the networking optimizations of OC
+> https://github.com/MightyPirates/OpenComputers/blob/master-MC1.7.10/src/main/scala/li/cil/oc/server/network/Network.scala
 
-We only need NONE, SOME and NETWORK.
-
-## Optimize compute and memory
-> OC does this too
-
-Optimize both *time* and *memory* using graph theory.
-
-### Requirements
-
-It obviously must be fast and memory-efficient, and respect the current semantics.
-
-The current idea is to make NETWORK style nodes the only ones with a cache,
-and to instead appoint a connection that is also a NETWORK node, if any, as
-the one source of truth, or steal the source. This means only one node
-in a local network gets to actually compute the graph layout.
-Complications can happen when merges happen, the idea is to pick one source of truth
-then as well.
-
-Also, `onNodeAdded` and `onNodeRemoved` should also be called when a reachable node is added/removed.
-This is for perf. We only care about nodes being added/removed then.
-This can be done by broadcasting to all of their *connections*, to circumvent the NONE/SOME/NETWORK asymmetric reachability sets.
+We should implement this, as it not only makes behavior match better, but also optimizes
+it a lot. We do need to replace the NEIGHBORS rule with implementing the SOME visibility.
+A direct port is not needed, just taking heavy inspiration from OC.
 
 ## Optimize power balancing
 
diff --git a/src/main/kotlin/org/neoflock/neocomputers/network/DeviceNode.kt b/src/main/kotlin/org/neoflock/neocomputers/network/DeviceNode.kt
index 71f5737..5872ed9 100644
--- a/src/main/kotlin/org/neoflock/neocomputers/network/DeviceNode.kt
+++ b/src/main/kotlin/org/neoflock/neocomputers/network/DeviceNode.kt
@@ -40,10 +40,6 @@ open class DeviceNode(_address: UUID? = null) {
         return maximum
     }
 
-    val boundNetworks = HashSet<LocalNetwork>()
-    // meaningless except visibility is NETWORK, where there can only be one
-    fun getPrimaryNetwork() = boundNetworks.firstOrNull()
-
     fun getChargerNodes(): Set<DeviceNode> = getReachable().filter { it.powerRole != PowerRole.CONSUMER }.toSet()
     fun totalEnergyInConnections(): Long = getChargerNodes().fold(0) { acc, node -> acc + node.energy }
     fun maxEnergyInConnections(): Long = getChargerNodes().fold(0) { acc, node -> acc + node.energyCapacity }
diff --git a/src/main/kotlin/org/neoflock/neocomputers/network/LocalNetwork.kt b/src/main/kotlin/org/neoflock/neocomputers/network/LocalNetwork.kt
deleted file mode 100644
index 7fe5aba..0000000
--- a/src/main/kotlin/org/neoflock/neocomputers/network/LocalNetwork.kt
+++ /dev/null
@@ -1,70 +0,0 @@
-package org.neoflock.neocomputers.network
-
-class LocalNetwork(val sourceOfTruth: DeviceNode) {
-    val devices = HashSet<DeviceNode>()
-
-    fun getReachableByTruth() = sourceOfTruth.computeReachable()
-
-    fun performMerge(other: LocalNetwork) {
-        for(dev in other.devices) {
-            if(other in dev.boundNetworks) {
-                dev.boundNetworks.remove(other)
-                dev.boundNetworks.add(this)
-            }
-            devices.add(dev)
-        }
-        other.devices.clear()
-    }
-
-    fun addToNetwork(dev: DeviceNode) {
-        if(dev in devices) return
-        if(dev.reachability == Networking.Visibility.NETWORK) {
-            val primNet = dev.getPrimaryNetwork()
-            if(primNet != null) {
-                // Merge the networks!
-                // merge smallest into largest for perf
-                if(primNet.devices.size > devices.size) {
-                    primNet.performMerge(this)
-                } else {
-                    performMerge(primNet)
-                }
-                return
-            }
-        }
-
-        devices.add(dev)
-        dev.boundNetworks.add(this)
-
-        when(dev.reachability) {
-            Networking.Visibility.NONE -> return
-            Networking.Visibility.SOME -> {
-                dev.getPreferredFew().forEach { addToNetwork(it) }
-            }
-            Networking.Visibility.NETWORK -> {
-                dev.connections.forEach { addToNetwork(it) }
-            }
-        }
-    }
-
-    fun checkIfStillConnected(dev: DeviceNode) {
-        if(dev !in devices) return
-        if(dev in getReachableByTruth()) return
-        removeFromNetwork(dev)
-    }
-
-    fun removeFromNetwork(dev: DeviceNode) {
-        // TODO: this is wrong, rewrite it. We need it to make a sub-network.
-        if(dev == sourceOfTruth) {
-            throw UnsupportedOperationException("removing the source of truth is not supported")
-        }
-        if(dev !in devices) return
-        devices.remove(dev)
-        dev.boundNetworks.remove(this)
-
-        when(dev.reachability) {
-            Networking.Visibility.NONE -> {}
-            Networking.Visibility.SOME -> dev.getPreferredFew().forEach { removeFromNetwork(it) }
-            Networking.Visibility.NETWORK -> dev.connections.forEach { removeFromNetwork(it) }
-        }
-    }
-}
\ No newline at end of file