Scala Library
|
|
trait
SequenceViewTemplate[+A, +Coll <: Sequence[Any], +This <: SequenceView[A, Coll] with
SequenceViewTemplate[A, Coll, This]]
extends
Sequence[A] with
SequenceTemplate[A, This] with
IterableView[A, Coll] with
IterableViewTemplate[A, Coll, This]Method Summary | |
protected override def
|
newAppended
[B >: A](that : Traversable[B]) : Transformed[B]
Boilerplate method, to override in each subclass
This method could be eliminated if Scala had virtual classes
|
protected override def
|
newDroppedWhile (p : (A) => Boolean) : Transformed[A] |
protected override def
|
newFiltered (p : (A) => Boolean) : Transformed[A] |
protected override def
|
newFlatMapped [B](f : (A) => Traversable[B]) : Transformed[B] |
protected override def
|
newMapped [B](f : (A) => B) : Transformed[B] |
protected def
|
newPatched [B >: A](_from : Int, _patch : Sequence[B], _replaced : Int) : Transformed[B] |
protected def
|
newReversed : Transformed[A] |
protected override def
|
newSliced (_from : Int, _until : Int) : Transformed[A] |
protected override def
|
newTakenWhile (p : (A) => Boolean) : Transformed[A] |
protected def
|
newZipped [B](that : Sequence[B]) : Transformed[(A, B)] |
override def
|
padTo
[B >: A, That](len : Int, elem : B)(implicit bf : BuilderFactory[B, That, This]) : That
Returns a new sequence of given length containing the elements of this sequence followed by zero
or more occurrences of given elements.
|
override def
|
patch
[B >: A, That](from : Int, patch : Sequence[B], replaced : Int)(implicit bf : BuilderFactory[B, That, This]) : That
A new sequence, consisting of all elements of current sequence
except that `replaced` elements starting from `from` are replaced
by `patch`.
|
override def
|
reverse
: This
A sequence of type
C consisting of all elements of
this sequence in reverse order. |
override def
|
zip
[A1 >: A, B, That](that : Sequence[B])(implicit bf : BuilderFactory[(A1, B), That, This]) : That
Returns an iterable formed from this iterable and another iterable
by combining corresponding elements in pairs.
If one of the two iterables is longer than the other, its remaining elements are ignored.
|
override def
|
zipAll
[B, A1 >: A, That](that : Sequence[B], thisElem : A1, thatElem : B)(implicit bf : BuilderFactory[(A1, B), That, This]) : That
Returns a iterable formed from this iterable and the specified iterable
that by associating each element of the former with
the element at the same position in the latter. |
override def
|
zipWithIndex
[A1 >: A, That](implicit bf : BuilderFactory[(A1, Int), That, This]) : That
Zips this iterable with its indices (startiong from 0).
|
Methods inherited from TraversableViewTemplate | |
underlying (abstract), newBuilder, force, ++, ++, map, flatMap, filter, init, drop, take, slice, dropWhile, takeWhile, span, splitAt |
Methods inherited from Sequence | |
companion |
Methods inherited from SequenceTemplate | |
length (abstract), apply (abstract), lengthCompare, size, isDefinedAt, segmentLength, prefixLength, indexWhere, indexWhere, findIndexOf, indexOf, indexOf, lastIndexOf, lastIndexOf, lastIndexWhere, lastIndexWhere, reverseIterator, reversedElements, startsWith, startsWith, endsWith, indexOfSeq, indexOfSeq, lastIndexOfSeq, lastIndexOfSeq, contains, union, diff, intersect, removeDuplicates, toSequence, indices, view, view, equals, toString, sortWith, findLastIndexOf, slice, equalsWith, containsSlice, projection |
Methods inherited from IterableTemplate | |
iterator (abstract), elements, foreach, isEmpty, foldRight, reduceRight, toIterable, head, takeRight, dropRight, sameElements, toStream, first, firstOption, toSeq |
Methods inherited from TraversableClass | |
genericBuilder, unzip, flatten, transpose |
Methods inherited from TraversableTemplate | |
thisCollection, nonEmpty, hasDefiniteSize, filterMap, filterNot, remove, partition, groupBy, forall, exists, count, find, foldLeft, /:, :\, reduceLeft, reduceLeftOption, reduceRightOption, headOption, tail, last, lastOption, copyToBuffer, copyToArray, copyToArray, toArray, toList, toSet, mkString, mkString, mkString, addString, addString, addString, stringPrefix |
Methods inherited from PartialFunction | |
orElse, andThen |
Methods inherited from Function1 | |
compose |
Methods inherited from AnyRef | |
getClass, hashCode, clone, notify, notifyAll, wait, wait, wait, finalize, ==, !=, eq, ne, synchronized |
Methods inherited from Any | |
==, !=, isInstanceOf, asInstanceOf |
Class Summary | |
trait
|
Appended
[B >: A] extends Transformed[B] with Appended[B]
|
trait
|
DroppedWhile
extends Transformed[A] with DroppedWhile
|
trait
|
Filtered
extends Transformed[A] with Filtered
|
trait
|
FlatMapped
[B] extends Transformed[B] with FlatMapped[B]
|
trait
|
Mapped
[B] extends Transformed[B] with Mapped[B]
|
trait
|
Patched
[B >: A] extends Transformed[B] with AnyRef
|
trait
|
Reversed
extends Transformed[A] with AnyRef
|
trait
|
Sliced
extends Transformed[A] with Sliced
pre: from >= 0
|
trait
|
TakenWhile
extends Transformed[A] with TakenWhile
|
trait
|
Transformed
[+B] extends SequenceView[B, Coll] with Transformed[B]
|
trait
|
Zipped
[B] extends Transformed[(A, B)] with AnyRef
|
Method Details |
protected override
def
newAppended[B >: A](that : Traversable[B]) : Transformed[B]
protected override
def
newMapped[B](f : (A) => B) : Transformed[B]
protected override
def
newFlatMapped[B](f : (A) => Traversable[B]) : Transformed[B]
protected override
def
newFiltered(p : (A) => Boolean) : Transformed[A]
protected override
def
newSliced(_from : Int, _until : Int) : Transformed[A]
protected override
def
newDroppedWhile(p : (A) => Boolean) : Transformed[A]
protected override
def
newTakenWhile(p : (A) => Boolean) : Transformed[A]
protected
def
newReversed : Transformed[A]
protected
def
newPatched[B >: A](_from : Int, _patch : Sequence[B], _replaced : Int) : Transformed[B]
protected
def
newZipped[B](that : Sequence[B]) : Transformed[(A, B)]
override
def
reverse : This
C
consisting of all elements of
this sequence in reverse order.this(length - 1), ..., this(0)
If random access is inefficient for the given sequence implementation,
this operation should be overridden.override
def
patch[B >: A, That](from : Int, patch : Sequence[B], replaced : Int)(implicit
bf : BuilderFactory[B, That, This]) : That
override
def
padTo[B >: A, That](len : Int, elem : B)(implicit
bf : BuilderFactory[B, That, This]) : That
override
def
zip[A1 >: A, B, That](that : Sequence[B])(implicit
bf : BuilderFactory[(A1, B), That, This]) : That
that -
The iterable providing the second half of each result pairoverride
def
zipWithIndex[A1 >: A, That](implicit
bf : BuilderFactory[(A1, Int), That, This]) : That
override
def
zipAll[B, A1 >: A, That](that : Sequence[B], thisElem : A1, thatElem : B)(implicit
bf : BuilderFactory[(A1, B), That, This]) : That
that
by associating each element of the former with
the element at the same position in the latter.that -
iterable that
may have a different length as the self iterable.thisElem -
element thisElem
is used to fill up the resulting iterable if the self iterable is shorter than
that
thatElem -
element thatElem
is used to fill up the resulting iterable if that
is shorter than
the self iterableSequence((a0,b0), ..., (an,bn), (elem,bn+1),
..., {elem,bm})
when [a0, ..., an] zip
[b0, ..., bm]
is
invoked where m > n
.
Scala Library
|
|