NodeSeq

abstract def theSeq: Seq[Node]

final def !=(arg0: Any): Boolean

final def ##(): Int

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

def ++:[B >: Node, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

def ++:[B >: Node, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

def +:[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

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

def :+[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

def :\[B](z: B)(op: (Node, B) ⇒ B): B

final def ==(arg0: Any): Boolean

def \(that: String): NodeSeq

Projection function, which returns elements of this sequence based on the string that.

def \@(attributeName: String): String

Convenience method which returns string text of the named attribute.

def \\(that: String): NodeSeq

Projection function, which returns elements of this sequence and of all its subsequences, based on the string that.

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, Node) ⇒ B, combop: (B, B) ⇒ B): B

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

def apply(f: (Node) ⇒ Boolean): NodeSeq

def apply(i: Int): Node

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

final def asInstanceOf[T0]: T0

def basisForHashCode: Seq[Any]

def canEqual(other: Any): Boolean

We insist we're only equal to other xml.Equality implementors, which heads off a lot of inconsistency up front.

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[Node, B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

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

def combinations(n: Int): collection.Iterator[NodeSeq]

def companion: GenericCompanion[collection.immutable.Seq]

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

def contains[A1 >: Node](elem: A1): Boolean

def containsSlice[B](that: GenSeq[B]): Boolean

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

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

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

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

def corresponds[B](that: GenSeq[B])(p: (Node, B) ⇒ Boolean): Boolean

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

def diff[B >: Node](that: GenSeq[B]): NodeSeq

def distinct: NodeSeq

def drop(n: Int): NodeSeq

def dropRight(n: Int): NodeSeq

def dropWhile(p: (Node) ⇒ Boolean): NodeSeq

def endsWith[B](that: GenSeq[B]): Boolean

final def eq(arg0: AnyRef): Boolean

def equals(other: Any): Boolean

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

def filter(p: (Node) ⇒ Boolean): NodeSeq

def filterNot(p: (Node) ⇒ Boolean): NodeSeq

def finalize(): Unit

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

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

def flatten[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): collection.immutable.Seq[B]

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

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

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

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

def foreach[U](f: (Node) ⇒ U): Unit

def genericBuilder[B]: Builder[B, collection.immutable.Seq[B]]

final def getClass(): Class[_]

def groupBy[K](f: (Node) ⇒ K): Map[K, NodeSeq]

def grouped(size: Int): collection.Iterator[NodeSeq]

def hasDefiniteSize: Boolean

def hashCode(): Int

It's be nice to make these final, but there are probably people out there subclassing the XML types, especially when it comes to equals.

def head: Node

def headOption: Option[Node]

def indexOf[B >: Node](elem: B, from: Int): Int

def indexOf[B >: Node](elem: B): Int

def indexOfSlice[B >: Node](that: GenSeq[B], from: Int): Int

def indexOfSlice[B >: Node](that: GenSeq[B]): Int

def indexWhere(p: (Node) ⇒ Boolean, from: Int): Int

def indexWhere(p: (Node) ⇒ Boolean): Int

def indices: collection.immutable.Range

def init: NodeSeq

def inits: collection.Iterator[NodeSeq]

def intersect[B >: Node](that: GenSeq[B]): NodeSeq

def isDefinedAt(idx: Int): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: collection.Iterator[Node]

def last: Node

def lastIndexOf[B >: Node](elem: B, end: Int): Int

def lastIndexOf[B >: Node](elem: B): Int

def lastIndexOfSlice[B >: Node](that: GenSeq[B], end: Int): Int

def lastIndexOfSlice[B >: Node](that: GenSeq[B]): Int

def lastIndexWhere(p: (Node) ⇒ Boolean, end: Int): Int

def lastIndexWhere(p: (Node) ⇒ Boolean): Int

def lastOption: Option[Node]

def length: Int

def lengthCompare(len: Int): Int

def lift: (Int) ⇒ Option[Node]

def map[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

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

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

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

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

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[Node, NodeSeq]

Creates a list buffer as builder for this class

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def padTo[B >: Node, That](len: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

def par: ParSeq[Node]

def parCombiner: Combiner[Node, ParSeq[Node]]

def partition(p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq)

def patch[B >: Node, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

def permutations: collection.Iterator[NodeSeq]

def prefixLength(p: (Node) ⇒ Boolean): Int

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

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

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

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

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

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

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

def repr: NodeSeq

def reverse: NodeSeq

def reverseIterator: collection.Iterator[Node]

def reverseMap[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

def reversed: List[Node]

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

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

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

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

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

def segmentLength(p: (Node) ⇒ Boolean, from: Int): Int

def seq: collection.immutable.Seq[Node]

def size: Int

def slice(from: Int, until: Int): NodeSeq

def sliding(size: Int, step: Int): collection.Iterator[NodeSeq]

def sliding(size: Int): collection.Iterator[NodeSeq]

def sortBy[B](f: (Node) ⇒ B)(implicit ord: math.Ordering[B]): NodeSeq

def sortWith(lt: (Node, Node) ⇒ Boolean): NodeSeq

def sorted[B >: Node](implicit ord: math.Ordering[B]): NodeSeq

def span(p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq)

def splitAt(n: Int): (NodeSeq, NodeSeq)

def startsWith[B](that: GenSeq[B], offset: Int): Boolean

def startsWith[B](that: GenSeq[B]): Boolean

def strict_!=(other: Equality): Boolean

def strict_==(other: Equality): Boolean

def stringPrefix: String

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

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

def tail: NodeSeq

def tails: collection.Iterator[NodeSeq]

def take(n: Int): NodeSeq

def takeRight(n: Int): NodeSeq

def takeWhile(p: (Node) ⇒ Boolean): NodeSeq

def text: String

def thisCollection: collection.Seq[Node]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Node, Col[Node]]): Col[Node]

def toArray[B >: Node](implicit arg0: ClassTag[B]): Array[B]

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

def toCollection(repr: NodeSeq): collection.Seq[Node]

def toIndexedSeq: collection.immutable.IndexedSeq[Node]

def toIterable: collection.Iterable[Node]

def toIterator: collection.Iterator[Node]

def toList: List[Node]

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

def toSeq: collection.immutable.Seq[Node]

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

def toStream: collection.immutable.Stream[Node]

def toString(): String

def toTraversable: collection.Traversable[Node]

def toVector: Vector[Node]

def transpose[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): collection.immutable.Seq[collection.immutable.Seq[B]]

def union[B >: Node, That](that: GenSeq[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

def unzip[A1, A2](implicit asPair: (Node) ⇒ (A1, A2)): (collection.immutable.Seq[A1], collection.immutable.Seq[A2])

def unzip3[A1, A2, A3](implicit asTriple: (Node) ⇒ (A1, A2, A3)): (collection.immutable.Seq[A1], collection.immutable.Seq[A2], collection.immutable.Seq[A3])

def updated[B >: Node, That](index: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

def view(from: Int, until: Int): SeqView[Node, NodeSeq]

def view: SeqView[Node, NodeSeq]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (Node) ⇒ Boolean): FilterMonadic[Node, NodeSeq]

final def xml_!=(other: Any): Boolean

final def xml_==(other: Any): Boolean

def xml_sameElements[A](that: Iterable[A]): Boolean

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

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

def zipWithIndex[A1 >: Node, That](implicit bf: CanBuildFrom[NodeSeq, (A1, Int), That]): That