MemberScopeApi

abstract def iterator: collection.Iterator[Universe.Symbol]

abstract def sorted: List[Universe.Symbol]

Sorts the symbols included in this scope so that: 1) Symbols appear in the linearization order of their owners.

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ++[B >: Universe.Symbol, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[collection.Iterable[Universe.Symbol], B, That]): That

def ++:[B >: Universe.Symbol, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[collection.Iterable[Universe.Symbol], B, That]): That

def ++:[B >: Universe.Symbol, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[collection.Iterable[Universe.Symbol], B, That]): That

def ->[B](y: B): (Universe.MemberScopeApi, B)

def /:[B](z: B)(op: (B, Universe.Symbol) ⇒ B): B

def :\[B](z: B)(op: (Universe.Symbol, B) ⇒ B): B

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

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, Universe.Symbol) ⇒ B, combop: (B, B) ⇒ B): B

final def asInstanceOf[T0]: T0

def asParIterable: ParIterable[Universe.Symbol]

def asParSeq: ParSeq[Universe.Symbol]

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[Universe.Symbol, B])(implicit bf: CanBuildFrom[collection.Iterable[Universe.Symbol], B, That]): That

def collectFirst[B](pf: PartialFunction[Universe.Symbol, B]): Option[B]

def companion: GenericCompanion[collection.Iterable]

def copyToArray[B >: Universe.Symbol](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: Universe.Symbol](xs: Array[B]): Unit

def copyToArray[B >: Universe.Symbol](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: Universe.Symbol](dest: Buffer[B]): Unit

def count(p: (Universe.Symbol) ⇒ Boolean): Int

def drop(n: Int): collection.Iterable[Universe.Symbol]

def dropRight(n: Int): collection.Iterable[Universe.Symbol]

def dropWhile(p: (Universe.Symbol) ⇒ Boolean): collection.Iterable[Universe.Symbol]

def ensuring(cond: (Universe.MemberScopeApi) ⇒ Boolean, msg: ⇒ Any): Universe.MemberScopeApi

def ensuring(cond: (Universe.MemberScopeApi) ⇒ Boolean): Universe.MemberScopeApi

def ensuring(cond: Boolean, msg: ⇒ Any): Universe.MemberScopeApi

def ensuring(cond: Boolean): Universe.MemberScopeApi

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(p: (Universe.Symbol) ⇒ Boolean): Boolean

def filter(p: (Universe.Symbol) ⇒ Boolean): collection.Iterable[Universe.Symbol]

def filterNot(p: (Universe.Symbol) ⇒ Boolean): collection.Iterable[Universe.Symbol]

def finalize(): Unit

def find(p: (Universe.Symbol) ⇒ Boolean): Option[Universe.Symbol]

def flatMap[B, That](f: (Universe.Symbol) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[collection.Iterable[Universe.Symbol], B, That]): That

def flatten[B](implicit asTraversable: (Universe.Symbol) ⇒ GenTraversableOnce[B]): collection.Iterable[B]

def fold[A1 >: Universe.Symbol](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, Universe.Symbol) ⇒ B): B

def foldRight[B](z: B)(op: (Universe.Symbol, B) ⇒ B): B

def forall(p: (Universe.Symbol) ⇒ Boolean): Boolean

def foreach[U](f: (Universe.Symbol) ⇒ U): Unit

def formatted(fmtstr: String): String

def genericBuilder[B]: Builder[B, collection.Iterable[B]]

final def getClass(): Class[_]

def groupBy[K](f: (Universe.Symbol) ⇒ K): Map[K, collection.Iterable[Universe.Symbol]]

