oops, check in generated code for test-schemas. Amends #297 / a64ce01 (…

…#303)
joernio · Jan 28, 2025 · d3a35e1 · d3a35e1
1 parent edabc69
commit d3a35e1
Show file tree

Hide file tree

Showing 12 changed files with 24 additions and 24 deletions.
diff --git a/...s/src/main/scala/testdomains/codepropertygraphminified/traversals/TraversalCallBase.scala b/...s/src/main/scala/testdomains/codepropertygraphminified/traversals/TraversalCallBase.scala
@@ -42,8 +42,8 @@ final class TraversalCallBase[NodeType <: nodes.CallBase](val traversal: Iterato
     traversal match {
       case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
         val someNode = init.next
-        values.iterator.flatMap { v =>
-          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, v).asInstanceOf[Iterator[NodeType]]
+        values.iterator.flatMap { value =>
+          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, value).asInstanceOf[Iterator[NodeType]]
         }
       case _ =>
         val valueSet = values.toSet

diff --git a/...c/main/scala/testdomains/codepropertygraphminified/traversals/TraversalCallreprBase.scala b/...c/main/scala/testdomains/codepropertygraphminified/traversals/TraversalCallreprBase.scala
@@ -42,8 +42,8 @@ final class TraversalCallreprBase[NodeType <: nodes.CallReprBase](val traversal:
     traversal match {
       case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
         val someNode = init.next
-        values.iterator.flatMap { v =>
-          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 1, v).asInstanceOf[Iterator[NodeType]]
+        values.iterator.flatMap { value =>
+          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 1, value).asInstanceOf[Iterator[NodeType]]
         }
       case _ =>
         val valueSet = values.toSet

diff --git a/...ain/scala/testdomains/codepropertygraphminified/traversals/TraversalDeclarationBase.scala b/...ain/scala/testdomains/codepropertygraphminified/traversals/TraversalDeclarationBase.scala
@@ -42,8 +42,8 @@ final class TraversalDeclarationBase[NodeType <: nodes.DeclarationBase](val trav
     traversal match {
       case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
         val someNode = init.next
-        values.iterator.flatMap { v =>
-          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 1, v).asInstanceOf[Iterator[NodeType]]
+        values.iterator.flatMap { value =>
+          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 1, value).asInstanceOf[Iterator[NodeType]]
         }
       case _ =>
         val valueSet = values.toSet

diff --git a/...cala/testdomains/codepropertygraphminified/traversals/TraversalPropertyDispatchType.scala b/...cala/testdomains/codepropertygraphminified/traversals/TraversalPropertyDispatchType.scala
@@ -44,8 +44,8 @@ final class TraversalPropertyDispatchType[NodeType <: nodes.StoredNode & nodes.S
     traversal match {
       case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
         val someNode = init.next
-        values.iterator.flatMap { v =>
-          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, v).asInstanceOf[Iterator[NodeType]]
+        values.iterator.flatMap { value =>
+          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, value).asInstanceOf[Iterator[NodeType]]
         }
       case _ =>
         val valueSet = values.toSet

diff --git a/...c/main/scala/testdomains/codepropertygraphminified/traversals/TraversalPropertyName.scala b/...c/main/scala/testdomains/codepropertygraphminified/traversals/TraversalPropertyName.scala
@@ -43,8 +43,8 @@ final class TraversalPropertyName[NodeType <: nodes.StoredNode & nodes.StaticTyp
     traversal match {
       case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
         val someNode = init.next
-        values.iterator.flatMap { v =>
-          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 1, v).asInstanceOf[Iterator[NodeType]]
+        values.iterator.flatMap { value =>
+          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 1, value).asInstanceOf[Iterator[NodeType]]
         }
       case _ =>
         val valueSet = values.toSet

diff --git a/...mas-domain-classes/src/main/scala/testdomains/generic/traversals/TraversalNodeaBase.scala b/...mas-domain-classes/src/main/scala/testdomains/generic/traversals/TraversalNodeaBase.scala
@@ -162,8 +162,8 @@ final class TraversalNodeaBase[NodeType <: nodes.NodeABase](val traversal: Itera
     traversal match {
       case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
         val someNode = init.next
-        values.iterator.flatMap { v =>
-          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 4, v).asInstanceOf[Iterator[NodeType]]
+        values.iterator.flatMap { value =>
+          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 4, value).asInstanceOf[Iterator[NodeType]]
         }
       case _ =>
         val valueSet = values.toSet

diff --git a/...sses/src/main/scala/testdomains/generic/traversals/TraversalPropertyStringMandatory.scala b/...sses/src/main/scala/testdomains/generic/traversals/TraversalPropertyStringMandatory.scala
@@ -44,8 +44,8 @@ final class TraversalPropertyStringMandatory[NodeType <: nodes.StoredNode & node
     traversal match {
       case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
         val someNode = init.next
-        values.iterator.flatMap { v =>
-          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 4, v).asInstanceOf[Iterator[NodeType]]
+        values.iterator.flatMap { value =>
+          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 4, value).asInstanceOf[Iterator[NodeType]]
         }
       case _ =>
         val valueSet = values.toSet

diff --git a/...main-classes/src/main/scala/testdomains/gratefuldead/traversals/TraversalArtistBase.scala b/...main-classes/src/main/scala/testdomains/gratefuldead/traversals/TraversalArtistBase.scala
@@ -42,8 +42,8 @@ final class TraversalArtistBase[NodeType <: nodes.ArtistBase](val traversal: Ite
     traversal match {
       case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
         val someNode = init.next
-        values.iterator.flatMap { v =>
-          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, v).asInstanceOf[Iterator[NodeType]]
+        values.iterator.flatMap { value =>
+          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, value).asInstanceOf[Iterator[NodeType]]
         }
       case _ =>
         val valueSet = values.toSet

diff --git a/...in-classes/src/main/scala/testdomains/gratefuldead/traversals/TraversalPropertyName.scala b/...in-classes/src/main/scala/testdomains/gratefuldead/traversals/TraversalPropertyName.scala
@@ -43,8 +43,8 @@ final class TraversalPropertyName[NodeType <: nodes.StoredNode & nodes.StaticTyp
     traversal match {
       case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
         val someNode = init.next
-        values.iterator.flatMap { v =>
-          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, v).asInstanceOf[Iterator[NodeType]]
+        values.iterator.flatMap { value =>
+          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, value).asInstanceOf[Iterator[NodeType]]
         }
       case _ =>
         val valueSet = values.toSet

diff --git a/...domain-classes/src/main/scala/testdomains/gratefuldead/traversals/TraversalSongBase.scala b/...domain-classes/src/main/scala/testdomains/gratefuldead/traversals/TraversalSongBase.scala
@@ -42,8 +42,8 @@ final class TraversalSongBase[NodeType <: nodes.SongBase](val traversal: Iterato
     traversal match {
       case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
         val someNode = init.next
-        values.iterator.flatMap { v =>
-          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, v).asInstanceOf[Iterator[NodeType]]
+        values.iterator.flatMap { value =>
+          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, value).asInstanceOf[Iterator[NodeType]]
         }
       case _ =>
         val valueSet = values.toSet

diff --git a/...in-classes/src/main/scala/testdomains/hierarchical/traversals/TraversalBasenodeBase.scala b/...in-classes/src/main/scala/testdomains/hierarchical/traversals/TraversalBasenodeBase.scala
@@ -42,8 +42,8 @@ final class TraversalBasenodeBase[NodeType <: nodes.BaseNodeBase](val traversal:
     traversal match {
       case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
         val someNode = init.next
-        values.iterator.flatMap { v =>
-          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, v).asInstanceOf[Iterator[NodeType]]
+        values.iterator.flatMap { value =>
+          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, value).asInstanceOf[Iterator[NodeType]]
         }
       case _ =>
         val valueSet = values.toSet

diff --git a/...in-classes/src/main/scala/testdomains/hierarchical/traversals/TraversalPropertyName.scala b/...in-classes/src/main/scala/testdomains/hierarchical/traversals/TraversalPropertyName.scala
@@ -43,8 +43,8 @@ final class TraversalPropertyName[NodeType <: nodes.StoredNode & nodes.StaticTyp
     traversal match {
       case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
         val someNode = init.next
-        values.iterator.flatMap { v =>
-          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, v).asInstanceOf[Iterator[NodeType]]
+        values.iterator.flatMap { value =>
+          flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, value).asInstanceOf[Iterator[NodeType]]
         }
       case _ =>
         val valueSet = values.toSet