Packages

  • package root
    Definition Classes
    root
  • package org
    Definition Classes
    root
  • package opalj

    OPAL is a Scala-based framework for the static analysis, manipulation and creation of Java bytecode.

    OPAL is a Scala-based framework for the static analysis, manipulation and creation of Java bytecode. OPAL is designed with performance, scalability and adaptability in mind.

    Its main components are:

    • a library (Common) which provides generally useful data-structures and algorithms for static analyses.
    • a framework for implementing lattice based static analyses (Static Analysis Infrastructure)
    • a framework for parsing Java bytecode (Bytecode Infrastructure) that can be used to create arbitrary representations.
    • a library to create a one-to-one in-memory representation of Java bytecode (Bytecode Disassembler).
    • a library to create a representation of Java bytecode that facilitates writing simple static analyses (Bytecode Representation - org.opalj.br).
    • a scalable, easily customizable framework for the abstract interpretation of Java bytecode (Abstract Interpretation Framework - org.opalj.ai).
    • a library to extract dependencies between code elements and to facilitate checking architecture definitions.
    • a library for the lightweight manipulation and creation of Java bytecode (Bytecode Assembler).

    General Design Decisions

    Thread Safety

    Unless explicitly noted, OPAL is thread safe. I.e., the classes defined by OPAL can be considered to be thread safe unless otherwise stated. (For example, it is possible to read and process class files concurrently without explicit synchronization on the client side.)

    No null Values

    Unless explicitly noted, OPAL does not null values I.e., fields that are accessible will never contain null values and methods will never return null. If a method accepts null as a value for a parameter or returns a null value it is always explicitly documented. In general, the behavior of methods that are passed null values is undefined unless explicitly documented.

    No Typecasts for Collections

    For efficiency reasons, OPAL sometimes uses mutable data-structures internally. After construction time, these data-structures are generally represented using their generic interfaces (e.g., scala.collection.{Set,Map}). However, a downcast (e.g., to add/remove elements) is always forbidden as it would effectively prevent thread-safety.

    Assertions

    OPAL makes heavy use of Scala's Assertion Facility to facilitate writing correct code. Hence, for production builds (after thorough testing(!)) it is highly recommend to build OPAL again using -Xdisable-assertions.

    Definition Classes
    org
  • package graphs

    This package defines graph algorithms as well as factory methods to describe and compute graphs and trees.

    This package defines graph algorithms as well as factory methods to describe and compute graphs and trees.

    This package supports the following types of graphs:

    1. graphs based on explicitly connected nodes (org.opalj.graphs.Node),
    2. graphs where the relationship between the nodes are encoded externally (org.opalj.graphs.Graph).
    Definition Classes
    opalj
  • AbstractDominatorTree
  • AbstractGraph
  • ControlDependencies
  • DefaultMutableMode
  • DefaultMutableNode
  • DominanceFrontiers
  • DominatorTree
  • Graph
  • MutableNode
  • MutableNodeLike
  • Node
  • PostDominatorTree
  • UnidirectionalGraph
  • VirtualUnidirectionalGraph
c

org.opalj.graphs

VirtualUnidirectionalGraph

class VirtualUnidirectionalGraph extends AbstractGraph[Int]

Efficient representation of a mutable graph where the nodes are identified using consecutive int values (0,1,3,...). This graph in particular supports the case where many nodes do not have successors. Furthermore, computing the strongly connected components is particular efficient as no transformations are required since we already use int values for the nodes.

Thread Safety

This class is not thread-safe!

Source
VirtualUnidirectionalGraph.scala
Example:

  1. Some nodes may have no successors:

    val edges = Map((0 -> List(1)),(1 -> List(0)),(2 -> List(3))/*,(3 -> List())*/)
val successors : Int => Iterator[Int] = (i : Int) => {
edges.get(i) match {case Some(successors) => successors.toIterator; case _ => Iterator.empty }
}
val vg = new org.opalj.graphs.VirtualUnidirectionalGraph(4/*max id of a node +1 */,successors)
Linear Supertypes
AbstractGraph[Int], (Int) => IterableOnce[Int], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. VirtualUnidirectionalGraph
  2. AbstractGraph
  3. Function1
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new VirtualUnidirectionalGraph(verticesCount: Int, successors: (Int) => IntIterator)

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 andThen[A](g: (IterableOnce[Int]) => A): (Int) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  5. def apply(s: Int): IterableOnce[Int]

    Returns a given node's successor nodes.

    Returns a given node's successor nodes.

    Definition Classes
    VirtualUnidirectionalGraph → AbstractGraph → Function1
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
  8. def compose[A](g: (A) => Int): (A) => IterableOnce[Int]
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  11. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  12. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  13. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  14. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. def nonEmpty: Boolean
    Definition Classes
    VirtualUnidirectionalGraph → AbstractGraph
  16. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  17. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  18. def rootNodes(ignoreSelfRecursiveDependencies: Boolean = true): Set[Int]

    Returns the set of nodes with no incoming dependencies; self-dependencies are optionally ignored.

    Returns the set of nodes with no incoming dependencies; self-dependencies are optionally ignored.

    ignoreSelfRecursiveDependencies

    If true self-dependencies are ignored. This means that nodes that have a self dependency are considered as being root nodes if they have no further incoming dependencies.

    returns

    The set of root nodes which can be freely mutated.

    Definition Classes
    AbstractGraph
    Example:

    1. scala> val g = org.opalj.graphs.Graph.empty[AnyRef] +=
         ("a" -> "b") += ("b" -> "c") += ("b" -> "d") +=
         ("a" -> "e") += ("f" -> "e") += ("y" -> "y") +=
         ("a" -> "f")
g: org.opalj.graphs.Graph[AnyRef] =
Graph{
d => {}
c => {}
a => {f,e,b}
b => {d,c}
e => {}
y => {y}
f => {e}
}

scala> g.rootNodes(ignoreSelfRecursiveDependencies = true)
res1: scala.collection.mutable.Set[AnyRef] = Set(a)

scala> g.rootNodes(ignoreSelfRecursiveDependencies = false)
res2: scala.collection.mutable.Set[AnyRef] = Set(y, a)
  19. def sccs(filterSingletons: Boolean = false): List[List[Int]]
  20. val successors: (Int) => IntIterator
  21. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  22. def theSuccessors(s: Int): IntIterator

    Returns a node's successors.

  23. def toDot(dir: String = "forward", ranksep: String = "1.0", rankdir: String = "TB"): String
    Definition Classes
    AbstractGraph
  24. def toNodes: Iterable[Node]
    Definition Classes
    AbstractGraph
  25. def toString(): String
    Definition Classes
    AbstractGraph → Function1 → AnyRef → Any
  26. def vertices: Range
    Definition Classes
    VirtualUnidirectionalGraph → AbstractGraph
  27. val verticesCount: Int
  28. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  29. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  30. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

Inherited from AbstractGraph[Int]

Inherited from (Int) => IterableOnce[Int]

Inherited from AnyRef

Inherited from Any

Ungrouped