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
|
/* __ *\
** ________ ___ / / ___ Scala API **
** / __/ __// _ | / / / _ | (c) 2003-2009, LAMP/EPFL **
** __\ \/ /__/ __ |/ /__/ __ | http://scala-lang.org/ **
** /____/\___/_/ |_/____/_/ | | **
** |/ **
\* */
package scala.collection
package interfaces
import generic._
import mutable.Buffer
import scala.reflect.ClassManifest
/**
* @since 2.8
*/
trait TraversableMethods[+A, +This <: TraversableLike[A, This] with Traversable[A]]
{
// abstract
def foreach[U](f: A => U): Unit
// maps/iteration
def flatMap[B, That](f: A => Traversable[B])(implicit bf: BuilderFactory[B, That, This]): That
def map[B, That](f: A => B)(implicit bf: BuilderFactory[B, That, This]): That
def filterMap[B, That](pf: PartialFunction[Any, B])(implicit bf: BuilderFactory[B, That, This]): That
// new collections
def ++[B >: A, That](that: Iterator[B])(implicit bf: BuilderFactory[B, That, This]): That
def ++[B >: A, That](that: Traversable[B])(implicit bf: BuilderFactory[B, That, This]): That
def copyToArray[B >: A](xs: Array[B], start: Int): Unit
def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit
def copyToBuffer[B >: A](dest: Buffer[B]): Unit
// conversions
def toArray[B >: A : ClassManifest]: Array[B]
def toIterable: Iterable[A]
def toList: List[A]
def toSeq: Seq[A]
def toSet[B >: A]: immutable.Set[B]
def toStream: Stream[A]
def toVector[B >: A]: mutable.Vector[B]
// strings
def addString(b: StringBuilder): StringBuilder
def addString(b: StringBuilder, sep: String): StringBuilder
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
def mkString(sep: String): String
def mkString(start: String, sep: String, end: String): String
def mkString: String
// folds
def /: [B](z: B)(op: (B, A) => B): B
def :\ [B](z: B)(op: (A, B) => B): B
def foldLeft[B](z: B)(op: (B, A) => B): B
def foldRight[B](z: B)(op: (A, B) => B): B
def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
def reduceLeft[B >: A](op: (B, A) => B): B
def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
def reduceRight[B >: A](op: (A, B) => B): B
// conditions
def exists(p: A => Boolean): Boolean
def forall(p: A => Boolean): Boolean
def hasDefiniteSize: Boolean
def isEmpty: Boolean
def nonEmpty: Boolean
// element retrieval
def find(p: A => Boolean): Option[A]
def head: A
def headOption: Option[A]
def last: A
def lastOption: Option[A]
// subcollections
def drop(n: Int): Traversable[A]
def dropWhile(p: A => Boolean): Traversable[A]
def filter(p: A => Boolean): Traversable[A]
def filterNot(p: A => Boolean): Traversable[A]
def init: Traversable[A]
def slice(from: Int, until: Int): Traversable[A]
def tail: Traversable[A]
def take(n: Int): Traversable[A]
def takeWhile(p: A => Boolean): Traversable[A]
// subdivisions
def groupBy[K](f: A => K): Map[K, Traversable[A]]
def partition(p: A => Boolean): (Traversable[A], Traversable[A])
def span(p: A => Boolean): (Traversable[A], Traversable[A])
def splitAt(n: Int): (Traversable[A], Traversable[A])
// info
def count(p: A => Boolean): Int
def size: Int
def stringPrefix: String
// views
def view: TraversableView[A, This]
def view(from: Int, until: Int): TraversableView[A, This]
// def sum[B >: A](implicit num: Numeric[B]): B
// def product[B >: A](implicit num: Numeric[B]): B
// def min[B >: A](implicit cmp: Ordering[B]): A
// def max[B >: A](implicit cmp: Ordering[B]): A
}
|
