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

class RefArray[+T] extends Seq[T]

Wraps an array such that the underlying array is no longer directly accessible and therefore also no longer mutable if RefArray is the sole owner.

Self Type
RefArray[T]
Source
RefArray.scala
Note

Compared to ConstArray, RefArray does not provide an efficient toArray method. However, RefArrays are covariant.

Linear Supertypes
Seq[T], Seq[T], SeqLike[T, Seq[T]], GenSeq[T], GenSeqLike[T, Seq[T]], PartialFunction[Int, T], (Int) ⇒ T, Iterable[T], Iterable[T], IterableLike[T, Seq[T]], Equals, GenIterable[T], GenIterableLike[T, Seq[T]], Traversable[T], Immutable, Traversable[T], GenTraversable[T], GenericTraversableTemplate[T, Seq], TraversableLike[T, Seq[T]], GenTraversableLike[T, Seq[T]], Parallelizable[T, ParSeq[T]], TraversableOnce[T], GenTraversableOnce[T], FilterMonadic[T, Seq[T]], HasNewBuilder[T, scala.collection.immutable.Seq[T] @scala.annotation.unchecked.uncheckedVariance], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RefArray
  2. Seq
  3. Seq
  4. SeqLike
  5. GenSeq
  6. GenSeqLike
  7. PartialFunction
  8. Function1
  9. Iterable
  10. Iterable
  11. IterableLike
  12. Equals
  13. GenIterable
  14. GenIterableLike
  15. Traversable
  16. Immutable
  17. Traversable
  18. GenTraversable
  19. GenericTraversableTemplate
  20. TraversableLike
  21. GenTraversableLike
  22. Parallelizable
  23. TraversableOnce
  24. GenTraversableOnce
  25. FilterMonadic
  26. HasNewBuilder
  27. AnyRef
  28. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type Self = Seq[T]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def ++[X >: T <: AnyRef](that: Seq[X]): RefArray[X]
  4. def ++[X >: T <: AnyRef](that: RefArray[X]): RefArray[X]
  5. def ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Seq[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  6. def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[Seq[T], B, That]): That
    Definition Classes
    TraversableLike
  7. def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Seq[T], B, That]): That
    Definition Classes
    TraversableLike
  8. def +:[X >: T <: AnyRef](e: X): RefArray[X]
  9. def +:[B >: T, That](elem: B)(implicit bf: CanBuildFrom[Seq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  10. def :+[X >: T <: AnyRef](elem: X): RefArray[X]

    Appends the given element.

  11. def :+[B >: T, That](elem: B)(implicit bf: CanBuildFrom[Seq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  12. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  13. def _UNSAFE_added[X >: T <: AnyRef](elem: X): RefArray[X]

    Appends the given element to the underlying array; will cause havoc if this object is not under full control of the caller.

  14. def _UNSAFE_addedAll[X >: T <: AnyRef](that: RefArray[X]): RefArray[X]
  15. def _UNSAFE_mapped[X <: AnyRef](f: (T) ⇒ X): RefArray[X]

    Directly performs the map operation on the underlying array and then creates a new appropriately typed RefArray[X] object which wraps the modified array.

    Directly performs the map operation on the underlying array and then creates a new appropriately typed RefArray[X] object which wraps the modified array. Hence, the return value can be ignored, if X == T.

    This method is only to be used if no aliases have been created that assume that this array is not mutated.

  16. def _UNSAFE_replaced[X >: T <: AnyRef](index: Int, e: X): RefArray[X]

    Directly updates the value at the given index and then creates a new appropriately typed RefArray[X] object which wraps the modified array.

    Directly updates the value at the given index and then creates a new appropriately typed RefArray[X] object which wraps the modified array. The returned type can be ignored if the type X == T.

    This method is only to be used if this instance is no longer used afterwards!

  17. def _UNSAFE_sorted[X >: T](implicit ev: <:<[T, Comparable[X]]): RefArray.this.type

    Returns a new RefArray where the values are sorted based on their natural ordering.

    Returns a new RefArray where the values are sorted based on their natural ordering.

    Example:
    1. RefArray("c","a").sorted[String]
  18. def _UNSAFE_sortedWith(compare: (T, T) ⇒ Boolean): RefArray.this.type

    Directly performs the sort operation on the underlying array.

    Directly performs the sort operation on the underlying array.

    This method is only to be used if this instance is no longer used afterwards!

  19. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  20. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  21. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  22. def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  23. def andThen[C](k: (T) ⇒ C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  24. def apply(idx: Int): T
    Definition Classes
    RefArray → SeqLike → GenSeqLike → Function1
  25. def applyOrElse[A1 <: Int, B1 >: T](x: A1, default: (A1) ⇒ B1): B1
    Definition Classes
    PartialFunction
  26. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  27. def binarySearch[X >: T <: Comparable[X]](key: X): Int
  28. def binarySearch(comparator: (T) ⇒ Int): Option[T]
  29. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  30. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @IntrinsicCandidate()
  31. def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[Seq[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  32. def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
    Definition Classes
    TraversableOnce
  33. def combinations(n: Int): Iterator[Seq[T]]
    Definition Classes
    SeqLike
  34. def companion: GenericCompanion[Seq]
    Definition Classes
    Seq → Seq → GenSeq → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  35. def compose[A](g: (A) ⇒ Int): (A) ⇒ T
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  36. def contains[X >: T](v: X): Boolean

    Checks if the given element is stored in the array.

    Checks if the given element is stored in the array. Performs a linear sweep of the array (complexity O(N)). If the array happens to be sorted, consider using binarySearch.

    Definition Classes
    RefArray → SeqLike
  37. def containsSlice[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike
  38. def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  39. def copyToArray[B >: T](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  40. def copyToArray[B >: T](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  41. def copyToBuffer[B >: T](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  42. def corresponds[B](that: GenSeq[B])(p: (T, B) ⇒ Boolean): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  43. def count(p: (T) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  44. def diff[B >: T](that: GenSeq[B]): Seq[T]
    Definition Classes
    SeqLike → GenSeqLike
  45. def distinct: Seq[T]
    Definition Classes
    SeqLike → GenSeqLike
  46. def drop(n: Int): Seq[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  47. def dropRight(n: Int): RefArray[T]
    Definition Classes
    RefArray → IterableLike
  48. def dropWhile(p: (T) ⇒ Boolean): Seq[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  49. def endsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  50. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  51. def equals(other: Any): Boolean
    Definition Classes
    RefArray → GenSeqLike → Equals → AnyRef → Any
  52. def exists(p: (T) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  53. def filter(f: (T) ⇒ Boolean): RefArray[T]
    Definition Classes
    RefArray → TraversableLike → GenTraversableLike
  54. def filterNonNull: RefArray[T]
  55. def filterNot(f: (T) ⇒ Boolean): RefArray[T]
    Definition Classes
    RefArray → TraversableLike → GenTraversableLike
  56. def find(p: (T) ⇒ Boolean): Option[T]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  57. def flatMap[X <: AnyRef](f: (T) ⇒ TraversableOnce[X]): RefArray[X]
  58. def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Seq[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  59. def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Seq[B]
    Definition Classes
    GenericTraversableTemplate
  60. def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  61. def foldLeft[X](z: X)(op: (X, T) ⇒ X): X
    Definition Classes
    RefArray → TraversableOnce → GenTraversableOnce
  62. def foldLeft(z: Int)(op: (Int, T) ⇒ Int): Int
  63. def foldRight[B](z: B)(op: (T, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  64. def forall(p: (T) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  65. def forallEquals(v: AnyRef): Boolean
  66. def foreach[U](f: (T) ⇒ U): Unit
    Definition Classes
    RefArray → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  67. def foreachIterator: ForeachRefIterator[T]
  68. def foreachWithIndex[U](f: (T, Int) ⇒ U): Unit
  69. def genericBuilder[B]: Builder[B, Seq[B]]
    Definition Classes
    GenericTraversableTemplate
  70. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  71. def groupBy[K](f: (T) ⇒ K): Map[K, Seq[T]]
    Definition Classes
    TraversableLike → GenTraversableLike
  72. def grouped(size: Int): Iterator[Seq[T]]
    Definition Classes
    IterableLike
  73. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  74. lazy val hashCode: Int
    Definition Classes
    RefArray → GenSeqLike → AnyRef → Any
  75. def head: T
    Definition Classes
    RefArray → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike
  76. def headOption: Option[T]
    Definition Classes
    RefArray → TraversableLike → GenTraversableLike
  77. def indexOf[B >: T](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  78. def indexOf[B >: T](elem: B): Int
    Definition Classes
    GenSeqLike
  79. def indexOfSlice[B >: T](that: GenSeq[B], from: Int): Int
    Definition Classes
    SeqLike
  80. def indexOfSlice[B >: T](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  81. def indexWhere(p: (T) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  82. def indexWhere(p: (T) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  83. def indices: Range
    Definition Classes
    SeqLike
  84. def init: Seq[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  85. def inits: Iterator[Seq[T]]
    Definition Classes
    TraversableLike
  86. def insertedAt[X >: T <: AnyRef](insertionPoint: Int, e: X): RefArray[X]

    Creates a new RefArray where the given value is inserted at the specified insertionPoint.

    Creates a new RefArray where the given value is inserted at the specified insertionPoint. If the underlying array happens to be sorted, then the insertion point can easily be computed using binarySearch; it will be -index -1 if the returned index is less than zero; otherwise the value was already found in the array.

  87. def intersect[B >: T](that: GenSeq[B]): Seq[T]
    Definition Classes
    SeqLike → GenSeqLike
  88. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    GenSeqLike
  89. def isEmpty: Boolean
    Definition Classes
    RefArray → SeqLike → IterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce → GenTraversableOnce
  90. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  91. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  92. def iterator: RefIterator[T]
    Definition Classes
    RefArray → IterableLike → GenIterableLike
  93. def last: T
    Definition Classes
    TraversableLike → GenTraversableLike
  94. def lastIndexOf[B >: T](elem: B, end: Int): Int
    Definition Classes
    GenSeqLike
  95. def lastIndexOf[B >: T](elem: B): Int
    Definition Classes
    GenSeqLike
  96. def lastIndexOfSlice[B >: T](that: GenSeq[B], end: Int): Int
    Definition Classes
    SeqLike
  97. def lastIndexOfSlice[B >: T](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  98. def lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  99. def lastIndexWhere(p: (T) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  100. def lastOption: Option[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  101. def length: Int
    Definition Classes
    RefArray → SeqLike → GenSeqLike
  102. def lengthCompare(len: Int): Int
    Definition Classes
    SeqLike
  103. def lift: (Int) ⇒ Option[T]
    Definition Classes
    PartialFunction
  104. def map(f: (T) ⇒ Int): IntArray
  105. def map[X <: AnyRef](f: (T) ⇒ X): RefArray[X]
  106. def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[Seq[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  107. def max[B >: T](implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  108. def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. def min[B >: T](implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  115. def newBuilder: Builder[T, Seq[T]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  116. def nonEmpty: Boolean
    Definition Classes
    RefArray → TraversableOnce → GenTraversableOnce
  117. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  118. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  119. def orElse[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  120. def padTo[B >: T, That](len: Int, elem: B)(implicit bf: CanBuildFrom[Seq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  121. def par: ParSeq[T]
    Definition Classes
    Parallelizable
  122. def parCombiner: Combiner[T, ParSeq[T]]
    Attributes
    protected[this]
    Definition Classes
    Seq → SeqLike → Iterable → TraversableLike → Parallelizable
  123. def partition(p: (T) ⇒ Boolean): (RefArray[T], RefArray[T])
    Definition Classes
    RefArray → TraversableLike → GenTraversableLike
  124. def partitionByType[X <: AnyRef](clazz: Class[X]): (RefArray[X], RefArray[T])
  125. def patch[B >: T, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[Seq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  126. def permutations: Iterator[Seq[T]]
    Definition Classes
    SeqLike
  127. def prefixLength(p: (T) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  128. def product[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  129. def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. def reduceLeft[B >: T](op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce
  131. def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  132. def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  133. def reduceRight[B >: T](op: (T, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  134. def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def repr: Seq[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  136. def reverse: Seq[T]
    Definition Classes
    SeqLike → GenSeqLike
  137. def reverseIterator: Iterator[T]
    Definition Classes
    SeqLike
  138. def reverseMap[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[Seq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  139. def reversed: List[T]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  140. def runWith[U](action: (T) ⇒ U): (Int) ⇒ Boolean
    Definition Classes
    PartialFunction
  141. def sameElements[B >: T](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  142. def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Seq[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  143. def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[Seq[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  144. def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[Seq[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  145. def segmentLength(p: (T) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  146. def seq: Seq[T]
    Definition Classes
    Seq → Seq → GenSeq → GenSeqLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  147. def size: Int
    Definition Classes
    RefArray → SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  148. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  149. def slice(from: Int, until: Int): RefArray[T]

    Computes a slice.

    Computes a slice.

    from

    The index of the first element (inclusive)

    until

    The index of the last element (exclusive); if the last element is beyond the size of the underlying data-structure, null values will be added.

    returns

    The sliced array.

    Definition Classes
    RefArray → IterableLike → TraversableLike → GenTraversableLike
  150. def slicedView(from: Int, until: Int = data.length): RefIndexedView[T]

    Creates a view which represents the slice with the elements with the indexes [from,until).

    Creates a view which represents the slice with the elements with the indexes [from,until).

    from

    The first value (inclusive!)

    until

    The last value (exclusive!)

  151. def sliding(size: Int, step: Int): Iterator[Seq[T]]
    Definition Classes
    IterableLike
  152. def sliding(size: Int): Iterator[Seq[T]]
    Definition Classes
    IterableLike
  153. def sortBy[B](f: (T) ⇒ B)(implicit ord: Ordering[B]): Seq[T]
    Definition Classes
    SeqLike
  154. def sortWith[X >: T](compare: (X, X) ⇒ Boolean): RefArray[T]
  155. def sortWith(lt: (T, T) ⇒ Boolean): Seq[T]
    Definition Classes
    SeqLike
  156. final def sorted[X >: T](implicit ev: <:<[T, Comparable[X]]): RefArray[T]

    Returns a new RefArray where the values are sorted based on their natural ordering.

    Returns a new RefArray where the values are sorted based on their natural ordering.

    Annotations
    @inline()
    Example:
    1. RefArray("c","a").sorted[String]
  157. def sorted[B >: T](implicit ord: Ordering[B]): Seq[T]
    Definition Classes
    SeqLike
  158. def span(p: (T) ⇒ Boolean): (Seq[T], Seq[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  159. def splitAt(n: Int): (Seq[T], Seq[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  160. def startsWith[B](that: GenSeq[B], offset: Int): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  161. def startsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    GenSeqLike
  162. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  163. def sum(f: (T) ⇒ Int): Int
  164. def sum[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  165. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  166. def tail: RefArray[T]
    Definition Classes
    RefArray → TraversableLike → GenTraversableLike
  167. def tails: Iterator[Seq[T]]
    Definition Classes
    TraversableLike
  168. def take(n: Int): Seq[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  169. def takeRight(n: Int): Seq[T]
    Definition Classes
    IterableLike
  170. def takeWhile(p: (T) ⇒ Boolean): Seq[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  171. def thisCollection: Seq[T]
    Attributes
    protected[this]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  172. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  173. def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  174. def toBuffer[B >: T]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  175. def toCollection(repr: Seq[T]): Seq[T]
    Attributes
    protected[this]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  176. def toIndexedSeq: IndexedSeq[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  177. def toIterable: Iterable[T]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  178. def toIterator: Iterator[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  179. def toList: List[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  180. def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  181. def toSeq: Seq[T]
    Definition Classes
    Seq → SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  182. def toSet[B >: T]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  183. def toStream: Stream[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  184. def toString(): String
    Definition Classes
    RefArray → SeqLike → Function1 → TraversableLike → AnyRef → Any
  185. def toTraversable: Traversable[T]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  186. def toVector: Vector[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  187. def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): Seq[Seq[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  188. def union[B >: T, That](that: GenSeq[B])(implicit bf: CanBuildFrom[Seq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  189. def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (Seq[A1], Seq[A2])
    Definition Classes
    GenericTraversableTemplate
  190. def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (Seq[A1], Seq[A2], Seq[A3])
    Definition Classes
    GenericTraversableTemplate
  191. def updated[X >: T](index: Int, e: X): RefArray[X]

    Creates a new RefArray where the value at the given index is replaced by the given value.

  192. def updated[B >: T, That](index: Int, elem: B)(implicit bf: CanBuildFrom[Seq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  193. def view(from: Int, until: Int): SeqView[T, Seq[T]]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  194. def view: SeqView[T, Seq[T]]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  195. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  196. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  197. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  198. def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, Seq[T]]
    Definition Classes
    TraversableLike → FilterMonadic
  199. def zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Seq[T], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  200. def zipAll[B, A1 >: T, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Seq[T], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  201. def zipWithIndex: RefArray[(T, Int)]
  202. def zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[Seq[T], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike

Deprecated Value Members

  1. def /:[B](z: B)(op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldLeft instead of /:

  2. def :\[B](z: B)(op: (T, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldRight instead of :\

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

Inherited from Seq[T]

Inherited from Seq[T]

Inherited from SeqLike[T, Seq[T]]

Inherited from GenSeq[T]

Inherited from GenSeqLike[T, Seq[T]]

Inherited from PartialFunction[Int, T]

Inherited from (Int) ⇒ T

Inherited from Iterable[T]

Inherited from Iterable[T]

Inherited from IterableLike[T, Seq[T]]

Inherited from Equals

Inherited from GenIterable[T]

Inherited from GenIterableLike[T, Seq[T]]

Inherited from Traversable[T]

Inherited from Immutable

Inherited from Traversable[T]

Inherited from GenTraversable[T]

Inherited from GenericTraversableTemplate[T, Seq]

Inherited from TraversableLike[T, Seq[T]]

Inherited from GenTraversableLike[T, Seq[T]]

Inherited from Parallelizable[T, ParSeq[T]]

Inherited from TraversableOnce[T]

Inherited from GenTraversableOnce[T]

Inherited from FilterMonadic[T, Seq[T]]

Inherited from HasNewBuilder[T, scala.collection.immutable.Seq[T] @scala.annotation.unchecked.uncheckedVariance]

Inherited from AnyRef

Inherited from Any

Ungrouped