blob: 03f6031312f250c150d3d4be3e7644a7a1e75a03 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
|
/* __ *\
** ________ ___ / / ___ Scala API **
** / __/ __// _ | / / / _ | (c) 2003, LAMP/EPFL **
** __\ \/ /__/ __ |/ /__/ __ | **
** /____/\___/_/ |_/____/_/ | | **
** |/ **
** $Id$
\* */
package scala;
/** Class <code>Seq[A]</code> represents finite sequences of elements
* of type <code>A</code>.
*
* @author Martin Odersky
* @author Matthias Zenger
* @version 1.0, 16/07/2003
*/
trait SeqProxy[+A] extends Seq[A] with IterableProxy[A] {
def self: Seq[A];
/** Returns the length of the sequence.
*
* @return the sequence length.
*/
def length: Int = self.length;
/** Access element number <code>n</code>.
*
* @return the element at index <code>n</code>.
*/
def apply(n: Int): A = self.apply(n);
/** Is this partial function defined for the index <code>x</code>?
*
* @return true, iff <code>x</code> is a legal sequence index.
*/
override def isDefinedAt(y: Int): Boolean = self.isDefinedAt(y);
/** Returns the index of the first occurence of the specified
* object in this sequence.
*
* @param elem element to search for.
* @return the index in this sequence of the first occurence of the specified
* element, or -1 if the sequence does not contain this element.
*/
override def indexOf[B >: A](elem: B): Int = self.indexOf(elem);
/** Returns the index of the last occurence of the specified
* element in this sequence, or -1 if the sequence does not
* contain this element.
*
* @param elem element to search for.
* @return the index in this sequence of the last occurence of the
* specified element, or -1 if the sequence does not contain
* this element.
*/
override def lastIndexOf[B >: A](elem: B): Int = self.lastIndexOf(elem);
/** Returns the sub-sequence starting from index <code>n</code>.
*/
override def take(n: Int): Seq[A] = self.take(n);
/** Returns a new sub-sequence that drops the first <code>n</code>
* elements of this sequence.
*/
override def drop(n: Int): Seq[A] = self.drop(n);
/** Returns a subsequence starting from index <code>from</code>
* consisting of <code>len</code> elements.
*/
override def subseq(from: Int, len: Int): Seq[A] = self.subseq(from, len);
/** Fills the given array <code>xs</code> with the elements of
* this sequence starting at position <code>start</code>.
*
* @param xs the array to fill.
* @param start starting index.
* @return the given array <code>xs</code> filled with the elements
* of this sequence.
*/
override def copyToArray[B >: A](xs: Array[B], start: Int): Array[B] = self.copyToArray(xs, start);
/** Transform this sequence into a list of all elements.
*
* @return a list which enumerates all elements of this sequence.
*/
override def toList: List[A] = self.toList;
}
|
