Scala Library Documentation
|
|
scala/SeqProxy.scala
]
trait
SeqProxy[+A]
extends
Seq[A] with
IterableProxy[A]Method Summary | |
override def
|
apply (i : Int) : A |
override def
|
concat
[B >: A](that : Iterable[B]) : Seq[B]
Appends two iterable objects.
|
override def
|
contains
(elem : Any) : Boolean
Tests if the given value
elem is a member of this
sequence. |
override def
|
copyToArray
[B >: A](xs : Array[B], start : Int) : Unit
Fills the given array
xs with the elements of
this sequence starting at position start . |
override def
|
drop
(n : Int) : Seq[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
|
dropWhile
(p : (A) => Boolean) : Seq[A]
Returns the longest suffix of this sequence whose first element
does not satisfy the predicate
p . |
override def
|
filter
(p : (A) => Boolean) : Seq[A]
Returns all the elements of this sequence that satisfy the
predicate
p . The order of the elements is preserved. |
override def
|
flatMap
[B](f : (A) => Iterable[B]) : Seq[B]
Applies the given function
f to each element of
this sequence, then concatenates the results. |
override def
|
isDefinedAt
(x : Int) : Boolean
Is this partial function defined for the index
x ? |
override def
|
isEmpty
: Boolean
Returns true if length == 0
|
override def
|
lastIndexOf
[B >: A](elem : B) : Int
Returns the index of the last occurence of the specified element
in this sequence, or -1 if the sequence does not contain this element.
|
override def
|
length
: Int
Returns the length of the sequence.
|
override def
|
map
[B](f : (A) => B) : Seq[B]
Returns the sequence resulting from applying the given function
f to each element of this sequence. |
override def
|
reverse
: Seq[A]
A sequence consisting of all elements of this sequence in reverse order.
|
abstract def
|
self : Seq[A] |
override def
|
slice
(from : Int, len : Int) : Seq[A]
A sub-sequence of
len elements
starting at index from (non-strict) |
override def
|
take
(n : Int) : Seq[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
|
takeWhile
(p : (A) => Boolean) : Seq[A]
Returns the longest prefix of this sequence whose elements satisfy
the predicate
p . |
override def
|
toArray
[B >: A] : Array[B]
Converts this sequence to a fresh Array with
length elements. |
Methods inherited from IterableProxy | |
elements, foreach, forall, exists, find, findIndexOf, indexOf, foldLeft, foldRight, /:, :\, reduceLeft, reduceRight, sameElements, copyToBuffer, toList, mkString, addString |
Methods inherited from Proxy | |
hashCode, equals, toString |
Methods inherited from Seq | |
lengthCompare, size, last, lastOption, headOption, ++, subseq, projection, equalsWith, startsWith, endsWith, indexOf, containsSlice |
Methods inherited from Collection | |
stringPrefix |
Methods inherited from Iterable | |
partition, toStream, mkString, mkString, addString, hasDefiniteSize |
Methods inherited from PartialFunction | |
orElse, andThen |
Methods inherited from Function1 | |
compose |
Methods inherited from AnyRef | |
getClass, clone, notify, notifyAll, wait, wait, wait, finalize, ==, !=, eq, ne, synchronized |
Methods inherited from Any | |
==, !=, isInstanceOf, asInstanceOf |
Method Details |
override
def
length : Int
override
def
isEmpty : Boolean
++
insteadx
?x -
..true
, iff x
is a legal sequence index.elem -
element to search for.f
to each element of this sequence.f -
function to apply to each element.f(a0), ..., f(an)
if this sequence is a0, ..., an
.f
to each element of
this sequence, then concatenates the results.f -
the function to apply on each element.f(a0) ::: ... ::: f(an)
if this sequence is a0, ..., an
.p
. The order of the elements is preserved.p -
the predicate used to filter the list.p
.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 taken
first elements
If this sequence has less than n
elements, the empty
sequence is returned. (non-strict)n -
the number of elements to dropp
.p -
the test predicate.p
.p
.p -
the test predicate.p
.elem
is a member of this
sequence.elem -
element whose membership has to be tested.true
iff there is an element of this sequence which is equal (w.r.t. ==
) to elem
.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
length
elements.xs
with the elements of
this sequence starting at position start
.xs -
the array to fill.start -
starting index.
Scala Library Documentation
|
|