Packages

c

scala.xml

SpecialNode

abstract class SpecialNode extends Node with XMLEvent

SpecialNode is a special XML node which represents either text (PCDATA), a comment, a PI, or an entity ref.

SpecialNodes also play the role of scala.xml.pull.XMLEvents for pull-parsing.

Linear Supertypes
XMLEvent, Node, 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
Known Subclasses
Atom, Comment, EntityRef, PCData, ProcInstr, Text, Unparsed
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SpecialNode
  2. XMLEvent
  3. Node
  4. NodeSeq
  5. Equality
  6. Seq
  7. Iterable
  8. Traversable
  9. Immutable
  10. AbstractSeq
  11. Seq
  12. SeqLike
  13. GenSeq
  14. GenSeqLike
  15. PartialFunction
  16. Function1
  17. AbstractIterable
  18. Iterable
  19. IterableLike
  20. Equals
  21. GenIterable
  22. GenIterableLike
  23. AbstractTraversable
  24. Traversable
  25. GenTraversable
  26. GenericTraversableTemplate
  27. TraversableLike
  28. GenTraversableLike
  29. Parallelizable
  30. TraversableOnce
  31. GenTraversableOnce
  32. FilterMonadic
  33. HasNewBuilder
  34. AnyRef
  35. 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](z: B)(op: (B, Node) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  6. def :+[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  7. def :\[B](z: B)(op: (Node, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  8. 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 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
  9. 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
  10. 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";
    • \\ "_" 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
  11. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  12. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  13. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  14. def aggregate[B](z: ⇒ B)(seqop: (B, Node) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  15. def andThen[C](k: (Node) ⇒ C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  16. def apply(f: (Node) ⇒ Boolean): NodeSeq
    Definition Classes
    NodeSeq
  17. def apply(i: Int): Node
    Definition Classes
    NodeSeq → SeqLike → GenSeqLike → Function1
  18. def applyOrElse[A1 <: Int, B1 >: Node](x: A1, default: (A1) ⇒ B1): B1
    Definition Classes
    PartialFunction
  19. final def attribute(uri: String, key: String): Option[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
  20. final def attribute(key: String): Option[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
  21. final def attributes: Null.type

    always empty

    always empty

    returns

    all attributes of this node

    Definition Classes
    SpecialNode → Node
  22. 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
  23. 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
  24. final def child: collection.immutable.Nil.type

    always empty

    always empty

    returns

    all children of this node

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

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

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

    Definition Classes
    Node
  40. def diff[B >: Node](that: GenSeq[B]): NodeSeq
    Definition Classes
    SeqLike → GenSeqLike
  41. def distinct: NodeSeq
    Definition Classes
    SeqLike → GenSeqLike
  42. 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
  43. def doTransform: Boolean
    Definition Classes
    Node
  44. def drop(n: Int): NodeSeq
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  45. def dropRight(n: Int): NodeSeq
    Definition Classes
    IterableLike
  46. def dropWhile(p: (Node) ⇒ Boolean): NodeSeq
    Definition Classes
    TraversableLike → GenTraversableLike
  47. def endsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  48. def equals(other: Any): Boolean
    Definition Classes
    Equality → Equals → AnyRef → Any
  49. def exists(p: (Node) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  50. def filter(p: (Node) ⇒ Boolean): NodeSeq
    Definition Classes
    TraversableLike → GenTraversableLike
  51. def filterNot(p: (Node) ⇒ Boolean): NodeSeq
    Definition Classes
    TraversableLike → GenTraversableLike
  52. def find(p: (Node) ⇒ Boolean): Option[Node]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  53. def flatMap[B, That](f: (Node) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  54. def flatten[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): collection.immutable.Seq[B]
    Definition Classes
    GenericTraversableTemplate
  55. def fold[A1 >: Node](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  56. def foldLeft[B](z: B)(op: (B, Node) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  57. def foldRight[B](z: B)(op: (Node, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  58. def forall(p: (Node) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  59. def foreach[U](f: (Node) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  60. def genericBuilder[B]: Builder[B, collection.immutable.Seq[B]]
    Definition Classes
    GenericTraversableTemplate
  61. 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
  62. def groupBy[K](f: (Node) ⇒ K): Map[K, NodeSeq]
    Definition Classes
    TraversableLike → GenTraversableLike
  63. def grouped(size: Int): collection.Iterator[NodeSeq]
    Definition Classes
    IterableLike
  64. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  65. 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
  66. def head: Node
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  67. def headOption: Option[Node]
    Definition Classes
    TraversableLike → GenTraversableLike
  68. def indexOf[B >: Node](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  69. def indexOf[B >: Node](elem: B): Int
    Definition Classes
    GenSeqLike
  70. def indexOfSlice[B >: Node](that: GenSeq[B], from: Int): Int
    Definition Classes
    SeqLike
  71. def indexOfSlice[B >: Node](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  72. def indexWhere(p: (Node) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  73. def indexWhere(p: (Node) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  74. def indices: collection.immutable.Range
    Definition Classes
    SeqLike
  75. def init: NodeSeq
    Definition Classes
    TraversableLike → GenTraversableLike
  76. def inits: collection.Iterator[NodeSeq]
    Definition Classes
    TraversableLike
  77. def intersect[B >: Node](that: GenSeq[B]): NodeSeq
    Definition Classes
    SeqLike → GenSeqLike
  78. def isAtom: Boolean

    used internally.

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

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

    Appends qualified name of this node to StringBuilder.

    Appends qualified name of this node to StringBuilder.

    Definition Classes
    Node
  103. final def namespace: Null

    always Node.EmptyNamespace

    always Node.EmptyNamespace

    Definition Classes
    SpecialNode → Node
  104. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. def nonEmptyChildren: Seq[Node]

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

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

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

    prefix of this node

    prefix of this node

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

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

    returns a sequence consisting of only this node

    returns a sequence consisting of only this node

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

    Same as toString(false).

    Same as toString(false).

    Definition Classes
    Node → NodeSeq → SeqLike → Function1 → TraversableLike → AnyRef → Any
  167. def toTraversable: collection.Traversable[Node]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  168. def toVector: Vector[Node]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  169. 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.

  170. def union[B >: Node, That](that: GenSeq[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  171. def unzip[A1, A2](implicit asPair: (Node) ⇒ (A1, A2)): (collection.immutable.Seq[A1], collection.immutable.Seq[A2])
    Definition Classes
    GenericTraversableTemplate
  172. 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
  173. def updated[B >: Node, That](index: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  174. def view(from: Int, until: Int): SeqView[Node, NodeSeq]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  175. def view: SeqView[Node, NodeSeq]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  176. def withFilter(p: (Node) ⇒ Boolean): FilterMonadic[Node, NodeSeq]
    Definition Classes
    TraversableLike → FilterMonadic
  177. def xmlType(): TypeSymbol

    Returns a type symbol (e.g.

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

    Definition Classes
    Node
  178. final def xml_!=(other: Any): Boolean
    Definition Classes
    Equality
  179. final def xml_==(other: Any): Boolean
    Definition Classes
    Equality
  180. def xml_sameElements[A](that: Iterable[A]): Boolean
    Definition Classes
    NodeSeq
  181. def zip[A1 >: Node, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  182. 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
  183. def zipWithIndex[A1 >: Node, That](implicit bf: CanBuildFrom[NodeSeq, (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike