Class

scala.xml

Document

Related Doc: package xml

Permalink

class Document extends NodeSeq with XMLEvent with Serializable

A document information item (according to InfoSet spec). The comments are copied from the Infoset spec, only augmented with some information on the Scala types for definitions that might have no value. Also plays the role of an XMLEvent for pull parsing.

Annotations
@SerialVersionUID()
Version

1.0, 26/04/2005

Linear Supertypes
Serializable, java.io.Serializable, XMLEvent, NodeSeq, Equality, collection.immutable.Seq[Node], collection.immutable.Iterable[Node], collection.immutable.Traversable[Node], Immutable, AbstractSeq[Node], collection.Seq[Node], SeqLike[Node, NodeSeq], GenSeq[Node], GenSeqLike[Node, NodeSeq], PartialFunction[Int, Node], (Int) ⇒ Node, AbstractIterable[Node], collection.Iterable[Node], IterableLike[Node, NodeSeq], Equals, GenIterable[Node], GenIterableLike[Node, NodeSeq], AbstractTraversable[Node], collection.Traversable[Node], GenTraversable[Node], GenericTraversableTemplate[Node, collection.immutable.Seq], TraversableLike[Node, NodeSeq], GenTraversableLike[Node, NodeSeq], Parallelizable[Node, ParSeq[Node]], collection.TraversableOnce[Node], GenTraversableOnce[Node], FilterMonadic[Node, NodeSeq], HasNewBuilder[Node, NodeSeq], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Document
  2. Serializable
  3. Serializable
  4. XMLEvent
  5. NodeSeq
  6. Equality
  7. Seq
  8. Iterable
  9. Traversable
  10. Immutable
  11. AbstractSeq
  12. Seq
  13. SeqLike
  14. GenSeq
  15. GenSeqLike
  16. PartialFunction
  17. Function1
  18. AbstractIterable
  19. Iterable
  20. IterableLike
  21. Equals
  22. GenIterable
  23. GenIterableLike
  24. AbstractTraversable
  25. Traversable
  26. GenTraversable
  27. GenericTraversableTemplate
  28. TraversableLike
  29. GenTraversableLike
  30. Parallelizable
  31. TraversableOnce
  32. GenTraversableOnce
  33. FilterMonadic
  34. HasNewBuilder
  35. AnyRef
  36. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Document()

    Permalink

