Annotation scala.reflect.api.Scopes.MemberScope
Type Members
type Self = Repr
class WithFilter extends FilterMonadic[A, Repr]
Abstract Value Members
abstract def iterator: collection.Iterator[A]
Concrete Value Members
final def !=(arg0: Any): Boolean
final def ##(): Int
def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]): That
def ++:[B >: A, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[Repr, B, That]): That
def ++:[B >: A, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]): That
def /:[B](z: B)(op: (B, A) ⇒ B): B
def :\[B](z: B)(op: (A, B) ⇒ B): B
final def ==(arg0: Any): Boolean
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
def aggregate[B](z: ⇒ B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B
final def asInstanceOf[T0]: T0
def canEqual(that: Any): Boolean
def clone(): AnyRef
def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Repr, B, That]): That
def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
def companion: GenericCompanion[collection.Iterable]
def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit
def copyToArray[B >: A](xs: Array[B]): Unit
def copyToArray[B >: A](xs: Array[B], start: Int): Unit
def copyToBuffer[B >: A](dest: Buffer[B]): Unit
def count(p: (A) ⇒ Boolean): Int
def drop(n: Int): Repr
def dropRight(n: Int): Repr
def dropWhile(p: (A) ⇒ Boolean): Repr
final def eq(arg0: AnyRef): Boolean
def equals(arg0: Any): Boolean
def exists(p: (A) ⇒ Boolean): Boolean
def filter(p: (A) ⇒ Boolean): Repr
def filterNot(p: (A) ⇒ Boolean): Repr
def finalize(): Unit
def find(p: (A) ⇒ Boolean): Option[A]
def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]): That
def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): CC[B]
def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1
def foldLeft[B](z: B)(op: (B, A) ⇒ B): B
def foldRight[B](z: B)(op: (A, B) ⇒ B): B
def forall(p: (A) ⇒ Boolean): Boolean
def foreach[U](f: (A) ⇒ U): Unit
def genericBuilder[B]: Builder[B, CC[B]]
final def getClass(): Class[_]
def groupBy[K](f: (A) ⇒ K): Map[K, Repr]
def grouped(size: Int): collection.Iterator[Repr]
def hasDefiniteSize: Boolean
def hashCode(): Int
def head: A
def headOption: Option[A]
def init: Repr
def inits: collection.Iterator[Repr]
def isEmpty: Boolean
final def isInstanceOf[T0]: Boolean
final def isTraversableAgain: Boolean
def last: A
def lastOption: Option[A]
def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, That]): That
def max[B >: A](implicit cmp: Ordering[B]): A
def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
def min[B >: A](implicit cmp: Ordering[B]): A
def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
def mkString: String
def mkString(sep: String): String
def mkString(start: String, sep: String, end: String): String
final def ne(arg0: AnyRef): Boolean
def newBuilder: Builder[A, CC[A]]
def nonEmpty: Boolean
final def notify(): Unit
final def notifyAll(): Unit
def par: ParRepr
def parCombiner: Combiner[A, ParIterable[A]]
def partition(p: (A) ⇒ Boolean): (Repr, Repr)
def product[B >: A](implicit num: Numeric[B]): B
def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1
def reduceLeft[B >: A](op: (B, A) ⇒ B): B
def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]
def reduceRight[B >: A](op: (A, B) ⇒ B): B
def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
def repr: Repr
def reversed: List[A]
def sameElements[B >: A](that: GenIterable[B]): Boolean
def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Repr, B, That]): That
def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, That]): That
def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, That]): That
def seq: collection.Iterable[A]
def size: Int
def sizeHintIfCheap: Int
def slice(from: Int, until: Int): Repr
def sliding(size: Int, step: Int): collection.Iterator[Repr]
def sliding(size: Int): collection.Iterator[Repr]
def span(p: (A) ⇒ Boolean): (Repr, Repr)
def splitAt(n: Int): (Repr, Repr)
def stringPrefix: String
def sum[B >: A](implicit num: Numeric[B]): B
final def synchronized[T0](arg0: ⇒ T0): T0
def tail: Repr
def tails: collection.Iterator[Repr]
def take(n: Int): Repr
def takeRight(n: Int): Repr
def takeWhile(p: (A) ⇒ Boolean): Repr
def thisCollection: collection.Iterable[A]
def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A @scala.annotation.unchecked.uncheckedVariance]]): Col[A @scala.annotation.unchecked.uncheckedVariance]
def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
def toBuffer[B >: A]: Buffer[B]
def toCollection(repr: Repr): collection.Iterable[A]
def toIndexedSeq: collection.immutable.IndexedSeq[A]
def toIterable: collection.Iterable[A]
def toIterator: collection.Iterator[A]
def toList: List[A]
def toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]
def toSeq: collection.Seq[A]
def toSet[B >: A]: Set[B]
def toStream: collection.immutable.Stream[A]
def toString(): String
def toTraversable: collection.Traversable[A]
def toVector: Vector[A]
def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): CC[CC[B] @scala.annotation.unchecked.uncheckedVariance]
def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (CC[A1], CC[A2])
def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (CC[A1], CC[A2], CC[A3])
def view(from: Int, until: Int): IterableView[A, Repr]
def view: IterableView[A, Repr]
final def wait(): Unit
final def wait(arg0: Long, arg1: Int): Unit
final def wait(arg0: Long): Unit
def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, Repr]
def zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Repr, (A1, B), That]): That
def zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Repr, (A1, B), That]): That
def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[Repr, (A1, Int), That]): That
The type of member scopes, as in class definitions, for example.