OptimizingSelector

abstract def apply(v1: Node): A

abstract def canMatchIn(group: Group[Node]): Boolean

* Provides a hint as to whether the selector can any children or their descendants in the specified group.

abstract def isDefinedAt(x: Node): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def andThen[C](k: (A) ⇒ C): PartialFunction[Node, C]

def applyOrElse[A1 <: Node, B1 >: A](x: A1, default: (A1) ⇒ B1): B1

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def compose[A](g: (A) ⇒ Node): (A) ⇒ A

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def lift: (Node) ⇒ Option[A]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def orElse[A1 <: Node, B1 >: A](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

def runWith[U](action: (A) ⇒ U): (Node) ⇒ Boolean

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit