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

final class ConstArray[T <: AnyRef] extends IndexedSeq[T] with IndexedSeqOptimized[T, ConstArray[T]]

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

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

Type Members

  1. class Elements extends AbstractIterator[A] with BufferedIterator[A] with Serializable
    Attributes
    protected
    Definition Classes
    IndexedSeqLike
    Annotations
    @SerialVersionUID()
  2. type Self = ConstArray[T]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  3. 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 ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[ConstArray[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  4. def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[ConstArray[T], B, That]): That
    Definition Classes
    TraversableLike
  5. def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[ConstArray[T], B, That]): That
    Definition Classes
    TraversableLike
  6. def +:[B >: T, That](elem: B)(implicit bf: CanBuildFrom[ConstArray[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  7. def :+[B >: T, That](elem: B)(implicit bf: CanBuildFrom[ConstArray[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  8. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  9. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  10. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  11. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  12. def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  13. def andThen[C](k: (T) ⇒ C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  14. def apply(idx: Int): T
    Definition Classes
    ConstArray → SeqLike → GenSeqLike → Function1
  15. def applyOrElse[A1 <: Int, B1 >: T](x: A1, default: (A1) ⇒ B1): B1
    Definition Classes
    PartialFunction
  16. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  17. def binarySearch(key: Comparable[T]): Int
  18. def canEqual(that: Any): Boolean
    Definition Classes
    ConstArray → IterableLike → Equals
  19. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @IntrinsicCandidate()
  20. def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[ConstArray[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  21. def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
    Definition Classes
    TraversableOnce
  22. def combinations(n: Int): Iterator[ConstArray[T]]
    Definition Classes
    SeqLike
  23. def companion: GenericCompanion[IndexedSeq]
    Definition Classes
    IndexedSeq → Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  24. def compose[A](g: (A) ⇒ Int): (A) ⇒ T
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  25. def contains[A1 >: T](elem: A1): Boolean
    Definition Classes
    SeqLike
  26. def containsSlice[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike
  27. def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  28. def copyToArray[B >: T](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  29. def copyToArray[B >: T](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  30. def copyToBuffer[B >: T](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  31. def corresponds[B](that: GenSeq[B])(p: (T, B) ⇒ Boolean): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  32. def count(p: (T) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def diff[B >: T](that: GenSeq[B]): ConstArray[T]
    Definition Classes
    SeqLike → GenSeqLike
  34. def distinct: ConstArray[T]
    Definition Classes
    SeqLike → GenSeqLike
  35. def drop(n: Int): ConstArray[T]
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  36. def dropRight(n: Int): ConstArray[T]
    Definition Classes
    IndexedSeqOptimized → IterableLike
  37. def dropWhile(p: (T) ⇒ Boolean): ConstArray[T]
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  38. def endsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  39. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  40. def equals(other: Any): Boolean
    Definition Classes
    ConstArray → GenSeqLike → Equals → AnyRef → Any
  41. def exists(p: (T) ⇒ Boolean): Boolean
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  42. def filter(p: (T) ⇒ Boolean): ConstArray[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  43. def filterNot(p: (T) ⇒ Boolean): ConstArray[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  44. def find(p: (T) ⇒ Boolean): Option[T]
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  45. def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[ConstArray[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  46. def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): IndexedSeq[B]
    Definition Classes
    GenericTraversableTemplate
  47. def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  48. def foldLeft[B](z: B)(op: (B, T) ⇒ B): B
    Definition Classes
    IndexedSeqOptimized → TraversableOnce → GenTraversableOnce
  49. def foldRight[B](z: B)(op: (T, B) ⇒ B): B
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
  50. def forall(p: (T) ⇒ Boolean): Boolean
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  51. def foreach[U](f: (T) ⇒ U): Unit
    Definition Classes
    ConstArray → IndexedSeqOptimized → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  52. def genericBuilder[B]: Builder[B, IndexedSeq[B]]
    Definition Classes
    GenericTraversableTemplate
  53. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  54. def groupBy[K](f: (T) ⇒ K): Map[K, ConstArray[T]]
    Definition Classes
    TraversableLike → GenTraversableLike
  55. def grouped(size: Int): Iterator[ConstArray[T]]
    Definition Classes
    IterableLike
  56. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  57. lazy val hashCode: Int
    Definition Classes
    ConstArray → IndexedSeqLike → GenSeqLike → AnyRef → Any
  58. def head: T
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  59. def headOption: Option[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  60. def indexOf[B >: T](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  61. def indexOf[B >: T](elem: B): Int
    Definition Classes
    GenSeqLike
  62. def indexOfSlice[B >: T](that: GenSeq[B], from: Int): Int
    Definition Classes
    SeqLike
  63. def indexOfSlice[B >: T](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  64. def indexWhere(p: (T) ⇒ Boolean, from: Int): Int
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  65. def indexWhere(p: (T) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  66. def indices: Range
    Definition Classes
    SeqLike
  67. def init: ConstArray[T]
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  68. def inits: Iterator[ConstArray[T]]
    Definition Classes
    TraversableLike
  69. def insertAt(insertionPoint: Int, e: T): ConstArray[T]

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

    Creates a new ConstArray 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.

  70. def intersect[B >: T](that: GenSeq[B]): ConstArray[T]
    Definition Classes
    SeqLike → GenSeqLike
  71. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    GenSeqLike
  72. def isEmpty: Boolean
    Definition Classes
    IndexedSeqOptimized → SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  73. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  74. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  75. def iterator: RefIterator[T]
    Definition Classes
    ConstArray → IndexedSeqLike → IterableLike → GenIterableLike
  76. def last: T
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  77. def lastIndexOf[B >: T](elem: B, end: Int): Int
    Definition Classes
    GenSeqLike
  78. def lastIndexOf[B >: T](elem: B): Int
    Definition Classes
    GenSeqLike
  79. def lastIndexOfSlice[B >: T](that: GenSeq[B], end: Int): Int
    Definition Classes
    SeqLike
  80. def lastIndexOfSlice[B >: T](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  81. def lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  82. def lastIndexWhere(p: (T) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  83. def lastOption: Option[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  84. def length: Int
    Definition Classes
    ConstArray → SeqLike → GenSeqLike
  85. def lengthCompare(len: Int): Int
    Definition Classes
    IndexedSeqOptimized → SeqLike
  86. def lift: (Int) ⇒ Option[T]
    Definition Classes
    PartialFunction
  87. def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[ConstArray[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  88. def max[B >: T](implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def min[B >: T](implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  96. def newBuilder: Builder[T, ConstArray[T]]
    Definition Classes
    ConstArray → GenericTraversableTemplate → TraversableLike → HasNewBuilder
  97. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  99. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  100. def orElse[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  101. def padTo[B >: T, That](len: Int, elem: B)(implicit bf: CanBuildFrom[ConstArray[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  102. def par: ParSeq[T]
    Definition Classes
    Parallelizable
  103. def parCombiner: Combiner[T, ParSeq[T]]
    Attributes
    protected[this]
    Definition Classes
    SeqLike → TraversableLike → Parallelizable
  104. def partition(p: (T) ⇒ Boolean): (ConstArray[T], ConstArray[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  105. def patch[B >: T, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[ConstArray[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  106. def permutations: Iterator[ConstArray[T]]
    Definition Classes
    SeqLike
  107. def prefixLength(p: (T) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  108. def product[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. def reduceLeft[B >: T](op: (B, T) ⇒ B): B
    Definition Classes
    IndexedSeqOptimized → TraversableOnce
  111. def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def reduceRight[B >: T](op: (T, B) ⇒ B): B
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
  114. def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def replaced(index: Int, e: T): ConstArray[T]

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

  116. def repr: ConstArray[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  117. def reverse: ConstArray[T]
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  118. def reverseIterator: Iterator[T]
    Definition Classes
    IndexedSeqOptimized → SeqLike
  119. def reverseMap[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[ConstArray[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  120. def reversed: List[T]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  121. def runWith[U](action: (T) ⇒ U): (Int) ⇒ Boolean
    Definition Classes
    PartialFunction
  122. def sameElements[B >: T](that: GenIterable[B]): Boolean
    Definition Classes
    IndexedSeqOptimized → IterableLike → GenIterableLike
  123. def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[ConstArray[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  124. def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[ConstArray[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  125. def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[ConstArray[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.

  126. def segmentLength(p: (T) ⇒ Boolean, from: Int): Int
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  127. def seq: IndexedSeq[T]
    Definition Classes
    IndexedSeq → IndexedSeqLike → Seq → GenSeq → GenSeqLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  128. def size: Int
    Definition Classes
    ConstArray → SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  129. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    IndexedSeqLike → GenTraversableOnce
  130. def slice(from: Int, until: Int): ConstArray[T]
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  131. def sliding(size: Int, step: Int): Iterator[ConstArray[T]]
    Definition Classes
    IterableLike
  132. def sliding(size: Int): Iterator[ConstArray[T]]
    Definition Classes
    IterableLike
  133. def sortBy[B](f: (T) ⇒ B)(implicit ord: Ordering[B]): ConstArray[T]
    Definition Classes
    SeqLike
  134. def sortWith(lt: (T, T) ⇒ Boolean): ConstArray[T]
    Definition Classes
    SeqLike
  135. def sorted[B >: T](implicit ord: Ordering[B]): ConstArray[T]
    Definition Classes
    SeqLike
  136. def span(p: (T) ⇒ Boolean): (ConstArray[T], ConstArray[T])
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  137. def splitAt(n: Int): (ConstArray[T], ConstArray[T])
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  138. def startsWith[B](that: GenSeq[B], offset: Int): Boolean
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  139. def startsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    GenSeqLike
  140. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  141. def sum[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  142. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  143. def tail: ConstArray[T]
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  144. def tails: Iterator[ConstArray[T]]
    Definition Classes
    TraversableLike
  145. def take(n: Int): ConstArray[T]
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  146. def takeRight(n: Int): ConstArray[T]
    Definition Classes
    IndexedSeqOptimized → IterableLike
  147. def takeWhile(p: (T) ⇒ Boolean): ConstArray[T]
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  148. def thisCollection: IndexedSeq[T]
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  149. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  150. def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  151. def toBuffer[A1 >: T]: Buffer[A1]
    Definition Classes
    IndexedSeqLike → TraversableOnce → GenTraversableOnce
  152. def toCollection(repr: ConstArray[T]): IndexedSeq[T]
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  153. def toIndexedSeq: IndexedSeq[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  154. def toIterable: Iterable[T]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  155. def toIterator: Iterator[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  156. def toList: List[T]
    Definition Classes
    IndexedSeqOptimized → TraversableOnce → GenTraversableOnce
  157. def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  158. def toSeq: Seq[T]
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  159. def toSet[B >: T]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  160. def toStream: Stream[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  161. def toString(): String
    Definition Classes
    ConstArray → SeqLike → TraversableLike → Function1 → AnyRef → Any
  162. def toTraversable: Traversable[T]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  163. def toVector: Vector[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  164. def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  165. def union[B >: T, That](that: GenSeq[B])(implicit bf: CanBuildFrom[ConstArray[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  166. def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
    Definition Classes
    GenericTraversableTemplate
  167. def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
    Definition Classes
    GenericTraversableTemplate
  168. def updated[B >: T, That](index: Int, elem: B)(implicit bf: CanBuildFrom[ConstArray[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  169. def view(from: Int, until: Int): SeqView[T, ConstArray[T]]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  170. def view: SeqView[T, ConstArray[T]]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  171. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  172. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  173. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  174. def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, ConstArray[T]]
    Definition Classes
    TraversableLike → FilterMonadic
  175. def zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[ConstArray[T], (A1, B), That]): That
    Definition Classes
    IndexedSeqOptimized → IterableLike → GenIterableLike
  176. def zipAll[B, A1 >: T, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[ConstArray[T], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  177. def zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[ConstArray[T], (A1, Int), That]): That
    Definition Classes
    IndexedSeqOptimized → 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 IndexedSeqOptimized[T, ConstArray[T]]

Inherited from IndexedSeq[T]

Inherited from IndexedSeqLike[T, ConstArray[T]]

Inherited from Seq[T]

Inherited from SeqLike[T, ConstArray[T]]

Inherited from GenSeq[T]

Inherited from GenSeqLike[T, ConstArray[T]]

Inherited from Iterable[T]

Inherited from IterableLike[T, ConstArray[T]]

Inherited from Equals

Inherited from GenIterable[T]

Inherited from GenIterableLike[T, ConstArray[T]]

Inherited from Traversable[T]

Inherited from GenTraversable[T]

Inherited from GenericTraversableTemplate[T, IndexedSeq]

Inherited from TraversableLike[T, ConstArray[T]]

Inherited from GenTraversableLike[T, ConstArray[T]]

Inherited from Parallelizable[T, ParSeq[T]]

Inherited from TraversableOnce[T]

Inherited from GenTraversableOnce[T]

Inherited from FilterMonadic[T, ConstArray[T]]

Inherited from HasNewBuilder[T, ConstArray[T]]

Inherited from PartialFunction[Int, T]

Inherited from (Int) ⇒ T

Inherited from AnyRef

Inherited from Any

Ungrouped