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 collection

    OPAL's collection library is primarily designed with high performance in mind.

    Design Goals

    OPAL's collection library is primarily designed with high performance in mind. I.e., all methods provided by the collection library are reasonably optimized. However, providing a very large number of methods is a non-goal. Overall, OPAL's collection library provides:

    • collection classes that are manually specialized for primitive data-types.
    • collection classes that are optimized for particularly small collections of values.
    • collection classes that target special use cases such as using a collection as a workset/worklist.
    • collection classes that offer special methods that minimize the number of steps when compared to general purpose methods.

    Integration With Scala's Collection Library

    Hence, OPAL's collection library complements Scala's default collection library and is not intended to replace it. Integration with Scala's collection library is primarily provided by means of iterators (OPAL's Iterators inherit from Scala's Iterators). Furthermore the companion object of each of OPAL's collection classes generally provides factory methods that facilitate the conversion from Scala collection classes to OPAL collection classes.

    Status

    The collection library is growing. Nevertheless, the existing classes are production ready.

    Definition Classes
    opalj
  • package immutable
    Definition Classes
    collection
  • :&:
  • BitArraySet
  • Chain
  • ConstArray
  • ConstCovariantArray
  • EmptyIntArraySet
  • EmptyIntTrieSet
  • EmptyLongTrieSet
  • FilteredIntTrieSet
  • FilteredLongTrieSet
  • IdentityPair
  • IntArray
  • IntArraySet
  • IntArraySet1
  • IntArraySetBuilder
  • IntArraySetN
  • IntIntPair
  • IntRefPair
  • IntTrieSet
  • IntTrieSet1
  • IntTrieSetBuilder
  • IntWorkSet
  • LongRefPair
  • LongTrieSet
  • LongTrieSet1
  • LongTrieSetBuilder
  • LongWorkSet
  • Naught
  • NonEmptyUIDSet
  • Pair
  • RefArray
  • UIDLinearProbingSet
  • UIDSet
  • UIDSet0
  • UIDSet1
  • UIDSet2
  • UIDSet3
  • UIDTrieSetInnerNode
  • UIDTrieSetLeaf
  • UShortPair

final case class :&:[T](head: T, rest: Chain[T] = Naught) extends Chain[T] with Product with Serializable

An container for a list element.

Linear Supertypes
Product, Equals, Chain[T], Serializable, Serializable, FilterMonadic[T, Chain[T]], TraversableOnce[T], GenTraversableOnce[T], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. :&:
  2. Product
  3. Equals
  4. Chain
  5. Serializable
  6. Serializable
  7. FilterMonadic
  8. TraversableOnce
  9. GenTraversableOnce
  10. AnyRef
  11. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new :&:(head: T, rest: Chain[T] = Naught)

