summaryrefslogtreecommitdiff
path: root/test/files/presentation/ide-bug-1000531.check
blob: ef8a1d12dee391b75847cb838e62c0a15489064e (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
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
reload: CrashOnLoad.scala

askTypeCompletion at CrashOnLoad.scala(6,12)
================================================================================
[response] askTypeCompletion at (6,12)
retrieved 118 members
[inaccessible] protected[package lang] def clone(): Object
[inaccessible] protected[package lang] def finalize(): Unit
[inaccessible] protected[this] def reversed: List[B]
class GroupedIterator[B >: A] extends AbstractIterator[Seq[B]] with Iterator[Seq[B]]
def +(other: String): String
def ++[B >: B](that: => scala.collection.GenTraversableOnce[B]): Iterator[B]
def ->[B](y: B): (java.util.Iterator[B], B)
def /:[B](z: B)(op: (B, B) => B): B
def :\[B](z: B)(op: (B, B) => B): B
def addString(b: StringBuilder): StringBuilder
def addString(b: StringBuilder,sep: String): StringBuilder
def addString(b: StringBuilder,start: String,sep: String,end: String): StringBuilder
def aggregate[B](z: => B)(seqop: (B, B) => B,combop: (B, B) => B): B
def buffered: scala.collection.BufferedIterator[B]
def collectFirst[B](pf: PartialFunction[B,B]): Option[B]
def collect[B](pf: PartialFunction[B,B]): Iterator[B]
def contains(elem: Any): Boolean
def copyToArray[B >: B](xs: Array[B]): Unit
def copyToArray[B >: B](xs: Array[B],start: Int): Unit
def copyToArray[B >: B](xs: Array[B],start: Int,len: Int): Unit
def copyToBuffer[B >: B](dest: scala.collection.mutable.Buffer[B]): Unit
def corresponds[B](that: scala.collection.GenTraversableOnce[B])(p: (B, B) => Boolean): Boolean
def count(p: B => Boolean): Int
def drop(n: Int): Iterator[B]
def dropWhile(p: B => Boolean): Iterator[B]
def duplicate: (Iterator[B], Iterator[B])
def ensuring(cond: Boolean): java.util.Iterator[B]
def ensuring(cond: Boolean,msg: => Any): java.util.Iterator[B]
def ensuring(cond: java.util.Iterator[B] => Boolean): java.util.Iterator[B]
def ensuring(cond: java.util.Iterator[B] => Boolean,msg: => Any): java.util.Iterator[B]
def equals(x$1: Any): Boolean
def exists(p: B => Boolean): Boolean
def filter(p: B => Boolean): Iterator[B]
def filterNot(p: B => Boolean): Iterator[B]
def find(p: B => Boolean): Option[B]
def flatMap[B](f: B => scala.collection.GenTraversableOnce[B]): Iterator[B]
def foldLeft[B](z: B)(op: (B, B) => B): B
def foldRight[B](z: B)(op: (B, B) => B): B
def fold[A1 >: B](z: A1)(op: (A1, A1) => A1): A1
def forall(p: B => Boolean): Boolean
def foreach[U](f: B => U): Unit
def formatted(fmtstr: String): String
def grouped[B >: B](size: Int): Iterator[B]#GroupedIterator[B]
def hasDefiniteSize: Boolean
def hasNext(): Boolean
def hashCode(): Int
def indexOf[B >: B](elem: B): Int
def indexWhere(p: B => Boolean): Int
def isEmpty: Boolean
def isTraversableAgain: Boolean
def length: Int
def map[B](f: B => B): Iterator[B]
def maxBy[B](f: B => B)(implicit cmp: Ordering[B]): B
def max[B >: B](implicit cmp: Ordering[B]): B
def minBy[B](f: B => B)(implicit cmp: Ordering[B]): B
def min[B >: B](implicit cmp: Ordering[B]): B
def mkString(sep: String): String
def mkString(start: String,sep: String,end: String): String
def mkString: String
def next(): B
def nonEmpty: Boolean
def padTo[A1 >: B](len: Int,elem: A1): Iterator[A1]
def partition(p: B => Boolean): (Iterator[B], Iterator[B])
def patch[B >: B](from: Int,patchElems: Iterator[B],replaced: Int): Iterator[B]
def product[B >: B](implicit num: Numeric[B]): B
def reduceLeftOption[B >: B](op: (B, B) => B): Option[B]
def reduceLeft[B >: B](op: (B, B) => B): B
def reduceOption[A1 >: B](op: (A1, A1) => A1): Option[A1]
def reduceRightOption[B >: B](op: (B, B) => B): Option[B]
def reduceRight[B >: B](op: (B, B) => B): B
def reduce[A1 >: B](op: (A1, A1) => A1): A1
def remove(): Unit
def sameElements(that: Iterator[_]): Boolean
def scanLeft[B](z: B)(op: (B, B) => B): Iterator[B]
def scanRight[B](z: B)(op: (B, B) => B): Iterator[B]
def seq: Iterator[B]
def size: Int
def slice(from: Int,until: Int): Iterator[B]
def sliding[B >: B](size: Int,step: Int): Iterator[B]#GroupedIterator[B]
def span(p: B => Boolean): (Iterator[B], Iterator[B])
def sum[B >: B](implicit num: Numeric[B]): B
def take(n: Int): Iterator[B]
def takeWhile(p: B => Boolean): Iterator[B]
def toArray[B >: B](implicit evidence$1: scala.reflect.ClassTag[B]): Array[B]
def toBuffer[B >: B]: scala.collection.mutable.Buffer[B]
def toIndexedSeq: scala.collection.immutable.IndexedSeq[B]
def toIterable: Iterable[B]
def toIterator: Iterator[B]
def toList: List[B]
def toMap[T, U](implicit ev: <:<[B,(T, U)]): scala.collection.immutable.Map[T,U]
def toSeq: Seq[B]
def toSet[B >: B]: scala.collection.immutable.Set[B]
def toStream: scala.collection.immutable.Stream[B]
def toString(): String
def toTraversable: Traversable[B]
def toVector: Vector[B]
def to[Col[_]](implicit cbf: scala.collection.generic.CanBuildFrom[Nothing,B,Col[B]]): Col[B]
def withFilter(p: B => Boolean): Iterator[B]
def zipAll[B, A1 >: B, B1 >: B](that: Iterator[B],thisElem: A1,thatElem: B1): Iterator[(A1, B1)]
def zipWithIndex: Iterator[(B, Int)]
def zip[B](that: Iterator[B]): Iterator[(B, B)]
def →[B](y: B): (java.util.Iterator[B], B)
final def !=(x$1: Any): Boolean
final def ##(): Int
final def ==(x$1: Any): Boolean
final def asInstanceOf[T0]: T0
final def eq(x$1: AnyRef): Boolean
final def isInstanceOf[T0]: Boolean
final def ne(x$1: AnyRef): Boolean
final def notify(): Unit
final def notifyAll(): Unit
final def synchronized[T0](x$1: T0): T0
final def wait(): Unit
final def wait(x$1: Long): Unit
final def wait(x$1: Long,x$2: Int): Unit
================================================================================