Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Check in generated code for test-schemas. Amends #297 #303

Merged
merged 1 commit into from
Jan 28, 2025
Merged

Check in generated code for test-schemas. Amends #297 #303

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions ...s/src/main/scala/testdomains/codepropertygraphminified/traversals/TraversalCallBase.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
4 changes: 2 additions & 2 deletions ...c/main/scala/testdomains/codepropertygraphminified/traversals/TraversalCallreprBase.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
4 changes: 2 additions & 2 deletions ...ain/scala/testdomains/codepropertygraphminified/traversals/TraversalDeclarationBase.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
4 changes: 2 additions & 2 deletions ...cala/testdomains/codepropertygraphminified/traversals/TraversalPropertyDispatchType.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
4 changes: 2 additions & 2 deletions ...c/main/scala/testdomains/codepropertygraphminified/traversals/TraversalPropertyName.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
4 changes: 2 additions & 2 deletions ...mas-domain-classes/src/main/scala/testdomains/generic/traversals/TraversalNodeaBase.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
4 changes: 2 additions & 2 deletions ...sses/src/main/scala/testdomains/generic/traversals/TraversalPropertyStringMandatory.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
4 changes: 2 additions & 2 deletions ...main-classes/src/main/scala/testdomains/gratefuldead/traversals/TraversalArtistBase.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
4 changes: 2 additions & 2 deletions ...in-classes/src/main/scala/testdomains/gratefuldead/traversals/TraversalPropertyName.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
4 changes: 2 additions & 2 deletions ...domain-classes/src/main/scala/testdomains/gratefuldead/traversals/TraversalSongBase.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
4 changes: 2 additions & 2 deletions ...in-classes/src/main/scala/testdomains/hierarchical/traversals/TraversalBasenodeBase.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
4 changes: 2 additions & 2 deletions ...in-classes/src/main/scala/testdomains/hierarchical/traversals/TraversalPropertyName.scala
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
Loading