def grouped(size: Int): collection.Iterator[collection.Iterable[Universe.Symbol]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Universe.Symbol

def headOption: Option[Universe.Symbol]

def ifParSeq[R](isbody: (ParSeq[Universe.Symbol]) ⇒ R): (TraversableOps[Universe.Symbol])#Otherwise[R]

def init: collection.Iterable[Universe.Symbol]

def inits: collection.Iterator[collection.Iterable[Universe.Symbol]]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def isParIterable: Boolean

def isParSeq: Boolean

def isParallel: Boolean

final def isTraversableAgain: Boolean

def last: Universe.Symbol

def lastOption: Option[Universe.Symbol]

def map[B, That](f: (Universe.Symbol) ⇒ B)(implicit bf: CanBuildFrom[collection.Iterable[Universe.Symbol], B, That]): That

def max[B >: Universe.Symbol](implicit cmp: Ordering[B]): Universe.Symbol

def maxBy[B](f: (Universe.Symbol) ⇒ B)(implicit cmp: Ordering[B]): Universe.Symbol

def min[B >: Universe.Symbol](implicit cmp: Ordering[B]): Universe.Symbol

def minBy[B](f: (Universe.Symbol) ⇒ B)(implicit cmp: Ordering[B]): Universe.Symbol

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[Universe.Symbol, collection.Iterable[Universe.Symbol]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[Universe.Symbol]

def parCombiner: Combiner[Universe.Symbol, ParIterable[Universe.Symbol]]

def partition(p: (Universe.Symbol) ⇒ Boolean): (collection.Iterable[Universe.Symbol], collection.Iterable[Universe.Symbol])

def product[B >: Universe.Symbol](implicit num: Numeric[B]): B

def reduce[A1 >: Universe.Symbol](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: Universe.Symbol](op: (B, Universe.Symbol) ⇒ B): B

def reduceLeftOption[B >: Universe.Symbol](op: (B, Universe.Symbol) ⇒ B): Option[B]

def reduceOption[A1 >: Universe.Symbol](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: Universe.Symbol](op: (Universe.Symbol, B) ⇒ B): B

def reduceRightOption[B >: Universe.Symbol](op: (Universe.Symbol, B) ⇒ B): Option[B]

def repr: collection.Iterable[Universe.Symbol]

def reversed: List[Universe.Symbol]

def sameElements[B >: Universe.Symbol](that: GenIterable[B]): Boolean

def scan[B >: Universe.Symbol, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[collection.Iterable[Universe.Symbol], B, That]): That

def scanLeft[B, That](z: B)(op: (B, Universe.Symbol) ⇒ B)(implicit bf: CanBuildFrom[collection.Iterable[Universe.Symbol], B, That]): That

def scanRight[B, That](z: B)(op: (Universe.Symbol, B) ⇒ B)(implicit bf: CanBuildFrom[collection.Iterable[Universe.Symbol], B, That]): That

def seq: collection.Iterable[Universe.Symbol]

def size: Int

def slice(from: Int, until: Int): collection.Iterable[Universe.Symbol]

def sliding(size: Int, step: Int): collection.Iterator[collection.Iterable[Universe.Symbol]]

def sliding(size: Int): collection.Iterator[collection.Iterable[Universe.Symbol]]

def span(p: (Universe.Symbol) ⇒ Boolean): (collection.Iterable[Universe.Symbol], collection.Iterable[Universe.Symbol])

def splitAt(n: Int): (collection.Iterable[Universe.Symbol], collection.Iterable[Universe.Symbol])

def stringPrefix: String

def sum[B >: Universe.Symbol](implicit num: Numeric[B]): B

final def synchronized[T0](arg0: ⇒ T0): T0

def tail: collection.Iterable[Universe.Symbol]

def tails: collection.Iterator[collection.Iterable[Universe.Symbol]]

def take(n: Int): collection.Iterable[Universe.Symbol]

def takeRight(n: Int): collection.Iterable[Universe.Symbol]

def takeWhile(p: (Universe.Symbol) ⇒ Boolean): collection.Iterable[Universe.Symbol]

def thisCollection: collection.Iterable[Universe.Symbol]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Universe.Symbol, Col[Universe.Symbol]]): Col[Universe.Symbol]

def toArray[B >: Universe.Symbol](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: Universe.Symbol]: Buffer[B]

def toCollection(repr: collection.Iterable[Universe.Symbol]): collection.Iterable[Universe.Symbol]

def toIndexedSeq: collection.immutable.IndexedSeq[Universe.Symbol]

def toIterable: collection.Iterable[Universe.Symbol]

def toIterator: collection.Iterator[Universe.Symbol]

def toList: List[Universe.Symbol]

def toMap[T, U](implicit ev: <:<[Universe.Symbol, (T, U)]): Map[T, U]

def toParArray: ParArray[Universe.Symbol]

def toSeq: collection.Seq[Universe.Symbol]

def toSet[B >: Universe.Symbol]: Set[B]

def toStream: collection.immutable.Stream[Universe.Symbol]

def toString(): String

def toTraversable: collection.Traversable[Universe.Symbol]

def toVector: Vector[Universe.Symbol]

def transpose[B](implicit asTraversable: (Universe.Symbol) ⇒ GenTraversableOnce[B]): collection.Iterable[collection.Iterable[B]]

def unzip[A1, A2](implicit asPair: (Universe.Symbol) ⇒ (A1, A2)): (collection.Iterable[A1], collection.Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (Universe.Symbol) ⇒ (A1, A2, A3)): (collection.Iterable[A1], collection.Iterable[A2], collection.Iterable[A3])

def view(from: Int, until: Int): IterableView[Universe.Symbol, collection.Iterable[Universe.Symbol]]

def view: IterableView[Universe.Symbol, collection.Iterable[Universe.Symbol]]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def withFilter(p: (Universe.Symbol) ⇒ Boolean): FilterMonadic[Universe.Symbol, collection.Iterable[Universe.Symbol]]

def zip[A1 >: Universe.Symbol, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[collection.Iterable[Universe.Symbol], (A1, B), That]): That

def zipAll[B, A1 >: Universe.Symbol, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[collection.Iterable[Universe.Symbol], (A1, B), That]): That

def zipWithIndex[A1 >: Universe.Symbol, That](implicit bf: CanBuildFrom[collection.Iterable[Universe.Symbol], (A1, Int), That]): That

def →[B](y: B): (Universe.MemberScopeApi, B)

def filter(p: (Universe.Symbol) ⇒ Boolean): collection.TraversableOnce[Universe.Symbol]

def flatMap[B](f: (Universe.Symbol) ⇒ GenTraversableOnce[B]): collection.TraversableOnce[B]

def map[B](f: (Universe.Symbol) ⇒ B): collection.TraversableOnce[B]

def withFilter(p: (Universe.Symbol) ⇒ Boolean): collection.Iterator[Universe.Symbol]