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
o

org.opalj.collection.immutable

EmptyIntArraySet

object EmptyIntArraySet extends IntArraySet with Product with Serializable

Linear Supertypes
Serializable, Serializable, Product, Equals, IntArraySet, IntCollectionWithStableOrdering[IntArraySet], IntSet[IntArraySet], (Int) ⇒ Int, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EmptyIntArraySet
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. IntArraySet
  7. IntCollectionWithStableOrdering
  8. IntSet
  9. Function1
  10. AnyRef
  11. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(i: Int): IntArraySet1
    Definition Classes
    EmptyIntArraySet → IntSet
  4. final def ++(that: IntIterator): IntArraySet
    Definition Classes
    IntSet
  5. final def ++(that: TraversableOnce[Int]): IntArraySet
    Definition Classes
    IntSet
  6. final def ++(that: IntArraySet): IntArraySet
    Definition Classes
    IntSet
  7. def -(i: Int): EmptyIntArraySet.this.type
    Definition Classes
    EmptyIntArraySet → IntSet
  8. final def --(is: IntSet[_]): IntArraySet
    Definition Classes
    IntSet
  9. final def --(is: TraversableOnce[Int]): IntArraySet
    Definition Classes
    IntSet
  10. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def andThen[A](g: (Int) ⇒ A): (Int) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  12. def apply(index: Int): Int
    Definition Classes
    EmptyIntArraySet → Function1
  13. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  14. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  15. def compose[A](g: (A) ⇒ Int): (A) ⇒ Int
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  16. def contains(value: Int): Boolean
    Definition Classes
    EmptyIntArraySet → IntSet
  17. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. def equals(other: Any): Boolean
    Definition Classes
    EmptyIntArraySet → Equals → AnyRef → Any
  19. def exists(p: (Int) ⇒ Boolean): Boolean
    Definition Classes
    EmptyIntArraySet → IntSet
  20. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  21. def flatMap(f: (Int) ⇒ IntArraySet): IntArraySet
    Definition Classes
    EmptyIntArraySet → IntSet
  22. def foldLeft[B](z: B)(f: (B, Int) ⇒ B): B
    Definition Classes
    EmptyIntArraySet → IntSet
  23. def forall(f: (Int) ⇒ Boolean): Boolean
    Definition Classes
    EmptyIntArraySet → IntSet
  24. def foreach[U](f: (Int) ⇒ U): Unit
    Definition Classes
    EmptyIntArraySet → IntSet
  25. def foreachPair[U](f: (Int, Int) ⇒ U): Unit

    Returns each pairing of two values.

    Returns each pairing of two values. I.e., if the set contains 1, 4, 8, the pairings (1,4),(1,8) and (4,8) will be returned; the pairings (4,1) etc. will not be returned. The order between the two values is not defined.

    Definition Classes
    EmptyIntArraySet → IntArraySet
  26. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  27. def hasMultipleElements: Boolean

    Tests if this set has more than one element (complexity: O(1)).

    Tests if this set has more than one element (complexity: O(1)).

    Definition Classes
    EmptyIntArraySet → IntSet
  28. def hashCode(): Int
    Definition Classes
    EmptyIntArraySet → AnyRef → Any
  29. final def head: Int
    Definition Classes
    IntArraySet → IntSet
  30. def isEmpty: Boolean
    Definition Classes
    EmptyIntArraySet → IntSet
  31. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  32. def isSingletonSet: Boolean

    Tests if this set has exactly one element (complexity: O(1)).

    Tests if this set has exactly one element (complexity: O(1)).

    Definition Classes
    EmptyIntArraySet → IntSet
  33. def iterator: IntIterator
    Definition Classes
    EmptyIntArraySet → IntSet
  34. final def last: Int
    Definition Classes
    IntArraySet
  35. def map(map: Array[Int]): IntArraySet

    Uses the keys of this set to map them to the value found in the given array at the respective index.

    Uses the keys of this set to map them to the value found in the given array at the respective index.

    Definition Classes
    EmptyIntArraySet → IntSet
  36. def map(f: (Int) ⇒ Int): IntArraySet
    Definition Classes
    EmptyIntArraySet → IntSet
  37. def map[A <: AnyRef](f: (Int) ⇒ A): Set[A]
    Definition Classes
    IntSet
  38. def max: Int
    Definition Classes
    EmptyIntArraySet → IntArraySet
  39. def min: Int
    Definition Classes
    EmptyIntArraySet → IntArraySet
  40. final def mkString(in: String): String
    Definition Classes
    IntSet
  41. final def mkString(pre: String, in: String, post: String): String
    Definition Classes
    IntSet
  42. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  43. def nonEmpty: Boolean
    Definition Classes
    IntSet
  44. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  45. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  46. def reverseIntIterator: IntIterator
    Definition Classes
    EmptyIntArraySet → IntArraySet
  47. def size: Int

    The size of the set; may not be a constant operation; if possible use isEmpty, nonEmpty, etc.; or lookup the complexity in the concrete data structures.

    The size of the set; may not be a constant operation; if possible use isEmpty, nonEmpty, etc.; or lookup the complexity in the concrete data structures.

    Definition Classes
    EmptyIntArraySet → IntSet
  48. def subsetOf(other: IntArraySet): Boolean
    Definition Classes
    EmptyIntArraySet → IntCollectionWithStableOrdering
  49. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  50. def toArray: Array[Int]
    Definition Classes
    IntSet
  51. def toChain: Chain[Int]
    Definition Classes
    EmptyIntArraySet → IntSet
  52. final def toString(): String
    Definition Classes
    IntArraySet → Function1 → AnyRef → Any
  53. final def transform[B, To](f: (Int) ⇒ B, b: Builder[B, To]): To
    Definition Classes
    IntSet
  54. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  55. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  56. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  57. def withFilter(p: (Int) ⇒ Boolean): IntArraySet
    Definition Classes
    EmptyIntArraySet → IntSet

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from IntArraySet

Inherited from IntCollectionWithStableOrdering[IntArraySet]

Inherited from IntSet[IntArraySet]

Inherited from (Int) ⇒ Int

Inherited from AnyRef

Inherited from Any

Ungrouped