fmt

joernio · Feb 5, 2024 · 30e3eea · 30e3eea
1 parent fc8d88d
commit 30e3eea
Show file tree

Hide file tree

Showing 4 changed files with 14 additions and 13 deletions.
diff --git a/core/src/main/scala/flatgraph/DiffGraphApplier.scala b/core/src/main/scala/flatgraph/DiffGraphApplier.scala
@@ -74,11 +74,13 @@ private[flatgraph] class DiffGraphApplier(graph: Graph, diff: DiffGraphBuilder)
             already
           case None =>
             val nodeKind = detached.nodeKind
-            assert (nodeKind < graph.schema.getNumberOfNodeKinds,
-              s"given nodeKind=$nodeKind does not fit into the graph schema, which only supports node kinds [0..${graph.schema.getNumberOfNodeKinds - 1}] (inclusive range)")
+            assert(
+              nodeKind < graph.schema.getNumberOfNodeKinds,
+              s"given nodeKind=$nodeKind does not fit into the graph schema, which only supports node kinds [0..${graph.schema.getNumberOfNodeKinds - 1}] (inclusive range)"
+            )
 
-            val seqId    = graph.nodeCountByKind(nodeKind) + Option(newNodes(nodeKind)).map { _.size }.getOrElse(0)
-            val res      = graph.schema.makeNode(graph, nodeKind, seqId)
+            val seqId = graph.nodeCountByKind(nodeKind) + Option(newNodes(nodeKind)).map { _.size }.getOrElse(0)
+            val res   = graph.schema.makeNode(graph, nodeKind, seqId)
             detached.storedRef = Some(res)
             insert(newNodes, detached, nodeKind)
             deferred.append(detached)
@@ -179,7 +181,7 @@ private[flatgraph] class DiffGraphApplier(graph: Graph, diff: DiffGraphBuilder)
 
   private def applyUpdate(): Unit = {
     splitUpdate()
-    
+
     // set edge properties
     for {
       nodeKind  <- Range(0, graph.schema.getNumberOfNodeKinds)

diff --git a/core/src/main/scala/flatgraph/Graph.scala b/core/src/main/scala/flatgraph/Graph.scala
@@ -44,7 +44,7 @@ class Graph(val schema: Schema, val storagePathMaybe: Option[Path] = None) exten
   private[flatgraph] val livingNodeCountByKind: Array[Int] = new Array[Int](nodeKindCount)
 
   /** Note: this included `deleted` nodes! You might want to use `livingNodeCountByKind` instead. */
-  private[flatgraph] def nodeCountByKind(kind: Int): Int   = nodesArray(kind).length
+  private[flatgraph] def nodeCountByKind(kind: Int): Int = nodesArray(kind).length
 
   private[flatgraph] val properties     = new Array[AnyRef](nodeKindCount * propertiesCount * PropertySlotSize)
   private[flatgraph] val inverseIndices = new AtomicReferenceArray[Object](nodeKindCount * propertiesCount * PropertySlotSize)

diff --git a/core/src/test/scala/flatgraph/GraphTests.scala b/core/src/test/scala/flatgraph/GraphTests.scala
@@ -831,4 +831,3 @@ class GraphTests extends AnyWordSpec with Matchers {
     g.nodesWithProperty("undefined", "foo").l shouldBe Nil
   }
 }
-
diff --git a/core/src/test/scala/flatgraph/TestHelpers.scala b/core/src/test/scala/flatgraph/TestHelpers.scala
@@ -24,12 +24,12 @@ object TestHelpers {
 
 object TestSchema {
   def make(
-            nodeKinds: Int,
-            edgeKinds: Int,
-            properties: Int = 0,
-            edgePropertyPrototypes: Array[AnyRef] = null,
-            nodePropertyPrototypes: Array[AnyRef] = null
-          ): Schema = {
+    nodeKinds: Int,
+    edgeKinds: Int,
+    properties: Int = 0,
+    edgePropertyPrototypes: Array[AnyRef] = null,
+    nodePropertyPrototypes: Array[AnyRef] = null
+  ): Schema = {
     new FreeSchema(
       nodeLabels = Range(0, nodeKinds).map { id => s"V${id}" }.toArray,
       edgeLabels = Range(0, edgeKinds).map { id => s"${id}" }.toArray,
Original file line number	Diff line number	Diff line change
Expand Up		@@ -831,4 +831,3 @@ class GraphTests extends AnyWordSpec with Matchers {
		g.nodesWithProperty("undefined", "foo").l shouldBe Nil
		}
		}