Skip to content

Commit d3a35e1

Browse files
bbrehmbbrehm
authored
oops, check in generated code for test-schemas. Amends #297 / a64ce01 (#303)
1 parent edabc69 commit d3a35e1

File tree

12 files changed

+24
-24
lines changed

12 files changed

+24
-24
lines changed

‎test-schemas-domain-classes/src/main/scala/testdomains/codepropertygraphminified/traversals/TraversalCallBase.scala‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -42,8 +42,8 @@ final class TraversalCallBase[NodeType <: nodes.CallBase](val traversal: Iterato
4242
traversal match {
4343
case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
4444
val someNode = init.next
45-
values.iterator.flatMap { v =>
46-
flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, v).asInstanceOf[Iterator[NodeType]]
45+
values.iterator.flatMap { value =>
46+
flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, value).asInstanceOf[Iterator[NodeType]]
4747
}
4848
case _ =>
4949
val valueSet = values.toSet

‎test-schemas-domain-classes/src/main/scala/testdomains/codepropertygraphminified/traversals/TraversalCallreprBase.scala‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -42,8 +42,8 @@ final class TraversalCallreprBase[NodeType <: nodes.CallReprBase](val traversal:
4242
traversal match {
4343
case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
4444
val someNode = init.next
45-
values.iterator.flatMap { v =>
46-
flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 1, v).asInstanceOf[Iterator[NodeType]]
45+
values.iterator.flatMap { value =>
46+
flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 1, value).asInstanceOf[Iterator[NodeType]]
4747
}
4848
case _ =>
4949
val valueSet = values.toSet

‎test-schemas-domain-classes/src/main/scala/testdomains/codepropertygraphminified/traversals/TraversalDeclarationBase.scala‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -42,8 +42,8 @@ final class TraversalDeclarationBase[NodeType <: nodes.DeclarationBase](val trav
4242
traversal match {
4343
case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
4444
val someNode = init.next
45-
values.iterator.flatMap { v =>
46-
flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 1, v).asInstanceOf[Iterator[NodeType]]
45+
values.iterator.flatMap { value =>
46+
flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 1, value).asInstanceOf[Iterator[NodeType]]
4747
}
4848
case _ =>
4949
val valueSet = values.toSet

‎test-schemas-domain-classes/src/main/scala/testdomains/codepropertygraphminified/traversals/TraversalPropertyDispatchType.scala‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -44,8 +44,8 @@ final class TraversalPropertyDispatchType[NodeType <: nodes.StoredNode & nodes.S
4444
traversal match {
4545
case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
4646
val someNode = init.next
47-
values.iterator.flatMap { v =>
48-
flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, v).asInstanceOf[Iterator[NodeType]]
47+
values.iterator.flatMap { value =>
48+
flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, value).asInstanceOf[Iterator[NodeType]]
4949
}
5050
case _ =>
5151
val valueSet = values.toSet

‎test-schemas-domain-classes/src/main/scala/testdomains/codepropertygraphminified/traversals/TraversalPropertyName.scala‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -43,8 +43,8 @@ final class TraversalPropertyName[NodeType <: nodes.StoredNode & nodes.StaticTyp
4343
traversal match {
4444
case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
4545
val someNode = init.next
46-
values.iterator.flatMap { v =>
47-
flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 1, v).asInstanceOf[Iterator[NodeType]]
46+
values.iterator.flatMap { value =>
47+
flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 1, value).asInstanceOf[Iterator[NodeType]]
4848
}
4949
case _ =>
5050
val valueSet = values.toSet

‎test-schemas-domain-classes/src/main/scala/testdomains/generic/traversals/TraversalNodeaBase.scala‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -162,8 +162,8 @@ final class TraversalNodeaBase[NodeType <: nodes.NodeABase](val traversal: Itera
162162
traversal match {
163163
case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
164164
val someNode = init.next
165-
values.iterator.flatMap { v =>
166-
flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 4, v).asInstanceOf[Iterator[NodeType]]
165+
values.iterator.flatMap { value =>
166+
flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 4, value).asInstanceOf[Iterator[NodeType]]
167167
}
168168
case _ =>
169169
val valueSet = values.toSet

‎test-schemas-domain-classes/src/main/scala/testdomains/generic/traversals/TraversalPropertyStringMandatory.scala‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -44,8 +44,8 @@ final class TraversalPropertyStringMandatory[NodeType <: nodes.StoredNode & node
4444
traversal match {
4545
case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
4646
val someNode = init.next
47-
values.iterator.flatMap { v =>
48-
flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 4, v).asInstanceOf[Iterator[NodeType]]
47+
values.iterator.flatMap { value =>
48+
flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 4, value).asInstanceOf[Iterator[NodeType]]
4949
}
5050
case _ =>
5151
val valueSet = values.toSet

‎test-schemas-domain-classes/src/main/scala/testdomains/gratefuldead/traversals/TraversalArtistBase.scala‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -42,8 +42,8 @@ final class TraversalArtistBase[NodeType <: nodes.ArtistBase](val traversal: Ite
4242
traversal match {
4343
case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
4444
val someNode = init.next
45-
values.iterator.flatMap { v =>
46-
flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, v).asInstanceOf[Iterator[NodeType]]
45+
values.iterator.flatMap { value =>
46+
flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, value).asInstanceOf[Iterator[NodeType]]
4747
}
4848
case _ =>
4949
val valueSet = values.toSet

‎test-schemas-domain-classes/src/main/scala/testdomains/gratefuldead/traversals/TraversalPropertyName.scala‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -43,8 +43,8 @@ final class TraversalPropertyName[NodeType <: nodes.StoredNode & nodes.StaticTyp
4343
traversal match {
4444
case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
4545
val someNode = init.next
46-
values.iterator.flatMap { v =>
47-
flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, v).asInstanceOf[Iterator[NodeType]]
46+
values.iterator.flatMap { value =>
47+
flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, value).asInstanceOf[Iterator[NodeType]]
4848
}
4949
case _ =>
5050
val valueSet = values.toSet

‎test-schemas-domain-classes/src/main/scala/testdomains/gratefuldead/traversals/TraversalSongBase.scala‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -42,8 +42,8 @@ final class TraversalSongBase[NodeType <: nodes.SongBase](val traversal: Iterato
4242
traversal match {
4343
case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
4444
val someNode = init.next
45-
values.iterator.flatMap { v =>
46-
flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, v).asInstanceOf[Iterator[NodeType]]
45+
values.iterator.flatMap { value =>
46+
flatgraph.Accessors.getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, value).asInstanceOf[Iterator[NodeType]]
4747
}
4848
case _ =>
4949
val valueSet = values.toSet

0 commit comments

Comments
 (0)