cpg-core/de.fraunhofer.aisec.cpg.graph.edges.flows/Dataflows

Dataflows

class Dataflows<T : Node>(thisRef: Node, var mirrorProperty: KProperty<MutableCollection<Dataflow>>, outgoing: Boolean) : EdgeSet<Node, Dataflow> , MirroredEdgeCollection<Node, Dataflow>

This class represents a container of Dataflow property edges in a thisRef.

Constructors

Link copied to clipboard
constructor(thisRef: Node, mirrorProperty: KProperty<MutableCollection<Dataflow>>, outgoing: Boolean)

Properties

Link copied to clipboard
val Collection<Type>.commonType: Type?

This computed property returns the common type in a Collection of Type objects. For example, if two types A and B both derive from the interface C`` then C` would be returned.

Link copied to clipboard
open override var init: (start: Node, end: Node) -> Dataflow
Link copied to clipboard
Link copied to clipboard
open override var onAdd: (Dataflow) -> Unit?
Link copied to clipboard
open override var onRemove: (Dataflow) -> Unit?
Link copied to clipboard
open override var outgoing: Boolean
Link copied to clipboard
open override val size: Int
Link copied to clipboard
open override var thisRef: Node

Functions

Link copied to clipboard
open fun add(target: Node, init: (Node, Node) -> Dataflow = this.init, builder: Dataflow.() -> Unit? = null): Boolean

Creates a new edge with the target node and an optional builder to include edge properties. If outgoing is true, the edge is created from thisRef ->target, otherwise from target to thisRef.

open override fun add(element: Dataflow): Boolean
Link copied to clipboard
open fun addAll(targets: Collection<Node>, builder: Dataflow.() -> Unit? = null): Boolean
open override fun addAll(elements: Collection<Dataflow>): Boolean
Link copied to clipboard
fun addContextSensitive(node: T, granularity: Granularity = default(), callingContext: CallingContext)

Adds a ContextSensitiveDataflow edge from/to (depending on outgoing) the node which contains this edge container to/from node, with the given Granularity.

Link copied to clipboard
fun <T : Node> Collection<T>?.byNameOrNull(lookup: String, modifier: SearchModifier): T?

This function returns the first node that matches the name on the supplied list of nodes.

Link copied to clipboard
open override fun clear()
Link copied to clipboard
open override fun clone(): Any
Link copied to clipboard
open fun contains(target: Node): Boolean
open operator override fun contains(element: Dataflow): Boolean
Link copied to clipboard
open override fun containsAll(elements: Collection<Dataflow>): Boolean
Link copied to clipboard
open fun <NodeType : Node, PropertyEdgeType : Edge<NodeType>> createEdge(target: NodeType, init: (Node, NodeType) -> PropertyEdgeType, outgoing: Boolean = true, builder: PropertyEdgeType.() -> Unit? = null): PropertyEdgeType
Link copied to clipboard
open operator override fun equals(other: Any?): Boolean
Link copied to clipboard
open fun forEach(p0: Consumer<in Dataflow>)
Link copied to clipboard
operator fun <T : Node> Collection<T>?.get(predicate: (T) -> Boolean, modifier: SearchModifier = SearchModifier.NONE): T?

A shortcut to call firstOrNull using the [] syntax.

operator fun <T : Node> Collection<T>?.get(lookup: String, modifier: SearchModifier = SearchModifier.NONE): T?

A shortcut to call byNameOrNull using the [] syntax.

Link copied to clipboard
open override fun handleOnAdd(edge: Dataflow)

This connects our dataflow to our "mirror" property. Meaning that if we add a node to nextDFG, we add our thisRef to the "prev" of "next" and vice-versa.

Link copied to clipboard
open fun handleOnRemove(edge: Dataflow)

This function will be executed after an edge was removed from the container. This can be used to unregister additional handlers, e.g. a TypeObserver.

Link copied to clipboard
open override fun hashCode(): Int
Link copied to clipboard
operator fun <T : Node> Collection<T>.invoke(predicate: (T) -> Boolean): List<T>

A shortcut invoke filter on a list of nodes.

operator fun <T : Node> Collection<T>.invoke(lookup: String): List<T>

A shortcut to filter a list of nodes by their name.

Link copied to clipboard
open override fun isEmpty(): Boolean
Link copied to clipboard
open operator override fun iterator(): MutableIterator<Dataflow>
Link copied to clipboard
Link copied to clipboard
open operator fun plusAssign(end: Node)
Link copied to clipboard
open fun remove(target: Node): Boolean

Removes all edges with the target node. The target is considered to be either the Edge.end or Edge.start depending on outgoing.

open override fun remove(element: Dataflow): Boolean
Link copied to clipboard
open override fun removeAll(elements: Collection<Dataflow>): Boolean
Link copied to clipboard
open override fun removeIf(predicate: Predicate<in Dataflow>): Boolean
Link copied to clipboard
open fun resetTo(nodes: Collection<Node>)

Clears the collection and adds the nodes.

Link copied to clipboard
open override fun retainAll(elements: Collection<Dataflow>): Boolean
Link copied to clipboard
open override fun spliterator(): Spliterator<Dataflow>
Link copied to clipboard
open fun stream(): Stream<Dataflow>
Link copied to clipboard
open override fun toArray(): Array<Any>
open override fun <T : Any> toArray(p0: Array<T>): Array<T>
open fun <T : Any> toArray(p0: IntFunction<Array<T>>): Array<T>
Link copied to clipboard
Link copied to clipboard
open override fun toNodeCollection(predicate: (Dataflow) -> Boolean?): MutableSet<Node>

Converts this collection of edges into a collection of nodes for easier access to the "target" nodes.

Link copied to clipboard
open override fun toString(): String
Link copied to clipboard
open override fun unwrap(): UnwrappedEdgeSet<Node, Dataflow>

Returns an UnwrappedEdgeSet magic container which holds a structure that provides easy access to the "target" nodes without edge information.