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.
-------------------------------------------------------------------------------------------
- Alphabetic
- By Inheritance
- DArray
- IndexedSeqOptimized
- IndexedSeqOptimized
- IndexedSeqLike
- IndexedSeq
- IndexedSeqLike
- Seq
- SeqLike
- GenSeq
- GenSeqLike
- Iterable
- IterableLike
- Equals
- GenIterable
- GenIterableLike
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- PartialFunction
- Function1
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
DArray(_length: Int = 32768)(implicit arg0: ClassTag[A])
- _length
the initial size of the array, defaults to 32768
Type Members
-
class
Elements extends AbstractIterator[A] with BufferedIterator[A] with Serializable
- Attributes
- protected
- Definition Classes
- IndexedSeqLike
- Annotations
- @SerialVersionUID()
-
type
Self = DArray[A]
- Attributes
- protected[this]
- Definition Classes
- TraversableLike
-
class
WithFilter extends FilterMonadic[A, Repr]
- Definition Classes
- TraversableLike
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[DArray[A], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[DArray[A], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[DArray[A], B, That]): That
- Definition Classes
- TraversableLike
-
def
+:[B >: A, That](elem: B)(implicit bf: CanBuildFrom[DArray[A], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
/:[B](z: B)(op: (B, A) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:+[B >: A, That](elem: B)(implicit bf: CanBuildFrom[DArray[A], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
:\[B](z: B)(op: (A, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
addString(b: StringBuilder): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
andThen[C](k: (A) ⇒ C): PartialFunction[Int, C]
- Definition Classes
- PartialFunction → Function1
-
def
apply(): Array[Array[A]]
Return the internal double array of the
DArray.
-
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
-
def
applyOrElse[A1 <: Int, B1 >: A](x: A1, default: (A1) ⇒ B1): B1
- Definition Classes
- PartialFunction
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
canEqual(that: Any): Boolean
- Definition Classes
- IterableLike → Equals
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[DArray[A], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[A, B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
combinations(n: Int): Iterator[DArray[A]]
- Definition Classes
- SeqLike
-
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
-
def
compose[A](g: (A) ⇒ Int): (A) ⇒ A
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
contains[A1 >: A](elem: A1): Boolean
- Definition Classes
- SeqLike
-
def
containsSlice[B](that: GenSeq[B]): Boolean
- Definition Classes
- SeqLike
-
def
copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: A](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: A](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: A](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
corresponds[B](that: GenSeq[B])(p: (A, B) ⇒ Boolean): Boolean
- Definition Classes
- SeqLike → GenSeqLike
-
def
count(p: (A) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
diff[B >: A](that: GenSeq[B]): DArray[A]
- Definition Classes
- SeqLike → GenSeqLike
-
def
distinct: DArray[A]
- Definition Classes
- SeqLike → GenSeqLike
-
def
drop(n: Int): DArray[A]
- Definition Classes
- IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
-
def
dropRight(n: Int): DArray[A]
- Definition Classes
- IndexedSeqOptimized → IterableLike
-
def
dropWhile(p: (A) ⇒ Boolean): DArray[A]
- Definition Classes
- IndexedSeqOptimized → TraversableLike → GenTraversableLike
-
def
endsWith[B](that: GenSeq[B]): Boolean
- Definition Classes
- IndexedSeqOptimized → SeqLike → GenSeqLike
-
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
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
- Definition Classes
- GenSeqLike → Equals → Any
-
def
exists(p: (A) ⇒ Boolean): Boolean
- Definition Classes
- IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
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
-
def
filter(p: (A) ⇒ Boolean): DArray[A]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterNot(p: (A) ⇒ Boolean): DArray[A]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: (A) ⇒ Boolean): Option[A]
- Definition Classes
- IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[DArray[A], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): DArray[B]
- Definition Classes
- GenericTraversableTemplate
-
def
fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, A) ⇒ B): B
- Definition Classes
- IndexedSeqOptimized → TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: (A, B) ⇒ B): B
- Definition Classes
- IndexedSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
-
def
forall(p: (A) ⇒ Boolean): Boolean
- Definition Classes
- IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
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
-
def
genericBuilder[B]: Builder[B, DArray[B]]
- Definition Classes
- GenericTraversableTemplate
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
groupBy[K](f: (A) ⇒ K): Map[K, DArray[A]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
grouped(size: Int): Iterator[DArray[A]]
- Definition Classes
- IterableLike
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
hashCode(): Int
- Definition Classes
- IndexedSeqLike → GenSeqLike → Any
-
def
head: A
- Definition Classes
- IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
-
def
headOption: Option[A]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
indexOf[B >: A](elem: B, from: Int): Int
- Definition Classes
- GenSeqLike
-
def
indexOf[B >: A](elem: B): Int
- Definition Classes
- GenSeqLike
-
def
indexOfSlice[B >: A](that: GenSeq[B], from: Int): Int
- Definition Classes
- SeqLike
-
def
indexOfSlice[B >: A](that: GenSeq[B]): Int
- Definition Classes
- SeqLike
-
def
indexWhere(p: (A) ⇒ Boolean, from: Int): Int
- Definition Classes
- IndexedSeqOptimized → SeqLike → GenSeqLike
-
def
indexWhere(p: (A) ⇒ Boolean): Int
- Definition Classes
- GenSeqLike
-
def
indices: Range
- Definition Classes
- SeqLike
-
def
init: DArray[A]
- Definition Classes
- IndexedSeqOptimized → TraversableLike → GenTraversableLike
-
def
initialSize: Int
Return the initial size of the
DArray
.Return the initial size of the
DArray
.- Attributes
- protected
-
def
inits: Iterator[DArray[A]]
- Definition Classes
- TraversableLike
-
def
intersect[B >: A](that: GenSeq[B]): DArray[A]
- Definition Classes
- SeqLike → GenSeqLike
-
def
isDefinedAt(idx: Int): Boolean
- Definition Classes
- GenSeqLike
-
def
isEmpty: Boolean
- Definition Classes
- IndexedSeqOptimized → SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
def
iterator: Iterator[A]
- Definition Classes
- IndexedSeqLike → IterableLike → GenIterableLike
-
def
last: A
- Definition Classes
- IndexedSeqOptimized → TraversableLike → GenTraversableLike
-
def
lastIndexOf[B >: A](elem: B, end: Int): Int
- Definition Classes
- GenSeqLike
-
def
lastIndexOf[B >: A](elem: B): Int
- Definition Classes
- GenSeqLike
-
def
lastIndexOfSlice[B >: A](that: GenSeq[B], end: Int): Int
- Definition Classes
- SeqLike
-
def
lastIndexOfSlice[B >: A](that: GenSeq[B]): Int
- Definition Classes
- SeqLike
-
def
lastIndexWhere(p: (A) ⇒ Boolean, end: Int): Int
- Definition Classes
- IndexedSeqOptimized → SeqLike → GenSeqLike
-
def
lastIndexWhere(p: (A) ⇒ Boolean): Int
- Definition Classes
- GenSeqLike
-
def
lastOption: Option[A]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
length: Int
Return the length of 'this'
DArray
.Return the length of 'this'
DArray
.- Definition Classes
- DArray → SeqLike → GenSeqLike
-
def
lengthCompare(len: Int): Int
- Definition Classes
- IndexedSeqOptimized → SeqLike
-
def
lift: (Int) ⇒ Option[A]
- Definition Classes
- PartialFunction
-
def
map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[DArray[A], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
max[B >: A](implicit cmp: Ordering[B]): A
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
min[B >: A](implicit cmp: Ordering[B]): A
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: Builder[A, DArray[A]]
- Attributes
- protected[this]
- Definition Classes
- GenericTraversableTemplate → HasNewBuilder
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
orElse[A1 <: Int, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
- Definition Classes
- PartialFunction
-
def
padTo[B >: A, That](len: Int, elem: B)(implicit bf: CanBuildFrom[DArray[A], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
par: ParSeq[A]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[A, ParSeq[A]]
- Attributes
- protected[this]
- Definition Classes
- SeqLike → TraversableLike → Parallelizable
-
def
partition(p: (A) ⇒ Boolean): (DArray[A], DArray[A])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
patch[B >: A, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[DArray[A], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
permutations: Iterator[DArray[A]]
- Definition Classes
- SeqLike
-
def
prefixLength(p: (A) ⇒ Boolean): Int
- Definition Classes
- GenSeqLike
-
def
product[B >: A](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: A](op: (B, A) ⇒ B): B
- Definition Classes
- IndexedSeqOptimized → TraversableOnce
-
def
reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: A](op: (A, B) ⇒ B): B
- Definition Classes
- IndexedSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
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
-
def
repr: DArray[A]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
reverse: DArray[A]
- Definition Classes
- IndexedSeqOptimized → SeqLike → GenSeqLike
-
def
reverseIterator: Iterator[A]
- Definition Classes
- IndexedSeqOptimized → SeqLike
-
def
reverseMap[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[DArray[A], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
reversed: List[A]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
runWith[U](action: (A) ⇒ U): (Int) ⇒ Boolean
- Definition Classes
- PartialFunction
-
def
sameElements[B >: A](that: GenIterable[B]): Boolean
- Definition Classes
- IndexedSeqOptimized → IterableLike → GenIterableLike
-
def
scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[DArray[A], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[DArray[A], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
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.
-
def
segmentLength(p: (A) ⇒ Boolean, from: Int): Int
- Definition Classes
- IndexedSeqOptimized → SeqLike → GenSeqLike
-
def
seq: IndexedSeq[A]
- Definition Classes
- IndexedSeq → IndexedSeqLike → Seq → GenSeq → GenSeqLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
def
size: Int
- Definition Classes
- SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
-
var
size0: Int
the current size of
DArray
.the current size of
DArray
.- Attributes
- protected
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- IndexedSeqLike → GenTraversableOnce
-
def
slice(from: Int, until: Int): DArray[A]
- Definition Classes
- IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
-
def
sliding(size: Int, step: Int): Iterator[DArray[A]]
- Definition Classes
- IterableLike
-
def
sliding(size: Int): Iterator[DArray[A]]
- Definition Classes
- IterableLike
-
def
sortBy[B](f: (A) ⇒ B)(implicit ord: Ordering[B]): DArray[A]
- Definition Classes
- SeqLike
-
def
sortWith(lt: (A, A) ⇒ Boolean): DArray[A]
- Definition Classes
- SeqLike
-
def
sorted[B >: A](implicit ord: Ordering[B]): DArray[A]
- Definition Classes
- SeqLike
-
def
span(p: (A) ⇒ Boolean): (DArray[A], DArray[A])
- Definition Classes
- IndexedSeqOptimized → TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (DArray[A], DArray[A])
- Definition Classes
- IndexedSeqOptimized → TraversableLike → GenTraversableLike
-
def
startsWith[B](that: GenSeq[B], offset: Int): Boolean
- Definition Classes
- IndexedSeqOptimized → SeqLike → GenSeqLike
-
def
startsWith[B](that: GenSeq[B]): Boolean
- Definition Classes
- GenSeqLike
-
def
stringPrefix: String
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
sum[B >: A](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tail: DArray[A]
- Definition Classes
- IndexedSeqOptimized → TraversableLike → GenTraversableLike
-
def
tails: Iterator[DArray[A]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): DArray[A]
- Definition Classes
- IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
-
def
takeRight(n: Int): DArray[A]
- Definition Classes
- IndexedSeqOptimized → IterableLike
-
def
takeWhile(p: (A) ⇒ Boolean): DArray[A]
- Definition Classes
- IndexedSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
-
def
thisCollection: IndexedSeq[A]
- Attributes
- protected[this]
- Definition Classes
- IndexedSeqLike → IndexedSeqLike → SeqLike → IterableLike → TraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[A1 >: A]: Buffer[A1]
- Definition Classes
- IndexedSeqLike → TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: DArray[A]): IndexedSeq[A]
- Attributes
- protected[this]
- Definition Classes
- IndexedSeqLike → IndexedSeqLike → SeqLike → IterableLike → TraversableLike
-
def
toIndexedSeq: IndexedSeq[A]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: Iterable[A]
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[A]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toList: List[A]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSeq: Seq[A]
- Definition Classes
- SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
-
def
toSet[B >: A]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: Stream[A]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
-
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
-
def
toTraversable: Traversable[A]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[A]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
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 anIllegalArgumentException
if collections are not uniformly sized.
-
def
union[B >: A, That](that: GenSeq[B])(implicit bf: CanBuildFrom[DArray[A], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (DArray[A1], DArray[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (DArray[A1], DArray[A2], DArray[A3])
- Definition Classes
- GenericTraversableTemplate
-
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
-
def
updated[B >: A, That](index: Int, elem: B)(implicit bf: CanBuildFrom[DArray[A], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
view(from: Int, until: Int): IndexedSeqView[A, DArray[A]]
- Definition Classes
- IndexedSeqLike → SeqLike → IterableLike → TraversableLike
-
def
view: IndexedSeqView[A, DArray[A]]
- Definition Classes
- IndexedSeqLike → SeqLike → IterableLike → TraversableLike
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, DArray[A]]
- Definition Classes
- TraversableLike → FilterMonadic
-
def
zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[DArray[A], (A1, B), That]): That
- Definition Classes
- IndexedSeqOptimized → IterableLike → GenIterableLike
-
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
-
def
zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[DArray[A], (A1, Int), That]): That
- Definition Classes
- IndexedSeqOptimized → IterableLike → GenIterableLike