Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add missing file. #1803

Merged
merged 1 commit into from
Jan 13, 2025
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
@@ -0,0 +1,70 @@
package io.shiftleft.codepropertygraph.generated.traversals

import io.shiftleft.codepropertygraph.generated.nodes
import io.shiftleft.codepropertygraph.generated.accessors.languagebootstrap.*

final class TraversalPropertyGenericSignature[
NodeType <: nodes.StoredNode & nodes.StaticType[nodes.HasGenericSignatureEMT]
](val traversal: Iterator[NodeType])
extends AnyVal {

/** Traverse to genericSignature property */
def genericSignature: Iterator[String] =
traversal.map(_.genericSignature)

/** Traverse to nodes where the genericSignature matches the regular expression `value`
*/
def genericSignature(pattern: String): Iterator[NodeType] =
if (!flatgraph.misc.Regex.isRegex(pattern)) {
genericSignatureExact(pattern)
} else {
val matcher = flatgraph.misc.Regex.multilineMatcher(pattern)
traversal.filter { item => matcher.reset(item.genericSignature).matches }
}

/** Traverse to nodes where the genericSignature matches at least one of the regular expressions in `values`
*/
def genericSignature(patterns: String*): Iterator[NodeType] = {
val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher)
traversal.filter { item => matchers.exists { _.reset(item.genericSignature).matches } }
}

/** Traverse to nodes where genericSignature matches `value` exactly.
*/
def genericSignatureExact(value: String): Iterator[NodeType] = traversal match {
case init: flatgraph.misc.InitNodeIterator[flatgraph.GNode @unchecked] if init.isVirgin && init.hasNext =>
val someNode = init.next
flatgraph.Accessors
.getWithInverseIndex(someNode.graph, someNode.nodeKind, 23, value)
.asInstanceOf[Iterator[NodeType]]
case _ => traversal.filter { _.genericSignature == value }
}

/** Traverse to nodes where genericSignature matches one of the elements in `values` exactly.
*/
def genericSignatureExact(values: String*): Iterator[NodeType] =
if (values.length == 1) genericSignatureExact(values.head)
else {
val valueSet = values.toSet
traversal.filter { item => valueSet.contains(item.genericSignature) }
}

/** Traverse to nodes where genericSignature does not match the regular expression `value`.
*/
def genericSignatureNot(pattern: String): Iterator[NodeType] = {
if (!flatgraph.misc.Regex.isRegex(pattern)) {
traversal.filter { node => node.genericSignature != pattern }
} else {
val matcher = flatgraph.misc.Regex.multilineMatcher(pattern)
traversal.filterNot { item => matcher.reset(item.genericSignature).matches }
}
}

/** Traverse to nodes where genericSignature does not match any of the regular expressions in `values`.
*/
def genericSignatureNot(patterns: String*): Iterator[NodeType] = {
val matchers = patterns.map(flatgraph.misc.Regex.multilineMatcher)
traversal.filter { item => matchers.find { _.reset(item.genericSignature).matches }.isEmpty }
}

}
Loading