class DiffGraph extends AnyRef
A lightweight write-only graph used for creation of CPG graph overlays
The graph can store edges to/from nodes that do not exist in the base graph. It doesn't assign ids for these nodes until the diff graph is serialized. Ids of new nodes may collide with ids of nodes in the base graph, which are not sources or destinations of edges of the diff graph. When the CPG loader adds nodes of the overlay, it therefor needs to reassign ids for nodes if they are already used in the original CPG.
TODO Michael: make DiffGraph extend tinkerpop.Graph to simplify and foolproof the model
- Alphabetic
- By Inheritance
- DiffGraph
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new DiffGraph()
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##(): Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def addEdge(srcNode: NewNode, dstNode: NewNode, edgeLabel: String, properties: Seq[(String, AnyRef)] = List()): Unit
Add edge between nodes present in the diff graph
- def addEdgeFromOriginal(srcNode: StoredNode, dstNode: NewNode, edgeLabel: String, properties: Seq[(String, AnyRef)] = List()): Unit
Add edge from a node in the original graph to a node in the diff graph
- def addEdgeInOriginal(srcNode: StoredNode, dstNode: StoredNode, edgeLabel: String, properties: Seq[(String, AnyRef)] = List()): Unit
Add edge between nodes of the original graph
- def addEdgeProperty(edge: Edge, key: String, value: AnyRef): ListBuffer[EdgeProperty]
Add a property to an existing edge
- def addEdgeToOriginal(srcNode: NewNode, dstNode: StoredNode, edgeLabel: String, properties: Seq[(String, AnyRef)] = List()): Unit
Add edge from a node in the diff graph to a node in the original graph
- def addNode(node: NewNode): Unit
- def addNodeProperty(node: StoredNode, key: String, value: AnyRef): ListBuffer[NodeProperty]
Add a property to an existing node
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def edgeProperties: List[EdgeProperty]
- def edges: List[EdgeInDiffGraph]
- def edgesFromOriginal: List[EdgeFromOriginal]
- def edgesInOriginal: List[EdgeInOriginal]
- def edgesToOriginal: List[EdgeToOriginal]
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def mergeFrom(other: DiffGraph): Unit
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def nodeProperties: List[NodeProperty]
- def nodes: List[NewNode]
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- DiffGraph → AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()