Type Members

  1. class ChainWithFilter extends FilterMonadic[T, Chain[T]]

    Represents a filtered Chain.

    Represents a filtered Chain. Instances of ChainWithFilter are typically created by Chain's withFilter method.

    Definition Classes
    Chain

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def ++[X >: T](other: Traversable[X]): Chain[X]
    Definition Classes
    Chain
  4. def ++[X >: T](that: Chain[X]): Chain[X]
    Definition Classes
    Chain
  5. def /:[B](z: B)(op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  6. def :&:(x: Int)(implicit ev: <:<[:&:.this.type, Chain[Int]]): Chain[Int]

    Prepends the given int value to this Chain if this chain is a chain of int values.

    Prepends the given int value to this Chain if this chain is a chain of int values.

    Definition Classes
    Chain
  7. def :&:[X >: T](x: X): Chain[X]

    Prepends the given element to this Chain.

    Prepends the given element to this Chain.

    Definition Classes
    Chain
  8. def :&::[X >: T](x: Chain[X]): Chain[X]

    Prepends the given Chain to this chain.

    Prepends the given Chain to this chain.

    Definition Classes
    :&: → Chain
  9. def :\[B](z: B)(op: (T, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  12. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  13. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  14. def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  15. def apply(index: Int): T

    Returns the value of the element of this list with the given index.

    Returns the value of the element of this list with the given index.

    index

    A valid index. A value in the range [0...this.size-1].

    Definition Classes
    Chain
  16. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  17. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  18. def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
    Definition Classes
    TraversableOnce
  19. def contains[X >: T](e: X): Boolean
    Definition Classes
    Chain
  20. def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    Chain → TraversableOnce → GenTraversableOnce
  21. def copyToArray[B >: T](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  22. def copyToArray[B >: T](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  23. def copyToBuffer[B >: T](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  24. def corresponds[X](other: Chain[X])(f: (T, X) ⇒ Boolean): Boolean

    Definition Classes
    Chain
    See also

    merge

  25. def count(p: (T) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  26. def drop(n: Int): Chain[T]
    Definition Classes
    :&: → Chain
  27. def dropWhile(f: (T) ⇒ Boolean): Chain[T]
    Definition Classes
    Chain
  28. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  29. def exists(f: (T) ⇒ Boolean): Boolean
    Definition Classes
    Chain → TraversableOnce → GenTraversableOnce
  30. def filter(f: (T) ⇒ Boolean): Chain[T]
    Definition Classes
    :&: → Chain
  31. def filterNot(f: (T) ⇒ Boolean): Chain[T]
    Definition Classes
    Chain
  32. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  33. def find(p: (T) ⇒ Boolean): Option[T]
    Definition Classes
    Chain → TraversableOnce → GenTraversableOnce
  34. def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Chain[T], B, That]): That
    Definition Classes
    Chain → FilterMonadic
  35. def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  36. def foldLeft[B](z: B)(op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  37. def foldRight[B](z: B)(op: (T, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  38. def forFirstN[U](n: Int)(f: (T) ⇒ U): Unit
    Definition Classes
    Chain
  39. def forall(f: (T) ⇒ Boolean): Boolean
    Definition Classes
    Chain → TraversableOnce → GenTraversableOnce
  40. def foreach[U](f: (T) ⇒ U): Unit
    Definition Classes
    Chain → FilterMonadic → TraversableOnce → GenTraversableOnce
  41. def foreachWhile(f: (T) ⇒ Boolean): Boolean

    Executes the given function f for each element of this chain as long as it returns true.

    Executes the given function f for each element of this chain as long as it returns true.

    Definition Classes
    Chain
  42. def fuse[X >: T <: AnyRef](that: Chain[X], onDiff: (T, X) ⇒ X): Chain[X]

    Definition Classes
    :&: → Chain
    Note

    The merge function first calls the given function and then checks if the result is reference equal to the element of the first list while fuse first checks the reference equality of the members before it calls the given function. Therefore fuse can abort checking all further values when the remaining list fragments are reference equal because both lists are immutable. In other words: fuse is an optimized version of merge where the function f has the following shape: (x,y) => if(x eq y) x else /*whatever*/.

  43. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  44. final def hasDefiniteSize: Boolean
    Definition Classes
    Chain → TraversableOnce → GenTraversableOnce
  45. def hasMultipleElements: Boolean
    Definition Classes
    :&: → Chain
  46. val head: T
    Definition Classes
    :&: → Chain
  47. def headOption: Option[T]
    Definition Classes
    :&: → Chain
  48. def isEmpty: Boolean
    Definition Classes
    :&: → TraversableOnce → GenTraversableOnce
  49. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  50. def isSingletonList: Boolean
    Definition Classes
    :&: → Chain
  51. final def isTraversableAgain: Boolean
    Definition Classes
    Chain → GenTraversableOnce
  52. def last: T
    Definition Classes
    Chain
  53. def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[Chain[T], B, That]): That
    Definition Classes
    Chain → FilterMonadic
  54. def mapConserve[X >: T <: AnyRef](f: (T) ⇒ X): Chain[X]
    Definition Classes
    :&: → Chain
  55. def mapToIntIterator(f: (T) ⇒ Int): IntIterator
    Definition Classes
    Chain
  56. def max[B >: T](implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  57. def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  58. def merge[X <: AnyRef, Z >: T <: AnyRef](that: Chain[X])(f: (T, X) ⇒ Z): Chain[Z]

    Merges this chain with the given chain by merging the values using the given function.

    Merges this chain with the given chain by merging the values using the given function. If all results are the same (reference equality) as this chain's elements then the result will be this. Otherwise, only the tail that is identical will be kept.

    Definition Classes
    :&: → Chain
  59. def min[B >: T](implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  60. def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  61. def mkString(pre: String, sep: String, post: String): String
    Definition Classes
    Chain → TraversableOnce → GenTraversableOnce
  62. def mkString: String
    Definition Classes
    Chain → TraversableOnce → GenTraversableOnce
  63. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  64. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  65. def nonEmpty: Boolean
    Definition Classes
    :&: → Chain → TraversableOnce → GenTraversableOnce
  66. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  67. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  68. def product[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  69. def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  70. def reduceLeft[B >: T](op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce
  71. def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  72. def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  73. def reduceRight[B >: T](op: (T, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  74. def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  75. def reverse: Chain[T]
    Definition Classes
    :&: → Chain
  76. def reversed: List[T]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  77. final def seq: :&:.this.type
    Definition Classes
    Chain → TraversableOnce → GenTraversableOnce
  78. def sharedPrefix[X >: T](other: Chain[X]): Chain[T]

    Computes the shared prefix.

    Computes the shared prefix.

    Definition Classes
    Chain
  79. def size: Int

    Counts the number of elements.

    Counts the number of elements.

    returns

    The size of this list.

    Definition Classes
    Chain → TraversableOnce → GenTraversableOnce
    Note

    This operation has complexity O(n).

  80. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  81. def startsWith[X >: T](other: Chain[X]): Boolean
    Definition Classes
    Chain
  82. def sum[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  83. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  84. def tail: Chain[T]
    Definition Classes
    :&: → Chain
  85. def take(n: Int): Chain[T]

    Takes the first n elements of this list.

    Takes the first n elements of this list. If this list does not contain at least n elements an IllegalStateException will be thrown.

    n

    An int value in the range [0...this.size].

    returns

    A list consisting of the first n value.

    Definition Classes
    :&: → Chain
  86. def takeUpTo(n: Int): Chain[T]

    Takes up to the first n elements of this list.

    Takes up to the first n elements of this list. The returned list will contain at most this.size elements.

    n

    An int value euqal or larger than 0.

    returns

    A list consisting of the first n value.

    Definition Classes
    :&: → Chain
  87. def takeWhile(f: (T) ⇒ Boolean): Chain[T]
    Definition Classes
    :&: → Chain
  88. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def toBuffer[B >: T]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def toIndexedSeq: IndexedSeq[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def toIntArraySet(implicit ev: <:<[T, Int]): IntArraySet
    Definition Classes
    Chain
  93. def toIntTrieSet(implicit ev: <:<[T, Int]): IntTrieSet
    Definition Classes
    Chain
  94. def toIterable: Iterable[T]
    Definition Classes
    Chain → TraversableOnce → GenTraversableOnce
  95. def toIterator: Iterator[T]
    Definition Classes
    Chain → GenTraversableOnce
  96. def toList: List[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def toSeq: Seq[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. def toSet[B >: T]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def toStream: Stream[T]
    Definition Classes
    Chain → GenTraversableOnce
  101. def toString(): String
    Definition Classes
    :&: → AnyRef → Any
  102. def toTraversable: Traversable[T]

    Returns a newly created Traversable[T] collection.

    Returns a newly created Traversable[T] collection.

    Definition Classes
    Chain → TraversableOnce → GenTraversableOnce
  103. def toVector: Vector[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  105. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  106. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  107. def withFilter(p: (T) ⇒ Boolean): ChainWithFilter
    Definition Classes
    Chain → FilterMonadic
  108. def zip[X](other: Chain[X]): Chain[(T, X)]
    Definition Classes
    Chain
  109. def zip[X](other: GenIterable[X]): Chain[(T, X)]
    Definition Classes
    Chain
  110. def zipWithIndex: Chain[(T, Int)]
    Definition Classes
    Chain

Inherited from Product

Inherited from Equals

Inherited from Chain[T]

Inherited from Serializable

Inherited from Serializable

Inherited from FilterMonadic[T, Chain[T]]

Inherited from TraversableOnce[T]

Inherited from GenTraversableOnce[T]

Inherited from AnyRef

Inherited from Any

Ungrouped