final class MM_ArrayQ extends AbstractSeq[Rational] with IndexedSeq[Rational] with Serializable with Cloneable
The MM_ArrayQ
class provides support for large, persistent arrays via memory
mapped files. Currently, the size of a memory mapped array is limited to
2GB (2^31), since indices are signed 32-bit integers.
FIX: use Long for indices and multiple files to remove 2GB limitation
- See also
https://github.com/xerial/larray/blob/develop/README.md
- Alphabetic
- By Inheritance
- MM_ArrayQ
- Serializable
- IndexedSeq
- IndexedSeqLike
- IndexedSeq
- IndexedSeqLike
- AbstractSeq
- Seq
- SeqLike
- Cloneable
- Cloneable
- Cloneable
- Iterable
- Traversable
- Mutable
- AbstractSeq
- Seq
- SeqLike
- GenSeq
- GenSeqLike
- PartialFunction
- Function1
- AbstractIterable
- Iterable
- IterableLike
- Equals
- GenIterable
- GenIterableLike
- AbstractTraversable
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
MM_ArrayQ(_length: Int)
- _length
the number of elements in the
mem_mapped
array
Type Members
-
class
Elements extends AbstractIterator[A] with BufferedIterator[A] with Serializable
- Attributes
- protected
- Definition Classes
- IndexedSeqLike
- Annotations
- @SerialVersionUID()
-
type
Self = IndexedSeq[Rational]
- 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 >: Rational, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[Rational], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: Rational, That](that: Traversable[B])(implicit bf: CanBuildFrom[IndexedSeq[Rational], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: Rational, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[Rational], B, That]): That
- Definition Classes
- TraversableLike
-
def
+:[B >: Rational, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Rational], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
/:[B](z: B)(op: (B, Rational) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:+[B >: Rational, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Rational], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
:\[B](z: B)(op: (Rational, 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, Rational) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
andThen[C](k: (Rational) ⇒ C): PartialFunction[Int, C]
- Definition Classes
- PartialFunction → Function1
-
def
apply(index: Int): Rational
Get the bytes in the file starting at 'index'.
Get the bytes in the file starting at 'index'.
- index
the index position in the file
- Definition Classes
- MM_ArrayQ → SeqLike → GenSeqLike → Function1
-
def
applyOrElse[A1 <: Int, B1 >: Rational](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(): Seq[Rational]
- Definition Classes
- Cloneable → AnyRef
-
def
close(): Unit
Close the memory mapped file.
-
def
collect[B, That](pf: PartialFunction[Rational, B])(implicit bf: CanBuildFrom[IndexedSeq[Rational], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[Rational, B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
combinations(n: Int): Iterator[IndexedSeq[Rational]]
- Definition Classes
- SeqLike
-
def
companion: GenericCompanion[IndexedSeq]
- Definition Classes
- IndexedSeq → IndexedSeq → Seq → Seq → GenSeq → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
-
def
compose[A](g: (A) ⇒ Int): (A) ⇒ Rational
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
contains(x: Rational): Boolean
Determine whether element 'x' is contained in this array.
Determine whether element 'x' is contained in this array.
- x
the element sought
-
def
contains[A1 >: Rational](elem: A1): Boolean
- Definition Classes
- SeqLike
-
def
containsSlice[B](that: GenSeq[B]): Boolean
- Definition Classes
- SeqLike
-
def
copyToArray[B >: Rational](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: Rational](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: Rational](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: Rational](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
corresponds[B](that: GenSeq[B])(p: (Rational, B) ⇒ Boolean): Boolean
- Definition Classes
- SeqLike → GenSeqLike
-
def
count(p: (Rational) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
deep: IndexedSeq[Rational]
Create a sequence for 'this' array.
-
def
diff[B >: Rational](that: GenSeq[B]): IndexedSeq[Rational]
- Definition Classes
- SeqLike → GenSeqLike
-
def
distinct: IndexedSeq[Rational]
- Definition Classes
- SeqLike → GenSeqLike
-
def
drop(n: Int): IndexedSeq[Rational]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
dropRight(n: Int): IndexedSeq[Rational]
- Definition Classes
- IterableLike
-
def
dropWhile(p: (Rational) ⇒ Boolean): IndexedSeq[Rational]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
endsWith[B](that: GenSeq[B]): Boolean
- Definition Classes
- SeqLike → GenSeqLike
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
- Definition Classes
- GenSeqLike → Equals → Any
-
def
exists(p: (Rational) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
filter(p: (Rational) ⇒ Boolean): IndexedSeq[Rational]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterNot(p: (Rational) ⇒ Boolean): IndexedSeq[Rational]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: (Rational) ⇒ Boolean): Option[Rational]
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
flatMap[B, That](f: (Rational) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[Rational], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: (Rational) ⇒ GenTraversableOnce[B]): IndexedSeq[B]
- Definition Classes
- GenericTraversableTemplate
-
val
fname: String
The file name for this memory mapped files
-
def
fold[A1 >: Rational](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft(s0: Rational)(f: (Rational, Rational) ⇒ Rational): Rational
Fold left through 'this' array.
Fold left through 'this' array.
- s0
the initial value
- f
the function to apply
-
def
foldLeft[B](z: B)(op: (B, Rational) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: (Rational, B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
forall(p: (Rational) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: (Rational) ⇒ U): Unit
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
-
def
genericBuilder[B]: Builder[B, IndexedSeq[B]]
- Definition Classes
- GenericTraversableTemplate
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
groupBy[K](f: (Rational) ⇒ K): Map[K, IndexedSeq[Rational]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
grouped(size: Int): Iterator[IndexedSeq[Rational]]
- Definition Classes
- IterableLike
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
hashCode(): Int
- Definition Classes
- IndexedSeqLike → GenSeqLike → Any
-
def
head: Rational
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
headOption: Option[Rational]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
indexOf[B >: Rational](elem: B, from: Int): Int
- Definition Classes
- GenSeqLike
-
def
indexOf[B >: Rational](elem: B): Int
- Definition Classes
- GenSeqLike
-
def
indexOfSlice[B >: Rational](that: GenSeq[B], from: Int): Int
- Definition Classes
- SeqLike
-
def
indexOfSlice[B >: Rational](that: GenSeq[B]): Int
- Definition Classes
- SeqLike
-
def
indexWhere(p: (Rational) ⇒ Boolean, from: Int): Int
- Definition Classes
- SeqLike → GenSeqLike
-
def
indexWhere(p: (Rational) ⇒ Boolean): Int
- Definition Classes
- GenSeqLike
-
def
indices: Range
- Definition Classes
- SeqLike
-
def
init: IndexedSeq[Rational]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
inits: Iterator[IndexedSeq[Rational]]
- Definition Classes
- TraversableLike
-
def
intersect[B >: Rational](that: GenSeq[B]): IndexedSeq[Rational]
- Definition Classes
- SeqLike → GenSeqLike
-
def
isDefinedAt(idx: Int): Boolean
- Definition Classes
- GenSeqLike
-
def
isEmpty: Boolean
- Definition Classes
- 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[Rational]
- Definition Classes
- IndexedSeqLike → IterableLike → GenIterableLike
-
def
last: Rational
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastIndexOf[B >: Rational](elem: B, end: Int): Int
- Definition Classes
- GenSeqLike
-
def
lastIndexOf[B >: Rational](elem: B): Int
- Definition Classes
- GenSeqLike
-
def
lastIndexOfSlice[B >: Rational](that: GenSeq[B], end: Int): Int
- Definition Classes
- SeqLike
-
def
lastIndexOfSlice[B >: Rational](that: GenSeq[B]): Int
- Definition Classes
- SeqLike
-
def
lastIndexWhere(p: (Rational) ⇒ Boolean, end: Int): Int
- Definition Classes
- SeqLike → GenSeqLike
-
def
lastIndexWhere(p: (Rational) ⇒ Boolean): Int
- Definition Classes
- GenSeqLike
-
def
lastOption: Option[Rational]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
length: Int
Return the size of elements in the memory mapped file.
Return the size of elements in the memory mapped file.
- Definition Classes
- MM_ArrayQ → SeqLike → GenSeqLike
-
def
lengthCompare(len: Int): Int
- Definition Classes
- SeqLike
-
def
lift: (Int) ⇒ Option[Rational]
- Definition Classes
- PartialFunction
-
def
map(f: (Rational) ⇒ Rational): MM_ArrayQ
Map elements of 'this' array by applying the function 'f'.
Map elements of 'this' array by applying the function 'f'.
- f
the function to be applied
-
def
map[B, That](f: (Rational) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Rational], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
max[B >: Rational](implicit cmp: Ordering[B]): Rational
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: (Rational) ⇒ B)(implicit cmp: Ordering[B]): Rational
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
min[B >: Rational](implicit cmp: Ordering[B]): Rational
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: (Rational) ⇒ B)(implicit cmp: Ordering[B]): Rational
- 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
-
val
nBytes: Int
The number of bytes in this memory mapped file
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: Builder[Rational, IndexedSeq[Rational]]
- 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 >: Rational](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
- Definition Classes
- PartialFunction
-
def
padTo[B >: Rational, That](len: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Rational], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
par: ParSeq[Rational]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[Rational, ParSeq[Rational]]
- Attributes
- protected[this]
- Definition Classes
- SeqLike → SeqLike → TraversableLike → Parallelizable
-
def
partition(p: (Rational) ⇒ Boolean): (IndexedSeq[Rational], IndexedSeq[Rational])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
patch[B >: Rational, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[IndexedSeq[Rational], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
permutations: Iterator[IndexedSeq[Rational]]
- Definition Classes
- SeqLike
-
def
prefixLength(p: (Rational) ⇒ Boolean): Int
- Definition Classes
- GenSeqLike
-
def
product[B >: Rational](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: Rational](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: Rational](op: (B, Rational) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: Rational](op: (B, Rational) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: Rational](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: Rational](op: (Rational, B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: Rational](op: (Rational, B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
repr: IndexedSeq[Rational]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
reverse: IndexedSeq[Rational]
- Definition Classes
- SeqLike → GenSeqLike
-
def
reverseIterator: Iterator[Rational]
- Definition Classes
- SeqLike
-
def
reverseMap[B, That](f: (Rational) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Rational], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
reversed: List[Rational]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
runWith[U](action: (Rational) ⇒ U): (Int) ⇒ Boolean
- Definition Classes
- PartialFunction
-
def
sameElements[B >: Rational](that: GenIterable[B]): Boolean
- Definition Classes
- IterableLike → GenIterableLike
-
def
scan[B >: Rational, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IndexedSeq[Rational], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, Rational) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Rational], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: (Rational, B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Rational], 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: (Rational) ⇒ Boolean, from: Int): Int
- Definition Classes
- SeqLike → GenSeqLike
-
def
seq: IndexedSeq[Rational]
- Definition Classes
- IndexedSeq → IndexedSeq → IndexedSeqLike → Seq → Seq → GenSeq → GenSeqLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
def
size: Int
- Definition Classes
- SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- IndexedSeqLike → GenTraversableOnce
-
def
slice(from: Int, till: Int): MM_ArrayQ
Slice 'this' starting at 'from' and continuing until 'till'
Slice 'this' starting at 'from' and continuing until 'till'
- from
the starting index for the slice (inclusive)
- till
the ending index for the slice (exclusive)
- Definition Classes
- MM_ArrayQ → IterableLike → TraversableLike → GenTraversableLike
-
def
sliding(size: Int, step: Int): Iterator[IndexedSeq[Rational]]
- Definition Classes
- IterableLike
-
def
sliding(size: Int): Iterator[IndexedSeq[Rational]]
- Definition Classes
- IterableLike
-
def
sortBy[B](f: (Rational) ⇒ B)(implicit ord: Ordering[B]): IndexedSeq[Rational]
- Definition Classes
- SeqLike
-
def
sortWith(lt: (Rational, Rational) ⇒ Boolean): IndexedSeq[Rational]
- Definition Classes
- SeqLike
-
def
sorted[B >: Rational](implicit ord: Ordering[B]): IndexedSeq[Rational]
- Definition Classes
- SeqLike
-
def
span(p: (Rational) ⇒ Boolean): (IndexedSeq[Rational], IndexedSeq[Rational])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (IndexedSeq[Rational], IndexedSeq[Rational])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
startsWith[B](that: GenSeq[B], offset: Int): Boolean
- Definition Classes
- SeqLike → GenSeqLike
-
def
startsWith[B](that: GenSeq[B]): Boolean
- Definition Classes
- GenSeqLike
-
def
stringPrefix: String
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
sum[B >: Rational](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tail: IndexedSeq[Rational]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: Iterator[IndexedSeq[Rational]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): IndexedSeq[Rational]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
takeRight(n: Int): IndexedSeq[Rational]
- Definition Classes
- IterableLike
-
def
takeWhile(p: (Rational) ⇒ Boolean): IndexedSeq[Rational]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
thisCollection: IndexedSeq[Rational]
- Attributes
- protected[this]
- Definition Classes
- IndexedSeqLike → IndexedSeqLike → SeqLike → IterableLike → TraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Rational, Col[Rational]]): Col[Rational]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: Rational](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[A1 >: Rational]: Buffer[A1]
- Definition Classes
- IndexedSeqLike → TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: IndexedSeq[Rational]): IndexedSeq[Rational]
- Attributes
- protected[this]
- Definition Classes
- IndexedSeqLike → IndexedSeqLike → SeqLike → IterableLike → TraversableLike
-
def
toIndexedSeq: IndexedSeq[Rational]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: Iterable[Rational]
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[Rational]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toList: List[Rational]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[Rational, (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSeq: Seq[Rational]
- Definition Classes
- SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
-
def
toSet[B >: Rational]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: Stream[Rational]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
-
def
toString(): String
- Definition Classes
- SeqLike → TraversableLike → Any
-
def
toTraversable: Traversable[Rational]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[Rational]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
transform(f: (Rational) ⇒ Rational): MM_ArrayQ.this.type
- Definition Classes
- SeqLike
-
def
transpose[B](implicit asTraversable: (Rational) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[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 >: Rational, That](that: GenSeq[B])(implicit bf: CanBuildFrom[IndexedSeq[Rational], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
unzip[A1, A2](implicit asPair: (Rational) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: (Rational) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
- Definition Classes
- GenericTraversableTemplate
-
def
update(index: Int, x: Rational): Unit
Put the bytes in the file starting at 'index'.
Put the bytes in the file starting at 'index'.
- index
the index position in the file
- x
the double value to put
- Definition Classes
- MM_ArrayQ → IndexedSeqLike → SeqLike
-
def
updated[B >: Rational, That](index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Rational], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
view(from: Int, until: Int): IndexedSeqView[Rational, IndexedSeq[Rational]]
- Definition Classes
- IndexedSeqLike → SeqLike → IterableLike → TraversableLike
-
def
view: IndexedSeqView[Rational, IndexedSeq[Rational]]
- 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: (Rational) ⇒ Boolean): FilterMonadic[Rational, IndexedSeq[Rational]]
- Definition Classes
- TraversableLike → FilterMonadic
-
def
zip[A1 >: Rational, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[IndexedSeq[Rational], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipAll[B, A1 >: Rational, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[IndexedSeq[Rational], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipWithIndex[A1 >: Rational, That](implicit bf: CanBuildFrom[IndexedSeq[Rational], (A1, Int), That]): That
- Definition Classes
- IterableLike → GenIterableLike