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 MethodInst[Labels <: HList] extends CpgSteps[codepropertygraph.generated.nodes.MethodInst, Labels] with NameAccessors[codepropertygraph.generated.nodes.MethodInst, Labels] with FullNameAccessors[codepropertygraph.generated.nodes.MethodInst, Labels] with SignatureAccessors[codepropertygraph.generated.nodes.MethodInst, Labels]

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

Instance Constructors

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

Type Members

  1. type EndDomain0 = codepropertygraph.generated.nodes.MethodInst
    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.MethodInst]): NodeSteps[codepropertygraph.generated.nodes.MethodInst, Labels]
    Definition Classes
    NodeSteps
  6. def and(andTraversals: (Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, HNil]) ⇒ Steps[_, _, _]*): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Definition Classes
    Steps
  7. def as[NewLabels <: HList](stepLabel: StepLabel[codepropertygraph.generated.nodes.MethodInst])(implicit prependDomain: shapeless.ops.hlist.Prepend.Aux[Labels, ::[codepropertygraph.generated.nodes.MethodInst, HNil], NewLabels]): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, NewLabels]
    Definition Classes
    Steps
  8. def as[NewLabels <: HList](stepLabel: String)(implicit prependDomain: shapeless.ops.hlist.Prepend.Aux[Labels, ::[codepropertygraph.generated.nodes.MethodInst, HNil], NewLabels]): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, NewLabels]
    Definition Classes
    Steps
  9. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  10. def callIn(implicit callResolver: ICallResolver): Call[Labels]

    Incoming call sites

  11. def callOut: Call[Labels]

    Outgoing call sites of method.

  12. def calledBy(sourceTrav: MethodInst[Labels])(implicit callResolver: ICallResolver): Method[Labels]

    Traverse to direct and transitive callers of the method.

  13. def calledBy(sourceTrav: Method[Labels])(implicit callResolver: ICallResolver): Method[Labels]

    Traverse to direct and transitive callers of the method.

  14. def callee(implicit callResolver: ICallResolver): Method[Labels]

    Traverse to methods called by method.

  15. def caller(implicit callResolver: ICallResolver): Method[Labels]

    Traverse to direct callers of this method

  16. def clone(): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Definition Classes
    Steps → AnyRef
  17. val converter: Converter[codepropertygraph.generated.nodes.MethodInst] { type GraphType = gremlin.scala.Vertex }
    Definition Classes
    MethodInst → StringPropertyAccessors → Steps
  18. def count(): Long
    Definition Classes
    Steps
  19. def dedup(): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Definition Classes
    Steps
  20. def definingMethod: Method[Labels]

    The method in which the method is defined.

  21. def definingTypeDecl: TypeDecl[Labels]

    The type declaration associated with method.

  22. def emit(emitTraversal: (Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, HNil]) ⇒ Steps[_, _, _]): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Definition Classes
    Steps
  23. def emit(): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Definition Classes
    Steps
  24. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  25. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  26. def exec(): Unit
    Definition Classes
    Steps
  27. def file: File[Labels]

    Traverse to source file

    Traverse to source file

    Definition Classes
    CpgSteps
  28. def filter(predicate: (Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]) ⇒ Steps[_, _, _]): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Definition Classes
    Steps
  29. def filterNot(predicate: (Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]) ⇒ Steps[_, _, _]): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Definition Classes
    Steps
  30. def filterOnEnd(predicate: (codepropertygraph.generated.nodes.MethodInst) ⇒ Boolean): NodeSteps[codepropertygraph.generated.nodes.MethodInst, Labels]
    Definition Classes
    NodeSteps
  31. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  32. def flatMap[NewSteps <: StepsRoot](fun: (codepropertygraph.generated.nodes.MethodInst) ⇒ 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
  33. def fullName(value: String*): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Definition Classes
    FullNameAccessors
  34. def fullName(value: String): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Definition Classes
    FullNameAccessors
  35. def fullName(): Steps[String, String, Labels]
    Definition Classes
    FullNameAccessors
  36. def fullNameExact(values: String*): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Definition Classes
    FullNameAccessors
  37. def fullNameExact(value: String): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Definition Classes
    FullNameAccessors
  38. def fullNameNot(values: String*): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Definition Classes
    FullNameAccessors
  39. def fullNameNot(value: String): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Definition Classes
    FullNameAccessors
  40. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  41. implicit val graph: Graph
    Definition Classes
    CpgSteps
  42. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  43. def head(): codepropertygraph.generated.nodes.MethodInst
    Definition Classes
    Steps
  44. def headOption(): Option[codepropertygraph.generated.nodes.MethodInst]
    Definition Classes
    Steps
  45. def id(ids: AnyRef*): NodeSteps[codepropertygraph.generated.nodes.MethodInst, Labels]
    Definition Classes
    NodeSteps
  46. def inVTableOfTypeDecl: TypeDecl[Labels]

    Traverse to the type declarations were method is in the VTable.

  47. def isAbstract: MethodInst[Labels]

    Traverse to abstract methods

  48. def isConstructor: MethodInst[Labels]

    Traverse to constructors, that is, keep methods that are constructors

  49. def isDefined: Boolean
    Definition Classes
    Steps
  50. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  51. def isNative: MethodInst[Labels]

    Traverse to native methods

  52. def isNotStub: MethodInst[Labels]

    Traverse only to methods that are not stubs.

  53. def isPrivate: MethodInst[Labels]

    Traverse to private methods

  54. def isProtected: MethodInst[Labels]

    Traverse to protected methods

  55. def isPublic: MethodInst[Labels]

    Traverse to public methods

  56. def isStatic: MethodInst[Labels]

    Traverse to static methods

  57. def isStub: MethodInst[Labels]

    Traverse only to methods that are stubs, e.g., their code is not available

  58. def isVirtual: MethodInst[Labels]

    Traverse to virtual method

  59. def iterate(): Unit
    Definition Classes
    Steps
  60. def l: List[codepropertygraph.generated.nodes.MethodInst]
    Definition Classes
    Steps
  61. def literal: Literal[Labels]

    Traverse to literals used in method.

  62. def local: Local[Labels]

    Traverse to the methods local variables.

  63. def map[NewEndDomain, NewEndGraph, NewSteps <: StepsRoot](fun: (codepropertygraph.generated.nodes.MethodInst) ⇒ NewEndDomain)(implicit newConverter: Aux[NewEndDomain, NewEndGraph], constr: Aux[NewEndDomain, Labels, NewEndGraph, NewSteps]): NewSteps
    Definition Classes
    Steps
  64. def method: Method[Labels]
  65. def methodReturn: MethodReturn[Labels]

    Traverse to formal return parameter of method.

  66. def modifier: Modifier[Labels]

    Traverse to method modifiers of method.

  67. def name(value: String*): Steps[codepropertygraph.generated.nodes.MethodInst, 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
  68. def name(value: String): Steps[codepropertygraph.generated.nodes.MethodInst, 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
  69. def name(): Steps[String, String, Labels]

    Traverse to name

    Traverse to name

    Definition Classes
    NameAccessors
  70. def nameExact(values: String*): Steps[codepropertygraph.generated.nodes.MethodInst, 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
  71. def nameExact(value: String): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]

    Traverse to nodes where name matches value exactly.

    Traverse to nodes where name matches value exactly.

    Definition Classes
    NameAccessors
  72. def nameNot(values: String*): Steps[codepropertygraph.generated.nodes.MethodInst, 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
  73. def nameNot(value: String): Steps[codepropertygraph.generated.nodes.MethodInst, 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
  74. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  75. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  76. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  77. def onRaw(fun: (GremlinScala[Vertex]) ⇒ GremlinScala[Vertex]): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Definition Classes
    Steps
  78. def or(orTraversals: (Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, HNil]) ⇒ Steps[_, _, _]*): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Definition Classes
    Steps
  79. def orderBy[A](fun: (codepropertygraph.generated.nodes.MethodInst) ⇒ A): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Definition Classes
    Steps
  80. def p(): Unit
    Definition Classes
    Steps
  81. def parameter: MethodParameter[Labels]

    Traverse to parameters of method.

  82. val raw: GremlinScala[Vertex]
    Definition Classes
    MethodInst → StringPropertyAccessors → CpgSteps → NodeSteps → Steps → StepsRoot
  83. def repeat[NewEndDomain >: codepropertygraph.generated.nodes.MethodInst](repeatTraversal: (Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, HNil]) ⇒ Steps[NewEndDomain, Vertex, _])(implicit newConverter: Aux[NewEndDomain, Vertex]): Steps[NewEndDomain, Vertex, Labels]
    Definition Classes
    Steps
  84. def s(): Stream[codepropertygraph.generated.nodes.MethodInst]
    Definition Classes
    Steps
  85. 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
  86. def select[Label, LabelGraph](label: StepLabel[Label])(implicit conv1: Aux[Label, LabelGraph]): Steps[Label, LabelGraph, Labels]
    Definition Classes
    Steps
  87. 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
  88. def sideEffect(fun: (codepropertygraph.generated.nodes.MethodInst) ⇒ Any): NodeSteps[codepropertygraph.generated.nodes.MethodInst, Labels]
    Definition Classes
    NodeSteps
  89. def signature(value: String*): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]

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

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

    Definition Classes
    SignatureAccessors
  90. def signature(value: String): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]

    Traverse to nodes where the signature matches the regular expression value

    Traverse to nodes where the signature matches the regular expression value

    Definition Classes
    SignatureAccessors
  91. def signature(): Steps[String, String, Labels]

    Traverse to signature

    Traverse to signature

    Definition Classes
    SignatureAccessors
  92. def signatureExact(values: String*): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]

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

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

    Definition Classes
    SignatureAccessors
  93. def signatureExact(value: String): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]

    Traverse to nodes where signature matches value exactly.

    Traverse to nodes where signature matches value exactly.

    Definition Classes
    SignatureAccessors
  94. def signatureNot(values: String*): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]

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

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

    Definition Classes
    SignatureAccessors
  95. def signatureNot(value: String): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]

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

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

    Definition Classes
    SignatureAccessors
  96. def stringProperty(property: Key[String]): Steps[String, String, Labels]
    Attributes
    protected
    Definition Classes
    StringPropertyAccessors
  97. def stringPropertyFilter(property: Key[String], value: String): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Attributes
    protected
    Definition Classes
    StringPropertyAccessors
  98. def stringPropertyFilterExact[Out](property: Key[String], _value: String): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Attributes
    protected
    Definition Classes
    StringPropertyAccessors
  99. def stringPropertyFilterExactMultiple[Out](property: Key[String], values: String*): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Attributes
    protected
    Definition Classes
    StringPropertyAccessors
  100. def stringPropertyFilterMultiple(property: Key[String], values: String*): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Attributes
    protected
    Definition Classes
    StringPropertyAccessors
  101. def stringPropertyFilterNot[Out](property: Key[String], value: String): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Attributes
    protected
    Definition Classes
    StringPropertyAccessors
  102. def stringPropertyFilterNotMultiple[Out](property: Key[String], values: String*): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Attributes
    protected
    Definition Classes
    StringPropertyAccessors
  103. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  104. def times(maxLoops: Int): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Definition Classes
    Steps
  105. def toBuffer(): Buffer[codepropertygraph.generated.nodes.MethodInst]
    Definition Classes
    Steps
  106. def toJson: String

    Execute traversal and convert the result to json.

    Execute traversal and convert the result to json.

    Definition Classes
    CpgSteps
  107. def toJsonPretty: String
    Definition Classes
    CpgSteps
  108. def toList(): List[codepropertygraph.generated.nodes.MethodInst]
    Definition Classes
    Steps
  109. def toMaps(): Steps[Map[String, AnyRef], Map[String, AnyRef], Labels]
    Definition Classes
    CpgSteps
  110. def toSet(): Set[codepropertygraph.generated.nodes.MethodInst]
    Definition Classes
    Steps
  111. def toStream(): Stream[codepropertygraph.generated.nodes.MethodInst]
    Definition Classes
    Steps
  112. def toString(): String
    Definition Classes
    Steps → AnyRef → Any
  113. def until(untilTraversal: (Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, HNil]) ⇒ Steps[_, _, _]): Steps[codepropertygraph.generated.nodes.MethodInst, Vertex, Labels]
    Definition Classes
    Steps
  114. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  115. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  116. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  117. def walkIn(edgeType: String): GremlinScala[Vertex]
    Definition Classes
    NodeSteps

Inherited from SignatureAccessors[codepropertygraph.generated.nodes.MethodInst, Labels]

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

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

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

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

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

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

Inherited from StepsRoot

Inherited from AnyRef

Inherited from Any

Ungrouped