Type Members

  1. type Self = NodeSeq

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]

    Permalink
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def ++[B >: Node, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  4. def ++:[B >: Node, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

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

    Permalink
    Definition Classes
    TraversableLike
  6. def +:[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  7. def /:[B](z: B)(op: (B, Node) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  8. def :+[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  9. def :\[B](z: B)(op: (Node, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  11. def \(that: String): NodeSeq

    Permalink

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

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

    • this \ "foo" to get a list of all elements that are labelled with "foo";
    • \ "_" to get a list of all elements (wildcard);
    • ns \ "@foo" to get the unprefixed attribute "foo";
    • ns \ "@{uri}foo" to get the prefixed attribute "pre:foo" whose prefix "pre" is resolved to the namespace "uri".

    For attribute projections, the resulting scala.xml.NodeSeq attribute values are wrapped in a scala.xml.Group.

    There is no support for searching a prefixed attribute by its literal prefix.

    The document order is preserved.

    Definition Classes
    NodeSeq
  12. def \@(attributeName: String): String

    Permalink

    Convenience method which returns string text of the named attribute.

    Convenience method which returns string text of the named attribute. Use:

    • that \@ "foo" to get the string text of attribute "foo";
    Definition Classes
    NodeSeq
  13. def \\(that: String): NodeSeq

    Permalink

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

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

    • this \\ 'foo to get a list of all elements that are labelled with "foo";
    • \\ "_" to get a list of all elements (wildcard);
    • ns \\ "@foo" to get the unprefixed attribute "foo";
    • ns \\ "@{uri}foo" to get each prefixed attribute "pre:foo" whose prefix "pre" is resolved to the namespace "uri".

    For attribute projections, the resulting scala.xml.NodeSeq attribute values are wrapped in a scala.xml.Group.

    There is no support for searching a prefixed attribute by its literal prefix.

    The document order is preserved.

    Definition Classes
    NodeSeq
  14. def addString(b: StringBuilder): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  15. def addString(b: StringBuilder, sep: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  16. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  17. def aggregate[B](z: ⇒ B)(seqop: (B, Node) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  18. var allDeclarationsProcessed: Boolean

    Permalink

    9.

    9. This property is not strictly speaking part of the infoset of the document. Rather it is an indication of whether the processor has read the complete DTD. Its value is a boolean. If it is false, then certain properties (indicated in their descriptions below) may be unknown. If it is true, those properties are never unknown.

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

    Permalink
    Definition Classes
    PartialFunction → Function1
  20. def apply(f: (Node) ⇒ Boolean): NodeSeq

    Permalink
    Definition Classes
    NodeSeq
  21. def apply(i: Int): Node

    Permalink
    Definition Classes
    NodeSeq → SeqLike → GenSeqLike → Function1
  22. def applyOrElse[A1 <: Int, B1 >: Node](x: A1, default: (A1) ⇒ B1): B1

    Permalink
    Definition Classes
    PartialFunction
  23. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  24. var baseURI: String

    Permalink

    The base URI of the document entity.

  25. def basisForHashCode: Seq[Any]

    Permalink
    Attributes
    protected
    Definition Classes
    NodeSeqEquality
  26. def canEqual(other: Any): Boolean

    Permalink

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

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

    Definition Classes
    DocumentNodeSeqEquality → IterableLike → Equals
  27. var children: Seq[Node]

    Permalink

    An ordered list of child information items, in document order.

    An ordered list of child information items, in document order. The list contains exactly one element information item. The list also contains one processing instruction information item for each processing instruction outside the document element, and one comment information item for each comment outside the document element. Processing instructions and comments within the DTD are excluded. If there is a document type declaration, the list also contains a document type declaration information item.

  28. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @IntrinsicCandidate() @throws( ... )
  29. def collect[B, That](pf: PartialFunction[Node, B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  30. def collectFirst[B](pf: PartialFunction[Node, B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce
  31. def combinations(n: Int): collection.Iterator[NodeSeq]

    Permalink
    Definition Classes
    SeqLike
  32. def companion: GenericCompanion[collection.immutable.Seq]

    Permalink
    Definition Classes
    Seq → Seq → GenSeq → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  33. def compose[A](g: (A) ⇒ Int): (A) ⇒ Node

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  34. def contains[A1 >: Node](elem: A1): Boolean

    Permalink
    Definition Classes
    SeqLike
  35. def containsSlice[B](that: GenSeq[B]): Boolean

    Permalink
    Definition Classes
    SeqLike
  36. def copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Unit

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  37. def copyToArray[B >: Node](xs: Array[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  38. def copyToArray[B >: Node](xs: Array[B], start: Int): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  39. def copyToBuffer[B >: Node](dest: Buffer[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce
  40. def corresponds[B](that: GenSeq[B])(p: (Node, B) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  41. def count(p: (Node) ⇒ Boolean): Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  42. def diff[B >: Node](that: GenSeq[B]): NodeSeq

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  43. def distinct: NodeSeq

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  44. var docElem: Node

    Permalink

    The element information item corresponding to the document element.

  45. def drop(n: Int): NodeSeq

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  46. def dropRight(n: Int): NodeSeq

    Permalink
    Definition Classes
    IterableLike
  47. def dropWhile(p: (Node) ⇒ Boolean): NodeSeq

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  48. var dtd: DTD

    Permalink

    The dtd that comes with the document, if any

  49. var encoding: Option[String]

    Permalink

    The name of the character encoding scheme in which the document entity is expressed.

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

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  51. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  52. def equals(other: Any): Boolean

    Permalink
    Definition Classes
    Equality → Equals → AnyRef → Any
  53. def exists(p: (Node) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  54. def filter(p: (Node) ⇒ Boolean): NodeSeq

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  55. def filterNot(p: (Node) ⇒ Boolean): NodeSeq

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  56. def find(p: (Node) ⇒ Boolean): Option[Node]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  57. def flatMap[B, That](f: (Node) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  58. def flatten[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): collection.immutable.Seq[B]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  59. def fold[A1 >: Node](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  60. def foldLeft[B](z: B)(op: (B, Node) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  61. def foldRight[B](z: B)(op: (Node, B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  62. def forall(p: (Node) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  63. def foreach[U](f: (Node) ⇒ U): Unit

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  64. def genericBuilder[B]: Builder[B, collection.immutable.Seq[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  65. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
    Annotations
    @IntrinsicCandidate()
  66. def groupBy[K](f: (Node) ⇒ K): Map[K, NodeSeq]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  67. def grouped(size: Int): collection.Iterator[NodeSeq]

    Permalink
    Definition Classes
    IterableLike
  68. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  69. def hashCode(): Int

    Permalink

    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.

    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. However WE at least can pretend they are final since clearly individual classes cannot be trusted to maintain a semblance of order.

    Definition Classes
    Equality → AnyRef → Any
  70. def head: Node

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  71. def headOption: Option[Node]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  72. def indexOf[B >: Node](elem: B, from: Int): Int

    Permalink
    Definition Classes
    GenSeqLike
  73. def indexOf[B >: Node](elem: B): Int

    Permalink
    Definition Classes
    GenSeqLike
  74. def indexOfSlice[B >: Node](that: GenSeq[B], from: Int): Int

    Permalink
    Definition Classes
    SeqLike
  75. def indexOfSlice[B >: Node](that: GenSeq[B]): Int

    Permalink
    Definition Classes
    SeqLike
  76. def indexWhere(p: (Node) ⇒ Boolean, from: Int): Int

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  77. def indexWhere(p: (Node) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  78. def indices: collection.immutable.Range

    Permalink
    Definition Classes
    SeqLike
  79. def init: NodeSeq

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  80. def inits: collection.Iterator[NodeSeq]

    Permalink
    Definition Classes
    TraversableLike
  81. def intersect[B >: Node](that: GenSeq[B]): NodeSeq

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  82. def isDefinedAt(idx: Int): Boolean

    Permalink
    Definition Classes
    GenSeqLike
  83. def isEmpty: Boolean

    Permalink
    Definition Classes
    SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  84. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  85. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  86. def iterator: collection.Iterator[Node]

    Permalink
    Definition Classes
    NodeSeq → IterableLike → GenIterableLike
  87. def last: Node

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  88. def lastIndexOf[B >: Node](elem: B, end: Int): Int

    Permalink
    Definition Classes
    GenSeqLike
  89. def lastIndexOf[B >: Node](elem: B): Int

    Permalink
    Definition Classes
    GenSeqLike
  90. def lastIndexOfSlice[B >: Node](that: GenSeq[B], end: Int): Int

    Permalink
    Definition Classes
    SeqLike
  91. def lastIndexOfSlice[B >: Node](that: GenSeq[B]): Int

    Permalink
    Definition Classes
    SeqLike
  92. def lastIndexWhere(p: (Node) ⇒ Boolean, end: Int): Int

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  93. def lastIndexWhere(p: (Node) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  94. def lastOption: Option[Node]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  95. def length: Int

    Permalink
    Definition Classes
    NodeSeq → SeqLike → GenSeqLike
  96. def lengthCompare(len: Int): Int

    Permalink
    Definition Classes
    SeqLike
  97. def lift: (Int) ⇒ Option[Node]

    Permalink
    Definition Classes
    PartialFunction
  98. def map[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  99. def max[B >: Node](implicit cmp: Ordering[B]): Node

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def maxBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. def min[B >: Node](implicit cmp: Ordering[B]): Node

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def minBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. def mkString(start: String, sep: String, end: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  107. def newBuilder: Builder[Node, NodeSeq]

    Permalink

    Creates a list buffer as builder for this class

    Creates a list buffer as builder for this class

    Attributes
    protected[this]
    Definition Classes
    NodeSeq → GenericTraversableTemplate → TraversableLike → HasNewBuilder
  108. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. def notations: Seq[NotationDecl]

    Permalink

    An unordered set of notation information items, one for each notation declared in the DTD.

    An unordered set of notation information items, one for each notation declared in the DTD. If any notation is multiply declared, this property has no value.

  110. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @IntrinsicCandidate()
  111. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @IntrinsicCandidate()
  112. def orElse[A1 <: Int, B1 >: Node](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Permalink
    Definition Classes
    PartialFunction
  113. def padTo[B >: Node, That](len: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  114. def par: ParSeq[Node]

    Permalink
    Definition Classes
    Parallelizable
  115. def parCombiner: Combiner[Node, ParSeq[Node]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    Seq → SeqLike → Iterable → TraversableLike → Parallelizable
  116. def partition(p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq)

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  117. def patch[B >: Node, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  118. def permutations: collection.Iterator[NodeSeq]

    Permalink
    Definition Classes
    SeqLike
  119. def prefixLength(p: (Node) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  120. def product[B >: Node](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. def reduce[A1 >: Node](op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  122. def reduceLeft[B >: Node](op: (B, Node) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce
  123. def reduceLeftOption[B >: Node](op: (B, Node) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  124. def reduceOption[A1 >: Node](op: (A1, A1) ⇒ A1): Option[A1]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  125. def reduceRight[B >: Node](op: (Node, B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  126. def reduceRightOption[B >: Node](op: (Node, B) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  127. def repr: NodeSeq

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  128. def reverse: NodeSeq

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  129. def reverseIterator: collection.Iterator[Node]

    Permalink
    Definition Classes
    SeqLike
  130. def reverseMap[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  131. def reversed: List[Node]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  132. def runWith[U](action: (Node) ⇒ U): (Int) ⇒ Boolean

    Permalink
    Definition Classes
    PartialFunction
  133. def sameElements[B >: Node](that: GenIterable[B]): Boolean

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  134. def scan[B >: Node, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[NodeSeq, B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  135. def scanLeft[B, That](z: B)(op: (B, Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  136. def scanRight[B, That](z: B)(op: (Node, B) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

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

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  138. def seq: collection.immutable.Seq[Node]

    Permalink
    Definition Classes
    Seq → Seq → GenSeq → GenSeqLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  139. def size: Int

    Permalink
    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  140. def slice(from: Int, until: Int): NodeSeq

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  141. def sliding(size: Int, step: Int): collection.Iterator[NodeSeq]

    Permalink
    Definition Classes
    IterableLike
  142. def sliding(size: Int): collection.Iterator[NodeSeq]

    Permalink
    Definition Classes
    IterableLike
  143. def sortBy[B](f: (Node) ⇒ B)(implicit ord: math.Ordering[B]): NodeSeq

    Permalink
    Definition Classes
    SeqLike
  144. def sortWith(lt: (Node, Node) ⇒ Boolean): NodeSeq

    Permalink
    Definition Classes
    SeqLike
  145. def sorted[B >: Node](implicit ord: math.Ordering[B]): NodeSeq

    Permalink
    Definition Classes
    SeqLike
  146. def span(p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq)

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  147. def splitAt(n: Int): (NodeSeq, NodeSeq)

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  148. var standAlone: Option[Boolean]

    Permalink

    An indication of the standalone status of the document, either true or false.

    An indication of the standalone status of the document, either true or false. This property is derived from the optional standalone document declaration in the XML declaration at the beginning of the document entity, and has no value (None) if there is no standalone document declaration.

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

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  150. def startsWith[B](that: GenSeq[B]): Boolean

    Permalink
    Definition Classes
    GenSeqLike
  151. def strict_!=(other: Equality): Boolean

    Permalink
    Definition Classes
    Equality
  152. def strict_==(other: Equality): Boolean

    Permalink
    Definition Classes
    NodeSeqEquality
  153. def stringPrefix: String

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  154. def sum[B >: Node](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  155. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  156. def tail: NodeSeq

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  157. def tails: collection.Iterator[NodeSeq]

    Permalink
    Definition Classes
    TraversableLike
  158. def take(n: Int): NodeSeq

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  159. def takeRight(n: Int): NodeSeq

    Permalink
    Definition Classes
    IterableLike
  160. def takeWhile(p: (Node) ⇒ Boolean): NodeSeq

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  161. def text: String

    Permalink
    Definition Classes
    NodeSeq
  162. def theSeq: Seq[Node]

    Permalink
    Definition Classes
    DocumentNodeSeq
  163. def thisCollection: collection.Seq[Node]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  164. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Node, Col[Node]]): Col[Node]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  165. def toArray[B >: Node](implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  166. def toBuffer[B >: Node]: Buffer[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  167. def toCollection(repr: NodeSeq): collection.Seq[Node]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  168. def toIndexedSeq: collection.immutable.IndexedSeq[Node]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  169. def toIterable: collection.Iterable[Node]

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  170. def toIterator: collection.Iterator[Node]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  171. def toList: List[Node]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  172. def toMap[T, U](implicit ev: <:<[Node, (T, U)]): Map[T, U]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  173. def toSeq: collection.immutable.Seq[Node]

    Permalink
    Definition Classes
    Seq → SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  174. def toSet[B >: Node]: Set[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  175. def toStream: collection.immutable.Stream[Node]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  176. def toString(): String

    Permalink
    Definition Classes
    NodeSeq → SeqLike → Function1 → TraversableLike → AnyRef → Any
  177. def toTraversable: collection.Traversable[Node]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  178. def toVector: Vector[Node]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  179. def transpose[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): collection.immutable.Seq[collection.immutable.Seq[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

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

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  181. def unparsedEntities: Seq[EntityDecl]

    Permalink

    An unordered set of unparsed entity information items, one for each unparsed entity declared in the DTD.

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

    Permalink
    Definition Classes
    GenericTraversableTemplate
  183. def unzip3[A1, A2, A3](implicit asTriple: (Node) ⇒ (A1, A2, A3)): (collection.immutable.Seq[A1], collection.immutable.Seq[A2], collection.immutable.Seq[A3])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  184. def updated[B >: Node, That](index: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  185. var version: Option[String]

    Permalink

    A string representing the XML version of the document.

    A string representing the XML version of the document. This property is derived from the XML declaration optionally present at the beginning of the document entity, and has no value (None) if there is no XML declaration.

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

    Permalink
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  187. def view: SeqView[Node, NodeSeq]

    Permalink
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  188. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  189. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  190. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  191. def withFilter(p: (Node) ⇒ Boolean): FilterMonadic[Node, NodeSeq]

    Permalink
    Definition Classes
    TraversableLike → FilterMonadic
  192. final def xml_!=(other: Any): Boolean

    Permalink
    Definition Classes
    Equality
  193. final def xml_==(other: Any): Boolean

    Permalink
    Definition Classes
    Equality
  194. def xml_sameElements[A](that: Iterable[A]): Boolean

    Permalink
    Definition Classes
    NodeSeq
  195. def zip[A1 >: Node, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  196. def zipAll[B, A1 >: Node, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  197. def zipWithIndex[A1 >: Node, That](implicit bf: CanBuildFrom[NodeSeq, (A1, Int), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

Deprecated Value Members

  1. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

Inherited from Serializable

Inherited from java.io.Serializable

Inherited from XMLEvent

Inherited from NodeSeq

Inherited from Equality

Inherited from collection.immutable.Seq[Node]

Inherited from collection.immutable.Iterable[Node]

Inherited from collection.immutable.Traversable[Node]

Inherited from Immutable

Inherited from AbstractSeq[Node]

Inherited from collection.Seq[Node]

Inherited from SeqLike[Node, NodeSeq]

Inherited from GenSeq[Node]

Inherited from GenSeqLike[Node, NodeSeq]

Inherited from PartialFunction[Int, Node]

Inherited from (Int) ⇒ Node

Inherited from AbstractIterable[Node]

Inherited from collection.Iterable[Node]

Inherited from IterableLike[Node, NodeSeq]

Inherited from Equals

Inherited from GenIterable[Node]

Inherited from GenIterableLike[Node, NodeSeq]

Inherited from AbstractTraversable[Node]

Inherited from collection.Traversable[Node]

Inherited from GenTraversable[Node]

Inherited from GenericTraversableTemplate[Node, collection.immutable.Seq]

Inherited from TraversableLike[Node, NodeSeq]

Inherited from GenTraversableLike[Node, NodeSeq]

Inherited from Parallelizable[Node, ParSeq[Node]]

Inherited from collection.TraversableOnce[Node]

Inherited from GenTraversableOnce[Node]

Inherited from FilterMonadic[Node, NodeSeq]

Inherited from HasNewBuilder[Node, NodeSeq]

Inherited from AnyRef

Inherited from Any

Ungrouped