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

MutableNodeLike

class MutableNodeLike[I, N <: Node] extends MutableNode[I, N]

Represents a mutable node of a directed graph. This class serves as a base implementation of the MutableNode trait.

Thread Safety

This class is thread-safe. It is possible to add multiple child nodes concurrently.

I

The type of the object that is associated with this node/the type of the object for which this node object is created.

See also

The demo project for example usages.

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

Instance Constructors

  1. new MutableNodeLike(theIdentifier: I, identifierToString: (I) ⇒ String, theVisualProperties: Map[String, String], theChildren: List[N])

    theIdentifier

    The underlying object. For all nodes of a graph the hashCode method has to return a unique id unless the nodeId method is overridden. The underlying object must correctly implement the equals/hashCode contract. I.e., the hashCode of two object instances that are added to the same graph is different whenever equals is false.

    identifierToString

    A function that converts "an" identifier to a string. By default the given object's toString method is called. It is possible that a graph has two nodes with the same textual representation representation but a different identity.

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 addChild(node: N): Unit
    Definition Classes
    MutableNodeLike → MutableNode
  5. def addChildren(furtherChildren: List[N]): Unit
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def children: List[N]
    Definition Classes
    MutableNodeLike → MutableNode
  8. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def equals(other: Any): Boolean
    Definition Classes
    Node → AnyRef → Any
  11. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. def firstChild: N
    Definition Classes
    MutableNodeLike → MutableNode
  13. 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
  14. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  15. def hasOneChild: Boolean
    Definition Classes
    MutableNodeLike → MutableNode
  16. def hasSuccessors: Boolean

    Returns true if this node has successor nodes.

    Returns true if this node has successor nodes.

    Definition Classes
    MutableNodeLike → Node
  17. 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
  18. def identifier: I
    Definition Classes
    MutableNodeLike → MutableNode
  19. val identifierToString: (I) ⇒ String
    Definition Classes
    MutableNodeLike → MutableNode
  20. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  21. def mergeVisualProperties(other: Map[String, String]): Unit
    Definition Classes
    MutableNodeLike → MutableNode
  22. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  23. 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
  24. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  25. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  26. def removeChild(node: N): Unit
    Definition Classes
    MutableNodeLike → MutableNode
  27. def removeLastAddedChild(): Unit
    Definition Classes
    MutableNodeLike → MutableNode
  28. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  29. 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
  30. def toString(): String
    Definition Classes
    AnyRef → Any
  31. def updateIdentifier(newIdentifier: I): Unit
    Definition Classes
    MutableNodeLike → MutableNode
  32. def visualProperties: Map[String, String]
    Definition Classes
    MutableNodeLike → Node
  33. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  35. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from MutableNode[I, N]

Inherited from Node

Inherited from AnyRef

Inherited from Any

Ungrouped