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

EmptyLongTrieSet

object EmptyLongTrieSet extends LongTrieSetL with Product with Serializable

Linear Supertypes
Serializable, Serializable, Product, Equals, LongTrieSetL, LongTrieSet, LongWorkSet[LongTrieSet], LongCollectionWithStableOrdering[LongTrieSet], LongSet[LongTrieSet], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EmptyLongTrieSet
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. LongTrieSetL
  7. LongTrieSet
  8. LongWorkSet
  9. LongCollectionWithStableOrdering
  10. LongSet
  11. AnyRef
  12. 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: Long): LongTrieSet1
    Definition Classes
    EmptyLongTrieSet → LongSet
  4. def +!(i: Long): LongTrieSet

    Tries to add the given method to this trie set by mutating the set if possible.

    Tries to add the given method to this trie set by mutating the set if possible. Due to the longernal organization, mutating the set is not always possible. In this case, a new set containing the new value is returned. Hence, the return value must not be ignored!

    Definition Classes
    EmptyLongTrieSet → LongTrieSet
  5. final def ++(that: LongIterator): LongTrieSet
    Definition Classes
    LongSet
  6. final def ++(that: TraversableOnce[Long]): LongTrieSet
    Definition Classes
    LongSet
  7. final def ++(that: LongTrieSet): LongTrieSet
    Definition Classes
    LongSet
  8. final def ++!(that: LongTrieSet): LongTrieSet

    Definition Classes
    LongTrieSet
    See also

    +!(Long) for details!

  9. def -(i: Long): EmptyLongTrieSet.this.type
    Definition Classes
    EmptyLongTrieSet → LongSet
  10. final def --(is: LongSet[_]): LongTrieSet
    Definition Classes
    LongSet
  11. final def --(is: TraversableOnce[Long]): LongTrieSet
    Definition Classes
    LongSet
  12. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  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 contains(value: Long): Boolean
    Definition Classes
    EmptyLongTrieSet → LongSet
  16. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  17. def equals(other: Any): Boolean
    Definition Classes
    EmptyLongTrieSet → Equals → AnyRef → Any
  18. def exists(p: (Long) ⇒ Boolean): Boolean
    Definition Classes
    EmptyLongTrieSet → LongSet
  19. def filter(p: (Long) ⇒ Boolean): LongTrieSet
    Definition Classes
    EmptyLongTrieSet → LongTrieSet
  20. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  21. def flatMap(f: (Long) ⇒ LongTrieSet): LongTrieSet
    Definition Classes
    EmptyLongTrieSet → LongSet
  22. def foldLeft[B](z: B)(f: (B, Long) ⇒ B): B
    Definition Classes
    EmptyLongTrieSet → LongSet
  23. def forall(f: (Long) ⇒ Boolean): Boolean
    Definition Classes
    EmptyLongTrieSet → LongSet
  24. def foreach[U](f: (Long) ⇒ U): Unit
    Definition Classes
    EmptyLongTrieSet → LongSet
  25. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  26. 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
    EmptyLongTrieSet → LongSet
  27. def hashCode(): Int
    Definition Classes
    EmptyLongTrieSet → AnyRef → Any
  28. def head: Long
    Definition Classes
    EmptyLongTrieSet → LongSet
  29. def headAndTail: LongRefPair[LongTrieSet]

    Returns some value and removes it from this set.

    Returns some value and removes it from this set.

    Definition Classes
    EmptyLongTrieSet → LongTrieSet → LongWorkSet
  30. def intersect(other: LongTrieSet): LongTrieSet
    Definition Classes
    EmptyLongTrieSet → LongTrieSet
  31. def isEmpty: Boolean
    Definition Classes
    EmptyLongTrieSet → LongSet
  32. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  33. 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
    EmptyLongTrieSet → LongSet
  34. def iterator: LongIterator
    Definition Classes
    EmptyLongTrieSet → LongSet
  35. def map(f: (Long) ⇒ Long): LongTrieSet
    Definition Classes
    EmptyLongTrieSet → LongSet
  36. def map[A <: AnyRef](f: (Long) ⇒ A): Set[A]
    Definition Classes
    LongSet
  37. final def mkString(in: String): String
    Definition Classes
    LongSet
  38. final def mkString(pre: String, in: String, post: String): String
    Definition Classes
    LongSet
  39. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  40. def nonEmpty: Boolean
    Definition Classes
    LongSet
  41. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  42. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  43. 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
    EmptyLongTrieSet → LongSet
  44. final def subsetOf(other: LongTrieSet): Boolean
    Definition Classes
    LongTrieSet → LongCollectionWithStableOrdering
  45. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  46. final def toString(): String
    Definition Classes
    LongTrieSet → AnyRef → Any
  47. final def transform[B, To](f: (Long) ⇒ B, b: Builder[B, To]): To
    Definition Classes
    LongSet
  48. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  49. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  50. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  51. def withFilter(p: (Long) ⇒ Boolean): LongTrieSet
    Definition Classes
    EmptyLongTrieSet → LongTrieSet → LongSet

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from LongTrieSetL

Inherited from LongTrieSet

Inherited from LongWorkSet[LongTrieSet]

Inherited from LongCollectionWithStableOrdering[LongTrieSet]

Inherited from LongSet[LongTrieSet]

Inherited from AnyRef

Inherited from Any

Ungrouped