Packages

class ReArray[A] extends AbstractSeq[A] with IndexedSeq[A] with Serializable

The ReArray class provides an implementation of mutable, resizable/dynamic arrays. It is based on Scala's ResizableArray trait with additions and modifications. Preliminary testing has shown it to be faster than its competition: ArrayList and ArrayBuffer. ------------------------------------------------------------------------------------------- Added methods: 'shiftLeft', 'shiftLeft2', 'shiftRight', 'shiftRight2' and 'expand'. ------------------------------------------------------------------------------------------- Modified methods: 'reduceToSize': modified for performance reasons; instead of decreasing the size0 by 1 in a while loop and setting elements to null, it just decrements the size0 variable. FIX: possible minor memory leak 'companion': modified to return null as it is not required by our implementation; the ReArray object does not extend SeqFactory and thus 'newBuilder [A]' is absent. 'update': modified to catch the IndexOutOfBoundsException' and automatically expand the array. 'constructor': modified to take in the initial length and a normal Array; by doing this we can easily convert an object of type Array to a ReArray as the internal 'array' is changed from AnyRef to type A'. ------------------------------------------------------------------------------------------- Modified variables: 'array': the type is changed to A from AnyRef; this helps in assigning an Array [A] to a ReArray [A]; the initial value is changed to check if '_array' is null. 'size0': the initial value is changed to take care if '_array' is null. -------------------------------------------------------------------------------------------

