Packages

  • package root
    Definition Classes
    root
  • package io
    Definition Classes
    root
  • package shiftleft
    Definition Classes
    io
  • package queryprimitives

    Domain specific language for querying code property graphs

    Domain specific language for querying code property graphs

    This is the API reference for the CPG query language, a language to mine code for defects and vulnerabilities both interactively on a code analysis shell (REPL), or using non-interactive scripts.

    Queries written in the CPG query language express graph traversals (see https://en.wikipedia.org/wiki/Graph_traversal). Similar to the standard graph traversal language "Gremlin" (see https://en.wikipedia.org/wiki/Gremlin_(programming_language))) these traversals are formulated as sequences of primitive language elements referred to as "steps". You can think of a step as a small program, similar to a unix shell utility, however, instead of processing lines one by one, the step processes nodes of the graph.

    Starting a traversal

    All traversals begin by selecting a set of start nodes, e.g.,

    cpg.method

    will start the traversal at all methods, while

    cpg.local

    will start at all local variables. The complete list of starting points can be found here: io.shiftleft.queryprimitives.steps.starters.Cpg

    Lazy evaluation

    Queries are lazily evaluated, e.g., cpg.method creates a traversal which you can add more steps to. You can, for example, evaluate the traversal by converting it to a list:

    cpg.method.toList

    Since toList is such a common operation, we provide the shorthand l, meaning that

    cpg.method.l

    provides the same result as the former query.

    Properties

    Nodes have "properties", key-value pairs where keys are strings and values are primitive data types such as strings, integers, or Booleans. Properties of nodes can be selected based on their key, e.g.,

    cpg.method.name

    traverses to all method names. Nodes can also be filtered based on properties, e.g.,

    cpg.method.name(".*exec.*")

    traverse to all methods where name matches the regular expression ".*exec.*". You can see a complete list of properties by browsing to the API documentation of the corresponding step. For example, you can find the properties of method nodes at io.shiftleft.queryprimitives.steps.types.structure.Method.

    Side effects

    Useful if you want to mutate something outside the traversal, or simply debug it: This prints all typeDecl names as it traverses the graph and increments i for each one.

    var i = 0
cpg.typeDecl.sideEffect{typeTemplate => println(typeTemplate.name); i = i + 1}.exec

    [advanced] Selecting multiple things from your traversal

    If you are interested in multiple things along the way of your traversal, you label anything using the as modulator, and use select at the end. Note that the compiler automatically derived the correct return type as a tuple of the labelled steps, in this case with two elements.

    cpg.method.as("method").definingTypeDecl.as("classDef").select.toList
// return type: List[(nodes.Method, nodes.TypeDecl)]

    [advanced] For comprehensions

    You can always start a new traversal from a node, e.g.,

    val someMethod = cpg.method.head
someMethod.start.parameter.toList

    You can use this e.g. in a for comprehension, which is (in this context) essentially an alternative way to select multiple intermediate things. It is more expressive, but more computationally expensive.

    val query = for {
  method <- cpg.method
  param <- method.start.parameter
} yield (method.name, param.name)

query.toList
    Definition Classes
    shiftleft
  • package steps

    Steps for traversing the code property graph

    Steps for traversing the code property graph

    All traversal start at io.shiftleft.queryprimitives.starters.Cpg.

    Definition Classes
    queryprimitives
  • package types
    Definition Classes
    steps
  • package structure
    Definition Classes
    types
  • File
  • Local
  • Member
  • Method
  • MethodInst
  • MethodParameter
  • MethodParameterOut
  • MethodReturn
  • Namespace
  • NamespaceBlock
  • Type
  • TypeDecl

class TypeDecl[Labels <: HList] extends CpgSteps[codepropertygraph.generated.nodes.TypeDecl, Labels] with NameAccessors[codepropertygraph.generated.nodes.TypeDecl, Labels] with FullNameAccessors[codepropertygraph.generated.nodes.TypeDecl, Labels] with IsExternalAccessor[codepropertygraph.generated.nodes.TypeDecl, Labels]

Type declaration - possibly a template that requires instantiation

Linear Supertypes
IsExternalAccessor[codepropertygraph.generated.nodes.TypeDecl, Labels], PropertyAccessors[codepropertygraph.generated.nodes.TypeDecl, Labels], FullNameAccessors[codepropertygraph.generated.nodes.TypeDecl, Labels], NameAccessors[codepropertygraph.generated.nodes.TypeDecl, Labels], StringPropertyAccessors[codepropertygraph.generated.nodes.TypeDecl, Labels], CpgSteps[codepropertygraph.generated.nodes.TypeDecl, Labels], NodeSteps[codepropertygraph.generated.nodes.TypeDecl, Labels], Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels], StepsRoot, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TypeDecl
  2. IsExternalAccessor
  3. PropertyAccessors
  4. FullNameAccessors
  5. NameAccessors
  6. StringPropertyAccessors
  7. CpgSteps
  8. NodeSteps
  9. Steps
  10. StepsRoot
  11. AnyRef
  12. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new TypeDecl(raw: GremlinScala[Vertex])

