Packages

class ReArray[A] extends IndexedSeq[A] with GenericTraversableTemplate[A, ReArray] with IndexedSeqOptimized[A, ReArray[A]]

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
IndexedSeqOptimized[A, ReArray[A]], IndexedSeqOptimized[A, ReArray[A]], IndexedSeqLike[A, ReArray[A]], IndexedSeq[A], IndexedSeqLike[A, ReArray[A]], Seq[A], SeqLike[A, ReArray[A]], GenSeq[A], GenSeqLike[A, ReArray[A]], Iterable[A], IterableLike[A, ReArray[A]], Equals, GenIterable[A], GenIterableLike[A, ReArray[A]], Traversable[A], GenTraversable[A], GenericTraversableTemplate[A, ReArray], TraversableLike[A, ReArray[A]], GenTraversableLike[A, ReArray[A]], Parallelizable[A, ParSeq[A]], TraversableOnce[A], GenTraversableOnce[A], FilterMonadic[A, ReArray[A]], HasNewBuilder[A, scalation.util.ReArray[A] @scala.annotation.unchecked.uncheckedVariance], PartialFunction[Int, A], (Int) ⇒ A, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ReArray
  2. IndexedSeqOptimized
  3. IndexedSeqOptimized
  4. IndexedSeqLike
  5. IndexedSeq
  6. IndexedSeqLike
  7. Seq
  8. SeqLike
  9. GenSeq
  10. GenSeqLike
  11. Iterable
  12. IterableLike
  13. Equals
  14. GenIterable
  15. GenIterableLike
  16. Traversable
  17. GenTraversable
  18. GenericTraversableTemplate
  19. TraversableLike
  20. GenTraversableLike
  21. Parallelizable
  22. TraversableOnce
  23. GenTraversableOnce
  24. FilterMonadic
  25. HasNewBuilder
  26. PartialFunction
  27. Function1
  28. AnyRef
  29. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

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

