Scope

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

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

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

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

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

def ->[B](y: B): (Scope, B)

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

def :\[B](z: B)(op: (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, Symbol) ⇒ B, combop: (B, B) ⇒ B): B

final def asInstanceOf[T0]: T0

def asParIterable: ParIterable[Symbol]

def asParSeq: ParSeq[Symbol]

def canEqual(that: Any): Boolean

def clone(): AnyRef

def cloneScope: Scope

Returns a new scope with the same content as this one.

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

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

def companion: GenericCompanion[Iterable]

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

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

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

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

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

def drop(n: Int): Iterable[Symbol]

def dropRight(n: Int): Iterable[Symbol]

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

def ensuring(cond: (Scope) ⇒ Boolean, msg: ⇒ Any): Scope

def ensuring(cond: (Scope) ⇒ Boolean): Scope

def ensuring(cond: Boolean, msg: ⇒ Any): Scope

def ensuring(cond: Boolean): Scope

def enter[T <: Symbol](sym: T): T

enter a symbol

def enter(e: ScopeEntry): Unit

enter a scope entry

def enterUnique(sym: Symbol): Unit

enter a symbol, asserting that no symbol with same name exists in scope

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

def filter(p: (Symbol) ⇒ Boolean): Scope

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

def finalize(): Unit

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

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

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

def flatten[B](implicit asTraversable: (Symbol) ⇒ GenTraversableOnce[B]): Traversable[B]

def flatten: Iterator[Symbol]

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

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

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

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

def foreach[U](p: (Symbol) ⇒ U): Unit

def formatted(fmtstr: String): String

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

final def getClass(): Class[_]

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

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

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Symbol

def headOption: Option[Symbol]

def ifParSeq[R](isbody: (ParSeq[Symbol]) ⇒ R): Otherwise[R]

def init: Iterable[Symbol]

def inits: Iterator[Iterable[Symbol]]

def isEmpty: Boolean

is the scope empty?

final def isInstanceOf[T0]: Boolean

def isParIterable: Boolean

def isParSeq: Boolean

def isParallel: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[Symbol]

Return all symbols as an iterator in the order they were entered in this scope.

def last: Symbol

def lastOption: Option[Symbol]

def lookup(name: Name): Symbol

lookup a symbol

def lookupAll(name: Name): Iterator[Symbol]

Returns an iterator yielding every symbol with given name in this scope.

def lookupEntry(name: Name): ScopeEntry

lookup a symbol entry matching given name.

def lookupNextEntry(entry: ScopeEntry): ScopeEntry

lookup next entry with same name as this one

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

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

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

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

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

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

def mkString(start: String, sep: String, end: String): String

def mkString: String

def mkString(sep: String): String

final def ne(arg0: AnyRef): Boolean

def nestingLevel: Int

Return the nesting level of this scope, i.

def newBuilder: Builder[Symbol, Iterable[Symbol]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[Symbol]

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

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

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

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

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

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

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

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

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

def rehash(sym: Symbol, newname: Name): Unit

def repr: Iterable[Symbol]

def reversed: List[Symbol]

def sameElements[B >: Symbol](that: Iterable[B]): Boolean

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

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

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

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

val self: Any

val self: Any

def seq: Iterable[Symbol]

def size: Int

the number of entries in this scope

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

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

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

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

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

def stringPrefix: String

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

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

def tail: Iterable[Symbol]

def tails: Iterator[Iterable[Symbol]]

def take(n: Int): Iterable[Symbol]

def takeRight(n: Int): Iterable[Symbol]

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

def thisCollection: Iterable[Symbol]

def toArray[B >: Symbol](implicit arg0: ArrayTag[B]): Array[B]

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

def toCollection(repr: Iterable[Symbol]): Iterable[Symbol]

def toIndexedSeq: IndexedSeq[Symbol]

def toIterable: Iterable[Symbol]

def toIterator: Iterator[Symbol]

def toList: List[Symbol]

Return all symbols as a list in the order they were entered in this scope.

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

def toParArray: ParArray[Symbol]

def toSeq: Seq[Symbol]

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

def toStream: Stream[Symbol]

def toString(): String

def toTraversable: Traversable[Symbol]

def transpose[B](implicit asTraversable: (Symbol) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]

def unlink(sym: Symbol): Unit

remove symbol

def unlink(e: ScopeEntry): Unit

remove entry

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

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

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

def view: IterableView[Symbol, Iterable[Symbol]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

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

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

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

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

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

def →[B](y: B): (Scope, B)

def /:\[A1 >: Symbol](z: A1)(op: (A1, A1) ⇒ A1): A1

def x: Scope

def x: Scope