From ac963b4fe9df0a24024241296966ad89ebe61f61 Mon Sep 17 00:00:00 2001 From: Markus Lottmann Date: Wed, 22 Jul 2026 18:08:57 +0200 Subject: [PATCH] Move to scala 3.8.3 and target JDK 17. --- MODULE.bazel | 14 ++--- MODULE.bazel.lock | 4 +- bazel/java.bzl | 2 +- bazel/scala.bzl | 2 +- build.sbt | 8 +-- .../traversals/TraversalAnnotationBase.scala | 8 +-- .../TraversalAnnotationliteralBase.scala | 4 +- .../traversals/TraversalAstnodeBase.scala | 4 +- .../traversals/TraversalBindingBase.scala | 12 ++-- .../traversals/TraversalBlockBase.scala | 4 +- .../traversals/TraversalCallBase.scala | 14 ++--- .../traversals/TraversalCallreprBase.scala | 8 +-- .../TraversalClosurebindingBase.scala | 6 +- .../traversals/TraversalCommentBase.scala | 4 +- .../traversals/TraversalConfigfileBase.scala | 8 +-- .../TraversalControlstructureBase.scala | 8 +-- .../traversals/TraversalDeclarationBase.scala | 4 +- .../traversals/TraversalDependencyBase.scala | 10 ++-- .../traversals/TraversalExpressionBase.scala | 4 +- .../TraversalFieldidentifierBase.scala | 4 +- .../traversals/TraversalFileBase.scala | 10 ++-- .../traversals/TraversalIdentifierBase.scala | 8 +-- .../traversals/TraversalImportBase.scala | 4 +- .../traversals/TraversalJumplabelBase.scala | 8 +-- .../traversals/TraversalJumptargetBase.scala | 8 +-- .../TraversalKeyvaluepairBase.scala | 8 +-- .../traversals/TraversalLiteralBase.scala | 4 +- .../traversals/TraversalLocalBase.scala | 10 ++-- .../traversals/TraversalMemberBase.scala | 16 ++--- .../traversals/TraversalMetadataBase.scala | 14 ++--- .../traversals/TraversalMethodBase.scala | 26 ++++----- .../TraversalMethodparameterinBase.scala | 10 ++-- .../TraversalMethodparameteroutBase.scala | 8 +-- .../traversals/TraversalMethodrefBase.scala | 8 +-- .../TraversalMethodreturnBase.scala | 8 +-- .../traversals/TraversalModifierBase.scala | 4 +- .../traversals/TraversalNamespaceBase.scala | 4 +- .../TraversalNamespaceblockBase.scala | 12 ++-- .../TraversalPropertyAliasTypeFullName.scala | 2 +- .../TraversalPropertyArgumentLabel.scala | 2 +- .../TraversalPropertyArgumentName.scala | 2 +- .../TraversalPropertyAstParentFullName.scala | 4 +- .../TraversalPropertyAstParentType.scala | 4 +- .../TraversalPropertyCanonicalName.scala | 4 +- .../TraversalPropertyClosureBindingId.scala | 2 +- .../traversals/TraversalPropertyCode.scala | 4 +- .../TraversalPropertyContainedRef.scala | 4 +- .../traversals/TraversalPropertyContent.scala | 4 +- ...raversalPropertyControlStructureType.scala | 4 +- .../TraversalPropertyDependencyGroupId.scala | 2 +- .../TraversalPropertyDispatchType.scala | 4 +- .../TraversalPropertyEvaluationStrategy.scala | 4 +- .../TraversalPropertyFilename.scala | 4 +- .../TraversalPropertyFullName.scala | 4 +- .../TraversalPropertyGenericSignature.scala | 4 +- .../traversals/TraversalPropertyHash.scala | 2 +- .../TraversalPropertyImportedAs.scala | 2 +- .../TraversalPropertyImportedEntity.scala | 2 +- .../traversals/TraversalPropertyKey.scala | 4 +- .../TraversalPropertyLanguage.scala | 4 +- .../TraversalPropertyMethodFullName.scala | 4 +- .../TraversalPropertyModifierType.scala | 4 +- .../traversals/TraversalPropertyName.scala | 4 +- .../TraversalPropertyParserTypeName.scala | 4 +- .../traversals/TraversalPropertyRoot.scala | 4 +- .../TraversalPropertySignature.scala | 4 +- .../TraversalPropertyStaticReceiver.scala | 2 +- .../TraversalPropertyTypeDeclFullName.scala | 4 +- .../TraversalPropertyTypeFullName.scala | 4 +- .../traversals/TraversalPropertyValue.scala | 4 +- .../traversals/TraversalPropertyVersion.scala | 4 +- .../traversals/TraversalTagBase.scala | 8 +-- .../traversals/TraversalTemplatedomBase.scala | 4 +- .../traversals/TraversalTypeBase.scala | 12 ++-- .../traversals/TraversalTypedeclBase.scala | 26 ++++----- .../TraversalTypeparameterBase.scala | 4 +- .../traversals/TraversalTyperefBase.scala | 4 +- .../traversals/TraversalUnknownBase.scala | 12 ++-- maven_install.json | 58 +++++++++---------- schema/BUILD | 2 +- schema2json/BUILD | 6 +- schema2json/src/main/scala/Schema2Json.scala | 16 ++--- 82 files changed, 285 insertions(+), 283 deletions(-) diff --git a/MODULE.bazel b/MODULE.bazel index 0a49800cd..62c41a795 100644 --- a/MODULE.bazel +++ b/MODULE.bazel @@ -6,7 +6,7 @@ bazel_dep(name = "rules_jvm_external", version = "7.0") bazel_dep(name = "aspect_rules_lint", version = "2.5.2") bazel_dep(name = "buildifier_prebuilt", version = "8.5.1.2") -BAZEL_TOOLING_VERSION = "a07fda4f8bc736081ad9921831bc9973e77e6e19" +BAZEL_TOOLING_VERSION = "4bcf42cc81b574b91699d696b504637677640871" git_override( module_name = "bazel_tooling", @@ -14,14 +14,14 @@ git_override( remote = "git@github.com:joernio/bazel_tooling.git", ) -bazel_dep(name = "rules_scala", version = "7.2.4") +bazel_dep(name = "rules_scala", version = "7.2.5") scala_config = use_extension( "@rules_scala//scala/extensions:config.bzl", "scala_config", ) scala_config.settings( - scala_version = "3.7.4", + scala_version = "3.8.3", ) scala_deps = use_extension( @@ -38,10 +38,10 @@ maven.install( name = "maven", artifacts = [ "org.slf4j:slf4j-api:2.0.17", - "io.joern:flatgraph-core_3:0.1.31", - "io.joern:flatgraph-help_3:0.1.31", - "io.joern:flatgraph-domain-classes-generator_3:0.1.31", - "io.joern:flatgraph-odb-convert_3:0.1.31", + "io.joern:flatgraph-core_3:0.1.34", + "io.joern:flatgraph-help_3:0.1.34", + "io.joern:flatgraph-domain-classes-generator_3:0.1.34", + "io.joern:flatgraph-odb-convert_3:0.1.34", "net.sf.trove4j:core:3.1.0", "com.google.protobuf:protobuf-java:4.34.1", "org.json4s:json4s-native_3:4.0.3", diff --git a/MODULE.bazel.lock b/MODULE.bazel.lock index 9816f50f0..6896caac8 100644 --- a/MODULE.bazel.lock +++ b/MODULE.bazel.lock @@ -312,8 +312,8 @@ "https://bcr.bazel.build/modules/rules_rust/0.45.1/MODULE.bazel": "a69d0db3a958fab2c6520961e1b2287afcc8b36690fd31bbc4f6f7391397150d", "https://bcr.bazel.build/modules/rules_rust/0.67.0/MODULE.bazel": "87c3816c4321352dcfd9e9e26b58e84efc5b21351ae3ef8fb5d0d57bde7237f5", "https://bcr.bazel.build/modules/rules_rust/0.67.0/source.json": "a8ef4d3be30eb98e060cad9e5875a55b603195487f76e01b619b51a1df4641cc", - "https://bcr.bazel.build/modules/rules_scala/7.2.4/MODULE.bazel": "12f23fa4ab6ec5c32ea6d16991d33903ab2e6817a2dba4bf20ee1c3c0cbad228", - "https://bcr.bazel.build/modules/rules_scala/7.2.4/source.json": "a54b3306e4dd935b3514a38f914e2a2075e6047861e5b0674fb53955b40d5e6d", + "https://bcr.bazel.build/modules/rules_scala/7.2.5/MODULE.bazel": "c5f0ee85f6c6a081a19be8a54f34ba2c2e49adeea1e7d64600bb591c27007de3", + "https://bcr.bazel.build/modules/rules_scala/7.2.5/source.json": "25be05ededbad97a8eee6e6bc3353aeee2d39402c606c019a87b1655dcdd8175", "https://bcr.bazel.build/modules/rules_shell/0.1.2/MODULE.bazel": "66e4ca3ce084b04af0b9ff05ff14cab4e5df7503973818bb91cbc6cda08d32fc", "https://bcr.bazel.build/modules/rules_shell/0.2.0/MODULE.bazel": "fda8a652ab3c7d8fee214de05e7a9916d8b28082234e8d2c0094505c5268ed3c", "https://bcr.bazel.build/modules/rules_shell/0.3.0/MODULE.bazel": "de4402cd12f4cc8fda2354fce179fdb068c0b9ca1ec2d2b17b3e21b24c1a937b", diff --git a/bazel/java.bzl b/bazel/java.bzl index 9bb02b445..ab4ecf0b4 100644 --- a/bazel/java.bzl +++ b/bazel/java.bzl @@ -4,7 +4,7 @@ _rules = make_java_rules( java_common_opts = [ "-g", "--release", - "11", + "17", "-Xlint:all", "-Xlint:-cast", "-XepDisableAllChecks", diff --git a/bazel/scala.bzl b/bazel/scala.bzl index a7655381f..00a561066 100644 --- a/bazel/scala.bzl +++ b/bazel/scala.bzl @@ -1,7 +1,7 @@ load("@bazel_tooling//:scala_rule_factory.bzl", "make_scala_rules") _rules = make_scala_rules( - scala_version = "3.7.4", + scala_version = "3.8.3", common_scalacopts = [ "-java-output-version", "17", diff --git a/build.sbt b/build.sbt index 293880a71..f3177dcf1 100644 --- a/build.sbt +++ b/build.sbt @@ -1,12 +1,12 @@ name := "codepropertygraph" // parsed by project/Versions.scala, updated by updateDependencies.sh -val flatgraphVersion = "0.1.32" +val flatgraphVersion = "0.1.34" inThisBuild( List( organization := "io.shiftleft", - scalaVersion := "3.7.4", + scalaVersion := "3.8.3", resolvers ++= Seq(Resolver.mavenLocal, "Sonatype OSS" at "https://oss.sonatype.org/content/repositories/public"), packageDoc / publishArtifact := true, packageSrc / publishArtifact := true, @@ -56,7 +56,7 @@ lazy val codepropertygraph = Projects.codepropertygraph lazy val schema2json = Projects.schema2json ThisBuild / scalacOptions ++= Seq( - "-release", "8", + "-release", "17", "-deprecation", "-feature", // "-explain", @@ -70,7 +70,7 @@ ThisBuild / scalacOptions ++= Seq( ThisBuild / javacOptions ++= Seq( "-g", // debug symbols - "--release", "8" + "--release", "17" ) Global / onChangedBuildSource := ReloadOnSourceChanges diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalAnnotationBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalAnnotationBase.scala index 84567fce9..13b1fb40c 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalAnnotationBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalAnnotationBase.scala @@ -31,7 +31,7 @@ final class TraversalAnnotationBase[NodeType <: nodes.AnnotationBase](val traver */ def fullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) .asInstanceOf[Iterator[NodeType]] @@ -44,7 +44,7 @@ final class TraversalAnnotationBase[NodeType <: nodes.AnnotationBase](val traver if (values.length == 1) return fullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) @@ -99,7 +99,7 @@ final class TraversalAnnotationBase[NodeType <: nodes.AnnotationBase](val traver */ def nameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) .asInstanceOf[Iterator[NodeType]] @@ -112,7 +112,7 @@ final class TraversalAnnotationBase[NodeType <: nodes.AnnotationBase](val traver if (values.length == 1) return nameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalAnnotationliteralBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalAnnotationliteralBase.scala index cb98ead99..9a5fe6e72 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalAnnotationliteralBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalAnnotationliteralBase.scala @@ -31,7 +31,7 @@ final class TraversalAnnotationliteralBase[NodeType <: nodes.AnnotationLiteralBa */ def nameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) .asInstanceOf[Iterator[NodeType]] @@ -44,7 +44,7 @@ final class TraversalAnnotationliteralBase[NodeType <: nodes.AnnotationLiteralBa if (values.length == 1) return nameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalAstnodeBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalAstnodeBase.scala index 649c4ae60..afbb4f751 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalAstnodeBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalAstnodeBase.scala @@ -30,7 +30,7 @@ final class TraversalAstnodeBase[NodeType <: nodes.AstNodeBase](val traversal: I */ def codeExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 8, value) .asInstanceOf[Iterator[NodeType]] @@ -43,7 +43,7 @@ final class TraversalAstnodeBase[NodeType <: nodes.AstNodeBase](val traversal: I if (values.length == 1) return codeExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 8, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalBindingBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalBindingBase.scala index 653f333b0..1ca5170fc 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalBindingBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalBindingBase.scala @@ -30,7 +30,7 @@ final class TraversalBindingBase[NodeType <: nodes.BindingBase](val traversal: I */ def methodFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 37, value) .asInstanceOf[Iterator[NodeType]] @@ -43,7 +43,7 @@ final class TraversalBindingBase[NodeType <: nodes.BindingBase](val traversal: I if (values.length == 1) return methodFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 37, value) @@ -98,7 +98,7 @@ final class TraversalBindingBase[NodeType <: nodes.BindingBase](val traversal: I */ def nameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) .asInstanceOf[Iterator[NodeType]] @@ -111,7 +111,7 @@ final class TraversalBindingBase[NodeType <: nodes.BindingBase](val traversal: I if (values.length == 1) return nameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) @@ -166,7 +166,7 @@ final class TraversalBindingBase[NodeType <: nodes.BindingBase](val traversal: I */ def signatureExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 47, value) .asInstanceOf[Iterator[NodeType]] @@ -179,7 +179,7 @@ final class TraversalBindingBase[NodeType <: nodes.BindingBase](val traversal: I if (values.length == 1) return signatureExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 47, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalBlockBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalBlockBase.scala index d8d14d9db..3ec9307e9 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalBlockBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalBlockBase.scala @@ -38,7 +38,7 @@ final class TraversalBlockBase[NodeType <: nodes.BlockBase](val traversal: Itera */ def typeFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) .asInstanceOf[Iterator[NodeType]] @@ -51,7 +51,7 @@ final class TraversalBlockBase[NodeType <: nodes.BlockBase](val traversal: Itera if (values.length == 1) return typeFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalCallBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalCallBase.scala index 67988e2cb..1523a8bac 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalCallBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalCallBase.scala @@ -30,7 +30,7 @@ final class TraversalCallBase[NodeType <: nodes.CallBase](val traversal: Iterato */ def dispatchTypeExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 15, value) .asInstanceOf[Iterator[NodeType]] @@ -43,7 +43,7 @@ final class TraversalCallBase[NodeType <: nodes.CallBase](val traversal: Iterato if (values.length == 1) return dispatchTypeExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 15, value) @@ -102,7 +102,7 @@ final class TraversalCallBase[NodeType <: nodes.CallBase](val traversal: Iterato */ def methodFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 37, value) .asInstanceOf[Iterator[NodeType]] @@ -115,7 +115,7 @@ final class TraversalCallBase[NodeType <: nodes.CallBase](val traversal: Iterato if (values.length == 1) return methodFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 37, value) @@ -179,7 +179,7 @@ final class TraversalCallBase[NodeType <: nodes.CallBase](val traversal: Iterato */ def staticReceiverExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] @@ -247,7 +247,7 @@ final class TraversalCallBase[NodeType <: nodes.CallBase](val traversal: Iterato */ def typeFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) .asInstanceOf[Iterator[NodeType]] @@ -260,7 +260,7 @@ final class TraversalCallBase[NodeType <: nodes.CallBase](val traversal: Iterato if (values.length == 1) return typeFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalCallreprBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalCallreprBase.scala index 140d0774d..71990616d 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalCallreprBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalCallreprBase.scala @@ -30,7 +30,7 @@ final class TraversalCallreprBase[NodeType <: nodes.CallReprBase](val traversal: */ def nameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) .asInstanceOf[Iterator[NodeType]] @@ -43,7 +43,7 @@ final class TraversalCallreprBase[NodeType <: nodes.CallReprBase](val traversal: if (values.length == 1) return nameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) @@ -98,7 +98,7 @@ final class TraversalCallreprBase[NodeType <: nodes.CallReprBase](val traversal: */ def signatureExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 47, value) .asInstanceOf[Iterator[NodeType]] @@ -111,7 +111,7 @@ final class TraversalCallreprBase[NodeType <: nodes.CallReprBase](val traversal: if (values.length == 1) return signatureExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 47, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalClosurebindingBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalClosurebindingBase.scala index 54e3e238a..8dd1f2eeb 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalClosurebindingBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalClosurebindingBase.scala @@ -36,7 +36,7 @@ final class TraversalClosurebindingBase[NodeType <: nodes.ClosureBindingBase](va */ def closureBindingIdExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 7, value) .asInstanceOf[Iterator[NodeType]] @@ -104,7 +104,7 @@ final class TraversalClosurebindingBase[NodeType <: nodes.ClosureBindingBase](va */ def evaluationStrategyExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) .asInstanceOf[Iterator[NodeType]] @@ -117,7 +117,7 @@ final class TraversalClosurebindingBase[NodeType <: nodes.ClosureBindingBase](va if (values.length == 1) return evaluationStrategyExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalCommentBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalCommentBase.scala index 26cbe5e57..2cfb1d320 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalCommentBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalCommentBase.scala @@ -30,7 +30,7 @@ final class TraversalCommentBase[NodeType <: nodes.CommentBase](val traversal: I */ def filenameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 20, value) .asInstanceOf[Iterator[NodeType]] @@ -43,7 +43,7 @@ final class TraversalCommentBase[NodeType <: nodes.CommentBase](val traversal: I if (values.length == 1) return filenameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 20, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalConfigfileBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalConfigfileBase.scala index 425537d26..440de53ac 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalConfigfileBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalConfigfileBase.scala @@ -31,7 +31,7 @@ final class TraversalConfigfileBase[NodeType <: nodes.ConfigFileBase](val traver */ def contentExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 12, value) .asInstanceOf[Iterator[NodeType]] @@ -44,7 +44,7 @@ final class TraversalConfigfileBase[NodeType <: nodes.ConfigFileBase](val traver if (values.length == 1) return contentExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 12, value) @@ -99,7 +99,7 @@ final class TraversalConfigfileBase[NodeType <: nodes.ConfigFileBase](val traver */ def nameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) .asInstanceOf[Iterator[NodeType]] @@ -112,7 +112,7 @@ final class TraversalConfigfileBase[NodeType <: nodes.ConfigFileBase](val traver if (values.length == 1) return nameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalControlstructureBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalControlstructureBase.scala index 37745a561..c0911074c 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalControlstructureBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalControlstructureBase.scala @@ -31,7 +31,7 @@ final class TraversalControlstructureBase[NodeType <: nodes.ControlStructureBase */ def controlStructureTypeExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 13, value) .asInstanceOf[Iterator[NodeType]] @@ -44,7 +44,7 @@ final class TraversalControlstructureBase[NodeType <: nodes.ControlStructureBase if (values.length == 1) return controlStructureTypeExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 13, value) @@ -99,7 +99,7 @@ final class TraversalControlstructureBase[NodeType <: nodes.ControlStructureBase */ def parserTypeNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 44, value) .asInstanceOf[Iterator[NodeType]] @@ -112,7 +112,7 @@ final class TraversalControlstructureBase[NodeType <: nodes.ControlStructureBase if (values.length == 1) return parserTypeNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 44, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalDeclarationBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalDeclarationBase.scala index 828a78307..9f7e35308 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalDeclarationBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalDeclarationBase.scala @@ -31,7 +31,7 @@ final class TraversalDeclarationBase[NodeType <: nodes.DeclarationBase](val trav */ def nameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) .asInstanceOf[Iterator[NodeType]] @@ -44,7 +44,7 @@ final class TraversalDeclarationBase[NodeType <: nodes.DeclarationBase](val trav if (values.length == 1) return nameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalDependencyBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalDependencyBase.scala index 08e10d50d..091260c68 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalDependencyBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalDependencyBase.scala @@ -36,7 +36,7 @@ final class TraversalDependencyBase[NodeType <: nodes.DependencyBase](val traver */ def dependencyGroupIdExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 14, value) .asInstanceOf[Iterator[NodeType]] @@ -104,7 +104,7 @@ final class TraversalDependencyBase[NodeType <: nodes.DependencyBase](val traver */ def nameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) .asInstanceOf[Iterator[NodeType]] @@ -117,7 +117,7 @@ final class TraversalDependencyBase[NodeType <: nodes.DependencyBase](val traver if (values.length == 1) return nameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) @@ -172,7 +172,7 @@ final class TraversalDependencyBase[NodeType <: nodes.DependencyBase](val traver */ def versionExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 52, value) .asInstanceOf[Iterator[NodeType]] @@ -185,7 +185,7 @@ final class TraversalDependencyBase[NodeType <: nodes.DependencyBase](val traver if (values.length == 1) return versionExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 52, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalExpressionBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalExpressionBase.scala index f08a66d9f..043acce79 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalExpressionBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalExpressionBase.scala @@ -89,7 +89,7 @@ final class TraversalExpressionBase[NodeType <: nodes.ExpressionBase](val traver */ def argumentLabelExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 2, value) .asInstanceOf[Iterator[NodeType]] @@ -162,7 +162,7 @@ final class TraversalExpressionBase[NodeType <: nodes.ExpressionBase](val traver */ def argumentNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 3, value) .asInstanceOf[Iterator[NodeType]] diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalFieldidentifierBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalFieldidentifierBase.scala index 909c8a309..71949cef5 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalFieldidentifierBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalFieldidentifierBase.scala @@ -31,7 +31,7 @@ final class TraversalFieldidentifierBase[NodeType <: nodes.FieldIdentifierBase]( */ def canonicalNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 6, value) .asInstanceOf[Iterator[NodeType]] @@ -44,7 +44,7 @@ final class TraversalFieldidentifierBase[NodeType <: nodes.FieldIdentifierBase]( if (values.length == 1) return canonicalNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 6, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalFileBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalFileBase.scala index fdbfebe2e..419275e7b 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalFileBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalFileBase.scala @@ -30,7 +30,7 @@ final class TraversalFileBase[NodeType <: nodes.FileBase](val traversal: Iterato */ def contentExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 12, value) .asInstanceOf[Iterator[NodeType]] @@ -43,7 +43,7 @@ final class TraversalFileBase[NodeType <: nodes.FileBase](val traversal: Iterato if (values.length == 1) return contentExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 12, value) @@ -103,7 +103,7 @@ final class TraversalFileBase[NodeType <: nodes.FileBase](val traversal: Iterato */ def hashExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value) .asInstanceOf[Iterator[NodeType]] @@ -171,7 +171,7 @@ final class TraversalFileBase[NodeType <: nodes.FileBase](val traversal: Iterato */ def nameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) .asInstanceOf[Iterator[NodeType]] @@ -184,7 +184,7 @@ final class TraversalFileBase[NodeType <: nodes.FileBase](val traversal: Iterato if (values.length == 1) return nameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalIdentifierBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalIdentifierBase.scala index edf4799ff..51e5221d0 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalIdentifierBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalIdentifierBase.scala @@ -35,7 +35,7 @@ final class TraversalIdentifierBase[NodeType <: nodes.IdentifierBase](val traver */ def nameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) .asInstanceOf[Iterator[NodeType]] @@ -48,7 +48,7 @@ final class TraversalIdentifierBase[NodeType <: nodes.IdentifierBase](val traver if (values.length == 1) return nameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) @@ -107,7 +107,7 @@ final class TraversalIdentifierBase[NodeType <: nodes.IdentifierBase](val traver */ def typeFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) .asInstanceOf[Iterator[NodeType]] @@ -120,7 +120,7 @@ final class TraversalIdentifierBase[NodeType <: nodes.IdentifierBase](val traver if (values.length == 1) return typeFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalImportBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalImportBase.scala index 2bbaa78c9..98a8d2ae2 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalImportBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalImportBase.scala @@ -44,7 +44,7 @@ final class TraversalImportBase[NodeType <: nodes.ImportBase](val traversal: Ite */ def importedAsExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 24, value) .asInstanceOf[Iterator[NodeType]] @@ -117,7 +117,7 @@ final class TraversalImportBase[NodeType <: nodes.ImportBase](val traversal: Ite */ def importedEntityExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 25, value) .asInstanceOf[Iterator[NodeType]] diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalJumplabelBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalJumplabelBase.scala index 108b81400..28af5a824 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalJumplabelBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalJumplabelBase.scala @@ -30,7 +30,7 @@ final class TraversalJumplabelBase[NodeType <: nodes.JumpLabelBase](val traversa */ def nameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) .asInstanceOf[Iterator[NodeType]] @@ -43,7 +43,7 @@ final class TraversalJumplabelBase[NodeType <: nodes.JumpLabelBase](val traversa if (values.length == 1) return nameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) @@ -98,7 +98,7 @@ final class TraversalJumplabelBase[NodeType <: nodes.JumpLabelBase](val traversa */ def parserTypeNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 44, value) .asInstanceOf[Iterator[NodeType]] @@ -111,7 +111,7 @@ final class TraversalJumplabelBase[NodeType <: nodes.JumpLabelBase](val traversa if (values.length == 1) return parserTypeNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 44, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalJumptargetBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalJumptargetBase.scala index 2f3da05e2..8c09b31a6 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalJumptargetBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalJumptargetBase.scala @@ -84,7 +84,7 @@ final class TraversalJumptargetBase[NodeType <: nodes.JumpTargetBase](val traver */ def nameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) .asInstanceOf[Iterator[NodeType]] @@ -97,7 +97,7 @@ final class TraversalJumptargetBase[NodeType <: nodes.JumpTargetBase](val traver if (values.length == 1) return nameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) @@ -152,7 +152,7 @@ final class TraversalJumptargetBase[NodeType <: nodes.JumpTargetBase](val traver */ def parserTypeNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 44, value) .asInstanceOf[Iterator[NodeType]] @@ -165,7 +165,7 @@ final class TraversalJumptargetBase[NodeType <: nodes.JumpTargetBase](val traver if (values.length == 1) return parserTypeNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 44, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalKeyvaluepairBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalKeyvaluepairBase.scala index 07acfba80..9e2254822 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalKeyvaluepairBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalKeyvaluepairBase.scala @@ -31,7 +31,7 @@ final class TraversalKeyvaluepairBase[NodeType <: nodes.KeyValuePairBase](val tr */ def keyExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 33, value) .asInstanceOf[Iterator[NodeType]] @@ -44,7 +44,7 @@ final class TraversalKeyvaluepairBase[NodeType <: nodes.KeyValuePairBase](val tr if (values.length == 1) return keyExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 33, value) @@ -99,7 +99,7 @@ final class TraversalKeyvaluepairBase[NodeType <: nodes.KeyValuePairBase](val tr */ def valueExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 51, value) .asInstanceOf[Iterator[NodeType]] @@ -112,7 +112,7 @@ final class TraversalKeyvaluepairBase[NodeType <: nodes.KeyValuePairBase](val tr if (values.length == 1) return valueExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 51, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalLiteralBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalLiteralBase.scala index 44a634d45..602141e47 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalLiteralBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalLiteralBase.scala @@ -38,7 +38,7 @@ final class TraversalLiteralBase[NodeType <: nodes.LiteralBase](val traversal: I */ def typeFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) .asInstanceOf[Iterator[NodeType]] @@ -51,7 +51,7 @@ final class TraversalLiteralBase[NodeType <: nodes.LiteralBase](val traversal: I if (values.length == 1) return typeFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalLocalBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalLocalBase.scala index 10981a92f..ef5d50094 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalLocalBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalLocalBase.scala @@ -35,7 +35,7 @@ final class TraversalLocalBase[NodeType <: nodes.LocalBase](val traversal: Itera */ def closureBindingIdExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 7, value) .asInstanceOf[Iterator[NodeType]] @@ -107,7 +107,7 @@ final class TraversalLocalBase[NodeType <: nodes.LocalBase](val traversal: Itera */ def genericSignatureExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) .asInstanceOf[Iterator[NodeType]] @@ -120,7 +120,7 @@ final class TraversalLocalBase[NodeType <: nodes.LocalBase](val traversal: Itera if (values.length == 1) return genericSignatureExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) @@ -179,7 +179,7 @@ final class TraversalLocalBase[NodeType <: nodes.LocalBase](val traversal: Itera */ def typeFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) .asInstanceOf[Iterator[NodeType]] @@ -192,7 +192,7 @@ final class TraversalLocalBase[NodeType <: nodes.LocalBase](val traversal: Itera if (values.length == 1) return typeFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMemberBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMemberBase.scala index 80cf7714e..e20a9e131 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMemberBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMemberBase.scala @@ -30,7 +30,7 @@ final class TraversalMemberBase[NodeType <: nodes.MemberBase](val traversal: Ite */ def astParentFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 4, value) .asInstanceOf[Iterator[NodeType]] @@ -43,7 +43,7 @@ final class TraversalMemberBase[NodeType <: nodes.MemberBase](val traversal: Ite if (values.length == 1) return astParentFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 4, value) @@ -98,7 +98,7 @@ final class TraversalMemberBase[NodeType <: nodes.MemberBase](val traversal: Ite */ def astParentTypeExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 5, value) .asInstanceOf[Iterator[NodeType]] @@ -111,7 +111,7 @@ final class TraversalMemberBase[NodeType <: nodes.MemberBase](val traversal: Ite if (values.length == 1) return astParentTypeExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 5, value) @@ -170,7 +170,7 @@ final class TraversalMemberBase[NodeType <: nodes.MemberBase](val traversal: Ite */ def genericSignatureExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) .asInstanceOf[Iterator[NodeType]] @@ -183,7 +183,7 @@ final class TraversalMemberBase[NodeType <: nodes.MemberBase](val traversal: Ite if (values.length == 1) return genericSignatureExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) @@ -242,7 +242,7 @@ final class TraversalMemberBase[NodeType <: nodes.MemberBase](val traversal: Ite */ def typeFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) .asInstanceOf[Iterator[NodeType]] @@ -255,7 +255,7 @@ final class TraversalMemberBase[NodeType <: nodes.MemberBase](val traversal: Ite if (values.length == 1) return typeFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMetadataBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMetadataBase.scala index 9edce736e..b318046cc 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMetadataBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMetadataBase.scala @@ -35,7 +35,7 @@ final class TraversalMetadataBase[NodeType <: nodes.MetaDataBase](val traversal: */ def hashExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value) .asInstanceOf[Iterator[NodeType]] @@ -103,7 +103,7 @@ final class TraversalMetadataBase[NodeType <: nodes.MetaDataBase](val traversal: */ def languageExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 34, value) .asInstanceOf[Iterator[NodeType]] @@ -116,7 +116,7 @@ final class TraversalMetadataBase[NodeType <: nodes.MetaDataBase](val traversal: if (values.length == 1) return languageExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 34, value) @@ -175,7 +175,7 @@ final class TraversalMetadataBase[NodeType <: nodes.MetaDataBase](val traversal: */ def rootExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 46, value) .asInstanceOf[Iterator[NodeType]] @@ -188,7 +188,7 @@ final class TraversalMetadataBase[NodeType <: nodes.MetaDataBase](val traversal: if (values.length == 1) return rootExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 46, value) @@ -243,7 +243,7 @@ final class TraversalMetadataBase[NodeType <: nodes.MetaDataBase](val traversal: */ def versionExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 52, value) .asInstanceOf[Iterator[NodeType]] @@ -256,7 +256,7 @@ final class TraversalMetadataBase[NodeType <: nodes.MetaDataBase](val traversal: if (values.length == 1) return versionExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 52, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodBase.scala index 562c5aa48..b343bc128 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodBase.scala @@ -30,7 +30,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite */ def astParentFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 4, value) .asInstanceOf[Iterator[NodeType]] @@ -43,7 +43,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite if (values.length == 1) return astParentFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 4, value) @@ -98,7 +98,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite */ def astParentTypeExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 5, value) .asInstanceOf[Iterator[NodeType]] @@ -111,7 +111,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite if (values.length == 1) return astParentTypeExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 5, value) @@ -243,7 +243,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite */ def filenameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 20, value) .asInstanceOf[Iterator[NodeType]] @@ -256,7 +256,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite if (values.length == 1) return filenameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 20, value) @@ -311,7 +311,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite */ def fullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) .asInstanceOf[Iterator[NodeType]] @@ -324,7 +324,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite if (values.length == 1) return fullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) @@ -379,7 +379,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite */ def genericSignatureExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) .asInstanceOf[Iterator[NodeType]] @@ -392,7 +392,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite if (values.length == 1) return genericSignatureExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) @@ -452,7 +452,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite */ def hashExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value) .asInstanceOf[Iterator[NodeType]] @@ -606,7 +606,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite */ def signatureExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 47, value) .asInstanceOf[Iterator[NodeType]] @@ -619,7 +619,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite if (values.length == 1) return signatureExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 47, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodparameterinBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodparameterinBase.scala index eb23e6491..262517978 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodparameterinBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodparameterinBase.scala @@ -36,7 +36,7 @@ final class TraversalMethodparameterinBase[NodeType <: nodes.MethodParameterInBa */ def closureBindingIdExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 7, value) .asInstanceOf[Iterator[NodeType]] @@ -108,7 +108,7 @@ final class TraversalMethodparameterinBase[NodeType <: nodes.MethodParameterInBa */ def evaluationStrategyExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) .asInstanceOf[Iterator[NodeType]] @@ -121,7 +121,7 @@ final class TraversalMethodparameterinBase[NodeType <: nodes.MethodParameterInBa if (values.length == 1) return evaluationStrategyExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) @@ -242,7 +242,7 @@ final class TraversalMethodparameterinBase[NodeType <: nodes.MethodParameterInBa */ def typeFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) .asInstanceOf[Iterator[NodeType]] @@ -255,7 +255,7 @@ final class TraversalMethodparameterinBase[NodeType <: nodes.MethodParameterInBa if (values.length == 1) return typeFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodparameteroutBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodparameteroutBase.scala index baf6c48cd..c38fa18a5 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodparameteroutBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodparameteroutBase.scala @@ -31,7 +31,7 @@ final class TraversalMethodparameteroutBase[NodeType <: nodes.MethodParameterOut */ def evaluationStrategyExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) .asInstanceOf[Iterator[NodeType]] @@ -44,7 +44,7 @@ final class TraversalMethodparameteroutBase[NodeType <: nodes.MethodParameterOut if (values.length == 1) return evaluationStrategyExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) @@ -161,7 +161,7 @@ final class TraversalMethodparameteroutBase[NodeType <: nodes.MethodParameterOut */ def typeFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) .asInstanceOf[Iterator[NodeType]] @@ -174,7 +174,7 @@ final class TraversalMethodparameteroutBase[NodeType <: nodes.MethodParameterOut if (values.length == 1) return typeFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodrefBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodrefBase.scala index 2df584e6a..6320a6896 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodrefBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodrefBase.scala @@ -34,7 +34,7 @@ final class TraversalMethodrefBase[NodeType <: nodes.MethodRefBase](val traversa */ def methodFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 37, value) .asInstanceOf[Iterator[NodeType]] @@ -47,7 +47,7 @@ final class TraversalMethodrefBase[NodeType <: nodes.MethodRefBase](val traversa if (values.length == 1) return methodFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 37, value) @@ -106,7 +106,7 @@ final class TraversalMethodrefBase[NodeType <: nodes.MethodRefBase](val traversa */ def typeFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) .asInstanceOf[Iterator[NodeType]] @@ -119,7 +119,7 @@ final class TraversalMethodrefBase[NodeType <: nodes.MethodRefBase](val traversa if (values.length == 1) return typeFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodreturnBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodreturnBase.scala index a7d8fad56..313d94be0 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodreturnBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodreturnBase.scala @@ -35,7 +35,7 @@ final class TraversalMethodreturnBase[NodeType <: nodes.MethodReturnBase](val tr */ def evaluationStrategyExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) .asInstanceOf[Iterator[NodeType]] @@ -48,7 +48,7 @@ final class TraversalMethodreturnBase[NodeType <: nodes.MethodReturnBase](val tr if (values.length == 1) return evaluationStrategyExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) @@ -107,7 +107,7 @@ final class TraversalMethodreturnBase[NodeType <: nodes.MethodReturnBase](val tr */ def typeFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) .asInstanceOf[Iterator[NodeType]] @@ -120,7 +120,7 @@ final class TraversalMethodreturnBase[NodeType <: nodes.MethodReturnBase](val tr if (values.length == 1) return typeFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalModifierBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalModifierBase.scala index 9c2ecef61..0a720323e 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalModifierBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalModifierBase.scala @@ -30,7 +30,7 @@ final class TraversalModifierBase[NodeType <: nodes.ModifierBase](val traversal: */ def modifierTypeExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] @@ -43,7 +43,7 @@ final class TraversalModifierBase[NodeType <: nodes.ModifierBase](val traversal: if (values.length == 1) return modifierTypeExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalNamespaceBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalNamespaceBase.scala index 82b33bb1a..0248be1bb 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalNamespaceBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalNamespaceBase.scala @@ -30,7 +30,7 @@ final class TraversalNamespaceBase[NodeType <: nodes.NamespaceBase](val traversa */ def nameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) .asInstanceOf[Iterator[NodeType]] @@ -43,7 +43,7 @@ final class TraversalNamespaceBase[NodeType <: nodes.NamespaceBase](val traversa if (values.length == 1) return nameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalNamespaceblockBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalNamespaceblockBase.scala index fdabc3761..1dc0e9dea 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalNamespaceblockBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalNamespaceblockBase.scala @@ -31,7 +31,7 @@ final class TraversalNamespaceblockBase[NodeType <: nodes.NamespaceBlockBase](va */ def filenameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 20, value) .asInstanceOf[Iterator[NodeType]] @@ -44,7 +44,7 @@ final class TraversalNamespaceblockBase[NodeType <: nodes.NamespaceBlockBase](va if (values.length == 1) return filenameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 20, value) @@ -99,7 +99,7 @@ final class TraversalNamespaceblockBase[NodeType <: nodes.NamespaceBlockBase](va */ def fullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) .asInstanceOf[Iterator[NodeType]] @@ -112,7 +112,7 @@ final class TraversalNamespaceblockBase[NodeType <: nodes.NamespaceBlockBase](va if (values.length == 1) return fullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) @@ -167,7 +167,7 @@ final class TraversalNamespaceblockBase[NodeType <: nodes.NamespaceBlockBase](va */ def nameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) .asInstanceOf[Iterator[NodeType]] @@ -180,7 +180,7 @@ final class TraversalNamespaceblockBase[NodeType <: nodes.NamespaceBlockBase](va if (values.length == 1) return nameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyAliasTypeFullName.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyAliasTypeFullName.scala index ff3b16eaf..86471f4af 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyAliasTypeFullName.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyAliasTypeFullName.scala @@ -38,7 +38,7 @@ final class TraversalPropertyAliasTypeFullName[ */ def aliasTypeFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, value) .asInstanceOf[Iterator[NodeType]] diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyArgumentLabel.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyArgumentLabel.scala index c10f35751..643ac081e 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyArgumentLabel.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyArgumentLabel.scala @@ -37,7 +37,7 @@ final class TraversalPropertyArgumentLabel[NodeType <: nodes.StoredNode & nodes. */ def argumentLabelExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 2, value) .asInstanceOf[Iterator[NodeType]] diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyArgumentName.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyArgumentName.scala index 5d122e2fb..629210e3a 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyArgumentName.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyArgumentName.scala @@ -37,7 +37,7 @@ final class TraversalPropertyArgumentName[NodeType <: nodes.StoredNode & nodes.S */ def argumentNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 3, value) .asInstanceOf[Iterator[NodeType]] diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyAstParentFullName.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyAstParentFullName.scala index 5265cf9d8..683d4f930 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyAstParentFullName.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyAstParentFullName.scala @@ -33,7 +33,7 @@ final class TraversalPropertyAstParentFullName[ */ def astParentFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 4, value) .asInstanceOf[Iterator[NodeType]] @@ -46,7 +46,7 @@ final class TraversalPropertyAstParentFullName[ if (values.length == 1) return astParentFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 4, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyAstParentType.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyAstParentType.scala index a0206c288..3739ea693 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyAstParentType.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyAstParentType.scala @@ -32,7 +32,7 @@ final class TraversalPropertyAstParentType[NodeType <: nodes.StoredNode & nodes. */ def astParentTypeExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 5, value) .asInstanceOf[Iterator[NodeType]] @@ -45,7 +45,7 @@ final class TraversalPropertyAstParentType[NodeType <: nodes.StoredNode & nodes. if (values.length == 1) return astParentTypeExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 5, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyCanonicalName.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyCanonicalName.scala index 0f7d7d38a..f5c065d84 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyCanonicalName.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyCanonicalName.scala @@ -32,7 +32,7 @@ final class TraversalPropertyCanonicalName[NodeType <: nodes.StoredNode & nodes. */ def canonicalNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 6, value) .asInstanceOf[Iterator[NodeType]] @@ -45,7 +45,7 @@ final class TraversalPropertyCanonicalName[NodeType <: nodes.StoredNode & nodes. if (values.length == 1) return canonicalNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 6, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyClosureBindingId.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyClosureBindingId.scala index 3bd9f6fab..45ef12de4 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyClosureBindingId.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyClosureBindingId.scala @@ -38,7 +38,7 @@ final class TraversalPropertyClosureBindingId[ */ def closureBindingIdExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 7, value) .asInstanceOf[Iterator[NodeType]] diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyCode.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyCode.scala index fed8e5db7..3180ae790 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyCode.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyCode.scala @@ -32,7 +32,7 @@ final class TraversalPropertyCode[NodeType <: nodes.StoredNode & nodes.StaticTyp */ def codeExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 8, value) .asInstanceOf[Iterator[NodeType]] @@ -45,7 +45,7 @@ final class TraversalPropertyCode[NodeType <: nodes.StoredNode & nodes.StaticTyp if (values.length == 1) return codeExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 8, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyContainedRef.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyContainedRef.scala index c23a2bd67..8651daaab 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyContainedRef.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyContainedRef.scala @@ -32,7 +32,7 @@ final class TraversalPropertyContainedRef[NodeType <: nodes.StoredNode & nodes.S */ def containedRefExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 11, value) .asInstanceOf[Iterator[NodeType]] @@ -45,7 +45,7 @@ final class TraversalPropertyContainedRef[NodeType <: nodes.StoredNode & nodes.S if (values.length == 1) return containedRefExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 11, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyContent.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyContent.scala index b9c5a5a4a..0ebda7c20 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyContent.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyContent.scala @@ -32,7 +32,7 @@ final class TraversalPropertyContent[NodeType <: nodes.StoredNode & nodes.Static */ def contentExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 12, value) .asInstanceOf[Iterator[NodeType]] @@ -45,7 +45,7 @@ final class TraversalPropertyContent[NodeType <: nodes.StoredNode & nodes.Static if (values.length == 1) return contentExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 12, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyControlStructureType.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyControlStructureType.scala index 4a3e2eb39..2b7c72110 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyControlStructureType.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyControlStructureType.scala @@ -33,7 +33,7 @@ final class TraversalPropertyControlStructureType[ */ def controlStructureTypeExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 13, value) .asInstanceOf[Iterator[NodeType]] @@ -46,7 +46,7 @@ final class TraversalPropertyControlStructureType[ if (values.length == 1) return controlStructureTypeExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 13, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyDependencyGroupId.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyDependencyGroupId.scala index 8aeff5ba0..606e5e949 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyDependencyGroupId.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyDependencyGroupId.scala @@ -38,7 +38,7 @@ final class TraversalPropertyDependencyGroupId[ */ def dependencyGroupIdExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 14, value) .asInstanceOf[Iterator[NodeType]] diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyDispatchType.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyDispatchType.scala index 0996d14c5..f6f59123a 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyDispatchType.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyDispatchType.scala @@ -32,7 +32,7 @@ final class TraversalPropertyDispatchType[NodeType <: nodes.StoredNode & nodes.S */ def dispatchTypeExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 15, value) .asInstanceOf[Iterator[NodeType]] @@ -45,7 +45,7 @@ final class TraversalPropertyDispatchType[NodeType <: nodes.StoredNode & nodes.S if (values.length == 1) return dispatchTypeExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 15, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyEvaluationStrategy.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyEvaluationStrategy.scala index d25b24302..65d10c381 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyEvaluationStrategy.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyEvaluationStrategy.scala @@ -33,7 +33,7 @@ final class TraversalPropertyEvaluationStrategy[ */ def evaluationStrategyExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) .asInstanceOf[Iterator[NodeType]] @@ -46,7 +46,7 @@ final class TraversalPropertyEvaluationStrategy[ if (values.length == 1) return evaluationStrategyExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyFilename.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyFilename.scala index 4e318b684..9936e9eed 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyFilename.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyFilename.scala @@ -32,7 +32,7 @@ final class TraversalPropertyFilename[NodeType <: nodes.StoredNode & nodes.Stati */ def filenameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 20, value) .asInstanceOf[Iterator[NodeType]] @@ -45,7 +45,7 @@ final class TraversalPropertyFilename[NodeType <: nodes.StoredNode & nodes.Stati if (values.length == 1) return filenameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 20, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyFullName.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyFullName.scala index c88013b6e..f5adf4f49 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyFullName.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyFullName.scala @@ -32,7 +32,7 @@ final class TraversalPropertyFullName[NodeType <: nodes.StoredNode & nodes.Stati */ def fullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) .asInstanceOf[Iterator[NodeType]] @@ -45,7 +45,7 @@ final class TraversalPropertyFullName[NodeType <: nodes.StoredNode & nodes.Stati if (values.length == 1) return fullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyGenericSignature.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyGenericSignature.scala index a410c129a..d103485c0 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyGenericSignature.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyGenericSignature.scala @@ -33,7 +33,7 @@ final class TraversalPropertyGenericSignature[ */ def genericSignatureExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) .asInstanceOf[Iterator[NodeType]] @@ -46,7 +46,7 @@ final class TraversalPropertyGenericSignature[ if (values.length == 1) return genericSignatureExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyHash.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyHash.scala index d465d24b0..cf74ce09e 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyHash.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyHash.scala @@ -37,7 +37,7 @@ final class TraversalPropertyHash[NodeType <: nodes.StoredNode & nodes.StaticTyp */ def hashExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value) .asInstanceOf[Iterator[NodeType]] diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyImportedAs.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyImportedAs.scala index 23646c0ab..fe92ef1a1 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyImportedAs.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyImportedAs.scala @@ -37,7 +37,7 @@ final class TraversalPropertyImportedAs[NodeType <: nodes.StoredNode & nodes.Sta */ def importedAsExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 24, value) .asInstanceOf[Iterator[NodeType]] diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyImportedEntity.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyImportedEntity.scala index 3f189fffb..596506515 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyImportedEntity.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyImportedEntity.scala @@ -38,7 +38,7 @@ final class TraversalPropertyImportedEntity[ */ def importedEntityExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 25, value) .asInstanceOf[Iterator[NodeType]] diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyKey.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyKey.scala index 5f7c49cff..e6c70ab9b 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyKey.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyKey.scala @@ -32,7 +32,7 @@ final class TraversalPropertyKey[NodeType <: nodes.StoredNode & nodes.StaticType */ def keyExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 33, value) .asInstanceOf[Iterator[NodeType]] @@ -45,7 +45,7 @@ final class TraversalPropertyKey[NodeType <: nodes.StoredNode & nodes.StaticType if (values.length == 1) return keyExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 33, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyLanguage.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyLanguage.scala index 2e2aa0568..47e253b82 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyLanguage.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyLanguage.scala @@ -32,7 +32,7 @@ final class TraversalPropertyLanguage[NodeType <: nodes.StoredNode & nodes.Stati */ def languageExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 34, value) .asInstanceOf[Iterator[NodeType]] @@ -45,7 +45,7 @@ final class TraversalPropertyLanguage[NodeType <: nodes.StoredNode & nodes.Stati if (values.length == 1) return languageExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 34, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyMethodFullName.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyMethodFullName.scala index e222946bc..968a9161e 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyMethodFullName.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyMethodFullName.scala @@ -33,7 +33,7 @@ final class TraversalPropertyMethodFullName[ */ def methodFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 37, value) .asInstanceOf[Iterator[NodeType]] @@ -46,7 +46,7 @@ final class TraversalPropertyMethodFullName[ if (values.length == 1) return methodFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 37, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyModifierType.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyModifierType.scala index feb6550ad..4b4cb9c76 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyModifierType.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyModifierType.scala @@ -32,7 +32,7 @@ final class TraversalPropertyModifierType[NodeType <: nodes.StoredNode & nodes.S */ def modifierTypeExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] @@ -45,7 +45,7 @@ final class TraversalPropertyModifierType[NodeType <: nodes.StoredNode & nodes.S if (values.length == 1) return modifierTypeExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyName.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyName.scala index b9d35e885..c417528cd 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyName.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyName.scala @@ -32,7 +32,7 @@ final class TraversalPropertyName[NodeType <: nodes.StoredNode & nodes.StaticTyp */ def nameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) .asInstanceOf[Iterator[NodeType]] @@ -45,7 +45,7 @@ final class TraversalPropertyName[NodeType <: nodes.StoredNode & nodes.StaticTyp if (values.length == 1) return nameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyParserTypeName.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyParserTypeName.scala index 28c6943c9..7f1f95c8a 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyParserTypeName.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyParserTypeName.scala @@ -33,7 +33,7 @@ final class TraversalPropertyParserTypeName[ */ def parserTypeNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 44, value) .asInstanceOf[Iterator[NodeType]] @@ -46,7 +46,7 @@ final class TraversalPropertyParserTypeName[ if (values.length == 1) return parserTypeNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 44, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyRoot.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyRoot.scala index d80f8ae32..736a27ec6 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyRoot.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyRoot.scala @@ -32,7 +32,7 @@ final class TraversalPropertyRoot[NodeType <: nodes.StoredNode & nodes.StaticTyp */ def rootExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 46, value) .asInstanceOf[Iterator[NodeType]] @@ -45,7 +45,7 @@ final class TraversalPropertyRoot[NodeType <: nodes.StoredNode & nodes.StaticTyp if (values.length == 1) return rootExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 46, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertySignature.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertySignature.scala index 659b16059..4e5573428 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertySignature.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertySignature.scala @@ -32,7 +32,7 @@ final class TraversalPropertySignature[NodeType <: nodes.StoredNode & nodes.Stat */ def signatureExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 47, value) .asInstanceOf[Iterator[NodeType]] @@ -45,7 +45,7 @@ final class TraversalPropertySignature[NodeType <: nodes.StoredNode & nodes.Stat if (values.length == 1) return signatureExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 47, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyStaticReceiver.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyStaticReceiver.scala index 8c9655db6..7278dc976 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyStaticReceiver.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyStaticReceiver.scala @@ -38,7 +38,7 @@ final class TraversalPropertyStaticReceiver[ */ def staticReceiverExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyTypeDeclFullName.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyTypeDeclFullName.scala index b3d0cc39c..e973a1dd3 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyTypeDeclFullName.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyTypeDeclFullName.scala @@ -33,7 +33,7 @@ final class TraversalPropertyTypeDeclFullName[ */ def typeDeclFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 49, value) .asInstanceOf[Iterator[NodeType]] @@ -46,7 +46,7 @@ final class TraversalPropertyTypeDeclFullName[ if (values.length == 1) return typeDeclFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 49, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyTypeFullName.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyTypeFullName.scala index f48830841..7481fc204 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyTypeFullName.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyTypeFullName.scala @@ -32,7 +32,7 @@ final class TraversalPropertyTypeFullName[NodeType <: nodes.StoredNode & nodes.S */ def typeFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) .asInstanceOf[Iterator[NodeType]] @@ -45,7 +45,7 @@ final class TraversalPropertyTypeFullName[NodeType <: nodes.StoredNode & nodes.S if (values.length == 1) return typeFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyValue.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyValue.scala index 9faf82d23..de6e0c816 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyValue.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyValue.scala @@ -32,7 +32,7 @@ final class TraversalPropertyValue[NodeType <: nodes.StoredNode & nodes.StaticTy */ def valueExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 51, value) .asInstanceOf[Iterator[NodeType]] @@ -45,7 +45,7 @@ final class TraversalPropertyValue[NodeType <: nodes.StoredNode & nodes.StaticTy if (values.length == 1) return valueExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 51, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyVersion.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyVersion.scala index cfb0d4033..892b50385 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyVersion.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyVersion.scala @@ -32,7 +32,7 @@ final class TraversalPropertyVersion[NodeType <: nodes.StoredNode & nodes.Static */ def versionExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 52, value) .asInstanceOf[Iterator[NodeType]] @@ -45,7 +45,7 @@ final class TraversalPropertyVersion[NodeType <: nodes.StoredNode & nodes.Static if (values.length == 1) return versionExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 52, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTagBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTagBase.scala index 78192d31f..badae0107 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTagBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTagBase.scala @@ -30,7 +30,7 @@ final class TraversalTagBase[NodeType <: nodes.TagBase](val traversal: Iterator[ */ def nameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) .asInstanceOf[Iterator[NodeType]] @@ -43,7 +43,7 @@ final class TraversalTagBase[NodeType <: nodes.TagBase](val traversal: Iterator[ if (values.length == 1) return nameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) @@ -98,7 +98,7 @@ final class TraversalTagBase[NodeType <: nodes.TagBase](val traversal: Iterator[ */ def valueExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 51, value) .asInstanceOf[Iterator[NodeType]] @@ -111,7 +111,7 @@ final class TraversalTagBase[NodeType <: nodes.TagBase](val traversal: Iterator[ if (values.length == 1) return valueExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 51, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTemplatedomBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTemplatedomBase.scala index 07f0f1ce0..361c45191 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTemplatedomBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTemplatedomBase.scala @@ -31,7 +31,7 @@ final class TraversalTemplatedomBase[NodeType <: nodes.TemplateDomBase](val trav */ def nameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) .asInstanceOf[Iterator[NodeType]] @@ -44,7 +44,7 @@ final class TraversalTemplatedomBase[NodeType <: nodes.TemplateDomBase](val trav if (values.length == 1) return nameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTypeBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTypeBase.scala index e2fcc6b02..4cf0c702b 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTypeBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTypeBase.scala @@ -30,7 +30,7 @@ final class TraversalTypeBase[NodeType <: nodes.TypeBase](val traversal: Iterato */ def fullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) .asInstanceOf[Iterator[NodeType]] @@ -43,7 +43,7 @@ final class TraversalTypeBase[NodeType <: nodes.TypeBase](val traversal: Iterato if (values.length == 1) return fullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) @@ -98,7 +98,7 @@ final class TraversalTypeBase[NodeType <: nodes.TypeBase](val traversal: Iterato */ def nameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) .asInstanceOf[Iterator[NodeType]] @@ -111,7 +111,7 @@ final class TraversalTypeBase[NodeType <: nodes.TypeBase](val traversal: Iterato if (values.length == 1) return nameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) @@ -166,7 +166,7 @@ final class TraversalTypeBase[NodeType <: nodes.TypeBase](val traversal: Iterato */ def typeDeclFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 49, value) .asInstanceOf[Iterator[NodeType]] @@ -179,7 +179,7 @@ final class TraversalTypeBase[NodeType <: nodes.TypeBase](val traversal: Iterato if (values.length == 1) return typeDeclFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 49, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTypedeclBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTypedeclBase.scala index 37b8cd074..c2f097906 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTypedeclBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTypedeclBase.scala @@ -35,7 +35,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: */ def aliasTypeFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 0, value) .asInstanceOf[Iterator[NodeType]] @@ -103,7 +103,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: */ def astParentFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 4, value) .asInstanceOf[Iterator[NodeType]] @@ -116,7 +116,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: if (values.length == 1) return astParentFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 4, value) @@ -171,7 +171,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: */ def astParentTypeExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 5, value) .asInstanceOf[Iterator[NodeType]] @@ -184,7 +184,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: if (values.length == 1) return astParentTypeExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 5, value) @@ -239,7 +239,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: */ def filenameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 20, value) .asInstanceOf[Iterator[NodeType]] @@ -252,7 +252,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: if (values.length == 1) return filenameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 20, value) @@ -307,7 +307,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: */ def fullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) .asInstanceOf[Iterator[NodeType]] @@ -320,7 +320,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: if (values.length == 1) return fullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) @@ -375,7 +375,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: */ def genericSignatureExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) .asInstanceOf[Iterator[NodeType]] @@ -388,7 +388,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: if (values.length == 1) return genericSignatureExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) @@ -456,7 +456,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: */ def nameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) .asInstanceOf[Iterator[NodeType]] @@ -469,7 +469,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: if (values.length == 1) return nameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTypeparameterBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTypeparameterBase.scala index 1d646c146..138aa48aa 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTypeparameterBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTypeparameterBase.scala @@ -31,7 +31,7 @@ final class TraversalTypeparameterBase[NodeType <: nodes.TypeParameterBase](val */ def nameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) .asInstanceOf[Iterator[NodeType]] @@ -44,7 +44,7 @@ final class TraversalTypeparameterBase[NodeType <: nodes.TypeParameterBase](val if (values.length == 1) return nameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTyperefBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTyperefBase.scala index fc2d02aec..df6e98f6a 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTyperefBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalTyperefBase.scala @@ -38,7 +38,7 @@ final class TraversalTyperefBase[NodeType <: nodes.TypeRefBase](val traversal: I */ def typeFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) .asInstanceOf[Iterator[NodeType]] @@ -51,7 +51,7 @@ final class TraversalTyperefBase[NodeType <: nodes.TypeRefBase](val traversal: I if (values.length == 1) return typeFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalUnknownBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalUnknownBase.scala index 81b9ae74e..676205fab 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalUnknownBase.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalUnknownBase.scala @@ -30,7 +30,7 @@ final class TraversalUnknownBase[NodeType <: nodes.UnknownBase](val traversal: I */ def containedRefExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 11, value) .asInstanceOf[Iterator[NodeType]] @@ -43,7 +43,7 @@ final class TraversalUnknownBase[NodeType <: nodes.UnknownBase](val traversal: I if (values.length == 1) return containedRefExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 11, value) @@ -102,7 +102,7 @@ final class TraversalUnknownBase[NodeType <: nodes.UnknownBase](val traversal: I */ def parserTypeNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 44, value) .asInstanceOf[Iterator[NodeType]] @@ -115,7 +115,7 @@ final class TraversalUnknownBase[NodeType <: nodes.UnknownBase](val traversal: I if (values.length == 1) return parserTypeNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 44, value) @@ -174,7 +174,7 @@ final class TraversalUnknownBase[NodeType <: nodes.UnknownBase](val traversal: I */ def typeFullNameExact(value: String): Iterator[NodeType] = traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) .asInstanceOf[Iterator[NodeType]] @@ -187,7 +187,7 @@ final class TraversalUnknownBase[NodeType <: nodes.UnknownBase](val traversal: I if (values.length == 1) return typeFullNameExact(values.head) traversal match { case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next + val someNode = init.next() values.iterator.flatMap { value => flatgraph.Accessors .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) diff --git a/maven_install.json b/maven_install.json index ec83aa8b9..6d1aa4eea 100644 --- a/maven_install.json +++ b/maven_install.json @@ -8,10 +8,10 @@ "com.google.j2objc:j2objc-annotations": 2003271689, "com.google.protobuf:protobuf-java": 1237026331, "com.lihaoyi:os-lib_3": 899915638, - "io.joern:flatgraph-core_3": -299976332, - "io.joern:flatgraph-domain-classes-generator_3": 1040736120, - "io.joern:flatgraph-help_3": -1498345706, - "io.joern:flatgraph-odb-convert_3": 599666178, + "io.joern:flatgraph-core_3": -1427372425, + "io.joern:flatgraph-domain-classes-generator_3": -86659973, + "io.joern:flatgraph-help_3": 1669225497, + "io.joern:flatgraph-odb-convert_3": -527729915, "net.sf.trove4j:core": 1808260229, "org.json4s:json4s-native_3": 1421532977, "org.scala-lang:scala-library": 1230160761, @@ -20,8 +20,8 @@ "repositories": -1949687017 }, "__RESOLVED_ARTIFACTS_HASH": { - "com.github.luben:zstd-jni": -201271141, - "com.github.luben:zstd-jni:jar:sources": 2122765034, + "com.github.luben:zstd-jni": 1886873774, + "com.github.luben:zstd-jni:jar:sources": -1190847340, "com.github.scopt:scopt_3": 148843063, "com.github.scopt:scopt_3:jar:sources": 776003799, "com.google.code.findbugs:jsr305": 870839855, @@ -55,14 +55,14 @@ "com.typesafe:config:jar:sources": 1794326800, "io.get-coursier:interface": 1635041630, "io.get-coursier:interface:jar:sources": -37171318, - "io.joern:flatgraph-core_3": 1753885189, - "io.joern:flatgraph-core_3:jar:sources": -755678090, - "io.joern:flatgraph-domain-classes-generator_3": 1301386557, - "io.joern:flatgraph-domain-classes-generator_3:jar:sources": 1912497518, - "io.joern:flatgraph-help_3": -551868212, - "io.joern:flatgraph-help_3:jar:sources": -1070617857, - "io.joern:flatgraph-odb-convert_3": 805764456, - "io.joern:flatgraph-odb-convert_3:jar:sources": 793830638, + "io.joern:flatgraph-core_3": -2129334140, + "io.joern:flatgraph-core_3:jar:sources": 1584220606, + "io.joern:flatgraph-domain-classes-generator_3": -902397633, + "io.joern:flatgraph-domain-classes-generator_3:jar:sources": -1946518416, + "io.joern:flatgraph-help_3": 692790954, + "io.joern:flatgraph-help_3:jar:sources": -444523173, + "io.joern:flatgraph-odb-convert_3": 1755290238, + "io.joern:flatgraph-odb-convert_3:jar:sources": -1249652390, "io.shiftleft:overflowdb-core_3": -1655377345, "io.shiftleft:overflowdb-core_3:jar:sources": 422126785, "net.oneandone.reflections8:reflections8": -362476393, @@ -104,10 +104,10 @@ "artifacts": { "com.github.luben:zstd-jni": { "shasums": { - "jar": "c5530c6fe99df04f9ac041e1b11fcb5772a7f4218c727d7273e0a6e5948b5d12", - "sources": "5bef1c8433fe03e605017d82112f42d0c59d337e85c000248781343203e225c4" + "jar": "e45c18832293934924e4f2f1dd97ee2083a74def46caeeea1346cf817a37cea4", + "sources": "d00e8cf840b8ccc5958e031da9bc387a6886182e8d4eee2f59ec28924a32bddd" }, - "version": "1.5.7-2" + "version": "1.5.7-11" }, "com.github.scopt:scopt_3": { "shasums": { @@ -229,31 +229,31 @@ }, "io.joern:flatgraph-core_3": { "shasums": { - "jar": "aaee2aa044223e2225ac6d67e1cba8c6628961638e94bf2faffbb6be406d9885", - "sources": "4440b7804c08d4e2bed1e7166736ddf778878c04de5fa64b2e9a58ae6945e439" + "jar": "c14dd8e8510f6762078005d747ae8b5e87047db74f94d51bfd18c158a9623699", + "sources": "283034a39afd10d88985cdc8c7c11ebda0bcd7604e61c3dde3ced502cf0ce786" }, - "version": "0.1.31" + "version": "0.1.34" }, "io.joern:flatgraph-domain-classes-generator_3": { "shasums": { - "jar": "9ce9480526043121e6d3ba21b67a5ed3944ad6dd4f36c1a8b6506c4793568977", - "sources": "1506ced55181b6e635fe46df7c7119b1a5c8e7358cdd2539fb4acbedcebde3c0" + "jar": "32a10cb32e154c6b6a6c1e77590d0200199474bb24d7edd7e204bd9c5a1ba53d", + "sources": "e86feedf36b139e74d0e7b9ee4d29c4e6a0ac2d8837fa9f5a0b552ace993854d" }, - "version": "0.1.31" + "version": "0.1.34" }, "io.joern:flatgraph-help_3": { "shasums": { - "jar": "3e1ff963cc9a87ff100a6311a4ef753d954340c3e600b6d580682616504229f8", - "sources": "7d8ea575fe7ad98af7e660e592a8348167dfe7cbf82a85f1ada72b159b210622" + "jar": "9b50d84a9959bbc739ae3d7a2d423c97f6b862705831ce04c9bcc6096450b596", + "sources": "074a0ba8ba70d1acd8d69e165fff2990862dc53909241f6ac7cf7cffb2fadcc3" }, - "version": "0.1.31" + "version": "0.1.34" }, "io.joern:flatgraph-odb-convert_3": { "shasums": { - "jar": "99512d443f609a5028ec1c1e060f8a997bae1c2dbbcb203b1880c87a16326944", - "sources": "0af913bac0c502ed4d615cd85c9f77abda6d7ceaf30ae8e5bd6c9aacc6222ba3" + "jar": "6cc159d5a4714b353ebb7325c3af1807cacaeaca18393ccbd1b1b5fd511ad966", + "sources": "da5131ec07dfa4687695fdeb1c246abc1e09e14a06e45cfcb73879a7eaa8100f" }, - "version": "0.1.31" + "version": "0.1.34" }, "io.shiftleft:overflowdb-core_3": { "shasums": { diff --git a/schema/BUILD b/schema/BUILD index 9686f1031..c8c4ed88a 100644 --- a/schema/BUILD +++ b/schema/BUILD @@ -85,13 +85,13 @@ genrule( java_import( name = "domainClassesNeverLinked", jars = [":domainClasses_jar"], + neverlink = True, srcjar = ":domainClasses_src_jar", visibility = ["//visibility:public"], exports = [ "@maven//:io_joern_flatgraph_core_3", "@maven//:io_joern_flatgraph_help_3", ], - neverlink = True, ) java_import( diff --git a/schema2json/BUILD b/schema2json/BUILD index 9a3c09cee..6502c18ee 100644 --- a/schema2json/BUILD +++ b/schema2json/BUILD @@ -6,13 +6,13 @@ scala_binary( "src/main/scala/**/*.scala", ]), main_class = "Schema2Json", + runtime_deps = [ + "//schema:domainClassesLinked", + ], deps = [ "//schema", "@maven//:com_lihaoyi_os_lib_3", "@maven//:org_json4s_json4s_ast_3", "@maven//:org_json4s_json4s_native_3", ], - runtime_deps = [ - "//schema:domainClassesLinked", - ], ) diff --git a/schema2json/src/main/scala/Schema2Json.scala b/schema2json/src/main/scala/Schema2Json.scala index 49b818b7c..367816902 100644 --- a/schema2json/src/main/scala/Schema2Json.scala +++ b/schema2json/src/main/scala/Schema2Json.scala @@ -6,20 +6,22 @@ import org.json4s.{Formats, NoTypeHints} import flatgraph.schema.Property.Cardinality import flatgraph.schema.{AbstractNodeType, NodeBaseType, NodeType, Property, SchemaInfo} -object Schema2Json extends App { +object Schema2Json { val schema = CpgSchema.instance implicit val formats: AnyRef & Formats = Serialization.formats(NoTypeHints) - val json = - ("schemas" -> schemaSummary) ~ ("nodes" -> nodeTypesAsJson) ~ ("edges" -> edgeTypesAsJson) ~ ("properties" -> propertiesAsJson) + def main(args: Array[String]): Unit = { + val json = + ("schemas" -> schemaSummary) ~ ("nodes" -> nodeTypesAsJson) ~ ("edges" -> edgeTypesAsJson) ~ ("properties" -> propertiesAsJson) - val outFileName = "/tmp/schema.json" - os.write(os.Path(outFileName), compact(render(json))) - // Files.writeString(Paths.get(outFileName), compact(render(json))) - println(s"Schema written to: $outFileName") + val outFileName = "/tmp/schema.json" + os.write(os.Path(outFileName), compact(render(json))) + // Files.writeString(Paths.get(outFileName), compact(render(json))) + println(s"Schema written to: $outFileName") + } private def schemaName(nodeType: AbstractNodeType): String = schemaName(nodeType.schemaInfo)