Object

org.opalj.fpcf.analyses.cg.cha

CHACallGraphKey

Related Doc: package cha

Permalink

object CHACallGraphKey extends ProjectInformationKey[ComputedCallGraph, Nothing]

The key object to get a call graph that was calculated using the CHA algorithm.

In general, a CHA call graph is only a very rough approximation of the ideal call graph and may contain a large number edges that will never (cannot) occur at runtime.

Example:

  1. To get the call graph object use the Project's get method and pass in this object.

Linear Supertypes
ProjectInformationKey[ComputedCallGraph, Nothing], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. CHACallGraphKey
  2. ProjectInformationKey
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

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. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  6. def compute(project: SomeProject): ComputedCallGraph

    Permalink

    Computes the CallGraph for the given project.

    Computes the CallGraph for the given project.

    Attributes
    protected
    Definition Classes
    CHACallGraphKey → ProjectInformationKey

  7. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  8. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  9. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  10. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  11. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  12. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  13. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  14. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  15. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  16. def requirements: Seq[ProjectInformationKey[_ >: EntryPointInformation with IntStatistics with InstantiableClasses with CallBySignatureResolution <: AnyRef, Nothing]]

    Permalink

    The CHACallGraph has no special prerequisites.W

    The CHACallGraph has no special prerequisites.W

    returns

    Nil.

    Attributes
    protected
    Definition Classes
    CHACallGraphKey → ProjectInformationKey

  17. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  18. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  19. final val uniqueId: Int

    Permalink
    Definition Classes
    ProjectInformationKey

  20. final def wait(): Unit

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

  21. final def wait(arg0: Long, arg1: Int): Unit

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

  22. final def wait(arg0: Long): Unit

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

Inherited from ProjectInformationKey[ComputedCallGraph, Nothing]

Inherited from AnyRef

Inherited from Any

Ungrouped