summaryrefslogtreecommitdiff
path: root/src/library/scala/SeqProxy.scala
blob: deb046b902907bc76349d8190f85538a0be21b17 (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
/*                     __                                               *\
**     ________ ___   / /  ___     Scala API                            **
**    / __/ __// _ | / /  / _ |    (c) 2003-2007, LAMP/EPFL             **
**  __\ \/ /__/ __ |/ /__/ __ |    http://scala-lang.org/               **
** /____/\___/_/ |_/____/_/ | |                                         **
**                          |/                                          **
\*                                                                      */

// $Id$


package scala


/** This class implements a proxy for sequences. It forwards
 *  all calls to a different sequence object.
 *
 *  @author  Martin Odersky
 *  @author  Matthias Zenger
 *  @version 2.0, 31/12/2006
 */
trait SeqProxy[+A] extends Seq[A] with CollectionProxy[A] {

  override def self: Seq[A]

  // PartialFunction delegates

  override def apply(i: Int): A = self(i)

  // Seq delegates
  // Seq methods could be printed by  cat Seq.scala | sed -n '/trait Seq/,$ p' | egrep '^  (override )?def'

  override def length: Int = self.length
  override def lengthCompare(l: Int) = self lengthCompare l
  override def size = self.size
  override def isEmpty = self.isEmpty
  @deprecated
  override def concat [B >: A](that: Iterable[B]): Seq[B] = self concat that
  override def last = self.last
  override def lastOption = self.lastOption
  override def first = self.first
  override def firstOption = self.firstOption
  override def headOption = self.headOption

  override def ++ [B >: A](that: Iterable[B]) = self ++ that
  override def isDefinedAt(x: Int): Boolean = self isDefinedAt x

  override def lastIndexOf[B >: A](elem: B): Int = self lastIndexOf elem
  override def findIndexOf(p: A => Boolean): Int = self findIndexOf p

  override def indexOf[B >: A](elem: B): Int = self indexOf elem

  override def map[B](f: A => B): Seq[B] = self map f
  override def flatMap[B](f: A => Iterable[B]) = self flatMap f
  override def filter(p: A => Boolean): Seq[A] = self filter p
  override def take(n: Int): Seq[A] = self take n
  override def drop(n: Int): Seq[A] = self drop n

  override def slice(from: Int, len: Int): Seq[A] = self.slice(from, len)
  override def slice(from: Int) = self slice from

  override def takeWhile(p: A => Boolean): Seq[A] = self takeWhile p
  override def dropWhile(p: A => Boolean): Seq[A] = self dropWhile p

  override def reverse: Seq[A] = self.reverse

  override def contains(elem: Any): Boolean = self contains elem

  override def subseq(from: Int, end: Int) = self.subseq(from, end)

  override def toArray[B >: A]: Array[B] = self.toArray

  override def toSeq = self.toSeq

  override def projection = self.projection

  override def equalsWith[B](that: Seq[B])(f: (A, B) => Boolean): Boolean = self.equalsWith(that)(f)

  override def startsWith[B](that: Seq[B]) = self startsWith that
  override def endsWith[B](that: Seq[B]) = self endsWith that

  override def indexOf[B >: A](that: Seq[B]) = self indexOf that

  override def containsSlice[B](that: Seq[B]) = self containsSlice that
}