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

DefaultMutableNode

class DefaultMutableNode[I] extends MutableNodeLike[I, DefaultMutableNode[I]] with MutableNode[I, DefaultMutableNode[I]]

Default implementation of a mutable node of a graph.

Thread Safety

This is class is thread-safe.

Source
DefaultMutableNode.scala
Linear Supertypes
MutableNodeLike[I, DefaultMutableNode[I]], MutableNode[I, DefaultMutableNode[I]], Node, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DefaultMutableNode
  2. MutableNodeLike
  3. MutableNode
  4. Node
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new DefaultMutableNode(identifier: I, identifierToString: (I) => String, fillcolor: Option[String])
  2. new DefaultMutableNode(theIdentifier: I, identifierToString: (I) => String = (_: Any).toString, theVisualProperties: Map[String, String] = immutable.Map.empty, theChildren: List[DefaultMutableNode[I]] = List.empty)

Value Members

  1. def addChild(node: DefaultMutableNode[I]): Unit
    Definition Classes
    MutableNodeLike → MutableNode
  2. def addChildren(furtherChildren: List[DefaultMutableNode[I]]): Unit
    Definition Classes
    MutableNodeLike
  3. def children: List[DefaultMutableNode[I]]
    Definition Classes
    MutableNodeLike → MutableNode
  4. def equals(other: Any): Boolean
    Definition Classes
    Node → AnyRef → Any
  5. def firstChild: DefaultMutableNode[I]
    Definition Classes
    MutableNodeLike → MutableNode
  6. def foreachSuccessor(f: (Node) => Unit): Unit

    Applies the given function for each successor node.

    Applies the given function for each successor node.

    Definition Classes
    MutableNodeLike → Node
  7. def hasOneChild: Boolean
    Definition Classes
    MutableNodeLike → MutableNode
  8. def hasSuccessors: Boolean

    Returns true if this node has successor nodes.

    Returns true if this node has successor nodes.

    Definition Classes
    MutableNodeLike → Node
  9. def hashCode(): Int

    The hash code of this node.

    The hash code of this node. By default the hash code is the unique id.

    Definition Classes
    Node → AnyRef → Any
  10. def identifier: I
    Definition Classes
    MutableNodeLike → MutableNode
  11. val identifierToString: (I) => String
    Definition Classes
    MutableNodeLike → MutableNode
  12. def mergeVisualProperties(other: Map[String, String]): Unit
    Definition Classes
    MutableNodeLike → MutableNode
  13. def nodeId: Int

    An identifier that uniquely identifies this node in the graph to which this node belongs.

    An identifier that uniquely identifies this node in the graph to which this node belongs. By default two nodes are considered equal if they have the same unique id.

    Definition Classes
    MutableNodeLike → Node
  14. def removeChild(node: DefaultMutableNode[I]): Unit
    Definition Classes
    MutableNodeLike → MutableNode
  15. def removeLastAddedChild(): Unit
    Definition Classes
    MutableNodeLike → MutableNode
  16. def toHRR: Option[String]

    Returns a human readable representation (HRR) of this node.

    Returns a human readable representation (HRR) of this node.

    Definition Classes
    MutableNodeLike → Node
  17. def updateIdentifier(newIdentifier: I): Unit
    Definition Classes
    MutableNodeLike → MutableNode
  18. def visualProperties: Map[String, String]
    Definition Classes
    MutableNodeLike → Node