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 Elements extends AbstractIterator[A] with BufferedIterator[A] with Serializable
    Attributes
    protected
    Definition Classes
    IndexedSeqLike
    Annotations
    @SerialVersionUID()
  2. type Self = ReArray[A]
    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 >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  4. def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    TraversableLike
  5. def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    TraversableLike
  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: (B, A) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  8. def :+[B >: A, That](elem: B)(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  9. def :\[B](z: B)(op: (A, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  12. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  13. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  14. def aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  15. def andThen[C](k: (A) ⇒ C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  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 → SeqLike → GenSeqLike → 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
    IterableLike → Equals
  22. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  23. def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  24. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    TraversableOnce
  25. def combinations(n: Int): Iterator[ReArray[A]]
    Definition Classes
    SeqLike
  26. 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
  27. def compose[A](g: (A) ⇒ Int): (A) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  28. def contains[A1 >: A](elem: A1): Boolean
    Definition Classes
    SeqLike
  29. def containsSlice[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike
  30. 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
  31. 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
  32. def copyToArray[B >: A](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def copyToArray[B >: A](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  34. def copyToBuffer[B >: A](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  35. def corresponds[B](that: GenSeq[B])(p: (A, B) ⇒ Boolean): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  36. def count(p: (A) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  37. def diff[B >: A](that: GenSeq[B]): ReArray[A]
    Definition Classes
    SeqLike → GenSeqLike
  38. def distinct: ReArray[A]
    Definition Classes
    SeqLike → GenSeqLike
  39. def drop(n: Int): ReArray[A]
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  40. def dropRight(n: Int): ReArray[A]
    Definition Classes
    IndexedSeqOptimized → IterableLike
  41. def dropWhile(p: (A) ⇒ Boolean): ReArray[A]
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  42. def endsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  43. 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
  44. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  45. def equals(that: Any): Boolean
    Definition Classes
    GenSeqLike → Equals → Any
  46. def exists(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  47. 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

  48. def filter(p: (A) ⇒ Boolean): ReArray[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  49. def filterNot(p: (A) ⇒ Boolean): ReArray[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  50. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  51. def find(p: (A) ⇒ Boolean): Option[A]
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  52. def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  53. def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): ReArray[B]
    Definition Classes
    GenericTraversableTemplate
  54. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  55. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B
    Definition Classes
    IndexedSeqOptimized → TraversableOnce → GenTraversableOnce
  56. def foldRight[B](z: B)(op: (A, B) ⇒ B): B
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
  57. def forall(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  58. 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
  59. def genericBuilder[B]: Builder[B, ReArray[B]]
    Definition Classes
    GenericTraversableTemplate
  60. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  61. def groupBy[K](f: (A) ⇒ K): Map[K, ReArray[A]]
    Definition Classes
    TraversableLike → GenTraversableLike
  62. def grouped(size: Int): Iterator[ReArray[A]]
    Definition Classes
    IterableLike
  63. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  64. def hashCode(): Int
    Definition Classes
    IndexedSeqLike → GenSeqLike → Any
  65. def head: A
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  66. def headOption: Option[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  67. def indexOf[B >: A](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  68. def indexOf[B >: A](elem: B): Int
    Definition Classes
    GenSeqLike
  69. def indexOfSlice[B >: A](that: GenSeq[B], from: Int): Int
    Definition Classes
    SeqLike
  70. def indexOfSlice[B >: A](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  71. def indexWhere(p: (A) ⇒ Boolean, from: Int): Int
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  72. def indexWhere(p: (A) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  73. def indices: Range
    Definition Classes
    SeqLike
  74. def init: ReArray[A]
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  75. def initialSize: Int

    Return the initial size of the ReArray.

    Return the initial size of the ReArray.

    Attributes
    protected
  76. def inits: Iterator[ReArray[A]]
    Definition Classes
    TraversableLike
  77. def intersect[B >: A](that: GenSeq[B]): ReArray[A]
    Definition Classes
    SeqLike → GenSeqLike
  78. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    GenSeqLike
  79. def isEmpty: Boolean
    Definition Classes
    IndexedSeqOptimized → SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  80. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  81. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  82. def iterator: Iterator[A]
    Definition Classes
    IndexedSeqLike → IterableLike → GenIterableLike
  83. def last: A
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  84. def lastIndexOf[B >: A](elem: B, end: Int): Int
    Definition Classes
    GenSeqLike
  85. def lastIndexOf[B >: A](elem: B): Int
    Definition Classes
    GenSeqLike
  86. def lastIndexOfSlice[B >: A](that: GenSeq[B], end: Int): Int
    Definition Classes
    SeqLike
  87. def lastIndexOfSlice[B >: A](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  88. def lastIndexWhere(p: (A) ⇒ Boolean, end: Int): Int
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  89. def lastIndexWhere(p: (A) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  90. def lastOption: Option[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  91. def length: Int

    Return the length of 'this' ReArray.

    Return the length of 'this' ReArray.

    Definition Classes
    ReArray → SeqLike → GenSeqLike
  92. def lengthCompare(len: Int): Int
    Definition Classes
    IndexedSeqOptimized → SeqLike
  93. def lift: (Int) ⇒ Option[A]
    Definition Classes
    PartialFunction
  94. def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  95. def max[B >: A](implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  96. def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def min[B >: A](implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  103. def newBuilder: Builder[A, ReArray[A]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  104. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. final def notify(): Unit
    Definition Classes
    AnyRef
  106. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  107. def orElse[A1 <: Int, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  108. def padTo[B >: A, That](len: Int, elem: B)(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  109. def par: ParSeq[A]
    Definition Classes
    Parallelizable
  110. def parCombiner: Combiner[A, ParSeq[A]]
    Attributes
    protected[this]
    Definition Classes
    SeqLike → TraversableLike → Parallelizable
  111. def partition(p: (A) ⇒ Boolean): (ReArray[A], ReArray[A])
    Definition Classes
    TraversableLike → GenTraversableLike
  112. def patch[B >: A, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  113. def permutations: Iterator[ReArray[A]]
    Definition Classes
    SeqLike
  114. def prefixLength(p: (A) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  115. def product[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. def reduceLeft[B >: A](op: (B, A) ⇒ B): B
    Definition Classes
    IndexedSeqOptimized → TraversableOnce
  118. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  120. def reduceRight[B >: A](op: (A, B) ⇒ B): B
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
  121. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  122. 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

  123. def repr: ReArray[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  124. def reverse: ReArray[A]
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  125. def reverseIterator: Iterator[A]
    Definition Classes
    IndexedSeqOptimized → SeqLike
  126. def reverseMap[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  127. def reversed: List[A]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  128. def runWith[U](action: (A) ⇒ U): (Int) ⇒ Boolean
    Definition Classes
    PartialFunction
  129. def sameElements[B >: A](that: GenIterable[B]): Boolean
    Definition Classes
    IndexedSeqOptimized → IterableLike → GenIterableLike
  130. def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  131. def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  132. 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.

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

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

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

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

  139. def size: Int
    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  140. var size0: Int

    Set the size of ReArray.

    Set the size of ReArray.

    Attributes
    protected
  141. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    IndexedSeqLike → GenTraversableOnce
  142. def slice(from: Int, until: Int): ReArray[A]
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  143. def sliding(size: Int, step: Int): Iterator[ReArray[A]]
    Definition Classes
    IterableLike
  144. def sliding(size: Int): Iterator[ReArray[A]]
    Definition Classes
    IterableLike
  145. def sortBy[B](f: (A) ⇒ B)(implicit ord: Ordering[B]): ReArray[A]
    Definition Classes
    SeqLike
  146. def sortWith(lt: (A, A) ⇒ Boolean): ReArray[A]
    Definition Classes
    SeqLike
  147. def sorted[B >: A](implicit ord: Ordering[B]): ReArray[A]
    Definition Classes
    SeqLike
  148. def span(p: (A) ⇒ Boolean): (ReArray[A], ReArray[A])
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  149. def splitAt(n: Int): (ReArray[A], ReArray[A])
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  150. def startsWith[B](that: GenSeq[B], offset: Int): Boolean
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  151. def startsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    GenSeqLike
  152. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  153. def sum[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  154. 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
  155. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  156. def tail: ReArray[A]
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  157. def tails: Iterator[ReArray[A]]
    Definition Classes
    TraversableLike
  158. def take(n: Int): ReArray[A]
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  159. def takeRight(n: Int): ReArray[A]
    Definition Classes
    IndexedSeqOptimized → IterableLike
  160. def takeWhile(p: (A) ⇒ Boolean): ReArray[A]
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  161. def thisCollection: IndexedSeq[A]
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  162. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  163. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  164. def toBuffer[A1 >: A]: Buffer[A1]
    Definition Classes
    IndexedSeqLike → TraversableOnce → GenTraversableOnce
  165. def toCollection(repr: ReArray[A]): IndexedSeq[A]
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  166. def toIndexedSeq: IndexedSeq[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  167. def toIterable: Iterable[A]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  168. def toIterator: Iterator[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  169. def toList: List[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  170. def toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  171. def toSeq: Seq[A]
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  172. def toSet[B >: A]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  173. def toStream: Stream[A]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  174. def toString(): String

    Convert 'this' ReArray to a string.

    Convert 'this' ReArray to a string.

    Definition Classes
    ReArray → SeqLike → TraversableLike → Function1 → AnyRef → Any
  175. def toTraversable: Traversable[A]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  176. def toVector: Vector[A]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  177. 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.

  178. def union[B >: A, That](that: GenSeq[B])(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  179. def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (ReArray[A1], ReArray[A2])
    Definition Classes
    GenericTraversableTemplate
  180. def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (ReArray[A1], ReArray[A2], ReArray[A3])
    Definition Classes
    GenericTraversableTemplate
  181. 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
  182. def updated[B >: A, That](index: Int, elem: B)(implicit bf: CanBuildFrom[ReArray[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  183. def view(from: Int, until: Int): IndexedSeqView[A, ReArray[A]]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  184. def view: IndexedSeqView[A, ReArray[A]]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  185. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  186. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  187. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  188. def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, ReArray[A]]
    Definition Classes
    TraversableLike → FilterMonadic
  189. def zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[ReArray[A], (A1, B), That]): That
    Definition Classes
    IndexedSeqOptimized → IterableLike → GenIterableLike
  190. 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
  191. def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[ReArray[A], (A1, Int), That]): That
    Definition Classes
    IndexedSeqOptimized → IterableLike → GenIterableLike

Inherited from IndexedSeqOptimized[A, ReArray[A]]

Inherited from IndexedSeqOptimized[A, ReArray[A]]

Inherited from IndexedSeqLike[A, ReArray[A]]

Inherited from IndexedSeq[A]

Inherited from IndexedSeqLike[A, ReArray[A]]

Inherited from Seq[A]

Inherited from SeqLike[A, ReArray[A]]

Inherited from GenSeq[A]

Inherited from GenSeqLike[A, ReArray[A]]

Inherited from Iterable[A]

Inherited from IterableLike[A, ReArray[A]]

Inherited from Equals

Inherited from GenIterable[A]

Inherited from GenIterableLike[A, ReArray[A]]

Inherited from Traversable[A]

Inherited from GenTraversable[A]

Inherited from GenericTraversableTemplate[A, ReArray]

Inherited from TraversableLike[A, ReArray[A]]

Inherited from GenTraversableLike[A, ReArray[A]]

Inherited from Parallelizable[A, ParSeq[A]]

Inherited from TraversableOnce[A]

Inherited from GenTraversableOnce[A]

Inherited from FilterMonadic[A, ReArray[A]]

Inherited from HasNewBuilder[A, scalation.util.ReArray[A] @scala.annotation.unchecked.uncheckedVariance]

Inherited from PartialFunction[Int, A]

Inherited from (Int) ⇒ A

Inherited from AnyRef

Inherited from Any

Ungrouped