chore: small cleanup..

Author: quiteboring

src/main/java/org/cobalt/mixin/client/MinecraftMixin.java

@@ -1,5 +1,6 @@
 package org.cobalt.mixin.client;
 
+import java.util.List;
 import kotlin.Pair;
 import net.minecraft.client.Minecraft;
 import org.cobalt.api.addon.Addon;
@@ -10,7 +11,6 @@
 import org.spongepowered.asm.mixin.injection.At;
 import org.spongepowered.asm.mixin.injection.Inject;
 import org.spongepowered.asm.mixin.injection.callback.CallbackInfo;
-import java.util.List;
 
 @Mixin(Minecraft.class)
 public class MinecraftMixin {

src/main/kotlin/org/cobalt/api/event/EventBus.kt

@@ -1,22 +1,17 @@
 package org.cobalt.api.event
 
-import java.io.File
-import java.io.IOException
 import java.lang.invoke.LambdaMetafactory
 import java.lang.invoke.MethodHandles
 import java.lang.invoke.MethodType
 import java.lang.reflect.Method
-import java.net.URLDecoder
 import java.util.*
 import java.util.concurrent.ConcurrentHashMap
 import java.util.function.Consumer
-import java.util.zip.ZipFile
 import org.cobalt.api.event.annotation.SubscribeEvent
 
 object EventBus {
 
   private val listeners = ConcurrentHashMap<Class<*>, List<ListenerData>>()
-
   private val registered = ConcurrentHashMap.newKeySet<Any>()
   private val dynamicRunnable = ConcurrentHashMap<Class<out Event>, MutableList<(Event) -> Unit>>()
 

src/main/kotlin/org/cobalt/api/pathfinder/Node.kt

@@ -46,4 +46,5 @@ class Node(
 
     return this.depth.compareTo(other.depth)
   }
+
 }

src/main/kotlin/org/cobalt/api/pathfinder/PathExecutor.kt

@@ -174,4 +174,5 @@ object PathExecutor {
       )
     }
   }
+
 }

src/main/kotlin/org/cobalt/api/pathfinder/pathfinder/AStarPathfinder.kt

@@ -174,4 +174,5 @@ class AStarPathfinder(configuration: PathfinderConfiguration) : AbstractPathfind
     val openSetNodes: Long2ObjectMap<Node> = Long2ObjectOpenHashMap()
     val closedSet: LongSet = LongOpenHashSet()
   }
+
 }

src/main/kotlin/org/cobalt/api/pathfinder/pathfinder/AbstractPathfinder.kt

@@ -278,20 +278,16 @@ abstract class AbstractPathfinder(
   }
 
   protected abstract fun insertStartNode(node: Node, fCost: Double, openSet: PrimitiveMinHeap)
-
   protected abstract fun extractBestNode(openSet: PrimitiveMinHeap): Node
-
   protected abstract fun initializeSearch()
-
   protected abstract fun markNodeAsExpanded(node: Node)
-
   protected abstract fun performAlgorithmCleanup()
-
   protected abstract fun processSuccessors(
     requestStart: PathPosition,
     requestTarget: PathPosition,
     currentNode: Node,
     openSet: PrimitiveMinHeap,
     searchContext: SearchContext,
   )
+
 }

src/main/kotlin/org/cobalt/api/pathfinder/pathfinder/heap/PrimitiveMinHeap.kt

@@ -137,4 +137,5 @@ class PrimitiveMinHeap(initialCapacity: Int) {
     costs[current] = costToMove
     nodeToIndexMap.put(nodeToMove, current)
   }
+
 }

src/main/kotlin/org/cobalt/api/pathfinder/pathfinder/processing/EvaluationContextImpl.kt

@@ -48,4 +48,5 @@ class EvaluationContextImpl(
 
   override val grandparentPathPosition: PathPosition?
     get() = parentEngineNode?.parent?.position
+
 }

src/main/kotlin/org/cobalt/api/pathfinder/pathfinder/processing/SearchContextImpl.kt

@@ -15,4 +15,5 @@ class SearchContextImpl(
 ) : SearchContext {
 
   override val sharedData: MutableMap<String, Any> = HashMap()
+
 }

src/main/kotlin/org/cobalt/api/pathfinder/pathing/INeighborStrategy.kt

@@ -4,9 +4,10 @@ import org.cobalt.api.pathfinder.wrapper.PathPosition
 import org.cobalt.api.pathfinder.wrapper.PathVector
 
 fun interface INeighborStrategy {
-  fun getOffsets(): Iterable<PathVector>
 
+  fun getOffsets(): Iterable<PathVector>
   fun getOffsets(currentPosition: PathPosition): Iterable<PathVector> {
     return getOffsets()
   }
+
 }