Linear Supertypes
Serializable, IndexedSeq[A], IndexedSeqOps[A, IndexedSeq, IndexedSeq[A]], IndexedSeq[A], IndexedSeqOps[A, [_]IndexedSeq[_], IndexedSeq[A]], AbstractSeq[A], Seq[A], SeqOps[A, [_]IndexedSeq[_], IndexedSeq[A]], Cloneable[IndexedSeq[A]], Cloneable, Iterable[A], AbstractSeq[A], Seq[A], Equals, SeqOps[A, [_]IndexedSeq[_], IndexedSeq[A]], PartialFunction[Int, A], (Int) => A, AbstractIterable[A], Iterable[A], IterableFactoryDefaults[A, [x]IndexedSeq[x]], IterableOps[A, [_]IndexedSeq[_], IndexedSeq[A]], IterableOnceOps[A, [_]IndexedSeq[_], IndexedSeq[A]], IterableOnce[A], AnyRef, Any
Known Subclasses
PQueue
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ReArray
  2. Serializable
  3. IndexedSeq
  4. IndexedSeqOps
  5. IndexedSeq
  6. IndexedSeqOps
  7. AbstractSeq
  8. Seq
  9. SeqOps
  10. Cloneable
  11. Cloneable
  12. Iterable
  13. AbstractSeq
  14. Seq
  15. Equals
  16. SeqOps
  17. PartialFunction
  18. Function1
  19. AbstractIterable
  20. Iterable
  21. IterableFactoryDefaults
  22. IterableOps
  23. IterableOnceOps
  24. IterableOnce
  25. AnyRef
  26. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new ReArray(_length: Int = 0, _array: Array[A] = null)(implicit arg0: ClassTag[A])

    _length

    the initial size of the array, defaults to zero

    _array

    the initial array, if any

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ++[B >: A](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  4. final def ++:[B >: A](prefix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  5. final def +:[B >: A](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  6. final def :+[B >: A](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  7. final def :++[B >: A](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  8. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  9. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  10. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  11. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  12. def andThen[C](k: PartialFunction[A, C]): PartialFunction[Int, C]
    Definition Classes
    PartialFunction
  13. def andThen[C](k: (A) => C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  14. def appended[B >: A](elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
  15. def appendedAll[B >: A](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
  16. def apply(): Array[A]

    Return the internal array of the ReArray.

  17. def apply(i: Int): A

    Return the element at the 'i'-th index position.

    Return the element at the 'i'-th index position.

    i

    the index position

    Definition Classes
    ReArray → SeqOps → Function1
  18. def applyOrElse[A1 <: Int, B1 >: A](x: A1, default: (A1) => B1): B1
    Definition Classes
    PartialFunction
  19. var array: Array[A]

    Set the internal array of ReArray.

    Set the internal array of ReArray.

    Attributes
    protected
  20. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  21. def canEqual(that: Any): Boolean
    Definition Classes
    Seq → Equals
  22. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  23. def clear(): Unit

    Clear the ReArray.

  24. def clone(): IndexedSeq[A]
    Definition Classes
    SeqOps → Cloneable → AnyRef
  25. final def coll: ReArray.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  26. def collect[B](pf: PartialFunction[A, B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  27. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    IterableOnceOps
  28. def combinations(n: Int): Iterator[IndexedSeq[A]]
    Definition Classes
    SeqOps
  29. def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, A]
    Definition Classes
    PartialFunction
  30. def compose[A](g: (A) => Int): (A) => A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  31. final def concat[B >: A](suffix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  32. def contains[A1 >: A](elem: A1): Boolean
    Definition Classes
    SeqOps
  33. def containsSlice[B >: A](that: Seq[B]): Boolean
    Definition Classes
    SeqOps
  34. def copy(m: Int, n: Int, len: Int): Unit

    Move parts of the array.

    Move parts of the array.

    m

    the source position

    n

    the destination position

    len

    the number of elements

    Attributes
    protected
  35. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int

    Fill the given array 'xs' with at most 'len' elements of 'this' traversable starting at position 'start'.

    Fill the given array 'xs' with at most 'len' elements of 'this' traversable starting at position 'start'. Copying will stop once either the end of the current traversable is reached or 'len' elements have been copied or the end of the array is reached.

    xs

    the array to fill

    start

    starting index

    len

    number of elements to copy

    Definition Classes
    ReArray → IterableOnceOps
  36. def copyToArray[B >: A](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  37. def copyToArray[B >: A](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  38. def corresponds[B](that: Seq[B])(p: (A, B) => Boolean): Boolean
    Definition Classes
    SeqOps
  39. def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  40. def count(p: (A) => Boolean): Int
    Definition Classes
    IterableOnceOps
  41. def diff[B >: A](that: Seq[B]): IndexedSeq[A]
    Definition Classes
    SeqOps
  42. def distinct: IndexedSeq[A]
    Definition Classes
    SeqOps
  43. def distinctBy[B](f: (A) => B): IndexedSeq[A]
    Definition Classes
    SeqOps
  44. def drop(n: Int): IndexedSeq[A]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  45. def dropRight(n: Int): IndexedSeq[A]
    Definition Classes
    IndexedSeqOps → IterableOps
  46. def dropWhile(p: (A) => Boolean): IndexedSeq[A]
    Definition Classes
    IterableOps → IterableOnceOps
  47. def elementWise: ElementWiseExtractor[Int, A]
    Definition Classes
    PartialFunction
  48. def empty: IndexedSeq[A]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  49. def endsWith[B >: A](that: Iterable[B]): Boolean
    Definition Classes
    SeqOps
  50. def ensureSize(n: Int): Unit

    Ensure that the internal array has at least 'n' cells.

    Ensure that the internal array has at least 'n' cells.

    n

    the number of cells

    Attributes
    protected
  51. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  52. def equals(o: Any): Boolean
    Definition Classes
    Seq → Equals → AnyRef → Any
  53. def exists(p: (A) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  54. def expand(sz: Int): Unit

    Expand the array to make sure it has the required size.

    Expand the array to make sure it has the required size.

    sz

    the new size requirement of the array

  55. def filter(pred: (A) => Boolean): IndexedSeq[A]
    Definition Classes
    IterableOps → IterableOnceOps
  56. def filterNot(pred: (A) => Boolean): IndexedSeq[A]
    Definition Classes
    IterableOps → IterableOnceOps
  57. def find(p: (A) => Boolean): Option[A]
    Definition Classes
    IterableOnceOps
  58. def findLast(p: (A) => Boolean): Option[A]
    Definition Classes
    SeqOps
  59. def flatMap[B](f: (A) => IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  60. def flatten[B](implicit asIterable: (A) => IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  61. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  62. def foldLeft[B](z: B)(op: (B, A) => B): B
    Definition Classes
    IterableOnceOps
  63. def foldRight[B](z: B)(op: (A, B) => B): B
    Definition Classes
    IndexedSeqOps → IterableOnceOps
  64. def forall(p: (A) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  65. def foreach[U](f: (A) => U): Unit

    Iterate over the ReArray element by element.

    Iterate over the ReArray element by element.

    f

    the function to apply

    Definition Classes
    ReArray → IterableOnceOps
  66. def fromSpecific(coll: IterableOnce[A]): IndexedSeq[A]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  67. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  68. def groupBy[K](f: (A) => K): Map[K, IndexedSeq[A]]
    Definition Classes
    IterableOps
  69. def groupMap[K, B](key: (A) => K)(f: (A) => B): Map[K, IndexedSeq[B]]
    Definition Classes
    IterableOps
  70. def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  71. def grouped(size: Int): Iterator[IndexedSeq[A]]
    Definition Classes
    IterableOps
  72. def hashCode(): Int
    Definition Classes
    Seq → AnyRef → Any
  73. def head: A
    Definition Classes
    IndexedSeqOps → IterableOps
  74. def headOption: Option[A]
    Definition Classes
    IndexedSeqOps → IterableOps
  75. def indexOf[B >: A](elem: B): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  76. def indexOf[B >: A](elem: B, from: Int): Int
    Definition Classes
    SeqOps
  77. def indexOfSlice[B >: A](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  78. def indexOfSlice[B >: A](that: Seq[B], from: Int): Int
    Definition Classes
    SeqOps
  79. def indexWhere(p: (A) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  80. def indexWhere(p: (A) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  81. def indices: Range
    Definition Classes
    SeqOps
  82. def init: IndexedSeq[A]
    Definition Classes
    IterableOps
  83. def initialSize: Int

    Return the initial size of the ReArray.

    Return the initial size of the ReArray.

    Attributes
    protected
  84. def inits: Iterator[IndexedSeq[A]]
    Definition Classes
    IterableOps
  85. def intersect(b: ReArray[A]): ReArray[A]

    Intersect 'this' ReArray with ReArray 'b'.

    Intersect 'this' ReArray with ReArray 'b'.

    b

    the ReArray to intersect with

  86. def intersect[B >: A](that: Seq[B]): IndexedSeq[A]
    Definition Classes
    SeqOps
  87. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    SeqOps
  88. def isEmpty: Boolean
    Definition Classes
    SeqOps → IterableOnceOps
  89. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  90. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  91. def iterableFactory: SeqFactory[IndexedSeq]
    Definition Classes
    IndexedSeq → IndexedSeq → Seq → Seq → Iterable → Iterable → IterableOps
  92. def iterator: Iterator[A]
    Definition Classes
    IndexedSeqOps → IterableOnce
  93. def knownSize: Int
    Definition Classes
    IndexedSeqOps → IterableOnce
  94. def last: A
    Definition Classes
    IndexedSeqOps → IterableOps
  95. def lastIndexOf[B >: A](elem: B, end: Int): Int
    Definition Classes
    SeqOps
  96. def lastIndexOfSlice[B >: A](that: Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  97. def lastIndexOfSlice[B >: A](that: Seq[B], end: Int): Int
    Definition Classes
    SeqOps
  98. def lastIndexWhere(p: (A) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding()
  99. def lastIndexWhere(p: (A) => Boolean, end: Int): Int
    Definition Classes
    SeqOps
  100. def lastOption: Option[A]
    Definition Classes
    IterableOps
  101. def lazyZip[B](that: Iterable[B]): LazyZip2[A, B, ReArray.this.type]
    Definition Classes
    Iterable
  102. def length: Int

    Return the length of 'this' ReArray.

    Return the length of 'this' ReArray.

    Definition Classes
    ReArray → SeqOps
  103. final def lengthCompare(that: Iterable[_]): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  104. final def lengthCompare(len: Int): Int
    Definition Classes
    IndexedSeqOps → SeqOps
  105. final def lengthIs: SizeCompareOps
    Definition Classes
    SeqOps
    Annotations
    @inline()
  106. def lift: (Int) => Option[A]
    Definition Classes
    PartialFunction
  107. def map[B](f: (A) => B): IndexedSeq[B]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  108. def mapInPlace(f: (A) => A): ReArray.this.type
    Definition Classes
    IndexedSeqOps
  109. def max[B >: A](implicit ord: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  110. def maxBy[B](f: (A) => B)(implicit cmp: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  111. def maxByOption[B](f: (A) => B)(implicit cmp: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  112. def maxOption[B >: A](implicit ord: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  113. def min[B >: A](implicit ord: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  114. def minBy[B](f: (A) => B)(implicit cmp: Ordering[B]): A
    Definition Classes
    IterableOnceOps
  115. def minByOption[B](f: (A) => B)(implicit cmp: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  116. def minOption[B >: A](implicit ord: Ordering[B]): Option[A]
    Definition Classes
    IterableOnceOps
  117. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  118. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  119. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  120. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  121. def newSpecificBuilder: Builder[A, IndexedSeq[A]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  122. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  123. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  124. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  125. def occCounts[B](sq: Seq[B]): Map[B, Int]
    Attributes
    protected[collection]
    Definition Classes
    SeqOps
  126. def orElse[A1 <: Int, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  127. def padTo[B >: A](len: Int, elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
  128. def partition(p: (A) => Boolean): (IndexedSeq[A], IndexedSeq[A])
    Definition Classes
    IterableOps
  129. def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (IndexedSeq[A1], IndexedSeq[A2])
    Definition Classes
    IterableOps
  130. def patch[B >: A](from: Int, other: IterableOnce[B], replaced: Int): IndexedSeq[B]
    Definition Classes
    SeqOps
  131. def permutations: Iterator[IndexedSeq[A]]
    Definition Classes
    SeqOps
  132. def prepended[B >: A](elem: B): IndexedSeq[B]
    Definition Classes
    IndexedSeqOps → SeqOps
  133. def prependedAll[B >: A](prefix: IterableOnce[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
  134. def product[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  135. def reduce[B >: A](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  136. def reduceLeft[B >: A](op: (B, A) => B): B
    Definition Classes
    IterableOnceOps
  137. def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
    Definition Classes
    IterableOnceOps
  138. def reduceOption[B >: A](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  139. def reduceRight[B >: A](op: (A, B) => B): B
    Definition Classes
    IterableOnceOps
  140. def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  141. def reduceToSize(sz: Int): Unit

    Remove elements of this array at indices after 'sz'.

    Remove elements of this array at indices after 'sz'.

    sz

    the index position

  142. def reverse: IndexedSeq[A]
    Definition Classes
    IndexedSeqOps → SeqOps
  143. def reverseIterator: Iterator[A]
    Definition Classes
    IndexedSeqOps → SeqOps
  144. def reversed: Iterable[A]
    Attributes
    protected
    Definition Classes
    IndexedSeqOps → IterableOnceOps
  145. def runWith[U](action: (A) => U): (Int) => Boolean
    Definition Classes
    PartialFunction
  146. def sameElements[B >: A](that: IterableOnce[B]): Boolean
    Definition Classes
    SeqOps
  147. def scan[B >: A](z: B)(op: (B, B) => B): IndexedSeq[B]
    Definition Classes
    IterableOps
  148. def scanLeft[B](z: B)(op: (B, A) => B): IndexedSeq[B]
    Definition Classes
    IterableOps → IterableOnceOps
  149. def scanRight[B](z: B)(op: (A, B) => B): IndexedSeq[B]
    Definition Classes
    IterableOps
  150. def search[B >: A](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  151. def search[B >: A](elem: B)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    IndexedSeqOps → SeqOps
  152. def segmentLength(p: (A) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  153. final def segmentLength(p: (A) => Boolean): Int
    Definition Classes
    SeqOps
  154. def shiftLeft(i: Int): Unit

    Remove one element at the specified index position and shift the rest of the elements in the array one position to the left.

    Remove one element at the specified index position and shift the rest of the elements in the array one position to the left.

    i

    the index of the element to be removed

  155. def shiftLeft2(i: Int): Unit

    Remove two elements starting at the specified index position and shift the rest of the elements in the array two positions to the left.

    Remove two elements starting at the specified index position and shift the rest of the elements in the array two positions to the left.

    i

    the index of the element to be removed

  156. def shiftRight(i: Int): Unit

    Shift the elements by one position to the right starting at the index 'i'.

    Shift the elements by one position to the right starting at the index 'i'. This will also automatically expand the array. The value will be repeated at 'i' and 'i+1' positions.

    i

    the index position to start the shift

  157. def shiftRight2(i: Int): Unit

    Shift the elements by two positions to the right starting at the index 'i'.

    Shift the elements by two positions to the right starting at the index 'i'. This will also automatically expand the array. The value will be repeated at 'i', 'i+1' and 'i+2' positions.

    i

    the index position to start the shift

  158. final def size: Int
    Definition Classes
    SeqOps → IterableOnceOps
  159. var size0: Int

    Set the size of ReArray.

    Set the size of ReArray.

    Attributes
    protected
  160. final def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    SeqOps → IterableOps
  161. final def sizeCompare(otherSize: Int): Int
    Definition Classes
    SeqOps → IterableOps
  162. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  163. def slice(from: Int, until: Int): IndexedSeq[A]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  164. def sliding(size: Int, step: Int): Iterator[IndexedSeq[A]]
    Definition Classes
    IterableOps
  165. def sliding(size: Int): Iterator[IndexedSeq[A]]
    Definition Classes
    IterableOps
  166. def sortBy[B](f: (A) => B)(implicit ord: Ordering[B]): IndexedSeq[A]
    Definition Classes
    SeqOps
  167. def sortInPlace[B >: A]()(implicit ord: Ordering[B]): ReArray.this.type
    Definition Classes
    IndexedSeqOps
  168. def sortInPlaceBy[B](f: (A) => B)(implicit ord: Ordering[B]): ReArray.this.type
    Definition Classes
    IndexedSeqOps
  169. def sortInPlaceWith(lt: (A, A) => Boolean): ReArray.this.type
    Definition Classes
    IndexedSeqOps
  170. def sortWith(lt: (A, A) => Boolean): IndexedSeq[A]
    Definition Classes
    SeqOps
  171. def sorted[B >: A](implicit ord: Ordering[B]): IndexedSeq[A]
    Definition Classes
    SeqOps
  172. def span(p: (A) => Boolean): (IndexedSeq[A], IndexedSeq[A])
    Definition Classes
    IterableOps → IterableOnceOps
  173. def splitAt(n: Int): (IndexedSeq[A], IndexedSeq[A])
    Definition Classes
    IterableOps → IterableOnceOps
  174. def startsWith[B >: A](that: IterableOnce[B], offset: Int): Boolean
    Definition Classes
    SeqOps
  175. def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S with EfficientSplit
    Definition Classes
    IndexedSeqOps → IterableOnce
  176. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    IndexedSeq → Seq → Iterable
  177. def sum[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  178. def swap(i: Int, j: Int): Unit

    Swap two elements of this array.

    Swap two elements of this array.

    i

    the first element

    j

    the second element

    Attributes
    protected
  179. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  180. def tail: IndexedSeq[A]
    Definition Classes
    IterableOps
  181. def tails: Iterator[IndexedSeq[A]]
    Definition Classes
    IterableOps
  182. def take(n: Int): IndexedSeq[A]
    Definition Classes
    IndexedSeqOps → IterableOps → IterableOnceOps
  183. def takeRight(n: Int): IndexedSeq[A]
    Definition Classes
    IndexedSeqOps → IterableOps
  184. def takeWhile(p: (A) => Boolean): IndexedSeq[A]
    Definition Classes
    IterableOps → IterableOnceOps
  185. def tapEach[U](f: (A) => U): IndexedSeq[A]
    Definition Classes
    IterableOps → IterableOnceOps
  186. def to[C1](factory: Factory[A, C1]): C1
    Definition Classes
    IterableOnceOps
  187. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  188. final def toBuffer[B >: A]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  189. def toIndexedSeq: IndexedSeq[A]
    Definition Classes
    IterableOnceOps
  190. final def toIterable: ReArray.this.type
    Definition Classes
    Iterable → IterableOps
  191. def toList: List[A]
    Definition Classes
    IterableOnceOps
  192. def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  193. def toSeq: Seq[A]
    Definition Classes
    IterableOnceOps
  194. def toSet[B >: A]: Set[B]
    Definition Classes
    IterableOnceOps
  195. def toString(): String

    Convert 'this' ReArray to a string.

    Convert 'this' ReArray to a string.

    Definition Classes
    ReArray → Seq → Function1 → Iterable → AnyRef → Any
  196. def toVector: Vector[A]
    Definition Classes
    IterableOnceOps
  197. def transpose[B](implicit asIterable: (A) => Iterable[B]): IndexedSeq[IndexedSeq[B]]
    Definition Classes
    IterableOps
  198. def unapply(a: Int): Option[A]
    Definition Classes
    PartialFunction
  199. def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
    Definition Classes
    IterableOps
  200. def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
    Definition Classes
    IterableOps
  201. def update(idx: Int, elem: A): Unit

    Set 'this' array's element at the 'i'- th index position.

    Set 'this' array's element at the 'i'- th index position.

    idx

    the given index

    elem

    the value to assign

    Definition Classes
    ReArray → SeqOps
  202. def updated[B >: A](index: Int, elem: B): IndexedSeq[B]
    Definition Classes
    SeqOps
  203. def view: IndexedSeqView[A]
    Definition Classes
    IndexedSeqOps → SeqOps → IterableOps
  204. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  205. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  206. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  207. def withFilter(p: (A) => Boolean): WithFilter[A, [_]IndexedSeq[_]]
    Definition Classes
    IterableOps
  208. def zip[B](that: IterableOnce[B]): IndexedSeq[(A, B)]
    Definition Classes
    IterableOps
  209. def zipAll[A1 >: A, B](that: Iterable[B], thisElem: A1, thatElem: B): IndexedSeq[(A1, B)]
    Definition Classes
    IterableOps
  210. def zipWithIndex: IndexedSeq[(A, Int)]
    Definition Classes
    IterableOps → IterableOnceOps

Deprecated Value Members

  1. final def /:[B](z: B)(op: (B, A) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  2. final def :\[B](z: B)(op: (A, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  3. def aggregate[B](z: => B)(seqop: (B, A) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  4. def companion: IterableFactory[[_]IndexedSeq[_]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  5. final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  6. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  7. def hasDefiniteSize: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  8. final def prefixLength(p: (A) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use segmentLength instead of prefixLength

  9. final def repr: IndexedSeq[A]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  10. def reverseMap[B](f: (A) => B): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)

  11. def seq: ReArray.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  12. final def toIterator: Iterator[A]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  13. final def toStream: Stream[A]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  14. final def toTraversable: Traversable[A]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use toIterable instead

  15. final def transform(f: (A) => A): ReArray.this.type
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use mapInPlace on an IndexedSeq instead

  16. final def union[B >: A](that: Seq[B]): IndexedSeq[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use concat instead

  17. def view(from: Int, until: Int): IndexedSeqView[A]
    Definition Classes
    IndexedSeqOps → IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

Inherited from Serializable

Inherited from IndexedSeq[A]

Inherited from IndexedSeqOps[A, IndexedSeq, IndexedSeq[A]]

Inherited from IndexedSeq[A]

Inherited from IndexedSeqOps[A, [_]IndexedSeq[_], IndexedSeq[A]]

Inherited from AbstractSeq[A]

Inherited from Seq[A]

Inherited from SeqOps[A, [_]IndexedSeq[_], IndexedSeq[A]]

Inherited from Cloneable[IndexedSeq[A]]

Inherited from Cloneable

Inherited from Iterable[A]

Inherited from AbstractSeq[A]

Inherited from Seq[A]

Inherited from Equals

Inherited from SeqOps[A, [_]IndexedSeq[_], IndexedSeq[A]]

Inherited from PartialFunction[Int, A]

Inherited from (Int) => A

Inherited from AbstractIterable[A]

Inherited from Iterable[A]

Inherited from IterableFactoryDefaults[A, [x]IndexedSeq[x]]

Inherited from IterableOps[A, [_]IndexedSeq[_], IndexedSeq[A]]

Inherited from IterableOnceOps[A, [_]IndexedSeq[_], IndexedSeq[A]]

Inherited from IterableOnce[A]

Inherited from AnyRef

Inherited from Any

Ungrouped