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
  • package mutable
    Definition Classes
    collection
  • BitSet
  • CompleteCollection
  • EqualSets
  • IncompleteCollection
  • IntCollectionWithStableOrdering
  • IntIterator
  • IntSet
  • LongCollectionWithStableOrdering
  • LongIterator
  • LongSet
  • QualifiedCollection
  • RefIndexedView
  • RefIterator
  • SetRelation
  • SingletonSet
  • StrictSubset
  • StrictSuperset
  • UID
  • UIDValue
  • UncomparableSets

abstract class LongIterator extends AbstractIterator[Long]

Iterator over a collection of longs; basically all methods are overridden to avoid (un)boxing operations.

Self Type
LongIterator
Linear Supertypes
AbstractIterator[Long], Iterator[Long], TraversableOnce[Long], GenTraversableOnce[Long], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LongIterator
  2. AbstractIterator
  3. Iterator
  4. TraversableOnce
  5. GenTraversableOnce
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new LongIterator()

Type Members

  1. class GroupedIterator[B >: A] extends AbstractIterator[Seq[B]] with Iterator[Seq[B]]
    Definition Classes
    Iterator

Abstract Value Members

  1. abstract def hasNext: Boolean
    Definition Classes
    LongIterator → Iterator
  2. abstract def next(): Long

    Returns the next value if hasNext has returned true; if hasNext has returned false and next is called, the result is undefined.

    Returns the next value if hasNext has returned true; if hasNext has returned false and next is called, the result is undefined. The method may throw an UnsupportedOperationException or just return the last value; however, the behavior is undefined and subject to change without notice!

    Definition Classes
    LongIterator → Iterator

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def ++[B >: Long](that: ⇒ GenTraversableOnce[B]): Iterator[B]
    Definition Classes
    Iterator
  4. def /:[B](z: B)(op: (B, Long) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  5. def :\[B](z: B)(op: (Long, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  6. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  7. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  8. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  9. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  10. def aggregate[B](z: ⇒ B)(seqop: (B, Long) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  11. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  12. def buffered: BufferedIterator[Long]
    Definition Classes
    Iterator
  13. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  14. def collect[B](pf: PartialFunction[Long, B]): Iterator[B]
    Definition Classes
    Iterator
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) collect has changed. The previous behavior can be reproduced with toSeq.

  15. def collectFirst[B](pf: PartialFunction[Long, B]): Option[B]
    Definition Classes
    TraversableOnce
  16. def contains(i: Long): Boolean
  17. def contains(elem: Any): Boolean
    Definition Classes
    Iterator
  18. def copyToArray[B >: Long](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  19. def copyToArray[B >: Long](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  20. def copyToArray[B >: Long](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  21. def copyToBuffer[B >: Long](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  22. def corresponds[B](that: GenTraversableOnce[B])(p: (Long, B) ⇒ Boolean): Boolean
    Definition Classes
    Iterator
  23. def count(p: (Long) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  24. def drop(n: Int): Iterator[Long]
    Definition Classes
    Iterator
  25. def dropWhile(p: (Long) ⇒ Boolean): Iterator[Long]
    Definition Classes
    Iterator
  26. def duplicate: (Iterator[Long], Iterator[Long])
    Definition Classes
    Iterator
  27. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  28. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  29. def exists(p: (Long) ⇒ Boolean): Boolean
    Definition Classes
    LongIterator → Iterator → TraversableOnce → GenTraversableOnce
  30. def filter(p: (Long) ⇒ Boolean): LongIterator
    Definition Classes
    LongIterator → Iterator
  31. def filterNot(p: (Long) ⇒ Boolean): Iterator[Long]
    Definition Classes
    Iterator
  32. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  33. def find(p: (Long) ⇒ Boolean): Option[Long]
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  34. def flatMap(f: (Long) ⇒ LongIterator): LongIterator
  35. def flatMap[B](f: (Long) ⇒ GenTraversableOnce[B]): Iterator[B]
    Definition Classes
    Iterator
  36. def fold[A1 >: Long](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  37. def foldLeft[B](start: B)(f: (B, Long) ⇒ B): B
    Definition Classes
    LongIterator → TraversableOnce → GenTraversableOnce
  38. def foldRight[B](z: B)(op: (Long, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  39. def forall(p: (Long) ⇒ Boolean): Boolean
    Definition Classes
    LongIterator → Iterator → TraversableOnce → GenTraversableOnce
  40. def foreach[U](f: (Long) ⇒ U): Unit
    Definition Classes
    LongIterator → Iterator → TraversableOnce → GenTraversableOnce
  41. def foreachWhile(p: LongPredicate)(f: LongConsumer): Unit
  42. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  43. def grouped[B >: Long](size: Int): GroupedIterator[B]
    Definition Classes
    Iterator
  44. def hasDefiniteSize: Boolean
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  45. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  46. def indexOf[B >: Long](elem: B, from: Int): Int
    Definition Classes
    Iterator
  47. def indexOf[B >: Long](elem: B): Int
    Definition Classes
    Iterator
  48. def indexWhere(p: (Long) ⇒ Boolean, from: Int): Int
    Definition Classes
    Iterator
  49. def indexWhere(p: (Long) ⇒ Boolean): Int
    Definition Classes
    Iterator
  50. def isEmpty: Boolean
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  51. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  52. def isTraversableAgain: Boolean
    Definition Classes
    Iterator → GenTraversableOnce
  53. def length: Int
    Definition Classes
    Iterator
  54. def map[X](m: (Long) ⇒ X): RefIterator[X]
    Definition Classes
    LongIterator → Iterator
  55. def map(f: (Long) ⇒ Int): IntIterator
  56. def map(f: (Long) ⇒ Long): LongIterator
  57. def max[B >: Long](implicit cmp: Ordering[B]): Long
    Definition Classes
    TraversableOnce → GenTraversableOnce
  58. def maxBy[B](f: (Long) ⇒ B)(implicit cmp: Ordering[B]): Long
    Definition Classes
    TraversableOnce → GenTraversableOnce
  59. def min[B >: Long](implicit cmp: Ordering[B]): Long
    Definition Classes
    TraversableOnce → GenTraversableOnce
  60. def minBy[B](f: (Long) ⇒ B)(implicit cmp: Ordering[B]): Long
    Definition Classes
    TraversableOnce → GenTraversableOnce
  61. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  62. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  63. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  64. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  65. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  66. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  67. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  68. def padTo[A1 >: Long](len: Int, elem: A1): Iterator[A1]
    Definition Classes
    Iterator
  69. def partition(p: (Long) ⇒ Boolean): (Iterator[Long], Iterator[Long])
    Definition Classes
    Iterator
  70. def patch[B >: Long](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]
    Definition Classes
    Iterator
  71. def product[B >: Long](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  72. def reduce[A1 >: Long](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  73. def reduceLeft[B >: Long](op: (B, Long) ⇒ B): B
    Definition Classes
    TraversableOnce
  74. def reduceLeftOption[B >: Long](op: (B, Long) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  75. def reduceOption[A1 >: Long](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  76. def reduceRight[B >: Long](op: (Long, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  77. def reduceRightOption[B >: Long](op: (Long, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  78. def reversed: List[Long]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  79. def sameElements(that: Iterator[_]): Boolean
    Definition Classes
    Iterator
  80. def sameValues(that: LongIterator): Boolean

    Compares the returned values to check if the iteration order is the same.

    Compares the returned values to check if the iteration order is the same.

    Both iterators may be consumed up to an arbitrary point.

  81. def scanLeft[B](z: B)(op: (B, Long) ⇒ B): Iterator[B]
    Definition Classes
    Iterator
  82. def scanRight[B](z: B)(op: (Long, B) ⇒ B): Iterator[B]
    Definition Classes
    Iterator
  83. def seq: Iterator[Long]
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  84. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  85. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  86. def slice(from: Int, until: Int): Iterator[Long]
    Definition Classes
    Iterator
  87. def sliceIterator(from: Int, until: Int): Iterator[Long]
    Attributes
    protected
    Definition Classes
    Iterator
  88. def sliding[B >: Long](size: Int, step: Int): GroupedIterator[B]
    Definition Classes
    Iterator
  89. def span(p: (Long) ⇒ Boolean): (Iterator[Long], Iterator[Long])
    Definition Classes
    Iterator
  90. def sum[B >: Long](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  92. def take(n: Int): Iterator[Long]
    Definition Classes
    Iterator
  93. def takeWhile(p: (Long) ⇒ Boolean): Iterator[Long]
    Definition Classes
    Iterator
  94. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Long, Col[Long]]): Col[Long]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def toArray: Array[Long]
  96. def toArray[B >: Long](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def toBuffer[B >: Long]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def toIndexedSeq: IndexedSeq[Long]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. def toIterable: Iterable[Long]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def toIterator: Iterator[Long]
    Definition Classes
    Iterator → GenTraversableOnce
  101. def toList: List[Long]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def toMap[T, U](implicit ev: <:<[Long, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def toSeq: Seq[Long]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def toSet: LongTrieSet
  105. def toSet[B >: Long]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. def toStream: Stream[Long]
    Definition Classes
    Iterator → GenTraversableOnce
  107. def toString(): String
    Definition Classes
    Iterator → AnyRef → Any
  108. def toTraversable: Traversable[Long]
    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce
  109. def toVector: Vector[Long]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  111. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  112. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  113. def withFilter(p: (Long) ⇒ Boolean): LongIterator
    Definition Classes
    LongIterator → Iterator
  114. def zip[B](that: Iterator[B]): Iterator[(Long, B)]
    Definition Classes
    Iterator
  115. def zipAll[B, A1 >: Long, B1 >: B](that: Iterator[B], thisElem: A1, thatElem: B1): Iterator[(A1, B1)]
    Definition Classes
    Iterator
  116. def zipWithIndex: Iterator[(Long, Int)]
    Definition Classes
    Iterator

Inherited from AbstractIterator[Long]

Inherited from Iterator[Long]

Inherited from TraversableOnce[Long]

Inherited from GenTraversableOnce[Long]

Inherited from AnyRef

Inherited from Any

Ungrouped