Type Members

  1. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  2. def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    TraversableLike
  3. def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    TraversableLike
  4. def +:[B >: A, That](elem: B)(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  5. def /:[B](z: B)(op: (B, A) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  6. def :+[B >: A, That](elem: B)(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  7. def :\[B](z: B)(op: (A, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  8. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  9. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  10. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  11. def aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  12. def andThen[C](k: (A) ⇒ C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  13. def apply(): Array[A]

    Return the internal array of the ReArray.

  14. 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 → SeqLike → GenSeqLike → Function1
  15. def applyOrElse[A1 <: Int, B1 >: A](x: A1, default: (A1) ⇒ B1): B1
    Definition Classes
    PartialFunction
  16. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  17. def clear(): Unit

    Clear the ReArray.

  18. def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  19. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    TraversableOnce
  20. def combinations(n: Int): Iterator[ReArray[A]]
    Definition Classes
    SeqLike
  21. def companion: GenericCompanion[ReArray]

    Set the companion to null as not required for our implementation.

    Set the companion to null as not required for our implementation.

    Definition Classes
    ReArray → IndexedSeq → Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  22. def compose[A](g: (A) ⇒ Int): (A) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  23. def contains[A1 >: A](elem: A1): Boolean
    Definition Classes
    SeqLike
  24. def containsSlice[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike
  25. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

    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 → IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  26. def copyToArray[B >: A](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  27. def copyToArray[B >: A](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  28. def copyToBuffer[B >: A](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  29. def corresponds[B](that: GenSeq[B])(p: (A, B) ⇒ Boolean): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  30. def count(p: (A) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  31. def diff[B >: A](that: GenSeq[B]): ReArray[A]
    Definition Classes
    SeqLike → GenSeqLike
  32. def distinct: ReArray[A]
    Definition Classes
    SeqLike → GenSeqLike
  33. def drop(n: Int): ReArray[A]
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  34. def dropRight(n: Int): ReArray[A]
    Definition Classes
    IndexedSeqOptimized → IterableLike
  35. def dropWhile(p: (A) ⇒ Boolean): ReArray[A]
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  36. def endsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  37. def equals(that: Any): Boolean
    Definition Classes
    GenSeqLike → Equals → Any
  38. def exists(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  39. 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

  40. def filter(p: (A) ⇒ Boolean): ReArray[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  41. def filterNot(p: (A) ⇒ Boolean): ReArray[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  42. def find(p: (A) ⇒ Boolean): Option[A]
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  43. def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  44. def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): ReArray[B]
    Definition Classes
    GenericTraversableTemplate
  45. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  46. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B
    Definition Classes
    IndexedSeqOptimized → TraversableOnce → GenTraversableOnce
  47. def foldRight[B](z: B)(op: (A, B) ⇒ B): B
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
  48. def forall(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  49. 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 → IndexedSeqOptimized → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  50. def genericBuilder[B]: Builder[B, ReArray[B]]
    Definition Classes
    GenericTraversableTemplate
  51. def groupBy[K](f: (A) ⇒ K): Map[K, ReArray[A]]
    Definition Classes
    TraversableLike → GenTraversableLike
  52. def grouped(size: Int): Iterator[ReArray[A]]
    Definition Classes
    IterableLike
  53. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  54. def hashCode(): Int
    Definition Classes
    IndexedSeqLike → GenSeqLike → Any
  55. def head: A
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  56. def headOption: Option[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  57. def indexOf[B >: A](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  58. def indexOf[B >: A](elem: B): Int
    Definition Classes
    GenSeqLike
  59. def indexOfSlice[B >: A](that: GenSeq[B], from: Int): Int
    Definition Classes
    SeqLike
  60. def indexOfSlice[B >: A](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  61. def indexWhere(p: (A) ⇒ Boolean, from: Int): Int
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  62. def indexWhere(p: (A) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  63. def indices: Range
    Definition Classes
    SeqLike
  64. def init: ReArray[A]
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  65. def inits: Iterator[ReArray[A]]
    Definition Classes
    TraversableLike
  66. 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

  67. def intersect[B >: A](that: GenSeq[B]): ReArray[A]
    Definition Classes
    SeqLike → GenSeqLike
  68. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    GenSeqLike
  69. def isEmpty: Boolean
    Definition Classes
    IndexedSeqOptimized → SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  70. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  71. def iterator: Iterator[A]
    Definition Classes
    IndexedSeqLike → IterableLike → GenIterableLike
  72. def last: A
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  73. def lastIndexOf[B >: A](elem: B, end: Int): Int
    Definition Classes
    GenSeqLike
  74. def lastIndexOf[B >: A](elem: B): Int
    Definition Classes
    GenSeqLike
  75. def lastIndexOfSlice[B >: A](that: GenSeq[B], end: Int): Int
    Definition Classes
    SeqLike
  76. def lastIndexOfSlice[B >: A](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  77. def lastIndexWhere(p: (A) ⇒ Boolean, end: Int): Int
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  78. def lastIndexWhere(p: (A) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  79. def lastOption: Option[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  80. def length: Int

    Return the length of 'this' ReArray.

    Return the length of 'this' ReArray.

    Definition Classes
    ReArray → SeqLike → GenSeqLike
  81. def lengthCompare(len: Int): Int
    Definition Classes
    IndexedSeqOptimized → SeqLike
  82. def lift: (Int) ⇒ Option[A]
    Definition Classes
    PartialFunction
  83. def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  84. def max[B >: A](implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  85. def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. def min[B >: A](implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def orElse[A1 <: Int, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  93. def padTo[B >: A, That](len: Int, elem: B)(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  94. def par: ParSeq[A]
    Definition Classes
    Parallelizable
  95. def partition(p: (A) ⇒ Boolean): (ReArray[A], ReArray[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  96. def patch[B >: A, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  97. def permutations: Iterator[ReArray[A]]
    Definition Classes
    SeqLike
  98. def prefixLength(p: (A) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  99. def product[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def reduceLeft[B >: A](op: (B, A) ⇒ B): B
    Definition Classes
    IndexedSeqOptimized → TraversableOnce
  102. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def reduceRight[B >: A](op: (A, B) ⇒ B): B
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
  105. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. 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

  107. def repr: ReArray[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def reverse: ReArray[A]
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  109. def reverseIterator: Iterator[A]
    Definition Classes
    IndexedSeqOptimized → SeqLike
  110. def reverseMap[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  111. def runWith[U](action: (A) ⇒ U): (Int) ⇒ Boolean
    Definition Classes
    PartialFunction
  112. def sameElements[B >: A](that: GenIterable[B]): Boolean
    Definition Classes
    IndexedSeqOptimized → IterableLike → GenIterableLike
  113. def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  114. def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  115. def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[ReArray[A], 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.

  116. def segmentLength(p: (A) ⇒ Boolean, from: Int): Int
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  117. def seq: IndexedSeq[A]
    Definition Classes
    IndexedSeq → IndexedSeqLike → Seq → GenSeq → GenSeqLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  118. 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

  119. 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

  120. 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

  121. 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

  122. def size: Int
    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  123. def slice(from: Int, until: Int): ReArray[A]
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  124. def sliding(size: Int, step: Int): Iterator[ReArray[A]]
    Definition Classes
    IterableLike
  125. def sliding(size: Int): Iterator[ReArray[A]]
    Definition Classes
    IterableLike
  126. def sortBy[B](f: (A) ⇒ B)(implicit ord: Ordering[B]): ReArray[A]
    Definition Classes
    SeqLike
  127. def sortWith(lt: (A, A) ⇒ Boolean): ReArray[A]
    Definition Classes
    SeqLike
  128. def sorted[B >: A](implicit ord: Ordering[B]): ReArray[A]
    Definition Classes
    SeqLike
  129. def span(p: (A) ⇒ Boolean): (ReArray[A], ReArray[A])
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  130. def splitAt(n: Int): (ReArray[A], ReArray[A])
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  131. def startsWith[B](that: GenSeq[B], offset: Int): Boolean
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  132. def startsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    GenSeqLike
  133. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  134. def sum[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def tail: ReArray[A]
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  136. def tails: Iterator[ReArray[A]]
    Definition Classes
    TraversableLike
  137. def take(n: Int): ReArray[A]
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  138. def takeRight(n: Int): ReArray[A]
    Definition Classes
    IndexedSeqOptimized → IterableLike
  139. def takeWhile(p: (A) ⇒ Boolean): ReArray[A]
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  140. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  141. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  142. def toBuffer[A1 >: A]: Buffer[A1]
    Definition Classes
    IndexedSeqLike → TraversableOnce → GenTraversableOnce
  143. def toIndexedSeq: IndexedSeq[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  144. def toIterable: Iterable[A]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  145. def toIterator: Iterator[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  146. def toList: List[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  147. def toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  148. def toSeq: Seq[A]
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  149. def toSet[B >: A]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  150. def toStream: Stream[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  151. def toString(): String

    Convert 'this' ReArray to a string.

    Convert 'this' ReArray to a string.

    Definition Classes
    ReArray → SeqLike → TraversableLike → Function1 → AnyRef → Any
  152. def toTraversable: Traversable[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  153. def toVector: Vector[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  154. def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): ReArray[ReArray[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  155. def union[B >: A, That](that: GenSeq[B])(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  156. def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (ReArray[A1], ReArray[A2])
    Definition Classes
    GenericTraversableTemplate
  157. def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (ReArray[A1], ReArray[A2], ReArray[A3])
    Definition Classes
    GenericTraversableTemplate
  158. 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 → IndexedSeqLike
  159. def updated[B >: A, That](index: Int, elem: B)(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  160. def view(from: Int, until: Int): IndexedSeqView[A, ReArray[A]]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  161. def view: IndexedSeqView[A, ReArray[A]]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  162. def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, ReArray[A]]
    Definition Classes
    TraversableLike → FilterMonadic
  163. def zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[ReArray[A], (A1, B), That]): That
    Definition Classes
    IndexedSeqOptimized → IterableLike → GenIterableLike
  164. def zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[ReArray[A], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  165. def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[ReArray[A], (A1, Int), That]): That
    Definition Classes
    IndexedSeqOptimized → IterableLike → GenIterableLike