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
  • EmptyIntList
  • EmptyIntTrieSet
  • FilteredIntTrieSet
  • IdentityPair
  • Int2List
  • Int2ListEnd
  • Int2ListNode
  • IntArray
  • IntArraySet
  • IntArraySet1
  • IntArraySetBuilder
  • IntArraySetN
  • IntIntPair
  • IntList
  • IntListNode
  • IntRefPair
  • IntTrieSet
  • IntTrieSet1
  • IntTrieSetBuilder
  • IntWorkSet
  • LargeLongLinkedTrieSet
  • Long2List
  • Long2List0
  • LongLinkedSet
  • LongLinkedTrieSet
  • LongLinkedTrieSet0
  • LongLinkedTrieSet1
  • LongLinkedTrieSetN4
  • LongList
  • LongList0
  • LongListNode
  • LongRefPair
  • LongTrieSet
  • LongTrieSetWithList
  • LongWorkSet
  • Naught
  • NonEmptyUIDSet
  • Pair
  • Ref2List
  • RefArray
  • RefIntPair
  • UIDSet
  • UIDSet0
  • UIDSet1
  • UIDSet2
  • UIDSet3
  • UIDSetInnerNode
  • UIDSetLeaf
  • UIDTrieSet
  • UIDTrieSet0
  • UIDTrieSet1
  • UShortPair

sealed abstract class IntTrieSet extends IntSet[IntTrieSet] with IntCollectionWithStableOrdering[IntTrieSet] with IntWorkSet[IntTrieSet]

An unordered set of integer values backed by a trie set. The branching is done using the least significant bit and values are only stored in leaf nodes. This ensure that we have a stable iteration order.

Self Type
IntTrieSet
Source
IntTrieSet.scala
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IntTrieSet
  2. IntWorkSet
  3. IntCollectionWithStableOrdering
  4. IntSet
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def +(i: Int): IntTrieSet
    Definition Classes
    IntSet
  2. abstract def +!(value: Int): IntTrieSet

    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 internal organization, mutating the set is not always possible. In this case, a new set containing the new value is returned. Hence, the return value does not have to be ignored!

  3. abstract def -(i: Int): IntTrieSet
    Definition Classes
    IntSet
  4. abstract def contains(value: Int): Boolean
    Definition Classes
    IntSet
  5. abstract def equals(other: IntTrieSet): Boolean
  6. abstract def exists(p: (Int) ⇒ Boolean): Boolean
    Definition Classes
    IntSet
  7. abstract def filter(p: (Int) ⇒ Boolean): IntTrieSet
  8. abstract def flatMap(f: (Int) ⇒ IntTrieSet): IntTrieSet
    Definition Classes
    IntSet
  9. abstract def foldLeft[B](z: B)(f: (B, Int) ⇒ B): B
    Definition Classes
    IntSet
  10. abstract def forall(f: (Int) ⇒ Boolean): Boolean
    Definition Classes
    IntSet
  11. abstract def foreach[U](f: (Int) ⇒ U): Unit
    Definition Classes
    IntSet
  12. abstract 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) XOR (4,1)),((1,8) XOR (8,1)) and ((4,8) XOR (8,4)) will be returned; hence, the order between the two values is not defined.

  13. abstract 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
    IntSet
  14. abstract def head: Int
    Definition Classes
    IntSet
  15. abstract def headAndTail: IntRefPair[IntTrieSet]

    Returns some value and removes it from this set.

    Returns some value and removes it from this set.

    Definition Classes
    IntTrieSetIntWorkSet
  16. abstract def isEmpty: Boolean
    Definition Classes
    IntSet
  17. abstract 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
    IntSet
  18. abstract def iterator: IntIterator
    Definition Classes
    IntSet
  19. abstract def map(map: Array[Int]): IntTrieSet

    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
    IntSet
  20. abstract def map(f: (Int) ⇒ Int): IntTrieSet
    Definition Classes
    IntSet
  21. abstract 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
    IntSet
  22. abstract def toChain: Chain[Int]
    Definition Classes
    IntSet
  23. abstract def withFilter(p: (Int) ⇒ Boolean): IntTrieSet
    Definition Classes
    IntTrieSetIntSet

Concrete Value Members

  1. final def !++!(that: IntTrieSet): IntTrieSet

    Merges the values of this and the given set into the set that is larger.

    Merges the values of this and the given set into the set that is larger. If both sets have equal sizes, then the given one is merged into this one.

    See also

    +!(Int) for details!

  2. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  3. final def ##(): Int
    Definition Classes
    AnyRef → Any
  4. final def ++(that: IntIterator): IntTrieSet
    Definition Classes
    IntSet
  5. final def ++(that: TraversableOnce[Int]): IntTrieSet
    Definition Classes
    IntSet
  6. final def ++(that: IntTrieSet): IntTrieSet
    Definition Classes
    IntSet
  7. final def ++!(that: IntTrieSet): IntTrieSet

    See also

    +!(Int) for details!

  8. final def --(is: IntSet[_]): IntTrieSet
    Definition Classes
    IntSet
  9. final def --(is: TraversableOnce[Int]): IntTrieSet
    Definition Classes
    IntSet
  10. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  12. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @IntrinsicCandidate()
  13. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. final def equals(other: Any): Boolean
    Definition Classes
    IntTrieSet → AnyRef → Any
  15. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  16. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  17. def intersect(other: IntTrieSet): IntTrieSet
  18. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  19. def map[A <: AnyRef](f: (Int) ⇒ A): Set[A]
    Definition Classes
    IntSet
  20. final def mkString(in: String): String
    Definition Classes
    IntSet
  21. final def mkString(pre: String, in: String, post: String): String
    Definition Classes
    IntSet
  22. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  23. def nonEmpty: Boolean
    Definition Classes
    IntSet
  24. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  25. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  26. final def subsetOf(other: IntTrieSet): Boolean
  27. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  28. def toArray: Array[Int]
    Definition Classes
    IntSet
  29. final def toString(): String
    Definition Classes
    IntTrieSet → AnyRef → Any
  30. final def transform[B, To](f: (Int) ⇒ B, b: Builder[B, To]): To
    Definition Classes
    IntSet
  31. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  33. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] ) @Deprecated
    Deprecated

Inherited from IntWorkSet[IntTrieSet]

Inherited from IntSet[IntTrieSet]

Inherited from AnyRef

Inherited from Any

Ungrouped