|
Scala Library Documentation
|
|
scala/RandomAccessSeq.scala]
trait
RandomAccessSeq[+A]
extends Seq[A]| Method Summary | |
override def
|
++
[B >: A](that : Iterable[B]) : RandomAccessSeq[B]
Appends two iterable objects.
|
override def
|
drop
(from : Int) : RandomAccessSeq[A]
Returns this sequence without its
n first elements
If this sequence has less than n elements, the empty
sequence is returned. (non-strict) |
override def
|
elements
: Iterator[A]
Creates a new iterator over all elements contained in this
object.
|
def
|
patch
[B >: A](from0 : Int, patch0 : RandomAccessSeq[B], replaced0 : Int) : Projection[B]
insert segment
patch into this sequence at from
replacing replaced elements. The result is a projection. |
override def
|
projection
: Projection[A]
returns a projection that can be used to call non-strict
filter,
map, and flatMap methods that build projections
of the collection. |
override def
|
reverse
: Seq[A]
A sequence consisting of all elements of this sequence in reverse order.
|
final def
|
safeIs
(idx : Int, a : Any) : Boolean
will return false if index is out of bounds
|
override def
|
slice
(from0 : Int, until0 : Int) : RandomAccessSeq[A]
A sub-sequence of
len elements
starting at index from (non-strict) |
override def
|
take
(until : Int) : RandomAccessSeq[A]
Returns a sequence consisting only over the first
n
elements of this sequence, or else the whole sequence, if it has less
than n elements. (non-strict) |
override def
|
toStream
: Stream[A]
Create a stream which contains all the elements of this iterable object.
|
| Methods inherited from Seq | |
| length (abstract), lengthCompare, size, isEmpty, concat, last, lastOption, headOption, isDefinedAt, lastIndexOf, map, flatMap, filter, takeWhile, dropWhile, contains, subseq, toArray, equalsWith, startsWith, endsWith, indexOf, containsSlice |
| Methods inherited from Collection | |
| toString, stringPrefix |
| Methods inherited from Iterable | |
| partition, foreach, forall, exists, find, findIndexOf, indexOf, foldLeft, foldRight, /:, :\, reduceLeft, reduceRight, copyToBuffer, sameElements, toList, mkString, mkString, mkString, addString, addString, copyToArray, hasDefiniteSize |
| Methods inherited from PartialFunction | |
| orElse, andThen |
| Methods inherited from Function1 | |
| apply (abstract), compose |
| Methods inherited from AnyRef | |
| getClass, hashCode, equals, clone, notify, notifyAll, wait, wait, wait, finalize, ==, !=, eq, ne, synchronized |
| Methods inherited from Any | |
| ==, !=, isInstanceOf, asInstanceOf |
| Method Details |
override
def
projection : Projection[A]
filter,
map, and flatMap methods that build projections
of the collection.override
def
drop(from : Int) : RandomAccessSeq[A]
n first elements
If this sequence has less than n elements, the empty
sequence is returned. (non-strict)n - the number of elements to dropoverride
def
take(until : Int) : RandomAccessSeq[A]
n
elements of this sequence, or else the whole sequence, if it has less
than n elements. (non-strict)n - the number of elements to takeoverride
def
slice(from0 : Int, until0 : Int) : RandomAccessSeq[A]
len elements
starting at index from (non-strict)from - The index of the first element of the sliceuntil - The index of the element following the sliceIndexOutOfBoundsException - if from < 0 or length < from + len
def
patch[B >: A](from0 : Int, patch0 : RandomAccessSeq[B], replaced0 : Int) : Projection[B]
patch into this sequence at from
replacing replaced elements. The result is a projection.override
def
++[B >: A](that : Iterable[B]) : RandomAccessSeq[B]
projection for lazy behavior.|
Scala Library Documentation
|
|