Packages

c

scala.xml

SpecialNode

abstract class SpecialNode extends Node

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

Instance Constructors

  1. new SpecialNode()

Type Members

  1. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def buildString(sb: StringBuilder): StringBuilder

    Append string representation to the given string buffer argument.

  2. abstract def label: String

    label of this node.

    label of this node. I.e. "foo" for <foo/>)

    Definition Classes
    Node

Concrete Value Members

  1. def ++[B >: Node, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  2. def ++:[B >: Node, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike
  3. def ++:[B >: Node, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike
  4. def +:[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  5. def :+[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  6. def \(that: String): NodeSeq

    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 children that are labelled with "foo";
    • this \ "_" to get a list of all child elements (wildcard);
    • this \ "@foo" to get the unprefixed attribute "foo" of this;
    • this \ "@{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
  7. def \@(attributeName: String): String

    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
  8. def \\(that: String): NodeSeq

    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", including this;
    • this \\ "_" to get a list of all elements (wildcard), including this;
    • this \\ "@foo" to get all unprefixed attributes "foo";
    • this \\ "@{uri}foo" to get all 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
  9. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  10. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  11. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  12. def aggregate[B](z: ⇒ B)(seqop: (B, Node) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  13. def andThen[C](k: (Node) ⇒ C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  14. def apply(f: (Node) ⇒ Boolean): NodeSeq
    Definition Classes
    NodeSeq
  15. def apply(i: Int): Node
    Definition Classes
    NodeSeq → SeqLike → GenSeqLike → Function1
  16. def applyOrElse[A1 <: Int, B1 >: Node](x: A1, default: (A1) ⇒ B1): B1
    Definition Classes
    PartialFunction
  17. final def attribute(uri: String, key: String): Option[collection.Seq[Node]]

    Convenience method, looks up a prefixed attribute in attributes of this node.

    Convenience method, looks up a prefixed attribute in attributes of this node. Same as attributes.getValue(uri, this, key)-

    uri

    namespace of queried attribute (may not be null).

    key

    of queried attribute.

    returns

    value of PrefixedAttribute with given namespace and given key, otherwise null.

    Definition Classes
    Node
  18. final def attribute(key: String): Option[collection.Seq[Node]]

    Convenience method, looks up an unprefixed attribute in attributes of this node.

    Convenience method, looks up an unprefixed attribute in attributes of this node. Same as attributes.getValue(key)

    key

    of queried attribute.

    returns

    value of UnprefixedAttribute with given key in attributes, if it exists, otherwise null.

    Definition Classes
    Node
  19. final def attributes: Null.type

    always empty

    always empty

    returns

    all attributes of this node

    Definition Classes
    SpecialNode → Node
  20. def buildString(stripComments: Boolean): String

    String representation of this node

    String representation of this node

    stripComments

    if true, strips comment nodes from result

    Definition Classes
    Node
  21. 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.

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

    Definition Classes
    Node → NodeSeq → Equality → IterableLike → Equals
  22. final def child: collection.immutable.Nil.type

    always empty

    always empty

    returns

    all children of this node

    Definition Classes
    SpecialNode → Node
  23. def collect[B, That](pf: PartialFunction[Node, B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  24. def collectFirst[B](pf: PartialFunction[Node, B]): Option[B]
    Definition Classes
    TraversableOnce
  25. def combinations(n: Int): collection.Iterator[NodeSeq]
    Definition Classes
    SeqLike
  26. def companion: GenericCompanion[collection.immutable.Seq]
    Definition Classes
    Seq → Seq → GenSeq → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  27. def compose[A](g: (A) ⇒ Int): (A) ⇒ Node
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  28. def contains[A1 >: Node](elem: A1): Boolean
    Definition Classes
    SeqLike
  29. def containsSlice[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike
  30. def copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  31. def copyToArray[B >: Node](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  32. def copyToArray[B >: Node](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def copyToBuffer[B >: Node](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  34. def corresponds[B](that: GenSeq[B])(p: (Node, B) ⇒ Boolean): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  35. def count(p: (Node) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  36. def descendant: List[Node]

    Descendant axis (all descendants of this node, not including node itself) includes all text nodes, element nodes, comments and processing instructions.

    Descendant axis (all descendants of this node, not including node itself) includes all text nodes, element nodes, comments and processing instructions.

    Definition Classes
    Node
  37. def descendant_or_self: List[Node]

    Descendant axis (all descendants of this node, including this node) includes all text nodes, element nodes, comments and processing instructions.

    Descendant axis (all descendants of this node, including this node) includes all text nodes, element nodes, comments and processing instructions.

    Definition Classes
    Node
  38. def diff[B >: Node](that: GenSeq[B]): NodeSeq
    Definition Classes
    SeqLike → GenSeqLike
  39. def distinct: NodeSeq
    Definition Classes
    SeqLike → GenSeqLike
  40. def doCollectNamespaces: Boolean

    The logic formerly found in typeTag$, as best I could infer it.

    The logic formerly found in typeTag$, as best I could infer it.

    Definition Classes
    Node
  41. def doTransform: Boolean
    Definition Classes
    Node
  42. def drop(n: Int): NodeSeq
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  43. def dropRight(n: Int): NodeSeq
    Definition Classes
    IterableLike
  44. def dropWhile(p: (Node) ⇒ Boolean): NodeSeq
    Definition Classes
    TraversableLike → GenTraversableLike
  45. def endsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  46. def equals(other: Any): Boolean
    Definition Classes
    Equality → Equals → AnyRef → Any
  47. def exists(p: (Node) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  48. def filter(p: (Node) ⇒ Boolean): NodeSeq
    Definition Classes
    TraversableLike → GenTraversableLike
  49. def filterNot(p: (Node) ⇒ Boolean): NodeSeq
    Definition Classes
    TraversableLike → GenTraversableLike
  50. def find(p: (Node) ⇒ Boolean): Option[Node]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  51. def flatMap[B, That](f: (Node) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  52. def flatten[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): collection.immutable.Seq[B]
    Definition Classes
    GenericTraversableTemplate
  53. def fold[A1 >: Node](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  54. def foldLeft[B](z: B)(op: (B, Node) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  55. def foldRight[B](z: B)(op: (Node, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  56. def forall(p: (Node) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  57. def foreach[U](f: (Node) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  58. def genericBuilder[B]: Builder[B, collection.immutable.Seq[B]]
    Definition Classes
    GenericTraversableTemplate
  59. def getNamespace(pre: String): String

    Convenience method, same as scope.getURI(pre) but additionally checks if scope is null.

    Convenience method, same as scope.getURI(pre) but additionally checks if scope is null.

    pre

    the prefix whose namespace name we would like to obtain

    returns

    the namespace if scope != null and prefix was found, else null

    Definition Classes
    Node
  60. def groupBy[K](f: (Node) ⇒ K): Map[K, NodeSeq]
    Definition Classes
    TraversableLike → GenTraversableLike
  61. def grouped(size: Int): collection.Iterator[NodeSeq]
    Definition Classes
    IterableLike
  62. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  63. 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.

    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
  64. def head: Node
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  65. def headOption: Option[Node]
    Definition Classes
    TraversableLike → GenTraversableLike
  66. def indexOf[B >: Node](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  67. def indexOf[B >: Node](elem: B): Int
    Definition Classes
    GenSeqLike
  68. def indexOfSlice[B >: Node](that: GenSeq[B], from: Int): Int
    Definition Classes
    SeqLike
  69. def indexOfSlice[B >: Node](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  70. def indexWhere(p: (Node) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  71. def indexWhere(p: (Node) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  72. def indices: collection.immutable.Range
    Definition Classes
    SeqLike
  73. def init: NodeSeq
    Definition Classes
    TraversableLike → GenTraversableLike
  74. def inits: collection.Iterator[NodeSeq]
    Definition Classes
    TraversableLike
  75. def intersect[B >: Node](that: GenSeq[B]): NodeSeq
    Definition Classes
    SeqLike → GenSeqLike
  76. def isAtom: Boolean

    used internally.

    used internally. Atom/Molecule = -1 PI = -2 Comment = -3 EntityRef = -5

    Definition Classes
    Node
  77. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    GenSeqLike
  78. def isEmpty: Boolean
    Definition Classes
    SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  79. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  80. def iterator: collection.Iterator[Node]
    Definition Classes
    NodeSeq → IterableLike → GenIterableLike
  81. def last: Node
    Definition Classes
    TraversableLike → GenTraversableLike
  82. def lastIndexOf[B >: Node](elem: B, end: Int): Int
    Definition Classes
    GenSeqLike
  83. def lastIndexOf[B >: Node](elem: B): Int
    Definition Classes
    GenSeqLike
  84. def lastIndexOfSlice[B >: Node](that: GenSeq[B], end: Int): Int
    Definition Classes
    SeqLike
  85. def lastIndexOfSlice[B >: Node](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  86. def lastIndexWhere(p: (Node) ⇒ Boolean, end: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  87. def lastIndexWhere(p: (Node) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  88. def lastOption: Option[Node]
    Definition Classes
    TraversableLike → GenTraversableLike
  89. def length: Int
    Definition Classes
    NodeSeq → SeqLike → GenSeqLike
  90. def lengthCompare(len: Int): Int
    Definition Classes
    SeqLike
  91. def lift: (Int) ⇒ Option[Node]
    Definition Classes
    PartialFunction
  92. def map[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  93. def max[B >: Node](implicit cmp: Ordering[B]): Node
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def maxBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def min[B >: Node](implicit cmp: Ordering[B]): Node
    Definition Classes
    TraversableOnce → GenTraversableOnce
  96. def minBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. def nameToString(sb: StringBuilder): StringBuilder

    Appends qualified name of this node to StringBuilder.

    Appends qualified name of this node to StringBuilder.

    Definition Classes
    Node
  101. final def namespace: Null

    always Node.EmptyNamespace

    always Node.EmptyNamespace

    Definition Classes
    SpecialNode → Node
  102. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def nonEmptyChildren: collection.Seq[Node]

    Children which do not stringify to "" (needed for equality)

    Children which do not stringify to "" (needed for equality)

    Definition Classes
    Node
  104. def orElse[A1 <: Int, B1 >: Node](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  105. def padTo[B >: Node, That](len: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  106. def par: ParSeq[Node]
    Definition Classes
    Parallelizable
  107. def partition(p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq)
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def patch[B >: Node, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  109. def permutations: collection.Iterator[NodeSeq]
    Definition Classes
    SeqLike
  110. def prefix: String

    prefix of this node

    prefix of this node

    Definition Classes
    Node
  111. def prefixLength(p: (Node) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  112. def product[B >: Node](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def reduce[A1 >: Node](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. def reduceLeft[B >: Node](op: (B, Node) ⇒ B): B
    Definition Classes
    TraversableOnce
  115. def reduceLeftOption[B >: Node](op: (B, Node) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def reduceOption[A1 >: Node](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. def reduceRight[B >: Node](op: (Node, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  118. def reduceRightOption[B >: Node](op: (Node, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. def repr: NodeSeq
    Definition Classes
    TraversableLike → GenTraversableLike
  120. def reverse: NodeSeq
    Definition Classes
    SeqLike → GenSeqLike
  121. def reverseIterator: collection.Iterator[Node]
    Definition Classes
    SeqLike
  122. def reverseMap[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  123. def runWith[U](action: (Node) ⇒ U): (Int) ⇒ Boolean
    Definition Classes
    PartialFunction
  124. def sameElements[B >: Node](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  125. def scan[B >: Node, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  126. def scanLeft[B, That](z: B)(op: (B, Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  127. def scanRight[B, That](z: B)(op: (Node, B) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    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.

  128. def scope: NamespaceBinding

    method returning the namespace bindings of this node.

    method returning the namespace bindings of this node. by default, this is TopScope, which means there are no namespace bindings except the predefined one for "xml".

    Definition Classes
    Node
  129. def segmentLength(p: (Node) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  130. def seq: collection.immutable.Seq[Node]
    Definition Classes
    Seq → Seq → GenSeq → GenSeqLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  131. def size: Int
    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  132. def slice(from: Int, until: Int): NodeSeq
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  133. def sliding(size: Int, step: Int): collection.Iterator[NodeSeq]
    Definition Classes
    IterableLike
  134. def sliding(size: Int): collection.Iterator[NodeSeq]
    Definition Classes
    IterableLike
  135. def sortBy[B](f: (Node) ⇒ B)(implicit ord: math.Ordering[B]): NodeSeq
    Definition Classes
    SeqLike
  136. def sortWith(lt: (Node, Node) ⇒ Boolean): NodeSeq
    Definition Classes
    SeqLike
  137. def sorted[B >: Node](implicit ord: math.Ordering[B]): NodeSeq
    Definition Classes
    SeqLike
  138. def span(p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq)
    Definition Classes
    TraversableLike → GenTraversableLike
  139. def splitAt(n: Int): (NodeSeq, NodeSeq)
    Definition Classes
    TraversableLike → GenTraversableLike
  140. def startsWith[B](that: GenSeq[B], offset: Int): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  141. def startsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    GenSeqLike
  142. def strict_!=(other: Equality): Boolean
    Definition Classes
    Equality
  143. def strict_==(other: Equality): Boolean
    Definition Classes
    Node → NodeSeq → Equality
  144. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  145. def sum[B >: Node](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  146. def tail: NodeSeq
    Definition Classes
    TraversableLike → GenTraversableLike
  147. def tails: collection.Iterator[NodeSeq]
    Definition Classes
    TraversableLike
  148. def take(n: Int): NodeSeq
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  149. def takeRight(n: Int): NodeSeq
    Definition Classes
    IterableLike
  150. def takeWhile(p: (Node) ⇒ Boolean): NodeSeq
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  151. def text: String

    Returns a text representation of this node.

    Returns a text representation of this node. Note that this is not equivalent to the XPath node-test called text(), it is rather an implementation of the XPath function string() Martin to Burak: to do: if you make this method abstract, the compiler will now complain if there's no implementation in a subclass. Is this what we want? Note that this would break doc/DocGenator and doc/ModelToXML, with an error message like:

    doc\DocGenerator.scala:1219: error: object creation impossible, since there is a deferred declaration of method text in class Node of type => String which is not implemented in a subclass
new SpecialNode {
^
    Definition Classes
    Node → NodeSeq
  152. def theSeq: collection.Seq[Node]

    returns a sequence consisting of only this node

    returns a sequence consisting of only this node

    Definition Classes
    Node → NodeSeq
  153. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Node, Col[Node]]): Col[Node]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  154. def toArray[B >: Node](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  155. def toBuffer[B >: Node]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  156. def toIndexedSeq: collection.immutable.IndexedSeq[Node]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  157. def toIterable: collection.Iterable[Node]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  158. def toIterator: collection.Iterator[Node]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  159. def toList: List[Node]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  160. def toMap[T, U](implicit ev: <:<[Node, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  161. def toSeq: collection.immutable.Seq[Node]
    Definition Classes
    Seq → SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  162. def toSet[B >: Node]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  163. def toStream: collection.immutable.Stream[Node]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  164. def toString(): String

    Same as toString(false).

    Same as toString(false).

    Definition Classes
    Node → NodeSeq → SeqLike → Function1 → TraversableLike → AnyRef → Any
  165. def toTraversable: collection.Traversable[Node]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  166. def toVector: Vector[Node]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  167. def transpose[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): collection.immutable.Seq[collection.immutable.Seq[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  168. def union[B >: Node, That](that: GenSeq[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  169. def unzip[A1, A2](implicit asPair: (Node) ⇒ (A1, A2)): (collection.immutable.Seq[A1], collection.immutable.Seq[A2])
    Definition Classes
    GenericTraversableTemplate
  170. def unzip3[A1, A2, A3](implicit asTriple: (Node) ⇒ (A1, A2, A3)): (collection.immutable.Seq[A1], collection.immutable.Seq[A2], collection.immutable.Seq[A3])
    Definition Classes
    GenericTraversableTemplate
  171. def updated[B >: Node, That](index: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  172. def view(from: Int, until: Int): SeqView[Node, NodeSeq]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  173. def view: SeqView[Node, NodeSeq]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  174. def withFilter(p: (Node) ⇒ Boolean): FilterMonadic[Node, NodeSeq]
    Definition Classes
    TraversableLike → FilterMonadic
  175. def xmlType(): TypeSymbol

    Returns a type symbol (e.g.

    Returns a type symbol (e.g. DTD, XSD), default null.

    Definition Classes
    Node
  176. final def xml_!=(other: Any): Boolean
    Definition Classes
    Equality
  177. final def xml_==(other: Any): Boolean
    Definition Classes
    Equality
  178. def xml_sameElements[A](that: Iterable[A]): Boolean
    Definition Classes
    NodeSeq
  179. def zip[A1 >: Node, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  180. def zipAll[B, A1 >: Node, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  181. def zipWithIndex[A1 >: Node, That](implicit bf: CanBuildFrom[NodeSeq, (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike

Deprecated Value Members

  1. def /:[B](z: B)(op: (B, Node) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldLeft instead of /:

  2. def :\[B](z: B)(op: (Node, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldRight instead of :\