[B >: A](that : Iterable[B]) : RandomAccessSeq[B]
Appends two iterable objects.
(from : Int) : RandomAccessSeq[A]
Returns this sequence without its
(p : (A) => Boolean) : (RandomAccessSeq[A], RandomAccessSeq[A])
Partitions this random access sequence in two random access sequences according to a predicate.
[B >: A](from0 : Int, patch0 : RandomAccessSeq[B], replaced0 : Int) : Projection[B]
returns a projection that can be used to call non-strict
A sequence consisting of all elements of this sequence in reverse order.
||self : RandomAccessSeq[A]|
(from : Int, until : Int) : RandomAccessSeq[A]
A sub-sequence starting at index
(until : Int) : RandomAccessSeq[A]
Returns a sequence consisting only over the first
Returns a stream containing all of the elements in this iterable object.
|Methods inherited from SeqProxy|
|apply, length, lengthCompare, size, isEmpty, concat, last, lastOption, first, firstOption, headOption, isDefinedAt, lastIndexOf, findIndexOf, indexOf, map, flatMap, filter, slice, takeWhile, dropWhile, contains, subseq, toArray, toSeq, equalsWith, startsWith, endsWith, indexOf, containsSlice|
|Methods inherited from IterableProxy|
|elements, foreach, forall, exists, find, foldLeft, foldRight, /:, :\, reduceLeft, reduceRight, copyToBuffer, sameElements, toList, mkString, mkString, mkString, addString, addString, addString, copyToArray, hasDefiniteSize|
|Methods inherited from Proxy|
|hashCode, equals, toString|
|Methods inherited from RandomAccessSeq|
|Methods inherited from Seq|
|Methods inherited from Collection|
|Methods inherited from PartialFunction|
|Methods inherited from Function1|
|Methods inherited from AnyRef|
|getClass, clone, notify, notifyAll, wait, wait, wait, finalize, ==, !=, eq, ne, synchronized|
|Methods inherited from Any|
|==, !=, isInstanceOf, asInstanceOf|
flatMapmethods that build projections of the collection.
nfirst elements If this sequence has less than
nelements, the empty sequence is returned. (non-strict)
n -the number of elements to drop
nelements of this sequence, or else the whole sequence, if it has less than
n -the number of elements to take
fromand ending (non-inclusive) at index
from -The index of the first element of the slice
until -The index of the element following the slice
from < 0or
length < from + len
p -the predicate on which to partition
pand the sequence of all elements that do not. The relative order of the elements in the resulting sequences is the same as in the original sequence.
defpatch[B >: A](from0 : Int, patch0 : RandomAccessSeq[B], replaced0 : Int) : Projection[B]
patchinto this sequence at
replacedelements. The result is a projection.
projectionfor lazy behavior.