Type Members

  1. type EndDomain0 = codepropertygraph.generated.nodes.TypeDecl
    Definition Classes
    Steps → StepsRoot
  2. type EndGraph0 = Vertex
    Definition Classes
    Steps → StepsRoot

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def _toJson(pretty: Boolean): String
    Attributes
    protected
    Definition Classes
    CpgSteps
  5. def aggregate(into: Buffer[codepropertygraph.generated.nodes.TypeDecl]): NodeSteps[codepropertygraph.generated.nodes.TypeDecl, Labels]
    Definition Classes
    NodeSteps
  6. def and(andTraversals: (Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, HNil]) ⇒ Steps[_, _, _]*): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    Steps
  7. def as[NewLabels <: HList](stepLabel: StepLabel[codepropertygraph.generated.nodes.TypeDecl])(implicit prependDomain: shapeless.ops.hlist.Prepend.Aux[Labels, ::[codepropertygraph.generated.nodes.TypeDecl, HNil], NewLabels]): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, NewLabels]
    Definition Classes
    Steps
  8. def as[NewLabels <: HList](stepLabel: String)(implicit prependDomain: shapeless.ops.hlist.Prepend.Aux[Labels, ::[codepropertygraph.generated.nodes.TypeDecl, HNil], NewLabels]): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, NewLabels]
    Definition Classes
    Steps
  9. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  10. def baseType: Type[Labels]

    Direct base types in the inheritance graph.

  11. def baseTypeDecl: TypeDecl[Labels]

    Direct base type declaration.

  12. def baseTypeDeclTransitive: TypeDecl[Labels]

    Direct and transitive base type declaration.

  13. def clone(): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    Steps → AnyRef
  14. val converter: Converter[codepropertygraph.generated.nodes.TypeDecl] { type GraphType = gremlin.scala.Vertex }
    Definition Classes
    TypeDecl → PropertyAccessors → StringPropertyAccessors → Steps
  15. def count(): Long
    Definition Classes
    Steps
  16. def dedup(): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    Steps
  17. def derivedTypeDecl: TypeDecl[Labels]

    Direct base type declaration.

  18. def derivedTypeDeclTransitive: TypeDecl[Labels]

    Direct and transitive base type declaration.

  19. def emit(emitTraversal: (Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, HNil]) ⇒ Steps[_, _, _]): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    Steps
  20. def emit(): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    Steps
  21. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  22. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  23. def exec(): Unit
    Definition Classes
    Steps
  24. def external: TypeDecl[Labels]

    Filter for type declarations not contained in the analyzed code.

  25. def file: File[Labels]

    Traverse to source file

    Traverse to source file

    Definition Classes
    CpgSteps
  26. def filter(predicate: (Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]) ⇒ Steps[_, _, _]): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    Steps
  27. def filterNot(predicate: (Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]) ⇒ Steps[_, _, _]): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    Steps
  28. def filterOnEnd(predicate: (codepropertygraph.generated.nodes.TypeDecl) ⇒ Boolean): NodeSteps[codepropertygraph.generated.nodes.TypeDecl, Labels]
    Definition Classes
    NodeSteps
  29. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  30. def flatMap[NewSteps <: StepsRoot](fun: (codepropertygraph.generated.nodes.TypeDecl) ⇒ NewSteps)(implicit constr: Aux[gremlin.scala.dsl.Steps.flatMap.NewSteps.EndDomain0, Labels, gremlin.scala.dsl.Steps.flatMap.NewSteps.EndGraph0, NewSteps], newConverter: Converter[gremlin.scala.dsl.Steps.flatMap.NewSteps.EndDomain0]): NewSteps
    Definition Classes
    Steps
  31. def fullName(value: String*): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    FullNameAccessors
  32. def fullName(value: String): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    FullNameAccessors
  33. def fullName(): Steps[String, String, Labels]
    Definition Classes
    FullNameAccessors
  34. def fullNameExact(values: String*): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    FullNameAccessors
  35. def fullNameExact(value: String): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    FullNameAccessors
  36. def fullNameNot(values: String*): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    FullNameAccessors
  37. def fullNameNot(value: String): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    FullNameAccessors
  38. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  39. implicit val graph: Graph
    Definition Classes
    CpgSteps
  40. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  41. def head(): codepropertygraph.generated.nodes.TypeDecl
    Definition Classes
    Steps
  42. def headOption(): Option[codepropertygraph.generated.nodes.TypeDecl]
    Definition Classes
    Steps
  43. def id(ids: AnyRef*): NodeSteps[codepropertygraph.generated.nodes.TypeDecl, Labels]
    Definition Classes
    NodeSteps
  44. def internal: TypeDecl[Labels]

    Filter for type declarations contained in the analyzed code.

  45. def isDefined: Boolean
    Definition Classes
    Steps
  46. def isExternal(value: Boolean*): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    IsExternalAccessor
  47. def isExternal(value: Boolean): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    IsExternalAccessor
  48. def isExternal(): Steps[Boolean, Boolean, Labels]
    Definition Classes
    IsExternalAccessor
  49. def isExternalNot(values: Boolean*): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    IsExternalAccessor
  50. def isExternalNot(value: Boolean): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    IsExternalAccessor
  51. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  52. def iterate(): Unit
    Definition Classes
    Steps
  53. def l: List[codepropertygraph.generated.nodes.TypeDecl]
    Definition Classes
    Steps
  54. def map[NewEndDomain, NewEndGraph, NewSteps <: StepsRoot](fun: (codepropertygraph.generated.nodes.TypeDecl) ⇒ NewEndDomain)(implicit newConverter: Aux[NewEndDomain, NewEndGraph], constr: Aux[NewEndDomain, Labels, NewEndGraph, NewSteps]): NewSteps
    Definition Classes
    Steps
  55. def member: Member[Labels]

    Member variables

  56. def method: Method[Labels]

    Methods defined as part of this type

  57. def name(value: String*): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]

    Traverse to nodes where the name matches at least one of the regular expressions in values

    Traverse to nodes where the name matches at least one of the regular expressions in values

    Definition Classes
    NameAccessors
  58. def name(value: String): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]

    Traverse to nodes where the name matches the regular expression value

    Traverse to nodes where the name matches the regular expression value

    Definition Classes
    NameAccessors
  59. def name(): Steps[String, String, Labels]

    Traverse to name

    Traverse to name

    Definition Classes
    NameAccessors
  60. def nameExact(values: String*): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]

    Traverse to nodes where name matches one of the elements in values exactly.

    Traverse to nodes where name matches one of the elements in values exactly.

    Definition Classes
    NameAccessors
  61. def nameExact(value: String): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]

    Traverse to nodes where name matches value exactly.

    Traverse to nodes where name matches value exactly.

    Definition Classes
    NameAccessors
  62. def nameNot(values: String*): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]

    Traverse to nodes where name does not match any of the regular expressions in values.

    Traverse to nodes where name does not match any of the regular expressions in values.

    Definition Classes
    NameAccessors
  63. def nameNot(value: String): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]

    Traverse to nodes where name does not match the regular expression value.

    Traverse to nodes where name does not match the regular expression value.

    Definition Classes
    NameAccessors
  64. def namespace: Namespace[Labels]

    Namespace in which this type declaration is defined

  65. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  66. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  67. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  68. def onRaw(fun: (GremlinScala[Vertex]) ⇒ GremlinScala[Vertex]): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    Steps
  69. def or(orTraversals: (Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, HNil]) ⇒ Steps[_, _, _]*): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    Steps
  70. def orderBy[A](fun: (codepropertygraph.generated.nodes.TypeDecl) ⇒ A): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    Steps
  71. def p(): Unit
    Definition Classes
    Steps
  72. def property[P](property: Key[P]): Steps[P, P, Labels]
    Definition Classes
    PropertyAccessors
  73. def propertyFilter[Out, P](property: Key[P], value: P): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    PropertyAccessors
  74. def propertyFilterMultiple[Out, P](property: Key[P], values: P*): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    PropertyAccessors
  75. def propertyFilterNot[Out, P](property: Key[P], value: P): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    PropertyAccessors
  76. def propertyFilterNotMultiple[Out, P](property: Key[P], values: P*): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    PropertyAccessors
  77. val raw: GremlinScala[Vertex]
    Definition Classes
    CpgSteps → NodeSteps → Steps → StepsRoot
  78. def referencingType: Type[Labels]

    Types referencing to this type declaration.

  79. def repeat[NewEndDomain >: codepropertygraph.generated.nodes.TypeDecl](repeatTraversal: (Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, HNil]) ⇒ Steps[NewEndDomain, Vertex, _])(implicit newConverter: Aux[NewEndDomain, Vertex]): Steps[NewEndDomain, Vertex, Labels]
    Definition Classes
    Steps
  80. def s(): Stream[codepropertygraph.generated.nodes.TypeDecl]
    Definition Classes
    Steps
  81. def select[StepLabelsTuple <: Product, StepLabels <: HList, H0, T0 <: HList, SelectedTypes <: HList, SelectedTypesTuple <: Product, SelectedGraphTypesTuple <: Product, LabelNames <: HList, Z](stepLabelsTuple: StepLabelsTuple)(implicit toHList: Aux[StepLabelsTuple, StepLabels], hasOne: Aux[StepLabels, H0, T0], hasTwo: IsHCons[T0], extractLabelType: Aux[StepLabels, SelectedTypes], tupler: shapeless.ops.hlist.Tupler.Aux[SelectedTypes, SelectedTypesTuple], conv: Aux[SelectedTypesTuple, SelectedGraphTypesTuple], stepLabelToString: Aux[GetLabelName.type, StepLabels, LabelNames], trav: Aux[LabelNames, List, String], folder: Aux[StepLabels, (HNil, Map[String, Any]), combineLabelWithValue.type, (SelectedTypes, Z)]): Steps[SelectedTypesTuple, SelectedGraphTypesTuple, Labels]
    Definition Classes
    Steps
  82. def select[Label, LabelGraph](label: StepLabel[Label])(implicit conv1: Aux[Label, LabelGraph]): Steps[Label, LabelGraph, Labels]
    Definition Classes
    Steps
  83. def select[LabelsGraph <: HList, LabelsGraphTuple, LabelsTuple]()(implicit conv1: Aux[Labels, LabelsGraph], tupler1: shapeless.ops.hlist.Tupler.Aux[LabelsGraph, LabelsGraphTuple], tupler2: shapeless.ops.hlist.Tupler.Aux[Labels, LabelsTuple], conv2: Aux[LabelsTuple, LabelsGraphTuple]): Steps[LabelsTuple, LabelsGraphTuple, Labels]
    Definition Classes
    Steps
  84. def sideEffect(fun: (codepropertygraph.generated.nodes.TypeDecl) ⇒ Any): NodeSteps[codepropertygraph.generated.nodes.TypeDecl, Labels]
    Definition Classes
    NodeSteps
  85. def stringProperty(property: Key[String]): Steps[String, String, Labels]
    Attributes
    protected
    Definition Classes
    StringPropertyAccessors
  86. def stringPropertyFilter(property: Key[String], value: String): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Attributes
    protected
    Definition Classes
    StringPropertyAccessors
  87. def stringPropertyFilterExact[Out](property: Key[String], _value: String): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Attributes
    protected
    Definition Classes
    StringPropertyAccessors
  88. def stringPropertyFilterExactMultiple[Out](property: Key[String], values: String*): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Attributes
    protected
    Definition Classes
    StringPropertyAccessors
  89. def stringPropertyFilterMultiple(property: Key[String], values: String*): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Attributes
    protected
    Definition Classes
    StringPropertyAccessors
  90. def stringPropertyFilterNot[Out](property: Key[String], value: String): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Attributes
    protected
    Definition Classes
    StringPropertyAccessors
  91. def stringPropertyFilterNotMultiple[Out](property: Key[String], values: String*): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Attributes
    protected
    Definition Classes
    StringPropertyAccessors
  92. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  93. def times(maxLoops: Int): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    Steps
  94. def toBuffer(): Buffer[codepropertygraph.generated.nodes.TypeDecl]
    Definition Classes
    Steps
  95. def toJson: String

    Execute traversal and convert the result to json.

    Execute traversal and convert the result to json.

    Definition Classes
    CpgSteps
  96. def toJsonPretty: String
    Definition Classes
    CpgSteps
  97. def toList(): List[codepropertygraph.generated.nodes.TypeDecl]
    Definition Classes
    Steps
  98. def toMaps(): Steps[Map[String, AnyRef], Map[String, AnyRef], Labels]
    Definition Classes
    CpgSteps
  99. def toSet(): Set[codepropertygraph.generated.nodes.TypeDecl]
    Definition Classes
    Steps
  100. def toStream(): Stream[codepropertygraph.generated.nodes.TypeDecl]
    Definition Classes
    Steps
  101. def toString(): String
    Definition Classes
    Steps → AnyRef → Any
  102. def until(untilTraversal: (Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, HNil]) ⇒ Steps[_, _, _]): Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]
    Definition Classes
    Steps
  103. def vtableMethod: Method[Labels]

    Traverse to the methods which are part of the VTables of this type declaration.

  104. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  105. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  106. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  107. def walkIn(edgeType: String): GremlinScala[Vertex]
    Definition Classes
    NodeSteps

Inherited from IsExternalAccessor[codepropertygraph.generated.nodes.TypeDecl, Labels]

Inherited from PropertyAccessors[codepropertygraph.generated.nodes.TypeDecl, Labels]

Inherited from FullNameAccessors[codepropertygraph.generated.nodes.TypeDecl, Labels]

Inherited from NameAccessors[codepropertygraph.generated.nodes.TypeDecl, Labels]

Inherited from StringPropertyAccessors[codepropertygraph.generated.nodes.TypeDecl, Labels]

Inherited from CpgSteps[codepropertygraph.generated.nodes.TypeDecl, Labels]

Inherited from NodeSteps[codepropertygraph.generated.nodes.TypeDecl, Labels]

Inherited from Steps[codepropertygraph.generated.nodes.TypeDecl, Vertex, Labels]

Inherited from StepsRoot

Inherited from AnyRef

Inherited from Any

Ungrouped