Bumping flatgraph (#1857)

* Bumping flatgraph

* generate domain classes

---------

Co-authored-by: Michael Pollmeier <michael.pollmeier@harness.io>

Author: nikoqwietai

build.sbt

@@ -1,7 +1,7 @@
 name := "codepropertygraph"
 
 // parsed by project/Versions.scala, updated by updateDependencies.sh
-val flatgraphVersion = "0.1.31"
+val flatgraphVersion = "0.1.32"
 
 inThisBuild(
   List(

domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalAstnodeBase.scala

@@ -84,6 +84,19 @@ final class TraversalAstnodeBase[NodeType <: nodes.AstNodeBase](val traversal: I
       val tmp = node.columnNumber; tmp.isDefined && tmp.get == value
     }
 
+  /** Traverse to nodes where the columnNumber equals the given `value`. If `value` is None, only nodes where
+    * columnNumber is not set are included.
+    */
+  def columnNumber(value: Option[Int]): Iterator[NodeType] =
+    value match {
+      case Some(_val) => columnNumber(_val); case None => traversal.filter { node => node.columnNumber.isEmpty }
+    }
+
+  /** Traverse to nodes where the columnNumber equals the given `value`, or no results if `value` is None.
+    */
+  def columnNumberIfPresent(value: Option[Int]): Iterator[NodeType] =
+    value match { case Some(_val) => columnNumber(_val); case None => Iterator.empty }
+
   /** Traverse to nodes where the columnNumber equals at least one of the given `values`
     */
   def columnNumber(values: Int*): Iterator[NodeType] = {
@@ -148,6 +161,19 @@ final class TraversalAstnodeBase[NodeType <: nodes.AstNodeBase](val traversal: I
       val tmp = node.lineNumber; tmp.isDefined && tmp.get == value
     }
 
+  /** Traverse to nodes where the lineNumber equals the given `value`. If `value` is None, only nodes where lineNumber
+    * is not set are included.
+    */
+  def lineNumber(value: Option[Int]): Iterator[NodeType] =
+    value match {
+      case Some(_val) => lineNumber(_val); case None => traversal.filter { node => node.lineNumber.isEmpty }
+    }
+
+  /** Traverse to nodes where the lineNumber equals the given `value`, or no results if `value` is None.
+    */
+  def lineNumberIfPresent(value: Option[Int]): Iterator[NodeType] =
+    value match { case Some(_val) => lineNumber(_val); case None => Iterator.empty }
+
   /** Traverse to nodes where the lineNumber equals at least one of the given `values`
     */
   def lineNumber(values: Int*): Iterator[NodeType] = {
@@ -212,6 +238,17 @@ final class TraversalAstnodeBase[NodeType <: nodes.AstNodeBase](val traversal: I
       val tmp = node.offset; tmp.isDefined && tmp.get == value
     }
 
+  /** Traverse to nodes where the offset equals the given `value`. If `value` is None, only nodes where offset is not
+    * set are included.
+    */
+  def offset(value: Option[Int]): Iterator[NodeType] =
+    value match { case Some(_val) => offset(_val); case None => traversal.filter { node => node.offset.isEmpty } }
+
+  /** Traverse to nodes where the offset equals the given `value`, or no results if `value` is None.
+    */
+  def offsetIfPresent(value: Option[Int]): Iterator[NodeType] =
+    value match { case Some(_val) => offset(_val); case None => Iterator.empty }
+
   /** Traverse to nodes where the offset equals at least one of the given `values`
     */
   def offset(values: Int*): Iterator[NodeType] = {
@@ -276,6 +313,17 @@ final class TraversalAstnodeBase[NodeType <: nodes.AstNodeBase](val traversal: I
       val tmp = node.offsetEnd; tmp.isDefined && tmp.get == value
     }
 
+  /** Traverse to nodes where the offsetEnd equals the given `value`. If `value` is None, only nodes where offsetEnd is
+    * not set are included.
+    */
+  def offsetEnd(value: Option[Int]): Iterator[NodeType] =
+    value match { case Some(_val) => offsetEnd(_val); case None => traversal.filter { node => node.offsetEnd.isEmpty } }
+
+  /** Traverse to nodes where the offsetEnd equals the given `value`, or no results if `value` is None.
+    */
+  def offsetEndIfPresent(value: Option[Int]): Iterator[NodeType] =
+    value match { case Some(_val) => offsetEnd(_val); case None => Iterator.empty }
+
   /** Traverse to nodes where the offsetEnd equals at least one of the given `values`
     */
   def offsetEnd(values: Int*): Iterator[NodeType] = {
@@ -338,6 +386,11 @@ final class TraversalAstnodeBase[NodeType <: nodes.AstNodeBase](val traversal: I
   def order(value: Int): Iterator[NodeType] =
     traversal.filter { _.order == value }
 
+  /** Traverse to nodes where the order equals the given `value`, or no results if `value` is None
+    */
+  def order(value: Option[Int]): Iterator[NodeType] =
+    value match { case Some(_val) => order(_val); case None => Iterator.empty }
+
   /** Traverse to nodes where the order equals at least one of the given `values`
     */
   def order(values: Int*): Iterator[NodeType] = {

domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalExpressionBase.scala

@@ -15,6 +15,11 @@ final class TraversalExpressionBase[NodeType <: nodes.ExpressionBase](val traver
   def argumentIndex(value: Int): Iterator[NodeType] =
     traversal.filter { _.argumentIndex == value }
 
+  /** Traverse to nodes where the argumentIndex equals the given `value`, or no results if `value` is None
+    */
+  def argumentIndex(value: Option[Int]): Iterator[NodeType] =
+    value match { case Some(_val) => argumentIndex(_val); case None => Iterator.empty }
+
   /** Traverse to nodes where the argumentIndex equals at least one of the given `values`
     */
   def argumentIndex(values: Int*): Iterator[NodeType] = {

domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalJumptargetBase.scala

@@ -15,6 +15,11 @@ final class TraversalJumptargetBase[NodeType <: nodes.JumpTargetBase](val traver
   def argumentIndex(value: Int): Iterator[NodeType] =
     traversal.filter { _.argumentIndex == value }
 
+  /** Traverse to nodes where the argumentIndex equals the given `value`, or no results if `value` is None
+    */
+  def argumentIndex(value: Option[Int]): Iterator[NodeType] =
+    value match { case Some(_val) => argumentIndex(_val); case None => Iterator.empty }
+
   /** Traverse to nodes where the argumentIndex equals at least one of the given `values`
     */
   def argumentIndex(values: Int*): Iterator[NodeType] = {

domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodBase.scala

@@ -152,6 +152,19 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite
       val tmp = node.columnNumberEnd; tmp.isDefined && tmp.get == value
     }
 
+  /** Traverse to nodes where the columnNumberEnd equals the given `value`. If `value` is None, only nodes where
+    * columnNumberEnd is not set are included.
+    */
+  def columnNumberEnd(value: Option[Int]): Iterator[NodeType] =
+    value match {
+      case Some(_val) => columnNumberEnd(_val); case None => traversal.filter { node => node.columnNumberEnd.isEmpty }
+    }
+
+  /** Traverse to nodes where the columnNumberEnd equals the given `value`, or no results if `value` is None.
+    */
+  def columnNumberEndIfPresent(value: Option[Int]): Iterator[NodeType] =
+    value match { case Some(_val) => columnNumberEnd(_val); case None => Iterator.empty }
+
   /** Traverse to nodes where the columnNumberEnd equals at least one of the given `values`
     */
   def columnNumberEnd(values: Int*): Iterator[NodeType] = {
@@ -502,6 +515,19 @@ final class TraversalMethodBase[NodeType <: nodes.MethodBase](val traversal: Ite
       val tmp = node.lineNumberEnd; tmp.isDefined && tmp.get == value
     }
 
+  /** Traverse to nodes where the lineNumberEnd equals the given `value`. If `value` is None, only nodes where
+    * lineNumberEnd is not set are included.
+    */
+  def lineNumberEnd(value: Option[Int]): Iterator[NodeType] =
+    value match {
+      case Some(_val) => lineNumberEnd(_val); case None => traversal.filter { node => node.lineNumberEnd.isEmpty }
+    }
+
+  /** Traverse to nodes where the lineNumberEnd equals the given `value`, or no results if `value` is None.
+    */
+  def lineNumberEndIfPresent(value: Option[Int]): Iterator[NodeType] =
+    value match { case Some(_val) => lineNumberEnd(_val); case None => Iterator.empty }
+
   /** Traverse to nodes where the lineNumberEnd equals at least one of the given `values`
     */
   def lineNumberEnd(values: Int*): Iterator[NodeType] = {

domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodparameterinBase.scala

@@ -160,6 +160,11 @@ final class TraversalMethodparameterinBase[NodeType <: nodes.MethodParameterInBa
   def index(value: Int): Iterator[NodeType] =
     traversal.filter { _.index == value }
 
+  /** Traverse to nodes where the index equals the given `value`, or no results if `value` is None
+    */
+  def index(value: Option[Int]): Iterator[NodeType] =
+    value match { case Some(_val) => index(_val); case None => Iterator.empty }
+
   /** Traverse to nodes where the index equals at least one of the given `values`
     */
   def index(values: Int*): Iterator[NodeType] = {

domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalMethodparameteroutBase.scala

@@ -83,6 +83,11 @@ final class TraversalMethodparameteroutBase[NodeType <: nodes.MethodParameterOut
   def index(value: Int): Iterator[NodeType] =
     traversal.filter { _.index == value }
 
+  /** Traverse to nodes where the index equals the given `value`, or no results if `value` is None
+    */
+  def index(value: Option[Int]): Iterator[NodeType] =
+    value match { case Some(_val) => index(_val); case None => Iterator.empty }
+
   /** Traverse to nodes where the index equals at least one of the given `values`
     */
   def index(values: Int*): Iterator[NodeType] = {

domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyArgumentIndex.scala

@@ -16,6 +16,11 @@ final class TraversalPropertyArgumentIndex[NodeType <: nodes.StoredNode & nodes.
   def argumentIndex(value: Int): Iterator[NodeType] =
     traversal.filter { _.argumentIndex == value }
 
+  /** Traverse to nodes where the argumentIndex equals the given `value`, or no results if `value` is None
+    */
+  def argumentIndex(value: Option[Int]): Iterator[NodeType] =
+    value match { case Some(_val) => argumentIndex(_val); case None => Iterator.empty }
+
   /** Traverse to nodes where the argumentIndex equals at least one of the given `values`
     */
   def argumentIndex(values: Int*): Iterator[NodeType] = {

domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyColumnNumber.scala

@@ -18,6 +18,19 @@ final class TraversalPropertyColumnNumber[NodeType <: nodes.StoredNode & nodes.S
       val tmp = node.columnNumber; tmp.isDefined && tmp.get == value
     }
 
+  /** Traverse to nodes where the columnNumber equals the given `value`. If `value` is None, only nodes where
+    * columnNumber is not set are included.
+    */
+  def columnNumber(value: Option[Int]): Iterator[NodeType] =
+    value match {
+      case Some(_val) => columnNumber(_val); case None => traversal.filter { node => node.columnNumber.isEmpty }
+    }
+
+  /** Traverse to nodes where the columnNumber equals the given `value`, or no results if `value` is None.
+    */
+  def columnNumberIfPresent(value: Option[Int]): Iterator[NodeType] =
+    value match { case Some(_val) => columnNumber(_val); case None => Iterator.empty }
+
   /** Traverse to nodes where the columnNumber equals at least one of the given `values`
     */
   def columnNumber(values: Int*): Iterator[NodeType] = {

domainClasses/src/main/generated/io/shiftleft/codepropertygraph/generated/traversals/TraversalPropertyColumnNumberEnd.scala

@@ -19,6 +19,19 @@ final class TraversalPropertyColumnNumberEnd[
       val tmp = node.columnNumberEnd; tmp.isDefined && tmp.get == value
     }
 
+  /** Traverse to nodes where the columnNumberEnd equals the given `value`. If `value` is None, only nodes where
+    * columnNumberEnd is not set are included.
+    */
+  def columnNumberEnd(value: Option[Int]): Iterator[NodeType] =
+    value match {
+      case Some(_val) => columnNumberEnd(_val); case None => traversal.filter { node => node.columnNumberEnd.isEmpty }
+    }
+
+  /** Traverse to nodes where the columnNumberEnd equals the given `value`, or no results if `value` is None.
+    */
+  def columnNumberEndIfPresent(value: Option[Int]): Iterator[NodeType] =
+    value match { case Some(_val) => columnNumberEnd(_val); case None => Iterator.empty }
+
   /** Traverse to nodes where the columnNumberEnd equals at least one of the given `values`
     */
   def columnNumberEnd(values: Int*): Iterator[NodeType] = {