Positions

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

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

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

val NoPosition: tools.nsc.util.NoPosition.type

final def asInstanceOf[T0]: T0

def atPos[T <: Tree](pos: Position)(tree: T): T

def clone(): AnyRef

def ensureNonOverlapping(tree: Tree, others: List[Tree]): Unit

Ensure that given tree has no positions that overlap with any of the positions of others.

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

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

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

def ensuring(cond: Boolean): Positions

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def formatted(fmtstr: String): String

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

lazy val posAssigner: PosAssigner

def rangePos(source: SourceFile, start: Int, point: Int, end: Int): OffsetPosition

val self: Any

val self: Any

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

def toString(): String

def validatePositions(tree: Tree): Unit

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def wrappingPos(trees: List[Tree]): Position

A position that wraps the non-empty set of trees.

def wrappingPos(default: Position, trees: List[Tree]): Position

A position that wraps a set of trees.

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

def x: Positions

def x: Positions