diff --git a/codepropertygraph/src/main/scala/io/shiftleft/utils/TempFileCopy.scala b/codepropertygraph/src/main/scala/io/shiftleft/utils/TempFileCopy.scala new file mode 100644 index 000000000..67acb231f --- /dev/null +++ b/codepropertygraph/src/main/scala/io/shiftleft/utils/TempFileCopy.scala @@ -0,0 +1,15 @@ +package io.shiftleft.utils + +import java.nio.file.Path +import java.nio.file.Files +import java.nio.file.StandardCopyOption + +class TempFileCopy(sourcePath: Path, prefix: String = "resource", suffix: String = ".tmp") extends AutoCloseable { + val path: Path = { + val temp = Files.createTempFile(prefix, suffix) + Files.copy(sourcePath, temp, StandardCopyOption.REPLACE_EXISTING) + temp + } + + override def close() = Files.deleteIfExists(path) +} diff --git a/codepropertygraph/src/test/scala/io/shiftleft/codepropertygraph/cpgloading/CpgLoaderTests.scala b/codepropertygraph/src/test/scala/io/shiftleft/codepropertygraph/cpgloading/CpgLoaderTests.scala index 285522d0b..35a242461 100644 --- a/codepropertygraph/src/test/scala/io/shiftleft/codepropertygraph/cpgloading/CpgLoaderTests.scala +++ b/codepropertygraph/src/test/scala/io/shiftleft/codepropertygraph/cpgloading/CpgLoaderTests.scala @@ -3,7 +3,7 @@ package io.shiftleft.codepropertygraph.cpgloading import flatgraph.{Accessors, DiffGraphApplier} import io.shiftleft.codepropertygraph.generated.Cpg import io.shiftleft.codepropertygraph.generated.nodes.NewMethod -import io.shiftleft.utils.ProjectRoot +import io.shiftleft.utils.{ProjectRoot, TempFileCopy} import io.shiftleft.codepropertygraph.generated.nodes.Type import org.scalatest.BeforeAndAfterAll import org.scalatest.matchers.should.Matchers @@ -44,16 +44,15 @@ class CpgLoaderTests extends AnyWordSpec with Matchers with BeforeAndAfterAll { } "allow loading of CPG in flatgraph format" in { - val flatgraphCpg = ProjectRoot.relativise("codepropertygraph/src/test/resources/cpg.fg") - Using.resource(CpgLoader.load(flatgraphCpg)) { cpg => - // the test graph was created by c2cpg for https://github.com/joernio/joern/blob/master/tests/code/c/test.c + Using.Manager { use => + val flatgraphCpg = use(temporaryFlatgraphCpg()).path + val cpg = use(CpgLoader.load(flatgraphCpg)) cpg.graph.nodes("METHOD").size shouldBe 4 - } + }.get } "allow loading of CPG in flatgraph format and persist changes to separate file" in { - val flatgraphCpg = Paths.get(ProjectRoot.relativise("codepropertygraph/src/test/resources/cpg.fg")) - val persistTo = Files.createTempFile(getClass.getSimpleName, "persistToTest") + val persistTo = Files.createTempFile(getClass.getSimpleName, "persistToTest") Using.resource(CpgLoader.load(flatgraphCpg, persistTo)) { cpg => DiffGraphApplier.applyDiff(cpg.graph, Cpg.newDiffGraphBuilder.addNode(NewMethod())) @@ -63,14 +62,22 @@ class CpgLoaderTests extends AnyWordSpec with Matchers with BeforeAndAfterAll { cpg.graph.nodes("METHOD").size shouldBe 5 } - Using.resource(CpgLoader.load(flatgraphCpg)) { cpg => + Using.Manager { use => + val flatgraphCpg = use(temporaryFlatgraphCpg()).path + val cpg = use(CpgLoader.load(flatgraphCpg)) // original cpg should be unchanged cpg.graph.nodes("METHOD").size shouldBe 4 - } + }.get } "throw an appropriate exception if the provided filename that refers to a non-existing file" in { a[FileNotFoundException] should be thrownBy CpgLoader.load("invalid/path/cpg.bin.zip") } + /** this test graph was created by c2cpg for https://github.com/joernio/joern/blob/master/tests/code/c/test.c */ + val flatgraphCpg = Paths.get(ProjectRoot.relativise("codepropertygraph/src/test/resources/cpg.fg")) + + /** flatgraph writes to this file on 'close', so we'll create a temporary copy */ + private def temporaryFlatgraphCpg(): TempFileCopy = + TempFileCopy(flatgraphCpg) } diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/Cpg.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/Cpg.scala index 1985bc35c..94a5f3a8b 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/Cpg.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/Cpg.scala @@ -331,17 +331,13 @@ contains the entire local variable declaration without initialization, e.g., for /** Shorthand for local.name */ def local(name: String): Iterator[nodes.Local] = local.name(name) - /** A location node summarizes a source code location. */ - @flatgraph.help.Doc(info = """A location node summarizes a source code location.""") - def location: Iterator[nodes.Location] = wrappedCpg.graph._nodes(23).asInstanceOf[Iterator[nodes.Location]] - /** This node represents a type member of a class, struct or union, e.g., for the type declaration * `class Foo{ int i ; }`, it represents the declaration of the variable `i`. */ @flatgraph.help.Doc(info = """This node represents a type member of a class, struct or union, e.g., for the type declaration `class Foo{ int i ; }`, it represents the declaration of the variable `i`.""") - def member: Iterator[nodes.Member] = wrappedCpg.graph._nodes(24).asInstanceOf[Iterator[nodes.Member]] + def member: Iterator[nodes.Member] = wrappedCpg.graph._nodes(23).asInstanceOf[Iterator[nodes.Member]] /** Shorthand for member.name */ def member(name: String): Iterator[nodes.Member] = member.name(name) @@ -357,7 +353,7 @@ over the source files this CPG was generated from. The `VERSION` MUST be set to the version of the specification ("1.1"). The language field indicates which language frontend was used to generate the CPG and the list property `OVERLAYS` specifies which overlays have been applied to the CPG.""") - def metaData: Iterator[nodes.MetaData] = wrappedCpg.graph._nodes(25).asInstanceOf[Iterator[nodes.MetaData]] + def metaData: Iterator[nodes.MetaData] = wrappedCpg.graph._nodes(24).asInstanceOf[Iterator[nodes.MetaData]] /** Programming languages offer many closely-related concepts for describing blocks of code that can be executed with * input parameters and return output parameters, possibly causing side effects. In the CPG specification, we refer @@ -400,7 +396,7 @@ Finally, the fully qualified name of the program constructs that the method is immediately contained in is stored in the `AST_PARENT_FULL_NAME` field and its type is indicated in the `AST_PARENT_TYPE` field to be one of `METHOD`, `TYPE_DECL` or `NAMESPACE_BLOCK`.""") - def method: Iterator[nodes.Method] = wrappedCpg.graph._nodes(26).asInstanceOf[Iterator[nodes.Method]] + def method: Iterator[nodes.Method] = wrappedCpg.graph._nodes(25).asInstanceOf[Iterator[nodes.Method]] /** Shorthand for method.name */ def method(name: String): Iterator[nodes.Method] = method.name(name) @@ -411,7 +407,7 @@ and its type is indicated in the `AST_PARENT_TYPE` field to be one of @flatgraph.help.Doc(info = """This node represents a formal input parameter. The field `NAME` contains its name, while the field `TYPE_FULL_NAME` contains the fully qualified type name.""") def methodParameterIn: Iterator[nodes.MethodParameterIn] = - wrappedCpg.graph._nodes(27).asInstanceOf[Iterator[nodes.MethodParameterIn]] + wrappedCpg.graph._nodes(26).asInstanceOf[Iterator[nodes.MethodParameterIn]] /** Shorthand for methodParameterIn.name */ def methodParameterIn(name: String): Iterator[nodes.MethodParameterIn] = methodParameterIn.name(name) @@ -423,7 +419,7 @@ name, while the field `TYPE_FULL_NAME` contains the fully qualified type name."" for input parameters MUST NOT be created by the frontend as they are automatically created upon first loading the CPG.""") def methodParameterOut: Iterator[nodes.MethodParameterOut] = - wrappedCpg.graph._nodes(28).asInstanceOf[Iterator[nodes.MethodParameterOut]] + wrappedCpg.graph._nodes(27).asInstanceOf[Iterator[nodes.MethodParameterOut]] /** This node represents a reference to a method/function/procedure as it appears when a method is passed as an * argument in a call. The `METHOD_FULL_NAME` field holds the fully-qualified name of the referenced method and the @@ -433,7 +429,7 @@ created upon first loading the CPG.""") appears when a method is passed as an argument in a call. The `METHOD_FULL_NAME` field holds the fully-qualified name of the referenced method and the `TYPE_FULL_NAME` holds its fully-qualified type name.""") - def methodRef: Iterator[nodes.MethodRef] = wrappedCpg.graph._nodes(29).asInstanceOf[Iterator[nodes.MethodRef]] + def methodRef: Iterator[nodes.MethodRef] = wrappedCpg.graph._nodes(28).asInstanceOf[Iterator[nodes.MethodRef]] /** This node represents an (unnamed) formal method return parameter. It carries its fully qualified type name in * `TYPE_FULL_NAME`. The `CODE` field MAY be set freely, e.g., to the constant `RET`, however, subsequent layer @@ -444,7 +440,7 @@ fully qualified type name in `TYPE_FULL_NAME`. The `CODE` field MAY be set freel e.g., to the constant `RET`, however, subsequent layer creators MUST NOT depend on this value.""") def methodReturn: Iterator[nodes.MethodReturn] = - wrappedCpg.graph._nodes(30).asInstanceOf[Iterator[nodes.MethodReturn]] + wrappedCpg.graph._nodes(29).asInstanceOf[Iterator[nodes.MethodReturn]] /** This field represents a (language-dependent) modifier such as `static`, `private` or `public`. Unlike most other * AST nodes, it is NOT an expression, that is, it cannot be evaluated and cannot be passed as an argument in @@ -453,7 +449,7 @@ on this value.""") @flatgraph.help.Doc(info = """This field represents a (language-dependent) modifier such as `static`, `private` or `public`. Unlike most other AST nodes, it is NOT an expression, that is, it cannot be evaluated and cannot be passed as an argument in function calls.""") - def modifier: Iterator[nodes.Modifier] = wrappedCpg.graph._nodes(31).asInstanceOf[Iterator[nodes.Modifier]] + def modifier: Iterator[nodes.Modifier] = wrappedCpg.graph._nodes(30).asInstanceOf[Iterator[nodes.Modifier]] /** This node represents a namespace. Similar to FILE nodes, NAMESPACE nodes serve as indices that allow all * definitions inside a namespace to be obtained by following outgoing edges from a NAMESPACE node. @@ -468,7 +464,7 @@ obtained by following outgoing edges from a NAMESPACE node. NAMESPACE nodes MUST NOT be created by language frontends. Instead, they are generated from NAMESPACE_BLOCK nodes automatically upon first loading of the CPG.""") - def namespace: Iterator[nodes.Namespace] = wrappedCpg.graph._nodes(32).asInstanceOf[Iterator[nodes.Namespace]] + def namespace: Iterator[nodes.Namespace] = wrappedCpg.graph._nodes(31).asInstanceOf[Iterator[nodes.Namespace]] /** Shorthand for namespace.name */ def namespace(name: String): Iterator[nodes.Namespace] = namespace.name(name) @@ -500,7 +496,7 @@ The name should be given in dot-separated form where a dot indicates that the right hand side is a sub namespace of the left hand side, e.g., `foo.bar` denotes the namespace `bar` contained in the namespace `foo`.""") def namespaceBlock: Iterator[nodes.NamespaceBlock] = - wrappedCpg.graph._nodes(33).asInstanceOf[Iterator[nodes.NamespaceBlock]] + wrappedCpg.graph._nodes(32).asInstanceOf[Iterator[nodes.NamespaceBlock]] /** Shorthand for namespaceBlock.name */ def namespaceBlock(name: String): Iterator[nodes.NamespaceBlock] = namespaceBlock.name(name) @@ -511,31 +507,31 @@ that the right hand side is a sub namespace of the left hand side, e.g., @flatgraph.help.Doc(info = """This node represents a return instruction, e.g., `return x`. Note that it does NOT represent a formal return parameter as formal return parameters are represented via `METHOD_RETURN` nodes.""") - def ret: Iterator[nodes.Return] = wrappedCpg.graph._nodes(34).asInstanceOf[Iterator[nodes.Return]] + def ret: Iterator[nodes.Return] = wrappedCpg.graph._nodes(33).asInstanceOf[Iterator[nodes.Return]] /** Shorthand for ret.code */ def ret(code: String): Iterator[nodes.Return] = ret.code(code) /** This node represents a tag. */ @flatgraph.help.Doc(info = """This node represents a tag.""") - def tag: Iterator[nodes.Tag] = wrappedCpg.graph._nodes(35).asInstanceOf[Iterator[nodes.Tag]] + def tag: Iterator[nodes.Tag] = wrappedCpg.graph._nodes(34).asInstanceOf[Iterator[nodes.Tag]] /** Shorthand for tag.name */ def tag(name: String): Iterator[nodes.Tag] = tag.name(name) /** This node contains an arbitrary node and an associated tag node. */ @flatgraph.help.Doc(info = """This node contains an arbitrary node and an associated tag node.""") - def tagNodePair: Iterator[nodes.TagNodePair] = wrappedCpg.graph._nodes(36).asInstanceOf[Iterator[nodes.TagNodePair]] + def tagNodePair: Iterator[nodes.TagNodePair] = wrappedCpg.graph._nodes(35).asInstanceOf[Iterator[nodes.TagNodePair]] /** This node represents a DOM node used in template languages, e.g., JSX/TSX */ @flatgraph.help.Doc(info = """This node represents a DOM node used in template languages, e.g., JSX/TSX""") - def templateDom: Iterator[nodes.TemplateDom] = wrappedCpg.graph._nodes(37).asInstanceOf[Iterator[nodes.TemplateDom]] + def templateDom: Iterator[nodes.TemplateDom] = wrappedCpg.graph._nodes(36).asInstanceOf[Iterator[nodes.TemplateDom]] /** This node represents a type instance, that is, a concrete instantiation of a type declaration. */ @flatgraph.help.Doc(info = """This node represents a type instance, that is, a concrete instantiation of a type declaration.""") - def typ: Iterator[nodes.Type] = wrappedCpg.graph._nodes(38).asInstanceOf[Iterator[nodes.Type]] + def typ: Iterator[nodes.Type] = wrappedCpg.graph._nodes(37).asInstanceOf[Iterator[nodes.Type]] /** Shorthand for typ.name */ def typ(name: String): Iterator[nodes.Type] = typ.name(name) @@ -550,7 +546,7 @@ at method call sites. As it true for arguments, the method is not expected to interpret the type argument. It MUST however store its code in the `CODE` field.""") def typeArgument: Iterator[nodes.TypeArgument] = - wrappedCpg.graph._nodes(39).asInstanceOf[Iterator[nodes.TypeArgument]] + wrappedCpg.graph._nodes(38).asInstanceOf[Iterator[nodes.TypeArgument]] /** This node represents a type declaration as for example given by a class-, struct-, or union declaration. In * contrast to a `TYPE` node, this node does not represent a concrete instantiation of a type, e.g., for the @@ -598,7 +594,7 @@ Finally, the fully qualified name of the program constructs that the type declar is immediately contained in is stored in the `AST_PARENT_FULL_NAME` field and its type is indicated in the `AST_PARENT_TYPE` field to be one of `METHOD`, `TYPE_DECL` or `NAMESPACE_BLOCK`.""") - def typeDecl: Iterator[nodes.TypeDecl] = wrappedCpg.graph._nodes(40).asInstanceOf[Iterator[nodes.TypeDecl]] + def typeDecl: Iterator[nodes.TypeDecl] = wrappedCpg.graph._nodes(39).asInstanceOf[Iterator[nodes.TypeDecl]] /** Shorthand for typeDecl.name */ def typeDecl(name: String): Iterator[nodes.TypeDecl] = typeDecl.name(name) @@ -614,11 +610,11 @@ languages that support type parameters are Java (via Generics) and C++ (via templates). Apart from the standard fields of AST nodes, the type parameter carries only a `NAME` field that holds the parameters name.""") def typeParameter: Iterator[nodes.TypeParameter] = - wrappedCpg.graph._nodes(41).asInstanceOf[Iterator[nodes.TypeParameter]] + wrappedCpg.graph._nodes(40).asInstanceOf[Iterator[nodes.TypeParameter]] /** Reference to a type/class */ @flatgraph.help.Doc(info = """Reference to a type/class""") - def typeRef: Iterator[nodes.TypeRef] = wrappedCpg.graph._nodes(42).asInstanceOf[Iterator[nodes.TypeRef]] + def typeRef: Iterator[nodes.TypeRef] = wrappedCpg.graph._nodes(41).asInstanceOf[Iterator[nodes.TypeRef]] /** Any AST node that the frontend would like to include in the AST but for which no suitable AST node is specified in * the CPG specification may be included using a node of type `UNKNOWN`. @@ -626,7 +622,7 @@ parameter carries only a `NAME` field that holds the parameters name.""") @flatgraph.help.Doc(info = """Any AST node that the frontend would like to include in the AST but for which no suitable AST node is specified in the CPG specification may be included using a node of type `UNKNOWN`.""") - def unknown: Iterator[nodes.Unknown] = wrappedCpg.graph._nodes(43).asInstanceOf[Iterator[nodes.Unknown]] + def unknown: Iterator[nodes.Unknown] = wrappedCpg.graph._nodes(42).asInstanceOf[Iterator[nodes.Unknown]] /** This is the base type for all nodes of the abstract syntax tree (AST). An AST node has a `CODE` and an `ORDER` * field. The `CODE` field contains the code (verbatim) represented by the AST node. The `ORDER` field contains the diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/GraphSchema.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/GraphSchema.scala index 6900e194b..054ce075e 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/GraphSchema.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/GraphSchema.scala @@ -27,7 +27,6 @@ object GraphSchema extends flatgraph.Schema { "KEY_VALUE_PAIR", "LITERAL", "LOCAL", - "LOCATION", "MEMBER", "META_DATA", "METHOD", @@ -127,7 +126,6 @@ object GraphSchema extends flatgraph.Schema { (g, seq) => new nodes.KeyValuePair(g, seq), (g, seq) => new nodes.Literal(g, seq), (g, seq) => new nodes.Local(g, seq), - (g, seq) => new nodes.Location(g, seq), (g, seq) => new nodes.Member(g, seq), (g, seq) => new nodes.MetaData(g, seq), (g, seq) => new nodes.Method(g, seq), @@ -185,8 +183,6 @@ object GraphSchema extends flatgraph.Schema { size => new Array[String](size), size => new Array[String](size), size => new Array[String](size), - size => new Array[String](size), - size => new Array[String](size), size => new Array[Int](size), size => new Array[Int](size), size => new Array[String](size), @@ -217,8 +213,6 @@ object GraphSchema extends flatgraph.Schema { size => new Array[String](size), size => new Array[String](size), size => new Array[String](size), - size => new Array[String](size), - size => new Array[String](size), size => new Array[Int](size), size => new Array[Int](size), size => new Array[Int](size), @@ -231,8 +225,6 @@ object GraphSchema extends flatgraph.Schema { size => new Array[String](size), size => new Array[String](size), size => new Array[String](size), - size => new Array[String](size), - size => new Array[String](size), size => new Array[flatgraph.GNode](size), size => new Array[flatgraph.GNode](size), size => new Array[flatgraph.GNode](size), @@ -245,8 +237,6 @@ object GraphSchema extends flatgraph.Schema { "AST_PARENT_FULL_NAME", "AST_PARENT_TYPE", "CANONICAL_NAME", - "CLASS_NAME", - "CLASS_SHORT_NAME", "CLOSURE_BINDING_ID", "CLOSURE_ORIGINAL_NAME", "CODE", @@ -278,1176 +268,1139 @@ object GraphSchema extends flatgraph.Schema { "LINE_NUMBER", "LINE_NUMBER_END", "METHOD_FULL_NAME", - "METHOD_SHORT_NAME", "MODIFIER_TYPE", "NAME", - "NODE_LABEL", "OFFSET", "OFFSET_END", "ORDER", "OVERLAYS", - "PACKAGE_NAME", "PARSER_TYPE_NAME", "POSSIBLE_TYPES", "ROOT", "SIGNATURE", - "SYMBOL", "TYPE_DECL_FULL_NAME", "TYPE_FULL_NAME", "VALUE", "VERSION" ) val nodePropertyByLabel = normalNodePropertyNames.zipWithIndex.toMap - .updated("evidence", 57) - .updated("keyValuePairs", 58) - .updated("node", 59) - .updated("tag", 60) + .updated("evidence", 51) + .updated("keyValuePairs", 52) + .updated("node", 53) + .updated("tag", 54) val nodePropertyDescriptors: Array[FormalQtyType.FormalQuantity | FormalQtyType.FormalType] = { - val nodePropertyDescriptors = new Array[FormalQtyType.FormalQuantity | FormalQtyType.FormalType](5368) - for (idx <- Range(0, 5368)) { + val nodePropertyDescriptors = new Array[FormalQtyType.FormalQuantity | FormalQtyType.FormalType](4730) + for (idx <- Range(0, 4730)) { nodePropertyDescriptors(idx) = if ((idx & 1) == 0) FormalQtyType.NothingType else FormalQtyType.QtyNone } - nodePropertyDescriptors(88) = FormalQtyType.IntType // ANNOTATION.ARGUMENT_INDEX + nodePropertyDescriptors(86) = FormalQtyType.IntType // ANNOTATION.ARGUMENT_INDEX + nodePropertyDescriptors(87) = FormalQtyType.QtyOne + nodePropertyDescriptors(172) = FormalQtyType.StringType // ANNOTATION.ARGUMENT_NAME + nodePropertyDescriptors(173) = FormalQtyType.QtyOption + nodePropertyDescriptors(688) = FormalQtyType.StringType // ANNOTATION.CODE + nodePropertyDescriptors(689) = FormalQtyType.QtyOne + nodePropertyDescriptors(774) = FormalQtyType.IntType // ANNOTATION.COLUMN_NUMBER + nodePropertyDescriptors(775) = FormalQtyType.QtyOption + nodePropertyDescriptors(1806) = FormalQtyType.StringType // ANNOTATION.FULL_NAME + nodePropertyDescriptors(1807) = FormalQtyType.QtyOne + nodePropertyDescriptors(2924) = FormalQtyType.IntType // ANNOTATION.LINE_NUMBER + nodePropertyDescriptors(2925) = FormalQtyType.QtyOption + nodePropertyDescriptors(3268) = FormalQtyType.StringType // ANNOTATION.NAME + nodePropertyDescriptors(3269) = FormalQtyType.QtyOne + nodePropertyDescriptors(3354) = FormalQtyType.IntType // ANNOTATION.OFFSET + nodePropertyDescriptors(3355) = FormalQtyType.QtyOption + nodePropertyDescriptors(3440) = FormalQtyType.IntType // ANNOTATION.OFFSET_END + nodePropertyDescriptors(3441) = FormalQtyType.QtyOption + nodePropertyDescriptors(3526) = FormalQtyType.IntType // ANNOTATION.ORDER + nodePropertyDescriptors(3527) = FormalQtyType.QtyOne + nodePropertyDescriptors(88) = FormalQtyType.IntType // ANNOTATION_LITERAL.ARGUMENT_INDEX nodePropertyDescriptors(89) = FormalQtyType.QtyOne - nodePropertyDescriptors(176) = FormalQtyType.StringType // ANNOTATION.ARGUMENT_NAME - nodePropertyDescriptors(177) = FormalQtyType.QtyOption - nodePropertyDescriptors(880) = FormalQtyType.StringType // ANNOTATION.CODE - nodePropertyDescriptors(881) = FormalQtyType.QtyOne - nodePropertyDescriptors(968) = FormalQtyType.IntType // ANNOTATION.COLUMN_NUMBER - nodePropertyDescriptors(969) = FormalQtyType.QtyOption - nodePropertyDescriptors(2024) = FormalQtyType.StringType // ANNOTATION.FULL_NAME - nodePropertyDescriptors(2025) = FormalQtyType.QtyOne - nodePropertyDescriptors(3168) = FormalQtyType.IntType // ANNOTATION.LINE_NUMBER - nodePropertyDescriptors(3169) = FormalQtyType.QtyOption - nodePropertyDescriptors(3608) = FormalQtyType.StringType // ANNOTATION.NAME - nodePropertyDescriptors(3609) = FormalQtyType.QtyOne - nodePropertyDescriptors(3784) = FormalQtyType.IntType // ANNOTATION.OFFSET - nodePropertyDescriptors(3785) = FormalQtyType.QtyOption - nodePropertyDescriptors(3872) = FormalQtyType.IntType // ANNOTATION.OFFSET_END - nodePropertyDescriptors(3873) = FormalQtyType.QtyOption - nodePropertyDescriptors(3960) = FormalQtyType.IntType // ANNOTATION.ORDER - nodePropertyDescriptors(3961) = FormalQtyType.QtyOne - nodePropertyDescriptors(90) = FormalQtyType.IntType // ANNOTATION_LITERAL.ARGUMENT_INDEX - nodePropertyDescriptors(91) = FormalQtyType.QtyOne - nodePropertyDescriptors(178) = FormalQtyType.StringType // ANNOTATION_LITERAL.ARGUMENT_NAME - nodePropertyDescriptors(179) = FormalQtyType.QtyOption - nodePropertyDescriptors(882) = FormalQtyType.StringType // ANNOTATION_LITERAL.CODE - nodePropertyDescriptors(883) = FormalQtyType.QtyOne - nodePropertyDescriptors(970) = FormalQtyType.IntType // ANNOTATION_LITERAL.COLUMN_NUMBER - nodePropertyDescriptors(971) = FormalQtyType.QtyOption - nodePropertyDescriptors(3170) = FormalQtyType.IntType // ANNOTATION_LITERAL.LINE_NUMBER - nodePropertyDescriptors(3171) = FormalQtyType.QtyOption - nodePropertyDescriptors(3610) = FormalQtyType.StringType // ANNOTATION_LITERAL.NAME - nodePropertyDescriptors(3611) = FormalQtyType.QtyOne - nodePropertyDescriptors(3786) = FormalQtyType.IntType // ANNOTATION_LITERAL.OFFSET - nodePropertyDescriptors(3787) = FormalQtyType.QtyOption - nodePropertyDescriptors(3874) = FormalQtyType.IntType // ANNOTATION_LITERAL.OFFSET_END - nodePropertyDescriptors(3875) = FormalQtyType.QtyOption - nodePropertyDescriptors(3962) = FormalQtyType.IntType // ANNOTATION_LITERAL.ORDER - nodePropertyDescriptors(3963) = FormalQtyType.QtyOne - nodePropertyDescriptors(884) = FormalQtyType.StringType // ANNOTATION_PARAMETER.CODE - nodePropertyDescriptors(885) = FormalQtyType.QtyOne - nodePropertyDescriptors(972) = FormalQtyType.IntType // ANNOTATION_PARAMETER.COLUMN_NUMBER - nodePropertyDescriptors(973) = FormalQtyType.QtyOption - nodePropertyDescriptors(3172) = FormalQtyType.IntType // ANNOTATION_PARAMETER.LINE_NUMBER - nodePropertyDescriptors(3173) = FormalQtyType.QtyOption - nodePropertyDescriptors(3788) = FormalQtyType.IntType // ANNOTATION_PARAMETER.OFFSET - nodePropertyDescriptors(3789) = FormalQtyType.QtyOption - nodePropertyDescriptors(3876) = FormalQtyType.IntType // ANNOTATION_PARAMETER.OFFSET_END - nodePropertyDescriptors(3877) = FormalQtyType.QtyOption - nodePropertyDescriptors(3964) = FormalQtyType.IntType // ANNOTATION_PARAMETER.ORDER - nodePropertyDescriptors(3965) = FormalQtyType.QtyOne - nodePropertyDescriptors(886) = FormalQtyType.StringType // ANNOTATION_PARAMETER_ASSIGN.CODE - nodePropertyDescriptors(887) = FormalQtyType.QtyOne - nodePropertyDescriptors(974) = FormalQtyType.IntType // ANNOTATION_PARAMETER_ASSIGN.COLUMN_NUMBER - nodePropertyDescriptors(975) = FormalQtyType.QtyOption - nodePropertyDescriptors(3174) = FormalQtyType.IntType // ANNOTATION_PARAMETER_ASSIGN.LINE_NUMBER - nodePropertyDescriptors(3175) = FormalQtyType.QtyOption - nodePropertyDescriptors(3790) = FormalQtyType.IntType // ANNOTATION_PARAMETER_ASSIGN.OFFSET - nodePropertyDescriptors(3791) = FormalQtyType.QtyOption - nodePropertyDescriptors(3878) = FormalQtyType.IntType // ANNOTATION_PARAMETER_ASSIGN.OFFSET_END - nodePropertyDescriptors(3879) = FormalQtyType.QtyOption - nodePropertyDescriptors(3966) = FormalQtyType.IntType // ANNOTATION_PARAMETER_ASSIGN.ORDER + nodePropertyDescriptors(174) = FormalQtyType.StringType // ANNOTATION_LITERAL.ARGUMENT_NAME + nodePropertyDescriptors(175) = FormalQtyType.QtyOption + nodePropertyDescriptors(690) = FormalQtyType.StringType // ANNOTATION_LITERAL.CODE + nodePropertyDescriptors(691) = FormalQtyType.QtyOne + nodePropertyDescriptors(776) = FormalQtyType.IntType // ANNOTATION_LITERAL.COLUMN_NUMBER + nodePropertyDescriptors(777) = FormalQtyType.QtyOption + nodePropertyDescriptors(2926) = FormalQtyType.IntType // ANNOTATION_LITERAL.LINE_NUMBER + nodePropertyDescriptors(2927) = FormalQtyType.QtyOption + nodePropertyDescriptors(3270) = FormalQtyType.StringType // ANNOTATION_LITERAL.NAME + nodePropertyDescriptors(3271) = FormalQtyType.QtyOne + nodePropertyDescriptors(3356) = FormalQtyType.IntType // ANNOTATION_LITERAL.OFFSET + nodePropertyDescriptors(3357) = FormalQtyType.QtyOption + nodePropertyDescriptors(3442) = FormalQtyType.IntType // ANNOTATION_LITERAL.OFFSET_END + nodePropertyDescriptors(3443) = FormalQtyType.QtyOption + nodePropertyDescriptors(3528) = FormalQtyType.IntType // ANNOTATION_LITERAL.ORDER + nodePropertyDescriptors(3529) = FormalQtyType.QtyOne + nodePropertyDescriptors(692) = FormalQtyType.StringType // ANNOTATION_PARAMETER.CODE + nodePropertyDescriptors(693) = FormalQtyType.QtyOne + nodePropertyDescriptors(778) = FormalQtyType.IntType // ANNOTATION_PARAMETER.COLUMN_NUMBER + nodePropertyDescriptors(779) = FormalQtyType.QtyOption + nodePropertyDescriptors(2928) = FormalQtyType.IntType // ANNOTATION_PARAMETER.LINE_NUMBER + nodePropertyDescriptors(2929) = FormalQtyType.QtyOption + nodePropertyDescriptors(3358) = FormalQtyType.IntType // ANNOTATION_PARAMETER.OFFSET + nodePropertyDescriptors(3359) = FormalQtyType.QtyOption + nodePropertyDescriptors(3444) = FormalQtyType.IntType // ANNOTATION_PARAMETER.OFFSET_END + nodePropertyDescriptors(3445) = FormalQtyType.QtyOption + nodePropertyDescriptors(3530) = FormalQtyType.IntType // ANNOTATION_PARAMETER.ORDER + nodePropertyDescriptors(3531) = FormalQtyType.QtyOne + nodePropertyDescriptors(694) = FormalQtyType.StringType // ANNOTATION_PARAMETER_ASSIGN.CODE + nodePropertyDescriptors(695) = FormalQtyType.QtyOne + nodePropertyDescriptors(780) = FormalQtyType.IntType // ANNOTATION_PARAMETER_ASSIGN.COLUMN_NUMBER + nodePropertyDescriptors(781) = FormalQtyType.QtyOption + nodePropertyDescriptors(2930) = FormalQtyType.IntType // ANNOTATION_PARAMETER_ASSIGN.LINE_NUMBER + nodePropertyDescriptors(2931) = FormalQtyType.QtyOption + nodePropertyDescriptors(3360) = FormalQtyType.IntType // ANNOTATION_PARAMETER_ASSIGN.OFFSET + nodePropertyDescriptors(3361) = FormalQtyType.QtyOption + nodePropertyDescriptors(3446) = FormalQtyType.IntType // ANNOTATION_PARAMETER_ASSIGN.OFFSET_END + nodePropertyDescriptors(3447) = FormalQtyType.QtyOption + nodePropertyDescriptors(3532) = FormalQtyType.IntType // ANNOTATION_PARAMETER_ASSIGN.ORDER + nodePropertyDescriptors(3533) = FormalQtyType.QtyOne + nodePropertyDescriptors(94) = FormalQtyType.IntType // ARRAY_INITIALIZER.ARGUMENT_INDEX + nodePropertyDescriptors(95) = FormalQtyType.QtyOne + nodePropertyDescriptors(180) = FormalQtyType.StringType // ARRAY_INITIALIZER.ARGUMENT_NAME + nodePropertyDescriptors(181) = FormalQtyType.QtyOption + nodePropertyDescriptors(696) = FormalQtyType.StringType // ARRAY_INITIALIZER.CODE + nodePropertyDescriptors(697) = FormalQtyType.QtyOne + nodePropertyDescriptors(782) = FormalQtyType.IntType // ARRAY_INITIALIZER.COLUMN_NUMBER + nodePropertyDescriptors(783) = FormalQtyType.QtyOption + nodePropertyDescriptors(2932) = FormalQtyType.IntType // ARRAY_INITIALIZER.LINE_NUMBER + nodePropertyDescriptors(2933) = FormalQtyType.QtyOption + nodePropertyDescriptors(3362) = FormalQtyType.IntType // ARRAY_INITIALIZER.OFFSET + nodePropertyDescriptors(3363) = FormalQtyType.QtyOption + nodePropertyDescriptors(3448) = FormalQtyType.IntType // ARRAY_INITIALIZER.OFFSET_END + nodePropertyDescriptors(3449) = FormalQtyType.QtyOption + nodePropertyDescriptors(3534) = FormalQtyType.IntType // ARRAY_INITIALIZER.ORDER + nodePropertyDescriptors(3535) = FormalQtyType.QtyOne + nodePropertyDescriptors(3106) = FormalQtyType.StringType // BINDING.METHOD_FULL_NAME + nodePropertyDescriptors(3107) = FormalQtyType.QtyOne + nodePropertyDescriptors(3278) = FormalQtyType.StringType // BINDING.NAME + nodePropertyDescriptors(3279) = FormalQtyType.QtyOne + nodePropertyDescriptors(3966) = FormalQtyType.StringType // BINDING.SIGNATURE nodePropertyDescriptors(3967) = FormalQtyType.QtyOne - nodePropertyDescriptors(96) = FormalQtyType.IntType // ARRAY_INITIALIZER.ARGUMENT_INDEX - nodePropertyDescriptors(97) = FormalQtyType.QtyOne - nodePropertyDescriptors(184) = FormalQtyType.StringType // ARRAY_INITIALIZER.ARGUMENT_NAME + nodePropertyDescriptors(98) = FormalQtyType.IntType // BLOCK.ARGUMENT_INDEX + nodePropertyDescriptors(99) = FormalQtyType.QtyOne + nodePropertyDescriptors(184) = FormalQtyType.StringType // BLOCK.ARGUMENT_NAME nodePropertyDescriptors(185) = FormalQtyType.QtyOption - nodePropertyDescriptors(888) = FormalQtyType.StringType // ARRAY_INITIALIZER.CODE - nodePropertyDescriptors(889) = FormalQtyType.QtyOne - nodePropertyDescriptors(976) = FormalQtyType.IntType // ARRAY_INITIALIZER.COLUMN_NUMBER - nodePropertyDescriptors(977) = FormalQtyType.QtyOption - nodePropertyDescriptors(3176) = FormalQtyType.IntType // ARRAY_INITIALIZER.LINE_NUMBER - nodePropertyDescriptors(3177) = FormalQtyType.QtyOption - nodePropertyDescriptors(3792) = FormalQtyType.IntType // ARRAY_INITIALIZER.OFFSET - nodePropertyDescriptors(3793) = FormalQtyType.QtyOption - nodePropertyDescriptors(3880) = FormalQtyType.IntType // ARRAY_INITIALIZER.OFFSET_END - nodePropertyDescriptors(3881) = FormalQtyType.QtyOption - nodePropertyDescriptors(3968) = FormalQtyType.IntType // ARRAY_INITIALIZER.ORDER - nodePropertyDescriptors(3969) = FormalQtyType.QtyOne - nodePropertyDescriptors(3354) = FormalQtyType.StringType // BINDING.METHOD_FULL_NAME - nodePropertyDescriptors(3355) = FormalQtyType.QtyOne - nodePropertyDescriptors(3618) = FormalQtyType.StringType // BINDING.NAME - nodePropertyDescriptors(3619) = FormalQtyType.QtyOne - nodePropertyDescriptors(4498) = FormalQtyType.StringType // BINDING.SIGNATURE - nodePropertyDescriptors(4499) = FormalQtyType.QtyOne - nodePropertyDescriptors(100) = FormalQtyType.IntType // BLOCK.ARGUMENT_INDEX + nodePropertyDescriptors(700) = FormalQtyType.StringType // BLOCK.CODE + nodePropertyDescriptors(701) = FormalQtyType.QtyOne + nodePropertyDescriptors(786) = FormalQtyType.IntType // BLOCK.COLUMN_NUMBER + nodePropertyDescriptors(787) = FormalQtyType.QtyOption + nodePropertyDescriptors(1388) = FormalQtyType.StringType // BLOCK.DYNAMIC_TYPE_HINT_FULL_NAME + nodePropertyDescriptors(1389) = FormalQtyType.QtyMulti + nodePropertyDescriptors(2936) = FormalQtyType.IntType // BLOCK.LINE_NUMBER + nodePropertyDescriptors(2937) = FormalQtyType.QtyOption + nodePropertyDescriptors(3366) = FormalQtyType.IntType // BLOCK.OFFSET + nodePropertyDescriptors(3367) = FormalQtyType.QtyOption + nodePropertyDescriptors(3452) = FormalQtyType.IntType // BLOCK.OFFSET_END + nodePropertyDescriptors(3453) = FormalQtyType.QtyOption + nodePropertyDescriptors(3538) = FormalQtyType.IntType // BLOCK.ORDER + nodePropertyDescriptors(3539) = FormalQtyType.QtyOne + nodePropertyDescriptors(3796) = FormalQtyType.StringType // BLOCK.POSSIBLE_TYPES + nodePropertyDescriptors(3797) = FormalQtyType.QtyMulti + nodePropertyDescriptors(4140) = FormalQtyType.StringType // BLOCK.TYPE_FULL_NAME + nodePropertyDescriptors(4141) = FormalQtyType.QtyOne + nodePropertyDescriptors(100) = FormalQtyType.IntType // CALL.ARGUMENT_INDEX nodePropertyDescriptors(101) = FormalQtyType.QtyOne - nodePropertyDescriptors(188) = FormalQtyType.StringType // BLOCK.ARGUMENT_NAME - nodePropertyDescriptors(189) = FormalQtyType.QtyOption - nodePropertyDescriptors(892) = FormalQtyType.StringType // BLOCK.CODE - nodePropertyDescriptors(893) = FormalQtyType.QtyOne - nodePropertyDescriptors(980) = FormalQtyType.IntType // BLOCK.COLUMN_NUMBER - nodePropertyDescriptors(981) = FormalQtyType.QtyOption - nodePropertyDescriptors(1596) = FormalQtyType.StringType // BLOCK.DYNAMIC_TYPE_HINT_FULL_NAME - nodePropertyDescriptors(1597) = FormalQtyType.QtyMulti - nodePropertyDescriptors(3180) = FormalQtyType.IntType // BLOCK.LINE_NUMBER - nodePropertyDescriptors(3181) = FormalQtyType.QtyOption - nodePropertyDescriptors(3796) = FormalQtyType.IntType // BLOCK.OFFSET - nodePropertyDescriptors(3797) = FormalQtyType.QtyOption - nodePropertyDescriptors(3884) = FormalQtyType.IntType // BLOCK.OFFSET_END - nodePropertyDescriptors(3885) = FormalQtyType.QtyOption - nodePropertyDescriptors(3972) = FormalQtyType.IntType // BLOCK.ORDER - nodePropertyDescriptors(3973) = FormalQtyType.QtyOne - nodePropertyDescriptors(4324) = FormalQtyType.StringType // BLOCK.POSSIBLE_TYPES - nodePropertyDescriptors(4325) = FormalQtyType.QtyMulti - nodePropertyDescriptors(4764) = FormalQtyType.StringType // BLOCK.TYPE_FULL_NAME - nodePropertyDescriptors(4765) = FormalQtyType.QtyOne - nodePropertyDescriptors(102) = FormalQtyType.IntType // CALL.ARGUMENT_INDEX - nodePropertyDescriptors(103) = FormalQtyType.QtyOne - nodePropertyDescriptors(190) = FormalQtyType.StringType // CALL.ARGUMENT_NAME - nodePropertyDescriptors(191) = FormalQtyType.QtyOption - nodePropertyDescriptors(894) = FormalQtyType.StringType // CALL.CODE - nodePropertyDescriptors(895) = FormalQtyType.QtyOne - nodePropertyDescriptors(982) = FormalQtyType.IntType // CALL.COLUMN_NUMBER - nodePropertyDescriptors(983) = FormalQtyType.QtyOption - nodePropertyDescriptors(1510) = FormalQtyType.StringType // CALL.DISPATCH_TYPE - nodePropertyDescriptors(1511) = FormalQtyType.QtyOne - nodePropertyDescriptors(1598) = FormalQtyType.StringType // CALL.DYNAMIC_TYPE_HINT_FULL_NAME - nodePropertyDescriptors(1599) = FormalQtyType.QtyMulti - nodePropertyDescriptors(3182) = FormalQtyType.IntType // CALL.LINE_NUMBER - nodePropertyDescriptors(3183) = FormalQtyType.QtyOption - nodePropertyDescriptors(3358) = FormalQtyType.StringType // CALL.METHOD_FULL_NAME - nodePropertyDescriptors(3359) = FormalQtyType.QtyOne - nodePropertyDescriptors(3622) = FormalQtyType.StringType // CALL.NAME - nodePropertyDescriptors(3623) = FormalQtyType.QtyOne - nodePropertyDescriptors(3798) = FormalQtyType.IntType // CALL.OFFSET - nodePropertyDescriptors(3799) = FormalQtyType.QtyOption - nodePropertyDescriptors(3886) = FormalQtyType.IntType // CALL.OFFSET_END - nodePropertyDescriptors(3887) = FormalQtyType.QtyOption - nodePropertyDescriptors(3974) = FormalQtyType.IntType // CALL.ORDER - nodePropertyDescriptors(3975) = FormalQtyType.QtyOne - nodePropertyDescriptors(4326) = FormalQtyType.StringType // CALL.POSSIBLE_TYPES - nodePropertyDescriptors(4327) = FormalQtyType.QtyMulti - nodePropertyDescriptors(4502) = FormalQtyType.StringType // CALL.SIGNATURE - nodePropertyDescriptors(4503) = FormalQtyType.QtyOne - nodePropertyDescriptors(4766) = FormalQtyType.StringType // CALL.TYPE_FULL_NAME - nodePropertyDescriptors(4767) = FormalQtyType.QtyOne - nodePropertyDescriptors(720) = FormalQtyType.StringType // CLOSURE_BINDING.CLOSURE_BINDING_ID - nodePropertyDescriptors(721) = FormalQtyType.QtyOption - nodePropertyDescriptors(808) = FormalQtyType.StringType // CLOSURE_BINDING.CLOSURE_ORIGINAL_NAME - nodePropertyDescriptors(809) = FormalQtyType.QtyOption - nodePropertyDescriptors(1688) = FormalQtyType.StringType // CLOSURE_BINDING.EVALUATION_STRATEGY - nodePropertyDescriptors(1689) = FormalQtyType.QtyOne - nodePropertyDescriptors(898) = FormalQtyType.StringType // COMMENT.CODE - nodePropertyDescriptors(899) = FormalQtyType.QtyOne - nodePropertyDescriptors(986) = FormalQtyType.IntType // COMMENT.COLUMN_NUMBER - nodePropertyDescriptors(987) = FormalQtyType.QtyOption - nodePropertyDescriptors(1954) = FormalQtyType.StringType // COMMENT.FILENAME - nodePropertyDescriptors(1955) = FormalQtyType.QtyOne - nodePropertyDescriptors(3186) = FormalQtyType.IntType // COMMENT.LINE_NUMBER - nodePropertyDescriptors(3187) = FormalQtyType.QtyOption - nodePropertyDescriptors(3802) = FormalQtyType.IntType // COMMENT.OFFSET - nodePropertyDescriptors(3803) = FormalQtyType.QtyOption - nodePropertyDescriptors(3890) = FormalQtyType.IntType // COMMENT.OFFSET_END - nodePropertyDescriptors(3891) = FormalQtyType.QtyOption - nodePropertyDescriptors(3978) = FormalQtyType.IntType // COMMENT.ORDER - nodePropertyDescriptors(3979) = FormalQtyType.QtyOne - nodePropertyDescriptors(1252) = FormalQtyType.StringType // CONFIG_FILE.CONTENT - nodePropertyDescriptors(1253) = FormalQtyType.QtyOne - nodePropertyDescriptors(3628) = FormalQtyType.StringType // CONFIG_FILE.NAME - nodePropertyDescriptors(3629) = FormalQtyType.QtyOne - nodePropertyDescriptors(110) = FormalQtyType.IntType // CONTROL_STRUCTURE.ARGUMENT_INDEX - nodePropertyDescriptors(111) = FormalQtyType.QtyOne - nodePropertyDescriptors(198) = FormalQtyType.StringType // CONTROL_STRUCTURE.ARGUMENT_NAME - nodePropertyDescriptors(199) = FormalQtyType.QtyOption - nodePropertyDescriptors(902) = FormalQtyType.StringType // CONTROL_STRUCTURE.CODE - nodePropertyDescriptors(903) = FormalQtyType.QtyOne - nodePropertyDescriptors(990) = FormalQtyType.IntType // CONTROL_STRUCTURE.COLUMN_NUMBER - nodePropertyDescriptors(991) = FormalQtyType.QtyOption - nodePropertyDescriptors(1342) = FormalQtyType.StringType // CONTROL_STRUCTURE.CONTROL_STRUCTURE_TYPE - nodePropertyDescriptors(1343) = FormalQtyType.QtyOne - nodePropertyDescriptors(3190) = FormalQtyType.IntType // CONTROL_STRUCTURE.LINE_NUMBER - nodePropertyDescriptors(3191) = FormalQtyType.QtyOption - nodePropertyDescriptors(3806) = FormalQtyType.IntType // CONTROL_STRUCTURE.OFFSET - nodePropertyDescriptors(3807) = FormalQtyType.QtyOption - nodePropertyDescriptors(3894) = FormalQtyType.IntType // CONTROL_STRUCTURE.OFFSET_END - nodePropertyDescriptors(3895) = FormalQtyType.QtyOption - nodePropertyDescriptors(3982) = FormalQtyType.IntType // CONTROL_STRUCTURE.ORDER - nodePropertyDescriptors(3983) = FormalQtyType.QtyOne - nodePropertyDescriptors(4246) = FormalQtyType.StringType // CONTROL_STRUCTURE.PARSER_TYPE_NAME - nodePropertyDescriptors(4247) = FormalQtyType.QtyOne - nodePropertyDescriptors(1432) = FormalQtyType.StringType // DEPENDENCY.DEPENDENCY_GROUP_ID - nodePropertyDescriptors(1433) = FormalQtyType.QtyOption - nodePropertyDescriptors(3632) = FormalQtyType.StringType // DEPENDENCY.NAME - nodePropertyDescriptors(3633) = FormalQtyType.QtyOne - nodePropertyDescriptors(4952) = FormalQtyType.StringType // DEPENDENCY.VERSION - nodePropertyDescriptors(4953) = FormalQtyType.QtyOne - nodePropertyDescriptors(114) = FormalQtyType.IntType // FIELD_IDENTIFIER.ARGUMENT_INDEX - nodePropertyDescriptors(115) = FormalQtyType.QtyOne - nodePropertyDescriptors(202) = FormalQtyType.StringType // FIELD_IDENTIFIER.ARGUMENT_NAME - nodePropertyDescriptors(203) = FormalQtyType.QtyOption - nodePropertyDescriptors(466) = FormalQtyType.StringType // FIELD_IDENTIFIER.CANONICAL_NAME - nodePropertyDescriptors(467) = FormalQtyType.QtyOne - nodePropertyDescriptors(906) = FormalQtyType.StringType // FIELD_IDENTIFIER.CODE - nodePropertyDescriptors(907) = FormalQtyType.QtyOne - nodePropertyDescriptors(994) = FormalQtyType.IntType // FIELD_IDENTIFIER.COLUMN_NUMBER - nodePropertyDescriptors(995) = FormalQtyType.QtyOption - nodePropertyDescriptors(3194) = FormalQtyType.IntType // FIELD_IDENTIFIER.LINE_NUMBER - nodePropertyDescriptors(3195) = FormalQtyType.QtyOption - nodePropertyDescriptors(3810) = FormalQtyType.IntType // FIELD_IDENTIFIER.OFFSET - nodePropertyDescriptors(3811) = FormalQtyType.QtyOption - nodePropertyDescriptors(3898) = FormalQtyType.IntType // FIELD_IDENTIFIER.OFFSET_END - nodePropertyDescriptors(3899) = FormalQtyType.QtyOption - nodePropertyDescriptors(3986) = FormalQtyType.IntType // FIELD_IDENTIFIER.ORDER - nodePropertyDescriptors(3987) = FormalQtyType.QtyOne - nodePropertyDescriptors(908) = FormalQtyType.StringType // FILE.CODE - nodePropertyDescriptors(909) = FormalQtyType.QtyOne - nodePropertyDescriptors(996) = FormalQtyType.IntType // FILE.COLUMN_NUMBER - nodePropertyDescriptors(997) = FormalQtyType.QtyOption - nodePropertyDescriptors(1260) = FormalQtyType.StringType // FILE.CONTENT - nodePropertyDescriptors(1261) = FormalQtyType.QtyOne - nodePropertyDescriptors(2228) = FormalQtyType.StringType // FILE.HASH - nodePropertyDescriptors(2229) = FormalQtyType.QtyOption - nodePropertyDescriptors(3196) = FormalQtyType.IntType // FILE.LINE_NUMBER - nodePropertyDescriptors(3197) = FormalQtyType.QtyOption - nodePropertyDescriptors(3636) = FormalQtyType.StringType // FILE.NAME - nodePropertyDescriptors(3637) = FormalQtyType.QtyOne - nodePropertyDescriptors(3812) = FormalQtyType.IntType // FILE.OFFSET - nodePropertyDescriptors(3813) = FormalQtyType.QtyOption - nodePropertyDescriptors(3900) = FormalQtyType.IntType // FILE.OFFSET_END - nodePropertyDescriptors(3901) = FormalQtyType.QtyOption - nodePropertyDescriptors(3988) = FormalQtyType.IntType // FILE.ORDER - nodePropertyDescriptors(3989) = FormalQtyType.QtyOne - nodePropertyDescriptors(1790) = FormalQtyType.StringType // FINDING.EVIDENCE_DESCRIPTION - nodePropertyDescriptors(1791) = FormalQtyType.QtyMulti - nodePropertyDescriptors(5046) = FormalQtyType.RefType // FINDING.evidence - nodePropertyDescriptors(5047) = FormalQtyType.QtyMulti - nodePropertyDescriptors(5134) = FormalQtyType.RefType // FINDING.keyValuePairs - nodePropertyDescriptors(5135) = FormalQtyType.QtyMulti - nodePropertyDescriptors(120) = FormalQtyType.IntType // IDENTIFIER.ARGUMENT_INDEX - nodePropertyDescriptors(121) = FormalQtyType.QtyOne - nodePropertyDescriptors(208) = FormalQtyType.StringType // IDENTIFIER.ARGUMENT_NAME - nodePropertyDescriptors(209) = FormalQtyType.QtyOption - nodePropertyDescriptors(912) = FormalQtyType.StringType // IDENTIFIER.CODE - nodePropertyDescriptors(913) = FormalQtyType.QtyOne - nodePropertyDescriptors(1000) = FormalQtyType.IntType // IDENTIFIER.COLUMN_NUMBER - nodePropertyDescriptors(1001) = FormalQtyType.QtyOption - nodePropertyDescriptors(1616) = FormalQtyType.StringType // IDENTIFIER.DYNAMIC_TYPE_HINT_FULL_NAME - nodePropertyDescriptors(1617) = FormalQtyType.QtyMulti - nodePropertyDescriptors(3200) = FormalQtyType.IntType // IDENTIFIER.LINE_NUMBER - nodePropertyDescriptors(3201) = FormalQtyType.QtyOption - nodePropertyDescriptors(3640) = FormalQtyType.StringType // IDENTIFIER.NAME - nodePropertyDescriptors(3641) = FormalQtyType.QtyOne - nodePropertyDescriptors(3816) = FormalQtyType.IntType // IDENTIFIER.OFFSET - nodePropertyDescriptors(3817) = FormalQtyType.QtyOption - nodePropertyDescriptors(3904) = FormalQtyType.IntType // IDENTIFIER.OFFSET_END - nodePropertyDescriptors(3905) = FormalQtyType.QtyOption - nodePropertyDescriptors(3992) = FormalQtyType.IntType // IDENTIFIER.ORDER - nodePropertyDescriptors(3993) = FormalQtyType.QtyOne - nodePropertyDescriptors(4344) = FormalQtyType.StringType // IDENTIFIER.POSSIBLE_TYPES - nodePropertyDescriptors(4345) = FormalQtyType.QtyMulti - nodePropertyDescriptors(4784) = FormalQtyType.StringType // IDENTIFIER.TYPE_FULL_NAME - nodePropertyDescriptors(4785) = FormalQtyType.QtyOne - nodePropertyDescriptors(914) = FormalQtyType.StringType // IMPORT.CODE - nodePropertyDescriptors(915) = FormalQtyType.QtyOne - nodePropertyDescriptors(1002) = FormalQtyType.IntType // IMPORT.COLUMN_NUMBER - nodePropertyDescriptors(1003) = FormalQtyType.QtyOption - nodePropertyDescriptors(1882) = FormalQtyType.BoolType // IMPORT.EXPLICIT_AS - nodePropertyDescriptors(1883) = FormalQtyType.QtyOption - nodePropertyDescriptors(2322) = FormalQtyType.StringType // IMPORT.IMPORTED_AS - nodePropertyDescriptors(2323) = FormalQtyType.QtyOption - nodePropertyDescriptors(2410) = FormalQtyType.StringType // IMPORT.IMPORTED_ENTITY - nodePropertyDescriptors(2411) = FormalQtyType.QtyOption - nodePropertyDescriptors(2674) = FormalQtyType.BoolType // IMPORT.IS_EXPLICIT - nodePropertyDescriptors(2675) = FormalQtyType.QtyOption - nodePropertyDescriptors(2938) = FormalQtyType.BoolType // IMPORT.IS_WILDCARD + nodePropertyDescriptors(186) = FormalQtyType.StringType // CALL.ARGUMENT_NAME + nodePropertyDescriptors(187) = FormalQtyType.QtyOption + nodePropertyDescriptors(702) = FormalQtyType.StringType // CALL.CODE + nodePropertyDescriptors(703) = FormalQtyType.QtyOne + nodePropertyDescriptors(788) = FormalQtyType.IntType // CALL.COLUMN_NUMBER + nodePropertyDescriptors(789) = FormalQtyType.QtyOption + nodePropertyDescriptors(1304) = FormalQtyType.StringType // CALL.DISPATCH_TYPE + nodePropertyDescriptors(1305) = FormalQtyType.QtyOne + nodePropertyDescriptors(1390) = FormalQtyType.StringType // CALL.DYNAMIC_TYPE_HINT_FULL_NAME + nodePropertyDescriptors(1391) = FormalQtyType.QtyMulti + nodePropertyDescriptors(2938) = FormalQtyType.IntType // CALL.LINE_NUMBER nodePropertyDescriptors(2939) = FormalQtyType.QtyOption - nodePropertyDescriptors(3202) = FormalQtyType.IntType // IMPORT.LINE_NUMBER - nodePropertyDescriptors(3203) = FormalQtyType.QtyOption - nodePropertyDescriptors(3818) = FormalQtyType.IntType // IMPORT.OFFSET - nodePropertyDescriptors(3819) = FormalQtyType.QtyOption - nodePropertyDescriptors(3906) = FormalQtyType.IntType // IMPORT.OFFSET_END - nodePropertyDescriptors(3907) = FormalQtyType.QtyOption - nodePropertyDescriptors(3994) = FormalQtyType.IntType // IMPORT.ORDER - nodePropertyDescriptors(3995) = FormalQtyType.QtyOne - nodePropertyDescriptors(916) = FormalQtyType.StringType // JUMP_LABEL.CODE - nodePropertyDescriptors(917) = FormalQtyType.QtyOne - nodePropertyDescriptors(1004) = FormalQtyType.IntType // JUMP_LABEL.COLUMN_NUMBER - nodePropertyDescriptors(1005) = FormalQtyType.QtyOption - nodePropertyDescriptors(3204) = FormalQtyType.IntType // JUMP_LABEL.LINE_NUMBER - nodePropertyDescriptors(3205) = FormalQtyType.QtyOption - nodePropertyDescriptors(3644) = FormalQtyType.StringType // JUMP_LABEL.NAME - nodePropertyDescriptors(3645) = FormalQtyType.QtyOne - nodePropertyDescriptors(3820) = FormalQtyType.IntType // JUMP_LABEL.OFFSET - nodePropertyDescriptors(3821) = FormalQtyType.QtyOption - nodePropertyDescriptors(3908) = FormalQtyType.IntType // JUMP_LABEL.OFFSET_END - nodePropertyDescriptors(3909) = FormalQtyType.QtyOption - nodePropertyDescriptors(3996) = FormalQtyType.IntType // JUMP_LABEL.ORDER - nodePropertyDescriptors(3997) = FormalQtyType.QtyOne - nodePropertyDescriptors(4260) = FormalQtyType.StringType // JUMP_LABEL.PARSER_TYPE_NAME - nodePropertyDescriptors(4261) = FormalQtyType.QtyOne - nodePropertyDescriptors(126) = FormalQtyType.IntType // JUMP_TARGET.ARGUMENT_INDEX - nodePropertyDescriptors(127) = FormalQtyType.QtyOne - nodePropertyDescriptors(918) = FormalQtyType.StringType // JUMP_TARGET.CODE - nodePropertyDescriptors(919) = FormalQtyType.QtyOne - nodePropertyDescriptors(1006) = FormalQtyType.IntType // JUMP_TARGET.COLUMN_NUMBER - nodePropertyDescriptors(1007) = FormalQtyType.QtyOption - nodePropertyDescriptors(3206) = FormalQtyType.IntType // JUMP_TARGET.LINE_NUMBER - nodePropertyDescriptors(3207) = FormalQtyType.QtyOption - nodePropertyDescriptors(3646) = FormalQtyType.StringType // JUMP_TARGET.NAME - nodePropertyDescriptors(3647) = FormalQtyType.QtyOne - nodePropertyDescriptors(3822) = FormalQtyType.IntType // JUMP_TARGET.OFFSET - nodePropertyDescriptors(3823) = FormalQtyType.QtyOption - nodePropertyDescriptors(3910) = FormalQtyType.IntType // JUMP_TARGET.OFFSET_END - nodePropertyDescriptors(3911) = FormalQtyType.QtyOption - nodePropertyDescriptors(3998) = FormalQtyType.IntType // JUMP_TARGET.ORDER - nodePropertyDescriptors(3999) = FormalQtyType.QtyOne - nodePropertyDescriptors(4262) = FormalQtyType.StringType // JUMP_TARGET.PARSER_TYPE_NAME - nodePropertyDescriptors(4263) = FormalQtyType.QtyOne - nodePropertyDescriptors(3032) = FormalQtyType.StringType // KEY_VALUE_PAIR.KEY - nodePropertyDescriptors(3033) = FormalQtyType.QtyOne - nodePropertyDescriptors(4880) = FormalQtyType.StringType // KEY_VALUE_PAIR.VALUE - nodePropertyDescriptors(4881) = FormalQtyType.QtyOne - nodePropertyDescriptors(130) = FormalQtyType.IntType // LITERAL.ARGUMENT_INDEX - nodePropertyDescriptors(131) = FormalQtyType.QtyOne - nodePropertyDescriptors(218) = FormalQtyType.StringType // LITERAL.ARGUMENT_NAME - nodePropertyDescriptors(219) = FormalQtyType.QtyOption - nodePropertyDescriptors(922) = FormalQtyType.StringType // LITERAL.CODE - nodePropertyDescriptors(923) = FormalQtyType.QtyOne - nodePropertyDescriptors(1010) = FormalQtyType.IntType // LITERAL.COLUMN_NUMBER - nodePropertyDescriptors(1011) = FormalQtyType.QtyOption - nodePropertyDescriptors(1626) = FormalQtyType.StringType // LITERAL.DYNAMIC_TYPE_HINT_FULL_NAME - nodePropertyDescriptors(1627) = FormalQtyType.QtyMulti - nodePropertyDescriptors(3210) = FormalQtyType.IntType // LITERAL.LINE_NUMBER - nodePropertyDescriptors(3211) = FormalQtyType.QtyOption - nodePropertyDescriptors(3826) = FormalQtyType.IntType // LITERAL.OFFSET - nodePropertyDescriptors(3827) = FormalQtyType.QtyOption - nodePropertyDescriptors(3914) = FormalQtyType.IntType // LITERAL.OFFSET_END - nodePropertyDescriptors(3915) = FormalQtyType.QtyOption - nodePropertyDescriptors(4002) = FormalQtyType.IntType // LITERAL.ORDER - nodePropertyDescriptors(4003) = FormalQtyType.QtyOne - nodePropertyDescriptors(4354) = FormalQtyType.StringType // LITERAL.POSSIBLE_TYPES - nodePropertyDescriptors(4355) = FormalQtyType.QtyMulti - nodePropertyDescriptors(4794) = FormalQtyType.StringType // LITERAL.TYPE_FULL_NAME - nodePropertyDescriptors(4795) = FormalQtyType.QtyOne - nodePropertyDescriptors(748) = FormalQtyType.StringType // LOCAL.CLOSURE_BINDING_ID - nodePropertyDescriptors(749) = FormalQtyType.QtyOption - nodePropertyDescriptors(924) = FormalQtyType.StringType // LOCAL.CODE - nodePropertyDescriptors(925) = FormalQtyType.QtyOne - nodePropertyDescriptors(1012) = FormalQtyType.IntType // LOCAL.COLUMN_NUMBER - nodePropertyDescriptors(1013) = FormalQtyType.QtyOption - nodePropertyDescriptors(1628) = FormalQtyType.StringType // LOCAL.DYNAMIC_TYPE_HINT_FULL_NAME - nodePropertyDescriptors(1629) = FormalQtyType.QtyMulti - nodePropertyDescriptors(2156) = FormalQtyType.StringType // LOCAL.GENERIC_SIGNATURE - nodePropertyDescriptors(2157) = FormalQtyType.QtyOne - nodePropertyDescriptors(3212) = FormalQtyType.IntType // LOCAL.LINE_NUMBER - nodePropertyDescriptors(3213) = FormalQtyType.QtyOption - nodePropertyDescriptors(3652) = FormalQtyType.StringType // LOCAL.NAME - nodePropertyDescriptors(3653) = FormalQtyType.QtyOne - nodePropertyDescriptors(3828) = FormalQtyType.IntType // LOCAL.OFFSET - nodePropertyDescriptors(3829) = FormalQtyType.QtyOption - nodePropertyDescriptors(3916) = FormalQtyType.IntType // LOCAL.OFFSET_END - nodePropertyDescriptors(3917) = FormalQtyType.QtyOption - nodePropertyDescriptors(4004) = FormalQtyType.IntType // LOCAL.ORDER - nodePropertyDescriptors(4005) = FormalQtyType.QtyOne - nodePropertyDescriptors(4356) = FormalQtyType.StringType // LOCAL.POSSIBLE_TYPES - nodePropertyDescriptors(4357) = FormalQtyType.QtyMulti - nodePropertyDescriptors(4796) = FormalQtyType.StringType // LOCAL.TYPE_FULL_NAME - nodePropertyDescriptors(4797) = FormalQtyType.QtyOne - nodePropertyDescriptors(574) = FormalQtyType.StringType // LOCATION.CLASS_NAME - nodePropertyDescriptors(575) = FormalQtyType.QtyOne - nodePropertyDescriptors(662) = FormalQtyType.StringType // LOCATION.CLASS_SHORT_NAME - nodePropertyDescriptors(663) = FormalQtyType.QtyOne - nodePropertyDescriptors(1014) = FormalQtyType.IntType // LOCATION.COLUMN_NUMBER - nodePropertyDescriptors(1015) = FormalQtyType.QtyOption - nodePropertyDescriptors(1982) = FormalQtyType.StringType // LOCATION.FILENAME - nodePropertyDescriptors(1983) = FormalQtyType.QtyOne - nodePropertyDescriptors(3214) = FormalQtyType.IntType // LOCATION.LINE_NUMBER - nodePropertyDescriptors(3215) = FormalQtyType.QtyOption - nodePropertyDescriptors(3390) = FormalQtyType.StringType // LOCATION.METHOD_FULL_NAME - nodePropertyDescriptors(3391) = FormalQtyType.QtyOne - nodePropertyDescriptors(3478) = FormalQtyType.StringType // LOCATION.METHOD_SHORT_NAME - nodePropertyDescriptors(3479) = FormalQtyType.QtyOne - nodePropertyDescriptors(3742) = FormalQtyType.StringType // LOCATION.NODE_LABEL - nodePropertyDescriptors(3743) = FormalQtyType.QtyOne - nodePropertyDescriptors(4182) = FormalQtyType.StringType // LOCATION.PACKAGE_NAME + nodePropertyDescriptors(3110) = FormalQtyType.StringType // CALL.METHOD_FULL_NAME + nodePropertyDescriptors(3111) = FormalQtyType.QtyOne + nodePropertyDescriptors(3282) = FormalQtyType.StringType // CALL.NAME + nodePropertyDescriptors(3283) = FormalQtyType.QtyOne + nodePropertyDescriptors(3368) = FormalQtyType.IntType // CALL.OFFSET + nodePropertyDescriptors(3369) = FormalQtyType.QtyOption + nodePropertyDescriptors(3454) = FormalQtyType.IntType // CALL.OFFSET_END + nodePropertyDescriptors(3455) = FormalQtyType.QtyOption + nodePropertyDescriptors(3540) = FormalQtyType.IntType // CALL.ORDER + nodePropertyDescriptors(3541) = FormalQtyType.QtyOne + nodePropertyDescriptors(3798) = FormalQtyType.StringType // CALL.POSSIBLE_TYPES + nodePropertyDescriptors(3799) = FormalQtyType.QtyMulti + nodePropertyDescriptors(3970) = FormalQtyType.StringType // CALL.SIGNATURE + nodePropertyDescriptors(3971) = FormalQtyType.QtyOne + nodePropertyDescriptors(4142) = FormalQtyType.StringType // CALL.TYPE_FULL_NAME + nodePropertyDescriptors(4143) = FormalQtyType.QtyOne + nodePropertyDescriptors(532) = FormalQtyType.StringType // CLOSURE_BINDING.CLOSURE_BINDING_ID + nodePropertyDescriptors(533) = FormalQtyType.QtyOption + nodePropertyDescriptors(618) = FormalQtyType.StringType // CLOSURE_BINDING.CLOSURE_ORIGINAL_NAME + nodePropertyDescriptors(619) = FormalQtyType.QtyOption + nodePropertyDescriptors(1478) = FormalQtyType.StringType // CLOSURE_BINDING.EVALUATION_STRATEGY + nodePropertyDescriptors(1479) = FormalQtyType.QtyOne + nodePropertyDescriptors(706) = FormalQtyType.StringType // COMMENT.CODE + nodePropertyDescriptors(707) = FormalQtyType.QtyOne + nodePropertyDescriptors(792) = FormalQtyType.IntType // COMMENT.COLUMN_NUMBER + nodePropertyDescriptors(793) = FormalQtyType.QtyOption + nodePropertyDescriptors(1738) = FormalQtyType.StringType // COMMENT.FILENAME + nodePropertyDescriptors(1739) = FormalQtyType.QtyOne + nodePropertyDescriptors(2942) = FormalQtyType.IntType // COMMENT.LINE_NUMBER + nodePropertyDescriptors(2943) = FormalQtyType.QtyOption + nodePropertyDescriptors(3372) = FormalQtyType.IntType // COMMENT.OFFSET + nodePropertyDescriptors(3373) = FormalQtyType.QtyOption + nodePropertyDescriptors(3458) = FormalQtyType.IntType // COMMENT.OFFSET_END + nodePropertyDescriptors(3459) = FormalQtyType.QtyOption + nodePropertyDescriptors(3544) = FormalQtyType.IntType // COMMENT.ORDER + nodePropertyDescriptors(3545) = FormalQtyType.QtyOne + nodePropertyDescriptors(1052) = FormalQtyType.StringType // CONFIG_FILE.CONTENT + nodePropertyDescriptors(1053) = FormalQtyType.QtyOne + nodePropertyDescriptors(3288) = FormalQtyType.StringType // CONFIG_FILE.NAME + nodePropertyDescriptors(3289) = FormalQtyType.QtyOne + nodePropertyDescriptors(108) = FormalQtyType.IntType // CONTROL_STRUCTURE.ARGUMENT_INDEX + nodePropertyDescriptors(109) = FormalQtyType.QtyOne + nodePropertyDescriptors(194) = FormalQtyType.StringType // CONTROL_STRUCTURE.ARGUMENT_NAME + nodePropertyDescriptors(195) = FormalQtyType.QtyOption + nodePropertyDescriptors(710) = FormalQtyType.StringType // CONTROL_STRUCTURE.CODE + nodePropertyDescriptors(711) = FormalQtyType.QtyOne + nodePropertyDescriptors(796) = FormalQtyType.IntType // CONTROL_STRUCTURE.COLUMN_NUMBER + nodePropertyDescriptors(797) = FormalQtyType.QtyOption + nodePropertyDescriptors(1140) = FormalQtyType.StringType // CONTROL_STRUCTURE.CONTROL_STRUCTURE_TYPE + nodePropertyDescriptors(1141) = FormalQtyType.QtyOne + nodePropertyDescriptors(2946) = FormalQtyType.IntType // CONTROL_STRUCTURE.LINE_NUMBER + nodePropertyDescriptors(2947) = FormalQtyType.QtyOption + nodePropertyDescriptors(3376) = FormalQtyType.IntType // CONTROL_STRUCTURE.OFFSET + nodePropertyDescriptors(3377) = FormalQtyType.QtyOption + nodePropertyDescriptors(3462) = FormalQtyType.IntType // CONTROL_STRUCTURE.OFFSET_END + nodePropertyDescriptors(3463) = FormalQtyType.QtyOption + nodePropertyDescriptors(3548) = FormalQtyType.IntType // CONTROL_STRUCTURE.ORDER + nodePropertyDescriptors(3549) = FormalQtyType.QtyOne + nodePropertyDescriptors(3720) = FormalQtyType.StringType // CONTROL_STRUCTURE.PARSER_TYPE_NAME + nodePropertyDescriptors(3721) = FormalQtyType.QtyOne + nodePropertyDescriptors(1228) = FormalQtyType.StringType // DEPENDENCY.DEPENDENCY_GROUP_ID + nodePropertyDescriptors(1229) = FormalQtyType.QtyOption + nodePropertyDescriptors(3292) = FormalQtyType.StringType // DEPENDENCY.NAME + nodePropertyDescriptors(3293) = FormalQtyType.QtyOne + nodePropertyDescriptors(4324) = FormalQtyType.StringType // DEPENDENCY.VERSION + nodePropertyDescriptors(4325) = FormalQtyType.QtyOne + nodePropertyDescriptors(112) = FormalQtyType.IntType // FIELD_IDENTIFIER.ARGUMENT_INDEX + nodePropertyDescriptors(113) = FormalQtyType.QtyOne + nodePropertyDescriptors(198) = FormalQtyType.StringType // FIELD_IDENTIFIER.ARGUMENT_NAME + nodePropertyDescriptors(199) = FormalQtyType.QtyOption + nodePropertyDescriptors(456) = FormalQtyType.StringType // FIELD_IDENTIFIER.CANONICAL_NAME + nodePropertyDescriptors(457) = FormalQtyType.QtyOne + nodePropertyDescriptors(714) = FormalQtyType.StringType // FIELD_IDENTIFIER.CODE + nodePropertyDescriptors(715) = FormalQtyType.QtyOne + nodePropertyDescriptors(800) = FormalQtyType.IntType // FIELD_IDENTIFIER.COLUMN_NUMBER + nodePropertyDescriptors(801) = FormalQtyType.QtyOption + nodePropertyDescriptors(2950) = FormalQtyType.IntType // FIELD_IDENTIFIER.LINE_NUMBER + nodePropertyDescriptors(2951) = FormalQtyType.QtyOption + nodePropertyDescriptors(3380) = FormalQtyType.IntType // FIELD_IDENTIFIER.OFFSET + nodePropertyDescriptors(3381) = FormalQtyType.QtyOption + nodePropertyDescriptors(3466) = FormalQtyType.IntType // FIELD_IDENTIFIER.OFFSET_END + nodePropertyDescriptors(3467) = FormalQtyType.QtyOption + nodePropertyDescriptors(3552) = FormalQtyType.IntType // FIELD_IDENTIFIER.ORDER + nodePropertyDescriptors(3553) = FormalQtyType.QtyOne + nodePropertyDescriptors(716) = FormalQtyType.StringType // FILE.CODE + nodePropertyDescriptors(717) = FormalQtyType.QtyOne + nodePropertyDescriptors(802) = FormalQtyType.IntType // FILE.COLUMN_NUMBER + nodePropertyDescriptors(803) = FormalQtyType.QtyOption + nodePropertyDescriptors(1060) = FormalQtyType.StringType // FILE.CONTENT + nodePropertyDescriptors(1061) = FormalQtyType.QtyOne + nodePropertyDescriptors(2006) = FormalQtyType.StringType // FILE.HASH + nodePropertyDescriptors(2007) = FormalQtyType.QtyOption + nodePropertyDescriptors(2952) = FormalQtyType.IntType // FILE.LINE_NUMBER + nodePropertyDescriptors(2953) = FormalQtyType.QtyOption + nodePropertyDescriptors(3296) = FormalQtyType.StringType // FILE.NAME + nodePropertyDescriptors(3297) = FormalQtyType.QtyOne + nodePropertyDescriptors(3382) = FormalQtyType.IntType // FILE.OFFSET + nodePropertyDescriptors(3383) = FormalQtyType.QtyOption + nodePropertyDescriptors(3468) = FormalQtyType.IntType // FILE.OFFSET_END + nodePropertyDescriptors(3469) = FormalQtyType.QtyOption + nodePropertyDescriptors(3554) = FormalQtyType.IntType // FILE.ORDER + nodePropertyDescriptors(3555) = FormalQtyType.QtyOne + nodePropertyDescriptors(1578) = FormalQtyType.StringType // FINDING.EVIDENCE_DESCRIPTION + nodePropertyDescriptors(1579) = FormalQtyType.QtyMulti + nodePropertyDescriptors(4416) = FormalQtyType.RefType // FINDING.evidence + nodePropertyDescriptors(4417) = FormalQtyType.QtyMulti + nodePropertyDescriptors(4502) = FormalQtyType.RefType // FINDING.keyValuePairs + nodePropertyDescriptors(4503) = FormalQtyType.QtyMulti + nodePropertyDescriptors(118) = FormalQtyType.IntType // IDENTIFIER.ARGUMENT_INDEX + nodePropertyDescriptors(119) = FormalQtyType.QtyOne + nodePropertyDescriptors(204) = FormalQtyType.StringType // IDENTIFIER.ARGUMENT_NAME + nodePropertyDescriptors(205) = FormalQtyType.QtyOption + nodePropertyDescriptors(720) = FormalQtyType.StringType // IDENTIFIER.CODE + nodePropertyDescriptors(721) = FormalQtyType.QtyOne + nodePropertyDescriptors(806) = FormalQtyType.IntType // IDENTIFIER.COLUMN_NUMBER + nodePropertyDescriptors(807) = FormalQtyType.QtyOption + nodePropertyDescriptors(1408) = FormalQtyType.StringType // IDENTIFIER.DYNAMIC_TYPE_HINT_FULL_NAME + nodePropertyDescriptors(1409) = FormalQtyType.QtyMulti + nodePropertyDescriptors(2956) = FormalQtyType.IntType // IDENTIFIER.LINE_NUMBER + nodePropertyDescriptors(2957) = FormalQtyType.QtyOption + nodePropertyDescriptors(3300) = FormalQtyType.StringType // IDENTIFIER.NAME + nodePropertyDescriptors(3301) = FormalQtyType.QtyOne + nodePropertyDescriptors(3386) = FormalQtyType.IntType // IDENTIFIER.OFFSET + nodePropertyDescriptors(3387) = FormalQtyType.QtyOption + nodePropertyDescriptors(3472) = FormalQtyType.IntType // IDENTIFIER.OFFSET_END + nodePropertyDescriptors(3473) = FormalQtyType.QtyOption + nodePropertyDescriptors(3558) = FormalQtyType.IntType // IDENTIFIER.ORDER + nodePropertyDescriptors(3559) = FormalQtyType.QtyOne + nodePropertyDescriptors(3816) = FormalQtyType.StringType // IDENTIFIER.POSSIBLE_TYPES + nodePropertyDescriptors(3817) = FormalQtyType.QtyMulti + nodePropertyDescriptors(4160) = FormalQtyType.StringType // IDENTIFIER.TYPE_FULL_NAME + nodePropertyDescriptors(4161) = FormalQtyType.QtyOne + nodePropertyDescriptors(722) = FormalQtyType.StringType // IMPORT.CODE + nodePropertyDescriptors(723) = FormalQtyType.QtyOne + nodePropertyDescriptors(808) = FormalQtyType.IntType // IMPORT.COLUMN_NUMBER + nodePropertyDescriptors(809) = FormalQtyType.QtyOption + nodePropertyDescriptors(1668) = FormalQtyType.BoolType // IMPORT.EXPLICIT_AS + nodePropertyDescriptors(1669) = FormalQtyType.QtyOption + nodePropertyDescriptors(2098) = FormalQtyType.StringType // IMPORT.IMPORTED_AS + nodePropertyDescriptors(2099) = FormalQtyType.QtyOption + nodePropertyDescriptors(2184) = FormalQtyType.StringType // IMPORT.IMPORTED_ENTITY + nodePropertyDescriptors(2185) = FormalQtyType.QtyOption + nodePropertyDescriptors(2442) = FormalQtyType.BoolType // IMPORT.IS_EXPLICIT + nodePropertyDescriptors(2443) = FormalQtyType.QtyOption + nodePropertyDescriptors(2700) = FormalQtyType.BoolType // IMPORT.IS_WILDCARD + nodePropertyDescriptors(2701) = FormalQtyType.QtyOption + nodePropertyDescriptors(2958) = FormalQtyType.IntType // IMPORT.LINE_NUMBER + nodePropertyDescriptors(2959) = FormalQtyType.QtyOption + nodePropertyDescriptors(3388) = FormalQtyType.IntType // IMPORT.OFFSET + nodePropertyDescriptors(3389) = FormalQtyType.QtyOption + nodePropertyDescriptors(3474) = FormalQtyType.IntType // IMPORT.OFFSET_END + nodePropertyDescriptors(3475) = FormalQtyType.QtyOption + nodePropertyDescriptors(3560) = FormalQtyType.IntType // IMPORT.ORDER + nodePropertyDescriptors(3561) = FormalQtyType.QtyOne + nodePropertyDescriptors(724) = FormalQtyType.StringType // JUMP_LABEL.CODE + nodePropertyDescriptors(725) = FormalQtyType.QtyOne + nodePropertyDescriptors(810) = FormalQtyType.IntType // JUMP_LABEL.COLUMN_NUMBER + nodePropertyDescriptors(811) = FormalQtyType.QtyOption + nodePropertyDescriptors(2960) = FormalQtyType.IntType // JUMP_LABEL.LINE_NUMBER + nodePropertyDescriptors(2961) = FormalQtyType.QtyOption + nodePropertyDescriptors(3304) = FormalQtyType.StringType // JUMP_LABEL.NAME + nodePropertyDescriptors(3305) = FormalQtyType.QtyOne + nodePropertyDescriptors(3390) = FormalQtyType.IntType // JUMP_LABEL.OFFSET + nodePropertyDescriptors(3391) = FormalQtyType.QtyOption + nodePropertyDescriptors(3476) = FormalQtyType.IntType // JUMP_LABEL.OFFSET_END + nodePropertyDescriptors(3477) = FormalQtyType.QtyOption + nodePropertyDescriptors(3562) = FormalQtyType.IntType // JUMP_LABEL.ORDER + nodePropertyDescriptors(3563) = FormalQtyType.QtyOne + nodePropertyDescriptors(3734) = FormalQtyType.StringType // JUMP_LABEL.PARSER_TYPE_NAME + nodePropertyDescriptors(3735) = FormalQtyType.QtyOne + nodePropertyDescriptors(124) = FormalQtyType.IntType // JUMP_TARGET.ARGUMENT_INDEX + nodePropertyDescriptors(125) = FormalQtyType.QtyOne + nodePropertyDescriptors(726) = FormalQtyType.StringType // JUMP_TARGET.CODE + nodePropertyDescriptors(727) = FormalQtyType.QtyOne + nodePropertyDescriptors(812) = FormalQtyType.IntType // JUMP_TARGET.COLUMN_NUMBER + nodePropertyDescriptors(813) = FormalQtyType.QtyOption + nodePropertyDescriptors(2962) = FormalQtyType.IntType // JUMP_TARGET.LINE_NUMBER + nodePropertyDescriptors(2963) = FormalQtyType.QtyOption + nodePropertyDescriptors(3306) = FormalQtyType.StringType // JUMP_TARGET.NAME + nodePropertyDescriptors(3307) = FormalQtyType.QtyOne + nodePropertyDescriptors(3392) = FormalQtyType.IntType // JUMP_TARGET.OFFSET + nodePropertyDescriptors(3393) = FormalQtyType.QtyOption + nodePropertyDescriptors(3478) = FormalQtyType.IntType // JUMP_TARGET.OFFSET_END + nodePropertyDescriptors(3479) = FormalQtyType.QtyOption + nodePropertyDescriptors(3564) = FormalQtyType.IntType // JUMP_TARGET.ORDER + nodePropertyDescriptors(3565) = FormalQtyType.QtyOne + nodePropertyDescriptors(3736) = FormalQtyType.StringType // JUMP_TARGET.PARSER_TYPE_NAME + nodePropertyDescriptors(3737) = FormalQtyType.QtyOne + nodePropertyDescriptors(2792) = FormalQtyType.StringType // KEY_VALUE_PAIR.KEY + nodePropertyDescriptors(2793) = FormalQtyType.QtyOne + nodePropertyDescriptors(4254) = FormalQtyType.StringType // KEY_VALUE_PAIR.VALUE + nodePropertyDescriptors(4255) = FormalQtyType.QtyOne + nodePropertyDescriptors(128) = FormalQtyType.IntType // LITERAL.ARGUMENT_INDEX + nodePropertyDescriptors(129) = FormalQtyType.QtyOne + nodePropertyDescriptors(214) = FormalQtyType.StringType // LITERAL.ARGUMENT_NAME + nodePropertyDescriptors(215) = FormalQtyType.QtyOption + nodePropertyDescriptors(730) = FormalQtyType.StringType // LITERAL.CODE + nodePropertyDescriptors(731) = FormalQtyType.QtyOne + nodePropertyDescriptors(816) = FormalQtyType.IntType // LITERAL.COLUMN_NUMBER + nodePropertyDescriptors(817) = FormalQtyType.QtyOption + nodePropertyDescriptors(1418) = FormalQtyType.StringType // LITERAL.DYNAMIC_TYPE_HINT_FULL_NAME + nodePropertyDescriptors(1419) = FormalQtyType.QtyMulti + nodePropertyDescriptors(2966) = FormalQtyType.IntType // LITERAL.LINE_NUMBER + nodePropertyDescriptors(2967) = FormalQtyType.QtyOption + nodePropertyDescriptors(3396) = FormalQtyType.IntType // LITERAL.OFFSET + nodePropertyDescriptors(3397) = FormalQtyType.QtyOption + nodePropertyDescriptors(3482) = FormalQtyType.IntType // LITERAL.OFFSET_END + nodePropertyDescriptors(3483) = FormalQtyType.QtyOption + nodePropertyDescriptors(3568) = FormalQtyType.IntType // LITERAL.ORDER + nodePropertyDescriptors(3569) = FormalQtyType.QtyOne + nodePropertyDescriptors(3826) = FormalQtyType.StringType // LITERAL.POSSIBLE_TYPES + nodePropertyDescriptors(3827) = FormalQtyType.QtyMulti + nodePropertyDescriptors(4170) = FormalQtyType.StringType // LITERAL.TYPE_FULL_NAME + nodePropertyDescriptors(4171) = FormalQtyType.QtyOne + nodePropertyDescriptors(560) = FormalQtyType.StringType // LOCAL.CLOSURE_BINDING_ID + nodePropertyDescriptors(561) = FormalQtyType.QtyOption + nodePropertyDescriptors(732) = FormalQtyType.StringType // LOCAL.CODE + nodePropertyDescriptors(733) = FormalQtyType.QtyOne + nodePropertyDescriptors(818) = FormalQtyType.IntType // LOCAL.COLUMN_NUMBER + nodePropertyDescriptors(819) = FormalQtyType.QtyOption + nodePropertyDescriptors(1420) = FormalQtyType.StringType // LOCAL.DYNAMIC_TYPE_HINT_FULL_NAME + nodePropertyDescriptors(1421) = FormalQtyType.QtyMulti + nodePropertyDescriptors(1936) = FormalQtyType.StringType // LOCAL.GENERIC_SIGNATURE + nodePropertyDescriptors(1937) = FormalQtyType.QtyOne + nodePropertyDescriptors(2968) = FormalQtyType.IntType // LOCAL.LINE_NUMBER + nodePropertyDescriptors(2969) = FormalQtyType.QtyOption + nodePropertyDescriptors(3312) = FormalQtyType.StringType // LOCAL.NAME + nodePropertyDescriptors(3313) = FormalQtyType.QtyOne + nodePropertyDescriptors(3398) = FormalQtyType.IntType // LOCAL.OFFSET + nodePropertyDescriptors(3399) = FormalQtyType.QtyOption + nodePropertyDescriptors(3484) = FormalQtyType.IntType // LOCAL.OFFSET_END + nodePropertyDescriptors(3485) = FormalQtyType.QtyOption + nodePropertyDescriptors(3570) = FormalQtyType.IntType // LOCAL.ORDER + nodePropertyDescriptors(3571) = FormalQtyType.QtyOne + nodePropertyDescriptors(3828) = FormalQtyType.StringType // LOCAL.POSSIBLE_TYPES + nodePropertyDescriptors(3829) = FormalQtyType.QtyMulti + nodePropertyDescriptors(4172) = FormalQtyType.StringType // LOCAL.TYPE_FULL_NAME + nodePropertyDescriptors(4173) = FormalQtyType.QtyOne + nodePropertyDescriptors(304) = FormalQtyType.StringType // MEMBER.AST_PARENT_FULL_NAME + nodePropertyDescriptors(305) = FormalQtyType.QtyOne + nodePropertyDescriptors(390) = FormalQtyType.StringType // MEMBER.AST_PARENT_TYPE + nodePropertyDescriptors(391) = FormalQtyType.QtyOne + nodePropertyDescriptors(734) = FormalQtyType.StringType // MEMBER.CODE + nodePropertyDescriptors(735) = FormalQtyType.QtyOne + nodePropertyDescriptors(820) = FormalQtyType.IntType // MEMBER.COLUMN_NUMBER + nodePropertyDescriptors(821) = FormalQtyType.QtyOption + nodePropertyDescriptors(1422) = FormalQtyType.StringType // MEMBER.DYNAMIC_TYPE_HINT_FULL_NAME + nodePropertyDescriptors(1423) = FormalQtyType.QtyMulti + nodePropertyDescriptors(1938) = FormalQtyType.StringType // MEMBER.GENERIC_SIGNATURE + nodePropertyDescriptors(1939) = FormalQtyType.QtyOne + nodePropertyDescriptors(2970) = FormalQtyType.IntType // MEMBER.LINE_NUMBER + nodePropertyDescriptors(2971) = FormalQtyType.QtyOption + nodePropertyDescriptors(3314) = FormalQtyType.StringType // MEMBER.NAME + nodePropertyDescriptors(3315) = FormalQtyType.QtyOne + nodePropertyDescriptors(3400) = FormalQtyType.IntType // MEMBER.OFFSET + nodePropertyDescriptors(3401) = FormalQtyType.QtyOption + nodePropertyDescriptors(3486) = FormalQtyType.IntType // MEMBER.OFFSET_END + nodePropertyDescriptors(3487) = FormalQtyType.QtyOption + nodePropertyDescriptors(3572) = FormalQtyType.IntType // MEMBER.ORDER + nodePropertyDescriptors(3573) = FormalQtyType.QtyOne + nodePropertyDescriptors(3830) = FormalQtyType.StringType // MEMBER.POSSIBLE_TYPES + nodePropertyDescriptors(3831) = FormalQtyType.QtyMulti + nodePropertyDescriptors(4174) = FormalQtyType.StringType // MEMBER.TYPE_FULL_NAME + nodePropertyDescriptors(4175) = FormalQtyType.QtyOne + nodePropertyDescriptors(2026) = FormalQtyType.StringType // META_DATA.HASH + nodePropertyDescriptors(2027) = FormalQtyType.QtyOption + nodePropertyDescriptors(2886) = FormalQtyType.StringType // META_DATA.LANGUAGE + nodePropertyDescriptors(2887) = FormalQtyType.QtyOne + nodePropertyDescriptors(3660) = FormalQtyType.StringType // META_DATA.OVERLAYS + nodePropertyDescriptors(3661) = FormalQtyType.QtyMulti + nodePropertyDescriptors(3918) = FormalQtyType.StringType // META_DATA.ROOT + nodePropertyDescriptors(3919) = FormalQtyType.QtyOne + nodePropertyDescriptors(4348) = FormalQtyType.StringType // META_DATA.VERSION + nodePropertyDescriptors(4349) = FormalQtyType.QtyOne + nodePropertyDescriptors(308) = FormalQtyType.StringType // METHOD.AST_PARENT_FULL_NAME + nodePropertyDescriptors(309) = FormalQtyType.QtyOne + nodePropertyDescriptors(394) = FormalQtyType.StringType // METHOD.AST_PARENT_TYPE + nodePropertyDescriptors(395) = FormalQtyType.QtyOne + nodePropertyDescriptors(738) = FormalQtyType.StringType // METHOD.CODE + nodePropertyDescriptors(739) = FormalQtyType.QtyOne + nodePropertyDescriptors(824) = FormalQtyType.IntType // METHOD.COLUMN_NUMBER + nodePropertyDescriptors(825) = FormalQtyType.QtyOption + nodePropertyDescriptors(910) = FormalQtyType.IntType // METHOD.COLUMN_NUMBER_END + nodePropertyDescriptors(911) = FormalQtyType.QtyOption + nodePropertyDescriptors(1770) = FormalQtyType.StringType // METHOD.FILENAME + nodePropertyDescriptors(1771) = FormalQtyType.QtyOne + nodePropertyDescriptors(1856) = FormalQtyType.StringType // METHOD.FULL_NAME + nodePropertyDescriptors(1857) = FormalQtyType.QtyOne + nodePropertyDescriptors(1942) = FormalQtyType.StringType // METHOD.GENERIC_SIGNATURE + nodePropertyDescriptors(1943) = FormalQtyType.QtyOne + nodePropertyDescriptors(2028) = FormalQtyType.StringType // METHOD.HASH + nodePropertyDescriptors(2029) = FormalQtyType.QtyOption + nodePropertyDescriptors(2544) = FormalQtyType.BoolType // METHOD.IS_EXTERNAL + nodePropertyDescriptors(2545) = FormalQtyType.QtyOne + nodePropertyDescriptors(2974) = FormalQtyType.IntType // METHOD.LINE_NUMBER + nodePropertyDescriptors(2975) = FormalQtyType.QtyOption + nodePropertyDescriptors(3060) = FormalQtyType.IntType // METHOD.LINE_NUMBER_END + nodePropertyDescriptors(3061) = FormalQtyType.QtyOption + nodePropertyDescriptors(3318) = FormalQtyType.StringType // METHOD.NAME + nodePropertyDescriptors(3319) = FormalQtyType.QtyOne + nodePropertyDescriptors(3404) = FormalQtyType.IntType // METHOD.OFFSET + nodePropertyDescriptors(3405) = FormalQtyType.QtyOption + nodePropertyDescriptors(3490) = FormalQtyType.IntType // METHOD.OFFSET_END + nodePropertyDescriptors(3491) = FormalQtyType.QtyOption + nodePropertyDescriptors(3576) = FormalQtyType.IntType // METHOD.ORDER + nodePropertyDescriptors(3577) = FormalQtyType.QtyOne + nodePropertyDescriptors(4006) = FormalQtyType.StringType // METHOD.SIGNATURE + nodePropertyDescriptors(4007) = FormalQtyType.QtyOne + nodePropertyDescriptors(568) = FormalQtyType.StringType // METHOD_PARAMETER_IN.CLOSURE_BINDING_ID + nodePropertyDescriptors(569) = FormalQtyType.QtyOption + nodePropertyDescriptors(740) = FormalQtyType.StringType // METHOD_PARAMETER_IN.CODE + nodePropertyDescriptors(741) = FormalQtyType.QtyOne + nodePropertyDescriptors(826) = FormalQtyType.IntType // METHOD_PARAMETER_IN.COLUMN_NUMBER + nodePropertyDescriptors(827) = FormalQtyType.QtyOption + nodePropertyDescriptors(1428) = FormalQtyType.StringType // METHOD_PARAMETER_IN.DYNAMIC_TYPE_HINT_FULL_NAME + nodePropertyDescriptors(1429) = FormalQtyType.QtyMulti + nodePropertyDescriptors(1514) = FormalQtyType.StringType // METHOD_PARAMETER_IN.EVALUATION_STRATEGY + nodePropertyDescriptors(1515) = FormalQtyType.QtyOne + nodePropertyDescriptors(2288) = FormalQtyType.IntType // METHOD_PARAMETER_IN.INDEX + nodePropertyDescriptors(2289) = FormalQtyType.QtyOne + nodePropertyDescriptors(2632) = FormalQtyType.BoolType // METHOD_PARAMETER_IN.IS_VARIADIC + nodePropertyDescriptors(2633) = FormalQtyType.QtyOne + nodePropertyDescriptors(2976) = FormalQtyType.IntType // METHOD_PARAMETER_IN.LINE_NUMBER + nodePropertyDescriptors(2977) = FormalQtyType.QtyOption + nodePropertyDescriptors(3320) = FormalQtyType.StringType // METHOD_PARAMETER_IN.NAME + nodePropertyDescriptors(3321) = FormalQtyType.QtyOne + nodePropertyDescriptors(3406) = FormalQtyType.IntType // METHOD_PARAMETER_IN.OFFSET + nodePropertyDescriptors(3407) = FormalQtyType.QtyOption + nodePropertyDescriptors(3492) = FormalQtyType.IntType // METHOD_PARAMETER_IN.OFFSET_END + nodePropertyDescriptors(3493) = FormalQtyType.QtyOption + nodePropertyDescriptors(3578) = FormalQtyType.IntType // METHOD_PARAMETER_IN.ORDER + nodePropertyDescriptors(3579) = FormalQtyType.QtyOne + nodePropertyDescriptors(3836) = FormalQtyType.StringType // METHOD_PARAMETER_IN.POSSIBLE_TYPES + nodePropertyDescriptors(3837) = FormalQtyType.QtyMulti + nodePropertyDescriptors(4180) = FormalQtyType.StringType // METHOD_PARAMETER_IN.TYPE_FULL_NAME + nodePropertyDescriptors(4181) = FormalQtyType.QtyOne + nodePropertyDescriptors(742) = FormalQtyType.StringType // METHOD_PARAMETER_OUT.CODE + nodePropertyDescriptors(743) = FormalQtyType.QtyOne + nodePropertyDescriptors(828) = FormalQtyType.IntType // METHOD_PARAMETER_OUT.COLUMN_NUMBER + nodePropertyDescriptors(829) = FormalQtyType.QtyOption + nodePropertyDescriptors(1516) = FormalQtyType.StringType // METHOD_PARAMETER_OUT.EVALUATION_STRATEGY + nodePropertyDescriptors(1517) = FormalQtyType.QtyOne + nodePropertyDescriptors(2290) = FormalQtyType.IntType // METHOD_PARAMETER_OUT.INDEX + nodePropertyDescriptors(2291) = FormalQtyType.QtyOne + nodePropertyDescriptors(2634) = FormalQtyType.BoolType // METHOD_PARAMETER_OUT.IS_VARIADIC + nodePropertyDescriptors(2635) = FormalQtyType.QtyOne + nodePropertyDescriptors(2978) = FormalQtyType.IntType // METHOD_PARAMETER_OUT.LINE_NUMBER + nodePropertyDescriptors(2979) = FormalQtyType.QtyOption + nodePropertyDescriptors(3322) = FormalQtyType.StringType // METHOD_PARAMETER_OUT.NAME + nodePropertyDescriptors(3323) = FormalQtyType.QtyOne + nodePropertyDescriptors(3408) = FormalQtyType.IntType // METHOD_PARAMETER_OUT.OFFSET + nodePropertyDescriptors(3409) = FormalQtyType.QtyOption + nodePropertyDescriptors(3494) = FormalQtyType.IntType // METHOD_PARAMETER_OUT.OFFSET_END + nodePropertyDescriptors(3495) = FormalQtyType.QtyOption + nodePropertyDescriptors(3580) = FormalQtyType.IntType // METHOD_PARAMETER_OUT.ORDER + nodePropertyDescriptors(3581) = FormalQtyType.QtyOne + nodePropertyDescriptors(4182) = FormalQtyType.StringType // METHOD_PARAMETER_OUT.TYPE_FULL_NAME nodePropertyDescriptors(4183) = FormalQtyType.QtyOne - nodePropertyDescriptors(4622) = FormalQtyType.StringType // LOCATION.SYMBOL - nodePropertyDescriptors(4623) = FormalQtyType.QtyOne - nodePropertyDescriptors(5238) = FormalQtyType.RefType // LOCATION.node - nodePropertyDescriptors(5239) = FormalQtyType.QtyOption - nodePropertyDescriptors(312) = FormalQtyType.StringType // MEMBER.AST_PARENT_FULL_NAME - nodePropertyDescriptors(313) = FormalQtyType.QtyOne - nodePropertyDescriptors(400) = FormalQtyType.StringType // MEMBER.AST_PARENT_TYPE - nodePropertyDescriptors(401) = FormalQtyType.QtyOne - nodePropertyDescriptors(928) = FormalQtyType.StringType // MEMBER.CODE - nodePropertyDescriptors(929) = FormalQtyType.QtyOne - nodePropertyDescriptors(1016) = FormalQtyType.IntType // MEMBER.COLUMN_NUMBER - nodePropertyDescriptors(1017) = FormalQtyType.QtyOption - nodePropertyDescriptors(1632) = FormalQtyType.StringType // MEMBER.DYNAMIC_TYPE_HINT_FULL_NAME - nodePropertyDescriptors(1633) = FormalQtyType.QtyMulti - nodePropertyDescriptors(2160) = FormalQtyType.StringType // MEMBER.GENERIC_SIGNATURE - nodePropertyDescriptors(2161) = FormalQtyType.QtyOne - nodePropertyDescriptors(3216) = FormalQtyType.IntType // MEMBER.LINE_NUMBER - nodePropertyDescriptors(3217) = FormalQtyType.QtyOption - nodePropertyDescriptors(3656) = FormalQtyType.StringType // MEMBER.NAME - nodePropertyDescriptors(3657) = FormalQtyType.QtyOne - nodePropertyDescriptors(3832) = FormalQtyType.IntType // MEMBER.OFFSET - nodePropertyDescriptors(3833) = FormalQtyType.QtyOption - nodePropertyDescriptors(3920) = FormalQtyType.IntType // MEMBER.OFFSET_END - nodePropertyDescriptors(3921) = FormalQtyType.QtyOption - nodePropertyDescriptors(4008) = FormalQtyType.IntType // MEMBER.ORDER - nodePropertyDescriptors(4009) = FormalQtyType.QtyOne - nodePropertyDescriptors(4360) = FormalQtyType.StringType // MEMBER.POSSIBLE_TYPES - nodePropertyDescriptors(4361) = FormalQtyType.QtyMulti - nodePropertyDescriptors(4800) = FormalQtyType.StringType // MEMBER.TYPE_FULL_NAME - nodePropertyDescriptors(4801) = FormalQtyType.QtyOne - nodePropertyDescriptors(2250) = FormalQtyType.StringType // META_DATA.HASH - nodePropertyDescriptors(2251) = FormalQtyType.QtyOption - nodePropertyDescriptors(3130) = FormalQtyType.StringType // META_DATA.LANGUAGE - nodePropertyDescriptors(3131) = FormalQtyType.QtyOne - nodePropertyDescriptors(4098) = FormalQtyType.StringType // META_DATA.OVERLAYS - nodePropertyDescriptors(4099) = FormalQtyType.QtyMulti - nodePropertyDescriptors(4450) = FormalQtyType.StringType // META_DATA.ROOT - nodePropertyDescriptors(4451) = FormalQtyType.QtyOne - nodePropertyDescriptors(4978) = FormalQtyType.StringType // META_DATA.VERSION - nodePropertyDescriptors(4979) = FormalQtyType.QtyOne - nodePropertyDescriptors(316) = FormalQtyType.StringType // METHOD.AST_PARENT_FULL_NAME - nodePropertyDescriptors(317) = FormalQtyType.QtyOne - nodePropertyDescriptors(404) = FormalQtyType.StringType // METHOD.AST_PARENT_TYPE - nodePropertyDescriptors(405) = FormalQtyType.QtyOne - nodePropertyDescriptors(932) = FormalQtyType.StringType // METHOD.CODE - nodePropertyDescriptors(933) = FormalQtyType.QtyOne - nodePropertyDescriptors(1020) = FormalQtyType.IntType // METHOD.COLUMN_NUMBER - nodePropertyDescriptors(1021) = FormalQtyType.QtyOption - nodePropertyDescriptors(1108) = FormalQtyType.IntType // METHOD.COLUMN_NUMBER_END - nodePropertyDescriptors(1109) = FormalQtyType.QtyOption - nodePropertyDescriptors(1988) = FormalQtyType.StringType // METHOD.FILENAME - nodePropertyDescriptors(1989) = FormalQtyType.QtyOne - nodePropertyDescriptors(2076) = FormalQtyType.StringType // METHOD.FULL_NAME - nodePropertyDescriptors(2077) = FormalQtyType.QtyOne - nodePropertyDescriptors(2164) = FormalQtyType.StringType // METHOD.GENERIC_SIGNATURE - nodePropertyDescriptors(2165) = FormalQtyType.QtyOne - nodePropertyDescriptors(2252) = FormalQtyType.StringType // METHOD.HASH - nodePropertyDescriptors(2253) = FormalQtyType.QtyOption - nodePropertyDescriptors(2780) = FormalQtyType.BoolType // METHOD.IS_EXTERNAL - nodePropertyDescriptors(2781) = FormalQtyType.QtyOne - nodePropertyDescriptors(3220) = FormalQtyType.IntType // METHOD.LINE_NUMBER - nodePropertyDescriptors(3221) = FormalQtyType.QtyOption - nodePropertyDescriptors(3308) = FormalQtyType.IntType // METHOD.LINE_NUMBER_END - nodePropertyDescriptors(3309) = FormalQtyType.QtyOption - nodePropertyDescriptors(3660) = FormalQtyType.StringType // METHOD.NAME - nodePropertyDescriptors(3661) = FormalQtyType.QtyOne - nodePropertyDescriptors(3836) = FormalQtyType.IntType // METHOD.OFFSET - nodePropertyDescriptors(3837) = FormalQtyType.QtyOption - nodePropertyDescriptors(3924) = FormalQtyType.IntType // METHOD.OFFSET_END - nodePropertyDescriptors(3925) = FormalQtyType.QtyOption - nodePropertyDescriptors(4012) = FormalQtyType.IntType // METHOD.ORDER - nodePropertyDescriptors(4013) = FormalQtyType.QtyOne - nodePropertyDescriptors(4540) = FormalQtyType.StringType // METHOD.SIGNATURE - nodePropertyDescriptors(4541) = FormalQtyType.QtyOne - nodePropertyDescriptors(758) = FormalQtyType.StringType // METHOD_PARAMETER_IN.CLOSURE_BINDING_ID - nodePropertyDescriptors(759) = FormalQtyType.QtyOption - nodePropertyDescriptors(934) = FormalQtyType.StringType // METHOD_PARAMETER_IN.CODE - nodePropertyDescriptors(935) = FormalQtyType.QtyOne - nodePropertyDescriptors(1022) = FormalQtyType.IntType // METHOD_PARAMETER_IN.COLUMN_NUMBER - nodePropertyDescriptors(1023) = FormalQtyType.QtyOption - nodePropertyDescriptors(1638) = FormalQtyType.StringType // METHOD_PARAMETER_IN.DYNAMIC_TYPE_HINT_FULL_NAME - nodePropertyDescriptors(1639) = FormalQtyType.QtyMulti - nodePropertyDescriptors(1726) = FormalQtyType.StringType // METHOD_PARAMETER_IN.EVALUATION_STRATEGY - nodePropertyDescriptors(1727) = FormalQtyType.QtyOne - nodePropertyDescriptors(2518) = FormalQtyType.IntType // METHOD_PARAMETER_IN.INDEX - nodePropertyDescriptors(2519) = FormalQtyType.QtyOne - nodePropertyDescriptors(2870) = FormalQtyType.BoolType // METHOD_PARAMETER_IN.IS_VARIADIC - nodePropertyDescriptors(2871) = FormalQtyType.QtyOne - nodePropertyDescriptors(3222) = FormalQtyType.IntType // METHOD_PARAMETER_IN.LINE_NUMBER - nodePropertyDescriptors(3223) = FormalQtyType.QtyOption - nodePropertyDescriptors(3662) = FormalQtyType.StringType // METHOD_PARAMETER_IN.NAME - nodePropertyDescriptors(3663) = FormalQtyType.QtyOne - nodePropertyDescriptors(3838) = FormalQtyType.IntType // METHOD_PARAMETER_IN.OFFSET - nodePropertyDescriptors(3839) = FormalQtyType.QtyOption - nodePropertyDescriptors(3926) = FormalQtyType.IntType // METHOD_PARAMETER_IN.OFFSET_END - nodePropertyDescriptors(3927) = FormalQtyType.QtyOption - nodePropertyDescriptors(4014) = FormalQtyType.IntType // METHOD_PARAMETER_IN.ORDER - nodePropertyDescriptors(4015) = FormalQtyType.QtyOne - nodePropertyDescriptors(4366) = FormalQtyType.StringType // METHOD_PARAMETER_IN.POSSIBLE_TYPES - nodePropertyDescriptors(4367) = FormalQtyType.QtyMulti - nodePropertyDescriptors(4806) = FormalQtyType.StringType // METHOD_PARAMETER_IN.TYPE_FULL_NAME - nodePropertyDescriptors(4807) = FormalQtyType.QtyOne - nodePropertyDescriptors(936) = FormalQtyType.StringType // METHOD_PARAMETER_OUT.CODE - nodePropertyDescriptors(937) = FormalQtyType.QtyOne - nodePropertyDescriptors(1024) = FormalQtyType.IntType // METHOD_PARAMETER_OUT.COLUMN_NUMBER - nodePropertyDescriptors(1025) = FormalQtyType.QtyOption - nodePropertyDescriptors(1728) = FormalQtyType.StringType // METHOD_PARAMETER_OUT.EVALUATION_STRATEGY - nodePropertyDescriptors(1729) = FormalQtyType.QtyOne - nodePropertyDescriptors(2520) = FormalQtyType.IntType // METHOD_PARAMETER_OUT.INDEX - nodePropertyDescriptors(2521) = FormalQtyType.QtyOne - nodePropertyDescriptors(2872) = FormalQtyType.BoolType // METHOD_PARAMETER_OUT.IS_VARIADIC - nodePropertyDescriptors(2873) = FormalQtyType.QtyOne - nodePropertyDescriptors(3224) = FormalQtyType.IntType // METHOD_PARAMETER_OUT.LINE_NUMBER - nodePropertyDescriptors(3225) = FormalQtyType.QtyOption - nodePropertyDescriptors(3664) = FormalQtyType.StringType // METHOD_PARAMETER_OUT.NAME - nodePropertyDescriptors(3665) = FormalQtyType.QtyOne - nodePropertyDescriptors(3840) = FormalQtyType.IntType // METHOD_PARAMETER_OUT.OFFSET - nodePropertyDescriptors(3841) = FormalQtyType.QtyOption - nodePropertyDescriptors(3928) = FormalQtyType.IntType // METHOD_PARAMETER_OUT.OFFSET_END - nodePropertyDescriptors(3929) = FormalQtyType.QtyOption - nodePropertyDescriptors(4016) = FormalQtyType.IntType // METHOD_PARAMETER_OUT.ORDER - nodePropertyDescriptors(4017) = FormalQtyType.QtyOne - nodePropertyDescriptors(4808) = FormalQtyType.StringType // METHOD_PARAMETER_OUT.TYPE_FULL_NAME - nodePropertyDescriptors(4809) = FormalQtyType.QtyOne - nodePropertyDescriptors(146) = FormalQtyType.IntType // METHOD_REF.ARGUMENT_INDEX - nodePropertyDescriptors(147) = FormalQtyType.QtyOne - nodePropertyDescriptors(234) = FormalQtyType.StringType // METHOD_REF.ARGUMENT_NAME - nodePropertyDescriptors(235) = FormalQtyType.QtyOption - nodePropertyDescriptors(938) = FormalQtyType.StringType // METHOD_REF.CODE - nodePropertyDescriptors(939) = FormalQtyType.QtyOne - nodePropertyDescriptors(1026) = FormalQtyType.IntType // METHOD_REF.COLUMN_NUMBER - nodePropertyDescriptors(1027) = FormalQtyType.QtyOption - nodePropertyDescriptors(1642) = FormalQtyType.StringType // METHOD_REF.DYNAMIC_TYPE_HINT_FULL_NAME - nodePropertyDescriptors(1643) = FormalQtyType.QtyMulti - nodePropertyDescriptors(3226) = FormalQtyType.IntType // METHOD_REF.LINE_NUMBER - nodePropertyDescriptors(3227) = FormalQtyType.QtyOption - nodePropertyDescriptors(3402) = FormalQtyType.StringType // METHOD_REF.METHOD_FULL_NAME - nodePropertyDescriptors(3403) = FormalQtyType.QtyOne - nodePropertyDescriptors(3842) = FormalQtyType.IntType // METHOD_REF.OFFSET - nodePropertyDescriptors(3843) = FormalQtyType.QtyOption - nodePropertyDescriptors(3930) = FormalQtyType.IntType // METHOD_REF.OFFSET_END - nodePropertyDescriptors(3931) = FormalQtyType.QtyOption - nodePropertyDescriptors(4018) = FormalQtyType.IntType // METHOD_REF.ORDER - nodePropertyDescriptors(4019) = FormalQtyType.QtyOne - nodePropertyDescriptors(4370) = FormalQtyType.StringType // METHOD_REF.POSSIBLE_TYPES - nodePropertyDescriptors(4371) = FormalQtyType.QtyMulti - nodePropertyDescriptors(4810) = FormalQtyType.StringType // METHOD_REF.TYPE_FULL_NAME - nodePropertyDescriptors(4811) = FormalQtyType.QtyOne - nodePropertyDescriptors(940) = FormalQtyType.StringType // METHOD_RETURN.CODE - nodePropertyDescriptors(941) = FormalQtyType.QtyOne - nodePropertyDescriptors(1028) = FormalQtyType.IntType // METHOD_RETURN.COLUMN_NUMBER - nodePropertyDescriptors(1029) = FormalQtyType.QtyOption - nodePropertyDescriptors(1644) = FormalQtyType.StringType // METHOD_RETURN.DYNAMIC_TYPE_HINT_FULL_NAME - nodePropertyDescriptors(1645) = FormalQtyType.QtyMulti - nodePropertyDescriptors(1732) = FormalQtyType.StringType // METHOD_RETURN.EVALUATION_STRATEGY - nodePropertyDescriptors(1733) = FormalQtyType.QtyOne - nodePropertyDescriptors(3228) = FormalQtyType.IntType // METHOD_RETURN.LINE_NUMBER - nodePropertyDescriptors(3229) = FormalQtyType.QtyOption - nodePropertyDescriptors(3844) = FormalQtyType.IntType // METHOD_RETURN.OFFSET - nodePropertyDescriptors(3845) = FormalQtyType.QtyOption - nodePropertyDescriptors(3932) = FormalQtyType.IntType // METHOD_RETURN.OFFSET_END - nodePropertyDescriptors(3933) = FormalQtyType.QtyOption - nodePropertyDescriptors(4020) = FormalQtyType.IntType // METHOD_RETURN.ORDER - nodePropertyDescriptors(4021) = FormalQtyType.QtyOne - nodePropertyDescriptors(4372) = FormalQtyType.StringType // METHOD_RETURN.POSSIBLE_TYPES - nodePropertyDescriptors(4373) = FormalQtyType.QtyMulti - nodePropertyDescriptors(4812) = FormalQtyType.StringType // METHOD_RETURN.TYPE_FULL_NAME - nodePropertyDescriptors(4813) = FormalQtyType.QtyOne - nodePropertyDescriptors(942) = FormalQtyType.StringType // MODIFIER.CODE - nodePropertyDescriptors(943) = FormalQtyType.QtyOne - nodePropertyDescriptors(1030) = FormalQtyType.IntType // MODIFIER.COLUMN_NUMBER - nodePropertyDescriptors(1031) = FormalQtyType.QtyOption - nodePropertyDescriptors(3230) = FormalQtyType.IntType // MODIFIER.LINE_NUMBER - nodePropertyDescriptors(3231) = FormalQtyType.QtyOption - nodePropertyDescriptors(3582) = FormalQtyType.StringType // MODIFIER.MODIFIER_TYPE + nodePropertyDescriptors(142) = FormalQtyType.IntType // METHOD_REF.ARGUMENT_INDEX + nodePropertyDescriptors(143) = FormalQtyType.QtyOne + nodePropertyDescriptors(228) = FormalQtyType.StringType // METHOD_REF.ARGUMENT_NAME + nodePropertyDescriptors(229) = FormalQtyType.QtyOption + nodePropertyDescriptors(744) = FormalQtyType.StringType // METHOD_REF.CODE + nodePropertyDescriptors(745) = FormalQtyType.QtyOne + nodePropertyDescriptors(830) = FormalQtyType.IntType // METHOD_REF.COLUMN_NUMBER + nodePropertyDescriptors(831) = FormalQtyType.QtyOption + nodePropertyDescriptors(1432) = FormalQtyType.StringType // METHOD_REF.DYNAMIC_TYPE_HINT_FULL_NAME + nodePropertyDescriptors(1433) = FormalQtyType.QtyMulti + nodePropertyDescriptors(2980) = FormalQtyType.IntType // METHOD_REF.LINE_NUMBER + nodePropertyDescriptors(2981) = FormalQtyType.QtyOption + nodePropertyDescriptors(3152) = FormalQtyType.StringType // METHOD_REF.METHOD_FULL_NAME + nodePropertyDescriptors(3153) = FormalQtyType.QtyOne + nodePropertyDescriptors(3410) = FormalQtyType.IntType // METHOD_REF.OFFSET + nodePropertyDescriptors(3411) = FormalQtyType.QtyOption + nodePropertyDescriptors(3496) = FormalQtyType.IntType // METHOD_REF.OFFSET_END + nodePropertyDescriptors(3497) = FormalQtyType.QtyOption + nodePropertyDescriptors(3582) = FormalQtyType.IntType // METHOD_REF.ORDER nodePropertyDescriptors(3583) = FormalQtyType.QtyOne - nodePropertyDescriptors(3846) = FormalQtyType.IntType // MODIFIER.OFFSET - nodePropertyDescriptors(3847) = FormalQtyType.QtyOption - nodePropertyDescriptors(3934) = FormalQtyType.IntType // MODIFIER.OFFSET_END - nodePropertyDescriptors(3935) = FormalQtyType.QtyOption - nodePropertyDescriptors(4022) = FormalQtyType.IntType // MODIFIER.ORDER - nodePropertyDescriptors(4023) = FormalQtyType.QtyOne - nodePropertyDescriptors(944) = FormalQtyType.StringType // NAMESPACE.CODE - nodePropertyDescriptors(945) = FormalQtyType.QtyOne - nodePropertyDescriptors(1032) = FormalQtyType.IntType // NAMESPACE.COLUMN_NUMBER - nodePropertyDescriptors(1033) = FormalQtyType.QtyOption - nodePropertyDescriptors(3232) = FormalQtyType.IntType // NAMESPACE.LINE_NUMBER - nodePropertyDescriptors(3233) = FormalQtyType.QtyOption - nodePropertyDescriptors(3672) = FormalQtyType.StringType // NAMESPACE.NAME - nodePropertyDescriptors(3673) = FormalQtyType.QtyOne - nodePropertyDescriptors(3848) = FormalQtyType.IntType // NAMESPACE.OFFSET - nodePropertyDescriptors(3849) = FormalQtyType.QtyOption - nodePropertyDescriptors(3936) = FormalQtyType.IntType // NAMESPACE.OFFSET_END - nodePropertyDescriptors(3937) = FormalQtyType.QtyOption - nodePropertyDescriptors(4024) = FormalQtyType.IntType // NAMESPACE.ORDER - nodePropertyDescriptors(4025) = FormalQtyType.QtyOne - nodePropertyDescriptors(946) = FormalQtyType.StringType // NAMESPACE_BLOCK.CODE - nodePropertyDescriptors(947) = FormalQtyType.QtyOne - nodePropertyDescriptors(1034) = FormalQtyType.IntType // NAMESPACE_BLOCK.COLUMN_NUMBER - nodePropertyDescriptors(1035) = FormalQtyType.QtyOption - nodePropertyDescriptors(2002) = FormalQtyType.StringType // NAMESPACE_BLOCK.FILENAME - nodePropertyDescriptors(2003) = FormalQtyType.QtyOne - nodePropertyDescriptors(2090) = FormalQtyType.StringType // NAMESPACE_BLOCK.FULL_NAME - nodePropertyDescriptors(2091) = FormalQtyType.QtyOne - nodePropertyDescriptors(3234) = FormalQtyType.IntType // NAMESPACE_BLOCK.LINE_NUMBER - nodePropertyDescriptors(3235) = FormalQtyType.QtyOption - nodePropertyDescriptors(3674) = FormalQtyType.StringType // NAMESPACE_BLOCK.NAME - nodePropertyDescriptors(3675) = FormalQtyType.QtyOne - nodePropertyDescriptors(3850) = FormalQtyType.IntType // NAMESPACE_BLOCK.OFFSET - nodePropertyDescriptors(3851) = FormalQtyType.QtyOption - nodePropertyDescriptors(3938) = FormalQtyType.IntType // NAMESPACE_BLOCK.OFFSET_END - nodePropertyDescriptors(3939) = FormalQtyType.QtyOption - nodePropertyDescriptors(4026) = FormalQtyType.IntType // NAMESPACE_BLOCK.ORDER - nodePropertyDescriptors(4027) = FormalQtyType.QtyOne - nodePropertyDescriptors(156) = FormalQtyType.IntType // RETURN.ARGUMENT_INDEX - nodePropertyDescriptors(157) = FormalQtyType.QtyOne - nodePropertyDescriptors(244) = FormalQtyType.StringType // RETURN.ARGUMENT_NAME + nodePropertyDescriptors(3840) = FormalQtyType.StringType // METHOD_REF.POSSIBLE_TYPES + nodePropertyDescriptors(3841) = FormalQtyType.QtyMulti + nodePropertyDescriptors(4184) = FormalQtyType.StringType // METHOD_REF.TYPE_FULL_NAME + nodePropertyDescriptors(4185) = FormalQtyType.QtyOne + nodePropertyDescriptors(746) = FormalQtyType.StringType // METHOD_RETURN.CODE + nodePropertyDescriptors(747) = FormalQtyType.QtyOne + nodePropertyDescriptors(832) = FormalQtyType.IntType // METHOD_RETURN.COLUMN_NUMBER + nodePropertyDescriptors(833) = FormalQtyType.QtyOption + nodePropertyDescriptors(1434) = FormalQtyType.StringType // METHOD_RETURN.DYNAMIC_TYPE_HINT_FULL_NAME + nodePropertyDescriptors(1435) = FormalQtyType.QtyMulti + nodePropertyDescriptors(1520) = FormalQtyType.StringType // METHOD_RETURN.EVALUATION_STRATEGY + nodePropertyDescriptors(1521) = FormalQtyType.QtyOne + nodePropertyDescriptors(2982) = FormalQtyType.IntType // METHOD_RETURN.LINE_NUMBER + nodePropertyDescriptors(2983) = FormalQtyType.QtyOption + nodePropertyDescriptors(3412) = FormalQtyType.IntType // METHOD_RETURN.OFFSET + nodePropertyDescriptors(3413) = FormalQtyType.QtyOption + nodePropertyDescriptors(3498) = FormalQtyType.IntType // METHOD_RETURN.OFFSET_END + nodePropertyDescriptors(3499) = FormalQtyType.QtyOption + nodePropertyDescriptors(3584) = FormalQtyType.IntType // METHOD_RETURN.ORDER + nodePropertyDescriptors(3585) = FormalQtyType.QtyOne + nodePropertyDescriptors(3842) = FormalQtyType.StringType // METHOD_RETURN.POSSIBLE_TYPES + nodePropertyDescriptors(3843) = FormalQtyType.QtyMulti + nodePropertyDescriptors(4186) = FormalQtyType.StringType // METHOD_RETURN.TYPE_FULL_NAME + nodePropertyDescriptors(4187) = FormalQtyType.QtyOne + nodePropertyDescriptors(748) = FormalQtyType.StringType // MODIFIER.CODE + nodePropertyDescriptors(749) = FormalQtyType.QtyOne + nodePropertyDescriptors(834) = FormalQtyType.IntType // MODIFIER.COLUMN_NUMBER + nodePropertyDescriptors(835) = FormalQtyType.QtyOption + nodePropertyDescriptors(2984) = FormalQtyType.IntType // MODIFIER.LINE_NUMBER + nodePropertyDescriptors(2985) = FormalQtyType.QtyOption + nodePropertyDescriptors(3242) = FormalQtyType.StringType // MODIFIER.MODIFIER_TYPE + nodePropertyDescriptors(3243) = FormalQtyType.QtyOne + nodePropertyDescriptors(3414) = FormalQtyType.IntType // MODIFIER.OFFSET + nodePropertyDescriptors(3415) = FormalQtyType.QtyOption + nodePropertyDescriptors(3500) = FormalQtyType.IntType // MODIFIER.OFFSET_END + nodePropertyDescriptors(3501) = FormalQtyType.QtyOption + nodePropertyDescriptors(3586) = FormalQtyType.IntType // MODIFIER.ORDER + nodePropertyDescriptors(3587) = FormalQtyType.QtyOne + nodePropertyDescriptors(750) = FormalQtyType.StringType // NAMESPACE.CODE + nodePropertyDescriptors(751) = FormalQtyType.QtyOne + nodePropertyDescriptors(836) = FormalQtyType.IntType // NAMESPACE.COLUMN_NUMBER + nodePropertyDescriptors(837) = FormalQtyType.QtyOption + nodePropertyDescriptors(2986) = FormalQtyType.IntType // NAMESPACE.LINE_NUMBER + nodePropertyDescriptors(2987) = FormalQtyType.QtyOption + nodePropertyDescriptors(3330) = FormalQtyType.StringType // NAMESPACE.NAME + nodePropertyDescriptors(3331) = FormalQtyType.QtyOne + nodePropertyDescriptors(3416) = FormalQtyType.IntType // NAMESPACE.OFFSET + nodePropertyDescriptors(3417) = FormalQtyType.QtyOption + nodePropertyDescriptors(3502) = FormalQtyType.IntType // NAMESPACE.OFFSET_END + nodePropertyDescriptors(3503) = FormalQtyType.QtyOption + nodePropertyDescriptors(3588) = FormalQtyType.IntType // NAMESPACE.ORDER + nodePropertyDescriptors(3589) = FormalQtyType.QtyOne + nodePropertyDescriptors(752) = FormalQtyType.StringType // NAMESPACE_BLOCK.CODE + nodePropertyDescriptors(753) = FormalQtyType.QtyOne + nodePropertyDescriptors(838) = FormalQtyType.IntType // NAMESPACE_BLOCK.COLUMN_NUMBER + nodePropertyDescriptors(839) = FormalQtyType.QtyOption + nodePropertyDescriptors(1784) = FormalQtyType.StringType // NAMESPACE_BLOCK.FILENAME + nodePropertyDescriptors(1785) = FormalQtyType.QtyOne + nodePropertyDescriptors(1870) = FormalQtyType.StringType // NAMESPACE_BLOCK.FULL_NAME + nodePropertyDescriptors(1871) = FormalQtyType.QtyOne + nodePropertyDescriptors(2988) = FormalQtyType.IntType // NAMESPACE_BLOCK.LINE_NUMBER + nodePropertyDescriptors(2989) = FormalQtyType.QtyOption + nodePropertyDescriptors(3332) = FormalQtyType.StringType // NAMESPACE_BLOCK.NAME + nodePropertyDescriptors(3333) = FormalQtyType.QtyOne + nodePropertyDescriptors(3418) = FormalQtyType.IntType // NAMESPACE_BLOCK.OFFSET + nodePropertyDescriptors(3419) = FormalQtyType.QtyOption + nodePropertyDescriptors(3504) = FormalQtyType.IntType // NAMESPACE_BLOCK.OFFSET_END + nodePropertyDescriptors(3505) = FormalQtyType.QtyOption + nodePropertyDescriptors(3590) = FormalQtyType.IntType // NAMESPACE_BLOCK.ORDER + nodePropertyDescriptors(3591) = FormalQtyType.QtyOne + nodePropertyDescriptors(152) = FormalQtyType.IntType // RETURN.ARGUMENT_INDEX + nodePropertyDescriptors(153) = FormalQtyType.QtyOne + nodePropertyDescriptors(238) = FormalQtyType.StringType // RETURN.ARGUMENT_NAME + nodePropertyDescriptors(239) = FormalQtyType.QtyOption + nodePropertyDescriptors(754) = FormalQtyType.StringType // RETURN.CODE + nodePropertyDescriptors(755) = FormalQtyType.QtyOne + nodePropertyDescriptors(840) = FormalQtyType.IntType // RETURN.COLUMN_NUMBER + nodePropertyDescriptors(841) = FormalQtyType.QtyOption + nodePropertyDescriptors(2990) = FormalQtyType.IntType // RETURN.LINE_NUMBER + nodePropertyDescriptors(2991) = FormalQtyType.QtyOption + nodePropertyDescriptors(3420) = FormalQtyType.IntType // RETURN.OFFSET + nodePropertyDescriptors(3421) = FormalQtyType.QtyOption + nodePropertyDescriptors(3506) = FormalQtyType.IntType // RETURN.OFFSET_END + nodePropertyDescriptors(3507) = FormalQtyType.QtyOption + nodePropertyDescriptors(3592) = FormalQtyType.IntType // RETURN.ORDER + nodePropertyDescriptors(3593) = FormalQtyType.QtyOne + nodePropertyDescriptors(3336) = FormalQtyType.StringType // TAG.NAME + nodePropertyDescriptors(3337) = FormalQtyType.QtyOne + nodePropertyDescriptors(4282) = FormalQtyType.StringType // TAG.VALUE + nodePropertyDescriptors(4283) = FormalQtyType.QtyOne + nodePropertyDescriptors(4628) = FormalQtyType.RefType // TAG_NODE_PAIR.node + nodePropertyDescriptors(4629) = FormalQtyType.QtyOne + nodePropertyDescriptors(4714) = FormalQtyType.RefType // TAG_NODE_PAIR.tag + nodePropertyDescriptors(4715) = FormalQtyType.QtyOne + nodePropertyDescriptors(158) = FormalQtyType.IntType // TEMPLATE_DOM.ARGUMENT_INDEX + nodePropertyDescriptors(159) = FormalQtyType.QtyOne + nodePropertyDescriptors(244) = FormalQtyType.StringType // TEMPLATE_DOM.ARGUMENT_NAME nodePropertyDescriptors(245) = FormalQtyType.QtyOption - nodePropertyDescriptors(948) = FormalQtyType.StringType // RETURN.CODE - nodePropertyDescriptors(949) = FormalQtyType.QtyOne - nodePropertyDescriptors(1036) = FormalQtyType.IntType // RETURN.COLUMN_NUMBER - nodePropertyDescriptors(1037) = FormalQtyType.QtyOption - nodePropertyDescriptors(3236) = FormalQtyType.IntType // RETURN.LINE_NUMBER - nodePropertyDescriptors(3237) = FormalQtyType.QtyOption - nodePropertyDescriptors(3852) = FormalQtyType.IntType // RETURN.OFFSET - nodePropertyDescriptors(3853) = FormalQtyType.QtyOption - nodePropertyDescriptors(3940) = FormalQtyType.IntType // RETURN.OFFSET_END - nodePropertyDescriptors(3941) = FormalQtyType.QtyOption - nodePropertyDescriptors(4028) = FormalQtyType.IntType // RETURN.ORDER - nodePropertyDescriptors(4029) = FormalQtyType.QtyOne - nodePropertyDescriptors(3678) = FormalQtyType.StringType // TAG.NAME - nodePropertyDescriptors(3679) = FormalQtyType.QtyOne - nodePropertyDescriptors(4910) = FormalQtyType.StringType // TAG.VALUE - nodePropertyDescriptors(4911) = FormalQtyType.QtyOne - nodePropertyDescriptors(5264) = FormalQtyType.RefType // TAG_NODE_PAIR.node - nodePropertyDescriptors(5265) = FormalQtyType.QtyOne - nodePropertyDescriptors(5352) = FormalQtyType.RefType // TAG_NODE_PAIR.tag - nodePropertyDescriptors(5353) = FormalQtyType.QtyOne - nodePropertyDescriptors(162) = FormalQtyType.IntType // TEMPLATE_DOM.ARGUMENT_INDEX - nodePropertyDescriptors(163) = FormalQtyType.QtyOne - nodePropertyDescriptors(250) = FormalQtyType.StringType // TEMPLATE_DOM.ARGUMENT_NAME - nodePropertyDescriptors(251) = FormalQtyType.QtyOption - nodePropertyDescriptors(954) = FormalQtyType.StringType // TEMPLATE_DOM.CODE - nodePropertyDescriptors(955) = FormalQtyType.QtyOne - nodePropertyDescriptors(1042) = FormalQtyType.IntType // TEMPLATE_DOM.COLUMN_NUMBER - nodePropertyDescriptors(1043) = FormalQtyType.QtyOption - nodePropertyDescriptors(3242) = FormalQtyType.IntType // TEMPLATE_DOM.LINE_NUMBER - nodePropertyDescriptors(3243) = FormalQtyType.QtyOption - nodePropertyDescriptors(3682) = FormalQtyType.StringType // TEMPLATE_DOM.NAME - nodePropertyDescriptors(3683) = FormalQtyType.QtyOne - nodePropertyDescriptors(3858) = FormalQtyType.IntType // TEMPLATE_DOM.OFFSET - nodePropertyDescriptors(3859) = FormalQtyType.QtyOption - nodePropertyDescriptors(3946) = FormalQtyType.IntType // TEMPLATE_DOM.OFFSET_END - nodePropertyDescriptors(3947) = FormalQtyType.QtyOption - nodePropertyDescriptors(4034) = FormalQtyType.IntType // TEMPLATE_DOM.ORDER - nodePropertyDescriptors(4035) = FormalQtyType.QtyOne - nodePropertyDescriptors(2100) = FormalQtyType.StringType // TYPE.FULL_NAME - nodePropertyDescriptors(2101) = FormalQtyType.QtyOne - nodePropertyDescriptors(3684) = FormalQtyType.StringType // TYPE.NAME - nodePropertyDescriptors(3685) = FormalQtyType.QtyOne - nodePropertyDescriptors(4740) = FormalQtyType.StringType // TYPE.TYPE_DECL_FULL_NAME - nodePropertyDescriptors(4741) = FormalQtyType.QtyOne - nodePropertyDescriptors(958) = FormalQtyType.StringType // TYPE_ARGUMENT.CODE - nodePropertyDescriptors(959) = FormalQtyType.QtyOne - nodePropertyDescriptors(1046) = FormalQtyType.IntType // TYPE_ARGUMENT.COLUMN_NUMBER - nodePropertyDescriptors(1047) = FormalQtyType.QtyOption - nodePropertyDescriptors(3246) = FormalQtyType.IntType // TYPE_ARGUMENT.LINE_NUMBER - nodePropertyDescriptors(3247) = FormalQtyType.QtyOption - nodePropertyDescriptors(3862) = FormalQtyType.IntType // TYPE_ARGUMENT.OFFSET - nodePropertyDescriptors(3863) = FormalQtyType.QtyOption - nodePropertyDescriptors(3950) = FormalQtyType.IntType // TYPE_ARGUMENT.OFFSET_END - nodePropertyDescriptors(3951) = FormalQtyType.QtyOption - nodePropertyDescriptors(4038) = FormalQtyType.IntType // TYPE_ARGUMENT.ORDER - nodePropertyDescriptors(4039) = FormalQtyType.QtyOne - nodePropertyDescriptors(80) = FormalQtyType.StringType // TYPE_DECL.ALIAS_TYPE_FULL_NAME - nodePropertyDescriptors(81) = FormalQtyType.QtyOption - nodePropertyDescriptors(344) = FormalQtyType.StringType // TYPE_DECL.AST_PARENT_FULL_NAME - nodePropertyDescriptors(345) = FormalQtyType.QtyOne - nodePropertyDescriptors(432) = FormalQtyType.StringType // TYPE_DECL.AST_PARENT_TYPE - nodePropertyDescriptors(433) = FormalQtyType.QtyOne - nodePropertyDescriptors(960) = FormalQtyType.StringType // TYPE_DECL.CODE - nodePropertyDescriptors(961) = FormalQtyType.QtyOne - nodePropertyDescriptors(1048) = FormalQtyType.IntType // TYPE_DECL.COLUMN_NUMBER - nodePropertyDescriptors(1049) = FormalQtyType.QtyOption - nodePropertyDescriptors(2016) = FormalQtyType.StringType // TYPE_DECL.FILENAME - nodePropertyDescriptors(2017) = FormalQtyType.QtyOne - nodePropertyDescriptors(2104) = FormalQtyType.StringType // TYPE_DECL.FULL_NAME - nodePropertyDescriptors(2105) = FormalQtyType.QtyOne - nodePropertyDescriptors(2192) = FormalQtyType.StringType // TYPE_DECL.GENERIC_SIGNATURE - nodePropertyDescriptors(2193) = FormalQtyType.QtyOne - nodePropertyDescriptors(2632) = FormalQtyType.StringType // TYPE_DECL.INHERITS_FROM_TYPE_FULL_NAME - nodePropertyDescriptors(2633) = FormalQtyType.QtyMulti - nodePropertyDescriptors(2808) = FormalQtyType.BoolType // TYPE_DECL.IS_EXTERNAL - nodePropertyDescriptors(2809) = FormalQtyType.QtyOne - nodePropertyDescriptors(3248) = FormalQtyType.IntType // TYPE_DECL.LINE_NUMBER - nodePropertyDescriptors(3249) = FormalQtyType.QtyOption - nodePropertyDescriptors(3688) = FormalQtyType.StringType // TYPE_DECL.NAME - nodePropertyDescriptors(3689) = FormalQtyType.QtyOne - nodePropertyDescriptors(3864) = FormalQtyType.IntType // TYPE_DECL.OFFSET - nodePropertyDescriptors(3865) = FormalQtyType.QtyOption - nodePropertyDescriptors(3952) = FormalQtyType.IntType // TYPE_DECL.OFFSET_END - nodePropertyDescriptors(3953) = FormalQtyType.QtyOption - nodePropertyDescriptors(4040) = FormalQtyType.IntType // TYPE_DECL.ORDER - nodePropertyDescriptors(4041) = FormalQtyType.QtyOne - nodePropertyDescriptors(962) = FormalQtyType.StringType // TYPE_PARAMETER.CODE - nodePropertyDescriptors(963) = FormalQtyType.QtyOne - nodePropertyDescriptors(1050) = FormalQtyType.IntType // TYPE_PARAMETER.COLUMN_NUMBER - nodePropertyDescriptors(1051) = FormalQtyType.QtyOption - nodePropertyDescriptors(3250) = FormalQtyType.IntType // TYPE_PARAMETER.LINE_NUMBER - nodePropertyDescriptors(3251) = FormalQtyType.QtyOption - nodePropertyDescriptors(3690) = FormalQtyType.StringType // TYPE_PARAMETER.NAME - nodePropertyDescriptors(3691) = FormalQtyType.QtyOne - nodePropertyDescriptors(3866) = FormalQtyType.IntType // TYPE_PARAMETER.OFFSET - nodePropertyDescriptors(3867) = FormalQtyType.QtyOption - nodePropertyDescriptors(3954) = FormalQtyType.IntType // TYPE_PARAMETER.OFFSET_END - nodePropertyDescriptors(3955) = FormalQtyType.QtyOption - nodePropertyDescriptors(4042) = FormalQtyType.IntType // TYPE_PARAMETER.ORDER - nodePropertyDescriptors(4043) = FormalQtyType.QtyOne - nodePropertyDescriptors(172) = FormalQtyType.IntType // TYPE_REF.ARGUMENT_INDEX - nodePropertyDescriptors(173) = FormalQtyType.QtyOne - nodePropertyDescriptors(260) = FormalQtyType.StringType // TYPE_REF.ARGUMENT_NAME - nodePropertyDescriptors(261) = FormalQtyType.QtyOption - nodePropertyDescriptors(964) = FormalQtyType.StringType // TYPE_REF.CODE - nodePropertyDescriptors(965) = FormalQtyType.QtyOne - nodePropertyDescriptors(1052) = FormalQtyType.IntType // TYPE_REF.COLUMN_NUMBER - nodePropertyDescriptors(1053) = FormalQtyType.QtyOption - nodePropertyDescriptors(1668) = FormalQtyType.StringType // TYPE_REF.DYNAMIC_TYPE_HINT_FULL_NAME - nodePropertyDescriptors(1669) = FormalQtyType.QtyMulti - nodePropertyDescriptors(3252) = FormalQtyType.IntType // TYPE_REF.LINE_NUMBER - nodePropertyDescriptors(3253) = FormalQtyType.QtyOption - nodePropertyDescriptors(3868) = FormalQtyType.IntType // TYPE_REF.OFFSET - nodePropertyDescriptors(3869) = FormalQtyType.QtyOption - nodePropertyDescriptors(3956) = FormalQtyType.IntType // TYPE_REF.OFFSET_END - nodePropertyDescriptors(3957) = FormalQtyType.QtyOption - nodePropertyDescriptors(4044) = FormalQtyType.IntType // TYPE_REF.ORDER - nodePropertyDescriptors(4045) = FormalQtyType.QtyOne - nodePropertyDescriptors(4396) = FormalQtyType.StringType // TYPE_REF.POSSIBLE_TYPES - nodePropertyDescriptors(4397) = FormalQtyType.QtyMulti - nodePropertyDescriptors(4836) = FormalQtyType.StringType // TYPE_REF.TYPE_FULL_NAME - nodePropertyDescriptors(4837) = FormalQtyType.QtyOne - nodePropertyDescriptors(174) = FormalQtyType.IntType // UNKNOWN.ARGUMENT_INDEX - nodePropertyDescriptors(175) = FormalQtyType.QtyOne - nodePropertyDescriptors(262) = FormalQtyType.StringType // UNKNOWN.ARGUMENT_NAME - nodePropertyDescriptors(263) = FormalQtyType.QtyOption - nodePropertyDescriptors(966) = FormalQtyType.StringType // UNKNOWN.CODE - nodePropertyDescriptors(967) = FormalQtyType.QtyOne - nodePropertyDescriptors(1054) = FormalQtyType.IntType // UNKNOWN.COLUMN_NUMBER - nodePropertyDescriptors(1055) = FormalQtyType.QtyOption - nodePropertyDescriptors(1230) = FormalQtyType.StringType // UNKNOWN.CONTAINED_REF - nodePropertyDescriptors(1231) = FormalQtyType.QtyOne - nodePropertyDescriptors(1670) = FormalQtyType.StringType // UNKNOWN.DYNAMIC_TYPE_HINT_FULL_NAME - nodePropertyDescriptors(1671) = FormalQtyType.QtyMulti - nodePropertyDescriptors(3254) = FormalQtyType.IntType // UNKNOWN.LINE_NUMBER - nodePropertyDescriptors(3255) = FormalQtyType.QtyOption - nodePropertyDescriptors(3870) = FormalQtyType.IntType // UNKNOWN.OFFSET - nodePropertyDescriptors(3871) = FormalQtyType.QtyOption - nodePropertyDescriptors(3958) = FormalQtyType.IntType // UNKNOWN.OFFSET_END - nodePropertyDescriptors(3959) = FormalQtyType.QtyOption - nodePropertyDescriptors(4046) = FormalQtyType.IntType // UNKNOWN.ORDER - nodePropertyDescriptors(4047) = FormalQtyType.QtyOne - nodePropertyDescriptors(4310) = FormalQtyType.StringType // UNKNOWN.PARSER_TYPE_NAME - nodePropertyDescriptors(4311) = FormalQtyType.QtyOne - nodePropertyDescriptors(4398) = FormalQtyType.StringType // UNKNOWN.POSSIBLE_TYPES - nodePropertyDescriptors(4399) = FormalQtyType.QtyMulti - nodePropertyDescriptors(4838) = FormalQtyType.StringType // UNKNOWN.TYPE_FULL_NAME - nodePropertyDescriptors(4839) = FormalQtyType.QtyOne + nodePropertyDescriptors(760) = FormalQtyType.StringType // TEMPLATE_DOM.CODE + nodePropertyDescriptors(761) = FormalQtyType.QtyOne + nodePropertyDescriptors(846) = FormalQtyType.IntType // TEMPLATE_DOM.COLUMN_NUMBER + nodePropertyDescriptors(847) = FormalQtyType.QtyOption + nodePropertyDescriptors(2996) = FormalQtyType.IntType // TEMPLATE_DOM.LINE_NUMBER + nodePropertyDescriptors(2997) = FormalQtyType.QtyOption + nodePropertyDescriptors(3340) = FormalQtyType.StringType // TEMPLATE_DOM.NAME + nodePropertyDescriptors(3341) = FormalQtyType.QtyOne + nodePropertyDescriptors(3426) = FormalQtyType.IntType // TEMPLATE_DOM.OFFSET + nodePropertyDescriptors(3427) = FormalQtyType.QtyOption + nodePropertyDescriptors(3512) = FormalQtyType.IntType // TEMPLATE_DOM.OFFSET_END + nodePropertyDescriptors(3513) = FormalQtyType.QtyOption + nodePropertyDescriptors(3598) = FormalQtyType.IntType // TEMPLATE_DOM.ORDER + nodePropertyDescriptors(3599) = FormalQtyType.QtyOne + nodePropertyDescriptors(1880) = FormalQtyType.StringType // TYPE.FULL_NAME + nodePropertyDescriptors(1881) = FormalQtyType.QtyOne + nodePropertyDescriptors(3342) = FormalQtyType.StringType // TYPE.NAME + nodePropertyDescriptors(3343) = FormalQtyType.QtyOne + nodePropertyDescriptors(4116) = FormalQtyType.StringType // TYPE.TYPE_DECL_FULL_NAME + nodePropertyDescriptors(4117) = FormalQtyType.QtyOne + nodePropertyDescriptors(764) = FormalQtyType.StringType // TYPE_ARGUMENT.CODE + nodePropertyDescriptors(765) = FormalQtyType.QtyOne + nodePropertyDescriptors(850) = FormalQtyType.IntType // TYPE_ARGUMENT.COLUMN_NUMBER + nodePropertyDescriptors(851) = FormalQtyType.QtyOption + nodePropertyDescriptors(3000) = FormalQtyType.IntType // TYPE_ARGUMENT.LINE_NUMBER + nodePropertyDescriptors(3001) = FormalQtyType.QtyOption + nodePropertyDescriptors(3430) = FormalQtyType.IntType // TYPE_ARGUMENT.OFFSET + nodePropertyDescriptors(3431) = FormalQtyType.QtyOption + nodePropertyDescriptors(3516) = FormalQtyType.IntType // TYPE_ARGUMENT.OFFSET_END + nodePropertyDescriptors(3517) = FormalQtyType.QtyOption + nodePropertyDescriptors(3602) = FormalQtyType.IntType // TYPE_ARGUMENT.ORDER + nodePropertyDescriptors(3603) = FormalQtyType.QtyOne + nodePropertyDescriptors(78) = FormalQtyType.StringType // TYPE_DECL.ALIAS_TYPE_FULL_NAME + nodePropertyDescriptors(79) = FormalQtyType.QtyOption + nodePropertyDescriptors(336) = FormalQtyType.StringType // TYPE_DECL.AST_PARENT_FULL_NAME + nodePropertyDescriptors(337) = FormalQtyType.QtyOne + nodePropertyDescriptors(422) = FormalQtyType.StringType // TYPE_DECL.AST_PARENT_TYPE + nodePropertyDescriptors(423) = FormalQtyType.QtyOne + nodePropertyDescriptors(766) = FormalQtyType.StringType // TYPE_DECL.CODE + nodePropertyDescriptors(767) = FormalQtyType.QtyOne + nodePropertyDescriptors(852) = FormalQtyType.IntType // TYPE_DECL.COLUMN_NUMBER + nodePropertyDescriptors(853) = FormalQtyType.QtyOption + nodePropertyDescriptors(1798) = FormalQtyType.StringType // TYPE_DECL.FILENAME + nodePropertyDescriptors(1799) = FormalQtyType.QtyOne + nodePropertyDescriptors(1884) = FormalQtyType.StringType // TYPE_DECL.FULL_NAME + nodePropertyDescriptors(1885) = FormalQtyType.QtyOne + nodePropertyDescriptors(1970) = FormalQtyType.StringType // TYPE_DECL.GENERIC_SIGNATURE + nodePropertyDescriptors(1971) = FormalQtyType.QtyOne + nodePropertyDescriptors(2400) = FormalQtyType.StringType // TYPE_DECL.INHERITS_FROM_TYPE_FULL_NAME + nodePropertyDescriptors(2401) = FormalQtyType.QtyMulti + nodePropertyDescriptors(2572) = FormalQtyType.BoolType // TYPE_DECL.IS_EXTERNAL + nodePropertyDescriptors(2573) = FormalQtyType.QtyOne + nodePropertyDescriptors(3002) = FormalQtyType.IntType // TYPE_DECL.LINE_NUMBER + nodePropertyDescriptors(3003) = FormalQtyType.QtyOption + nodePropertyDescriptors(3346) = FormalQtyType.StringType // TYPE_DECL.NAME + nodePropertyDescriptors(3347) = FormalQtyType.QtyOne + nodePropertyDescriptors(3432) = FormalQtyType.IntType // TYPE_DECL.OFFSET + nodePropertyDescriptors(3433) = FormalQtyType.QtyOption + nodePropertyDescriptors(3518) = FormalQtyType.IntType // TYPE_DECL.OFFSET_END + nodePropertyDescriptors(3519) = FormalQtyType.QtyOption + nodePropertyDescriptors(3604) = FormalQtyType.IntType // TYPE_DECL.ORDER + nodePropertyDescriptors(3605) = FormalQtyType.QtyOne + nodePropertyDescriptors(768) = FormalQtyType.StringType // TYPE_PARAMETER.CODE + nodePropertyDescriptors(769) = FormalQtyType.QtyOne + nodePropertyDescriptors(854) = FormalQtyType.IntType // TYPE_PARAMETER.COLUMN_NUMBER + nodePropertyDescriptors(855) = FormalQtyType.QtyOption + nodePropertyDescriptors(3004) = FormalQtyType.IntType // TYPE_PARAMETER.LINE_NUMBER + nodePropertyDescriptors(3005) = FormalQtyType.QtyOption + nodePropertyDescriptors(3348) = FormalQtyType.StringType // TYPE_PARAMETER.NAME + nodePropertyDescriptors(3349) = FormalQtyType.QtyOne + nodePropertyDescriptors(3434) = FormalQtyType.IntType // TYPE_PARAMETER.OFFSET + nodePropertyDescriptors(3435) = FormalQtyType.QtyOption + nodePropertyDescriptors(3520) = FormalQtyType.IntType // TYPE_PARAMETER.OFFSET_END + nodePropertyDescriptors(3521) = FormalQtyType.QtyOption + nodePropertyDescriptors(3606) = FormalQtyType.IntType // TYPE_PARAMETER.ORDER + nodePropertyDescriptors(3607) = FormalQtyType.QtyOne + nodePropertyDescriptors(168) = FormalQtyType.IntType // TYPE_REF.ARGUMENT_INDEX + nodePropertyDescriptors(169) = FormalQtyType.QtyOne + nodePropertyDescriptors(254) = FormalQtyType.StringType // TYPE_REF.ARGUMENT_NAME + nodePropertyDescriptors(255) = FormalQtyType.QtyOption + nodePropertyDescriptors(770) = FormalQtyType.StringType // TYPE_REF.CODE + nodePropertyDescriptors(771) = FormalQtyType.QtyOne + nodePropertyDescriptors(856) = FormalQtyType.IntType // TYPE_REF.COLUMN_NUMBER + nodePropertyDescriptors(857) = FormalQtyType.QtyOption + nodePropertyDescriptors(1458) = FormalQtyType.StringType // TYPE_REF.DYNAMIC_TYPE_HINT_FULL_NAME + nodePropertyDescriptors(1459) = FormalQtyType.QtyMulti + nodePropertyDescriptors(3006) = FormalQtyType.IntType // TYPE_REF.LINE_NUMBER + nodePropertyDescriptors(3007) = FormalQtyType.QtyOption + nodePropertyDescriptors(3436) = FormalQtyType.IntType // TYPE_REF.OFFSET + nodePropertyDescriptors(3437) = FormalQtyType.QtyOption + nodePropertyDescriptors(3522) = FormalQtyType.IntType // TYPE_REF.OFFSET_END + nodePropertyDescriptors(3523) = FormalQtyType.QtyOption + nodePropertyDescriptors(3608) = FormalQtyType.IntType // TYPE_REF.ORDER + nodePropertyDescriptors(3609) = FormalQtyType.QtyOne + nodePropertyDescriptors(3866) = FormalQtyType.StringType // TYPE_REF.POSSIBLE_TYPES + nodePropertyDescriptors(3867) = FormalQtyType.QtyMulti + nodePropertyDescriptors(4210) = FormalQtyType.StringType // TYPE_REF.TYPE_FULL_NAME + nodePropertyDescriptors(4211) = FormalQtyType.QtyOne + nodePropertyDescriptors(170) = FormalQtyType.IntType // UNKNOWN.ARGUMENT_INDEX + nodePropertyDescriptors(171) = FormalQtyType.QtyOne + nodePropertyDescriptors(256) = FormalQtyType.StringType // UNKNOWN.ARGUMENT_NAME + nodePropertyDescriptors(257) = FormalQtyType.QtyOption + nodePropertyDescriptors(772) = FormalQtyType.StringType // UNKNOWN.CODE + nodePropertyDescriptors(773) = FormalQtyType.QtyOne + nodePropertyDescriptors(858) = FormalQtyType.IntType // UNKNOWN.COLUMN_NUMBER + nodePropertyDescriptors(859) = FormalQtyType.QtyOption + nodePropertyDescriptors(1030) = FormalQtyType.StringType // UNKNOWN.CONTAINED_REF + nodePropertyDescriptors(1031) = FormalQtyType.QtyOne + nodePropertyDescriptors(1460) = FormalQtyType.StringType // UNKNOWN.DYNAMIC_TYPE_HINT_FULL_NAME + nodePropertyDescriptors(1461) = FormalQtyType.QtyMulti + nodePropertyDescriptors(3008) = FormalQtyType.IntType // UNKNOWN.LINE_NUMBER + nodePropertyDescriptors(3009) = FormalQtyType.QtyOption + nodePropertyDescriptors(3438) = FormalQtyType.IntType // UNKNOWN.OFFSET + nodePropertyDescriptors(3439) = FormalQtyType.QtyOption + nodePropertyDescriptors(3524) = FormalQtyType.IntType // UNKNOWN.OFFSET_END + nodePropertyDescriptors(3525) = FormalQtyType.QtyOption + nodePropertyDescriptors(3610) = FormalQtyType.IntType // UNKNOWN.ORDER + nodePropertyDescriptors(3611) = FormalQtyType.QtyOne + nodePropertyDescriptors(3782) = FormalQtyType.StringType // UNKNOWN.PARSER_TYPE_NAME + nodePropertyDescriptors(3783) = FormalQtyType.QtyOne + nodePropertyDescriptors(3868) = FormalQtyType.StringType // UNKNOWN.POSSIBLE_TYPES + nodePropertyDescriptors(3869) = FormalQtyType.QtyMulti + nodePropertyDescriptors(4212) = FormalQtyType.StringType // UNKNOWN.TYPE_FULL_NAME + nodePropertyDescriptors(4213) = FormalQtyType.QtyOne nodePropertyDescriptors } private val newNodeInsertionHelpers: Array[flatgraph.NewNodePropertyInsertionHelper] = { - val _newNodeInserters = new Array[flatgraph.NewNodePropertyInsertionHelper](5368) - _newNodeInserters(88) = nodes.NewAnnotation.InsertionHelpers.NewNodeInserter_Annotation_argumentIndex - _newNodeInserters(176) = nodes.NewAnnotation.InsertionHelpers.NewNodeInserter_Annotation_argumentName - _newNodeInserters(880) = nodes.NewAnnotation.InsertionHelpers.NewNodeInserter_Annotation_code - _newNodeInserters(968) = nodes.NewAnnotation.InsertionHelpers.NewNodeInserter_Annotation_columnNumber - _newNodeInserters(2024) = nodes.NewAnnotation.InsertionHelpers.NewNodeInserter_Annotation_fullName - _newNodeInserters(3168) = nodes.NewAnnotation.InsertionHelpers.NewNodeInserter_Annotation_lineNumber - _newNodeInserters(3608) = nodes.NewAnnotation.InsertionHelpers.NewNodeInserter_Annotation_name - _newNodeInserters(3784) = nodes.NewAnnotation.InsertionHelpers.NewNodeInserter_Annotation_offset - _newNodeInserters(3872) = nodes.NewAnnotation.InsertionHelpers.NewNodeInserter_Annotation_offsetEnd - _newNodeInserters(3960) = nodes.NewAnnotation.InsertionHelpers.NewNodeInserter_Annotation_order - _newNodeInserters(90) = nodes.NewAnnotationLiteral.InsertionHelpers.NewNodeInserter_AnnotationLiteral_argumentIndex - _newNodeInserters(178) = nodes.NewAnnotationLiteral.InsertionHelpers.NewNodeInserter_AnnotationLiteral_argumentName - _newNodeInserters(882) = nodes.NewAnnotationLiteral.InsertionHelpers.NewNodeInserter_AnnotationLiteral_code - _newNodeInserters(970) = nodes.NewAnnotationLiteral.InsertionHelpers.NewNodeInserter_AnnotationLiteral_columnNumber - _newNodeInserters(3170) = nodes.NewAnnotationLiteral.InsertionHelpers.NewNodeInserter_AnnotationLiteral_lineNumber - _newNodeInserters(3610) = nodes.NewAnnotationLiteral.InsertionHelpers.NewNodeInserter_AnnotationLiteral_name - _newNodeInserters(3786) = nodes.NewAnnotationLiteral.InsertionHelpers.NewNodeInserter_AnnotationLiteral_offset - _newNodeInserters(3874) = nodes.NewAnnotationLiteral.InsertionHelpers.NewNodeInserter_AnnotationLiteral_offsetEnd - _newNodeInserters(3962) = nodes.NewAnnotationLiteral.InsertionHelpers.NewNodeInserter_AnnotationLiteral_order - _newNodeInserters(884) = nodes.NewAnnotationParameter.InsertionHelpers.NewNodeInserter_AnnotationParameter_code - _newNodeInserters(972) = + val _newNodeInserters = new Array[flatgraph.NewNodePropertyInsertionHelper](4730) + _newNodeInserters(86) = nodes.NewAnnotation.InsertionHelpers.NewNodeInserter_Annotation_argumentIndex + _newNodeInserters(172) = nodes.NewAnnotation.InsertionHelpers.NewNodeInserter_Annotation_argumentName + _newNodeInserters(688) = nodes.NewAnnotation.InsertionHelpers.NewNodeInserter_Annotation_code + _newNodeInserters(774) = nodes.NewAnnotation.InsertionHelpers.NewNodeInserter_Annotation_columnNumber + _newNodeInserters(1806) = nodes.NewAnnotation.InsertionHelpers.NewNodeInserter_Annotation_fullName + _newNodeInserters(2924) = nodes.NewAnnotation.InsertionHelpers.NewNodeInserter_Annotation_lineNumber + _newNodeInserters(3268) = nodes.NewAnnotation.InsertionHelpers.NewNodeInserter_Annotation_name + _newNodeInserters(3354) = nodes.NewAnnotation.InsertionHelpers.NewNodeInserter_Annotation_offset + _newNodeInserters(3440) = nodes.NewAnnotation.InsertionHelpers.NewNodeInserter_Annotation_offsetEnd + _newNodeInserters(3526) = nodes.NewAnnotation.InsertionHelpers.NewNodeInserter_Annotation_order + _newNodeInserters(88) = nodes.NewAnnotationLiteral.InsertionHelpers.NewNodeInserter_AnnotationLiteral_argumentIndex + _newNodeInserters(174) = nodes.NewAnnotationLiteral.InsertionHelpers.NewNodeInserter_AnnotationLiteral_argumentName + _newNodeInserters(690) = nodes.NewAnnotationLiteral.InsertionHelpers.NewNodeInserter_AnnotationLiteral_code + _newNodeInserters(776) = nodes.NewAnnotationLiteral.InsertionHelpers.NewNodeInserter_AnnotationLiteral_columnNumber + _newNodeInserters(2926) = nodes.NewAnnotationLiteral.InsertionHelpers.NewNodeInserter_AnnotationLiteral_lineNumber + _newNodeInserters(3270) = nodes.NewAnnotationLiteral.InsertionHelpers.NewNodeInserter_AnnotationLiteral_name + _newNodeInserters(3356) = nodes.NewAnnotationLiteral.InsertionHelpers.NewNodeInserter_AnnotationLiteral_offset + _newNodeInserters(3442) = nodes.NewAnnotationLiteral.InsertionHelpers.NewNodeInserter_AnnotationLiteral_offsetEnd + _newNodeInserters(3528) = nodes.NewAnnotationLiteral.InsertionHelpers.NewNodeInserter_AnnotationLiteral_order + _newNodeInserters(692) = nodes.NewAnnotationParameter.InsertionHelpers.NewNodeInserter_AnnotationParameter_code + _newNodeInserters(778) = nodes.NewAnnotationParameter.InsertionHelpers.NewNodeInserter_AnnotationParameter_columnNumber - _newNodeInserters(3172) = + _newNodeInserters(2928) = nodes.NewAnnotationParameter.InsertionHelpers.NewNodeInserter_AnnotationParameter_lineNumber - _newNodeInserters(3788) = nodes.NewAnnotationParameter.InsertionHelpers.NewNodeInserter_AnnotationParameter_offset - _newNodeInserters(3876) = + _newNodeInserters(3358) = nodes.NewAnnotationParameter.InsertionHelpers.NewNodeInserter_AnnotationParameter_offset + _newNodeInserters(3444) = nodes.NewAnnotationParameter.InsertionHelpers.NewNodeInserter_AnnotationParameter_offsetEnd - _newNodeInserters(3964) = nodes.NewAnnotationParameter.InsertionHelpers.NewNodeInserter_AnnotationParameter_order - _newNodeInserters(886) = + _newNodeInserters(3530) = nodes.NewAnnotationParameter.InsertionHelpers.NewNodeInserter_AnnotationParameter_order + _newNodeInserters(694) = nodes.NewAnnotationParameterAssign.InsertionHelpers.NewNodeInserter_AnnotationParameterAssign_code - _newNodeInserters(974) = + _newNodeInserters(780) = nodes.NewAnnotationParameterAssign.InsertionHelpers.NewNodeInserter_AnnotationParameterAssign_columnNumber - _newNodeInserters(3174) = + _newNodeInserters(2930) = nodes.NewAnnotationParameterAssign.InsertionHelpers.NewNodeInserter_AnnotationParameterAssign_lineNumber - _newNodeInserters(3790) = + _newNodeInserters(3360) = nodes.NewAnnotationParameterAssign.InsertionHelpers.NewNodeInserter_AnnotationParameterAssign_offset - _newNodeInserters(3878) = + _newNodeInserters(3446) = nodes.NewAnnotationParameterAssign.InsertionHelpers.NewNodeInserter_AnnotationParameterAssign_offsetEnd - _newNodeInserters(3966) = + _newNodeInserters(3532) = nodes.NewAnnotationParameterAssign.InsertionHelpers.NewNodeInserter_AnnotationParameterAssign_order - _newNodeInserters(96) = nodes.NewArrayInitializer.InsertionHelpers.NewNodeInserter_ArrayInitializer_argumentIndex - _newNodeInserters(184) = nodes.NewArrayInitializer.InsertionHelpers.NewNodeInserter_ArrayInitializer_argumentName - _newNodeInserters(888) = nodes.NewArrayInitializer.InsertionHelpers.NewNodeInserter_ArrayInitializer_code - _newNodeInserters(976) = nodes.NewArrayInitializer.InsertionHelpers.NewNodeInserter_ArrayInitializer_columnNumber - _newNodeInserters(3176) = nodes.NewArrayInitializer.InsertionHelpers.NewNodeInserter_ArrayInitializer_lineNumber - _newNodeInserters(3792) = nodes.NewArrayInitializer.InsertionHelpers.NewNodeInserter_ArrayInitializer_offset - _newNodeInserters(3880) = nodes.NewArrayInitializer.InsertionHelpers.NewNodeInserter_ArrayInitializer_offsetEnd - _newNodeInserters(3968) = nodes.NewArrayInitializer.InsertionHelpers.NewNodeInserter_ArrayInitializer_order - _newNodeInserters(3354) = nodes.NewBinding.InsertionHelpers.NewNodeInserter_Binding_methodFullName - _newNodeInserters(3618) = nodes.NewBinding.InsertionHelpers.NewNodeInserter_Binding_name - _newNodeInserters(4498) = nodes.NewBinding.InsertionHelpers.NewNodeInserter_Binding_signature - _newNodeInserters(100) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_argumentIndex - _newNodeInserters(188) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_argumentName - _newNodeInserters(892) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_code - _newNodeInserters(980) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_columnNumber - _newNodeInserters(1596) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_dynamicTypeHintFullName - _newNodeInserters(3180) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_lineNumber - _newNodeInserters(3796) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_offset - _newNodeInserters(3884) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_offsetEnd - _newNodeInserters(3972) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_order - _newNodeInserters(4324) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_possibleTypes - _newNodeInserters(4764) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_typeFullName - _newNodeInserters(102) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_argumentIndex - _newNodeInserters(190) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_argumentName - _newNodeInserters(894) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_code - _newNodeInserters(982) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_columnNumber - _newNodeInserters(1510) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_dispatchType - _newNodeInserters(1598) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_dynamicTypeHintFullName - _newNodeInserters(3182) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_lineNumber - _newNodeInserters(3358) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_methodFullName - _newNodeInserters(3622) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_name - _newNodeInserters(3798) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_offset - _newNodeInserters(3886) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_offsetEnd - _newNodeInserters(3974) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_order - _newNodeInserters(4326) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_possibleTypes - _newNodeInserters(4502) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_signature - _newNodeInserters(4766) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_typeFullName - _newNodeInserters(720) = nodes.NewClosureBinding.InsertionHelpers.NewNodeInserter_ClosureBinding_closureBindingId - _newNodeInserters(808) = nodes.NewClosureBinding.InsertionHelpers.NewNodeInserter_ClosureBinding_closureOriginalName - _newNodeInserters(1688) = nodes.NewClosureBinding.InsertionHelpers.NewNodeInserter_ClosureBinding_evaluationStrategy - _newNodeInserters(898) = nodes.NewComment.InsertionHelpers.NewNodeInserter_Comment_code - _newNodeInserters(986) = nodes.NewComment.InsertionHelpers.NewNodeInserter_Comment_columnNumber - _newNodeInserters(1954) = nodes.NewComment.InsertionHelpers.NewNodeInserter_Comment_filename - _newNodeInserters(3186) = nodes.NewComment.InsertionHelpers.NewNodeInserter_Comment_lineNumber - _newNodeInserters(3802) = nodes.NewComment.InsertionHelpers.NewNodeInserter_Comment_offset - _newNodeInserters(3890) = nodes.NewComment.InsertionHelpers.NewNodeInserter_Comment_offsetEnd - _newNodeInserters(3978) = nodes.NewComment.InsertionHelpers.NewNodeInserter_Comment_order - _newNodeInserters(1252) = nodes.NewConfigFile.InsertionHelpers.NewNodeInserter_ConfigFile_content - _newNodeInserters(3628) = nodes.NewConfigFile.InsertionHelpers.NewNodeInserter_ConfigFile_name - _newNodeInserters(110) = nodes.NewControlStructure.InsertionHelpers.NewNodeInserter_ControlStructure_argumentIndex - _newNodeInserters(198) = nodes.NewControlStructure.InsertionHelpers.NewNodeInserter_ControlStructure_argumentName - _newNodeInserters(902) = nodes.NewControlStructure.InsertionHelpers.NewNodeInserter_ControlStructure_code - _newNodeInserters(990) = nodes.NewControlStructure.InsertionHelpers.NewNodeInserter_ControlStructure_columnNumber - _newNodeInserters(1342) = + _newNodeInserters(94) = nodes.NewArrayInitializer.InsertionHelpers.NewNodeInserter_ArrayInitializer_argumentIndex + _newNodeInserters(180) = nodes.NewArrayInitializer.InsertionHelpers.NewNodeInserter_ArrayInitializer_argumentName + _newNodeInserters(696) = nodes.NewArrayInitializer.InsertionHelpers.NewNodeInserter_ArrayInitializer_code + _newNodeInserters(782) = nodes.NewArrayInitializer.InsertionHelpers.NewNodeInserter_ArrayInitializer_columnNumber + _newNodeInserters(2932) = nodes.NewArrayInitializer.InsertionHelpers.NewNodeInserter_ArrayInitializer_lineNumber + _newNodeInserters(3362) = nodes.NewArrayInitializer.InsertionHelpers.NewNodeInserter_ArrayInitializer_offset + _newNodeInserters(3448) = nodes.NewArrayInitializer.InsertionHelpers.NewNodeInserter_ArrayInitializer_offsetEnd + _newNodeInserters(3534) = nodes.NewArrayInitializer.InsertionHelpers.NewNodeInserter_ArrayInitializer_order + _newNodeInserters(3106) = nodes.NewBinding.InsertionHelpers.NewNodeInserter_Binding_methodFullName + _newNodeInserters(3278) = nodes.NewBinding.InsertionHelpers.NewNodeInserter_Binding_name + _newNodeInserters(3966) = nodes.NewBinding.InsertionHelpers.NewNodeInserter_Binding_signature + _newNodeInserters(98) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_argumentIndex + _newNodeInserters(184) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_argumentName + _newNodeInserters(700) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_code + _newNodeInserters(786) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_columnNumber + _newNodeInserters(1388) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_dynamicTypeHintFullName + _newNodeInserters(2936) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_lineNumber + _newNodeInserters(3366) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_offset + _newNodeInserters(3452) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_offsetEnd + _newNodeInserters(3538) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_order + _newNodeInserters(3796) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_possibleTypes + _newNodeInserters(4140) = nodes.NewBlock.InsertionHelpers.NewNodeInserter_Block_typeFullName + _newNodeInserters(100) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_argumentIndex + _newNodeInserters(186) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_argumentName + _newNodeInserters(702) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_code + _newNodeInserters(788) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_columnNumber + _newNodeInserters(1304) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_dispatchType + _newNodeInserters(1390) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_dynamicTypeHintFullName + _newNodeInserters(2938) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_lineNumber + _newNodeInserters(3110) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_methodFullName + _newNodeInserters(3282) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_name + _newNodeInserters(3368) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_offset + _newNodeInserters(3454) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_offsetEnd + _newNodeInserters(3540) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_order + _newNodeInserters(3798) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_possibleTypes + _newNodeInserters(3970) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_signature + _newNodeInserters(4142) = nodes.NewCall.InsertionHelpers.NewNodeInserter_Call_typeFullName + _newNodeInserters(532) = nodes.NewClosureBinding.InsertionHelpers.NewNodeInserter_ClosureBinding_closureBindingId + _newNodeInserters(618) = nodes.NewClosureBinding.InsertionHelpers.NewNodeInserter_ClosureBinding_closureOriginalName + _newNodeInserters(1478) = nodes.NewClosureBinding.InsertionHelpers.NewNodeInserter_ClosureBinding_evaluationStrategy + _newNodeInserters(706) = nodes.NewComment.InsertionHelpers.NewNodeInserter_Comment_code + _newNodeInserters(792) = nodes.NewComment.InsertionHelpers.NewNodeInserter_Comment_columnNumber + _newNodeInserters(1738) = nodes.NewComment.InsertionHelpers.NewNodeInserter_Comment_filename + _newNodeInserters(2942) = nodes.NewComment.InsertionHelpers.NewNodeInserter_Comment_lineNumber + _newNodeInserters(3372) = nodes.NewComment.InsertionHelpers.NewNodeInserter_Comment_offset + _newNodeInserters(3458) = nodes.NewComment.InsertionHelpers.NewNodeInserter_Comment_offsetEnd + _newNodeInserters(3544) = nodes.NewComment.InsertionHelpers.NewNodeInserter_Comment_order + _newNodeInserters(1052) = nodes.NewConfigFile.InsertionHelpers.NewNodeInserter_ConfigFile_content + _newNodeInserters(3288) = nodes.NewConfigFile.InsertionHelpers.NewNodeInserter_ConfigFile_name + _newNodeInserters(108) = nodes.NewControlStructure.InsertionHelpers.NewNodeInserter_ControlStructure_argumentIndex + _newNodeInserters(194) = nodes.NewControlStructure.InsertionHelpers.NewNodeInserter_ControlStructure_argumentName + _newNodeInserters(710) = nodes.NewControlStructure.InsertionHelpers.NewNodeInserter_ControlStructure_code + _newNodeInserters(796) = nodes.NewControlStructure.InsertionHelpers.NewNodeInserter_ControlStructure_columnNumber + _newNodeInserters(1140) = nodes.NewControlStructure.InsertionHelpers.NewNodeInserter_ControlStructure_controlStructureType - _newNodeInserters(3190) = nodes.NewControlStructure.InsertionHelpers.NewNodeInserter_ControlStructure_lineNumber - _newNodeInserters(3806) = nodes.NewControlStructure.InsertionHelpers.NewNodeInserter_ControlStructure_offset - _newNodeInserters(3894) = nodes.NewControlStructure.InsertionHelpers.NewNodeInserter_ControlStructure_offsetEnd - _newNodeInserters(3982) = nodes.NewControlStructure.InsertionHelpers.NewNodeInserter_ControlStructure_order - _newNodeInserters(4246) = nodes.NewControlStructure.InsertionHelpers.NewNodeInserter_ControlStructure_parserTypeName - _newNodeInserters(1432) = nodes.NewDependency.InsertionHelpers.NewNodeInserter_Dependency_dependencyGroupId - _newNodeInserters(3632) = nodes.NewDependency.InsertionHelpers.NewNodeInserter_Dependency_name - _newNodeInserters(4952) = nodes.NewDependency.InsertionHelpers.NewNodeInserter_Dependency_version - _newNodeInserters(114) = nodes.NewFieldIdentifier.InsertionHelpers.NewNodeInserter_FieldIdentifier_argumentIndex - _newNodeInserters(202) = nodes.NewFieldIdentifier.InsertionHelpers.NewNodeInserter_FieldIdentifier_argumentName - _newNodeInserters(466) = nodes.NewFieldIdentifier.InsertionHelpers.NewNodeInserter_FieldIdentifier_canonicalName - _newNodeInserters(906) = nodes.NewFieldIdentifier.InsertionHelpers.NewNodeInserter_FieldIdentifier_code - _newNodeInserters(994) = nodes.NewFieldIdentifier.InsertionHelpers.NewNodeInserter_FieldIdentifier_columnNumber - _newNodeInserters(3194) = nodes.NewFieldIdentifier.InsertionHelpers.NewNodeInserter_FieldIdentifier_lineNumber - _newNodeInserters(3810) = nodes.NewFieldIdentifier.InsertionHelpers.NewNodeInserter_FieldIdentifier_offset - _newNodeInserters(3898) = nodes.NewFieldIdentifier.InsertionHelpers.NewNodeInserter_FieldIdentifier_offsetEnd - _newNodeInserters(3986) = nodes.NewFieldIdentifier.InsertionHelpers.NewNodeInserter_FieldIdentifier_order - _newNodeInserters(908) = nodes.NewFile.InsertionHelpers.NewNodeInserter_File_code - _newNodeInserters(996) = nodes.NewFile.InsertionHelpers.NewNodeInserter_File_columnNumber - _newNodeInserters(1260) = nodes.NewFile.InsertionHelpers.NewNodeInserter_File_content - _newNodeInserters(2228) = nodes.NewFile.InsertionHelpers.NewNodeInserter_File_hash - _newNodeInserters(3196) = nodes.NewFile.InsertionHelpers.NewNodeInserter_File_lineNumber - _newNodeInserters(3636) = nodes.NewFile.InsertionHelpers.NewNodeInserter_File_name - _newNodeInserters(3812) = nodes.NewFile.InsertionHelpers.NewNodeInserter_File_offset - _newNodeInserters(3900) = nodes.NewFile.InsertionHelpers.NewNodeInserter_File_offsetEnd - _newNodeInserters(3988) = nodes.NewFile.InsertionHelpers.NewNodeInserter_File_order - _newNodeInserters(1790) = nodes.NewFinding.InsertionHelpers.NewNodeInserter_Finding_evidenceDescription - _newNodeInserters(5046) = nodes.NewFinding.InsertionHelpers.NewNodeInserter_Finding_evidence - _newNodeInserters(5134) = nodes.NewFinding.InsertionHelpers.NewNodeInserter_Finding_keyValuePairs - _newNodeInserters(120) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_argumentIndex - _newNodeInserters(208) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_argumentName - _newNodeInserters(912) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_code - _newNodeInserters(1000) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_columnNumber - _newNodeInserters(1616) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_dynamicTypeHintFullName - _newNodeInserters(3200) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_lineNumber - _newNodeInserters(3640) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_name - _newNodeInserters(3816) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_offset - _newNodeInserters(3904) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_offsetEnd - _newNodeInserters(3992) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_order - _newNodeInserters(4344) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_possibleTypes - _newNodeInserters(4784) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_typeFullName - _newNodeInserters(914) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_code - _newNodeInserters(1002) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_columnNumber - _newNodeInserters(1882) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_explicitAs - _newNodeInserters(2322) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_importedAs - _newNodeInserters(2410) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_importedEntity - _newNodeInserters(2674) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_isExplicit - _newNodeInserters(2938) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_isWildcard - _newNodeInserters(3202) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_lineNumber - _newNodeInserters(3818) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_offset - _newNodeInserters(3906) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_offsetEnd - _newNodeInserters(3994) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_order - _newNodeInserters(916) = nodes.NewJumpLabel.InsertionHelpers.NewNodeInserter_JumpLabel_code - _newNodeInserters(1004) = nodes.NewJumpLabel.InsertionHelpers.NewNodeInserter_JumpLabel_columnNumber - _newNodeInserters(3204) = nodes.NewJumpLabel.InsertionHelpers.NewNodeInserter_JumpLabel_lineNumber - _newNodeInserters(3644) = nodes.NewJumpLabel.InsertionHelpers.NewNodeInserter_JumpLabel_name - _newNodeInserters(3820) = nodes.NewJumpLabel.InsertionHelpers.NewNodeInserter_JumpLabel_offset - _newNodeInserters(3908) = nodes.NewJumpLabel.InsertionHelpers.NewNodeInserter_JumpLabel_offsetEnd - _newNodeInserters(3996) = nodes.NewJumpLabel.InsertionHelpers.NewNodeInserter_JumpLabel_order - _newNodeInserters(4260) = nodes.NewJumpLabel.InsertionHelpers.NewNodeInserter_JumpLabel_parserTypeName - _newNodeInserters(126) = nodes.NewJumpTarget.InsertionHelpers.NewNodeInserter_JumpTarget_argumentIndex - _newNodeInserters(918) = nodes.NewJumpTarget.InsertionHelpers.NewNodeInserter_JumpTarget_code - _newNodeInserters(1006) = nodes.NewJumpTarget.InsertionHelpers.NewNodeInserter_JumpTarget_columnNumber - _newNodeInserters(3206) = nodes.NewJumpTarget.InsertionHelpers.NewNodeInserter_JumpTarget_lineNumber - _newNodeInserters(3646) = nodes.NewJumpTarget.InsertionHelpers.NewNodeInserter_JumpTarget_name - _newNodeInserters(3822) = nodes.NewJumpTarget.InsertionHelpers.NewNodeInserter_JumpTarget_offset - _newNodeInserters(3910) = nodes.NewJumpTarget.InsertionHelpers.NewNodeInserter_JumpTarget_offsetEnd - _newNodeInserters(3998) = nodes.NewJumpTarget.InsertionHelpers.NewNodeInserter_JumpTarget_order - _newNodeInserters(4262) = nodes.NewJumpTarget.InsertionHelpers.NewNodeInserter_JumpTarget_parserTypeName - _newNodeInserters(3032) = nodes.NewKeyValuePair.InsertionHelpers.NewNodeInserter_KeyValuePair_key - _newNodeInserters(4880) = nodes.NewKeyValuePair.InsertionHelpers.NewNodeInserter_KeyValuePair_value - _newNodeInserters(130) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_argumentIndex - _newNodeInserters(218) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_argumentName - _newNodeInserters(922) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_code - _newNodeInserters(1010) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_columnNumber - _newNodeInserters(1626) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_dynamicTypeHintFullName - _newNodeInserters(3210) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_lineNumber - _newNodeInserters(3826) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_offset - _newNodeInserters(3914) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_offsetEnd - _newNodeInserters(4002) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_order - _newNodeInserters(4354) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_possibleTypes - _newNodeInserters(4794) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_typeFullName - _newNodeInserters(748) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_closureBindingId - _newNodeInserters(924) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_code - _newNodeInserters(1012) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_columnNumber - _newNodeInserters(1628) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_dynamicTypeHintFullName - _newNodeInserters(2156) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_genericSignature - _newNodeInserters(3212) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_lineNumber - _newNodeInserters(3652) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_name - _newNodeInserters(3828) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_offset - _newNodeInserters(3916) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_offsetEnd - _newNodeInserters(4004) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_order - _newNodeInserters(4356) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_possibleTypes - _newNodeInserters(4796) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_typeFullName - _newNodeInserters(574) = nodes.NewLocation.InsertionHelpers.NewNodeInserter_Location_className - _newNodeInserters(662) = nodes.NewLocation.InsertionHelpers.NewNodeInserter_Location_classShortName - _newNodeInserters(1014) = nodes.NewLocation.InsertionHelpers.NewNodeInserter_Location_columnNumber - _newNodeInserters(1982) = nodes.NewLocation.InsertionHelpers.NewNodeInserter_Location_filename - _newNodeInserters(3214) = nodes.NewLocation.InsertionHelpers.NewNodeInserter_Location_lineNumber - _newNodeInserters(3390) = nodes.NewLocation.InsertionHelpers.NewNodeInserter_Location_methodFullName - _newNodeInserters(3478) = nodes.NewLocation.InsertionHelpers.NewNodeInserter_Location_methodShortName - _newNodeInserters(3742) = nodes.NewLocation.InsertionHelpers.NewNodeInserter_Location_nodeLabel - _newNodeInserters(4182) = nodes.NewLocation.InsertionHelpers.NewNodeInserter_Location_packageName - _newNodeInserters(4622) = nodes.NewLocation.InsertionHelpers.NewNodeInserter_Location_symbol - _newNodeInserters(5238) = nodes.NewLocation.InsertionHelpers.NewNodeInserter_Location_node - _newNodeInserters(312) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_astParentFullName - _newNodeInserters(400) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_astParentType - _newNodeInserters(928) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_code - _newNodeInserters(1016) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_columnNumber - _newNodeInserters(1632) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_dynamicTypeHintFullName - _newNodeInserters(2160) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_genericSignature - _newNodeInserters(3216) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_lineNumber - _newNodeInserters(3656) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_name - _newNodeInserters(3832) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_offset - _newNodeInserters(3920) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_offsetEnd - _newNodeInserters(4008) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_order - _newNodeInserters(4360) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_possibleTypes - _newNodeInserters(4800) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_typeFullName - _newNodeInserters(2250) = nodes.NewMetaData.InsertionHelpers.NewNodeInserter_MetaData_hash - _newNodeInserters(3130) = nodes.NewMetaData.InsertionHelpers.NewNodeInserter_MetaData_language - _newNodeInserters(4098) = nodes.NewMetaData.InsertionHelpers.NewNodeInserter_MetaData_overlays - _newNodeInserters(4450) = nodes.NewMetaData.InsertionHelpers.NewNodeInserter_MetaData_root - _newNodeInserters(4978) = nodes.NewMetaData.InsertionHelpers.NewNodeInserter_MetaData_version - _newNodeInserters(316) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_astParentFullName - _newNodeInserters(404) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_astParentType - _newNodeInserters(932) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_code - _newNodeInserters(1020) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_columnNumber - _newNodeInserters(1108) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_columnNumberEnd - _newNodeInserters(1988) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_filename - _newNodeInserters(2076) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_fullName - _newNodeInserters(2164) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_genericSignature - _newNodeInserters(2252) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_hash - _newNodeInserters(2780) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_isExternal - _newNodeInserters(3220) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_lineNumber - _newNodeInserters(3308) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_lineNumberEnd - _newNodeInserters(3660) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_name - _newNodeInserters(3836) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_offset - _newNodeInserters(3924) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_offsetEnd - _newNodeInserters(4012) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_order - _newNodeInserters(4540) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_signature - _newNodeInserters(758) = + _newNodeInserters(2946) = nodes.NewControlStructure.InsertionHelpers.NewNodeInserter_ControlStructure_lineNumber + _newNodeInserters(3376) = nodes.NewControlStructure.InsertionHelpers.NewNodeInserter_ControlStructure_offset + _newNodeInserters(3462) = nodes.NewControlStructure.InsertionHelpers.NewNodeInserter_ControlStructure_offsetEnd + _newNodeInserters(3548) = nodes.NewControlStructure.InsertionHelpers.NewNodeInserter_ControlStructure_order + _newNodeInserters(3720) = nodes.NewControlStructure.InsertionHelpers.NewNodeInserter_ControlStructure_parserTypeName + _newNodeInserters(1228) = nodes.NewDependency.InsertionHelpers.NewNodeInserter_Dependency_dependencyGroupId + _newNodeInserters(3292) = nodes.NewDependency.InsertionHelpers.NewNodeInserter_Dependency_name + _newNodeInserters(4324) = nodes.NewDependency.InsertionHelpers.NewNodeInserter_Dependency_version + _newNodeInserters(112) = nodes.NewFieldIdentifier.InsertionHelpers.NewNodeInserter_FieldIdentifier_argumentIndex + _newNodeInserters(198) = nodes.NewFieldIdentifier.InsertionHelpers.NewNodeInserter_FieldIdentifier_argumentName + _newNodeInserters(456) = nodes.NewFieldIdentifier.InsertionHelpers.NewNodeInserter_FieldIdentifier_canonicalName + _newNodeInserters(714) = nodes.NewFieldIdentifier.InsertionHelpers.NewNodeInserter_FieldIdentifier_code + _newNodeInserters(800) = nodes.NewFieldIdentifier.InsertionHelpers.NewNodeInserter_FieldIdentifier_columnNumber + _newNodeInserters(2950) = nodes.NewFieldIdentifier.InsertionHelpers.NewNodeInserter_FieldIdentifier_lineNumber + _newNodeInserters(3380) = nodes.NewFieldIdentifier.InsertionHelpers.NewNodeInserter_FieldIdentifier_offset + _newNodeInserters(3466) = nodes.NewFieldIdentifier.InsertionHelpers.NewNodeInserter_FieldIdentifier_offsetEnd + _newNodeInserters(3552) = nodes.NewFieldIdentifier.InsertionHelpers.NewNodeInserter_FieldIdentifier_order + _newNodeInserters(716) = nodes.NewFile.InsertionHelpers.NewNodeInserter_File_code + _newNodeInserters(802) = nodes.NewFile.InsertionHelpers.NewNodeInserter_File_columnNumber + _newNodeInserters(1060) = nodes.NewFile.InsertionHelpers.NewNodeInserter_File_content + _newNodeInserters(2006) = nodes.NewFile.InsertionHelpers.NewNodeInserter_File_hash + _newNodeInserters(2952) = nodes.NewFile.InsertionHelpers.NewNodeInserter_File_lineNumber + _newNodeInserters(3296) = nodes.NewFile.InsertionHelpers.NewNodeInserter_File_name + _newNodeInserters(3382) = nodes.NewFile.InsertionHelpers.NewNodeInserter_File_offset + _newNodeInserters(3468) = nodes.NewFile.InsertionHelpers.NewNodeInserter_File_offsetEnd + _newNodeInserters(3554) = nodes.NewFile.InsertionHelpers.NewNodeInserter_File_order + _newNodeInserters(1578) = nodes.NewFinding.InsertionHelpers.NewNodeInserter_Finding_evidenceDescription + _newNodeInserters(4416) = nodes.NewFinding.InsertionHelpers.NewNodeInserter_Finding_evidence + _newNodeInserters(4502) = nodes.NewFinding.InsertionHelpers.NewNodeInserter_Finding_keyValuePairs + _newNodeInserters(118) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_argumentIndex + _newNodeInserters(204) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_argumentName + _newNodeInserters(720) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_code + _newNodeInserters(806) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_columnNumber + _newNodeInserters(1408) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_dynamicTypeHintFullName + _newNodeInserters(2956) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_lineNumber + _newNodeInserters(3300) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_name + _newNodeInserters(3386) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_offset + _newNodeInserters(3472) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_offsetEnd + _newNodeInserters(3558) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_order + _newNodeInserters(3816) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_possibleTypes + _newNodeInserters(4160) = nodes.NewIdentifier.InsertionHelpers.NewNodeInserter_Identifier_typeFullName + _newNodeInserters(722) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_code + _newNodeInserters(808) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_columnNumber + _newNodeInserters(1668) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_explicitAs + _newNodeInserters(2098) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_importedAs + _newNodeInserters(2184) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_importedEntity + _newNodeInserters(2442) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_isExplicit + _newNodeInserters(2700) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_isWildcard + _newNodeInserters(2958) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_lineNumber + _newNodeInserters(3388) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_offset + _newNodeInserters(3474) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_offsetEnd + _newNodeInserters(3560) = nodes.NewImport.InsertionHelpers.NewNodeInserter_Import_order + _newNodeInserters(724) = nodes.NewJumpLabel.InsertionHelpers.NewNodeInserter_JumpLabel_code + _newNodeInserters(810) = nodes.NewJumpLabel.InsertionHelpers.NewNodeInserter_JumpLabel_columnNumber + _newNodeInserters(2960) = nodes.NewJumpLabel.InsertionHelpers.NewNodeInserter_JumpLabel_lineNumber + _newNodeInserters(3304) = nodes.NewJumpLabel.InsertionHelpers.NewNodeInserter_JumpLabel_name + _newNodeInserters(3390) = nodes.NewJumpLabel.InsertionHelpers.NewNodeInserter_JumpLabel_offset + _newNodeInserters(3476) = nodes.NewJumpLabel.InsertionHelpers.NewNodeInserter_JumpLabel_offsetEnd + _newNodeInserters(3562) = nodes.NewJumpLabel.InsertionHelpers.NewNodeInserter_JumpLabel_order + _newNodeInserters(3734) = nodes.NewJumpLabel.InsertionHelpers.NewNodeInserter_JumpLabel_parserTypeName + _newNodeInserters(124) = nodes.NewJumpTarget.InsertionHelpers.NewNodeInserter_JumpTarget_argumentIndex + _newNodeInserters(726) = nodes.NewJumpTarget.InsertionHelpers.NewNodeInserter_JumpTarget_code + _newNodeInserters(812) = nodes.NewJumpTarget.InsertionHelpers.NewNodeInserter_JumpTarget_columnNumber + _newNodeInserters(2962) = nodes.NewJumpTarget.InsertionHelpers.NewNodeInserter_JumpTarget_lineNumber + _newNodeInserters(3306) = nodes.NewJumpTarget.InsertionHelpers.NewNodeInserter_JumpTarget_name + _newNodeInserters(3392) = nodes.NewJumpTarget.InsertionHelpers.NewNodeInserter_JumpTarget_offset + _newNodeInserters(3478) = nodes.NewJumpTarget.InsertionHelpers.NewNodeInserter_JumpTarget_offsetEnd + _newNodeInserters(3564) = nodes.NewJumpTarget.InsertionHelpers.NewNodeInserter_JumpTarget_order + _newNodeInserters(3736) = nodes.NewJumpTarget.InsertionHelpers.NewNodeInserter_JumpTarget_parserTypeName + _newNodeInserters(2792) = nodes.NewKeyValuePair.InsertionHelpers.NewNodeInserter_KeyValuePair_key + _newNodeInserters(4254) = nodes.NewKeyValuePair.InsertionHelpers.NewNodeInserter_KeyValuePair_value + _newNodeInserters(128) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_argumentIndex + _newNodeInserters(214) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_argumentName + _newNodeInserters(730) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_code + _newNodeInserters(816) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_columnNumber + _newNodeInserters(1418) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_dynamicTypeHintFullName + _newNodeInserters(2966) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_lineNumber + _newNodeInserters(3396) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_offset + _newNodeInserters(3482) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_offsetEnd + _newNodeInserters(3568) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_order + _newNodeInserters(3826) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_possibleTypes + _newNodeInserters(4170) = nodes.NewLiteral.InsertionHelpers.NewNodeInserter_Literal_typeFullName + _newNodeInserters(560) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_closureBindingId + _newNodeInserters(732) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_code + _newNodeInserters(818) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_columnNumber + _newNodeInserters(1420) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_dynamicTypeHintFullName + _newNodeInserters(1936) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_genericSignature + _newNodeInserters(2968) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_lineNumber + _newNodeInserters(3312) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_name + _newNodeInserters(3398) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_offset + _newNodeInserters(3484) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_offsetEnd + _newNodeInserters(3570) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_order + _newNodeInserters(3828) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_possibleTypes + _newNodeInserters(4172) = nodes.NewLocal.InsertionHelpers.NewNodeInserter_Local_typeFullName + _newNodeInserters(304) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_astParentFullName + _newNodeInserters(390) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_astParentType + _newNodeInserters(734) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_code + _newNodeInserters(820) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_columnNumber + _newNodeInserters(1422) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_dynamicTypeHintFullName + _newNodeInserters(1938) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_genericSignature + _newNodeInserters(2970) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_lineNumber + _newNodeInserters(3314) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_name + _newNodeInserters(3400) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_offset + _newNodeInserters(3486) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_offsetEnd + _newNodeInserters(3572) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_order + _newNodeInserters(3830) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_possibleTypes + _newNodeInserters(4174) = nodes.NewMember.InsertionHelpers.NewNodeInserter_Member_typeFullName + _newNodeInserters(2026) = nodes.NewMetaData.InsertionHelpers.NewNodeInserter_MetaData_hash + _newNodeInserters(2886) = nodes.NewMetaData.InsertionHelpers.NewNodeInserter_MetaData_language + _newNodeInserters(3660) = nodes.NewMetaData.InsertionHelpers.NewNodeInserter_MetaData_overlays + _newNodeInserters(3918) = nodes.NewMetaData.InsertionHelpers.NewNodeInserter_MetaData_root + _newNodeInserters(4348) = nodes.NewMetaData.InsertionHelpers.NewNodeInserter_MetaData_version + _newNodeInserters(308) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_astParentFullName + _newNodeInserters(394) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_astParentType + _newNodeInserters(738) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_code + _newNodeInserters(824) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_columnNumber + _newNodeInserters(910) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_columnNumberEnd + _newNodeInserters(1770) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_filename + _newNodeInserters(1856) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_fullName + _newNodeInserters(1942) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_genericSignature + _newNodeInserters(2028) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_hash + _newNodeInserters(2544) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_isExternal + _newNodeInserters(2974) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_lineNumber + _newNodeInserters(3060) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_lineNumberEnd + _newNodeInserters(3318) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_name + _newNodeInserters(3404) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_offset + _newNodeInserters(3490) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_offsetEnd + _newNodeInserters(3576) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_order + _newNodeInserters(4006) = nodes.NewMethod.InsertionHelpers.NewNodeInserter_Method_signature + _newNodeInserters(568) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_closureBindingId - _newNodeInserters(934) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_code - _newNodeInserters(1022) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_columnNumber - _newNodeInserters(1638) = + _newNodeInserters(740) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_code + _newNodeInserters(826) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_columnNumber + _newNodeInserters(1428) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_dynamicTypeHintFullName - _newNodeInserters(1726) = + _newNodeInserters(1514) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_evaluationStrategy - _newNodeInserters(2518) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_index - _newNodeInserters(2870) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_isVariadic - _newNodeInserters(3222) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_lineNumber - _newNodeInserters(3662) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_name - _newNodeInserters(3838) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_offset - _newNodeInserters(3926) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_offsetEnd - _newNodeInserters(4014) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_order - _newNodeInserters(4366) = + _newNodeInserters(2288) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_index + _newNodeInserters(2632) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_isVariadic + _newNodeInserters(2976) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_lineNumber + _newNodeInserters(3320) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_name + _newNodeInserters(3406) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_offset + _newNodeInserters(3492) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_offsetEnd + _newNodeInserters(3578) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_order + _newNodeInserters(3836) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_possibleTypes - _newNodeInserters(4806) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_typeFullName - _newNodeInserters(936) = nodes.NewMethodParameterOut.InsertionHelpers.NewNodeInserter_MethodParameterOut_code - _newNodeInserters(1024) = + _newNodeInserters(4180) = nodes.NewMethodParameterIn.InsertionHelpers.NewNodeInserter_MethodParameterIn_typeFullName + _newNodeInserters(742) = nodes.NewMethodParameterOut.InsertionHelpers.NewNodeInserter_MethodParameterOut_code + _newNodeInserters(828) = nodes.NewMethodParameterOut.InsertionHelpers.NewNodeInserter_MethodParameterOut_columnNumber - _newNodeInserters(1728) = + _newNodeInserters(1516) = nodes.NewMethodParameterOut.InsertionHelpers.NewNodeInserter_MethodParameterOut_evaluationStrategy - _newNodeInserters(2520) = nodes.NewMethodParameterOut.InsertionHelpers.NewNodeInserter_MethodParameterOut_index - _newNodeInserters(2872) = nodes.NewMethodParameterOut.InsertionHelpers.NewNodeInserter_MethodParameterOut_isVariadic - _newNodeInserters(3224) = nodes.NewMethodParameterOut.InsertionHelpers.NewNodeInserter_MethodParameterOut_lineNumber - _newNodeInserters(3664) = nodes.NewMethodParameterOut.InsertionHelpers.NewNodeInserter_MethodParameterOut_name - _newNodeInserters(3840) = nodes.NewMethodParameterOut.InsertionHelpers.NewNodeInserter_MethodParameterOut_offset - _newNodeInserters(3928) = nodes.NewMethodParameterOut.InsertionHelpers.NewNodeInserter_MethodParameterOut_offsetEnd - _newNodeInserters(4016) = nodes.NewMethodParameterOut.InsertionHelpers.NewNodeInserter_MethodParameterOut_order - _newNodeInserters(4808) = + _newNodeInserters(2290) = nodes.NewMethodParameterOut.InsertionHelpers.NewNodeInserter_MethodParameterOut_index + _newNodeInserters(2634) = nodes.NewMethodParameterOut.InsertionHelpers.NewNodeInserter_MethodParameterOut_isVariadic + _newNodeInserters(2978) = nodes.NewMethodParameterOut.InsertionHelpers.NewNodeInserter_MethodParameterOut_lineNumber + _newNodeInserters(3322) = nodes.NewMethodParameterOut.InsertionHelpers.NewNodeInserter_MethodParameterOut_name + _newNodeInserters(3408) = nodes.NewMethodParameterOut.InsertionHelpers.NewNodeInserter_MethodParameterOut_offset + _newNodeInserters(3494) = nodes.NewMethodParameterOut.InsertionHelpers.NewNodeInserter_MethodParameterOut_offsetEnd + _newNodeInserters(3580) = nodes.NewMethodParameterOut.InsertionHelpers.NewNodeInserter_MethodParameterOut_order + _newNodeInserters(4182) = nodes.NewMethodParameterOut.InsertionHelpers.NewNodeInserter_MethodParameterOut_typeFullName - _newNodeInserters(146) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_argumentIndex - _newNodeInserters(234) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_argumentName - _newNodeInserters(938) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_code - _newNodeInserters(1026) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_columnNumber - _newNodeInserters(1642) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_dynamicTypeHintFullName - _newNodeInserters(3226) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_lineNumber - _newNodeInserters(3402) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_methodFullName - _newNodeInserters(3842) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_offset - _newNodeInserters(3930) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_offsetEnd - _newNodeInserters(4018) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_order - _newNodeInserters(4370) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_possibleTypes - _newNodeInserters(4810) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_typeFullName - _newNodeInserters(940) = nodes.NewMethodReturn.InsertionHelpers.NewNodeInserter_MethodReturn_code - _newNodeInserters(1028) = nodes.NewMethodReturn.InsertionHelpers.NewNodeInserter_MethodReturn_columnNumber - _newNodeInserters(1644) = + _newNodeInserters(142) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_argumentIndex + _newNodeInserters(228) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_argumentName + _newNodeInserters(744) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_code + _newNodeInserters(830) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_columnNumber + _newNodeInserters(1432) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_dynamicTypeHintFullName + _newNodeInserters(2980) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_lineNumber + _newNodeInserters(3152) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_methodFullName + _newNodeInserters(3410) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_offset + _newNodeInserters(3496) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_offsetEnd + _newNodeInserters(3582) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_order + _newNodeInserters(3840) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_possibleTypes + _newNodeInserters(4184) = nodes.NewMethodRef.InsertionHelpers.NewNodeInserter_MethodRef_typeFullName + _newNodeInserters(746) = nodes.NewMethodReturn.InsertionHelpers.NewNodeInserter_MethodReturn_code + _newNodeInserters(832) = nodes.NewMethodReturn.InsertionHelpers.NewNodeInserter_MethodReturn_columnNumber + _newNodeInserters(1434) = nodes.NewMethodReturn.InsertionHelpers.NewNodeInserter_MethodReturn_dynamicTypeHintFullName - _newNodeInserters(1732) = nodes.NewMethodReturn.InsertionHelpers.NewNodeInserter_MethodReturn_evaluationStrategy - _newNodeInserters(3228) = nodes.NewMethodReturn.InsertionHelpers.NewNodeInserter_MethodReturn_lineNumber - _newNodeInserters(3844) = nodes.NewMethodReturn.InsertionHelpers.NewNodeInserter_MethodReturn_offset - _newNodeInserters(3932) = nodes.NewMethodReturn.InsertionHelpers.NewNodeInserter_MethodReturn_offsetEnd - _newNodeInserters(4020) = nodes.NewMethodReturn.InsertionHelpers.NewNodeInserter_MethodReturn_order - _newNodeInserters(4372) = nodes.NewMethodReturn.InsertionHelpers.NewNodeInserter_MethodReturn_possibleTypes - _newNodeInserters(4812) = nodes.NewMethodReturn.InsertionHelpers.NewNodeInserter_MethodReturn_typeFullName - _newNodeInserters(942) = nodes.NewModifier.InsertionHelpers.NewNodeInserter_Modifier_code - _newNodeInserters(1030) = nodes.NewModifier.InsertionHelpers.NewNodeInserter_Modifier_columnNumber - _newNodeInserters(3230) = nodes.NewModifier.InsertionHelpers.NewNodeInserter_Modifier_lineNumber - _newNodeInserters(3582) = nodes.NewModifier.InsertionHelpers.NewNodeInserter_Modifier_modifierType - _newNodeInserters(3846) = nodes.NewModifier.InsertionHelpers.NewNodeInserter_Modifier_offset - _newNodeInserters(3934) = nodes.NewModifier.InsertionHelpers.NewNodeInserter_Modifier_offsetEnd - _newNodeInserters(4022) = nodes.NewModifier.InsertionHelpers.NewNodeInserter_Modifier_order - _newNodeInserters(944) = nodes.NewNamespace.InsertionHelpers.NewNodeInserter_Namespace_code - _newNodeInserters(1032) = nodes.NewNamespace.InsertionHelpers.NewNodeInserter_Namespace_columnNumber - _newNodeInserters(3232) = nodes.NewNamespace.InsertionHelpers.NewNodeInserter_Namespace_lineNumber - _newNodeInserters(3672) = nodes.NewNamespace.InsertionHelpers.NewNodeInserter_Namespace_name - _newNodeInserters(3848) = nodes.NewNamespace.InsertionHelpers.NewNodeInserter_Namespace_offset - _newNodeInserters(3936) = nodes.NewNamespace.InsertionHelpers.NewNodeInserter_Namespace_offsetEnd - _newNodeInserters(4024) = nodes.NewNamespace.InsertionHelpers.NewNodeInserter_Namespace_order - _newNodeInserters(946) = nodes.NewNamespaceBlock.InsertionHelpers.NewNodeInserter_NamespaceBlock_code - _newNodeInserters(1034) = nodes.NewNamespaceBlock.InsertionHelpers.NewNodeInserter_NamespaceBlock_columnNumber - _newNodeInserters(2002) = nodes.NewNamespaceBlock.InsertionHelpers.NewNodeInserter_NamespaceBlock_filename - _newNodeInserters(2090) = nodes.NewNamespaceBlock.InsertionHelpers.NewNodeInserter_NamespaceBlock_fullName - _newNodeInserters(3234) = nodes.NewNamespaceBlock.InsertionHelpers.NewNodeInserter_NamespaceBlock_lineNumber - _newNodeInserters(3674) = nodes.NewNamespaceBlock.InsertionHelpers.NewNodeInserter_NamespaceBlock_name - _newNodeInserters(3850) = nodes.NewNamespaceBlock.InsertionHelpers.NewNodeInserter_NamespaceBlock_offset - _newNodeInserters(3938) = nodes.NewNamespaceBlock.InsertionHelpers.NewNodeInserter_NamespaceBlock_offsetEnd - _newNodeInserters(4026) = nodes.NewNamespaceBlock.InsertionHelpers.NewNodeInserter_NamespaceBlock_order - _newNodeInserters(156) = nodes.NewReturn.InsertionHelpers.NewNodeInserter_Return_argumentIndex - _newNodeInserters(244) = nodes.NewReturn.InsertionHelpers.NewNodeInserter_Return_argumentName - _newNodeInserters(948) = nodes.NewReturn.InsertionHelpers.NewNodeInserter_Return_code - _newNodeInserters(1036) = nodes.NewReturn.InsertionHelpers.NewNodeInserter_Return_columnNumber - _newNodeInserters(3236) = nodes.NewReturn.InsertionHelpers.NewNodeInserter_Return_lineNumber - _newNodeInserters(3852) = nodes.NewReturn.InsertionHelpers.NewNodeInserter_Return_offset - _newNodeInserters(3940) = nodes.NewReturn.InsertionHelpers.NewNodeInserter_Return_offsetEnd - _newNodeInserters(4028) = nodes.NewReturn.InsertionHelpers.NewNodeInserter_Return_order - _newNodeInserters(3678) = nodes.NewTag.InsertionHelpers.NewNodeInserter_Tag_name - _newNodeInserters(4910) = nodes.NewTag.InsertionHelpers.NewNodeInserter_Tag_value - _newNodeInserters(5264) = nodes.NewTagNodePair.InsertionHelpers.NewNodeInserter_TagNodePair_node - _newNodeInserters(5352) = nodes.NewTagNodePair.InsertionHelpers.NewNodeInserter_TagNodePair_tag - _newNodeInserters(162) = nodes.NewTemplateDom.InsertionHelpers.NewNodeInserter_TemplateDom_argumentIndex - _newNodeInserters(250) = nodes.NewTemplateDom.InsertionHelpers.NewNodeInserter_TemplateDom_argumentName - _newNodeInserters(954) = nodes.NewTemplateDom.InsertionHelpers.NewNodeInserter_TemplateDom_code - _newNodeInserters(1042) = nodes.NewTemplateDom.InsertionHelpers.NewNodeInserter_TemplateDom_columnNumber - _newNodeInserters(3242) = nodes.NewTemplateDom.InsertionHelpers.NewNodeInserter_TemplateDom_lineNumber - _newNodeInserters(3682) = nodes.NewTemplateDom.InsertionHelpers.NewNodeInserter_TemplateDom_name - _newNodeInserters(3858) = nodes.NewTemplateDom.InsertionHelpers.NewNodeInserter_TemplateDom_offset - _newNodeInserters(3946) = nodes.NewTemplateDom.InsertionHelpers.NewNodeInserter_TemplateDom_offsetEnd - _newNodeInserters(4034) = nodes.NewTemplateDom.InsertionHelpers.NewNodeInserter_TemplateDom_order - _newNodeInserters(2100) = nodes.NewType.InsertionHelpers.NewNodeInserter_Type_fullName - _newNodeInserters(3684) = nodes.NewType.InsertionHelpers.NewNodeInserter_Type_name - _newNodeInserters(4740) = nodes.NewType.InsertionHelpers.NewNodeInserter_Type_typeDeclFullName - _newNodeInserters(958) = nodes.NewTypeArgument.InsertionHelpers.NewNodeInserter_TypeArgument_code - _newNodeInserters(1046) = nodes.NewTypeArgument.InsertionHelpers.NewNodeInserter_TypeArgument_columnNumber - _newNodeInserters(3246) = nodes.NewTypeArgument.InsertionHelpers.NewNodeInserter_TypeArgument_lineNumber - _newNodeInserters(3862) = nodes.NewTypeArgument.InsertionHelpers.NewNodeInserter_TypeArgument_offset - _newNodeInserters(3950) = nodes.NewTypeArgument.InsertionHelpers.NewNodeInserter_TypeArgument_offsetEnd - _newNodeInserters(4038) = nodes.NewTypeArgument.InsertionHelpers.NewNodeInserter_TypeArgument_order - _newNodeInserters(80) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_aliasTypeFullName - _newNodeInserters(344) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_astParentFullName - _newNodeInserters(432) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_astParentType - _newNodeInserters(960) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_code - _newNodeInserters(1048) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_columnNumber - _newNodeInserters(2016) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_filename - _newNodeInserters(2104) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_fullName - _newNodeInserters(2192) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_genericSignature - _newNodeInserters(2632) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_inheritsFromTypeFullName - _newNodeInserters(2808) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_isExternal - _newNodeInserters(3248) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_lineNumber - _newNodeInserters(3688) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_name - _newNodeInserters(3864) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_offset - _newNodeInserters(3952) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_offsetEnd - _newNodeInserters(4040) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_order - _newNodeInserters(962) = nodes.NewTypeParameter.InsertionHelpers.NewNodeInserter_TypeParameter_code - _newNodeInserters(1050) = nodes.NewTypeParameter.InsertionHelpers.NewNodeInserter_TypeParameter_columnNumber - _newNodeInserters(3250) = nodes.NewTypeParameter.InsertionHelpers.NewNodeInserter_TypeParameter_lineNumber - _newNodeInserters(3690) = nodes.NewTypeParameter.InsertionHelpers.NewNodeInserter_TypeParameter_name - _newNodeInserters(3866) = nodes.NewTypeParameter.InsertionHelpers.NewNodeInserter_TypeParameter_offset - _newNodeInserters(3954) = nodes.NewTypeParameter.InsertionHelpers.NewNodeInserter_TypeParameter_offsetEnd - _newNodeInserters(4042) = nodes.NewTypeParameter.InsertionHelpers.NewNodeInserter_TypeParameter_order - _newNodeInserters(172) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_argumentIndex - _newNodeInserters(260) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_argumentName - _newNodeInserters(964) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_code - _newNodeInserters(1052) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_columnNumber - _newNodeInserters(1668) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_dynamicTypeHintFullName - _newNodeInserters(3252) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_lineNumber - _newNodeInserters(3868) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_offset - _newNodeInserters(3956) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_offsetEnd - _newNodeInserters(4044) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_order - _newNodeInserters(4396) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_possibleTypes - _newNodeInserters(4836) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_typeFullName - _newNodeInserters(174) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_argumentIndex - _newNodeInserters(262) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_argumentName - _newNodeInserters(966) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_code - _newNodeInserters(1054) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_columnNumber - _newNodeInserters(1230) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_containedRef - _newNodeInserters(1670) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_dynamicTypeHintFullName - _newNodeInserters(3254) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_lineNumber - _newNodeInserters(3870) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_offset - _newNodeInserters(3958) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_offsetEnd - _newNodeInserters(4046) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_order - _newNodeInserters(4310) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_parserTypeName - _newNodeInserters(4398) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_possibleTypes - _newNodeInserters(4838) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_typeFullName + _newNodeInserters(1520) = nodes.NewMethodReturn.InsertionHelpers.NewNodeInserter_MethodReturn_evaluationStrategy + _newNodeInserters(2982) = nodes.NewMethodReturn.InsertionHelpers.NewNodeInserter_MethodReturn_lineNumber + _newNodeInserters(3412) = nodes.NewMethodReturn.InsertionHelpers.NewNodeInserter_MethodReturn_offset + _newNodeInserters(3498) = nodes.NewMethodReturn.InsertionHelpers.NewNodeInserter_MethodReturn_offsetEnd + _newNodeInserters(3584) = nodes.NewMethodReturn.InsertionHelpers.NewNodeInserter_MethodReturn_order + _newNodeInserters(3842) = nodes.NewMethodReturn.InsertionHelpers.NewNodeInserter_MethodReturn_possibleTypes + _newNodeInserters(4186) = nodes.NewMethodReturn.InsertionHelpers.NewNodeInserter_MethodReturn_typeFullName + _newNodeInserters(748) = nodes.NewModifier.InsertionHelpers.NewNodeInserter_Modifier_code + _newNodeInserters(834) = nodes.NewModifier.InsertionHelpers.NewNodeInserter_Modifier_columnNumber + _newNodeInserters(2984) = nodes.NewModifier.InsertionHelpers.NewNodeInserter_Modifier_lineNumber + _newNodeInserters(3242) = nodes.NewModifier.InsertionHelpers.NewNodeInserter_Modifier_modifierType + _newNodeInserters(3414) = nodes.NewModifier.InsertionHelpers.NewNodeInserter_Modifier_offset + _newNodeInserters(3500) = nodes.NewModifier.InsertionHelpers.NewNodeInserter_Modifier_offsetEnd + _newNodeInserters(3586) = nodes.NewModifier.InsertionHelpers.NewNodeInserter_Modifier_order + _newNodeInserters(750) = nodes.NewNamespace.InsertionHelpers.NewNodeInserter_Namespace_code + _newNodeInserters(836) = nodes.NewNamespace.InsertionHelpers.NewNodeInserter_Namespace_columnNumber + _newNodeInserters(2986) = nodes.NewNamespace.InsertionHelpers.NewNodeInserter_Namespace_lineNumber + _newNodeInserters(3330) = nodes.NewNamespace.InsertionHelpers.NewNodeInserter_Namespace_name + _newNodeInserters(3416) = nodes.NewNamespace.InsertionHelpers.NewNodeInserter_Namespace_offset + _newNodeInserters(3502) = nodes.NewNamespace.InsertionHelpers.NewNodeInserter_Namespace_offsetEnd + _newNodeInserters(3588) = nodes.NewNamespace.InsertionHelpers.NewNodeInserter_Namespace_order + _newNodeInserters(752) = nodes.NewNamespaceBlock.InsertionHelpers.NewNodeInserter_NamespaceBlock_code + _newNodeInserters(838) = nodes.NewNamespaceBlock.InsertionHelpers.NewNodeInserter_NamespaceBlock_columnNumber + _newNodeInserters(1784) = nodes.NewNamespaceBlock.InsertionHelpers.NewNodeInserter_NamespaceBlock_filename + _newNodeInserters(1870) = nodes.NewNamespaceBlock.InsertionHelpers.NewNodeInserter_NamespaceBlock_fullName + _newNodeInserters(2988) = nodes.NewNamespaceBlock.InsertionHelpers.NewNodeInserter_NamespaceBlock_lineNumber + _newNodeInserters(3332) = nodes.NewNamespaceBlock.InsertionHelpers.NewNodeInserter_NamespaceBlock_name + _newNodeInserters(3418) = nodes.NewNamespaceBlock.InsertionHelpers.NewNodeInserter_NamespaceBlock_offset + _newNodeInserters(3504) = nodes.NewNamespaceBlock.InsertionHelpers.NewNodeInserter_NamespaceBlock_offsetEnd + _newNodeInserters(3590) = nodes.NewNamespaceBlock.InsertionHelpers.NewNodeInserter_NamespaceBlock_order + _newNodeInserters(152) = nodes.NewReturn.InsertionHelpers.NewNodeInserter_Return_argumentIndex + _newNodeInserters(238) = nodes.NewReturn.InsertionHelpers.NewNodeInserter_Return_argumentName + _newNodeInserters(754) = nodes.NewReturn.InsertionHelpers.NewNodeInserter_Return_code + _newNodeInserters(840) = nodes.NewReturn.InsertionHelpers.NewNodeInserter_Return_columnNumber + _newNodeInserters(2990) = nodes.NewReturn.InsertionHelpers.NewNodeInserter_Return_lineNumber + _newNodeInserters(3420) = nodes.NewReturn.InsertionHelpers.NewNodeInserter_Return_offset + _newNodeInserters(3506) = nodes.NewReturn.InsertionHelpers.NewNodeInserter_Return_offsetEnd + _newNodeInserters(3592) = nodes.NewReturn.InsertionHelpers.NewNodeInserter_Return_order + _newNodeInserters(3336) = nodes.NewTag.InsertionHelpers.NewNodeInserter_Tag_name + _newNodeInserters(4282) = nodes.NewTag.InsertionHelpers.NewNodeInserter_Tag_value + _newNodeInserters(4628) = nodes.NewTagNodePair.InsertionHelpers.NewNodeInserter_TagNodePair_node + _newNodeInserters(4714) = nodes.NewTagNodePair.InsertionHelpers.NewNodeInserter_TagNodePair_tag + _newNodeInserters(158) = nodes.NewTemplateDom.InsertionHelpers.NewNodeInserter_TemplateDom_argumentIndex + _newNodeInserters(244) = nodes.NewTemplateDom.InsertionHelpers.NewNodeInserter_TemplateDom_argumentName + _newNodeInserters(760) = nodes.NewTemplateDom.InsertionHelpers.NewNodeInserter_TemplateDom_code + _newNodeInserters(846) = nodes.NewTemplateDom.InsertionHelpers.NewNodeInserter_TemplateDom_columnNumber + _newNodeInserters(2996) = nodes.NewTemplateDom.InsertionHelpers.NewNodeInserter_TemplateDom_lineNumber + _newNodeInserters(3340) = nodes.NewTemplateDom.InsertionHelpers.NewNodeInserter_TemplateDom_name + _newNodeInserters(3426) = nodes.NewTemplateDom.InsertionHelpers.NewNodeInserter_TemplateDom_offset + _newNodeInserters(3512) = nodes.NewTemplateDom.InsertionHelpers.NewNodeInserter_TemplateDom_offsetEnd + _newNodeInserters(3598) = nodes.NewTemplateDom.InsertionHelpers.NewNodeInserter_TemplateDom_order + _newNodeInserters(1880) = nodes.NewType.InsertionHelpers.NewNodeInserter_Type_fullName + _newNodeInserters(3342) = nodes.NewType.InsertionHelpers.NewNodeInserter_Type_name + _newNodeInserters(4116) = nodes.NewType.InsertionHelpers.NewNodeInserter_Type_typeDeclFullName + _newNodeInserters(764) = nodes.NewTypeArgument.InsertionHelpers.NewNodeInserter_TypeArgument_code + _newNodeInserters(850) = nodes.NewTypeArgument.InsertionHelpers.NewNodeInserter_TypeArgument_columnNumber + _newNodeInserters(3000) = nodes.NewTypeArgument.InsertionHelpers.NewNodeInserter_TypeArgument_lineNumber + _newNodeInserters(3430) = nodes.NewTypeArgument.InsertionHelpers.NewNodeInserter_TypeArgument_offset + _newNodeInserters(3516) = nodes.NewTypeArgument.InsertionHelpers.NewNodeInserter_TypeArgument_offsetEnd + _newNodeInserters(3602) = nodes.NewTypeArgument.InsertionHelpers.NewNodeInserter_TypeArgument_order + _newNodeInserters(78) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_aliasTypeFullName + _newNodeInserters(336) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_astParentFullName + _newNodeInserters(422) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_astParentType + _newNodeInserters(766) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_code + _newNodeInserters(852) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_columnNumber + _newNodeInserters(1798) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_filename + _newNodeInserters(1884) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_fullName + _newNodeInserters(1970) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_genericSignature + _newNodeInserters(2400) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_inheritsFromTypeFullName + _newNodeInserters(2572) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_isExternal + _newNodeInserters(3002) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_lineNumber + _newNodeInserters(3346) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_name + _newNodeInserters(3432) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_offset + _newNodeInserters(3518) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_offsetEnd + _newNodeInserters(3604) = nodes.NewTypeDecl.InsertionHelpers.NewNodeInserter_TypeDecl_order + _newNodeInserters(768) = nodes.NewTypeParameter.InsertionHelpers.NewNodeInserter_TypeParameter_code + _newNodeInserters(854) = nodes.NewTypeParameter.InsertionHelpers.NewNodeInserter_TypeParameter_columnNumber + _newNodeInserters(3004) = nodes.NewTypeParameter.InsertionHelpers.NewNodeInserter_TypeParameter_lineNumber + _newNodeInserters(3348) = nodes.NewTypeParameter.InsertionHelpers.NewNodeInserter_TypeParameter_name + _newNodeInserters(3434) = nodes.NewTypeParameter.InsertionHelpers.NewNodeInserter_TypeParameter_offset + _newNodeInserters(3520) = nodes.NewTypeParameter.InsertionHelpers.NewNodeInserter_TypeParameter_offsetEnd + _newNodeInserters(3606) = nodes.NewTypeParameter.InsertionHelpers.NewNodeInserter_TypeParameter_order + _newNodeInserters(168) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_argumentIndex + _newNodeInserters(254) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_argumentName + _newNodeInserters(770) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_code + _newNodeInserters(856) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_columnNumber + _newNodeInserters(1458) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_dynamicTypeHintFullName + _newNodeInserters(3006) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_lineNumber + _newNodeInserters(3436) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_offset + _newNodeInserters(3522) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_offsetEnd + _newNodeInserters(3608) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_order + _newNodeInserters(3866) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_possibleTypes + _newNodeInserters(4210) = nodes.NewTypeRef.InsertionHelpers.NewNodeInserter_TypeRef_typeFullName + _newNodeInserters(170) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_argumentIndex + _newNodeInserters(256) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_argumentName + _newNodeInserters(772) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_code + _newNodeInserters(858) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_columnNumber + _newNodeInserters(1030) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_containedRef + _newNodeInserters(1460) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_dynamicTypeHintFullName + _newNodeInserters(3008) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_lineNumber + _newNodeInserters(3438) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_offset + _newNodeInserters(3524) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_offsetEnd + _newNodeInserters(3610) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_order + _newNodeInserters(3782) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_parserTypeName + _newNodeInserters(3868) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_possibleTypes + _newNodeInserters(4212) = nodes.NewUnknown.InsertionHelpers.NewNodeInserter_Unknown_typeFullName _newNodeInserters } - override def getNumberOfNodeKinds: Int = 44 + override def getNumberOfNodeKinds: Int = 43 override def getNumberOfEdgeKinds: Int = 24 override def getNodeLabel(nodeKind: Int): String = nodeLabels(nodeKind) override def getNodeKindByLabel(label: String): Int = nodeKindByLabel.getOrElse(label, flatgraph.Schema.UndefinedKind) @@ -1622,19 +1575,6 @@ object GraphSchema extends flatgraph.Schema { "POSSIBLE_TYPES", "TYPE_FULL_NAME" ) - case "LOCATION" => - Set( - "CLASS_NAME", - "CLASS_SHORT_NAME", - "COLUMN_NUMBER", - "FILENAME", - "LINE_NUMBER", - "METHOD_FULL_NAME", - "METHOD_SHORT_NAME", - "NODE_LABEL", - "PACKAGE_NAME", - "SYMBOL" - ) case "MEMBER" => Set( "AST_PARENT_FULL_NAME", @@ -1813,18 +1753,17 @@ object GraphSchema extends flatgraph.Schema { } override def getPropertyLabel(nodeKind: Int, propertyKind: Int): String = { - if (propertyKind < 57) normalNodePropertyNames(propertyKind) - else if (propertyKind == 57 && nodeKind == 15) "evidence" /*on node FINDING*/ - else if (propertyKind == 58 && nodeKind == 15) "keyValuePairs" /*on node FINDING*/ - else if (propertyKind == 59 && nodeKind == 23) "node" /*on node LOCATION*/ - else if (propertyKind == 59 && nodeKind == 36) "node" /*on node TAG_NODE_PAIR*/ - else if (propertyKind == 60 && nodeKind == 36) "tag" /*on node TAG_NODE_PAIR*/ + if (propertyKind < 51) normalNodePropertyNames(propertyKind) + else if (propertyKind == 51 && nodeKind == 15) "evidence" /*on node FINDING*/ + else if (propertyKind == 52 && nodeKind == 15) "keyValuePairs" /*on node FINDING*/ + else if (propertyKind == 53 && nodeKind == 35) "node" /*on node TAG_NODE_PAIR*/ + else if (propertyKind == 54 && nodeKind == 35) "tag" /*on node TAG_NODE_PAIR*/ else null } override def getPropertyKindByName(label: String): Int = nodePropertyByLabel.getOrElse(label, flatgraph.Schema.UndefinedKind) - override def getNumberOfPropertyKinds: Int = 61 + override def getNumberOfPropertyKinds: Int = 55 override def makeNode(graph: flatgraph.Graph, nodeKind: Short, seq: Int): nodes.StoredNode = nodeFactories(nodeKind)(graph, seq) override def makeEdge( diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/NodeTypes.java b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/NodeTypes.java index aa39029e8..e8c828939 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/NodeTypes.java +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/NodeTypes.java @@ -147,9 +147,6 @@ languages like Javascript, it is common that we may know the (short-) name `int x = 10;`, it contains `int x`. */ public static final String LOCAL = "LOCAL"; -/** A location node summarizes a source code location. */ -public static final String LOCATION = "LOCATION"; - /** This node represents a type member of a class, struct or union, e.g., for the type declaration `class Foo{ int i ; }`, it represents the declaration of the variable `i`. */ @@ -329,7 +326,6 @@ languages that support type parameters are Java (via Generics) and C++ add(KEY_VALUE_PAIR); add(LITERAL); add(LOCAL); -add(LOCATION); add(MEMBER); add(META_DATA); add(METHOD); diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/Properties.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/Properties.scala index 2d1e988ac..02d831046 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/Properties.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/Properties.scala @@ -37,58 +37,54 @@ object Properties { */ val CanonicalName = flatgraph.SinglePropertyKey[String](kind = 5, name = "CANONICAL_NAME", default = "") - val ClassName = flatgraph.SinglePropertyKey[String](kind = 6, name = "CLASS_NAME", default = "") - - val ClassShortName = flatgraph.SinglePropertyKey[String](kind = 7, name = "CLASS_SHORT_NAME", default = "") - /** Identifier which uniquely describes a CLOSURE_BINDING. This property is used to match captured LOCAL nodes with * the corresponding CLOSURE_BINDING nodes */ - val ClosureBindingId = flatgraph.OptionalPropertyKey[String](kind = 8, name = "CLOSURE_BINDING_ID") + val ClosureBindingId = flatgraph.OptionalPropertyKey[String](kind = 6, name = "CLOSURE_BINDING_ID") /** The original name of the (potentially mangled) captured variable */ - val ClosureOriginalName = flatgraph.OptionalPropertyKey[String](kind = 9, name = "CLOSURE_ORIGINAL_NAME") + val ClosureOriginalName = flatgraph.OptionalPropertyKey[String](kind = 7, name = "CLOSURE_ORIGINAL_NAME") /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** This optional fields provides the column number at which the program construct represented by the node ends. */ - val ColumnNumberEnd = flatgraph.OptionalPropertyKey[Int](kind = 12, name = "COLUMN_NUMBER_END") + val ColumnNumberEnd = flatgraph.OptionalPropertyKey[Int](kind = 10, name = "COLUMN_NUMBER_END") /** References to other nodes. This is not a real property; it exists here for the sake of proto serialization only. * valueType and cardinality are meaningless. */ - val ContainedRef = flatgraph.SinglePropertyKey[String](kind = 13, name = "CONTAINED_REF", default = "") + val ContainedRef = flatgraph.SinglePropertyKey[String](kind = 11, name = "CONTAINED_REF", default = "") /** Certain files, e.g., configuration files, may be included in the CPG as-is. For such files, the `CONTENT` field * contains the files content. */ - val Content = flatgraph.SinglePropertyKey[String](kind = 14, name = "CONTENT", default = "") + val Content = flatgraph.SinglePropertyKey[String](kind = 12, name = "CONTENT", default = "") /** The `CONTROL_STRUCTURE_TYPE` field indicates which kind of control structure a `CONTROL_STRUCTURE` node * represents. The available types are the following: BREAK, CONTINUE, DO, WHILE, FOR, GOTO, IF, ELSE, TRY, THROW and * SWITCH. */ val ControlStructureType = - flatgraph.SinglePropertyKey[String](kind = 15, name = "CONTROL_STRUCTURE_TYPE", default = "") + flatgraph.SinglePropertyKey[String](kind = 13, name = "CONTROL_STRUCTURE_TYPE", default = "") /** The group ID for a dependency */ - val DependencyGroupId = flatgraph.OptionalPropertyKey[String](kind = 16, name = "DEPENDENCY_GROUP_ID") + val DependencyGroupId = flatgraph.OptionalPropertyKey[String](kind = 14, name = "DEPENDENCY_GROUP_ID") /** This field holds the dispatch type of a call, which is either `STATIC_DISPATCH` or `DYNAMIC_DISPATCH`. For * statically dispatched method calls, the call target is known at compile time while for dynamically dispatched * calls, it can only be determined at runtime as it may depend on the type of an object (as is the case for virtual * method calls) or calculation of an offset. */ - val DispatchType = flatgraph.SinglePropertyKey[String](kind = 17, name = "DISPATCH_TYPE", default = "") + val DispatchType = flatgraph.SinglePropertyKey[String](kind = 15, name = "DISPATCH_TYPE", default = "") /** Type hint for the dynamic type. These are observed to be verifiable at runtime. */ - val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 18, name = "DYNAMIC_TYPE_HINT_FULL_NAME") + val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 16, name = "DYNAMIC_TYPE_HINT_FULL_NAME") /** For formal method input parameters, output parameters, and return parameters, this field holds the evaluation * strategy, which is one of the following: 1) `BY_REFERENCE` indicates that the parameter is passed by reference, 2) @@ -97,118 +93,114 @@ object Properties { * object that it points to is not made. */ val EvaluationStrategy = - flatgraph.SinglePropertyKey[String](kind = 19, name = "EVALUATION_STRATEGY", default = "") + flatgraph.SinglePropertyKey[String](kind = 17, name = "EVALUATION_STRATEGY", default = "") /** Optional description for nodes in evidence. Used to give a hint about the kind of evidence provided by a node. The * evidence description and evidence nodes are associated by index. */ - val EvidenceDescription = flatgraph.MultiPropertyKey[String](kind = 20, name = "EVIDENCE_DESCRIPTION") + val EvidenceDescription = flatgraph.MultiPropertyKey[String](kind = 18, name = "EVIDENCE_DESCRIPTION") /** Specifies whether the IMPORTED_AS property was explicitly present in the code. For languages like Java which do * not allow a renaming during import this is always false. For e.g. Kotlin it depends on the existence of the "as" * keyword. */ - val ExplicitAs = flatgraph.OptionalPropertyKey[Boolean](kind = 21, name = "EXPLICIT_AS") + val ExplicitAs = flatgraph.OptionalPropertyKey[Boolean](kind = 19, name = "EXPLICIT_AS") /** The path of the source file this node was generated from, relative to the root path in the meta data node. This * field must be set but may be set to the value `` to indicate that no source file can be associated with * the node, e.g., because the node represents an entity known to exist because it is referenced, but for which the * file that is is declared in is unknown. */ - val Filename = flatgraph.SinglePropertyKey[String](kind = 22, name = "FILENAME", default = "") + val Filename = flatgraph.SinglePropertyKey[String](kind = 20, name = "FILENAME", default = "") /** This is the fully-qualified name of an entity, e.g., the fully-qualified name of a method or type. The details of * what constitutes a fully-qualified name are language specific. This field SHOULD be human readable. */ - val FullName = flatgraph.SinglePropertyKey[String](kind = 23, name = "FULL_NAME", default = "") + val FullName = flatgraph.SinglePropertyKey[String](kind = 21, name = "FULL_NAME", default = "") /** This field is experimental. It will likely be removed in the future without any notice. It stores type information * for generic types and methods as well as type information for members and locals where the type either contains a * type parameter reference or an instantiated type reference. */ - val GenericSignature = flatgraph.SinglePropertyKey[String](kind = 24, name = "GENERIC_SIGNATURE", default = "") + val GenericSignature = flatgraph.SinglePropertyKey[String](kind = 22, name = "GENERIC_SIGNATURE", default = "") /** This property contains a hash value in the form of a string. Hashes can be used to summarize data, e.g., to * summarize the contents of source files or sub graphs. Such summaries are useful to determine whether code has * already been analyzed in incremental analysis pipelines. This property is optional to allow its calculation to be * deferred or skipped if the hash is not needed. */ - val Hash = flatgraph.OptionalPropertyKey[String](kind = 25, name = "HASH") + val Hash = flatgraph.OptionalPropertyKey[String](kind = 23, name = "HASH") /** The identifier under which the import can be accessed in the importing context. For a Java import this is always * identical to the class name. But e.g. for a Kotlin import like "import java.nio.ByteBuffer as BBuffer" this would * be "BBuffer". This property is ignored if IS_WILDCARD is true. */ - val ImportedAs = flatgraph.OptionalPropertyKey[String](kind = 26, name = "IMPORTED_AS") + val ImportedAs = flatgraph.OptionalPropertyKey[String](kind = 24, name = "IMPORTED_AS") /** The identifying string of the imported entity. For a Java import like "import java.nio.ByteBuffer;" this would be * "java.nio.ByteBuffer". */ - val ImportedEntity = flatgraph.OptionalPropertyKey[String](kind = 27, name = "IMPORTED_ENTITY") + val ImportedEntity = flatgraph.OptionalPropertyKey[String](kind = 25, name = "IMPORTED_ENTITY") /** Specifies an index, e.g., for a parameter or argument. Explicit parameters are numbered from 1 to N, while index 0 * is reserved for implicit self / this parameter. */ - val Index = flatgraph.SinglePropertyKey[Int](kind = 28, name = "INDEX", default = -1: Int) + val Index = flatgraph.SinglePropertyKey[Int](kind = 26, name = "INDEX", default = -1: Int) /** The static types a TYPE_DECL inherits from. This property is matched against the FULL_NAME of TYPE nodes and thus * it is required to have at least one TYPE node for each TYPE_FULL_NAME */ - val InheritsFromTypeFullName = flatgraph.MultiPropertyKey[String](kind = 29, name = "INHERITS_FROM_TYPE_FULL_NAME") + val InheritsFromTypeFullName = flatgraph.MultiPropertyKey[String](kind = 27, name = "INHERITS_FROM_TYPE_FULL_NAME") /** Specifies whether this is an explicit import. Most languages have implicit default imports of some standard * library elements and this flag is used to distinguish those from explicit imports found in the code base. */ - val IsExplicit = flatgraph.OptionalPropertyKey[Boolean](kind = 30, name = "IS_EXPLICIT") + val IsExplicit = flatgraph.OptionalPropertyKey[Boolean](kind = 28, name = "IS_EXPLICIT") /** Indicates that the construct (METHOD or TYPE_DECL) is external, that is, it is referenced but not defined in the * code (applies both to insular parsing and to library functions where we have header files only) */ - val IsExternal = flatgraph.SinglePropertyKey[Boolean](kind = 31, name = "IS_EXTERNAL", default = false) + val IsExternal = flatgraph.SinglePropertyKey[Boolean](kind = 29, name = "IS_EXTERNAL", default = false) /** Specifies whether a parameter is the variadic argument handling parameter of a variadic method. Only one parameter * of a method is allowed to have this property set to true. */ - val IsVariadic = flatgraph.SinglePropertyKey[Boolean](kind = 32, name = "IS_VARIADIC", default = false) + val IsVariadic = flatgraph.SinglePropertyKey[Boolean](kind = 30, name = "IS_VARIADIC", default = false) /** Specifies whether this is a wildcard import. For a Java import like "import java.nio.*;" IS_WILDCARD would be * "true" and IMPORTED_ENTITY would be "java.nio". For wildcard imports the IMPORTED_AS property is ignored. */ - val IsWildcard = flatgraph.OptionalPropertyKey[Boolean](kind = 33, name = "IS_WILDCARD") + val IsWildcard = flatgraph.OptionalPropertyKey[Boolean](kind = 31, name = "IS_WILDCARD") /** This property denotes a key of a key-value pair. */ - val Key = flatgraph.SinglePropertyKey[String](kind = 34, name = "KEY", default = "") + val Key = flatgraph.SinglePropertyKey[String](kind = 32, name = "KEY", default = "") /** This field indicates which CPG language frontend generated the CPG. Frontend developers may freely choose a value * that describes their frontend so long as it is not used by an existing frontend. Reserved values are to date: C, * LLVM, GHIDRA, PHP. */ - val Language = flatgraph.SinglePropertyKey[String](kind = 35, name = "LANGUAGE", default = "") + val Language = flatgraph.SinglePropertyKey[String](kind = 33, name = "LANGUAGE", default = "") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** This optional fields provides the line number at which the program construct represented by the node ends. */ - val LineNumberEnd = flatgraph.OptionalPropertyKey[Int](kind = 37, name = "LINE_NUMBER_END") + val LineNumberEnd = flatgraph.OptionalPropertyKey[Int](kind = 35, name = "LINE_NUMBER_END") /** The FULL_NAME of a method. Used to link CALL and METHOD nodes. It is required to have exactly one METHOD node for * each METHOD_FULL_NAME */ - val MethodFullName = flatgraph.SinglePropertyKey[String](kind = 38, name = "METHOD_FULL_NAME", default = "") - - val MethodShortName = flatgraph.SinglePropertyKey[String](kind = 39, name = "METHOD_SHORT_NAME", default = "") + val MethodFullName = flatgraph.SinglePropertyKey[String](kind = 36, name = "METHOD_FULL_NAME", default = "") /** The modifier type is a free-form string. The following are known modifier types: `STATIC`, `PUBLIC`, `PROTECTED`, * `PRIVATE`, `ABSTRACT`, `NATIVE`, `CONSTRUCTOR`, `VIRTUAL`. */ - val ModifierType = flatgraph.SinglePropertyKey[String](kind = 40, name = "MODIFIER_TYPE", default = "") + val ModifierType = flatgraph.SinglePropertyKey[String](kind = 37, name = "MODIFIER_TYPE", default = "") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") - - val NodeLabel = flatgraph.SinglePropertyKey[String](kind = 42, name = "NODE_LABEL", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -216,64 +208,60 @@ object Properties { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the source * code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order of * 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) /** The field contains the names of the overlays applied to this CPG, in order of their application. Names are * free-form strings, that is, this specification does not dictate them but rather requires tool producers and * consumers to communicate them between each other. */ - val Overlays = flatgraph.MultiPropertyKey[String](kind = 46, name = "OVERLAYS") - - val PackageName = flatgraph.SinglePropertyKey[String](kind = 47, name = "PACKAGE_NAME", default = "") + val Overlays = flatgraph.MultiPropertyKey[String](kind = 42, name = "OVERLAYS") /** AST node type name emitted by parser. */ - val ParserTypeName = flatgraph.SinglePropertyKey[String](kind = 48, name = "PARSER_TYPE_NAME", default = "") + val ParserTypeName = flatgraph.SinglePropertyKey[String](kind = 43, name = "PARSER_TYPE_NAME", default = "") /** Similar to `DYNAMIC_TYPE_HINT_FULL_NAME`, but that this makes no guarantee that types within this property are * correct. This property is used to capture observations between node interactions during a 'may-analysis'. */ - val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 49, name = "POSSIBLE_TYPES") + val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 44, name = "POSSIBLE_TYPES") /** The path to the root directory of the source/binary this CPG is generated from. */ - val Root = flatgraph.SinglePropertyKey[String](kind = 50, name = "ROOT", default = "") + val Root = flatgraph.SinglePropertyKey[String](kind = 45, name = "ROOT", default = "") /** The method signature encodes the types of parameters in a string. The string SHOULD be human readable and suitable * for differentiating methods with different parameter types sufficiently to allow for resolving of function * overloading. The present specification does not enforce a strict format for the signature, that is, it can be * chosen by the frontend implementor to fit the source language. */ - val Signature = flatgraph.SinglePropertyKey[String](kind = 51, name = "SIGNATURE", default = "") - - val Symbol = flatgraph.SinglePropertyKey[String](kind = 52, name = "SYMBOL", default = "") + val Signature = flatgraph.SinglePropertyKey[String](kind = 46, name = "SIGNATURE", default = "") /** The static type decl of a TYPE. This property is matched against the FULL_NAME of TYPE_DECL nodes. It is required * to have exactly one TYPE_DECL for each different TYPE_DECL_FULL_NAME */ val TypeDeclFullName = - flatgraph.SinglePropertyKey[String](kind = 53, name = "TYPE_DECL_FULL_NAME", default = "") + flatgraph.SinglePropertyKey[String](kind = 47, name = "TYPE_DECL_FULL_NAME", default = "") /** This field contains the fully-qualified static type name of the program construct represented by a node. It is the * name of an instantiated type, e.g., `java.util.List`, rather than `java.util.List[T]`. If the type cannot * be determined, this field should be set to the empty string. */ - val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 54, name = "TYPE_FULL_NAME", default = "") + val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 48, name = "TYPE_FULL_NAME", default = "") /** This property denotes a string value as used in a key-value pair. */ - val Value = flatgraph.SinglePropertyKey[String](kind = 55, name = "VALUE", default = "") + val Value = flatgraph.SinglePropertyKey[String](kind = 49, name = "VALUE", default = "") /** A version, given as a string. Used, for example, in the META_DATA node to indicate which version of the CPG spec * this CPG conforms to */ - val Version = flatgraph.SinglePropertyKey[String](kind = 56, name = "VERSION", default = "") + val Version = flatgraph.SinglePropertyKey[String](kind = 50, name = "VERSION", default = "") } diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/PropertyNames.java b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/PropertyNames.java index 85f261f35..1a529f651 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/PropertyNames.java +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/PropertyNames.java @@ -41,12 +41,6 @@ public class PropertyNames { and trade off between false negatives and false positives). */ public static final String CANONICAL_NAME = "CANONICAL_NAME"; - -public static final String CLASS_NAME = "CLASS_NAME"; - - -public static final String CLASS_SHORT_NAME = "CLASS_SHORT_NAME"; - /** Identifier which uniquely describes a CLOSURE_BINDING. This property is used to match captured LOCAL nodes with the corresponding CLOSURE_BINDING nodes */ public static final String CLOSURE_BINDING_ID = "CLOSURE_BINDING_ID"; @@ -196,9 +190,6 @@ it is referenced but not defined in the code (applies both to insular to have exactly one METHOD node for each METHOD_FULL_NAME */ public static final String METHOD_FULL_NAME = "METHOD_FULL_NAME"; - -public static final String METHOD_SHORT_NAME = "METHOD_SHORT_NAME"; - /** The modifier type is a free-form string. The following are known modifier types: `STATIC`, `PUBLIC`, `PROTECTED`, `PRIVATE`, `ABSTRACT`, `NATIVE`, `CONSTRUCTOR`, `VIRTUAL`. */ public static final String MODIFIER_TYPE = "MODIFIER_TYPE"; @@ -206,9 +197,6 @@ it is referenced but not defined in the code (applies both to insular /** Name of represented object, e.g., method name (e.g. "run") */ public static final String NAME = "NAME"; - -public static final String NODE_LABEL = "NODE_LABEL"; - /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the content can easily be accessed via `content.substring(offset, offsetEnd)`. @@ -235,9 +223,6 @@ This means that the offset must be measured in utf16 encoding (i.e. neither in between each other. */ public static final String OVERLAYS = "OVERLAYS"; - -public static final String PACKAGE_NAME = "PACKAGE_NAME"; - /** AST node type name emitted by parser. */ public static final String PARSER_TYPE_NAME = "PARSER_TYPE_NAME"; @@ -259,9 +244,6 @@ This means that the offset must be measured in utf16 encoding (i.e. neither in implementor to fit the source language. */ public static final String SIGNATURE = "SIGNATURE"; - -public static final String SYMBOL = "SYMBOL"; - /** The static type decl of a TYPE. This property is matched against the FULL_NAME of TYPE_DECL nodes. It is required to have exactly one TYPE_DECL for each different TYPE_DECL_FULL_NAME */ @@ -290,8 +272,6 @@ This means that the offset must be measured in utf16 encoding (i.e. neither in add(AST_PARENT_FULL_NAME); add(AST_PARENT_TYPE); add(CANONICAL_NAME); -add(CLASS_NAME); -add(CLASS_SHORT_NAME); add(CLOSURE_BINDING_ID); add(CLOSURE_ORIGINAL_NAME); add(CODE); @@ -323,21 +303,17 @@ This means that the offset must be measured in utf16 encoding (i.e. neither in add(LINE_NUMBER); add(LINE_NUMBER_END); add(METHOD_FULL_NAME); -add(METHOD_SHORT_NAME); add(MODIFIER_TYPE); add(NAME); -add(NODE_LABEL); add(OFFSET); add(OFFSET_END); add(ORDER); add(OVERLAYS); -add(PACKAGE_NAME); add(PARSER_TYPE_NAME); add(POSSIBLE_TYPES); add(ROOT); add(SECONDARY_ID); add(SIGNATURE); -add(SYMBOL); add(TYPE_DECL_FULL_NAME); add(TYPE_FULL_NAME); add(VALUE); diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/accessors/Accessors.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/accessors/Accessors.scala index 1de04dc10..6c33de6d4 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/accessors/Accessors.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/accessors/Accessors.scala @@ -31,204 +31,180 @@ object Accessors { def canonicalName: String = flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 5, node.seq(), "": String) } - final class AccessPropertyClassName(val node: nodes.StoredNode) extends AnyVal { - def className: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 6, node.seq(), "": String) - } - final class AccessPropertyClassShortName(val node: nodes.StoredNode) extends AnyVal { - def classShortName: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 7, node.seq(), "": String) - } final class AccessPropertyClosureBindingId(val node: nodes.StoredNode) extends AnyVal { def closureBindingId: Option[String] = - flatgraph.Accessors.getNodePropertyOption[String](node.graph, node.nodeKind, 8, node.seq) + flatgraph.Accessors.getNodePropertyOption[String](node.graph, node.nodeKind, 6, node.seq) } final class AccessPropertyClosureOriginalName(val node: nodes.StoredNode) extends AnyVal { def closureOriginalName: Option[String] = - flatgraph.Accessors.getNodePropertyOption[String](node.graph, node.nodeKind, 9, node.seq) + flatgraph.Accessors.getNodePropertyOption[String](node.graph, node.nodeKind, 7, node.seq) } final class AccessPropertyCode(val node: nodes.StoredNode) extends AnyVal { def code: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 10, node.seq(), "": String) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 8, node.seq(), "": String) } final class AccessPropertyColumnNumber(val node: nodes.StoredNode) extends AnyVal { def columnNumber: Option[Int] = - flatgraph.Accessors.getNodePropertyOption[Int](node.graph, node.nodeKind, 11, node.seq) + flatgraph.Accessors.getNodePropertyOption[Int](node.graph, node.nodeKind, 9, node.seq) } final class AccessPropertyColumnNumberEnd(val node: nodes.StoredNode) extends AnyVal { def columnNumberEnd: Option[Int] = - flatgraph.Accessors.getNodePropertyOption[Int](node.graph, node.nodeKind, 12, node.seq) + flatgraph.Accessors.getNodePropertyOption[Int](node.graph, node.nodeKind, 10, node.seq) } final class AccessPropertyContainedRef(val node: nodes.StoredNode) extends AnyVal { def containedRef: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 13, node.seq(), "": String) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 11, node.seq(), "": String) } final class AccessPropertyContent(val node: nodes.StoredNode) extends AnyVal { def content: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 14, node.seq(), "": String) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 12, node.seq(), "": String) } final class AccessPropertyControlStructureType(val node: nodes.StoredNode) extends AnyVal { def controlStructureType: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 15, node.seq(), "": String) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 13, node.seq(), "": String) } final class AccessPropertyDependencyGroupId(val node: nodes.StoredNode) extends AnyVal { def dependencyGroupId: Option[String] = - flatgraph.Accessors.getNodePropertyOption[String](node.graph, node.nodeKind, 16, node.seq) + flatgraph.Accessors.getNodePropertyOption[String](node.graph, node.nodeKind, 14, node.seq) } final class AccessPropertyDispatchType(val node: nodes.StoredNode) extends AnyVal { def dispatchType: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 17, node.seq(), "": String) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 15, node.seq(), "": String) } final class AccessPropertyDynamicTypeHintFullName(val node: nodes.StoredNode) extends AnyVal { def dynamicTypeHintFullName: IndexedSeq[String] = - flatgraph.Accessors.getNodePropertyMulti[String](node.graph, node.nodeKind, 18, node.seq) + flatgraph.Accessors.getNodePropertyMulti[String](node.graph, node.nodeKind, 16, node.seq) } final class AccessPropertyEvaluationStrategy(val node: nodes.StoredNode) extends AnyVal { def evaluationStrategy: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 19, node.seq(), "": String) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 17, node.seq(), "": String) } final class AccessPropertyEvidenceDescription(val node: nodes.StoredNode) extends AnyVal { def evidenceDescription: IndexedSeq[String] = - flatgraph.Accessors.getNodePropertyMulti[String](node.graph, node.nodeKind, 20, node.seq) + flatgraph.Accessors.getNodePropertyMulti[String](node.graph, node.nodeKind, 18, node.seq) } final class AccessPropertyExplicitAs(val node: nodes.StoredNode) extends AnyVal { def explicitAs: Option[Boolean] = - flatgraph.Accessors.getNodePropertyOption[Boolean](node.graph, node.nodeKind, 21, node.seq) + flatgraph.Accessors.getNodePropertyOption[Boolean](node.graph, node.nodeKind, 19, node.seq) } final class AccessPropertyFilename(val node: nodes.StoredNode) extends AnyVal { def filename: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 22, node.seq(), "": String) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 20, node.seq(), "": String) } final class AccessPropertyFullName(val node: nodes.StoredNode) extends AnyVal { def fullName: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 23, node.seq(), "": String) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 21, node.seq(), "": String) } final class AccessPropertyGenericSignature(val node: nodes.StoredNode) extends AnyVal { def genericSignature: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 24, node.seq(), "": String) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 22, node.seq(), "": String) } final class AccessPropertyHash(val node: nodes.StoredNode) extends AnyVal { def hash: Option[String] = - flatgraph.Accessors.getNodePropertyOption[String](node.graph, node.nodeKind, 25, node.seq) + flatgraph.Accessors.getNodePropertyOption[String](node.graph, node.nodeKind, 23, node.seq) } final class AccessPropertyImportedAs(val node: nodes.StoredNode) extends AnyVal { def importedAs: Option[String] = - flatgraph.Accessors.getNodePropertyOption[String](node.graph, node.nodeKind, 26, node.seq) + flatgraph.Accessors.getNodePropertyOption[String](node.graph, node.nodeKind, 24, node.seq) } final class AccessPropertyImportedEntity(val node: nodes.StoredNode) extends AnyVal { def importedEntity: Option[String] = - flatgraph.Accessors.getNodePropertyOption[String](node.graph, node.nodeKind, 27, node.seq) + flatgraph.Accessors.getNodePropertyOption[String](node.graph, node.nodeKind, 25, node.seq) } final class AccessPropertyIndex(val node: nodes.StoredNode) extends AnyVal { - def index: Int = flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 28, node.seq(), -1: Int) + def index: Int = flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 26, node.seq(), -1: Int) } final class AccessPropertyInheritsFromTypeFullName(val node: nodes.StoredNode) extends AnyVal { def inheritsFromTypeFullName: IndexedSeq[String] = - flatgraph.Accessors.getNodePropertyMulti[String](node.graph, node.nodeKind, 29, node.seq) + flatgraph.Accessors.getNodePropertyMulti[String](node.graph, node.nodeKind, 27, node.seq) } final class AccessPropertyIsExplicit(val node: nodes.StoredNode) extends AnyVal { def isExplicit: Option[Boolean] = - flatgraph.Accessors.getNodePropertyOption[Boolean](node.graph, node.nodeKind, 30, node.seq) + flatgraph.Accessors.getNodePropertyOption[Boolean](node.graph, node.nodeKind, 28, node.seq) } final class AccessPropertyIsExternal(val node: nodes.StoredNode) extends AnyVal { def isExternal: Boolean = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 31, node.seq(), false: Boolean) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 29, node.seq(), false: Boolean) } final class AccessPropertyIsVariadic(val node: nodes.StoredNode) extends AnyVal { def isVariadic: Boolean = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 32, node.seq(), false: Boolean) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 30, node.seq(), false: Boolean) } final class AccessPropertyIsWildcard(val node: nodes.StoredNode) extends AnyVal { def isWildcard: Option[Boolean] = - flatgraph.Accessors.getNodePropertyOption[Boolean](node.graph, node.nodeKind, 33, node.seq) + flatgraph.Accessors.getNodePropertyOption[Boolean](node.graph, node.nodeKind, 31, node.seq) } final class AccessPropertyKey(val node: nodes.StoredNode) extends AnyVal { def key: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 34, node.seq(), "": String) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 32, node.seq(), "": String) } final class AccessPropertyLanguage(val node: nodes.StoredNode) extends AnyVal { def language: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 35, node.seq(), "": String) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 33, node.seq(), "": String) } final class AccessPropertyLineNumber(val node: nodes.StoredNode) extends AnyVal { def lineNumber: Option[Int] = - flatgraph.Accessors.getNodePropertyOption[Int](node.graph, node.nodeKind, 36, node.seq) + flatgraph.Accessors.getNodePropertyOption[Int](node.graph, node.nodeKind, 34, node.seq) } final class AccessPropertyLineNumberEnd(val node: nodes.StoredNode) extends AnyVal { def lineNumberEnd: Option[Int] = - flatgraph.Accessors.getNodePropertyOption[Int](node.graph, node.nodeKind, 37, node.seq) + flatgraph.Accessors.getNodePropertyOption[Int](node.graph, node.nodeKind, 35, node.seq) } final class AccessPropertyMethodFullName(val node: nodes.StoredNode) extends AnyVal { def methodFullName: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 38, node.seq(), "": String) - } - final class AccessPropertyMethodShortName(val node: nodes.StoredNode) extends AnyVal { - def methodShortName: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 39, node.seq(), "": String) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 36, node.seq(), "": String) } final class AccessPropertyModifierType(val node: nodes.StoredNode) extends AnyVal { def modifierType: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 40, node.seq(), "": String) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 37, node.seq(), "": String) } final class AccessPropertyName(val node: nodes.StoredNode) extends AnyVal { def name: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 41, node.seq(), "": String) - } - final class AccessPropertyNodeLabel(val node: nodes.StoredNode) extends AnyVal { - def nodeLabel: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 42, node.seq(), "": String) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 38, node.seq(), "": String) } final class AccessPropertyOffset(val node: nodes.StoredNode) extends AnyVal { - def offset: Option[Int] = flatgraph.Accessors.getNodePropertyOption[Int](node.graph, node.nodeKind, 43, node.seq) + def offset: Option[Int] = flatgraph.Accessors.getNodePropertyOption[Int](node.graph, node.nodeKind, 39, node.seq) } final class AccessPropertyOffsetEnd(val node: nodes.StoredNode) extends AnyVal { - def offsetEnd: Option[Int] = flatgraph.Accessors.getNodePropertyOption[Int](node.graph, node.nodeKind, 44, node.seq) + def offsetEnd: Option[Int] = flatgraph.Accessors.getNodePropertyOption[Int](node.graph, node.nodeKind, 40, node.seq) } final class AccessPropertyOrder(val node: nodes.StoredNode) extends AnyVal { - def order: Int = flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 45, node.seq(), -1: Int) + def order: Int = flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 41, node.seq(), -1: Int) } final class AccessPropertyOverlays(val node: nodes.StoredNode) extends AnyVal { def overlays: IndexedSeq[String] = - flatgraph.Accessors.getNodePropertyMulti[String](node.graph, node.nodeKind, 46, node.seq) - } - final class AccessPropertyPackageName(val node: nodes.StoredNode) extends AnyVal { - def packageName: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 47, node.seq(), "": String) + flatgraph.Accessors.getNodePropertyMulti[String](node.graph, node.nodeKind, 42, node.seq) } final class AccessPropertyParserTypeName(val node: nodes.StoredNode) extends AnyVal { def parserTypeName: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 48, node.seq(), "": String) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 43, node.seq(), "": String) } final class AccessPropertyPossibleTypes(val node: nodes.StoredNode) extends AnyVal { def possibleTypes: IndexedSeq[String] = - flatgraph.Accessors.getNodePropertyMulti[String](node.graph, node.nodeKind, 49, node.seq) + flatgraph.Accessors.getNodePropertyMulti[String](node.graph, node.nodeKind, 44, node.seq) } final class AccessPropertyRoot(val node: nodes.StoredNode) extends AnyVal { def root: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 50, node.seq(), "": String) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 45, node.seq(), "": String) } final class AccessPropertySignature(val node: nodes.StoredNode) extends AnyVal { def signature: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 51, node.seq(), "": String) - } - final class AccessPropertySymbol(val node: nodes.StoredNode) extends AnyVal { - def symbol: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 52, node.seq(), "": String) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 46, node.seq(), "": String) } final class AccessPropertyTypeDeclFullName(val node: nodes.StoredNode) extends AnyVal { def typeDeclFullName: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 53, node.seq(), "": String) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 47, node.seq(), "": String) } final class AccessPropertyTypeFullName(val node: nodes.StoredNode) extends AnyVal { def typeFullName: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 54, node.seq(), "": String) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 48, node.seq(), "": String) } final class AccessPropertyValue(val node: nodes.StoredNode) extends AnyVal { - def value: String = flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 55, node.seq(), "": String) + def value: String = flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 49, node.seq(), "": String) } final class AccessPropertyVersion(val node: nodes.StoredNode) extends AnyVal { def version: String = - flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 56, node.seq(), "": String) + flatgraph.Accessors.getNodePropertySingle(node.graph, node.nodeKind, 50, node.seq(), "": String) } /* accessors for concrete stored nodes end */ @@ -492,48 +468,6 @@ object Accessors { case newNode: nodes.NewLocal => newNode.typeFullName } } - final class AccessLocationBase(val node: nodes.LocationBase) extends AnyVal { - def className: String = node match { - case stored: nodes.StoredNode => new AccessPropertyClassName(stored).className - case newNode: nodes.NewLocation => newNode.className - } - def classShortName: String = node match { - case stored: nodes.StoredNode => new AccessPropertyClassShortName(stored).classShortName - case newNode: nodes.NewLocation => newNode.classShortName - } - def columnNumber: Option[Int] = node match { - case stored: nodes.StoredNode => new AccessPropertyColumnNumber(stored).columnNumber - case newNode: nodes.NewLocation => newNode.columnNumber - } - def filename: String = node match { - case stored: nodes.StoredNode => new AccessPropertyFilename(stored).filename - case newNode: nodes.NewLocation => newNode.filename - } - def lineNumber: Option[Int] = node match { - case stored: nodes.StoredNode => new AccessPropertyLineNumber(stored).lineNumber - case newNode: nodes.NewLocation => newNode.lineNumber - } - def methodFullName: String = node match { - case stored: nodes.StoredNode => new AccessPropertyMethodFullName(stored).methodFullName - case newNode: nodes.NewLocation => newNode.methodFullName - } - def methodShortName: String = node match { - case stored: nodes.StoredNode => new AccessPropertyMethodShortName(stored).methodShortName - case newNode: nodes.NewLocation => newNode.methodShortName - } - def nodeLabel: String = node match { - case stored: nodes.StoredNode => new AccessPropertyNodeLabel(stored).nodeLabel - case newNode: nodes.NewLocation => newNode.nodeLabel - } - def packageName: String = node match { - case stored: nodes.StoredNode => new AccessPropertyPackageName(stored).packageName - case newNode: nodes.NewLocation => newNode.packageName - } - def symbol: String = node match { - case stored: nodes.StoredNode => new AccessPropertySymbol(stored).symbol - case newNode: nodes.NewLocation => newNode.symbol - } - } final class AccessMemberBase(val node: nodes.MemberBase) extends AnyVal { def astParentFullName: String = node match { case stored: nodes.StoredNode => new AccessPropertyAstParentFullName(stored).astParentFullName @@ -923,12 +857,6 @@ trait ConcreteStoredConversions extends ConcreteBaseConversions { implicit def accessPropertyCanonicalName( node: nodes.StoredNode & nodes.StaticType[nodes.HasCanonicalNameEMT] ): AccessPropertyCanonicalName = new AccessPropertyCanonicalName(node) - implicit def accessPropertyClassName( - node: nodes.StoredNode & nodes.StaticType[nodes.HasClassNameEMT] - ): AccessPropertyClassName = new AccessPropertyClassName(node) - implicit def accessPropertyClassShortName( - node: nodes.StoredNode & nodes.StaticType[nodes.HasClassShortNameEMT] - ): AccessPropertyClassShortName = new AccessPropertyClassShortName(node) implicit def accessPropertyClosureBindingId( node: nodes.StoredNode & nodes.StaticType[nodes.HasClosureBindingIdEMT] ): AccessPropertyClosureBindingId = new AccessPropertyClosureBindingId(node) @@ -1018,17 +946,11 @@ trait ConcreteStoredConversions extends ConcreteBaseConversions { implicit def accessPropertyMethodFullName( node: nodes.StoredNode & nodes.StaticType[nodes.HasMethodFullNameEMT] ): AccessPropertyMethodFullName = new AccessPropertyMethodFullName(node) - implicit def accessPropertyMethodShortName( - node: nodes.StoredNode & nodes.StaticType[nodes.HasMethodShortNameEMT] - ): AccessPropertyMethodShortName = new AccessPropertyMethodShortName(node) implicit def accessPropertyModifierType( node: nodes.StoredNode & nodes.StaticType[nodes.HasModifierTypeEMT] ): AccessPropertyModifierType = new AccessPropertyModifierType(node) implicit def accessPropertyName(node: nodes.StoredNode & nodes.StaticType[nodes.HasNameEMT]): AccessPropertyName = new AccessPropertyName(node) - implicit def accessPropertyNodeLabel( - node: nodes.StoredNode & nodes.StaticType[nodes.HasNodeLabelEMT] - ): AccessPropertyNodeLabel = new AccessPropertyNodeLabel(node) implicit def accessPropertyOffset( node: nodes.StoredNode & nodes.StaticType[nodes.HasOffsetEMT] ): AccessPropertyOffset = new AccessPropertyOffset(node) @@ -1040,9 +962,6 @@ trait ConcreteStoredConversions extends ConcreteBaseConversions { implicit def accessPropertyOverlays( node: nodes.StoredNode & nodes.StaticType[nodes.HasOverlaysEMT] ): AccessPropertyOverlays = new AccessPropertyOverlays(node) - implicit def accessPropertyPackageName( - node: nodes.StoredNode & nodes.StaticType[nodes.HasPackageNameEMT] - ): AccessPropertyPackageName = new AccessPropertyPackageName(node) implicit def accessPropertyParserTypeName( node: nodes.StoredNode & nodes.StaticType[nodes.HasParserTypeNameEMT] ): AccessPropertyParserTypeName = new AccessPropertyParserTypeName(node) @@ -1054,9 +973,6 @@ trait ConcreteStoredConversions extends ConcreteBaseConversions { implicit def accessPropertySignature( node: nodes.StoredNode & nodes.StaticType[nodes.HasSignatureEMT] ): AccessPropertySignature = new AccessPropertySignature(node) - implicit def accessPropertySymbol( - node: nodes.StoredNode & nodes.StaticType[nodes.HasSymbolEMT] - ): AccessPropertySymbol = new AccessPropertySymbol(node) implicit def accessPropertyTypeDeclFullName( node: nodes.StoredNode & nodes.StaticType[nodes.HasTypeDeclFullNameEMT] ): AccessPropertyTypeDeclFullName = new AccessPropertyTypeDeclFullName(node) @@ -1103,7 +1019,6 @@ trait ConcreteBaseConversions extends AbstractBaseConversions0 { new AccessKeyvaluepairBase(node) implicit def accessLiteralbase(node: nodes.LiteralBase): AccessLiteralBase = new AccessLiteralBase(node) implicit def accessLocalbase(node: nodes.LocalBase): AccessLocalBase = new AccessLocalBase(node) - implicit def accessLocationbase(node: nodes.LocationBase): AccessLocationBase = new AccessLocationBase(node) implicit def accessMemberbase(node: nodes.MemberBase): AccessMemberBase = new AccessMemberBase(node) implicit def accessMetadatabase(node: nodes.MetaDataBase): AccessMetadataBase = new AccessMetadataBase(node) implicit def accessMethodbase(node: nodes.MethodBase): AccessMethodBase = new AccessMethodBase(node) diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Annotation.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Annotation.scala index fcdbbc324..267822d8f 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Annotation.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Annotation.scala @@ -101,23 +101,23 @@ object Annotation { val ArgumentName = flatgraph.OptionalPropertyKey[String](kind = 2, name = "ARGUMENT_NAME") /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** This is the fully-qualified name of an entity, e.g., the fully-qualified name of a method or type. The details * of what constitutes a fully-qualified name are language specific. This field SHOULD be human readable. */ - val FullName = flatgraph.SinglePropertyKey[String](kind = 23, name = "FULL_NAME", default = "") + val FullName = flatgraph.SinglePropertyKey[String](kind = 21, name = "FULL_NAME", default = "") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -125,18 +125,18 @@ object Annotation { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) } object PropertyDefaults { val ArgumentIndex = -1: Int @@ -1738,14 +1738,14 @@ class NewAnnotation extends NewNode(0.toShort) with AnnotationBase with Expressi override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { interface.countProperty(this, 1, 1) interface.countProperty(this, 2, argumentName.size) - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 23, 1) - interface.countProperty(this, 36, lineNumber.size) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 21, 1) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 38, 1) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) interface.countProperty(this, 41, 1) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/AnnotationLiteral.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/AnnotationLiteral.scala index a4378762b..a6fc7eda1 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/AnnotationLiteral.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/AnnotationLiteral.scala @@ -95,18 +95,18 @@ object AnnotationLiteral { val ArgumentName = flatgraph.OptionalPropertyKey[String](kind = 2, name = "ARGUMENT_NAME") /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -114,18 +114,18 @@ object AnnotationLiteral { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) } object PropertyDefaults { val ArgumentIndex = -1: Int @@ -1697,13 +1697,13 @@ class NewAnnotationLiteral extends NewNode(1.toShort) with AnnotationLiteralBase override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { interface.countProperty(this, 1, 1) interface.countProperty(this, 2, argumentName.size) - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 36, lineNumber.size) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 38, 1) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) interface.countProperty(this, 41, 1) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/AnnotationParameter.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/AnnotationParameter.scala index 87eac77d2..211da8109 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/AnnotationParameter.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/AnnotationParameter.scala @@ -61,15 +61,15 @@ object AnnotationParameter { object Properties { /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -77,18 +77,18 @@ object AnnotationParameter { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) } object PropertyDefaults { val Code = "" @@ -1564,12 +1564,12 @@ class NewAnnotationParameter extends NewNode(2.toShort) with AnnotationParameter def offsetEnd(value: Option[Int]): this.type = { this.offsetEnd = value; this } def order(value: Int): this.type = { this.order = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 36, lineNumber.size) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) + interface.countProperty(this, 41, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/AnnotationParameterAssign.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/AnnotationParameterAssign.scala index 78ea6c684..0e52e79e7 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/AnnotationParameterAssign.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/AnnotationParameterAssign.scala @@ -64,15 +64,15 @@ object AnnotationParameterAssign { object Properties { /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -80,18 +80,18 @@ object AnnotationParameterAssign { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) } object PropertyDefaults { val Code = "" @@ -1567,12 +1567,12 @@ class NewAnnotationParameterAssign extends NewNode(3.toShort) with AnnotationPar def offsetEnd(value: Option[Int]): this.type = { this.offsetEnd = value; this } def order(value: Int): this.type = { this.order = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 36, lineNumber.size) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) + interface.countProperty(this, 41, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/ArrayInitializer.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/ArrayInitializer.scala index 0983a38df..cd8328b3d 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/ArrayInitializer.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/ArrayInitializer.scala @@ -91,15 +91,15 @@ object ArrayInitializer { val ArgumentName = flatgraph.OptionalPropertyKey[String](kind = 2, name = "ARGUMENT_NAME") /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -107,18 +107,18 @@ object ArrayInitializer { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) } object PropertyDefaults { val ArgumentIndex = -1: Int @@ -1660,12 +1660,12 @@ class NewArrayInitializer extends NewNode(4.toShort) with ArrayInitializerBase w override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { interface.countProperty(this, 1, 1) interface.countProperty(this, 2, argumentName.size) - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 36, lineNumber.size) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) + interface.countProperty(this, 41, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/BaseTypes.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/BaseTypes.scala index adf372bd3..a3b8a3342 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/BaseTypes.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/BaseTypes.scala @@ -164,16 +164,6 @@ trait HasAstParentTypeEMT */ trait HasCanonicalNameEMT -/** Node types with this marker trait are guaranteed to have the CLASS_NAME property. EMT stands for: "erased marker - * trait", it exists only at compile time in order to improve type safety. - */ -trait HasClassNameEMT - -/** Node types with this marker trait are guaranteed to have the CLASS_SHORT_NAME property. EMT stands for: "erased - * marker trait", it exists only at compile time in order to improve type safety. - */ -trait HasClassShortNameEMT - /** Node types with this marker trait are guaranteed to have the CLOSURE_BINDING_ID property. EMT stands for: "erased * marker trait", it exists only at compile time in order to improve type safety. */ @@ -329,11 +319,6 @@ trait HasLineNumberEndEMT */ trait HasMethodFullNameEMT -/** Node types with this marker trait are guaranteed to have the METHOD_SHORT_NAME property. EMT stands for: "erased - * marker trait", it exists only at compile time in order to improve type safety. - */ -trait HasMethodShortNameEMT - /** Node types with this marker trait are guaranteed to have the MODIFIER_TYPE property. EMT stands for: "erased marker * trait", it exists only at compile time in order to improve type safety. */ @@ -344,11 +329,6 @@ trait HasModifierTypeEMT */ trait HasNameEMT -/** Node types with this marker trait are guaranteed to have the NODE_LABEL property. EMT stands for: "erased marker - * trait", it exists only at compile time in order to improve type safety. - */ -trait HasNodeLabelEMT - /** Node types with this marker trait are guaranteed to have the OFFSET property. EMT stands for: "erased marker trait", * it exists only at compile time in order to improve type safety. */ @@ -369,11 +349,6 @@ trait HasOrderEMT */ trait HasOverlaysEMT -/** Node types with this marker trait are guaranteed to have the PACKAGE_NAME property. EMT stands for: "erased marker - * trait", it exists only at compile time in order to improve type safety. - */ -trait HasPackageNameEMT - /** Node types with this marker trait are guaranteed to have the PARSER_TYPE_NAME property. EMT stands for: "erased * marker trait", it exists only at compile time in order to improve type safety. */ @@ -394,11 +369,6 @@ trait HasRootEMT */ trait HasSignatureEMT -/** Node types with this marker trait are guaranteed to have the SYMBOL property. EMT stands for: "erased marker trait", - * it exists only at compile time in order to improve type safety. - */ -trait HasSymbolEMT - /** Node types with this marker trait are guaranteed to have the TYPE_DECL_FULL_NAME property. EMT stands for: "erased * marker trait", it exists only at compile time in order to improve type safety. */ diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Binding.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Binding.scala index 6cd2c6796..85ab8630e 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Binding.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Binding.scala @@ -45,17 +45,17 @@ object Binding { /** The FULL_NAME of a method. Used to link CALL and METHOD nodes. It is required to have exactly one METHOD node * for each METHOD_FULL_NAME */ - val MethodFullName = flatgraph.SinglePropertyKey[String](kind = 38, name = "METHOD_FULL_NAME", default = "") + val MethodFullName = flatgraph.SinglePropertyKey[String](kind = 36, name = "METHOD_FULL_NAME", default = "") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** The method signature encodes the types of parameters in a string. The string SHOULD be human readable and * suitable for differentiating methods with different parameter types sufficiently to allow for resolving of * function overloading. The present specification does not enforce a strict format for the signature, that is, it * can be chosen by the frontend implementor to fit the source language. */ - val Signature = flatgraph.SinglePropertyKey[String](kind = 51, name = "SIGNATURE", default = "") + val Signature = flatgraph.SinglePropertyKey[String](kind = 46, name = "SIGNATURE", default = "") } object PropertyDefaults { val MethodFullName = "" @@ -193,9 +193,9 @@ class NewBinding extends NewNode(5.toShort) with BindingBase { def name(value: String): this.type = { this.name = value; this } def signature(value: String): this.type = { this.signature = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { + interface.countProperty(this, 36, 1) interface.countProperty(this, 38, 1) - interface.countProperty(this, 41, 1) - interface.countProperty(this, 51, 1) + interface.countProperty(this, 46, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Block.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Block.scala index d590b2a72..8236ecf26 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Block.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Block.scala @@ -115,18 +115,18 @@ object Block { val ArgumentName = flatgraph.OptionalPropertyKey[String](kind = 2, name = "ARGUMENT_NAME") /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** Type hint for the dynamic type. These are observed to be verifiable at runtime. */ - val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 18, name = "DYNAMIC_TYPE_HINT_FULL_NAME") + val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 16, name = "DYNAMIC_TYPE_HINT_FULL_NAME") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -134,29 +134,29 @@ object Block { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) /** Similar to `DYNAMIC_TYPE_HINT_FULL_NAME`, but that this makes no guarantee that types within this property are * correct. This property is used to capture observations between node interactions during a 'may-analysis'. */ - val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 49, name = "POSSIBLE_TYPES") + val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 44, name = "POSSIBLE_TYPES") /** This field contains the fully-qualified static type name of the program construct represented by a node. It is * the name of an instantiated type, e.g., `java.util.List`, rather than `java.util.List[T]`. If the type * cannot be determined, this field should be set to the empty string. */ - val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 54, name = "TYPE_FULL_NAME", default = "") + val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 48, name = "TYPE_FULL_NAME", default = "") } object PropertyDefaults { val ArgumentIndex = -1: Int @@ -1792,15 +1792,15 @@ class NewBlock extends NewNode(6.toShort) with BlockBase with ExpressionNew { override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { interface.countProperty(this, 1, 1) interface.countProperty(this, 2, argumentName.size) - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 18, dynamicTypeHintFullName.size) - interface.countProperty(this, 36, lineNumber.size) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) - interface.countProperty(this, 49, possibleTypes.size) - interface.countProperty(this, 54, 1) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 16, dynamicTypeHintFullName.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) + interface.countProperty(this, 41, 1) + interface.countProperty(this, 44, possibleTypes.size) + interface.countProperty(this, 48, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Call.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Call.scala index ab18e6f61..853e40e28 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Call.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Call.scala @@ -144,33 +144,33 @@ object Call { val ArgumentName = flatgraph.OptionalPropertyKey[String](kind = 2, name = "ARGUMENT_NAME") /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** This field holds the dispatch type of a call, which is either `STATIC_DISPATCH` or `DYNAMIC_DISPATCH`. For * statically dispatched method calls, the call target is known at compile time while for dynamically dispatched * calls, it can only be determined at runtime as it may depend on the type of an object (as is the case for * virtual method calls) or calculation of an offset. */ - val DispatchType = flatgraph.SinglePropertyKey[String](kind = 17, name = "DISPATCH_TYPE", default = "") + val DispatchType = flatgraph.SinglePropertyKey[String](kind = 15, name = "DISPATCH_TYPE", default = "") /** Type hint for the dynamic type. These are observed to be verifiable at runtime. */ - val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 18, name = "DYNAMIC_TYPE_HINT_FULL_NAME") + val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 16, name = "DYNAMIC_TYPE_HINT_FULL_NAME") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** The FULL_NAME of a method. Used to link CALL and METHOD nodes. It is required to have exactly one METHOD node * for each METHOD_FULL_NAME */ - val MethodFullName = flatgraph.SinglePropertyKey[String](kind = 38, name = "METHOD_FULL_NAME", default = "") + val MethodFullName = flatgraph.SinglePropertyKey[String](kind = 36, name = "METHOD_FULL_NAME", default = "") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -178,36 +178,36 @@ object Call { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) /** Similar to `DYNAMIC_TYPE_HINT_FULL_NAME`, but that this makes no guarantee that types within this property are * correct. This property is used to capture observations between node interactions during a 'may-analysis'. */ - val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 49, name = "POSSIBLE_TYPES") + val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 44, name = "POSSIBLE_TYPES") /** The method signature encodes the types of parameters in a string. The string SHOULD be human readable and * suitable for differentiating methods with different parameter types sufficiently to allow for resolving of * function overloading. The present specification does not enforce a strict format for the signature, that is, it * can be chosen by the frontend implementor to fit the source language. */ - val Signature = flatgraph.SinglePropertyKey[String](kind = 51, name = "SIGNATURE", default = "") + val Signature = flatgraph.SinglePropertyKey[String](kind = 46, name = "SIGNATURE", default = "") /** This field contains the fully-qualified static type name of the program construct represented by a node. It is * the name of an instantiated type, e.g., `java.util.List`, rather than `java.util.List[T]`. If the type * cannot be determined, this field should be set to the empty string. */ - val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 54, name = "TYPE_FULL_NAME", default = "") + val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 48, name = "TYPE_FULL_NAME", default = "") } object PropertyDefaults { val ArgumentIndex = -1: Int @@ -1964,19 +1964,19 @@ class NewCall extends NewNode(7.toShort) with CallBase with CallReprNew with Exp override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { interface.countProperty(this, 1, 1) interface.countProperty(this, 2, argumentName.size) - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 17, 1) - interface.countProperty(this, 18, dynamicTypeHintFullName.size) - interface.countProperty(this, 36, lineNumber.size) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 15, 1) + interface.countProperty(this, 16, dynamicTypeHintFullName.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 36, 1) interface.countProperty(this, 38, 1) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) interface.countProperty(this, 41, 1) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) - interface.countProperty(this, 49, possibleTypes.size) - interface.countProperty(this, 51, 1) - interface.countProperty(this, 54, 1) + interface.countProperty(this, 44, possibleTypes.size) + interface.countProperty(this, 46, 1) + interface.countProperty(this, 48, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/ClosureBinding.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/ClosureBinding.scala index 00ac404a6..89e0d5983 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/ClosureBinding.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/ClosureBinding.scala @@ -50,10 +50,10 @@ object ClosureBinding { /** Identifier which uniquely describes a CLOSURE_BINDING. This property is used to match captured LOCAL nodes with * the corresponding CLOSURE_BINDING nodes */ - val ClosureBindingId = flatgraph.OptionalPropertyKey[String](kind = 8, name = "CLOSURE_BINDING_ID") + val ClosureBindingId = flatgraph.OptionalPropertyKey[String](kind = 6, name = "CLOSURE_BINDING_ID") /** The original name of the (potentially mangled) captured variable */ - val ClosureOriginalName = flatgraph.OptionalPropertyKey[String](kind = 9, name = "CLOSURE_ORIGINAL_NAME") + val ClosureOriginalName = flatgraph.OptionalPropertyKey[String](kind = 7, name = "CLOSURE_ORIGINAL_NAME") /** For formal method input parameters, output parameters, and return parameters, this field holds the evaluation * strategy, which is one of the following: 1) `BY_REFERENCE` indicates that the parameter is passed by reference, @@ -62,7 +62,7 @@ object ClosureBinding { * object that it points to is not made. */ val EvaluationStrategy = - flatgraph.SinglePropertyKey[String](kind = 19, name = "EVALUATION_STRATEGY", default = "") + flatgraph.SinglePropertyKey[String](kind = 17, name = "EVALUATION_STRATEGY", default = "") } object PropertyDefaults { val EvaluationStrategy = "" @@ -209,9 +209,9 @@ class NewClosureBinding extends NewNode(8.toShort) with ClosureBindingBase { def closureOriginalName(value: String): this.type = { this.closureOriginalName = Option(value); this } def evaluationStrategy(value: String): this.type = { this.evaluationStrategy = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 8, closureBindingId.size) - interface.countProperty(this, 9, closureOriginalName.size) - interface.countProperty(this, 19, 1) + interface.countProperty(this, 6, closureBindingId.size) + interface.countProperty(this, 7, closureOriginalName.size) + interface.countProperty(this, 17, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Comment.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Comment.scala index 2609f6491..1a7f6c1ad 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Comment.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Comment.scala @@ -69,22 +69,22 @@ object Comment { object Properties { /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** The path of the source file this node was generated from, relative to the root path in the meta data node. This * field must be set but may be set to the value `` to indicate that no source file can be associated with * the node, e.g., because the node represents an entity known to exist because it is referenced, but for which the * file that is is declared in is unknown. */ - val Filename = flatgraph.SinglePropertyKey[String](kind = 22, name = "FILENAME", default = "") + val Filename = flatgraph.SinglePropertyKey[String](kind = 20, name = "FILENAME", default = "") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -92,18 +92,18 @@ object Comment { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) } object PropertyDefaults { val Code = "" @@ -1609,13 +1609,13 @@ class NewComment extends NewNode(9.toShort) with CommentBase with AstNodeNew { def offsetEnd(value: Option[Int]): this.type = { this.offsetEnd = value; this } def order(value: Int): this.type = { this.order = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 22, 1) - interface.countProperty(this, 36, lineNumber.size) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 20, 1) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) + interface.countProperty(this, 41, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/ConfigFile.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/ConfigFile.scala index 32cab4c37..e28d014df 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/ConfigFile.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/ConfigFile.scala @@ -37,10 +37,10 @@ object ConfigFile { /** Certain files, e.g., configuration files, may be included in the CPG as-is. For such files, the `CONTENT` field * contains the files content. */ - val Content = flatgraph.SinglePropertyKey[String](kind = 14, name = "CONTENT", default = "") + val Content = flatgraph.SinglePropertyKey[String](kind = 12, name = "CONTENT", default = "") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") } object PropertyDefaults { val Content = "" @@ -148,8 +148,8 @@ class NewConfigFile extends NewNode(10.toShort) with ConfigFileBase { def content(value: String): this.type = { this.content = value; this } def name(value: String): this.type = { this.name = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 14, 1) - interface.countProperty(this, 41, 1) + interface.countProperty(this, 12, 1) + interface.countProperty(this, 38, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/ControlStructure.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/ControlStructure.scala index feba44416..43843179c 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/ControlStructure.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/ControlStructure.scala @@ -102,22 +102,22 @@ object ControlStructure { val ArgumentName = flatgraph.OptionalPropertyKey[String](kind = 2, name = "ARGUMENT_NAME") /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** The `CONTROL_STRUCTURE_TYPE` field indicates which kind of control structure a `CONTROL_STRUCTURE` node * represents. The available types are the following: BREAK, CONTINUE, DO, WHILE, FOR, GOTO, IF, ELSE, TRY, THROW * and SWITCH. */ val ControlStructureType = - flatgraph.SinglePropertyKey[String](kind = 15, name = "CONTROL_STRUCTURE_TYPE", default = "") + flatgraph.SinglePropertyKey[String](kind = 13, name = "CONTROL_STRUCTURE_TYPE", default = "") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -125,21 +125,21 @@ object ControlStructure { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) /** AST node type name emitted by parser. */ - val ParserTypeName = flatgraph.SinglePropertyKey[String](kind = 48, name = "PARSER_TYPE_NAME", default = "") + val ParserTypeName = flatgraph.SinglePropertyKey[String](kind = 43, name = "PARSER_TYPE_NAME", default = "") } object PropertyDefaults { val ArgumentIndex = -1: Int @@ -1741,14 +1741,14 @@ class NewControlStructure extends NewNode(11.toShort) with ControlStructureBase override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { interface.countProperty(this, 1, 1) interface.countProperty(this, 2, argumentName.size) - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 15, 1) - interface.countProperty(this, 36, lineNumber.size) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) - interface.countProperty(this, 48, 1) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 13, 1) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) + interface.countProperty(this, 41, 1) + interface.countProperty(this, 43, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Dependency.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Dependency.scala index bc5876c82..c34f5495b 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Dependency.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Dependency.scala @@ -39,15 +39,15 @@ object Dependency { object Properties { /** The group ID for a dependency */ - val DependencyGroupId = flatgraph.OptionalPropertyKey[String](kind = 16, name = "DEPENDENCY_GROUP_ID") + val DependencyGroupId = flatgraph.OptionalPropertyKey[String](kind = 14, name = "DEPENDENCY_GROUP_ID") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** A version, given as a string. Used, for example, in the META_DATA node to indicate which version of the CPG spec * this CPG conforms to */ - val Version = flatgraph.SinglePropertyKey[String](kind = 56, name = "VERSION", default = "") + val Version = flatgraph.SinglePropertyKey[String](kind = 50, name = "VERSION", default = "") } object PropertyDefaults { val Name = "" @@ -189,9 +189,9 @@ class NewDependency extends NewNode(12.toShort) with DependencyBase { def name(value: String): this.type = { this.name = value; this } def version(value: String): this.type = { this.version = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 16, dependencyGroupId.size) - interface.countProperty(this, 41, 1) - interface.countProperty(this, 56, 1) + interface.countProperty(this, 14, dependencyGroupId.size) + interface.countProperty(this, 38, 1) + interface.countProperty(this, 50, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/FieldIdentifier.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/FieldIdentifier.scala index ad34999b1..cb43f8510 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/FieldIdentifier.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/FieldIdentifier.scala @@ -108,15 +108,15 @@ object FieldIdentifier { val CanonicalName = flatgraph.SinglePropertyKey[String](kind = 5, name = "CANONICAL_NAME", default = "") /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -124,18 +124,18 @@ object FieldIdentifier { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) } object PropertyDefaults { val ArgumentIndex = -1: Int @@ -1708,12 +1708,12 @@ class NewFieldIdentifier extends NewNode(13.toShort) with FieldIdentifierBase wi interface.countProperty(this, 1, 1) interface.countProperty(this, 2, argumentName.size) interface.countProperty(this, 5, 1) - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 36, lineNumber.size) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) + interface.countProperty(this, 41, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/File.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/File.scala index e7907f19b..c1017cb89 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/File.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/File.scala @@ -79,30 +79,30 @@ object File { object Properties { /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** Certain files, e.g., configuration files, may be included in the CPG as-is. For such files, the `CONTENT` field * contains the files content. */ - val Content = flatgraph.SinglePropertyKey[String](kind = 14, name = "CONTENT", default = "") + val Content = flatgraph.SinglePropertyKey[String](kind = 12, name = "CONTENT", default = "") /** This property contains a hash value in the form of a string. Hashes can be used to summarize data, e.g., to * summarize the contents of source files or sub graphs. Such summaries are useful to determine whether code has * already been analyzed in incremental analysis pipelines. This property is optional to allow its calculation to * be deferred or skipped if the hash is not needed. */ - val Hash = flatgraph.OptionalPropertyKey[String](kind = 25, name = "HASH") + val Hash = flatgraph.OptionalPropertyKey[String](kind = 23, name = "HASH") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -110,18 +110,18 @@ object File { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) } object PropertyDefaults { val Code = "" @@ -1691,15 +1691,15 @@ class NewFile extends NewNode(14.toShort) with FileBase with AstNodeNew { def offsetEnd(value: Option[Int]): this.type = { this.offsetEnd = value; this } def order(value: Int): this.type = { this.order = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 14, 1) - interface.countProperty(this, 25, hash.size) - interface.countProperty(this, 36, lineNumber.size) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 12, 1) + interface.countProperty(this, 23, hash.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 38, 1) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) interface.countProperty(this, 41, 1) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Finding.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Finding.scala index cace6b750..7d81e4164 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Finding.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Finding.scala @@ -39,7 +39,7 @@ object Finding { /** Optional description for nodes in evidence. Used to give a hint about the kind of evidence provided by a node. * The evidence description and evidence nodes are associated by index. */ - val EvidenceDescription = flatgraph.MultiPropertyKey[String](kind = 20, name = "EVIDENCE_DESCRIPTION") + val EvidenceDescription = flatgraph.MultiPropertyKey[String](kind = 18, name = "EVIDENCE_DESCRIPTION") } object PropertyDefaults {} } @@ -48,9 +48,9 @@ class Finding(graph_4762: flatgraph.Graph, seq_4762: Int) extends StoredNode(graph_4762, 15.toShort, seq_4762) with FindingBase with StaticType[FindingEMT] { - def evidence: IndexedSeq[StoredNode] = flatgraph.Accessors.getNodePropertyMulti[StoredNode](graph, nodeKind, 57, seq) + def evidence: IndexedSeq[StoredNode] = flatgraph.Accessors.getNodePropertyMulti[StoredNode](graph, nodeKind, 51, seq) def keyValuePairs: IndexedSeq[KeyValuePair] = - flatgraph.Accessors.getNodePropertyMulti[KeyValuePair](graph, nodeKind, 58, seq) + flatgraph.Accessors.getNodePropertyMulti[KeyValuePair](graph, nodeKind, 52, seq) override def productElementName(n: Int): String = n match { @@ -192,10 +192,10 @@ class NewFinding extends NewNode(15.toShort) with FindingBase { this.keyValuePairs = value.iterator.to(ArraySeq); this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 20, evidenceDescription.size) - interface.countProperty(this, 57, evidence.size) + interface.countProperty(this, 18, evidenceDescription.size) + interface.countProperty(this, 51, evidence.size) evidence.foreach(interface.visitContainedNode) - interface.countProperty(this, 58, keyValuePairs.size) + interface.countProperty(this, 52, keyValuePairs.size) keyValuePairs.foreach(interface.visitContainedNode) } diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Identifier.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Identifier.scala index 91eed17ba..32b278d38 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Identifier.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Identifier.scala @@ -120,21 +120,21 @@ object Identifier { val ArgumentName = flatgraph.OptionalPropertyKey[String](kind = 2, name = "ARGUMENT_NAME") /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** Type hint for the dynamic type. These are observed to be verifiable at runtime. */ - val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 18, name = "DYNAMIC_TYPE_HINT_FULL_NAME") + val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 16, name = "DYNAMIC_TYPE_HINT_FULL_NAME") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -142,29 +142,29 @@ object Identifier { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) /** Similar to `DYNAMIC_TYPE_HINT_FULL_NAME`, but that this makes no guarantee that types within this property are * correct. This property is used to capture observations between node interactions during a 'may-analysis'. */ - val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 49, name = "POSSIBLE_TYPES") + val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 44, name = "POSSIBLE_TYPES") /** This field contains the fully-qualified static type name of the program construct represented by a node. It is * the name of an instantiated type, e.g., `java.util.List`, rather than `java.util.List[T]`. If the type * cannot be determined, this field should be set to the empty string. */ - val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 54, name = "TYPE_FULL_NAME", default = "") + val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 48, name = "TYPE_FULL_NAME", default = "") } object PropertyDefaults { val ArgumentIndex = -1: Int @@ -1830,16 +1830,16 @@ class NewIdentifier extends NewNode(16.toShort) with IdentifierBase with Express override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { interface.countProperty(this, 1, 1) interface.countProperty(this, 2, argumentName.size) - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 18, dynamicTypeHintFullName.size) - interface.countProperty(this, 36, lineNumber.size) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 16, dynamicTypeHintFullName.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 38, 1) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) interface.countProperty(this, 41, 1) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) - interface.countProperty(this, 49, possibleTypes.size) - interface.countProperty(this, 54, 1) + interface.countProperty(this, 44, possibleTypes.size) + interface.countProperty(this, 48, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Import.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Import.scala index 36438795f..4ba62a28b 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Import.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Import.scala @@ -100,42 +100,42 @@ object Import { object Properties { /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** Specifies whether the IMPORTED_AS property was explicitly present in the code. For languages like Java which do * not allow a renaming during import this is always false. For e.g. Kotlin it depends on the existence of the "as" * keyword. */ - val ExplicitAs = flatgraph.OptionalPropertyKey[Boolean](kind = 21, name = "EXPLICIT_AS") + val ExplicitAs = flatgraph.OptionalPropertyKey[Boolean](kind = 19, name = "EXPLICIT_AS") /** The identifier under which the import can be accessed in the importing context. For a Java import this is always * identical to the class name. But e.g. for a Kotlin import like "import java.nio.ByteBuffer as BBuffer" this * would be "BBuffer". This property is ignored if IS_WILDCARD is true. */ - val ImportedAs = flatgraph.OptionalPropertyKey[String](kind = 26, name = "IMPORTED_AS") + val ImportedAs = flatgraph.OptionalPropertyKey[String](kind = 24, name = "IMPORTED_AS") /** The identifying string of the imported entity. For a Java import like "import java.nio.ByteBuffer;" this would * be "java.nio.ByteBuffer". */ - val ImportedEntity = flatgraph.OptionalPropertyKey[String](kind = 27, name = "IMPORTED_ENTITY") + val ImportedEntity = flatgraph.OptionalPropertyKey[String](kind = 25, name = "IMPORTED_ENTITY") /** Specifies whether this is an explicit import. Most languages have implicit default imports of some standard * library elements and this flag is used to distinguish those from explicit imports found in the code base. */ - val IsExplicit = flatgraph.OptionalPropertyKey[Boolean](kind = 30, name = "IS_EXPLICIT") + val IsExplicit = flatgraph.OptionalPropertyKey[Boolean](kind = 28, name = "IS_EXPLICIT") /** Specifies whether this is a wildcard import. For a Java import like "import java.nio.*;" IS_WILDCARD would be * "true" and IMPORTED_ENTITY would be "java.nio". For wildcard imports the IMPORTED_AS property is ignored. */ - val IsWildcard = flatgraph.OptionalPropertyKey[Boolean](kind = 33, name = "IS_WILDCARD") + val IsWildcard = flatgraph.OptionalPropertyKey[Boolean](kind = 31, name = "IS_WILDCARD") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -143,18 +143,18 @@ object Import { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) } object PropertyDefaults { val Code = "" @@ -1800,17 +1800,17 @@ class NewImport extends NewNode(17.toShort) with ImportBase with AstNodeNew { def offsetEnd(value: Option[Int]): this.type = { this.offsetEnd = value; this } def order(value: Int): this.type = { this.order = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 21, explicitAs.size) - interface.countProperty(this, 26, importedAs.size) - interface.countProperty(this, 27, importedEntity.size) - interface.countProperty(this, 30, isExplicit.size) - interface.countProperty(this, 33, isWildcard.size) - interface.countProperty(this, 36, lineNumber.size) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 19, explicitAs.size) + interface.countProperty(this, 24, importedAs.size) + interface.countProperty(this, 25, importedEntity.size) + interface.countProperty(this, 28, isExplicit.size) + interface.countProperty(this, 31, isWildcard.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) + interface.countProperty(this, 41, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/JumpLabel.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/JumpLabel.scala index 5eebe52d3..e93013927 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/JumpLabel.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/JumpLabel.scala @@ -69,18 +69,18 @@ object JumpLabel { object Properties { /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -88,21 +88,21 @@ object JumpLabel { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) /** AST node type name emitted by parser. */ - val ParserTypeName = flatgraph.SinglePropertyKey[String](kind = 48, name = "PARSER_TYPE_NAME", default = "") + val ParserTypeName = flatgraph.SinglePropertyKey[String](kind = 43, name = "PARSER_TYPE_NAME", default = "") } object PropertyDefaults { val Code = "" @@ -1638,14 +1638,14 @@ class NewJumpLabel extends NewNode(18.toShort) with JumpLabelBase with AstNodeNe def order(value: Int): this.type = { this.order = value; this } def parserTypeName(value: String): this.type = { this.parserTypeName = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 36, lineNumber.size) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 38, 1) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) interface.countProperty(this, 41, 1) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) - interface.countProperty(this, 48, 1) + interface.countProperty(this, 43, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/JumpTarget.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/JumpTarget.scala index a1be403e8..cad564f22 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/JumpTarget.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/JumpTarget.scala @@ -88,18 +88,18 @@ object JumpTarget { val ArgumentIndex = flatgraph.SinglePropertyKey[Int](kind = 1, name = "ARGUMENT_INDEX", default = -1: Int) /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -107,21 +107,21 @@ object JumpTarget { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) /** AST node type name emitted by parser. */ - val ParserTypeName = flatgraph.SinglePropertyKey[String](kind = 48, name = "PARSER_TYPE_NAME", default = "") + val ParserTypeName = flatgraph.SinglePropertyKey[String](kind = 43, name = "PARSER_TYPE_NAME", default = "") } object PropertyDefaults { val ArgumentIndex = -1: Int @@ -1688,14 +1688,14 @@ class NewJumpTarget extends NewNode(19.toShort) with JumpTargetBase with AstNode def parserTypeName(value: String): this.type = { this.parserTypeName = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { interface.countProperty(this, 1, 1) - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 36, lineNumber.size) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 38, 1) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) interface.countProperty(this, 41, 1) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) - interface.countProperty(this, 48, 1) + interface.countProperty(this, 43, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/KeyValuePair.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/KeyValuePair.scala index 72763a092..c5b022e1d 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/KeyValuePair.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/KeyValuePair.scala @@ -33,10 +33,10 @@ object KeyValuePair { object Properties { /** This property denotes a key of a key-value pair. */ - val Key = flatgraph.SinglePropertyKey[String](kind = 34, name = "KEY", default = "") + val Key = flatgraph.SinglePropertyKey[String](kind = 32, name = "KEY", default = "") /** This property denotes a string value as used in a key-value pair. */ - val Value = flatgraph.SinglePropertyKey[String](kind = 55, name = "VALUE", default = "") + val Value = flatgraph.SinglePropertyKey[String](kind = 49, name = "VALUE", default = "") } object PropertyDefaults { val Key = "" @@ -144,8 +144,8 @@ class NewKeyValuePair extends NewNode(20.toShort) with KeyValuePairBase { def key(value: String): this.type = { this.key = value; this } def value(value: String): this.type = { this.value = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 34, 1) - interface.countProperty(this, 55, 1) + interface.countProperty(this, 32, 1) + interface.countProperty(this, 49, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Literal.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Literal.scala index 94dc369ad..95a6ff7cd 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Literal.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Literal.scala @@ -115,18 +115,18 @@ object Literal { val ArgumentName = flatgraph.OptionalPropertyKey[String](kind = 2, name = "ARGUMENT_NAME") /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** Type hint for the dynamic type. These are observed to be verifiable at runtime. */ - val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 18, name = "DYNAMIC_TYPE_HINT_FULL_NAME") + val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 16, name = "DYNAMIC_TYPE_HINT_FULL_NAME") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -134,29 +134,29 @@ object Literal { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) /** Similar to `DYNAMIC_TYPE_HINT_FULL_NAME`, but that this makes no guarantee that types within this property are * correct. This property is used to capture observations between node interactions during a 'may-analysis'. */ - val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 49, name = "POSSIBLE_TYPES") + val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 44, name = "POSSIBLE_TYPES") /** This field contains the fully-qualified static type name of the program construct represented by a node. It is * the name of an instantiated type, e.g., `java.util.List`, rather than `java.util.List[T]`. If the type * cannot be determined, this field should be set to the empty string. */ - val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 54, name = "TYPE_FULL_NAME", default = "") + val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 48, name = "TYPE_FULL_NAME", default = "") } object PropertyDefaults { val ArgumentIndex = -1: Int @@ -1792,15 +1792,15 @@ class NewLiteral extends NewNode(21.toShort) with LiteralBase with ExpressionNew override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { interface.countProperty(this, 1, 1) interface.countProperty(this, 2, argumentName.size) - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 18, dynamicTypeHintFullName.size) - interface.countProperty(this, 36, lineNumber.size) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) - interface.countProperty(this, 49, possibleTypes.size) - interface.countProperty(this, 54, 1) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 16, dynamicTypeHintFullName.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) + interface.countProperty(this, 41, 1) + interface.countProperty(this, 44, possibleTypes.size) + interface.countProperty(this, 48, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Local.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Local.scala index 62f8c7f94..fbdcec47f 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Local.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Local.scala @@ -107,31 +107,31 @@ object Local { /** Identifier which uniquely describes a CLOSURE_BINDING. This property is used to match captured LOCAL nodes with * the corresponding CLOSURE_BINDING nodes */ - val ClosureBindingId = flatgraph.OptionalPropertyKey[String](kind = 8, name = "CLOSURE_BINDING_ID") + val ClosureBindingId = flatgraph.OptionalPropertyKey[String](kind = 6, name = "CLOSURE_BINDING_ID") /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** Type hint for the dynamic type. These are observed to be verifiable at runtime. */ - val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 18, name = "DYNAMIC_TYPE_HINT_FULL_NAME") + val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 16, name = "DYNAMIC_TYPE_HINT_FULL_NAME") /** This field is experimental. It will likely be removed in the future without any notice. It stores type * information for generic types and methods as well as type information for members and locals where the type * either contains a type parameter reference or an instantiated type reference. */ val GenericSignature = - flatgraph.SinglePropertyKey[String](kind = 24, name = "GENERIC_SIGNATURE", default = "") + flatgraph.SinglePropertyKey[String](kind = 22, name = "GENERIC_SIGNATURE", default = "") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -139,29 +139,29 @@ object Local { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) /** Similar to `DYNAMIC_TYPE_HINT_FULL_NAME`, but that this makes no guarantee that types within this property are * correct. This property is used to capture observations between node interactions during a 'may-analysis'. */ - val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 49, name = "POSSIBLE_TYPES") + val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 44, name = "POSSIBLE_TYPES") /** This field contains the fully-qualified static type name of the program construct represented by a node. It is * the name of an instantiated type, e.g., `java.util.List`, rather than `java.util.List[T]`. If the type * cannot be determined, this field should be set to the empty string. */ - val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 54, name = "TYPE_FULL_NAME", default = "") + val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 48, name = "TYPE_FULL_NAME", default = "") } object PropertyDefaults { val Code = "" @@ -1826,18 +1826,18 @@ class NewLocal extends NewNode(22.toShort) with LocalBase with AstNodeNew with D def possibleTypes(value: IterableOnce[String]): this.type = { this.possibleTypes = value.iterator.to(ArraySeq); this } def typeFullName(value: String): this.type = { this.typeFullName = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 8, closureBindingId.size) - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 18, dynamicTypeHintFullName.size) - interface.countProperty(this, 24, 1) - interface.countProperty(this, 36, lineNumber.size) + interface.countProperty(this, 6, closureBindingId.size) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 16, dynamicTypeHintFullName.size) + interface.countProperty(this, 22, 1) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 38, 1) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) interface.countProperty(this, 41, 1) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) - interface.countProperty(this, 49, possibleTypes.size) - interface.countProperty(this, 54, 1) + interface.countProperty(this, 44, possibleTypes.size) + interface.countProperty(this, 48, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Location.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Location.scala deleted file mode 100644 index 18597e279..000000000 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Location.scala +++ /dev/null @@ -1,566 +0,0 @@ -package io.shiftleft.codepropertygraph.generated.nodes - -import io.shiftleft.codepropertygraph.generated.language.* -import scala.collection.immutable.{IndexedSeq, ArraySeq} -import scala.collection.mutable - -/** Node base type for compiletime-only checks to improve type safety. EMT stands for: "erased marker trait", i.e. it is - * erased at runtime - */ -trait LocationEMT - extends AnyRef - with HasClassNameEMT - with HasClassShortNameEMT - with HasColumnNumberEMT - with HasFilenameEMT - with HasLineNumberEMT - with HasMethodFullNameEMT - with HasMethodShortNameEMT - with HasNodeLabelEMT - with HasPackageNameEMT - with HasSymbolEMT - -trait LocationBase extends AbstractNode with StaticType[LocationEMT] { - def node: Option[AbstractNode] - override def propertiesMap: java.util.Map[String, Any] = { - import io.shiftleft.codepropertygraph.generated.accessors.languagebootstrap.* - val res = new java.util.HashMap[String, Any]() - if (("": String) != this.className) res.put("CLASS_NAME", this.className) - if (("": String) != this.classShortName) res.put("CLASS_SHORT_NAME", this.classShortName) - this.columnNumber.foreach { p => res.put("COLUMN_NUMBER", p) } - if (("": String) != this.filename) res.put("FILENAME", this.filename) - this.lineNumber.foreach { p => res.put("LINE_NUMBER", p) } - if (("": String) != this.methodFullName) res.put("METHOD_FULL_NAME", this.methodFullName) - if (("": String) != this.methodShortName) res.put("METHOD_SHORT_NAME", this.methodShortName) - if (("": String) != this.nodeLabel) res.put("NODE_LABEL", this.nodeLabel) - if (("": String) != this.packageName) res.put("PACKAGE_NAME", this.packageName) - if (("": String) != this.symbol) res.put("SYMBOL", this.symbol) - this.node.foreach { p => res.put("node", p) } - res - } -} - -object Location { - val Label = "LOCATION" - object PropertyNames { - - val ClassName = "CLASS_NAME" - - val ClassShortName = "CLASS_SHORT_NAME" - - /** This optional fields provides the column number of the program construct represented by the node. - */ - val ColumnNumber = "COLUMN_NUMBER" - - /** The path of the source file this node was generated from, relative to the root path in the meta data node. This - * field must be set but may be set to the value `` to indicate that no source file can be associated with - * the node, e.g., because the node represents an entity known to exist because it is referenced, but for which the - * file that is is declared in is unknown. - */ - val Filename = "FILENAME" - - /** This optional field provides the line number of the program construct represented by the node. - */ - val LineNumber = "LINE_NUMBER" - - /** The FULL_NAME of a method. Used to link CALL and METHOD nodes. It is required to have exactly one METHOD node - * for each METHOD_FULL_NAME - */ - val MethodFullName = "METHOD_FULL_NAME" - - val MethodShortName = "METHOD_SHORT_NAME" - - val NodeLabel = "NODE_LABEL" - - val PackageName = "PACKAGE_NAME" - - val Symbol = "SYMBOL" - val Node = "node" - } - object Properties { - val ClassName = flatgraph.SinglePropertyKey[String](kind = 6, name = "CLASS_NAME", default = "") - val ClassShortName = flatgraph.SinglePropertyKey[String](kind = 7, name = "CLASS_SHORT_NAME", default = "") - - /** This optional fields provides the column number of the program construct represented by the node. - */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") - - /** The path of the source file this node was generated from, relative to the root path in the meta data node. This - * field must be set but may be set to the value `` to indicate that no source file can be associated with - * the node, e.g., because the node represents an entity known to exist because it is referenced, but for which the - * file that is is declared in is unknown. - */ - val Filename = flatgraph.SinglePropertyKey[String](kind = 22, name = "FILENAME", default = "") - - /** This optional field provides the line number of the program construct represented by the node. - */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") - - /** The FULL_NAME of a method. Used to link CALL and METHOD nodes. It is required to have exactly one METHOD node - * for each METHOD_FULL_NAME - */ - val MethodFullName = flatgraph.SinglePropertyKey[String](kind = 38, name = "METHOD_FULL_NAME", default = "") - val MethodShortName = - flatgraph.SinglePropertyKey[String](kind = 39, name = "METHOD_SHORT_NAME", default = "") - val NodeLabel = flatgraph.SinglePropertyKey[String](kind = 42, name = "NODE_LABEL", default = "") - val PackageName = flatgraph.SinglePropertyKey[String](kind = 47, name = "PACKAGE_NAME", default = "") - val Symbol = flatgraph.SinglePropertyKey[String](kind = 52, name = "SYMBOL", default = "") - } - object PropertyDefaults { - val ClassName = "" - val ClassShortName = "" - val Filename = "" - val MethodFullName = "" - val MethodShortName = "" - val NodeLabel = "" - val PackageName = "" - val Symbol = "" - } -} - -class Location(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 23.toShort, seq_4762) - with LocationBase - with StaticType[LocationEMT] { - def node: Option[StoredNode] = flatgraph.Accessors.getNodePropertyOption[StoredNode](graph, nodeKind, 59, seq) - - override def productElementName(n: Int): String = - n match { - case 0 => "className" - case 1 => "classShortName" - case 2 => "columnNumber" - case 3 => "filename" - case 4 => "lineNumber" - case 5 => "methodFullName" - case 6 => "methodShortName" - case 7 => "nodeLabel" - case 8 => "packageName" - case 9 => "symbol" - case 10 => "node" - case _ => "" - } - - override def productElement(n: Int): Any = - n match { - case 0 => this.className - case 1 => this.classShortName - case 2 => this.columnNumber - case 3 => this.filename - case 4 => this.lineNumber - case 5 => this.methodFullName - case 6 => this.methodShortName - case 7 => this.nodeLabel - case 8 => this.packageName - case 9 => this.symbol - case 10 => this.node - case _ => null - } - - override def productPrefix = "Location" - override def productArity = 11 - - override def canEqual(that: Any): Boolean = that != null && that.isInstanceOf[Location] -} - -object NewLocation { - def apply(): NewLocation = new NewLocation - private val outNeighbors: Map[String, Set[String]] = Map() - private val inNeighbors: Map[String, Set[String]] = Map() - - object InsertionHelpers { - object NewNodeInserter_Location_className extends flatgraph.NewNodePropertyInsertionHelper { - override def insertNewNodeProperties( - newNodes: mutable.ArrayBuffer[flatgraph.DNode], - dst: AnyRef, - offsets: Array[Int] - ): Unit = { - if (newNodes.isEmpty) return - val dstCast = dst.asInstanceOf[Array[String]] - val seq = newNodes.head.storedRef.get.seq() - var offset = offsets(seq) - var idx = 0 - while (idx < newNodes.length) { - val nn = newNodes(idx) - nn match { - case generated: NewLocation => - dstCast(offset) = generated.className - offset += 1 - case _ => - } - assert(seq + idx == nn.storedRef.get.seq(), "internal consistency check") - idx += 1 - offsets(idx + seq) = offset - } - } - } - object NewNodeInserter_Location_classShortName extends flatgraph.NewNodePropertyInsertionHelper { - override def insertNewNodeProperties( - newNodes: mutable.ArrayBuffer[flatgraph.DNode], - dst: AnyRef, - offsets: Array[Int] - ): Unit = { - if (newNodes.isEmpty) return - val dstCast = dst.asInstanceOf[Array[String]] - val seq = newNodes.head.storedRef.get.seq() - var offset = offsets(seq) - var idx = 0 - while (idx < newNodes.length) { - val nn = newNodes(idx) - nn match { - case generated: NewLocation => - dstCast(offset) = generated.classShortName - offset += 1 - case _ => - } - assert(seq + idx == nn.storedRef.get.seq(), "internal consistency check") - idx += 1 - offsets(idx + seq) = offset - } - } - } - object NewNodeInserter_Location_columnNumber extends flatgraph.NewNodePropertyInsertionHelper { - override def insertNewNodeProperties( - newNodes: mutable.ArrayBuffer[flatgraph.DNode], - dst: AnyRef, - offsets: Array[Int] - ): Unit = { - if (newNodes.isEmpty) return - val dstCast = dst.asInstanceOf[Array[Int]] - val seq = newNodes.head.storedRef.get.seq() - var offset = offsets(seq) - var idx = 0 - while (idx < newNodes.length) { - val nn = newNodes(idx) - nn match { - case generated: NewLocation => - generated.columnNumber match { - case Some(item) => - dstCast(offset) = item - offset += 1 - case _ => - } - case _ => - } - assert(seq + idx == nn.storedRef.get.seq(), "internal consistency check") - idx += 1 - offsets(idx + seq) = offset - } - } - } - object NewNodeInserter_Location_filename extends flatgraph.NewNodePropertyInsertionHelper { - override def insertNewNodeProperties( - newNodes: mutable.ArrayBuffer[flatgraph.DNode], - dst: AnyRef, - offsets: Array[Int] - ): Unit = { - if (newNodes.isEmpty) return - val dstCast = dst.asInstanceOf[Array[String]] - val seq = newNodes.head.storedRef.get.seq() - var offset = offsets(seq) - var idx = 0 - while (idx < newNodes.length) { - val nn = newNodes(idx) - nn match { - case generated: NewLocation => - dstCast(offset) = generated.filename - offset += 1 - case _ => - } - assert(seq + idx == nn.storedRef.get.seq(), "internal consistency check") - idx += 1 - offsets(idx + seq) = offset - } - } - } - object NewNodeInserter_Location_lineNumber extends flatgraph.NewNodePropertyInsertionHelper { - override def insertNewNodeProperties( - newNodes: mutable.ArrayBuffer[flatgraph.DNode], - dst: AnyRef, - offsets: Array[Int] - ): Unit = { - if (newNodes.isEmpty) return - val dstCast = dst.asInstanceOf[Array[Int]] - val seq = newNodes.head.storedRef.get.seq() - var offset = offsets(seq) - var idx = 0 - while (idx < newNodes.length) { - val nn = newNodes(idx) - nn match { - case generated: NewLocation => - generated.lineNumber match { - case Some(item) => - dstCast(offset) = item - offset += 1 - case _ => - } - case _ => - } - assert(seq + idx == nn.storedRef.get.seq(), "internal consistency check") - idx += 1 - offsets(idx + seq) = offset - } - } - } - object NewNodeInserter_Location_methodFullName extends flatgraph.NewNodePropertyInsertionHelper { - override def insertNewNodeProperties( - newNodes: mutable.ArrayBuffer[flatgraph.DNode], - dst: AnyRef, - offsets: Array[Int] - ): Unit = { - if (newNodes.isEmpty) return - val dstCast = dst.asInstanceOf[Array[String]] - val seq = newNodes.head.storedRef.get.seq() - var offset = offsets(seq) - var idx = 0 - while (idx < newNodes.length) { - val nn = newNodes(idx) - nn match { - case generated: NewLocation => - dstCast(offset) = generated.methodFullName - offset += 1 - case _ => - } - assert(seq + idx == nn.storedRef.get.seq(), "internal consistency check") - idx += 1 - offsets(idx + seq) = offset - } - } - } - object NewNodeInserter_Location_methodShortName extends flatgraph.NewNodePropertyInsertionHelper { - override def insertNewNodeProperties( - newNodes: mutable.ArrayBuffer[flatgraph.DNode], - dst: AnyRef, - offsets: Array[Int] - ): Unit = { - if (newNodes.isEmpty) return - val dstCast = dst.asInstanceOf[Array[String]] - val seq = newNodes.head.storedRef.get.seq() - var offset = offsets(seq) - var idx = 0 - while (idx < newNodes.length) { - val nn = newNodes(idx) - nn match { - case generated: NewLocation => - dstCast(offset) = generated.methodShortName - offset += 1 - case _ => - } - assert(seq + idx == nn.storedRef.get.seq(), "internal consistency check") - idx += 1 - offsets(idx + seq) = offset - } - } - } - object NewNodeInserter_Location_nodeLabel extends flatgraph.NewNodePropertyInsertionHelper { - override def insertNewNodeProperties( - newNodes: mutable.ArrayBuffer[flatgraph.DNode], - dst: AnyRef, - offsets: Array[Int] - ): Unit = { - if (newNodes.isEmpty) return - val dstCast = dst.asInstanceOf[Array[String]] - val seq = newNodes.head.storedRef.get.seq() - var offset = offsets(seq) - var idx = 0 - while (idx < newNodes.length) { - val nn = newNodes(idx) - nn match { - case generated: NewLocation => - dstCast(offset) = generated.nodeLabel - offset += 1 - case _ => - } - assert(seq + idx == nn.storedRef.get.seq(), "internal consistency check") - idx += 1 - offsets(idx + seq) = offset - } - } - } - object NewNodeInserter_Location_packageName extends flatgraph.NewNodePropertyInsertionHelper { - override def insertNewNodeProperties( - newNodes: mutable.ArrayBuffer[flatgraph.DNode], - dst: AnyRef, - offsets: Array[Int] - ): Unit = { - if (newNodes.isEmpty) return - val dstCast = dst.asInstanceOf[Array[String]] - val seq = newNodes.head.storedRef.get.seq() - var offset = offsets(seq) - var idx = 0 - while (idx < newNodes.length) { - val nn = newNodes(idx) - nn match { - case generated: NewLocation => - dstCast(offset) = generated.packageName - offset += 1 - case _ => - } - assert(seq + idx == nn.storedRef.get.seq(), "internal consistency check") - idx += 1 - offsets(idx + seq) = offset - } - } - } - object NewNodeInserter_Location_symbol extends flatgraph.NewNodePropertyInsertionHelper { - override def insertNewNodeProperties( - newNodes: mutable.ArrayBuffer[flatgraph.DNode], - dst: AnyRef, - offsets: Array[Int] - ): Unit = { - if (newNodes.isEmpty) return - val dstCast = dst.asInstanceOf[Array[String]] - val seq = newNodes.head.storedRef.get.seq() - var offset = offsets(seq) - var idx = 0 - while (idx < newNodes.length) { - val nn = newNodes(idx) - nn match { - case generated: NewLocation => - dstCast(offset) = generated.symbol - offset += 1 - case _ => - } - assert(seq + idx == nn.storedRef.get.seq(), "internal consistency check") - idx += 1 - offsets(idx + seq) = offset - } - } - } - object NewNodeInserter_Location_node extends flatgraph.NewNodePropertyInsertionHelper { - override def insertNewNodeProperties( - newNodes: mutable.ArrayBuffer[flatgraph.DNode], - dst: AnyRef, - offsets: Array[Int] - ): Unit = { - if (newNodes.isEmpty) return - val dstCast = dst.asInstanceOf[Array[flatgraph.GNode]] - val seq = newNodes.head.storedRef.get.seq() - var offset = offsets(seq) - var idx = 0 - while (idx < newNodes.length) { - val nn = newNodes(idx) - nn match { - case generated: NewLocation => - generated.node match { - case Some(item) => - dstCast(offset) = item match { - case newV: flatgraph.DNode => newV.storedRef.get; case oldV: flatgraph.GNode => oldV; - case null => null - } - offset += 1 - case _ => - } - case _ => - } - assert(seq + idx == nn.storedRef.get.seq(), "internal consistency check") - idx += 1 - offsets(idx + seq) = offset - } - } - } - } -} - -class NewLocation extends NewNode(23.toShort) with LocationBase { - override type StoredNodeType = Location - override def label: String = "LOCATION" - - override def isValidOutNeighbor(edgeLabel: String, n: NewNode): Boolean = { - NewLocation.outNeighbors.getOrElse(edgeLabel, Set.empty).contains(n.label) - } - override def isValidInNeighbor(edgeLabel: String, n: NewNode): Boolean = { - NewLocation.inNeighbors.getOrElse(edgeLabel, Set.empty).contains(n.label) - } - - var className: String = "": String - var classShortName: String = "": String - var columnNumber: Option[Int] = None - var filename: String = "": String - var lineNumber: Option[Int] = None - var methodFullName: String = "": String - var methodShortName: String = "": String - var node: Option[AbstractNode] = None - var nodeLabel: String = "": String - var packageName: String = "": String - var symbol: String = "": String - def className(value: String): this.type = { this.className = value; this } - def classShortName(value: String): this.type = { this.classShortName = value; this } - def columnNumber(value: Int): this.type = { this.columnNumber = Option(value); this } - def columnNumber(value: Option[Int]): this.type = { this.columnNumber = value; this } - def filename(value: String): this.type = { this.filename = value; this } - def lineNumber(value: Int): this.type = { this.lineNumber = Option(value); this } - def lineNumber(value: Option[Int]): this.type = { this.lineNumber = value; this } - def methodFullName(value: String): this.type = { this.methodFullName = value; this } - def methodShortName(value: String): this.type = { this.methodShortName = value; this } - def node(value: AbstractNode): this.type = { this.node = Option(value); this } - def node(value: Option[AbstractNode]): this.type = { this.node = value; this } - def nodeLabel(value: String): this.type = { this.nodeLabel = value; this } - def packageName(value: String): this.type = { this.packageName = value; this } - def symbol(value: String): this.type = { this.symbol = value; this } - override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 6, 1) - interface.countProperty(this, 7, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 22, 1) - interface.countProperty(this, 36, lineNumber.size) - interface.countProperty(this, 38, 1) - interface.countProperty(this, 39, 1) - interface.countProperty(this, 42, 1) - interface.countProperty(this, 47, 1) - interface.countProperty(this, 52, 1) - interface.countProperty(this, 59, node.size) - node.foreach(interface.visitContainedNode) - } - - override def copy: this.type = { - val newInstance = new NewLocation - newInstance.className = this.className - newInstance.classShortName = this.classShortName - newInstance.columnNumber = this.columnNumber - newInstance.filename = this.filename - newInstance.lineNumber = this.lineNumber - newInstance.methodFullName = this.methodFullName - newInstance.methodShortName = this.methodShortName - newInstance.nodeLabel = this.nodeLabel - newInstance.packageName = this.packageName - newInstance.symbol = this.symbol - newInstance.node = this.node - newInstance.asInstanceOf[this.type] - } - - override def productElementName(n: Int): String = - n match { - case 0 => "className" - case 1 => "classShortName" - case 2 => "columnNumber" - case 3 => "filename" - case 4 => "lineNumber" - case 5 => "methodFullName" - case 6 => "methodShortName" - case 7 => "nodeLabel" - case 8 => "packageName" - case 9 => "symbol" - case 10 => "node" - case _ => "" - } - - override def productElement(n: Int): Any = - n match { - case 0 => this.className - case 1 => this.classShortName - case 2 => this.columnNumber - case 3 => this.filename - case 4 => this.lineNumber - case 5 => this.methodFullName - case 6 => this.methodShortName - case 7 => this.nodeLabel - case 8 => this.packageName - case 9 => this.symbol - case 10 => this.node - case _ => null - } - - override def productPrefix = "NewLocation" - override def productArity = 11 - override def canEqual(that: Any): Boolean = that != null && that.isInstanceOf[NewLocation] -} diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Member.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Member.scala index e27ff72e1..b6bc9b0d3 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Member.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Member.scala @@ -119,28 +119,28 @@ object Member { val AstParentType = flatgraph.SinglePropertyKey[String](kind = 4, name = "AST_PARENT_TYPE", default = "") /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** Type hint for the dynamic type. These are observed to be verifiable at runtime. */ - val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 18, name = "DYNAMIC_TYPE_HINT_FULL_NAME") + val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 16, name = "DYNAMIC_TYPE_HINT_FULL_NAME") /** This field is experimental. It will likely be removed in the future without any notice. It stores type * information for generic types and methods as well as type information for members and locals where the type * either contains a type parameter reference or an instantiated type reference. */ val GenericSignature = - flatgraph.SinglePropertyKey[String](kind = 24, name = "GENERIC_SIGNATURE", default = "") + flatgraph.SinglePropertyKey[String](kind = 22, name = "GENERIC_SIGNATURE", default = "") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -148,29 +148,29 @@ object Member { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) /** Similar to `DYNAMIC_TYPE_HINT_FULL_NAME`, but that this makes no guarantee that types within this property are * correct. This property is used to capture observations between node interactions during a 'may-analysis'. */ - val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 49, name = "POSSIBLE_TYPES") + val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 44, name = "POSSIBLE_TYPES") /** This field contains the fully-qualified static type name of the program construct represented by a node. It is * the name of an instantiated type, e.g., `java.util.List`, rather than `java.util.List[T]`. If the type * cannot be determined, this field should be set to the empty string. */ - val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 54, name = "TYPE_FULL_NAME", default = "") + val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 48, name = "TYPE_FULL_NAME", default = "") } object PropertyDefaults { val AstParentFullName = "" @@ -184,7 +184,7 @@ object Member { } class Member(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 24.toShort, seq_4762) + extends StoredNode(graph_4762, 23.toShort, seq_4762) with MemberBase with AstNode with Declaration @@ -1817,7 +1817,7 @@ object NewMember { } } -class NewMember extends NewNode(24.toShort) with MemberBase with AstNodeNew with DeclarationNew { +class NewMember extends NewNode(23.toShort) with MemberBase with AstNodeNew with DeclarationNew { override type StoredNodeType = Member override def label: String = "MEMBER" @@ -1863,17 +1863,17 @@ class NewMember extends NewNode(24.toShort) with MemberBase with AstNodeNew with override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { interface.countProperty(this, 3, 1) interface.countProperty(this, 4, 1) - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 18, dynamicTypeHintFullName.size) - interface.countProperty(this, 24, 1) - interface.countProperty(this, 36, lineNumber.size) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 16, dynamicTypeHintFullName.size) + interface.countProperty(this, 22, 1) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 38, 1) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) interface.countProperty(this, 41, 1) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) - interface.countProperty(this, 49, possibleTypes.size) - interface.countProperty(this, 54, 1) + interface.countProperty(this, 44, possibleTypes.size) + interface.countProperty(this, 48, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/MetaData.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/MetaData.scala index eed719ec9..9e69ef504 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/MetaData.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/MetaData.scala @@ -67,27 +67,27 @@ object MetaData { * already been analyzed in incremental analysis pipelines. This property is optional to allow its calculation to * be deferred or skipped if the hash is not needed. */ - val Hash = flatgraph.OptionalPropertyKey[String](kind = 25, name = "HASH") + val Hash = flatgraph.OptionalPropertyKey[String](kind = 23, name = "HASH") /** This field indicates which CPG language frontend generated the CPG. Frontend developers may freely choose a * value that describes their frontend so long as it is not used by an existing frontend. Reserved values are to * date: C, LLVM, GHIDRA, PHP. */ - val Language = flatgraph.SinglePropertyKey[String](kind = 35, name = "LANGUAGE", default = "") + val Language = flatgraph.SinglePropertyKey[String](kind = 33, name = "LANGUAGE", default = "") /** The field contains the names of the overlays applied to this CPG, in order of their application. Names are * free-form strings, that is, this specification does not dictate them but rather requires tool producers and * consumers to communicate them between each other. */ - val Overlays = flatgraph.MultiPropertyKey[String](kind = 46, name = "OVERLAYS") + val Overlays = flatgraph.MultiPropertyKey[String](kind = 42, name = "OVERLAYS") /** The path to the root directory of the source/binary this CPG is generated from. */ - val Root = flatgraph.SinglePropertyKey[String](kind = 50, name = "ROOT", default = "") + val Root = flatgraph.SinglePropertyKey[String](kind = 45, name = "ROOT", default = "") /** A version, given as a string. Used, for example, in the META_DATA node to indicate which version of the CPG spec * this CPG conforms to */ - val Version = flatgraph.SinglePropertyKey[String](kind = 56, name = "VERSION", default = "") + val Version = flatgraph.SinglePropertyKey[String](kind = 50, name = "VERSION", default = "") } object PropertyDefaults { val Language = "" @@ -97,7 +97,7 @@ object MetaData { } class MetaData(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 25.toShort, seq_4762) + extends StoredNode(graph_4762, 24.toShort, seq_4762) with MetaDataBase with StaticType[MetaDataEMT] { @@ -267,7 +267,7 @@ object NewMetaData { } } -class NewMetaData extends NewNode(25.toShort) with MetaDataBase { +class NewMetaData extends NewNode(24.toShort) with MetaDataBase { override type StoredNodeType = MetaData override def label: String = "META_DATA" @@ -290,11 +290,11 @@ class NewMetaData extends NewNode(25.toShort) with MetaDataBase { def root(value: String): this.type = { this.root = value; this } def version(value: String): this.type = { this.version = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 25, hash.size) - interface.countProperty(this, 35, 1) - interface.countProperty(this, 46, overlays.size) + interface.countProperty(this, 23, hash.size) + interface.countProperty(this, 33, 1) + interface.countProperty(this, 42, overlays.size) + interface.countProperty(this, 45, 1) interface.countProperty(this, 50, 1) - interface.countProperty(this, 56, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Method.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Method.scala index 71dbe270c..6f783ead1 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Method.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Method.scala @@ -150,57 +150,57 @@ object Method { val AstParentType = flatgraph.SinglePropertyKey[String](kind = 4, name = "AST_PARENT_TYPE", default = "") /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** This optional fields provides the column number at which the program construct represented by the node ends. */ - val ColumnNumberEnd = flatgraph.OptionalPropertyKey[Int](kind = 12, name = "COLUMN_NUMBER_END") + val ColumnNumberEnd = flatgraph.OptionalPropertyKey[Int](kind = 10, name = "COLUMN_NUMBER_END") /** The path of the source file this node was generated from, relative to the root path in the meta data node. This * field must be set but may be set to the value `` to indicate that no source file can be associated with * the node, e.g., because the node represents an entity known to exist because it is referenced, but for which the * file that is is declared in is unknown. */ - val Filename = flatgraph.SinglePropertyKey[String](kind = 22, name = "FILENAME", default = "") + val Filename = flatgraph.SinglePropertyKey[String](kind = 20, name = "FILENAME", default = "") /** This is the fully-qualified name of an entity, e.g., the fully-qualified name of a method or type. The details * of what constitutes a fully-qualified name are language specific. This field SHOULD be human readable. */ - val FullName = flatgraph.SinglePropertyKey[String](kind = 23, name = "FULL_NAME", default = "") + val FullName = flatgraph.SinglePropertyKey[String](kind = 21, name = "FULL_NAME", default = "") /** This field is experimental. It will likely be removed in the future without any notice. It stores type * information for generic types and methods as well as type information for members and locals where the type * either contains a type parameter reference or an instantiated type reference. */ val GenericSignature = - flatgraph.SinglePropertyKey[String](kind = 24, name = "GENERIC_SIGNATURE", default = "") + flatgraph.SinglePropertyKey[String](kind = 22, name = "GENERIC_SIGNATURE", default = "") /** This property contains a hash value in the form of a string. Hashes can be used to summarize data, e.g., to * summarize the contents of source files or sub graphs. Such summaries are useful to determine whether code has * already been analyzed in incremental analysis pipelines. This property is optional to allow its calculation to * be deferred or skipped if the hash is not needed. */ - val Hash = flatgraph.OptionalPropertyKey[String](kind = 25, name = "HASH") + val Hash = flatgraph.OptionalPropertyKey[String](kind = 23, name = "HASH") /** Indicates that the construct (METHOD or TYPE_DECL) is external, that is, it is referenced but not defined in the * code (applies both to insular parsing and to library functions where we have header files only) */ - val IsExternal = flatgraph.SinglePropertyKey[Boolean](kind = 31, name = "IS_EXTERNAL", default = false) + val IsExternal = flatgraph.SinglePropertyKey[Boolean](kind = 29, name = "IS_EXTERNAL", default = false) /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** This optional fields provides the line number at which the program construct represented by the node ends. */ - val LineNumberEnd = flatgraph.OptionalPropertyKey[Int](kind = 37, name = "LINE_NUMBER_END") + val LineNumberEnd = flatgraph.OptionalPropertyKey[Int](kind = 35, name = "LINE_NUMBER_END") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -208,25 +208,25 @@ object Method { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) /** The method signature encodes the types of parameters in a string. The string SHOULD be human readable and * suitable for differentiating methods with different parameter types sufficiently to allow for resolving of * function overloading. The present specification does not enforce a strict format for the signature, that is, it * can be chosen by the frontend implementor to fit the source language. */ - val Signature = flatgraph.SinglePropertyKey[String](kind = 51, name = "SIGNATURE", default = "") + val Signature = flatgraph.SinglePropertyKey[String](kind = 46, name = "SIGNATURE", default = "") } object PropertyDefaults { val AstParentFullName = "" @@ -243,7 +243,7 @@ object Method { } class Method(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 26.toShort, seq_4762) + extends StoredNode(graph_4762, 25.toShort, seq_4762) with MethodBase with CfgNode with Declaration @@ -1992,7 +1992,7 @@ object NewMethod { } } -class NewMethod extends NewNode(26.toShort) with MethodBase with AstNodeNew with CfgNodeNew with DeclarationNew { +class NewMethod extends NewNode(25.toShort) with MethodBase with AstNodeNew with CfgNodeNew with DeclarationNew { override type StoredNodeType = Method override def label: String = "METHOD" @@ -2047,21 +2047,21 @@ class NewMethod extends NewNode(26.toShort) with MethodBase with AstNodeNew with override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { interface.countProperty(this, 3, 1) interface.countProperty(this, 4, 1) - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 12, columnNumberEnd.size) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 10, columnNumberEnd.size) + interface.countProperty(this, 20, 1) + interface.countProperty(this, 21, 1) interface.countProperty(this, 22, 1) - interface.countProperty(this, 23, 1) - interface.countProperty(this, 24, 1) - interface.countProperty(this, 25, hash.size) - interface.countProperty(this, 31, 1) - interface.countProperty(this, 36, lineNumber.size) - interface.countProperty(this, 37, lineNumberEnd.size) + interface.countProperty(this, 23, hash.size) + interface.countProperty(this, 29, 1) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 35, lineNumberEnd.size) + interface.countProperty(this, 38, 1) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) interface.countProperty(this, 41, 1) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) - interface.countProperty(this, 51, 1) + interface.countProperty(this, 46, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/MethodParameterIn.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/MethodParameterIn.scala index aedae62e2..430c93204 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/MethodParameterIn.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/MethodParameterIn.scala @@ -127,17 +127,17 @@ object MethodParameterIn { /** Identifier which uniquely describes a CLOSURE_BINDING. This property is used to match captured LOCAL nodes with * the corresponding CLOSURE_BINDING nodes */ - val ClosureBindingId = flatgraph.OptionalPropertyKey[String](kind = 8, name = "CLOSURE_BINDING_ID") + val ClosureBindingId = flatgraph.OptionalPropertyKey[String](kind = 6, name = "CLOSURE_BINDING_ID") /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** Type hint for the dynamic type. These are observed to be verifiable at runtime. */ - val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 18, name = "DYNAMIC_TYPE_HINT_FULL_NAME") + val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 16, name = "DYNAMIC_TYPE_HINT_FULL_NAME") /** For formal method input parameters, output parameters, and return parameters, this field holds the evaluation * strategy, which is one of the following: 1) `BY_REFERENCE` indicates that the parameter is passed by reference, @@ -146,24 +146,24 @@ object MethodParameterIn { * object that it points to is not made. */ val EvaluationStrategy = - flatgraph.SinglePropertyKey[String](kind = 19, name = "EVALUATION_STRATEGY", default = "") + flatgraph.SinglePropertyKey[String](kind = 17, name = "EVALUATION_STRATEGY", default = "") /** Specifies an index, e.g., for a parameter or argument. Explicit parameters are numbered from 1 to N, while index * 0 is reserved for implicit self / this parameter. */ - val Index = flatgraph.SinglePropertyKey[Int](kind = 28, name = "INDEX", default = -1: Int) + val Index = flatgraph.SinglePropertyKey[Int](kind = 26, name = "INDEX", default = -1: Int) /** Specifies whether a parameter is the variadic argument handling parameter of a variadic method. Only one * parameter of a method is allowed to have this property set to true. */ - val IsVariadic = flatgraph.SinglePropertyKey[Boolean](kind = 32, name = "IS_VARIADIC", default = false) + val IsVariadic = flatgraph.SinglePropertyKey[Boolean](kind = 30, name = "IS_VARIADIC", default = false) /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -171,29 +171,29 @@ object MethodParameterIn { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) /** Similar to `DYNAMIC_TYPE_HINT_FULL_NAME`, but that this makes no guarantee that types within this property are * correct. This property is used to capture observations between node interactions during a 'may-analysis'. */ - val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 49, name = "POSSIBLE_TYPES") + val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 44, name = "POSSIBLE_TYPES") /** This field contains the fully-qualified static type name of the program construct represented by a node. It is * the name of an instantiated type, e.g., `java.util.List`, rather than `java.util.List[T]`. If the type * cannot be determined, this field should be set to the empty string. */ - val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 54, name = "TYPE_FULL_NAME", default = "") + val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 48, name = "TYPE_FULL_NAME", default = "") } object PropertyDefaults { val Code = "" @@ -207,7 +207,7 @@ object MethodParameterIn { } class MethodParameterIn(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 27.toShort, seq_4762) + extends StoredNode(graph_4762, 26.toShort, seq_4762) with MethodParameterInBase with CfgNode with Declaration @@ -1872,7 +1872,7 @@ object NewMethodParameterIn { } class NewMethodParameterIn - extends NewNode(27.toShort) + extends NewNode(26.toShort) with MethodParameterInBase with AstNodeNew with CfgNodeNew @@ -1923,20 +1923,20 @@ class NewMethodParameterIn def possibleTypes(value: IterableOnce[String]): this.type = { this.possibleTypes = value.iterator.to(ArraySeq); this } def typeFullName(value: String): this.type = { this.typeFullName = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 8, closureBindingId.size) - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 18, dynamicTypeHintFullName.size) - interface.countProperty(this, 19, 1) - interface.countProperty(this, 28, 1) - interface.countProperty(this, 32, 1) - interface.countProperty(this, 36, lineNumber.size) + interface.countProperty(this, 6, closureBindingId.size) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 16, dynamicTypeHintFullName.size) + interface.countProperty(this, 17, 1) + interface.countProperty(this, 26, 1) + interface.countProperty(this, 30, 1) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 38, 1) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) interface.countProperty(this, 41, 1) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) - interface.countProperty(this, 49, possibleTypes.size) - interface.countProperty(this, 54, 1) + interface.countProperty(this, 44, possibleTypes.size) + interface.countProperty(this, 48, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/MethodParameterOut.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/MethodParameterOut.scala index e30011b00..25ec102e7 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/MethodParameterOut.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/MethodParameterOut.scala @@ -104,11 +104,11 @@ object MethodParameterOut { object Properties { /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** For formal method input parameters, output parameters, and return parameters, this field holds the evaluation * strategy, which is one of the following: 1) `BY_REFERENCE` indicates that the parameter is passed by reference, @@ -117,24 +117,24 @@ object MethodParameterOut { * object that it points to is not made. */ val EvaluationStrategy = - flatgraph.SinglePropertyKey[String](kind = 19, name = "EVALUATION_STRATEGY", default = "") + flatgraph.SinglePropertyKey[String](kind = 17, name = "EVALUATION_STRATEGY", default = "") /** Specifies an index, e.g., for a parameter or argument. Explicit parameters are numbered from 1 to N, while index * 0 is reserved for implicit self / this parameter. */ - val Index = flatgraph.SinglePropertyKey[Int](kind = 28, name = "INDEX", default = -1: Int) + val Index = flatgraph.SinglePropertyKey[Int](kind = 26, name = "INDEX", default = -1: Int) /** Specifies whether a parameter is the variadic argument handling parameter of a variadic method. Only one * parameter of a method is allowed to have this property set to true. */ - val IsVariadic = flatgraph.SinglePropertyKey[Boolean](kind = 32, name = "IS_VARIADIC", default = false) + val IsVariadic = flatgraph.SinglePropertyKey[Boolean](kind = 30, name = "IS_VARIADIC", default = false) /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -142,24 +142,24 @@ object MethodParameterOut { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) /** This field contains the fully-qualified static type name of the program construct represented by a node. It is * the name of an instantiated type, e.g., `java.util.List`, rather than `java.util.List[T]`. If the type * cannot be determined, this field should be set to the empty string. */ - val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 54, name = "TYPE_FULL_NAME", default = "") + val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 48, name = "TYPE_FULL_NAME", default = "") } object PropertyDefaults { val Code = "" @@ -173,7 +173,7 @@ object MethodParameterOut { } class MethodParameterOut(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 28.toShort, seq_4762) + extends StoredNode(graph_4762, 27.toShort, seq_4762) with MethodParameterOutBase with CfgNode with Declaration @@ -1749,7 +1749,7 @@ object NewMethodParameterOut { } class NewMethodParameterOut - extends NewNode(28.toShort) + extends NewNode(27.toShort) with MethodParameterOutBase with AstNodeNew with CfgNodeNew @@ -1791,17 +1791,17 @@ class NewMethodParameterOut def order(value: Int): this.type = { this.order = value; this } def typeFullName(value: String): this.type = { this.typeFullName = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 19, 1) - interface.countProperty(this, 28, 1) - interface.countProperty(this, 32, 1) - interface.countProperty(this, 36, lineNumber.size) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 17, 1) + interface.countProperty(this, 26, 1) + interface.countProperty(this, 30, 1) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 38, 1) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) interface.countProperty(this, 41, 1) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) - interface.countProperty(this, 54, 1) + interface.countProperty(this, 48, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/MethodRef.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/MethodRef.scala index 1046a4a08..975f78eb8 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/MethodRef.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/MethodRef.scala @@ -122,23 +122,23 @@ object MethodRef { val ArgumentName = flatgraph.OptionalPropertyKey[String](kind = 2, name = "ARGUMENT_NAME") /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** Type hint for the dynamic type. These are observed to be verifiable at runtime. */ - val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 18, name = "DYNAMIC_TYPE_HINT_FULL_NAME") + val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 16, name = "DYNAMIC_TYPE_HINT_FULL_NAME") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** The FULL_NAME of a method. Used to link CALL and METHOD nodes. It is required to have exactly one METHOD node * for each METHOD_FULL_NAME */ - val MethodFullName = flatgraph.SinglePropertyKey[String](kind = 38, name = "METHOD_FULL_NAME", default = "") + val MethodFullName = flatgraph.SinglePropertyKey[String](kind = 36, name = "METHOD_FULL_NAME", default = "") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -146,29 +146,29 @@ object MethodRef { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) /** Similar to `DYNAMIC_TYPE_HINT_FULL_NAME`, but that this makes no guarantee that types within this property are * correct. This property is used to capture observations between node interactions during a 'may-analysis'. */ - val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 49, name = "POSSIBLE_TYPES") + val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 44, name = "POSSIBLE_TYPES") /** This field contains the fully-qualified static type name of the program construct represented by a node. It is * the name of an instantiated type, e.g., `java.util.List`, rather than `java.util.List[T]`. If the type * cannot be determined, this field should be set to the empty string. */ - val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 54, name = "TYPE_FULL_NAME", default = "") + val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 48, name = "TYPE_FULL_NAME", default = "") } object PropertyDefaults { val ArgumentIndex = -1: Int @@ -180,7 +180,7 @@ object MethodRef { } class MethodRef(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 29.toShort, seq_4762) + extends StoredNode(graph_4762, 28.toShort, seq_4762) with MethodRefBase with Expression with StaticType[MethodRefEMT] { @@ -1789,7 +1789,7 @@ object NewMethodRef { } } -class NewMethodRef extends NewNode(29.toShort) with MethodRefBase with ExpressionNew { +class NewMethodRef extends NewNode(28.toShort) with MethodRefBase with ExpressionNew { override type StoredNodeType = MethodRef override def label: String = "METHOD_REF" @@ -1834,16 +1834,16 @@ class NewMethodRef extends NewNode(29.toShort) with MethodRefBase with Expressio override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { interface.countProperty(this, 1, 1) interface.countProperty(this, 2, argumentName.size) - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 18, dynamicTypeHintFullName.size) - interface.countProperty(this, 36, lineNumber.size) - interface.countProperty(this, 38, 1) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) - interface.countProperty(this, 49, possibleTypes.size) - interface.countProperty(this, 54, 1) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 16, dynamicTypeHintFullName.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 36, 1) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) + interface.countProperty(this, 41, 1) + interface.countProperty(this, 44, possibleTypes.size) + interface.countProperty(this, 48, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/MethodReturn.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/MethodReturn.scala index cd975d0a8..738128f45 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/MethodReturn.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/MethodReturn.scala @@ -95,14 +95,14 @@ object MethodReturn { object Properties { /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** Type hint for the dynamic type. These are observed to be verifiable at runtime. */ - val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 18, name = "DYNAMIC_TYPE_HINT_FULL_NAME") + val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 16, name = "DYNAMIC_TYPE_HINT_FULL_NAME") /** For formal method input parameters, output parameters, and return parameters, this field holds the evaluation * strategy, which is one of the following: 1) `BY_REFERENCE` indicates that the parameter is passed by reference, @@ -111,11 +111,11 @@ object MethodReturn { * object that it points to is not made. */ val EvaluationStrategy = - flatgraph.SinglePropertyKey[String](kind = 19, name = "EVALUATION_STRATEGY", default = "") + flatgraph.SinglePropertyKey[String](kind = 17, name = "EVALUATION_STRATEGY", default = "") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -123,29 +123,29 @@ object MethodReturn { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) /** Similar to `DYNAMIC_TYPE_HINT_FULL_NAME`, but that this makes no guarantee that types within this property are * correct. This property is used to capture observations between node interactions during a 'may-analysis'. */ - val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 49, name = "POSSIBLE_TYPES") + val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 44, name = "POSSIBLE_TYPES") /** This field contains the fully-qualified static type name of the program construct represented by a node. It is * the name of an instantiated type, e.g., `java.util.List`, rather than `java.util.List[T]`. If the type * cannot be determined, this field should be set to the empty string. */ - val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 54, name = "TYPE_FULL_NAME", default = "") + val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 48, name = "TYPE_FULL_NAME", default = "") } object PropertyDefaults { val Code = "" @@ -156,7 +156,7 @@ object MethodReturn { } class MethodReturn(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 30.toShort, seq_4762) + extends StoredNode(graph_4762, 29.toShort, seq_4762) with MethodReturnBase with CfgNode with StaticType[MethodReturnEMT] { @@ -1707,7 +1707,7 @@ object NewMethodReturn { } } -class NewMethodReturn extends NewNode(30.toShort) with MethodReturnBase with CfgNodeNew { +class NewMethodReturn extends NewNode(29.toShort) with MethodReturnBase with CfgNodeNew { override type StoredNodeType = MethodReturn override def label: String = "METHOD_RETURN" @@ -1745,16 +1745,16 @@ class NewMethodReturn extends NewNode(30.toShort) with MethodReturnBase with Cfg def possibleTypes(value: IterableOnce[String]): this.type = { this.possibleTypes = value.iterator.to(ArraySeq); this } def typeFullName(value: String): this.type = { this.typeFullName = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 18, dynamicTypeHintFullName.size) - interface.countProperty(this, 19, 1) - interface.countProperty(this, 36, lineNumber.size) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) - interface.countProperty(this, 49, possibleTypes.size) - interface.countProperty(this, 54, 1) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 16, dynamicTypeHintFullName.size) + interface.countProperty(this, 17, 1) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) + interface.countProperty(this, 41, 1) + interface.countProperty(this, 44, possibleTypes.size) + interface.countProperty(this, 48, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Modifier.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Modifier.scala index e5bcb6ec2..c4850fbe0 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Modifier.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Modifier.scala @@ -67,20 +67,20 @@ object Modifier { object Properties { /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** The modifier type is a free-form string. The following are known modifier types: `STATIC`, `PUBLIC`, * `PROTECTED`, `PRIVATE`, `ABSTRACT`, `NATIVE`, `CONSTRUCTOR`, `VIRTUAL`. */ - val ModifierType = flatgraph.SinglePropertyKey[String](kind = 40, name = "MODIFIER_TYPE", default = "") + val ModifierType = flatgraph.SinglePropertyKey[String](kind = 37, name = "MODIFIER_TYPE", default = "") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -88,18 +88,18 @@ object Modifier { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) } object PropertyDefaults { val Code = "" @@ -109,7 +109,7 @@ object Modifier { } class Modifier(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 31.toShort, seq_4762) + extends StoredNode(graph_4762, 30.toShort, seq_4762) with ModifierBase with AstNode with StaticType[ModifierEMT] { @@ -1575,7 +1575,7 @@ object NewModifier { } } -class NewModifier extends NewNode(31.toShort) with ModifierBase with AstNodeNew { +class NewModifier extends NewNode(30.toShort) with ModifierBase with AstNodeNew { override type StoredNodeType = Modifier override def label: String = "MODIFIER" @@ -1605,13 +1605,13 @@ class NewModifier extends NewNode(31.toShort) with ModifierBase with AstNodeNew def offsetEnd(value: Option[Int]): this.type = { this.offsetEnd = value; this } def order(value: Int): this.type = { this.order = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 36, lineNumber.size) - interface.countProperty(this, 40, 1) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 37, 1) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) + interface.countProperty(this, 41, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Namespace.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Namespace.scala index aecf2552d..068ce4d53 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Namespace.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Namespace.scala @@ -65,18 +65,18 @@ object Namespace { object Properties { /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -84,18 +84,18 @@ object Namespace { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) } object PropertyDefaults { val Code = "" @@ -105,7 +105,7 @@ object Namespace { } class Namespace(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 32.toShort, seq_4762) + extends StoredNode(graph_4762, 31.toShort, seq_4762) with NamespaceBase with AstNode with StaticType[NamespaceEMT] { @@ -1571,7 +1571,7 @@ object NewNamespace { } } -class NewNamespace extends NewNode(32.toShort) with NamespaceBase with AstNodeNew { +class NewNamespace extends NewNode(31.toShort) with NamespaceBase with AstNodeNew { override type StoredNodeType = Namespace override def label: String = "NAMESPACE" @@ -1601,13 +1601,13 @@ class NewNamespace extends NewNode(32.toShort) with NamespaceBase with AstNodeNe def offsetEnd(value: Option[Int]): this.type = { this.offsetEnd = value; this } def order(value: Int): this.type = { this.order = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 36, lineNumber.size) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 38, 1) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) interface.countProperty(this, 41, 1) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/NamespaceBlock.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/NamespaceBlock.scala index e2fdfb109..a57c0d2a6 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/NamespaceBlock.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/NamespaceBlock.scala @@ -79,30 +79,30 @@ object NamespaceBlock { object Properties { /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** The path of the source file this node was generated from, relative to the root path in the meta data node. This * field must be set but may be set to the value `` to indicate that no source file can be associated with * the node, e.g., because the node represents an entity known to exist because it is referenced, but for which the * file that is is declared in is unknown. */ - val Filename = flatgraph.SinglePropertyKey[String](kind = 22, name = "FILENAME", default = "") + val Filename = flatgraph.SinglePropertyKey[String](kind = 20, name = "FILENAME", default = "") /** This is the fully-qualified name of an entity, e.g., the fully-qualified name of a method or type. The details * of what constitutes a fully-qualified name are language specific. This field SHOULD be human readable. */ - val FullName = flatgraph.SinglePropertyKey[String](kind = 23, name = "FULL_NAME", default = "") + val FullName = flatgraph.SinglePropertyKey[String](kind = 21, name = "FULL_NAME", default = "") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -110,18 +110,18 @@ object NamespaceBlock { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) } object PropertyDefaults { val Code = "" @@ -133,7 +133,7 @@ object NamespaceBlock { } class NamespaceBlock(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 33.toShort, seq_4762) + extends StoredNode(graph_4762, 32.toShort, seq_4762) with NamespaceBlockBase with AstNode with StaticType[NamespaceBlockEMT] { @@ -1653,7 +1653,7 @@ object NewNamespaceBlock { } } -class NewNamespaceBlock extends NewNode(33.toShort) with NamespaceBlockBase with AstNodeNew { +class NewNamespaceBlock extends NewNode(32.toShort) with NamespaceBlockBase with AstNodeNew { override type StoredNodeType = NamespaceBlock override def label: String = "NAMESPACE_BLOCK" @@ -1687,15 +1687,15 @@ class NewNamespaceBlock extends NewNode(33.toShort) with NamespaceBlockBase with def offsetEnd(value: Option[Int]): this.type = { this.offsetEnd = value; this } def order(value: Int): this.type = { this.order = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 22, 1) - interface.countProperty(this, 23, 1) - interface.countProperty(this, 36, lineNumber.size) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 20, 1) + interface.countProperty(this, 21, 1) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 38, 1) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) interface.countProperty(this, 41, 1) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Return.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Return.scala index d0ad9af03..87409dfaf 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Return.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Return.scala @@ -91,15 +91,15 @@ object Return { val ArgumentName = flatgraph.OptionalPropertyKey[String](kind = 2, name = "ARGUMENT_NAME") /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -107,18 +107,18 @@ object Return { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) } object PropertyDefaults { val ArgumentIndex = -1: Int @@ -128,7 +128,7 @@ object Return { } class Return(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 34.toShort, seq_4762) + extends StoredNode(graph_4762, 33.toShort, seq_4762) with ReturnBase with Expression with StaticType[ReturnEMT] { @@ -1625,7 +1625,7 @@ object NewReturn { } } -class NewReturn extends NewNode(34.toShort) with ReturnBase with ExpressionNew { +class NewReturn extends NewNode(33.toShort) with ReturnBase with ExpressionNew { override type StoredNodeType = Return override def label: String = "RETURN" @@ -1660,12 +1660,12 @@ class NewReturn extends NewNode(34.toShort) with ReturnBase with ExpressionNew { override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { interface.countProperty(this, 1, 1) interface.countProperty(this, 2, argumentName.size) - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 36, lineNumber.size) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) + interface.countProperty(this, 41, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Tag.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Tag.scala index f127e6b4a..1a924ca7c 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Tag.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Tag.scala @@ -33,10 +33,10 @@ object Tag { object Properties { /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** This property denotes a string value as used in a key-value pair. */ - val Value = flatgraph.SinglePropertyKey[String](kind = 55, name = "VALUE", default = "") + val Value = flatgraph.SinglePropertyKey[String](kind = 49, name = "VALUE", default = "") } object PropertyDefaults { val Name = "" @@ -45,7 +45,7 @@ object Tag { } class Tag(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 35.toShort, seq_4762) + extends StoredNode(graph_4762, 34.toShort, seq_4762) with TagBase with StaticType[TagEMT] { @@ -153,7 +153,7 @@ object NewTag { } } -class NewTag extends NewNode(35.toShort) with TagBase { +class NewTag extends NewNode(34.toShort) with TagBase { override type StoredNodeType = Tag override def label: String = "TAG" @@ -169,8 +169,8 @@ class NewTag extends NewNode(35.toShort) with TagBase { def name(value: String): this.type = { this.name = value; this } def value(value: String): this.type = { this.value = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 41, 1) - interface.countProperty(this, 55, 1) + interface.countProperty(this, 38, 1) + interface.countProperty(this, 49, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TagNodePair.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TagNodePair.scala index f163c1542..2b9b576d8 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TagNodePair.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TagNodePair.scala @@ -32,11 +32,11 @@ object TagNodePair { } class TagNodePair(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 36.toShort, seq_4762) + extends StoredNode(graph_4762, 35.toShort, seq_4762) with TagNodePairBase with StaticType[TagNodePairEMT] { - def node: StoredNode = flatgraph.Accessors.getNodePropertySingle(graph, nodeKind, 59, seq, null: StoredNode) - def tag: Tag = flatgraph.Accessors.getNodePropertySingle(graph, nodeKind, 60, seq, null: Tag) + def node: StoredNode = flatgraph.Accessors.getNodePropertySingle(graph, nodeKind, 53, seq, null: StoredNode) + def tag: Tag = flatgraph.Accessors.getNodePropertySingle(graph, nodeKind, 54, seq, null: Tag) override def productElementName(n: Int): String = n match { @@ -121,7 +121,7 @@ object NewTagNodePair { } } -class NewTagNodePair extends NewNode(36.toShort) with TagNodePairBase { +class NewTagNodePair extends NewNode(35.toShort) with TagNodePairBase { override type StoredNodeType = TagNodePair override def label: String = "TAG_NODE_PAIR" @@ -137,9 +137,9 @@ class NewTagNodePair extends NewNode(36.toShort) with TagNodePairBase { def node(value: AbstractNode): this.type = { this.node = value; this } def tag(value: TagBase): this.type = { this.tag = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 59, 1) + interface.countProperty(this, 53, 1) interface.visitContainedNode(node) - interface.countProperty(this, 60, 1) + interface.countProperty(this, 54, 1) interface.visitContainedNode(tag) } diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TemplateDom.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TemplateDom.scala index e2d43efd2..1c9d854c3 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TemplateDom.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TemplateDom.scala @@ -95,18 +95,18 @@ object TemplateDom { val ArgumentName = flatgraph.OptionalPropertyKey[String](kind = 2, name = "ARGUMENT_NAME") /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -114,18 +114,18 @@ object TemplateDom { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) } object PropertyDefaults { val ArgumentIndex = -1: Int @@ -136,7 +136,7 @@ object TemplateDom { } class TemplateDom(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 37.toShort, seq_4762) + extends StoredNode(graph_4762, 36.toShort, seq_4762) with TemplateDomBase with Expression with StaticType[TemplateDomEMT] { @@ -1660,7 +1660,7 @@ object NewTemplateDom { } } -class NewTemplateDom extends NewNode(37.toShort) with TemplateDomBase with ExpressionNew { +class NewTemplateDom extends NewNode(36.toShort) with TemplateDomBase with ExpressionNew { override type StoredNodeType = TemplateDom override def label: String = "TEMPLATE_DOM" @@ -1697,13 +1697,13 @@ class NewTemplateDom extends NewNode(37.toShort) with TemplateDomBase with Expre override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { interface.countProperty(this, 1, 1) interface.countProperty(this, 2, argumentName.size) - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 36, lineNumber.size) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 38, 1) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) interface.countProperty(this, 41, 1) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Type.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Type.scala index 2f248bc1b..9c234c800 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Type.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Type.scala @@ -43,16 +43,16 @@ object Type { /** This is the fully-qualified name of an entity, e.g., the fully-qualified name of a method or type. The details * of what constitutes a fully-qualified name are language specific. This field SHOULD be human readable. */ - val FullName = flatgraph.SinglePropertyKey[String](kind = 23, name = "FULL_NAME", default = "") + val FullName = flatgraph.SinglePropertyKey[String](kind = 21, name = "FULL_NAME", default = "") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** The static type decl of a TYPE. This property is matched against the FULL_NAME of TYPE_DECL nodes. It is * required to have exactly one TYPE_DECL for each different TYPE_DECL_FULL_NAME */ val TypeDeclFullName = - flatgraph.SinglePropertyKey[String](kind = 53, name = "TYPE_DECL_FULL_NAME", default = "") + flatgraph.SinglePropertyKey[String](kind = 47, name = "TYPE_DECL_FULL_NAME", default = "") } object PropertyDefaults { val FullName = "" @@ -62,7 +62,7 @@ object Type { } class Type(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 38.toShort, seq_4762) + extends StoredNode(graph_4762, 37.toShort, seq_4762) with TypeBase with StaticType[TypeEMT] { @@ -192,7 +192,7 @@ object NewType { } } -class NewType extends NewNode(38.toShort) with TypeBase { +class NewType extends NewNode(37.toShort) with TypeBase { override type StoredNodeType = Type override def label: String = "TYPE" @@ -210,9 +210,9 @@ class NewType extends NewNode(38.toShort) with TypeBase { def name(value: String): this.type = { this.name = value; this } def typeDeclFullName(value: String): this.type = { this.typeDeclFullName = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 23, 1) - interface.countProperty(this, 41, 1) - interface.countProperty(this, 53, 1) + interface.countProperty(this, 21, 1) + interface.countProperty(this, 38, 1) + interface.countProperty(this, 47, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TypeArgument.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TypeArgument.scala index 128ba6eea..508b5d574 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TypeArgument.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TypeArgument.scala @@ -61,15 +61,15 @@ object TypeArgument { object Properties { /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -77,18 +77,18 @@ object TypeArgument { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) } object PropertyDefaults { val Code = "" @@ -97,7 +97,7 @@ object TypeArgument { } class TypeArgument(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 39.toShort, seq_4762) + extends StoredNode(graph_4762, 38.toShort, seq_4762) with TypeArgumentBase with AstNode with StaticType[TypeArgumentEMT] { @@ -1536,7 +1536,7 @@ object NewTypeArgument { } } -class NewTypeArgument extends NewNode(39.toShort) with TypeArgumentBase with AstNodeNew { +class NewTypeArgument extends NewNode(38.toShort) with TypeArgumentBase with AstNodeNew { override type StoredNodeType = TypeArgument override def label: String = "TYPE_ARGUMENT" @@ -1564,12 +1564,12 @@ class NewTypeArgument extends NewNode(39.toShort) with TypeArgumentBase with Ast def offsetEnd(value: Option[Int]): this.type = { this.offsetEnd = value; this } def order(value: Int): this.type = { this.order = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 36, lineNumber.size) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) + interface.countProperty(this, 41, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TypeDecl.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TypeDecl.scala index acd97893e..f627450fb 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TypeDecl.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TypeDecl.scala @@ -138,47 +138,47 @@ object TypeDecl { val AstParentType = flatgraph.SinglePropertyKey[String](kind = 4, name = "AST_PARENT_TYPE", default = "") /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** The path of the source file this node was generated from, relative to the root path in the meta data node. This * field must be set but may be set to the value `` to indicate that no source file can be associated with * the node, e.g., because the node represents an entity known to exist because it is referenced, but for which the * file that is is declared in is unknown. */ - val Filename = flatgraph.SinglePropertyKey[String](kind = 22, name = "FILENAME", default = "") + val Filename = flatgraph.SinglePropertyKey[String](kind = 20, name = "FILENAME", default = "") /** This is the fully-qualified name of an entity, e.g., the fully-qualified name of a method or type. The details * of what constitutes a fully-qualified name are language specific. This field SHOULD be human readable. */ - val FullName = flatgraph.SinglePropertyKey[String](kind = 23, name = "FULL_NAME", default = "") + val FullName = flatgraph.SinglePropertyKey[String](kind = 21, name = "FULL_NAME", default = "") /** This field is experimental. It will likely be removed in the future without any notice. It stores type * information for generic types and methods as well as type information for members and locals where the type * either contains a type parameter reference or an instantiated type reference. */ val GenericSignature = - flatgraph.SinglePropertyKey[String](kind = 24, name = "GENERIC_SIGNATURE", default = "") + flatgraph.SinglePropertyKey[String](kind = 22, name = "GENERIC_SIGNATURE", default = "") /** The static types a TYPE_DECL inherits from. This property is matched against the FULL_NAME of TYPE nodes and * thus it is required to have at least one TYPE node for each TYPE_FULL_NAME */ - val InheritsFromTypeFullName = flatgraph.MultiPropertyKey[String](kind = 29, name = "INHERITS_FROM_TYPE_FULL_NAME") + val InheritsFromTypeFullName = flatgraph.MultiPropertyKey[String](kind = 27, name = "INHERITS_FROM_TYPE_FULL_NAME") /** Indicates that the construct (METHOD or TYPE_DECL) is external, that is, it is referenced but not defined in the * code (applies both to insular parsing and to library functions where we have header files only) */ - val IsExternal = flatgraph.SinglePropertyKey[Boolean](kind = 31, name = "IS_EXTERNAL", default = false) + val IsExternal = flatgraph.SinglePropertyKey[Boolean](kind = 29, name = "IS_EXTERNAL", default = false) /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -186,18 +186,18 @@ object TypeDecl { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) } object PropertyDefaults { val AstParentFullName = "" @@ -213,7 +213,7 @@ object TypeDecl { } class TypeDecl(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 40.toShort, seq_4762) + extends StoredNode(graph_4762, 39.toShort, seq_4762) with TypeDeclBase with AstNode with StaticType[TypeDeclEMT] { @@ -1901,7 +1901,7 @@ object NewTypeDecl { } } -class NewTypeDecl extends NewNode(40.toShort) with TypeDeclBase with AstNodeNew { +class NewTypeDecl extends NewNode(39.toShort) with TypeDeclBase with AstNodeNew { override type StoredNodeType = TypeDecl override def label: String = "TYPE_DECL" @@ -1953,18 +1953,18 @@ class NewTypeDecl extends NewNode(40.toShort) with TypeDeclBase with AstNodeNew interface.countProperty(this, 0, aliasTypeFullName.size) interface.countProperty(this, 3, 1) interface.countProperty(this, 4, 1) - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 20, 1) + interface.countProperty(this, 21, 1) interface.countProperty(this, 22, 1) - interface.countProperty(this, 23, 1) - interface.countProperty(this, 24, 1) - interface.countProperty(this, 29, inheritsFromTypeFullName.size) - interface.countProperty(this, 31, 1) - interface.countProperty(this, 36, lineNumber.size) + interface.countProperty(this, 27, inheritsFromTypeFullName.size) + interface.countProperty(this, 29, 1) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 38, 1) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) interface.countProperty(this, 41, 1) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TypeParameter.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TypeParameter.scala index b7356b57a..553b4d235 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TypeParameter.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TypeParameter.scala @@ -65,18 +65,18 @@ object TypeParameter { object Properties { /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Name of represented object, e.g., method name (e.g. "run") */ - val Name = flatgraph.SinglePropertyKey[String](kind = 41, name = "NAME", default = "") + val Name = flatgraph.SinglePropertyKey[String](kind = 38, name = "NAME", default = "") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -84,18 +84,18 @@ object TypeParameter { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) } object PropertyDefaults { val Code = "" @@ -105,7 +105,7 @@ object TypeParameter { } class TypeParameter(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 41.toShort, seq_4762) + extends StoredNode(graph_4762, 40.toShort, seq_4762) with TypeParameterBase with AstNode with StaticType[TypeParameterEMT] { @@ -1571,7 +1571,7 @@ object NewTypeParameter { } } -class NewTypeParameter extends NewNode(41.toShort) with TypeParameterBase with AstNodeNew { +class NewTypeParameter extends NewNode(40.toShort) with TypeParameterBase with AstNodeNew { override type StoredNodeType = TypeParameter override def label: String = "TYPE_PARAMETER" @@ -1601,13 +1601,13 @@ class NewTypeParameter extends NewNode(41.toShort) with TypeParameterBase with A def offsetEnd(value: Option[Int]): this.type = { this.offsetEnd = value; this } def order(value: Int): this.type = { this.order = value; this } override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 36, lineNumber.size) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 38, 1) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) interface.countProperty(this, 41, 1) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TypeRef.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TypeRef.scala index b1dfd317e..06ba5ccf8 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TypeRef.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/TypeRef.scala @@ -115,18 +115,18 @@ object TypeRef { val ArgumentName = flatgraph.OptionalPropertyKey[String](kind = 2, name = "ARGUMENT_NAME") /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** Type hint for the dynamic type. These are observed to be verifiable at runtime. */ - val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 18, name = "DYNAMIC_TYPE_HINT_FULL_NAME") + val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 16, name = "DYNAMIC_TYPE_HINT_FULL_NAME") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -134,29 +134,29 @@ object TypeRef { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) /** Similar to `DYNAMIC_TYPE_HINT_FULL_NAME`, but that this makes no guarantee that types within this property are * correct. This property is used to capture observations between node interactions during a 'may-analysis'. */ - val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 49, name = "POSSIBLE_TYPES") + val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 44, name = "POSSIBLE_TYPES") /** This field contains the fully-qualified static type name of the program construct represented by a node. It is * the name of an instantiated type, e.g., `java.util.List`, rather than `java.util.List[T]`. If the type * cannot be determined, this field should be set to the empty string. */ - val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 54, name = "TYPE_FULL_NAME", default = "") + val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 48, name = "TYPE_FULL_NAME", default = "") } object PropertyDefaults { val ArgumentIndex = -1: Int @@ -167,7 +167,7 @@ object TypeRef { } class TypeRef(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 42.toShort, seq_4762) + extends StoredNode(graph_4762, 41.toShort, seq_4762) with TypeRefBase with Expression with StaticType[TypeRefEMT] { @@ -1749,7 +1749,7 @@ object NewTypeRef { } } -class NewTypeRef extends NewNode(42.toShort) with TypeRefBase with ExpressionNew { +class NewTypeRef extends NewNode(41.toShort) with TypeRefBase with ExpressionNew { override type StoredNodeType = TypeRef override def label: String = "TYPE_REF" @@ -1792,15 +1792,15 @@ class NewTypeRef extends NewNode(42.toShort) with TypeRefBase with ExpressionNew override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { interface.countProperty(this, 1, 1) interface.countProperty(this, 2, argumentName.size) - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 18, dynamicTypeHintFullName.size) - interface.countProperty(this, 36, lineNumber.size) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) - interface.countProperty(this, 49, possibleTypes.size) - interface.countProperty(this, 54, 1) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 16, dynamicTypeHintFullName.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) + interface.countProperty(this, 41, 1) + interface.countProperty(this, 44, possibleTypes.size) + interface.countProperty(this, 48, 1) } override def copy: this.type = { diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Unknown.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Unknown.scala index c880b2af3..325110de5 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Unknown.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/nodes/Unknown.scala @@ -127,23 +127,23 @@ object Unknown { val ArgumentName = flatgraph.OptionalPropertyKey[String](kind = 2, name = "ARGUMENT_NAME") /** This field holds the code snippet that the node represents. */ - val Code = flatgraph.SinglePropertyKey[String](kind = 10, name = "CODE", default = "") + val Code = flatgraph.SinglePropertyKey[String](kind = 8, name = "CODE", default = "") /** This optional fields provides the column number of the program construct represented by the node. */ - val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 11, name = "COLUMN_NUMBER") + val ColumnNumber = flatgraph.OptionalPropertyKey[Int](kind = 9, name = "COLUMN_NUMBER") /** References to other nodes. This is not a real property; it exists here for the sake of proto serialization only. * valueType and cardinality are meaningless. */ - val ContainedRef = flatgraph.SinglePropertyKey[String](kind = 13, name = "CONTAINED_REF", default = "") + val ContainedRef = flatgraph.SinglePropertyKey[String](kind = 11, name = "CONTAINED_REF", default = "") /** Type hint for the dynamic type. These are observed to be verifiable at runtime. */ - val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 18, name = "DYNAMIC_TYPE_HINT_FULL_NAME") + val DynamicTypeHintFullName = flatgraph.MultiPropertyKey[String](kind = 16, name = "DYNAMIC_TYPE_HINT_FULL_NAME") /** This optional field provides the line number of the program construct represented by the node. */ - val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 36, name = "LINE_NUMBER") + val LineNumber = flatgraph.OptionalPropertyKey[Int](kind = 34, name = "LINE_NUMBER") /** Start offset into the CONTENT property of the corresponding FILE node. The offset is such that parts of the * content can easily be accessed via `content.substring(offset, offsetEnd)`. This means that the offset must be @@ -151,32 +151,32 @@ object Unknown { * for METHOD nodes this start offset points to the start of the methods source code in the string holding the * source code of the entire file. */ - val Offset = flatgraph.OptionalPropertyKey[Int](kind = 43, name = "OFFSET") + val Offset = flatgraph.OptionalPropertyKey[Int](kind = 39, name = "OFFSET") /** End offset (exclusive) into the CONTENT property of the corresponding FILE node. See OFFSET documentation for * finer details. E.g. for METHOD nodes this end offset points to the first code position which is not part of the * method. */ - val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 44, name = "OFFSET_END") + val OffsetEnd = flatgraph.OptionalPropertyKey[Int](kind = 40, name = "OFFSET_END") /** This integer indicates the position of the node among its siblings in the AST. The left-most child has an order * of 0. */ - val Order = flatgraph.SinglePropertyKey[Int](kind = 45, name = "ORDER", default = -1: Int) + val Order = flatgraph.SinglePropertyKey[Int](kind = 41, name = "ORDER", default = -1: Int) /** AST node type name emitted by parser. */ - val ParserTypeName = flatgraph.SinglePropertyKey[String](kind = 48, name = "PARSER_TYPE_NAME", default = "") + val ParserTypeName = flatgraph.SinglePropertyKey[String](kind = 43, name = "PARSER_TYPE_NAME", default = "") /** Similar to `DYNAMIC_TYPE_HINT_FULL_NAME`, but that this makes no guarantee that types within this property are * correct. This property is used to capture observations between node interactions during a 'may-analysis'. */ - val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 49, name = "POSSIBLE_TYPES") + val PossibleTypes = flatgraph.MultiPropertyKey[String](kind = 44, name = "POSSIBLE_TYPES") /** This field contains the fully-qualified static type name of the program construct represented by a node. It is * the name of an instantiated type, e.g., `java.util.List`, rather than `java.util.List[T]`. If the type * cannot be determined, this field should be set to the empty string. */ - val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 54, name = "TYPE_FULL_NAME", default = "") + val TypeFullName = flatgraph.SinglePropertyKey[String](kind = 48, name = "TYPE_FULL_NAME", default = "") } object PropertyDefaults { val ArgumentIndex = -1: Int @@ -189,7 +189,7 @@ object Unknown { } class Unknown(graph_4762: flatgraph.Graph, seq_4762: Int) - extends StoredNode(graph_4762, 43.toShort, seq_4762) + extends StoredNode(graph_4762, 42.toShort, seq_4762) with UnknownBase with Expression with StaticType[UnknownEMT] { @@ -1825,7 +1825,7 @@ object NewUnknown { } } -class NewUnknown extends NewNode(43.toShort) with UnknownBase with ExpressionNew { +class NewUnknown extends NewNode(42.toShort) with UnknownBase with ExpressionNew { override type StoredNodeType = Unknown override def label: String = "UNKNOWN" @@ -1872,17 +1872,17 @@ class NewUnknown extends NewNode(43.toShort) with UnknownBase with ExpressionNew override def countAndVisitProperties(interface: flatgraph.BatchedUpdateInterface): Unit = { interface.countProperty(this, 1, 1) interface.countProperty(this, 2, argumentName.size) - interface.countProperty(this, 10, 1) - interface.countProperty(this, 11, columnNumber.size) - interface.countProperty(this, 13, 1) - interface.countProperty(this, 18, dynamicTypeHintFullName.size) - interface.countProperty(this, 36, lineNumber.size) - interface.countProperty(this, 43, offset.size) - interface.countProperty(this, 44, offsetEnd.size) - interface.countProperty(this, 45, 1) + interface.countProperty(this, 8, 1) + interface.countProperty(this, 9, columnNumber.size) + interface.countProperty(this, 11, 1) + interface.countProperty(this, 16, dynamicTypeHintFullName.size) + interface.countProperty(this, 34, lineNumber.size) + interface.countProperty(this, 39, offset.size) + interface.countProperty(this, 40, offsetEnd.size) + interface.countProperty(this, 41, 1) + interface.countProperty(this, 43, 1) + interface.countProperty(this, 44, possibleTypes.size) interface.countProperty(this, 48, 1) - interface.countProperty(this, 49, possibleTypes.size) - interface.countProperty(this, 54, 1) } override def copy: this.type = { 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 f288f0114..f58357d5d 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 @@ -33,7 +33,7 @@ final class TraversalAnnotationBase[NodeType <: nodes.AnnotationBase](val traver case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.fullName == value } } @@ -47,7 +47,7 @@ final class TraversalAnnotationBase[NodeType <: nodes.AnnotationBase](val traver val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -101,7 +101,7 @@ final class TraversalAnnotationBase[NodeType <: nodes.AnnotationBase](val traver case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.name == value } } @@ -115,7 +115,7 @@ final class TraversalAnnotationBase[NodeType <: nodes.AnnotationBase](val traver val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 7cceff660..9493af70b 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 @@ -33,7 +33,7 @@ final class TraversalAnnotationliteralBase[NodeType <: nodes.AnnotationLiteralBa case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.name == value } } @@ -47,7 +47,7 @@ final class TraversalAnnotationliteralBase[NodeType <: nodes.AnnotationLiteralBa val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 a17774a89..9b0e1200e 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 @@ -32,7 +32,7 @@ final class TraversalAstnodeBase[NodeType <: nodes.AstNodeBase](val traversal: I case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 10, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 8, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.code == value } } @@ -46,7 +46,7 @@ final class TraversalAstnodeBase[NodeType <: nodes.AstNodeBase](val traversal: I val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 10, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 8, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 69fba7c43..a654d493a 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 @@ -32,7 +32,7 @@ final class TraversalBindingBase[NodeType <: nodes.BindingBase](val traversal: I case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 36, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.methodFullName == value } } @@ -46,7 +46,7 @@ final class TraversalBindingBase[NodeType <: nodes.BindingBase](val traversal: I val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 36, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -100,7 +100,7 @@ final class TraversalBindingBase[NodeType <: nodes.BindingBase](val traversal: I case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.name == value } } @@ -114,7 +114,7 @@ final class TraversalBindingBase[NodeType <: nodes.BindingBase](val traversal: I val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -168,7 +168,7 @@ final class TraversalBindingBase[NodeType <: nodes.BindingBase](val traversal: I case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 51, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 46, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.signature == value } } @@ -182,7 +182,7 @@ final class TraversalBindingBase[NodeType <: nodes.BindingBase](val traversal: I val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 51, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 46, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 dce3ca444..e83617db0 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 @@ -40,7 +40,7 @@ final class TraversalBlockBase[NodeType <: nodes.BlockBase](val traversal: Itera case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.typeFullName == value } } @@ -54,7 +54,7 @@ final class TraversalBlockBase[NodeType <: nodes.BlockBase](val traversal: Itera val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 764f1df50..9ce589b24 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 @@ -32,7 +32,7 @@ final class TraversalCallBase[NodeType <: nodes.CallBase](val traversal: Iterato case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 15, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.dispatchType == value } } @@ -46,7 +46,7 @@ final class TraversalCallBase[NodeType <: nodes.CallBase](val traversal: Iterato val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 15, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -104,7 +104,7 @@ final class TraversalCallBase[NodeType <: nodes.CallBase](val traversal: Iterato case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 36, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.methodFullName == value } } @@ -118,7 +118,7 @@ final class TraversalCallBase[NodeType <: nodes.CallBase](val traversal: Iterato val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 36, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -176,7 +176,7 @@ final class TraversalCallBase[NodeType <: nodes.CallBase](val traversal: Iterato case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.typeFullName == value } } @@ -190,7 +190,7 @@ final class TraversalCallBase[NodeType <: nodes.CallBase](val traversal: Iterato val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 60605641a..3a787e47e 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 @@ -32,7 +32,7 @@ final class TraversalCallreprBase[NodeType <: nodes.CallReprBase](val traversal: case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.name == value } } @@ -46,7 +46,7 @@ final class TraversalCallreprBase[NodeType <: nodes.CallReprBase](val traversal: val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -100,7 +100,7 @@ final class TraversalCallreprBase[NodeType <: nodes.CallReprBase](val traversal: case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 51, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 46, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.signature == value } } @@ -114,7 +114,7 @@ final class TraversalCallreprBase[NodeType <: nodes.CallReprBase](val traversal: val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 51, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 46, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 8ad34c806..f931417a9 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 @@ -38,7 +38,7 @@ final class TraversalClosurebindingBase[NodeType <: nodes.ClosureBindingBase](va case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 8, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 6, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { node => @@ -111,7 +111,7 @@ final class TraversalClosurebindingBase[NodeType <: nodes.ClosureBindingBase](va case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 9, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 7, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { node => @@ -179,7 +179,7 @@ final class TraversalClosurebindingBase[NodeType <: nodes.ClosureBindingBase](va case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 19, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.evaluationStrategy == value } } @@ -193,7 +193,7 @@ final class TraversalClosurebindingBase[NodeType <: nodes.ClosureBindingBase](va val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 19, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 85f39f9b6..26cbe5e57 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 @@ -32,7 +32,7 @@ final class TraversalCommentBase[NodeType <: nodes.CommentBase](val traversal: I case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 20, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.filename == value } } @@ -46,7 +46,7 @@ final class TraversalCommentBase[NodeType <: nodes.CommentBase](val traversal: I val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 20, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 4da708bcc..12c697a45 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 @@ -33,7 +33,7 @@ final class TraversalConfigfileBase[NodeType <: nodes.ConfigFileBase](val traver case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 14, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 12, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.content == value } } @@ -47,7 +47,7 @@ final class TraversalConfigfileBase[NodeType <: nodes.ConfigFileBase](val traver val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 14, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 12, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -101,7 +101,7 @@ final class TraversalConfigfileBase[NodeType <: nodes.ConfigFileBase](val traver case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.name == value } } @@ -115,7 +115,7 @@ final class TraversalConfigfileBase[NodeType <: nodes.ConfigFileBase](val traver val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 2986affaf..76b99a8a4 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 @@ -33,7 +33,7 @@ final class TraversalControlstructureBase[NodeType <: nodes.ControlStructureBase case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 15, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 13, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.controlStructureType == value } } @@ -47,7 +47,7 @@ final class TraversalControlstructureBase[NodeType <: nodes.ControlStructureBase val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 15, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 13, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -101,7 +101,7 @@ final class TraversalControlstructureBase[NodeType <: nodes.ControlStructureBase case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 43, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.parserTypeName == value } } @@ -115,7 +115,7 @@ final class TraversalControlstructureBase[NodeType <: nodes.ControlStructureBase val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 43, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 3649c953c..c8e19e391 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 @@ -33,7 +33,7 @@ final class TraversalDeclarationBase[NodeType <: nodes.DeclarationBase](val trav case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.name == value } } @@ -47,7 +47,7 @@ final class TraversalDeclarationBase[NodeType <: nodes.DeclarationBase](val trav val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 5632dae31..441ad6708 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 @@ -38,7 +38,7 @@ final class TraversalDependencyBase[NodeType <: nodes.DependencyBase](val traver case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 16, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 14, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { node => @@ -106,7 +106,7 @@ final class TraversalDependencyBase[NodeType <: nodes.DependencyBase](val traver case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.name == value } } @@ -120,7 +120,7 @@ final class TraversalDependencyBase[NodeType <: nodes.DependencyBase](val traver val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -174,7 +174,7 @@ final class TraversalDependencyBase[NodeType <: nodes.DependencyBase](val traver case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 56, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.version == value } } @@ -188,7 +188,7 @@ final class TraversalDependencyBase[NodeType <: nodes.DependencyBase](val traver val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 56, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 09c050385..8e04dcf01 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 @@ -32,7 +32,7 @@ final class TraversalFileBase[NodeType <: nodes.FileBase](val traversal: Iterato case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 14, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 12, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.content == value } } @@ -46,7 +46,7 @@ final class TraversalFileBase[NodeType <: nodes.FileBase](val traversal: Iterato val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 14, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 12, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -105,7 +105,7 @@ final class TraversalFileBase[NodeType <: nodes.FileBase](val traversal: Iterato case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 25, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { node => @@ -173,7 +173,7 @@ final class TraversalFileBase[NodeType <: nodes.FileBase](val traversal: Iterato case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.name == value } } @@ -187,7 +187,7 @@ final class TraversalFileBase[NodeType <: nodes.FileBase](val traversal: Iterato val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 123d24c93..53352d8b6 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 @@ -37,7 +37,7 @@ final class TraversalIdentifierBase[NodeType <: nodes.IdentifierBase](val traver case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.name == value } } @@ -51,7 +51,7 @@ final class TraversalIdentifierBase[NodeType <: nodes.IdentifierBase](val traver val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -109,7 +109,7 @@ final class TraversalIdentifierBase[NodeType <: nodes.IdentifierBase](val traver case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.typeFullName == value } } @@ -123,7 +123,7 @@ final class TraversalIdentifierBase[NodeType <: nodes.IdentifierBase](val traver val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 a7d336a0b..e51d54da4 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 @@ -46,7 +46,7 @@ final class TraversalImportBase[NodeType <: nodes.ImportBase](val traversal: Ite case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 26, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 24, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { node => @@ -119,7 +119,7 @@ final class TraversalImportBase[NodeType <: nodes.ImportBase](val traversal: Ite case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 27, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 25, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { node => 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 c85403ce8..b75894830 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 @@ -32,7 +32,7 @@ final class TraversalJumplabelBase[NodeType <: nodes.JumpLabelBase](val traversa case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.name == value } } @@ -46,7 +46,7 @@ final class TraversalJumplabelBase[NodeType <: nodes.JumpLabelBase](val traversa val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -100,7 +100,7 @@ final class TraversalJumplabelBase[NodeType <: nodes.JumpLabelBase](val traversa case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 43, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.parserTypeName == value } } @@ -114,7 +114,7 @@ final class TraversalJumplabelBase[NodeType <: nodes.JumpLabelBase](val traversa val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 43, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 217c1ec12..875548481 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 @@ -81,7 +81,7 @@ final class TraversalJumptargetBase[NodeType <: nodes.JumpTargetBase](val traver case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.name == value } } @@ -95,7 +95,7 @@ final class TraversalJumptargetBase[NodeType <: nodes.JumpTargetBase](val traver val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -149,7 +149,7 @@ final class TraversalJumptargetBase[NodeType <: nodes.JumpTargetBase](val traver case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 43, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.parserTypeName == value } } @@ -163,7 +163,7 @@ final class TraversalJumptargetBase[NodeType <: nodes.JumpTargetBase](val traver val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 43, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 8112524ec..1222970d9 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 @@ -33,7 +33,7 @@ final class TraversalKeyvaluepairBase[NodeType <: nodes.KeyValuePairBase](val tr case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 34, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 32, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.key == value } } @@ -47,7 +47,7 @@ final class TraversalKeyvaluepairBase[NodeType <: nodes.KeyValuePairBase](val tr val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 34, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 32, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -101,7 +101,7 @@ final class TraversalKeyvaluepairBase[NodeType <: nodes.KeyValuePairBase](val tr case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 55, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 49, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.value == value } } @@ -115,7 +115,7 @@ final class TraversalKeyvaluepairBase[NodeType <: nodes.KeyValuePairBase](val tr val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 55, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 49, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 d22a3f004..1ffe14082 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 @@ -40,7 +40,7 @@ final class TraversalLiteralBase[NodeType <: nodes.LiteralBase](val traversal: I case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.typeFullName == value } } @@ -54,7 +54,7 @@ final class TraversalLiteralBase[NodeType <: nodes.LiteralBase](val traversal: I val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 7ad10d67d..c1d8a1a47 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 @@ -37,7 +37,7 @@ final class TraversalLocalBase[NodeType <: nodes.LocalBase](val traversal: Itera case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 8, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 6, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { node => @@ -109,7 +109,7 @@ final class TraversalLocalBase[NodeType <: nodes.LocalBase](val traversal: Itera case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 24, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.genericSignature == value } } @@ -123,7 +123,7 @@ final class TraversalLocalBase[NodeType <: nodes.LocalBase](val traversal: Itera val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 24, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -181,7 +181,7 @@ final class TraversalLocalBase[NodeType <: nodes.LocalBase](val traversal: Itera case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.typeFullName == value } } @@ -195,7 +195,7 @@ final class TraversalLocalBase[NodeType <: nodes.LocalBase](val traversal: Itera val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] } case _ => diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalLocationBase.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalLocationBase.scala deleted file mode 100644 index 87b306e68..000000000 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalLocationBase.scala +++ /dev/null @@ -1,680 +0,0 @@ -package io.shiftleft.codepropertygraph.generated.traversals - -import io.shiftleft.codepropertygraph.generated.nodes -import io.shiftleft.codepropertygraph.generated.accessors.languagebootstrap.* - -final class TraversalLocationBase[NodeType <: nodes.LocationBase](val traversal: Iterator[NodeType]) extends AnyVal { - - /** Traverse to className property */ - def className: Iterator[String] = - traversal.map(_.className) - - /** Traverse to nodes where the className matches the regular expression `value` - */ - def className(pattern: String): Iterator[NodeType] = - if (!flatgraph.misc.Regex.isRegex(pattern)) { - classNameExact(pattern) - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filter { item => matcher.reset(item.className).matches } - } - - /** Traverse to nodes where the className matches at least one of the regular expressions in `values` - */ - def className(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.exists { _.reset(item.className).matches } } - } - - /** Traverse to nodes where className matches `value` exactly. - */ - def classNameExact(value: String): Iterator[NodeType] = traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 6, value) - .asInstanceOf[Iterator[NodeType]] - case _ => traversal.filter { _.className == value } - } - - /** Traverse to nodes where className matches one of the elements in `values` exactly. - */ - def classNameExact(values: String*): Iterator[NodeType] = { - if (values.length == 1) return classNameExact(values.head) - traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - values.iterator.flatMap { value => - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 6, value) - .asInstanceOf[Iterator[NodeType]] - } - case _ => - val valueSet = values.toSet - traversal.filter { item => valueSet.contains(item.className) } - } - } - - /** Traverse to nodes where className does not match the regular expression `value`. - */ - def classNameNot(pattern: String): Iterator[NodeType] = { - if (!flatgraph.misc.Regex.isRegex(pattern)) { - traversal.filter { node => node.className != pattern } - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filterNot { item => matcher.reset(item.className).matches } - } - } - - /** Traverse to nodes where className does not match any of the regular expressions in `values`. - */ - def classNameNot(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.find { _.reset(item.className).matches }.isEmpty } - } - - /** Traverse to classShortName property */ - def classShortName: Iterator[String] = - traversal.map(_.classShortName) - - /** Traverse to nodes where the classShortName matches the regular expression `value` - */ - def classShortName(pattern: String): Iterator[NodeType] = - if (!flatgraph.misc.Regex.isRegex(pattern)) { - classShortNameExact(pattern) - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filter { item => matcher.reset(item.classShortName).matches } - } - - /** Traverse to nodes where the classShortName matches at least one of the regular expressions in `values` - */ - def classShortName(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.exists { _.reset(item.classShortName).matches } } - } - - /** Traverse to nodes where classShortName matches `value` exactly. - */ - def classShortNameExact(value: String): Iterator[NodeType] = traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 7, value) - .asInstanceOf[Iterator[NodeType]] - case _ => traversal.filter { _.classShortName == value } - } - - /** Traverse to nodes where classShortName matches one of the elements in `values` exactly. - */ - def classShortNameExact(values: String*): Iterator[NodeType] = { - if (values.length == 1) return classShortNameExact(values.head) - traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - values.iterator.flatMap { value => - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 7, value) - .asInstanceOf[Iterator[NodeType]] - } - case _ => - val valueSet = values.toSet - traversal.filter { item => valueSet.contains(item.classShortName) } - } - } - - /** Traverse to nodes where classShortName does not match the regular expression `value`. - */ - def classShortNameNot(pattern: String): Iterator[NodeType] = { - if (!flatgraph.misc.Regex.isRegex(pattern)) { - traversal.filter { node => node.classShortName != pattern } - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filterNot { item => matcher.reset(item.classShortName).matches } - } - } - - /** Traverse to nodes where classShortName does not match any of the regular expressions in `values`. - */ - def classShortNameNot(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.find { _.reset(item.classShortName).matches }.isEmpty } - } - - /** Traverse to columnNumber property */ - def columnNumber: Iterator[Int] = - traversal.flatMap(_.columnNumber) - - /** Traverse to nodes where the columnNumber equals the given `value` - */ - def columnNumber(value: Int): Iterator[NodeType] = - traversal.filter { node => - val tmp = node.columnNumber; tmp.isDefined && tmp.get == value - } - - /** Traverse to nodes where the columnNumber equals at least one of the given `values` - */ - def columnNumber(values: Int*): Iterator[NodeType] = { - val vset = values.toSet - traversal.filter { node => - val tmp = node.columnNumber; tmp.isDefined && vset.contains(tmp.get) - } - } - - /** Traverse to nodes where the columnNumber is not equal to the given `value` - */ - def columnNumberNot(value: Int): Iterator[NodeType] = - traversal.filter { node => - val tmp = node.columnNumber; tmp.isEmpty || tmp.get != value - } - - /** Traverse to nodes where the columnNumber does not equal any one of the given `values` - */ - def columnNumberNot(values: Int*): Iterator[NodeType] = { - val vset = values.toSet - traversal.filter { node => - val tmp = node.columnNumber; tmp.isEmpty || !vset.contains(tmp.get) - } - } - - /** Traverse to nodes where the columnNumber is greater than the given `value` - */ - def columnNumberGt(value: Int): Iterator[NodeType] = - traversal.filter { node => - val tmp = node.columnNumber; tmp.isDefined && tmp.get > value - } - - /** Traverse to nodes where the columnNumber is greater than or equal the given `value` - */ - def columnNumberGte(value: Int): Iterator[NodeType] = - traversal.filter { node => - val tmp = node.columnNumber; tmp.isDefined && tmp.get >= value - } - - /** Traverse to nodes where the columnNumber is less than the given `value` - */ - def columnNumberLt(value: Int): Iterator[NodeType] = - traversal.filter { node => - val tmp = node.columnNumber; tmp.isDefined && tmp.get < value - } - - /** Traverse to nodes where the columnNumber is less than or equal the given `value` - */ - def columnNumberLte(value: Int): Iterator[NodeType] = - traversal.filter { node => - val tmp = node.columnNumber; tmp.isDefined && tmp.get <= value - } - - /** Traverse to filename property */ - def filename: Iterator[String] = - traversal.map(_.filename) - - /** Traverse to nodes where the filename matches the regular expression `value` - */ - def filename(pattern: String): Iterator[NodeType] = - if (!flatgraph.misc.Regex.isRegex(pattern)) { - filenameExact(pattern) - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filter { item => matcher.reset(item.filename).matches } - } - - /** Traverse to nodes where the filename matches at least one of the regular expressions in `values` - */ - def filename(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.exists { _.reset(item.filename).matches } } - } - - /** Traverse to nodes where filename matches `value` exactly. - */ - 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 - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) - .asInstanceOf[Iterator[NodeType]] - case _ => traversal.filter { _.filename == value } - } - - /** Traverse to nodes where filename matches one of the elements in `values` exactly. - */ - def filenameExact(values: String*): Iterator[NodeType] = { - 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 - values.iterator.flatMap { value => - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) - .asInstanceOf[Iterator[NodeType]] - } - case _ => - val valueSet = values.toSet - traversal.filter { item => valueSet.contains(item.filename) } - } - } - - /** Traverse to nodes where filename does not match the regular expression `value`. - */ - def filenameNot(pattern: String): Iterator[NodeType] = { - if (!flatgraph.misc.Regex.isRegex(pattern)) { - traversal.filter { node => node.filename != pattern } - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filterNot { item => matcher.reset(item.filename).matches } - } - } - - /** Traverse to nodes where filename does not match any of the regular expressions in `values`. - */ - def filenameNot(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.find { _.reset(item.filename).matches }.isEmpty } - } - - /** Traverse to lineNumber property */ - def lineNumber: Iterator[Int] = - traversal.flatMap(_.lineNumber) - - /** Traverse to nodes where the lineNumber equals the given `value` - */ - def lineNumber(value: Int): Iterator[NodeType] = - traversal.filter { node => - val tmp = node.lineNumber; tmp.isDefined && tmp.get == value - } - - /** Traverse to nodes where the lineNumber equals at least one of the given `values` - */ - def lineNumber(values: Int*): Iterator[NodeType] = { - val vset = values.toSet - traversal.filter { node => - val tmp = node.lineNumber; tmp.isDefined && vset.contains(tmp.get) - } - } - - /** Traverse to nodes where the lineNumber is not equal to the given `value` - */ - def lineNumberNot(value: Int): Iterator[NodeType] = - traversal.filter { node => - val tmp = node.lineNumber; tmp.isEmpty || tmp.get != value - } - - /** Traverse to nodes where the lineNumber does not equal any one of the given `values` - */ - def lineNumberNot(values: Int*): Iterator[NodeType] = { - val vset = values.toSet - traversal.filter { node => - val tmp = node.lineNumber; tmp.isEmpty || !vset.contains(tmp.get) - } - } - - /** Traverse to nodes where the lineNumber is greater than the given `value` - */ - def lineNumberGt(value: Int): Iterator[NodeType] = - traversal.filter { node => - val tmp = node.lineNumber; tmp.isDefined && tmp.get > value - } - - /** Traverse to nodes where the lineNumber is greater than or equal the given `value` - */ - def lineNumberGte(value: Int): Iterator[NodeType] = - traversal.filter { node => - val tmp = node.lineNumber; tmp.isDefined && tmp.get >= value - } - - /** Traverse to nodes where the lineNumber is less than the given `value` - */ - def lineNumberLt(value: Int): Iterator[NodeType] = - traversal.filter { node => - val tmp = node.lineNumber; tmp.isDefined && tmp.get < value - } - - /** Traverse to nodes where the lineNumber is less than or equal the given `value` - */ - def lineNumberLte(value: Int): Iterator[NodeType] = - traversal.filter { node => - val tmp = node.lineNumber; tmp.isDefined && tmp.get <= value - } - - /** Traverse to methodFullName property */ - def methodFullName: Iterator[String] = - traversal.map(_.methodFullName) - - /** Traverse to nodes where the methodFullName matches the regular expression `value` - */ - def methodFullName(pattern: String): Iterator[NodeType] = - if (!flatgraph.misc.Regex.isRegex(pattern)) { - methodFullNameExact(pattern) - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filter { item => matcher.reset(item.methodFullName).matches } - } - - /** Traverse to nodes where the methodFullName matches at least one of the regular expressions in `values` - */ - def methodFullName(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.exists { _.reset(item.methodFullName).matches } } - } - - /** Traverse to nodes where methodFullName matches `value` exactly. - */ - 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 - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) - .asInstanceOf[Iterator[NodeType]] - case _ => traversal.filter { _.methodFullName == value } - } - - /** Traverse to nodes where methodFullName matches one of the elements in `values` exactly. - */ - def methodFullNameExact(values: String*): Iterator[NodeType] = { - 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 - values.iterator.flatMap { value => - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) - .asInstanceOf[Iterator[NodeType]] - } - case _ => - val valueSet = values.toSet - traversal.filter { item => valueSet.contains(item.methodFullName) } - } - } - - /** Traverse to nodes where methodFullName does not match the regular expression `value`. - */ - def methodFullNameNot(pattern: String): Iterator[NodeType] = { - if (!flatgraph.misc.Regex.isRegex(pattern)) { - traversal.filter { node => node.methodFullName != pattern } - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filterNot { item => matcher.reset(item.methodFullName).matches } - } - } - - /** Traverse to nodes where methodFullName does not match any of the regular expressions in `values`. - */ - def methodFullNameNot(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.find { _.reset(item.methodFullName).matches }.isEmpty } - } - - /** Traverse to methodShortName property */ - def methodShortName: Iterator[String] = - traversal.map(_.methodShortName) - - /** Traverse to nodes where the methodShortName matches the regular expression `value` - */ - def methodShortName(pattern: String): Iterator[NodeType] = - if (!flatgraph.misc.Regex.isRegex(pattern)) { - methodShortNameExact(pattern) - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filter { item => matcher.reset(item.methodShortName).matches } - } - - /** Traverse to nodes where the methodShortName matches at least one of the regular expressions in `values` - */ - def methodShortName(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.exists { _.reset(item.methodShortName).matches } } - } - - /** Traverse to nodes where methodShortName matches `value` exactly. - */ - def methodShortNameExact(value: String): Iterator[NodeType] = traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) - .asInstanceOf[Iterator[NodeType]] - case _ => traversal.filter { _.methodShortName == value } - } - - /** Traverse to nodes where methodShortName matches one of the elements in `values` exactly. - */ - def methodShortNameExact(values: String*): Iterator[NodeType] = { - if (values.length == 1) return methodShortNameExact(values.head) - traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - values.iterator.flatMap { value => - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) - .asInstanceOf[Iterator[NodeType]] - } - case _ => - val valueSet = values.toSet - traversal.filter { item => valueSet.contains(item.methodShortName) } - } - } - - /** Traverse to nodes where methodShortName does not match the regular expression `value`. - */ - def methodShortNameNot(pattern: String): Iterator[NodeType] = { - if (!flatgraph.misc.Regex.isRegex(pattern)) { - traversal.filter { node => node.methodShortName != pattern } - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filterNot { item => matcher.reset(item.methodShortName).matches } - } - } - - /** Traverse to nodes where methodShortName does not match any of the regular expressions in `values`. - */ - def methodShortNameNot(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.find { _.reset(item.methodShortName).matches }.isEmpty } - } - - /** Traverse to nodeLabel property */ - def nodeLabel: Iterator[String] = - traversal.map(_.nodeLabel) - - /** Traverse to nodes where the nodeLabel matches the regular expression `value` - */ - def nodeLabel(pattern: String): Iterator[NodeType] = - if (!flatgraph.misc.Regex.isRegex(pattern)) { - nodeLabelExact(pattern) - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filter { item => matcher.reset(item.nodeLabel).matches } - } - - /** Traverse to nodes where the nodeLabel matches at least one of the regular expressions in `values` - */ - def nodeLabel(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.exists { _.reset(item.nodeLabel).matches } } - } - - /** Traverse to nodes where nodeLabel matches `value` exactly. - */ - def nodeLabelExact(value: String): Iterator[NodeType] = traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 42, value) - .asInstanceOf[Iterator[NodeType]] - case _ => traversal.filter { _.nodeLabel == value } - } - - /** Traverse to nodes where nodeLabel matches one of the elements in `values` exactly. - */ - def nodeLabelExact(values: String*): Iterator[NodeType] = { - if (values.length == 1) return nodeLabelExact(values.head) - traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - values.iterator.flatMap { value => - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 42, value) - .asInstanceOf[Iterator[NodeType]] - } - case _ => - val valueSet = values.toSet - traversal.filter { item => valueSet.contains(item.nodeLabel) } - } - } - - /** Traverse to nodes where nodeLabel does not match the regular expression `value`. - */ - def nodeLabelNot(pattern: String): Iterator[NodeType] = { - if (!flatgraph.misc.Regex.isRegex(pattern)) { - traversal.filter { node => node.nodeLabel != pattern } - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filterNot { item => matcher.reset(item.nodeLabel).matches } - } - } - - /** Traverse to nodes where nodeLabel does not match any of the regular expressions in `values`. - */ - def nodeLabelNot(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.find { _.reset(item.nodeLabel).matches }.isEmpty } - } - - /** Traverse to packageName property */ - def packageName: Iterator[String] = - traversal.map(_.packageName) - - /** Traverse to nodes where the packageName matches the regular expression `value` - */ - def packageName(pattern: String): Iterator[NodeType] = - if (!flatgraph.misc.Regex.isRegex(pattern)) { - packageNameExact(pattern) - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filter { item => matcher.reset(item.packageName).matches } - } - - /** Traverse to nodes where the packageName matches at least one of the regular expressions in `values` - */ - def packageName(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.exists { _.reset(item.packageName).matches } } - } - - /** Traverse to nodes where packageName matches `value` exactly. - */ - def packageNameExact(value: String): Iterator[NodeType] = traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 47, value) - .asInstanceOf[Iterator[NodeType]] - case _ => traversal.filter { _.packageName == value } - } - - /** Traverse to nodes where packageName matches one of the elements in `values` exactly. - */ - def packageNameExact(values: String*): Iterator[NodeType] = { - if (values.length == 1) return packageNameExact(values.head) - traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - values.iterator.flatMap { value => - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 47, value) - .asInstanceOf[Iterator[NodeType]] - } - case _ => - val valueSet = values.toSet - traversal.filter { item => valueSet.contains(item.packageName) } - } - } - - /** Traverse to nodes where packageName does not match the regular expression `value`. - */ - def packageNameNot(pattern: String): Iterator[NodeType] = { - if (!flatgraph.misc.Regex.isRegex(pattern)) { - traversal.filter { node => node.packageName != pattern } - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filterNot { item => matcher.reset(item.packageName).matches } - } - } - - /** Traverse to nodes where packageName does not match any of the regular expressions in `values`. - */ - def packageNameNot(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.find { _.reset(item.packageName).matches }.isEmpty } - } - - /** Traverse to symbol property */ - def symbol: Iterator[String] = - traversal.map(_.symbol) - - /** Traverse to nodes where the symbol matches the regular expression `value` - */ - def symbol(pattern: String): Iterator[NodeType] = - if (!flatgraph.misc.Regex.isRegex(pattern)) { - symbolExact(pattern) - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filter { item => matcher.reset(item.symbol).matches } - } - - /** Traverse to nodes where the symbol matches at least one of the regular expressions in `values` - */ - def symbol(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.exists { _.reset(item.symbol).matches } } - } - - /** Traverse to nodes where symbol matches `value` exactly. - */ - def symbolExact(value: String): Iterator[NodeType] = traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 52, value) - .asInstanceOf[Iterator[NodeType]] - case _ => traversal.filter { _.symbol == value } - } - - /** Traverse to nodes where symbol matches one of the elements in `values` exactly. - */ - def symbolExact(values: String*): Iterator[NodeType] = { - if (values.length == 1) return symbolExact(values.head) - traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - values.iterator.flatMap { value => - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 52, value) - .asInstanceOf[Iterator[NodeType]] - } - case _ => - val valueSet = values.toSet - traversal.filter { item => valueSet.contains(item.symbol) } - } - } - - /** Traverse to nodes where symbol does not match the regular expression `value`. - */ - def symbolNot(pattern: String): Iterator[NodeType] = { - if (!flatgraph.misc.Regex.isRegex(pattern)) { - traversal.filter { node => node.symbol != pattern } - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filterNot { item => matcher.reset(item.symbol).matches } - } - } - - /** Traverse to nodes where symbol does not match any of the regular expressions in `values`. - */ - def symbolNot(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.find { _.reset(item.symbol).matches }.isEmpty } - } - -} 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 092c4d8bc..9747cc084 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 @@ -172,7 +172,7 @@ final class TraversalMemberBase[NodeType <: nodes.MemberBase](val traversal: Ite case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 24, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.genericSignature == value } } @@ -186,7 +186,7 @@ final class TraversalMemberBase[NodeType <: nodes.MemberBase](val traversal: Ite val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 24, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -244,7 +244,7 @@ final class TraversalMemberBase[NodeType <: nodes.MemberBase](val traversal: Ite case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.typeFullName == value } } @@ -258,7 +258,7 @@ final class TraversalMemberBase[NodeType <: nodes.MemberBase](val traversal: Ite val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 9cbca6802..5ea9f6296 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 @@ -37,7 +37,7 @@ final class TraversalMetadataBase[NodeType <: nodes.MetaDataBase](val traversal: case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 25, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { node => @@ -105,7 +105,7 @@ final class TraversalMetadataBase[NodeType <: nodes.MetaDataBase](val traversal: case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 35, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 33, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.language == value } } @@ -119,7 +119,7 @@ final class TraversalMetadataBase[NodeType <: nodes.MetaDataBase](val traversal: val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 35, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 33, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -177,7 +177,7 @@ final class TraversalMetadataBase[NodeType <: nodes.MetaDataBase](val traversal: case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 45, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.root == value } } @@ -191,7 +191,7 @@ final class TraversalMetadataBase[NodeType <: nodes.MetaDataBase](val traversal: val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 45, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -245,7 +245,7 @@ final class TraversalMetadataBase[NodeType <: nodes.MetaDataBase](val traversal: case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 56, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.version == value } } @@ -259,7 +259,7 @@ final class TraversalMetadataBase[NodeType <: nodes.MetaDataBase](val traversal: val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 56, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 d6720e54b..8fc3c52d3 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 @@ -232,7 +232,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 20, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.filename == value } } @@ -246,7 +246,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 20, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -300,7 +300,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.fullName == value } } @@ -314,7 +314,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -368,7 +368,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 24, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.genericSignature == value } } @@ -382,7 +382,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 24, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -441,7 +441,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 25, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { node => @@ -582,7 +582,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 51, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 46, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.signature == value } } @@ -596,7 +596,7 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 51, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 46, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 214328322..4bf2c6bd9 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 @@ -38,7 +38,7 @@ final class TraversalMethodparameterinBase[NodeType <: nodes.MethodParameterInBa case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 8, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 6, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { node => @@ -110,7 +110,7 @@ final class TraversalMethodparameterinBase[NodeType <: nodes.MethodParameterInBa case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 19, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.evaluationStrategy == value } } @@ -124,7 +124,7 @@ final class TraversalMethodparameterinBase[NodeType <: nodes.MethodParameterInBa val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 19, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -239,7 +239,7 @@ final class TraversalMethodparameterinBase[NodeType <: nodes.MethodParameterInBa case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.typeFullName == value } } @@ -253,7 +253,7 @@ final class TraversalMethodparameterinBase[NodeType <: nodes.MethodParameterInBa val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 5bcbbfae9..625a659e6 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 @@ -33,7 +33,7 @@ final class TraversalMethodparameteroutBase[NodeType <: nodes.MethodParameterOut case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 19, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.evaluationStrategy == value } } @@ -47,7 +47,7 @@ final class TraversalMethodparameteroutBase[NodeType <: nodes.MethodParameterOut val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 19, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -158,7 +158,7 @@ final class TraversalMethodparameteroutBase[NodeType <: nodes.MethodParameterOut case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.typeFullName == value } } @@ -172,7 +172,7 @@ final class TraversalMethodparameteroutBase[NodeType <: nodes.MethodParameterOut val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 915812ccf..69192594c 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 @@ -36,7 +36,7 @@ final class TraversalMethodrefBase[NodeType <: nodes.MethodRefBase](val traversa case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 36, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.methodFullName == value } } @@ -50,7 +50,7 @@ final class TraversalMethodrefBase[NodeType <: nodes.MethodRefBase](val traversa val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 36, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -108,7 +108,7 @@ final class TraversalMethodrefBase[NodeType <: nodes.MethodRefBase](val traversa case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.typeFullName == value } } @@ -122,7 +122,7 @@ final class TraversalMethodrefBase[NodeType <: nodes.MethodRefBase](val traversa val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 eafadb654..f2577c4a3 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 @@ -37,7 +37,7 @@ final class TraversalMethodreturnBase[NodeType <: nodes.MethodReturnBase](val tr case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 19, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.evaluationStrategy == value } } @@ -51,7 +51,7 @@ final class TraversalMethodreturnBase[NodeType <: nodes.MethodReturnBase](val tr val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 19, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -109,7 +109,7 @@ final class TraversalMethodreturnBase[NodeType <: nodes.MethodReturnBase](val tr case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.typeFullName == value } } @@ -123,7 +123,7 @@ final class TraversalMethodreturnBase[NodeType <: nodes.MethodReturnBase](val tr val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 6f2a0c7ab..8bfc0b0c5 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 @@ -32,7 +32,7 @@ final class TraversalModifierBase[NodeType <: nodes.ModifierBase](val traversal: case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 40, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 37, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.modifierType == value } } @@ -46,7 +46,7 @@ final class TraversalModifierBase[NodeType <: nodes.ModifierBase](val traversal: val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 40, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 37, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 df275da34..8aad8811c 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 @@ -32,7 +32,7 @@ final class TraversalNamespaceBase[NodeType <: nodes.NamespaceBase](val traversa case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.name == value } } @@ -46,7 +46,7 @@ final class TraversalNamespaceBase[NodeType <: nodes.NamespaceBase](val traversa val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 bf222e67f..899a1db89 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 @@ -33,7 +33,7 @@ final class TraversalNamespaceblockBase[NodeType <: nodes.NamespaceBlockBase](va case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 20, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.filename == value } } @@ -47,7 +47,7 @@ final class TraversalNamespaceblockBase[NodeType <: nodes.NamespaceBlockBase](va val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 20, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -101,7 +101,7 @@ final class TraversalNamespaceblockBase[NodeType <: nodes.NamespaceBlockBase](va case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.fullName == value } } @@ -115,7 +115,7 @@ final class TraversalNamespaceblockBase[NodeType <: nodes.NamespaceBlockBase](va val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -169,7 +169,7 @@ final class TraversalNamespaceblockBase[NodeType <: nodes.NamespaceBlockBase](va case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.name == value } } @@ -183,7 +183,7 @@ final class TraversalNamespaceblockBase[NodeType <: nodes.NamespaceBlockBase](va val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] } case _ => diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyClassName.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyClassName.scala deleted file mode 100644 index 49f9589e0..000000000 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyClassName.scala +++ /dev/null @@ -1,78 +0,0 @@ -package io.shiftleft.codepropertygraph.generated.traversals - -import io.shiftleft.codepropertygraph.generated.nodes -import io.shiftleft.codepropertygraph.generated.accessors.languagebootstrap.* - -final class TraversalPropertyClassName[NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasClassNameEMT]]( - val traversal: Iterator[NodeType] -) extends AnyVal { - - /** Traverse to className property */ - def className: Iterator[String] = - traversal.map(_.className) - - /** Traverse to nodes where the className matches the regular expression `value` - */ - def className(pattern: String): Iterator[NodeType] = - if (!flatgraph.misc.Regex.isRegex(pattern)) { - classNameExact(pattern) - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filter { item => matcher.reset(item.className).matches } - } - - /** Traverse to nodes where the className matches at least one of the regular expressions in `values` - */ - def className(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.exists { _.reset(item.className).matches } } - } - - /** Traverse to nodes where className matches `value` exactly. - */ - def classNameExact(value: String): Iterator[NodeType] = traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 6, value) - .asInstanceOf[Iterator[NodeType]] - case _ => traversal.filter { _.className == value } - } - - /** Traverse to nodes where className matches one of the elements in `values` exactly. - */ - def classNameExact(values: String*): Iterator[NodeType] = { - if (values.length == 1) return classNameExact(values.head) - traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - values.iterator.flatMap { value => - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 6, value) - .asInstanceOf[Iterator[NodeType]] - } - case _ => - val valueSet = values.toSet - traversal.filter { item => valueSet.contains(item.className) } - } - } - - /** Traverse to nodes where className does not match the regular expression `value`. - */ - def classNameNot(pattern: String): Iterator[NodeType] = { - if (!flatgraph.misc.Regex.isRegex(pattern)) { - traversal.filter { node => node.className != pattern } - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filterNot { item => matcher.reset(item.className).matches } - } - } - - /** Traverse to nodes where className does not match any of the regular expressions in `values`. - */ - def classNameNot(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.find { _.reset(item.className).matches }.isEmpty } - } - -} diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyClassShortName.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyClassShortName.scala deleted file mode 100644 index f30b7edc9..000000000 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyClassShortName.scala +++ /dev/null @@ -1,79 +0,0 @@ -package io.shiftleft.codepropertygraph.generated.traversals - -import io.shiftleft.codepropertygraph.generated.nodes -import io.shiftleft.codepropertygraph.generated.accessors.languagebootstrap.* - -final class TraversalPropertyClassShortName[ - NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasClassShortNameEMT] -](val traversal: Iterator[NodeType]) - extends AnyVal { - - /** Traverse to classShortName property */ - def classShortName: Iterator[String] = - traversal.map(_.classShortName) - - /** Traverse to nodes where the classShortName matches the regular expression `value` - */ - def classShortName(pattern: String): Iterator[NodeType] = - if (!flatgraph.misc.Regex.isRegex(pattern)) { - classShortNameExact(pattern) - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filter { item => matcher.reset(item.classShortName).matches } - } - - /** Traverse to nodes where the classShortName matches at least one of the regular expressions in `values` - */ - def classShortName(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.exists { _.reset(item.classShortName).matches } } - } - - /** Traverse to nodes where classShortName matches `value` exactly. - */ - def classShortNameExact(value: String): Iterator[NodeType] = traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 7, value) - .asInstanceOf[Iterator[NodeType]] - case _ => traversal.filter { _.classShortName == value } - } - - /** Traverse to nodes where classShortName matches one of the elements in `values` exactly. - */ - def classShortNameExact(values: String*): Iterator[NodeType] = { - if (values.length == 1) return classShortNameExact(values.head) - traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - values.iterator.flatMap { value => - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 7, value) - .asInstanceOf[Iterator[NodeType]] - } - case _ => - val valueSet = values.toSet - traversal.filter { item => valueSet.contains(item.classShortName) } - } - } - - /** Traverse to nodes where classShortName does not match the regular expression `value`. - */ - def classShortNameNot(pattern: String): Iterator[NodeType] = { - if (!flatgraph.misc.Regex.isRegex(pattern)) { - traversal.filter { node => node.classShortName != pattern } - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filterNot { item => matcher.reset(item.classShortName).matches } - } - } - - /** Traverse to nodes where classShortName does not match any of the regular expressions in `values`. - */ - def classShortNameNot(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.find { _.reset(item.classShortName).matches }.isEmpty } - } - -} 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 ba7d043b6..44b90ee3b 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 @@ -40,7 +40,7 @@ final class TraversalPropertyClosureBindingId[ case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 8, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 6, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { node => diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyClosureOriginalName.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyClosureOriginalName.scala index e85a2f35c..ee51c2010 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyClosureOriginalName.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyClosureOriginalName.scala @@ -40,7 +40,7 @@ final class TraversalPropertyClosureOriginalName[ case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 9, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 7, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { node => 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 7f6a7609e..fed8e5db7 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 @@ -34,7 +34,7 @@ final class TraversalPropertyCode[NodeType <: nodes.StoredNode & nodes.StaticTyp case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 10, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 8, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.code == value } } @@ -48,7 +48,7 @@ final class TraversalPropertyCode[NodeType <: nodes.StoredNode & nodes.StaticTyp val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 10, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 8, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 f36a5c65a..c23a2bd67 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 @@ -34,7 +34,7 @@ final class TraversalPropertyContainedRef[NodeType <: nodes.StoredNode & nodes.S case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 13, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 11, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.containedRef == value } } @@ -48,7 +48,7 @@ final class TraversalPropertyContainedRef[NodeType <: nodes.StoredNode & nodes.S val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 13, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 11, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 9800f3a41..b9c5a5a4a 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 @@ -34,7 +34,7 @@ final class TraversalPropertyContent[NodeType <: nodes.StoredNode & nodes.Static case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 14, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 12, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.content == value } } @@ -48,7 +48,7 @@ final class TraversalPropertyContent[NodeType <: nodes.StoredNode & nodes.Static val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 14, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 12, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 fe4116295..4a3e2eb39 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 @@ -35,7 +35,7 @@ final class TraversalPropertyControlStructureType[ case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 15, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 13, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.controlStructureType == value } } @@ -49,7 +49,7 @@ final class TraversalPropertyControlStructureType[ val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 15, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 13, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 bad95dd9f..8aeff5ba0 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 @@ -40,7 +40,7 @@ final class TraversalPropertyDependencyGroupId[ case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 16, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 14, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { node => 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 3229e5e6b..0996d14c5 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 @@ -34,7 +34,7 @@ final class TraversalPropertyDispatchType[NodeType <: nodes.StoredNode & nodes.S case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 15, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.dispatchType == value } } @@ -48,7 +48,7 @@ final class TraversalPropertyDispatchType[NodeType <: nodes.StoredNode & nodes.S val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 15, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 0cbb6b66c..d25b24302 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 @@ -35,7 +35,7 @@ final class TraversalPropertyEvaluationStrategy[ case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 19, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.evaluationStrategy == value } } @@ -49,7 +49,7 @@ final class TraversalPropertyEvaluationStrategy[ val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 19, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 17, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 293d3698e..4e318b684 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 @@ -34,7 +34,7 @@ final class TraversalPropertyFilename[NodeType <: nodes.StoredNode & nodes.Stati case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 20, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.filename == value } } @@ -48,7 +48,7 @@ final class TraversalPropertyFilename[NodeType <: nodes.StoredNode & nodes.Stati val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 20, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 686e5d11a..c88013b6e 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 @@ -34,7 +34,7 @@ final class TraversalPropertyFullName[NodeType <: nodes.StoredNode & nodes.Stati case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.fullName == value } } @@ -48,7 +48,7 @@ final class TraversalPropertyFullName[NodeType <: nodes.StoredNode & nodes.Stati val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 dcf3387fa..a410c129a 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 @@ -35,7 +35,7 @@ final class TraversalPropertyGenericSignature[ case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 24, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.genericSignature == value } } @@ -49,7 +49,7 @@ final class TraversalPropertyGenericSignature[ val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 24, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 1a5e5b576..d465d24b0 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 @@ -39,7 +39,7 @@ final class TraversalPropertyHash[NodeType <: nodes.StoredNode & nodes.StaticTyp case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 25, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { node => 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 aa9083139..23646c0ab 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 @@ -39,7 +39,7 @@ final class TraversalPropertyImportedAs[NodeType <: nodes.StoredNode & nodes.Sta case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 26, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 24, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { node => 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 6eddf4255..3f189fffb 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 @@ -40,7 +40,7 @@ final class TraversalPropertyImportedEntity[ case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 27, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 25, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { node => 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 ec400b2c3..2f6104da3 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 @@ -34,7 +34,7 @@ final class TraversalPropertyKey[NodeType <: nodes.StoredNode & nodes.StaticType case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 34, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 32, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.key == value } } @@ -48,7 +48,7 @@ final class TraversalPropertyKey[NodeType <: nodes.StoredNode & nodes.StaticType val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 34, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 32, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 46df5d4a7..0de86be2d 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 @@ -34,7 +34,7 @@ final class TraversalPropertyLanguage[NodeType <: nodes.StoredNode & nodes.Stati case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 35, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 33, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.language == value } } @@ -48,7 +48,7 @@ final class TraversalPropertyLanguage[NodeType <: nodes.StoredNode & nodes.Stati val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 35, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 33, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 68aab36c8..15520093c 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 @@ -35,7 +35,7 @@ final class TraversalPropertyMethodFullName[ case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 36, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.methodFullName == value } } @@ -49,7 +49,7 @@ final class TraversalPropertyMethodFullName[ val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 36, value) .asInstanceOf[Iterator[NodeType]] } case _ => diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyMethodShortName.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyMethodShortName.scala deleted file mode 100644 index 019dcd2f2..000000000 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyMethodShortName.scala +++ /dev/null @@ -1,79 +0,0 @@ -package io.shiftleft.codepropertygraph.generated.traversals - -import io.shiftleft.codepropertygraph.generated.nodes -import io.shiftleft.codepropertygraph.generated.accessors.languagebootstrap.* - -final class TraversalPropertyMethodShortName[ - NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasMethodShortNameEMT] -](val traversal: Iterator[NodeType]) - extends AnyVal { - - /** Traverse to methodShortName property */ - def methodShortName: Iterator[String] = - traversal.map(_.methodShortName) - - /** Traverse to nodes where the methodShortName matches the regular expression `value` - */ - def methodShortName(pattern: String): Iterator[NodeType] = - if (!flatgraph.misc.Regex.isRegex(pattern)) { - methodShortNameExact(pattern) - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filter { item => matcher.reset(item.methodShortName).matches } - } - - /** Traverse to nodes where the methodShortName matches at least one of the regular expressions in `values` - */ - def methodShortName(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.exists { _.reset(item.methodShortName).matches } } - } - - /** Traverse to nodes where methodShortName matches `value` exactly. - */ - def methodShortNameExact(value: String): Iterator[NodeType] = traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) - .asInstanceOf[Iterator[NodeType]] - case _ => traversal.filter { _.methodShortName == value } - } - - /** Traverse to nodes where methodShortName matches one of the elements in `values` exactly. - */ - def methodShortNameExact(values: String*): Iterator[NodeType] = { - if (values.length == 1) return methodShortNameExact(values.head) - traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - values.iterator.flatMap { value => - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 39, value) - .asInstanceOf[Iterator[NodeType]] - } - case _ => - val valueSet = values.toSet - traversal.filter { item => valueSet.contains(item.methodShortName) } - } - } - - /** Traverse to nodes where methodShortName does not match the regular expression `value`. - */ - def methodShortNameNot(pattern: String): Iterator[NodeType] = { - if (!flatgraph.misc.Regex.isRegex(pattern)) { - traversal.filter { node => node.methodShortName != pattern } - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filterNot { item => matcher.reset(item.methodShortName).matches } - } - } - - /** Traverse to nodes where methodShortName does not match any of the regular expressions in `values`. - */ - def methodShortNameNot(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.find { _.reset(item.methodShortName).matches }.isEmpty } - } - -} 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 36a72ca7e..6747fe225 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 @@ -34,7 +34,7 @@ final class TraversalPropertyModifierType[NodeType <: nodes.StoredNode & nodes.S case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 40, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 37, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.modifierType == value } } @@ -48,7 +48,7 @@ final class TraversalPropertyModifierType[NodeType <: nodes.StoredNode & nodes.S val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 40, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 37, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 288031286..a5fecb323 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 @@ -34,7 +34,7 @@ final class TraversalPropertyName[NodeType <: nodes.StoredNode & nodes.StaticTyp case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.name == value } } @@ -48,7 +48,7 @@ final class TraversalPropertyName[NodeType <: nodes.StoredNode & nodes.StaticTyp val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] } case _ => diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyNodeLabel.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyNodeLabel.scala deleted file mode 100644 index f4a31edf0..000000000 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyNodeLabel.scala +++ /dev/null @@ -1,78 +0,0 @@ -package io.shiftleft.codepropertygraph.generated.traversals - -import io.shiftleft.codepropertygraph.generated.nodes -import io.shiftleft.codepropertygraph.generated.accessors.languagebootstrap.* - -final class TraversalPropertyNodeLabel[NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasNodeLabelEMT]]( - val traversal: Iterator[NodeType] -) extends AnyVal { - - /** Traverse to nodeLabel property */ - def nodeLabel: Iterator[String] = - traversal.map(_.nodeLabel) - - /** Traverse to nodes where the nodeLabel matches the regular expression `value` - */ - def nodeLabel(pattern: String): Iterator[NodeType] = - if (!flatgraph.misc.Regex.isRegex(pattern)) { - nodeLabelExact(pattern) - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filter { item => matcher.reset(item.nodeLabel).matches } - } - - /** Traverse to nodes where the nodeLabel matches at least one of the regular expressions in `values` - */ - def nodeLabel(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.exists { _.reset(item.nodeLabel).matches } } - } - - /** Traverse to nodes where nodeLabel matches `value` exactly. - */ - def nodeLabelExact(value: String): Iterator[NodeType] = traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 42, value) - .asInstanceOf[Iterator[NodeType]] - case _ => traversal.filter { _.nodeLabel == value } - } - - /** Traverse to nodes where nodeLabel matches one of the elements in `values` exactly. - */ - def nodeLabelExact(values: String*): Iterator[NodeType] = { - if (values.length == 1) return nodeLabelExact(values.head) - traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - values.iterator.flatMap { value => - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 42, value) - .asInstanceOf[Iterator[NodeType]] - } - case _ => - val valueSet = values.toSet - traversal.filter { item => valueSet.contains(item.nodeLabel) } - } - } - - /** Traverse to nodes where nodeLabel does not match the regular expression `value`. - */ - def nodeLabelNot(pattern: String): Iterator[NodeType] = { - if (!flatgraph.misc.Regex.isRegex(pattern)) { - traversal.filter { node => node.nodeLabel != pattern } - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filterNot { item => matcher.reset(item.nodeLabel).matches } - } - } - - /** Traverse to nodes where nodeLabel does not match any of the regular expressions in `values`. - */ - def nodeLabelNot(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.find { _.reset(item.nodeLabel).matches }.isEmpty } - } - -} diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyPackageName.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyPackageName.scala deleted file mode 100644 index 7e192c8c3..000000000 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyPackageName.scala +++ /dev/null @@ -1,78 +0,0 @@ -package io.shiftleft.codepropertygraph.generated.traversals - -import io.shiftleft.codepropertygraph.generated.nodes -import io.shiftleft.codepropertygraph.generated.accessors.languagebootstrap.* - -final class TraversalPropertyPackageName[NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasPackageNameEMT]]( - val traversal: Iterator[NodeType] -) extends AnyVal { - - /** Traverse to packageName property */ - def packageName: Iterator[String] = - traversal.map(_.packageName) - - /** Traverse to nodes where the packageName matches the regular expression `value` - */ - def packageName(pattern: String): Iterator[NodeType] = - if (!flatgraph.misc.Regex.isRegex(pattern)) { - packageNameExact(pattern) - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filter { item => matcher.reset(item.packageName).matches } - } - - /** Traverse to nodes where the packageName matches at least one of the regular expressions in `values` - */ - def packageName(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.exists { _.reset(item.packageName).matches } } - } - - /** Traverse to nodes where packageName matches `value` exactly. - */ - def packageNameExact(value: String): Iterator[NodeType] = traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 47, value) - .asInstanceOf[Iterator[NodeType]] - case _ => traversal.filter { _.packageName == value } - } - - /** Traverse to nodes where packageName matches one of the elements in `values` exactly. - */ - def packageNameExact(values: String*): Iterator[NodeType] = { - if (values.length == 1) return packageNameExact(values.head) - traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - values.iterator.flatMap { value => - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 47, value) - .asInstanceOf[Iterator[NodeType]] - } - case _ => - val valueSet = values.toSet - traversal.filter { item => valueSet.contains(item.packageName) } - } - } - - /** Traverse to nodes where packageName does not match the regular expression `value`. - */ - def packageNameNot(pattern: String): Iterator[NodeType] = { - if (!flatgraph.misc.Regex.isRegex(pattern)) { - traversal.filter { node => node.packageName != pattern } - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filterNot { item => matcher.reset(item.packageName).matches } - } - } - - /** Traverse to nodes where packageName does not match any of the regular expressions in `values`. - */ - def packageNameNot(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.find { _.reset(item.packageName).matches }.isEmpty } - } - -} 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 0e55c8b7c..7db893637 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 @@ -35,7 +35,7 @@ final class TraversalPropertyParserTypeName[ case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 43, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.parserTypeName == value } } @@ -49,7 +49,7 @@ final class TraversalPropertyParserTypeName[ val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 43, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 e56292da2..8d010090c 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 @@ -34,7 +34,7 @@ final class TraversalPropertyRoot[NodeType <: nodes.StoredNode & nodes.StaticTyp case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 45, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.root == value } } @@ -48,7 +48,7 @@ final class TraversalPropertyRoot[NodeType <: nodes.StoredNode & nodes.StaticTyp val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 45, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 180623dee..23e3288be 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 @@ -34,7 +34,7 @@ final class TraversalPropertySignature[NodeType <: nodes.StoredNode & nodes.Stat case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 51, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 46, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.signature == value } } @@ -48,7 +48,7 @@ final class TraversalPropertySignature[NodeType <: nodes.StoredNode & nodes.Stat val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 51, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 46, value) .asInstanceOf[Iterator[NodeType]] } case _ => diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertySymbol.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertySymbol.scala deleted file mode 100644 index a1561ac1a..000000000 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertySymbol.scala +++ /dev/null @@ -1,78 +0,0 @@ -package io.shiftleft.codepropertygraph.generated.traversals - -import io.shiftleft.codepropertygraph.generated.nodes -import io.shiftleft.codepropertygraph.generated.accessors.languagebootstrap.* - -final class TraversalPropertySymbol[NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasSymbolEMT]]( - val traversal: Iterator[NodeType] -) extends AnyVal { - - /** Traverse to symbol property */ - def symbol: Iterator[String] = - traversal.map(_.symbol) - - /** Traverse to nodes where the symbol matches the regular expression `value` - */ - def symbol(pattern: String): Iterator[NodeType] = - if (!flatgraph.misc.Regex.isRegex(pattern)) { - symbolExact(pattern) - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filter { item => matcher.reset(item.symbol).matches } - } - - /** Traverse to nodes where the symbol matches at least one of the regular expressions in `values` - */ - def symbol(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.exists { _.reset(item.symbol).matches } } - } - - /** Traverse to nodes where symbol matches `value` exactly. - */ - def symbolExact(value: String): Iterator[NodeType] = traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 52, value) - .asInstanceOf[Iterator[NodeType]] - case _ => traversal.filter { _.symbol == value } - } - - /** Traverse to nodes where symbol matches one of the elements in `values` exactly. - */ - def symbolExact(values: String*): Iterator[NodeType] = { - if (values.length == 1) return symbolExact(values.head) - traversal match { - case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => - val someNode = init.next - values.iterator.flatMap { value => - flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 52, value) - .asInstanceOf[Iterator[NodeType]] - } - case _ => - val valueSet = values.toSet - traversal.filter { item => valueSet.contains(item.symbol) } - } - } - - /** Traverse to nodes where symbol does not match the regular expression `value`. - */ - def symbolNot(pattern: String): Iterator[NodeType] = { - if (!flatgraph.misc.Regex.isRegex(pattern)) { - traversal.filter { node => node.symbol != pattern } - } else { - val matcher = flatgraph.misc.Regex.multilineMatcher(pattern) - traversal.filterNot { item => matcher.reset(item.symbol).matches } - } - } - - /** Traverse to nodes where symbol does not match any of the regular expressions in `values`. - */ - def symbolNot(patterns: String*): Iterator[NodeType] = { - val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher) - traversal.filter { item => matchers.find { _.reset(item.symbol).matches }.isEmpty } - } - -} 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 9a0cb7d44..9336cc957 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 @@ -35,7 +35,7 @@ final class TraversalPropertyTypeDeclFullName[ case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 53, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 47, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.typeDeclFullName == value } } @@ -49,7 +49,7 @@ final class TraversalPropertyTypeDeclFullName[ val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 53, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 47, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 5b399ab53..9535d0ad6 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 @@ -34,7 +34,7 @@ final class TraversalPropertyTypeFullName[NodeType <: nodes.StoredNode & nodes.S case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.typeFullName == value } } @@ -48,7 +48,7 @@ final class TraversalPropertyTypeFullName[NodeType <: nodes.StoredNode & nodes.S val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 513ab859d..727443fa8 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 @@ -34,7 +34,7 @@ final class TraversalPropertyValue[NodeType <: nodes.StoredNode & nodes.StaticTy case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 55, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 49, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.value == value } } @@ -48,7 +48,7 @@ final class TraversalPropertyValue[NodeType <: nodes.StoredNode & nodes.StaticTy val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 55, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 49, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 65d2f1400..436c35452 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 @@ -34,7 +34,7 @@ final class TraversalPropertyVersion[NodeType <: nodes.StoredNode & nodes.Static case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 56, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.version == value } } @@ -48,7 +48,7 @@ final class TraversalPropertyVersion[NodeType <: nodes.StoredNode & nodes.Static val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 56, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 50, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 1f39048e5..c04487021 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 @@ -32,7 +32,7 @@ final class TraversalTagBase[NodeType <: nodes.TagBase](val traversal: Iterator[ case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.name == value } } @@ -46,7 +46,7 @@ final class TraversalTagBase[NodeType <: nodes.TagBase](val traversal: Iterator[ val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -100,7 +100,7 @@ final class TraversalTagBase[NodeType <: nodes.TagBase](val traversal: Iterator[ case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 55, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 49, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.value == value } } @@ -114,7 +114,7 @@ final class TraversalTagBase[NodeType <: nodes.TagBase](val traversal: Iterator[ val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 55, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 49, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 aa99c3e44..f9e54e531 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 @@ -33,7 +33,7 @@ final class TraversalTemplatedomBase[NodeType <: nodes.TemplateDomBase](val trav case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.name == value } } @@ -47,7 +47,7 @@ final class TraversalTemplatedomBase[NodeType <: nodes.TemplateDomBase](val trav val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 eb2f09c79..eb4dc37d7 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 @@ -32,7 +32,7 @@ final class TraversalTypeBase[NodeType <: nodes.TypeBase](val traversal: Iterato case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.fullName == value } } @@ -46,7 +46,7 @@ final class TraversalTypeBase[NodeType <: nodes.TypeBase](val traversal: Iterato val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -100,7 +100,7 @@ final class TraversalTypeBase[NodeType <: nodes.TypeBase](val traversal: Iterato case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.name == value } } @@ -114,7 +114,7 @@ final class TraversalTypeBase[NodeType <: nodes.TypeBase](val traversal: Iterato val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -168,7 +168,7 @@ final class TraversalTypeBase[NodeType <: nodes.TypeBase](val traversal: Iterato case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 53, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 47, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.typeDeclFullName == value } } @@ -182,7 +182,7 @@ final class TraversalTypeBase[NodeType <: nodes.TypeBase](val traversal: Iterato val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 53, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 47, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 3d51767dd..cb45613fe 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 @@ -241,7 +241,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 20, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.filename == value } } @@ -255,7 +255,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 20, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -309,7 +309,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.fullName == value } } @@ -323,7 +323,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 21, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -377,7 +377,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 24, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.genericSignature == value } } @@ -391,7 +391,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 24, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 22, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -458,7 +458,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.name == value } } @@ -472,7 +472,7 @@ final class TraversalTypedeclBase[NodeType <: nodes.TypeDeclBase](val traversal: val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 86119fe7a..3547bbe56 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 @@ -33,7 +33,7 @@ final class TraversalTypeparameterBase[NodeType <: nodes.TypeParameterBase](val case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.name == value } } @@ -47,7 +47,7 @@ final class TraversalTypeparameterBase[NodeType <: nodes.TypeParameterBase](val val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 41, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 38, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 3df68bc53..9508185d2 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 @@ -40,7 +40,7 @@ final class TraversalTyperefBase[NodeType <: nodes.TypeRefBase](val traversal: I case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.typeFullName == value } } @@ -54,7 +54,7 @@ final class TraversalTyperefBase[NodeType <: nodes.TypeRefBase](val traversal: I val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] } case _ => 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 454379704..36e90b92e 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 @@ -32,7 +32,7 @@ final class TraversalUnknownBase[NodeType <: nodes.UnknownBase](val traversal: I case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 13, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 11, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.containedRef == value } } @@ -46,7 +46,7 @@ final class TraversalUnknownBase[NodeType <: nodes.UnknownBase](val traversal: I val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 13, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 11, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -104,7 +104,7 @@ final class TraversalUnknownBase[NodeType <: nodes.UnknownBase](val traversal: I case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 43, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.parserTypeName == value } } @@ -118,7 +118,7 @@ final class TraversalUnknownBase[NodeType <: nodes.UnknownBase](val traversal: I val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 43, value) .asInstanceOf[Iterator[NodeType]] } case _ => @@ -176,7 +176,7 @@ final class TraversalUnknownBase[NodeType <: nodes.UnknownBase](val traversal: I case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext => val someNode = init.next flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] case _ => traversal.filter { _.typeFullName == value } } @@ -190,7 +190,7 @@ final class TraversalUnknownBase[NodeType <: nodes.UnknownBase](val traversal: I val someNode = init.next values.iterator.flatMap { value => flatgraph.Accessors - .getWithInverseIndex(someNode.graph, someNode.nodeKind, 54, value) + .getWithInverseIndex(someNode.graph, someNode.nodeKind, 48, value) .asInstanceOf[Iterator[NodeType]] } case _ => diff --git a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/package.scala b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/package.scala index 4dff79a19..026fb00b3 100644 --- a/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/package.scala +++ b/domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/package.scala @@ -36,15 +36,6 @@ package object traversals { ](traversal: IterableOnce[NodeType]): TraversalPropertyCanonicalName[NodeType] = new TraversalPropertyCanonicalName( traversal.iterator ) - implicit def accessPropertyClassNameTraversal[ - NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasClassNameEMT] - ](traversal: IterableOnce[NodeType]): TraversalPropertyClassName[NodeType] = new TraversalPropertyClassName( - traversal.iterator - ) - implicit def accessPropertyClassShortNameTraversal[ - NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasClassShortNameEMT] - ](traversal: IterableOnce[NodeType]): TraversalPropertyClassShortName[NodeType] = - new TraversalPropertyClassShortName(traversal.iterator) implicit def accessPropertyClosureBindingIdTraversal[ NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasClosureBindingIdEMT] ](traversal: IterableOnce[NodeType]): TraversalPropertyClosureBindingId[NodeType] = @@ -172,10 +163,6 @@ package object traversals { NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasMethodFullNameEMT] ](traversal: IterableOnce[NodeType]): TraversalPropertyMethodFullName[NodeType] = new TraversalPropertyMethodFullName(traversal.iterator) - implicit def accessPropertyMethodShortNameTraversal[ - NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasMethodShortNameEMT] - ](traversal: IterableOnce[NodeType]): TraversalPropertyMethodShortName[NodeType] = - new TraversalPropertyMethodShortName(traversal.iterator) implicit def accessPropertyModifierTypeTraversal[ NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasModifierTypeEMT] ](traversal: IterableOnce[NodeType]): TraversalPropertyModifierType[NodeType] = new TraversalPropertyModifierType( @@ -184,11 +171,6 @@ package object traversals { implicit def accessPropertyNameTraversal[NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasNameEMT]]( traversal: IterableOnce[NodeType] ): TraversalPropertyName[NodeType] = new TraversalPropertyName(traversal.iterator) - implicit def accessPropertyNodeLabelTraversal[ - NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasNodeLabelEMT] - ](traversal: IterableOnce[NodeType]): TraversalPropertyNodeLabel[NodeType] = new TraversalPropertyNodeLabel( - traversal.iterator - ) implicit def accessPropertyOffsetTraversal[NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasOffsetEMT]]( traversal: IterableOnce[NodeType] ): TraversalPropertyOffset[NodeType] = new TraversalPropertyOffset(traversal.iterator) @@ -203,11 +185,6 @@ package object traversals { implicit def accessPropertyOverlaysTraversal[NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasOverlaysEMT]]( traversal: IterableOnce[NodeType] ): TraversalPropertyOverlays[NodeType] = new TraversalPropertyOverlays(traversal.iterator) - implicit def accessPropertyPackageNameTraversal[ - NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasPackageNameEMT] - ](traversal: IterableOnce[NodeType]): TraversalPropertyPackageName[NodeType] = new TraversalPropertyPackageName( - traversal.iterator - ) implicit def accessPropertyParserTypeNameTraversal[ NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasParserTypeNameEMT] ](traversal: IterableOnce[NodeType]): TraversalPropertyParserTypeName[NodeType] = @@ -225,9 +202,6 @@ package object traversals { ](traversal: IterableOnce[NodeType]): TraversalPropertySignature[NodeType] = new TraversalPropertySignature( traversal.iterator ) - implicit def accessPropertySymbolTraversal[NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasSymbolEMT]]( - traversal: IterableOnce[NodeType] - ): TraversalPropertySymbol[NodeType] = new TraversalPropertySymbol(traversal.iterator) implicit def accessPropertyTypeDeclFullNameTraversal[ NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasTypeDeclFullNameEMT] ](traversal: IterableOnce[NodeType]): TraversalPropertyTypeDeclFullName[NodeType] = @@ -315,9 +289,6 @@ package object traversals { implicit def traversalLocalBase[NodeType <: nodes.LocalBase]( traversal: IterableOnce[NodeType] ): TraversalLocalBase[NodeType] = new TraversalLocalBase(traversal.iterator) - implicit def traversalLocationBase[NodeType <: nodes.LocationBase]( - traversal: IterableOnce[NodeType] - ): TraversalLocationBase[NodeType] = new TraversalLocationBase(traversal.iterator) implicit def traversalMemberBase[NodeType <: nodes.MemberBase]( traversal: IterableOnce[NodeType] ): TraversalMemberBase[NodeType] = new TraversalMemberBase(traversal.iterator) diff --git a/schema/src/main/scala/io/shiftleft/codepropertygraph/schema/CpgSchema.scala b/schema/src/main/scala/io/shiftleft/codepropertygraph/schema/CpgSchema.scala index b24683863..5d8a08362 100644 --- a/schema/src/main/scala/io/shiftleft/codepropertygraph/schema/CpgSchema.scala +++ b/schema/src/main/scala/io/shiftleft/codepropertygraph/schema/CpgSchema.scala @@ -23,12 +23,12 @@ class CpgSchema(builder: SchemaBuilder) { val shortcuts = Shortcuts(builder, base, method, ast, typeSchema, fs) - val sourceSpecific = Comment(builder, base, ast, fs) - val tagsAndLocation = TagsAndLocation(builder, base, typeSchema, method, ast, fs, callGraph) - val binding = Binding(builder, base, typeSchema, method, callGraph) - val annotation = Annotation(builder, base, method, typeSchema, ast, shortcuts) - val finding = Finding(builder, base) - val hidden = Hidden(builder, base, method, typeSchema, ast, cfg, fs, callGraph, pdg, tagsAndLocation, shortcuts) + val sourceSpecific = Comment(builder, base, ast, fs) + val tags = Tags(builder, base, typeSchema, method, ast, fs, callGraph) + val binding = Binding(builder, base, typeSchema, method, callGraph) + val annotation = Annotation(builder, base, method, typeSchema, ast, shortcuts) + val finding = Finding(builder, base) + val hidden = Hidden(builder, base, method, typeSchema, ast, cfg, fs, callGraph, pdg, tags, shortcuts) val protoSerialize = ProtoSerialize(builder, ast) } diff --git a/schema/src/main/scala/io/shiftleft/codepropertygraph/schema/Hidden.scala b/schema/src/main/scala/io/shiftleft/codepropertygraph/schema/Hidden.scala index 0d44a5caf..db1719543 100644 --- a/schema/src/main/scala/io/shiftleft/codepropertygraph/schema/Hidden.scala +++ b/schema/src/main/scala/io/shiftleft/codepropertygraph/schema/Hidden.scala @@ -24,7 +24,7 @@ object Hidden extends SchemaBase { fs: FileSystem.Schema, callGraph: CallGraph.Schema, pdg: Pdg.Schema, - tags: TagsAndLocation.Schema, + tags: Tags.Schema, shortcuts: Shortcuts.Schema ) = new Schema(builder, base, methodSchema, typeDecl, ast, cfg, fs, callGraph, pdg, tags, shortcuts) @@ -38,7 +38,7 @@ object Hidden extends SchemaBase { fsSchema: FileSystem.Schema, callGraph: CallGraph.Schema, pdg: Pdg.Schema, - tags: TagsAndLocation.Schema, + tags: Tags.Schema, shortcuts: Shortcuts.Schema ) { diff --git a/schema/src/main/scala/io/shiftleft/codepropertygraph/schema/TagsAndLocation.scala b/schema/src/main/scala/io/shiftleft/codepropertygraph/schema/Tags.scala similarity index 56% rename from schema/src/main/scala/io/shiftleft/codepropertygraph/schema/TagsAndLocation.scala rename to schema/src/main/scala/io/shiftleft/codepropertygraph/schema/Tags.scala index 01184e2f4..824506370 100644 --- a/schema/src/main/scala/io/shiftleft/codepropertygraph/schema/TagsAndLocation.scala +++ b/schema/src/main/scala/io/shiftleft/codepropertygraph/schema/Tags.scala @@ -1,10 +1,8 @@ package io.shiftleft.codepropertygraph.schema -import io.shiftleft.codepropertygraph.schema.CpgSchema.PropertyDefaults -import flatgraph.schema.Property.ValueType import flatgraph.schema._ -object TagsAndLocation extends SchemaBase { +object Tags extends SchemaBase { override def docIndex: Int = 17 @@ -44,36 +42,7 @@ object TagsAndLocation extends SchemaBase { import callGraph._ implicit private val schemaInfo: SchemaInfo = SchemaInfo.forClass(getClass) -// node properties - val symbol = builder - .addProperty(name = "SYMBOL", valueType = ValueType.String, comment = "") - .mandatory(PropertyDefaults.String) - .protoId(ProtoIds.Symbol) - - val methodShortName = builder - .addProperty(name = "METHOD_SHORT_NAME", valueType = ValueType.String, comment = "") - .mandatory(PropertyDefaults.String) - .protoId(ProtoIds.MethodShortName) - - val packageName = builder - .addProperty(name = "PACKAGE_NAME", valueType = ValueType.String, comment = "") - .mandatory(PropertyDefaults.String) - .protoId(ProtoIds.PackageName) - - val className = builder - .addProperty(name = "CLASS_NAME", valueType = ValueType.String, comment = "") - .mandatory(PropertyDefaults.String) - .protoId(ProtoIds.ClassName) - - val classShortName = builder - .addProperty(name = "CLASS_SHORT_NAME", valueType = ValueType.String, comment = "") - .mandatory(PropertyDefaults.String) - .protoId(ProtoIds.ClassShortName) - - val nodeLabel = builder - .addProperty(name = "NODE_LABEL", valueType = ValueType.String, comment = "") - .mandatory(PropertyDefaults.String) - .protoId(ProtoIds.NodeLabel) + // node properties val taggedBy = builder .addEdgeType(name = "TAGGED_BY", comment = "Edges from nodes to the tags they are tagged by.") @@ -87,30 +56,11 @@ object TagsAndLocation extends SchemaBase { .addProperties(name, value) .primaryKey(name) - val location: NodeType = builder - .addNodeType(name = "LOCATION", comment = "A location node summarizes a source code location.") - .protoId(ProtoIds.Location) - .addProperties( - symbol, - methodFullName, - methodShortName, - packageName, - lineNumber, - className, - classShortName, - nodeLabel, - filename, - columnNumber - ) - val tagNodePair: NodeType = builder .addNodeType(name = "TAG_NODE_PAIR", comment = "This node contains an arbitrary node and an associated tag node.") .protoId(ProtoIds.TagNodePair) .addProperties() -// node relations - location.addContainedNode(builder.anyNode, "node", Property.Cardinality.ZeroOrOne) - // TODO MP: provide dummy/empty node as default, to avoid null? tagNodePair .addContainedNode(tag, "tag", Property.Cardinality.One(Property.Default(null)))