Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
-
-
-
-
def
/:[B](z: B)(op: (B, T) ⇒ B): B
-
-
def
:\[B](z: B)(op: (T, B) ⇒ B): B
-
final
def
==(arg0: Any): Boolean
-
-
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B
-
-
def
apply(index: Int): T
-
def
applyOrElse[A1 <: Int, B1 >: T](x: A1, default: (A1) ⇒ B1): B1
-
final
def
asInstanceOf[T0]: T0
-
def
canEqual(that: Any): Boolean
-
def
clone(): AnyRef
-
-
-
-
-
def
compose[A](g: (A) ⇒ Int): (A) ⇒ T
-
def
contains[A1 >: T](elem: A1): Boolean
-
def
containsSlice[B](that: GenSeq[B]): Boolean
-
def
copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: T](xs: Array[B]): Unit
-
def
copyToArray[B >: T](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: T](dest: Buffer[B]): Unit
-
def
corresponds[B](that: GenSeq[B])(p: (T, B) ⇒ Boolean): Boolean
-
def
count(p: (T) ⇒ Boolean): Int
-
-
-
-
-
-
def
endsWith[B](that: GenSeq[B]): Boolean
-
-
-
-
-
-
def
finalize(): Unit
-
-
-
-
def
fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, T) ⇒ B): B
-
def
foldRight[B](z: B)(op: (T, B) ⇒ B): B
-
-
def
foreach[U](f: (T) ⇒ U): Unit
-
-
final
def
getClass(): Class[_]
-
-
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
def
head: T
-
def
headOption: Option[T]
-
def
indexOf[B >: T](elem: B, from: Int): Int
-
def
indexOf[B >: T](elem: B): Int
-
def
indexOfSlice[B >: T](that: GenSeq[B], from: Int): Int
-
def
indexOfSlice[B >: T](that: GenSeq[B]): Int
-
def
indexWhere(p: (T) ⇒ Boolean, from: Int): Int
-
def
indexWhere(p: (T) ⇒ Boolean): Int
-
def
indices: collection.immutable.Range
-
-
-
-
def
isDefinedAt(index: Int): Boolean
-
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
-
-
def
last: T
-
def
lastIndexOf[B >: T](elem: B, end: Int): Int
-
def
lastIndexOf[B >: T](elem: B): Int
-
def
lastIndexOfSlice[B >: T](that: GenSeq[B], end: Int): Int
-
def
lastIndexOfSlice[B >: T](that: GenSeq[B]): Int
-
def
lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int
-
def
lastIndexWhere(p: (T) ⇒ Boolean): Int
-
def
lastOption: Option[T]
-
def
length: Int
-
def
lengthCompare(len: Int): Int
-
-
-
def
max[B >: T](implicit cmp: Ordering[B]): T
-
def
maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
-
def
min[B >: T](implicit cmp: Ordering[B]): T
-
def
minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
-
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
def
padTo[B >: T, That](len: Int, elem: B)(implicit bf: CanBuildFrom[collection.IndexedSeq[T], B, That]): That
-
-
def
parCombiner: Combiner[T, ParSeq[T]]
-
-
-
-
def
prefixLength(p: (T) ⇒ Boolean): Int
-
def
product[B >: T](implicit num: Numeric[B]): B
-
def
reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: T](op: (B, T) ⇒ B): B
-
def
reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]
-
def
reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: T](op: (T, B) ⇒ B): B
-
def
reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]
-
-
-
-
def
reverseMap[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[collection.IndexedSeq[T], B, That]): That
-
def
reversed: List[T]
-
def
runWith[U](action: (T) ⇒ U): (Int) ⇒ Boolean
-
def
sameElements[B >: T](that: GenIterable[B]): Boolean
-
def
scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[collection.IndexedSeq[T], B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[collection.IndexedSeq[T], B, That]): That
-
def
scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[collection.IndexedSeq[T], B, That]): That
-
def
segmentLength(p: (T) ⇒ Boolean, from: Int): Int
-
-
def
size: Int
-
def
slice(start: Int): PagedSeq[T]
-
def
slice(_start: Int, _end: Int): PagedSeq[T]
-
-
-
-
-
-
-
-
def
startsWith[B](that: GenSeq[B], offset: Int): Boolean
-
def
startsWith[B](that: GenSeq[B]): Boolean
-
def
stringPrefix: String
-
def
sum[B >: T](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
-
-
-
-
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]
-
def
toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[A1 >: T]: Buffer[A1]
-
-
-
-
-
def
toList: List[T]
-
def
toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]
-
-
def
toSet[B >: T]: Set[B]
-
-
def
toString(): String
-
-
def
toVector: Vector[T]
-
-
-
-
-
def
updated[B >: T, That](index: Int, elem: B)(implicit bf: CanBuildFrom[collection.IndexedSeq[T], B, That]): That
-
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
-
-
def
zipAll[B, A1 >: T, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[collection.IndexedSeq[T], (A1, B), That]): That
-
Inherited from ScalaVersionSpecificPagedSeq[T]
Inherited from HasNewBuilder[T, IndexedSeq[T] @scala.annotation.unchecked.uncheckedVariance]
An implementation of lazily computed sequences, where elements are stored in "pages", i.e. arrays of fixed size.
A paged sequence is constructed from a function that produces more elements when asked. The producer function -
more
, is similar to the read method in java.io.Reader. Themore
function takes three parameters: an array of elements, a start index, and an end index. It should try to fill the array between start and end indices (excluding end index). It returns the number of elements produced, or -1 if end of logical input stream was reached before reading any element.the type of the elements contained in this paged sequence, with an
ClassTag
context bound.