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 issues

    Defines implicit conversions to wrap some types of analyses such that they generate results of type org.opalj.br.analyses.ReportableAnalysisResult.

    Defines implicit conversions to wrap some types of analyses such that they generate results of type org.opalj.br.analyses.ReportableAnalysisResult.

    Definition Classes
    opalj
  • ClassComprehension
  • ClassLocation
  • CodeComprehension
  • FieldLocation
  • FieldValues
  • InstructionLocation
  • Issue
  • IssueCategory
  • IssueDetails
  • IssueDetailsWrites
  • IssueKind
  • IssueLocation
  • IssueLocationWrites
  • IssueOrdering
  • IssueRepresentations
  • LocalVariables
  • MethodComprehension
  • MethodLocation
  • MethodReturnValues
  • Operands
  • PCLineComprehension
  • PackageLocation
  • ProjectLocation
  • Relevance
  • RelevanceWrites
o

org.opalj.issues

IssueOrdering

object IssueOrdering extends Ordering[Issue]

Defines a partial order for issues. The issues are sorted first by the relevance, then by their locations, then by the categories, then by the kinds, then by the analyses' ids and at last by the summary.

Source
IssueOrdering.scala
Linear Supertypes
Ordering[Issue], PartialOrdering[Issue], Equiv[Issue], Serializable, Comparator[Issue], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IssueOrdering
  2. Ordering
  3. PartialOrdering
  4. Equiv
  5. Serializable
  6. Comparator
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. class OrderingOps extends AnyRef
    Definition Classes
    Ordering

Value Members

  1. def compare(x: Issue, y: Issue): Int
    Definition Classes
    IssueOrdering → Ordering → Comparator
  2. def compare(x: Set[String], y: Set[String]): Int
  3. def equiv(x: Issue, y: Issue): Boolean
    Definition Classes
    Ordering → PartialOrdering → Equiv
  4. def gt(x: Issue, y: Issue): Boolean
    Definition Classes
    Ordering → PartialOrdering
  5. def gteq(x: Issue, y: Issue): Boolean
    Definition Classes
    Ordering → PartialOrdering
  6. def isReverseOf(other: Ordering[_]): Boolean
    Definition Classes
    Ordering
  7. def lt(x: Issue, y: Issue): Boolean
    Definition Classes
    Ordering → PartialOrdering
  8. def lteq(x: Issue, y: Issue): Boolean
    Definition Classes
    Ordering → PartialOrdering
  9. def max[U <: Issue](x: U, y: U): U
    Definition Classes
    Ordering
  10. def min[U <: Issue](x: U, y: U): U
    Definition Classes
    Ordering
  11. implicit def mkOrderingOps(lhs: Issue): OrderingOps
    Definition Classes
    Ordering
  12. def on[U](f: (U) => Issue): Ordering[U]
    Definition Classes
    Ordering
  13. def orElse(other: Ordering[Issue]): Ordering[Issue]
    Definition Classes
    Ordering
  14. def orElseBy[S](f: (Issue) => S)(implicit ord: Ordering[S]): Ordering[Issue]
    Definition Classes
    Ordering
  15. def reverse: Ordering[Issue]
    Definition Classes
    Ordering → PartialOrdering
  16. def reversed(): Comparator[Issue]
    Definition Classes
    Comparator
  17. def thenComparing[U <: Comparable[_ >: U <: AnyRef]](arg0: Function[_ >: Issue <: AnyRef, _ <: U]): Comparator[Issue]
    Definition Classes
    Comparator
  18. def thenComparing[U <: AnyRef](arg0: Function[_ >: Issue <: AnyRef, _ <: U], arg1: Comparator[_ >: U <: AnyRef]): Comparator[Issue]
    Definition Classes
    Comparator
  19. def thenComparing(arg0: Comparator[_ >: Issue <: AnyRef]): Comparator[Issue]
    Definition Classes
    Comparator
  20. def thenComparingDouble(arg0: ToDoubleFunction[_ >: Issue <: AnyRef]): Comparator[Issue]
    Definition Classes
    Comparator
  21. def thenComparingInt(arg0: ToIntFunction[_ >: Issue <: AnyRef]): Comparator[Issue]
    Definition Classes
    Comparator
  22. def thenComparingLong(arg0: ToLongFunction[_ >: Issue <: AnyRef]): Comparator[Issue]
    Definition Classes
    Comparator
  23. def tryCompare(x: Issue, y: Issue): Some[Int]
    Definition Classes
    Ordering → PartialOrdering