Packages

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

The DArray class provides an implementation of large mutable arrays. It used a double array with hi 'i1' and low 'i2' indices. Index 'i1' uses the hi-order bits to determine the chunk and 'i2' to determine the offset within a chunk. ------------------------------------------------------------------------------------------- 'apply (i) => i1 = i >> bits; val i2 = i - i1' ------------------------------------------------------------------------------------------- Could be extended to use a 'Long' rather than 'Int' in apply to very large arrays. -------------------------------------------------------------------------------------------

Linear Supertypes
IndexedSeqOptimized[A, DArray[A]], IndexedSeqOptimized[A, DArray[A]], IndexedSeqLike[A, DArray[A]], IndexedSeq[A], IndexedSeqLike[A, DArray[A]], Seq[A], SeqLike[A, DArray[A]], GenSeq[A], GenSeqLike[A, DArray[A]], Iterable[A], IterableLike[A, DArray[A]], Equals, GenIterable[A], GenIterableLike[A, DArray[A]], Traversable[A], GenTraversable[A], GenericTraversableTemplate[A, DArray], TraversableLike[A, DArray[A]], GenTraversableLike[A, DArray[A]], Parallelizable[A, ParSeq[A]], TraversableOnce[A], GenTraversableOnce[A], FilterMonadic[A, DArray[A]], HasNewBuilder[A, scalation.util.DArray[A] @scala.annotation.unchecked.uncheckedVariance], PartialFunction[Int, A], (Int) ⇒ A, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DArray
  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 DArray(_length: Int = 32768)(implicit arg0: ClassTag[A])

    _length

    the initial size of the array, defaults to 32768

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[DArray[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  2. def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[DArray[A], B, That]): That
    Definition Classes
    TraversableLike
  3. def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[DArray[A], B, That]): That
    Definition Classes
    TraversableLike
  4. def +:[B >: A, That](elem: B)(implicit bf: CanBuildFrom[DArray[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[DArray[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[Array[A]]

    Return the internal double array of the DArray.

  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
    DArray → 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 collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[DArray[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  18. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    TraversableOnce
  19. def combinations(n: Int): Iterator[DArray[A]]
    Definition Classes
    SeqLike
  20. def companion: GenericCompanion[DArray]

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

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

    Definition Classes
    DArray → IndexedSeq → Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  21. def compose[A](g: (A) ⇒ Int): (A) ⇒ A
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  22. def contains[A1 >: A](elem: A1): Boolean
    Definition Classes
    SeqLike
  23. def containsSlice[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike
  24. def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  25. def copyToArray[B >: A](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  26. def copyToArray[B >: A](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  27. def copyToBuffer[B >: A](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  28. def corresponds[B](that: GenSeq[B])(p: (A, B) ⇒ Boolean): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  29. def count(p: (A) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  30. def diff[B >: A](that: GenSeq[B]): DArray[A]
    Definition Classes
    SeqLike → GenSeqLike
  31. def distinct: DArray[A]
    Definition Classes
    SeqLike → GenSeqLike
  32. def drop(n: Int): DArray[A]
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  33. def dropRight(n: Int): DArray[A]
    Definition Classes
    IndexedSeqOptimized → IterableLike
  34. def dropWhile(p: (A) ⇒ Boolean): DArray[A]
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  35. def endsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  36. def equals(that: Any): Boolean
    Definition Classes
    GenSeqLike → Equals → Any
  37. def exists(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  38. 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

  39. def filter(p: (A) ⇒ Boolean): DArray[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  40. def filterNot(p: (A) ⇒ Boolean): DArray[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  41. def find(p: (A) ⇒ Boolean): Option[A]
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  42. def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[DArray[A], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  43. def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): DArray[B]
    Definition Classes
    GenericTraversableTemplate
  44. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  45. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B
    Definition Classes
    IndexedSeqOptimized → TraversableOnce → GenTraversableOnce
  46. def foldRight[B](z: B)(op: (A, B) ⇒ B): B
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
  47. def forall(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  48. def foreach[U](f: (A) ⇒ U): Unit

    Iterate over the DArray element by element.

    Iterate over the DArray element by element.

    f

    the function to apply

    Definition Classes
    DArray → IndexedSeqOptimized → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  49. def genericBuilder[B]: Builder[B, DArray[B]]
    Definition Classes
    GenericTraversableTemplate
  50. def groupBy[K](f: (A) ⇒ K): Map[K, DArray[A]]
    Definition Classes
    TraversableLike → GenTraversableLike
  51. def grouped(size: Int): Iterator[DArray[A]]
    Definition Classes
    IterableLike
  52. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  53. def hashCode(): Int
    Definition Classes
    IndexedSeqLike → GenSeqLike → Any
  54. def head: A
    Definition Classes
    IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
  55. def headOption: Option[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  56. def indexOf[B >: A](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  57. def indexOf[B >: A](elem: B): Int
    Definition Classes
    GenSeqLike
  58. def indexOfSlice[B >: A](that: GenSeq[B], from: Int): Int
    Definition Classes
    SeqLike
  59. def indexOfSlice[B >: A](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  60. def indexWhere(p: (A) ⇒ Boolean, from: Int): Int
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  61. def indexWhere(p: (A) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  62. def indices: Range
    Definition Classes
    SeqLike
  63. def init: DArray[A]
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  64. def inits: Iterator[DArray[A]]
    Definition Classes
    TraversableLike
  65. def intersect[B >: A](that: GenSeq[B]): DArray[A]
    Definition Classes
    SeqLike → GenSeqLike
  66. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    GenSeqLike
  67. def isEmpty: Boolean
    Definition Classes
    IndexedSeqOptimized → SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  68. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  69. def iterator: Iterator[A]
    Definition Classes
    IndexedSeqLike → IterableLike → GenIterableLike
  70. def last: A
    Definition Classes
    IndexedSeqOptimized → TraversableLike → GenTraversableLike
  71. def lastIndexOf[B >: A](elem: B, end: Int): Int
    Definition Classes
    GenSeqLike
  72. def lastIndexOf[B >: A](elem: B): Int
    Definition Classes
    GenSeqLike
  73. def lastIndexOfSlice[B >: A](that: GenSeq[B], end: Int): Int
    Definition Classes
    SeqLike
  74. def lastIndexOfSlice[B >: A](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  75. def lastIndexWhere(p: (A) ⇒ Boolean, end: Int): Int
    Definition Classes
    IndexedSeqOptimized → SeqLike → GenSeqLike
  76. def lastIndexWhere(p: (A) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  77. def lastOption: Option[A]
    Definition Classes
    TraversableLike → GenTraversableLike
  78. def length: Int

    Return the length of 'this' DArray.

    Return the length of 'this' DArray.

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

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

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

    Convert 'this' DArray to a string.

    Convert 'this' DArray to a string. FIX - clean up

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

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

  149. def union[B >: A, That](that: GenSeq[B])(implicit bf: CanBuildFrom[DArray[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  150. def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (DArray[A1], DArray[A2])
    Definition Classes
    GenericTraversableTemplate
  151. def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (DArray[A1], DArray[A2], DArray[A3])
    Definition Classes
    GenericTraversableTemplate
  152. def update(i: 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.

    i

    the given index

    elem

    the value to assign

    Definition Classes
    DArray → IndexedSeqLike
  153. def updated[B >: A, That](index: Int, elem: B)(implicit bf: CanBuildFrom[DArray[A], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  154. def view(from: Int, until: Int): IndexedSeqView[A, DArray[A]]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  155. def view: IndexedSeqView[A, DArray[A]]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  156. def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, DArray[A]]
    Definition Classes
    TraversableLike → FilterMonadic
  157. def zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[DArray[A], (A1, B), That]): That
    Definition Classes
    IndexedSeqOptimized → IterableLike → GenIterableLike
  158. def zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[DArray[A], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  159. def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[DArray[A], (A1, Int), That]): That
    Definition Classes
    IndexedSeqOptimized → IterableLike → GenIterableLike