Class

org.opalj.ai.jdkbug

CallerNode

Related Doc: package jdkbug

Permalink

class CallerNode extends MutableNodeLike[String, Node]

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

Instance Constructors

  1. new CallerNode(identifier: String)

    Permalink
  2. new CallerNode(theIdentifier: String, identifierToString: (String) ⇒ String, theVisualProperties: Map[String, String], theChildren: List[Node])

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def addChild(node: Node): Unit

    Permalink
    Definition Classes
    MutableNodeLikeMutableNode
  5. def addChildren(furtherChildren: List[Node]): Unit

    Permalink
    Definition Classes
    MutableNodeLike
  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. def children: List[Node]

    Permalink
    Definition Classes
    MutableNodeLikeMutableNode
  8. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  10. def equals(other: Any): Boolean

    Permalink
    Definition Classes
    Node → AnyRef → Any
  11. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. def firstChild: Node

    Permalink
    Definition Classes
    MutableNodeLikeMutableNode
  13. def foreachSuccessor(f: (Node) ⇒ Unit): Unit

    Permalink

    Applies the given function for each successor node.

    Applies the given function for each successor node.

    Definition Classes
    MutableNodeLikeNode
  14. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  15. def hasOneChild: Boolean

    Permalink
    Definition Classes
    MutableNodeLikeMutableNode
  16. def hasSuccessors: Boolean

    Permalink

    Returns true if this node has successor nodes.

    Returns true if this node has successor nodes.

    Definition Classes
    MutableNodeLikeNode
  17. def hashCode(): Int

    Permalink

    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: String

    Permalink
    Definition Classes
    MutableNodeLikeMutableNode
  19. val identifierToString: (String) ⇒ String

    Permalink

    A function that converts "an" identifier to a string.

    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.

    Definition Classes
    MutableNodeLikeMutableNode
  20. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  21. def mergeVisualProperties(other: Map[String, String]): Unit

    Permalink
    Definition Classes
    MutableNodeLikeMutableNode
  22. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  23. def nodeId: Int

    Permalink

    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
    MutableNodeLikeNode
  24. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  25. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  26. def removeChild(node: Node): Unit

    Permalink
    Definition Classes
    MutableNodeLikeMutableNode
  27. def removeLastAddedChild(): Unit

    Permalink
    Definition Classes
    MutableNodeLikeMutableNode
  28. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  29. def toHRR: Option[String]

    Permalink

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

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

    Definition Classes
    MutableNodeLikeNode
  30. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  31. def updateIdentifier(newIdentifier: String): Unit

    Permalink
    Definition Classes
    MutableNodeLikeMutableNode
  32. def visualProperties: Map[String, String]

    Permalink
    Definition Classes
    MutableNodeLikeNode
  33. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  35. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from MutableNodeLike[String, Node]

Inherited from MutableNode[String, Node]

Inherited from Node

Inherited from AnyRef

Inherited from Any

Ungrouped