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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
|
/* __ *\
** ________ ___ / / ___ Scala API **
** / __/ __// _ | / / / _ | (c) 2003-2008, LAMP/EPFL **
** __\ \/ /__/ __ |/ /__/ __ | http://scala-lang.org/ **
** /____/\___/_/ |_/____/_/ | | **
** |/ **
\* */
// $Id$
package scala
import Predef._
import collection.mutable.ArrayBuffer
object Seq {
/** The empty sequence */
val empty : Seq[Nothing] = RandomAccessSeq.empty
/** This method is called in a pattern match { case Seq(...) => }.
*
* @param x the selector value
* @return sequence wrapped in an option, if this is a Seq, otherwise none
*/
def unapplySeq[A](x: Seq[A]): Some[Seq[A]] = Some(x)
/** Create read only sequence of specified elements */
def apply[A](xs: A*): Seq[A] = RandomAccessSeq(xs: _*)
case class singleton[A](value: A) extends RandomAccessSeq[A] {
override def length = 1
override def isDefinedAt(idx: Int): Boolean = idx == 0
override def apply(idx: Int) = idx match {
case 0 => value
case _ => throw new Predef.IndexOutOfBoundsException
}
}
/** Builds a singleton sequence.
*
* @deprecated use <code>singleton</code> instead.
*/
@deprecated def single[A](x: A) = singleton(x)
trait Projection[+A] extends Seq[A] with Iterable.Projection[A] {
override def projection = this
override def force : Seq[A] = toList
override def map[B](f: A => B) : Projection[B] = new MapProjection(f)
protected class MapProjection[B](f : A => B) extends Projection[B] {
def length = Projection.this.length
def elements = Projection.this.elements.map(f)
def apply(idx : Int) = f(Projection.this.apply(idx))
override def stringPrefix = Projection.this.stringPrefix + "M"
}
override def flatMap[B](f: A => Iterable[B]): Projection[B] = new Projection[B] {
override def stringPrefix = Projection.this.stringPrefix + "G"
def elements = Projection.this.elements.flatMap(a => f(a).elements)
def length = {
var sz = 0
Projection.this.foreach(a => sz = sz + f(a).asInstanceOf[Collection[B]].size)
sz
}
def apply(idx : Int) : B = {
var jdx = 0
Projection.this.foreach(a => {
val i = f(a)
val length = i.asInstanceOf[Collection[B]].size
if (idx < jdx + length) {
val j = i.elements
while (jdx < idx) {
j.next; jdx += 1
}
return j.next
} else jdx += length
})
throw new IndexOutOfBoundsException
}
}
override def append[B >: A](that: => Iterable[B]): Projection[B] = that match {
case that: Seq[b] => new Projection[B] {
def length = Projection.this.length + that.length
def elements : Iterator[B] = Projection.this.elements ++ (that.elements:Iterator[B])
def apply(idx : Int) =
if (idx < Projection.this.length) Projection.this(idx)
else that(idx - Projection.this.length)
}
case that =>
(this ++ that).projection // sucks but no other option.
}
protected abstract class ComputeSize[B] extends Projection[B] {
def apply(idx: Int): B = {
var sz = 0
val i = elements
while (i.hasNext) {
val ret = i.next
if (sz == idx) return ret
sz += 1
}
throw new Predef.IndexOutOfBoundsException
}
override def length: Int = {
val i = elements
var sz = 0
while (i.hasNext) {
sz += 1
i.next
}
sz
}
}
override def takeWhile(p: A => Boolean): Projection[A] = new ComputeSize[A] {
override def stringPrefix = Projection.this.stringPrefix + "TW"
override def elements = Projection.this.elements.takeWhile(p)
}
override def filter(p : A => Boolean) : Projection[A] = new ComputeSize[A] {
override def stringPrefix = Projection.this.stringPrefix + "F"
override def elements = Projection.this.elements.filter(p)
}
}
}
/** 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 Seq[+A] extends AnyRef with PartialFunction[Int, A] with Collection[A] {
/** Returns the length of the sequence.
*
* @return the sequence length.
*/
def length: Int
/** Result of comparing <code>length</code> with operand <code>l</code>.
* returns <code>x</code> where
* <code>x < 0</code> iff <code>this.length < l</code>
* <code>x == 0</code> iff <code>this.length == l</code>
* <code>x > 0</code> iff <code>this.length > that</code>.
*
* This method is used by matching streams against right-ignoring (...,_*) patterns.
* Lazy sequences should override this method if length forces evaluation of the stream.
*/
def lengthCompare(l: Int): Int = length - l
/** should always be <code>length</code> */
def size = length
/** Returns true if length == 0
*/
override def isEmpty: Boolean = { length == 0 }
/** Appends two iterable objects.
*
* @return the new iterable object
* @deprecated use <code>++</code> instead
*/
@deprecated
override def concat [B >: A](that: Iterable[B]): Seq[B] = {
val buf = new ArrayBuffer[B]
this copyToBuffer buf
that copyToBuffer buf
buf.readOnly
}
/** Returns the last element of this list.
*
* @return the last element of the list.
* @throws Predef.NoSuchElementException if the list is empty.
*/
def last: A = length match {
case 0 => throw new Predef.NoSuchElementException
case n => this(n - 1)
}
/** Returns as an option the last element of this list or
* <code>None</code> if list is empty.
*
* @return the last element as an option.
*/
def lastOption: Option[A] = length match {
case 0 => None
case n => Some(this(n-1))
}
/** Returns the first element of this list.
*
* @return the first element of the list.
* @throws Predef.UnsupportedOperationException if the list is empty.
*/
def first: A =
if (isEmpty) throw new Predef.NoSuchElementException
else this(0)
/** Returns as an option the first element of this list or
* <code>None</code> if list is empty.
*
* @return the first element as an option.
*/
def firstOption: Option[A] = if (isEmpty) None else Some(apply(0))
@deprecated
def headOption: Option[A] = firstOption
/** Appends two iterable objects.
*/
override def ++ [B >: A](that: Iterable[B]): Seq[B] = {
val buf = new ArrayBuffer[B]
this copyToBuffer buf
that copyToBuffer buf
buf.readOnly
}
/** Is this partial function defined for the index <code>x</code>?
*
* @param x ..
* @return <code>true</code>, iff <code>x</code> is a legal sequence index.
*/
def isDefinedAt(x: Int): Boolean = (x >= 0) && (x < length)
/** 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.
*/
def lastIndexOf[B >: A](elem: B): Int = {
var i = length
var found = false
while (!found && (i > 0)) {
i -= 1
if (this(i) == elem) found = true
}
if (found) i else -1
}
/** Returns index of the first element satisying a predicate, or -1.
*
* @note may not terminate for infinite-sized collections.
* @param p the predicate
* @return the index of the first element satisfying <code>p</code>,
* or -1 if such an element does not exist
*/
override def findIndexOf(p: A => Boolean): Int =
elements.findIndexOf(p)
/** Returns the index of the first occurence of the specified
* object in this iterable object.
*
* @note may not terminate for infinite-sized collections.
* @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 =
elements.indexOf(elem)
/** Returns the sequence resulting from applying the given function
* <code>f</code> to each element of this sequence.
*
* @param f function to apply to each element.
* @return <code>f(a<sub>0</sub>), ..., f(a<sub>n</sub>)</code> if this
* sequence is <code>a<sub>0</sub>, ..., a<sub>n</sub></code>.
*/
override def map[B](f: A => B): Seq[B] = {
// todo: malformed scala signature suing build when replaced by
// super.map(f).asInstanceOf[Seq[B2]]
val buf = new ArrayBuffer[B]
val elems = elements
while (elems.hasNext) buf += f(elems.next)
buf.readOnly
}
/** Applies the given function <code>f</code> to each element of
* this sequence, then concatenates the results.
*
* @param f the function to apply on each element.
* @return <code>f(a<sub>0</sub>) ::: ... ::: f(a<sub>n</sub>)</code> if
* this sequence is <code>a<sub>0</sub>, ..., a<sub>n</sub></code>.
*/
override def flatMap[B](f: A => Iterable[B]): Seq[B] = {
val buf = new ArrayBuffer[B]
val elems = elements
while (elems.hasNext) f(elems.next) copyToBuffer buf
buf.readOnly
}
/** Returns all the elements of this sequence that satisfy the
* predicate <code>p</code>. The order of the elements is preserved.
*
* @param p the predicate used to filter the list.
* @return the elements of this list satisfying <code>p</code>.
*/
override def filter(p: A => Boolean): Seq[A] = super.filter(p).asInstanceOf[Seq[A]]
/** Returns a sequence consisting only over the first <code>n</code>
* elements of this sequence, or else the whole sequence, if it has less
* than <code>n</code> elements. (non-strict)
*
* @param n the number of elements to take
* @return a possibly projected sequence
*/
override def take(n: Int): Seq[A] = {
var m = 0
val result = new scala.collection.mutable.ListBuffer[A]
val i = elements
while (m < n && i.hasNext) {
result += i.next; m += 1
}
result.toList
}
/** Returns this sequence without its <code>n</code> first elements
* If this sequence has less than <code>n</code> elements, the empty
* sequence is returned. (non-strict)
*
* @param n the number of elements to drop
* @return the new sequence
*/
override def drop(n: Int): Seq[A] = {
import scala.collection.mutable.ListBuffer
var m = 0
val result = new ListBuffer[A]
val i = elements
while (m < n && i.hasNext) {
i.next; m += 1
}
while (i.hasNext) result += i.next
result.toList
}
/** A sub-sequence starting at index <code>from</code>
* and ending (non-inclusive) at index <code>until</code> (non-strict)
*
* @param from The index of the first element of the slice
* @param until The index of the element following the slice
* @throws IndexOutOfBoundsException if <code>from < 0</code>
* or <code>length < from + len<code>
*/
def slice(from: Int, until: Int): Seq[A] = drop(from).take(until - from)
/** A sub-sequence starting at index <code>from</code>
* and extending up to the length of the current sequence (non-strict)
*
* @param from The index of the first element of the slice
* @throws IndexOutOfBoundsException if <code>from < 0</code>
* @deprecated Use <code>drop(n: Int): Seq[A]</code> instead.
*/
@deprecated def slice(from: Int): Seq[A] = slice(from, length)
/** Returns the longest prefix of this sequence whose elements satisfy
* the predicate <code>p</code>.
*
* @param p the test predicate.
* @return the longest prefix of this sequence whose elements satisfy
* the predicate <code>p</code>.
*/
override def takeWhile(p: A => Boolean): Seq[A] = super.takeWhile(p).asInstanceOf[Seq[A]]
/** Returns the longest suffix of this sequence whose first element
* does not satisfy the predicate <code>p</code>.
*
* @param p the test predicate.
* @return the longest suffix of the sequence whose first element
* does not satisfy the predicate <code>p</code>.
*/
override def dropWhile(p: A => Boolean): Seq[A] = super.dropWhile(p).asInstanceOf[Seq[A]]
/** A sequence consisting of all elements of this sequence in reverse order.
*/
def reverse: Seq[A] = {
var result: List[A] = Nil
val elems = elements
while (elems.hasNext) result = elems.next :: result
result
}
/** Tests if the given value <code>elem</code> is a member of this
* sequence.
*
* @param elem element whose membership has to be tested.
* @return <code>true</code> iff there is an element of this sequence
* which is equal (w.r.t. <code>==</code>) to <code>elem</code>.
*/
def contains(elem: Any): Boolean = exists (_ == elem)
/** Returns a subsequence starting from index <code>from</code>
* consisting of <code>len</code> elements.
*
* @deprecated use <code>slice</code> instead
*/
@deprecated
def subseq(from: Int, end: Int): Seq[A] = slice(from, end - from)
/** Converts this sequence to a fresh Array with <code>length</code> elements.
*/
override def toArray[B >: A]: Array[B] = {
val result = new Array[B](length)
copyToArray(result, 0)
result
}
/**
* Overridden for efficiency.
*
* @return the sequence itself
*/
override def toSeq: Seq[A] = this
override def projection: Seq.Projection[A] = new Seq.Projection[A] {
override def force: Seq[A] = Seq.this
def elements = Seq.this.elements
def length = Seq.this.length
def apply(idx : Int) = (Seq.this.apply(idx))
override def stringPrefix = Seq.this.stringPrefix + "P"
}
def equalsWith[B](that: Seq[B])(f: (A,B) => Boolean): Boolean = {
if (size != that.size) return false
val i = elements
val j = that.elements
while (i.hasNext) if (!f(i.next, j.next)) return false
true
}
/**
* Checks whether the argument sequence is contained at the
* specified index within the receiver object.
*
* If the both the receiver object, <code>this</code> and
* the argument, <code>that</code> are infinite sequences
* this method may not terminate.
*
* @return true if <code>that</code> is contained in
* <code>this</code>, at the specified index, otherwise false
*
* @see String.startsWith
*/
def startsWith[B](that: Seq[B], offset: Int): Boolean = {
val i = elements.drop(offset)
val j = that.elements
var result = true
while (j.hasNext && i.hasNext && result)
result = i.next == j.next
result && !j.hasNext
}
/**
* Check whether the receiver object starts with the argument sequence.
*
* @return true if <code>that</code> is a prefix of <code>this</code>,
* otherwise false
*
* @see Seq.startsWith
*/
def startsWith[B](that: Seq[B]): Boolean = startsWith(that, 0)
/** @return true if this sequence end with that sequence
* @see String.endsWith
*/
def endsWith[B](that: Seq[B]): Boolean = {
val length = this.length
val j = that.elements
var i = 0
var result = true
while (result && i < length && j.hasNext)
result = apply(length - i - 1) == j.next
result && !j.hasNext
}
/**
* Searches for the argument sequence in the receiver object, returning
* the smallest index where a match occurs.
*
* If the receiver object, <code>this</code>, is an infinite sequence
* this method will not terminate if there is no match. Similarly, if
* the both the receiver object and the argument, <code>that</code> are
* infinite sequences this method will not terminate.
*
* Because both the receiver object and the argument can both potentially
* be an infinite sequences, we do not attempt to use an optimized
* searching algorithm. Therefore, the running time will be proportional
* to the length of the receiver object and the argument. Subclasses and
* traits can potentially provide an optimized implementation.
*
* @return -1 if <code>that</code> not contained in <code>this</code>,
* otherwise the smallest index where <code>that</code> is found.
*
* @see String.indexOf
*/
def indexOf[B >: A](that: Seq[B]): Int = {
val e = this.elements
// Offset into e
var i = 0
if (that.isEmpty) return 0
while (e.hasNext) {
if (this.startsWith(that, i)) return i
e.next; i += 1
}
-1
}
/** Is <code>that</code> a slice in this?
*/
def containsSlice[B](that: Seq[B]): Boolean = indexOf(that) != -1
}
|