Packages

c

scala.xml

SpecialNode

abstract class SpecialNode extends Node with XMLEvent

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SpecialNode
  2. XMLEvent
  3. Node
  4. NodeSeq
  5. Serializable
  6. Equality
  7. ScalaVersionSpecificNodeSeq
  8. StrictOptimizedSeqOps
  9. StrictOptimizedSeqOps
  10. StrictOptimizedIterableOps
  11. Seq
  12. SeqOps
  13. Iterable
  14. AbstractSeq
  15. Seq
  16. Equals
  17. SeqOps
  18. PartialFunction
  19. Function1
  20. AbstractIterable
  21. Iterable
  22. IterableFactoryDefaults
  23. IterableOps
  24. IterableOnceOps
  25. IterableOnce
  26. AnyRef
  27. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new SpecialNode()

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. final def ++(suffix: Seq[Node]): NodeSeq
    Definition Classes
    ScalaVersionSpecificNodeSeq
    Annotations
    @inline()
  2. final def ++[B >: Node](suffix: collection.IterableOnce[B]): collection.immutable.Seq[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  3. final def ++:[B >: Node](prefix: collection.IterableOnce[B]): collection.immutable.Seq[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  4. final def +:[B >: Node](elem: B): collection.immutable.Seq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  5. final def :+[B >: Node](elem: B): collection.immutable.Seq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  6. final def :++[B >: Node](suffix: collection.IterableOnce[B]): collection.immutable.Seq[B]
    Definition Classes
    SeqOps
    Annotations
    @inline()
  7. 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
  8. 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
  9. 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
  10. final def addString(b: collection.mutable.StringBuilder): collection.mutable.StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  11. final def addString(b: collection.mutable.StringBuilder, sep: String): collection.mutable.StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  12. def addString(b: collection.mutable.StringBuilder, start: String, sep: String, end: String): collection.mutable.StringBuilder
    Definition Classes
    IterableOnceOps
  13. def andThen[C](k: PartialFunction[Node, C]): PartialFunction[Int, C]
    Definition Classes
    PartialFunction
  14. def andThen[C](k: (Node) => C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  15. def appended(base: Node): NodeSeq
    Definition Classes
    ScalaVersionSpecificNodeSeq
  16. def appended[B >: Node](elem: B): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  17. def appendedAll(suffix: collection.IterableOnce[Node]): NodeSeq
    Definition Classes
    ScalaVersionSpecificNodeSeq
  18. def appendedAll[B >: Node](suffix: collection.IterableOnce[B]): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  19. def apply(f: (Node) => Boolean): NodeSeq
    Definition Classes
    NodeSeq
  20. def apply(i: Int): Node
    Definition Classes
    NodeSeq → SeqOps → Function1
  21. def applyOrElse[A1 <: Int, B1 >: Node](x: A1, default: (A1) => B1): B1
    Definition Classes
    PartialFunction
  22. 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
  23. 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
  24. final def attributes: Null

    always empty

    always empty

    returns

    all attributes of this node

    Definition Classes
    SpecialNodeNode
  25. 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
  26. 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
    NodeNodeSeqEquality → Seq → Equals
  27. final def child: collection.immutable.Nil

    always empty

    always empty

    returns

    all children of this node

    Definition Classes
    SpecialNodeNode
  28. def collect[B](pf: PartialFunction[Node, B]): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  29. def collectFirst[B](pf: PartialFunction[Node, B]): Option[B]
    Definition Classes
    IterableOnceOps
  30. def combinations(n: Int): collection.Iterator[NodeSeq]
    Definition Classes
    SeqOps
  31. def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, Node]
    Definition Classes
    PartialFunction
  32. def compose[A](g: (A) => Int): (A) => Node
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  33. def concat(suffix: collection.IterableOnce[Node]): NodeSeq
    Definition Classes
    ScalaVersionSpecificNodeSeq
  34. final def concat[B >: Node](suffix: collection.IterableOnce[B]): collection.immutable.Seq[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  35. def contains[A1 >: Node](elem: A1): Boolean
    Definition Classes
    SeqOps
  36. def containsSlice[B](that: collection.Seq[B]): Boolean
    Definition Classes
    SeqOps
  37. def copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  38. def copyToArray[B >: Node](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
  39. def copyToArray[B >: Node](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
  40. def corresponds[B](that: collection.Seq[B])(p: (Node, B) => Boolean): Boolean
    Definition Classes
    SeqOps
  41. def corresponds[B](that: collection.IterableOnce[B])(p: (Node, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  42. def count(p: (Node) => Boolean): Int
    Definition Classes
    IterableOnceOps
  43. 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
  44. 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
  45. def diff[B >: Node](that: collection.Seq[B]): NodeSeq
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  46. def distinct: NodeSeq
    Definition Classes
    SeqOps
  47. def distinctBy[B](f: (Node) => B): NodeSeq
    Definition Classes
    StrictOptimizedSeqOps → StrictOptimizedSeqOps → SeqOps
  48. 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
  49. def doTransform: Boolean
    Definition Classes
    Node
  50. def drop(n: Int): NodeSeq
    Definition Classes
    IterableOps → IterableOnceOps
  51. def dropRight(n: Int): NodeSeq
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  52. def dropWhile(p: (Node) => Boolean): NodeSeq
    Definition Classes
    IterableOps → IterableOnceOps
  53. def elementWise: ElementWiseExtractor[Int, Node]
    Definition Classes
    PartialFunction
  54. def empty: NodeSeq
    Definition Classes
    ScalaVersionSpecificNodeSeq → IterableOps
  55. def endsWith[B >: Node](that: collection.Iterable[B]): Boolean
    Definition Classes
    SeqOps
  56. def equals(other: Any): Boolean
    Definition Classes
    Equality → Equals → AnyRef → Any
  57. def exists(p: (Node) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  58. def filter(pred: (Node) => Boolean): NodeSeq
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  59. def filterNot(pred: (Node) => Boolean): NodeSeq
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  60. def find(p: (Node) => Boolean): Option[Node]
    Definition Classes
    IterableOnceOps
  61. def findLast(p: (Node) => Boolean): Option[Node]
    Definition Classes
    SeqOps
  62. def flatMap(f: (Node) => collection.IterableOnce[Node]): NodeSeq
    Definition Classes
    ScalaVersionSpecificNodeSeq
  63. def flatMap[B](f: (Node) => collection.IterableOnce[B]): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  64. def flatten[B](implicit toIterableOnce: (Node) => collection.IterableOnce[B]): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  65. def fold[A1 >: Node](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  66. def foldLeft[B](z: B)(op: (B, Node) => B): B
    Definition Classes
    IterableOnceOps
  67. def foldRight[B](z: B)(op: (Node, B) => B): B
    Definition Classes
    IterableOnceOps
  68. def forall(p: (Node) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  69. def foreach[U](f: (Node) => U): Unit
    Definition Classes
    IterableOnceOps
  70. def fromSpecific(coll: collection.IterableOnce[Node]): NodeSeq
    Definition Classes
    ScalaVersionSpecificNodeSeq → IterableOps
  71. 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
  72. def groupBy[K](f: (Node) => K): Map[K, NodeSeq]
    Definition Classes
    IterableOps
  73. def groupMap[K, B](key: (Node) => K)(f: (Node) => B): Map[K, collection.immutable.Seq[B]]
    Definition Classes
    IterableOps
  74. def groupMapReduce[K, B](key: (Node) => K)(f: (Node) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  75. def grouped(size: Int): collection.Iterator[NodeSeq]
    Definition Classes
    IterableOps
  76. 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
  77. def head: Node
    Definition Classes
    IterableOps
  78. def headOption: Option[Node]
    Definition Classes
    IterableOps
  79. def indexOf[B >: Node](elem: B): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override indexOf(elem, from) instead - indexOf(elem) calls indexOf(elem, 0)", "2.13.0")
  80. def indexOf[B >: Node](elem: B, from: Int): Int
    Definition Classes
    SeqOps
  81. def indexOfSlice[B >: Node](that: collection.Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override indexOfSlice(that, from) instead - indexOfSlice(that) calls indexOfSlice(that, 0)", "2.13.0")
  82. def indexOfSlice[B >: Node](that: collection.Seq[B], from: Int): Int
    Definition Classes
    SeqOps
  83. def indexWhere(p: (Node) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override indexWhere(p, from) instead - indexWhere(p) calls indexWhere(p, 0)", "2.13.0")
  84. def indexWhere(p: (Node) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  85. def indices: collection.immutable.Range
    Definition Classes
    SeqOps
  86. def init: NodeSeq
    Definition Classes
    IterableOps
  87. def inits: collection.Iterator[NodeSeq]
    Definition Classes
    IterableOps
  88. def intersect[B >: Node](that: collection.Seq[B]): NodeSeq
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  89. def isAtom: Boolean

    used internally.

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

    Definition Classes
    Node
  90. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    SeqOps
  91. def isEmpty: Boolean
    Definition Classes
    SeqOps → IterableOnceOps
  92. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  93. def iterableFactory: SeqFactory[collection.immutable.Seq]
    Definition Classes
    Seq → Seq → Iterable → Iterable → IterableOps
  94. def iterator: collection.Iterator[Node]
    Definition Classes
    NodeSeq → IterableOnce
  95. def knownSize: Int
    Definition Classes
    IterableOnce
  96. def last: Node
    Definition Classes
    IterableOps
  97. def lastIndexOf[B >: Node](elem: B, end: Int): Int
    Definition Classes
    SeqOps
  98. def lastIndexOfSlice[B >: Node](that: collection.Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override lastIndexOfSlice(that, end) instead - lastIndexOfSlice(that) calls lastIndexOfSlice(that, Int.MaxValue)", "2.13.0")
  99. def lastIndexOfSlice[B >: Node](that: collection.Seq[B], end: Int): Int
    Definition Classes
    SeqOps
  100. def lastIndexWhere(p: (Node) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override lastIndexWhere(p, end) instead - lastIndexWhere(p) calls lastIndexWhere(p, Int.MaxValue)", "2.13.0")
  101. def lastIndexWhere(p: (Node) => Boolean, end: Int): Int
    Definition Classes
    SeqOps
  102. def lastOption: Option[Node]
    Definition Classes
    IterableOps
  103. def lazyZip[B](that: collection.Iterable[B]): LazyZip2[Node, B, SpecialNode.this.type]
    Definition Classes
    Iterable
  104. def length: Int
    Definition Classes
    NodeSeq → SeqOps
  105. def lengthCompare(that: collection.Iterable[_]): Int
    Definition Classes
    SeqOps
  106. def lengthCompare(len: Int): Int
    Definition Classes
    SeqOps
  107. final def lengthIs: SizeCompareOps
    Definition Classes
    SeqOps
    Annotations
    @inline()
  108. def lift: (Int) => Option[Node]
    Definition Classes
    PartialFunction
  109. def map(f: (Node) => Node): NodeSeq
    Definition Classes
    ScalaVersionSpecificNodeSeq
  110. def map[B](f: (Node) => B): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  111. def max[B >: Node](implicit ord: math.Ordering[B]): Node
    Definition Classes
    IterableOnceOps
  112. def maxBy[B](f: (Node) => B)(implicit cmp: math.Ordering[B]): Node
    Definition Classes
    IterableOnceOps
  113. def maxByOption[B](f: (Node) => B)(implicit cmp: math.Ordering[B]): Option[Node]
    Definition Classes
    IterableOnceOps
  114. def maxOption[B >: Node](implicit ord: math.Ordering[B]): Option[Node]
    Definition Classes
    IterableOnceOps
  115. def min[B >: Node](implicit ord: math.Ordering[B]): Node
    Definition Classes
    IterableOnceOps
  116. def minBy[B](f: (Node) => B)(implicit cmp: math.Ordering[B]): Node
    Definition Classes
    IterableOnceOps
  117. def minByOption[B](f: (Node) => B)(implicit cmp: math.Ordering[B]): Option[Node]
    Definition Classes
    IterableOnceOps
  118. def minOption[B >: Node](implicit ord: math.Ordering[B]): Option[Node]
    Definition Classes
    IterableOnceOps
  119. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  120. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  121. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  122. def nameToString(sb: StringBuilder): StringBuilder

    Appends qualified name of this node to StringBuilder.

    Appends qualified name of this node to StringBuilder.

    Definition Classes
    Node
  123. final def namespace: Null

    always Node.EmptyNamespace

    always Node.EmptyNamespace

    Definition Classes
    SpecialNodeNode
  124. def newSpecificBuilder: Builder[Node, NodeSeq]
    Definition Classes
    ScalaVersionSpecificNodeSeq → IterableOps
  125. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
  126. 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
  127. def orElse[A1 <: Int, B1 >: Node](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  128. def padTo[B >: Node](len: Int, elem: B): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  129. def partition(p: (Node) => Boolean): (NodeSeq, NodeSeq)
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  130. def partitionMap[A1, A2](f: (Node) => Either[A1, A2]): (collection.immutable.Seq[A1], collection.immutable.Seq[A2])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  131. def patch[B >: Node](from: Int, other: collection.IterableOnce[B], replaced: Int): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  132. def permutations: collection.Iterator[NodeSeq]
    Definition Classes
    SeqOps
  133. def prefix: String

    prefix of this node

    prefix of this node

    Definition Classes
    Node
  134. def prepended(base: Node): NodeSeq
    Definition Classes
    ScalaVersionSpecificNodeSeq
  135. def prepended[B >: Node](elem: B): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  136. def prependedAll(prefix: collection.IterableOnce[Node]): NodeSeq
    Definition Classes
    ScalaVersionSpecificNodeSeq
  137. def prependedAll[B >: Node](prefix: collection.IterableOnce[B]): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  138. def product[B >: Node](implicit num: math.Numeric[B]): B
    Definition Classes
    IterableOnceOps
  139. def reduce[B >: Node](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  140. def reduceLeft[B >: Node](op: (B, Node) => B): B
    Definition Classes
    IterableOnceOps
  141. def reduceLeftOption[B >: Node](op: (B, Node) => B): Option[B]
    Definition Classes
    IterableOnceOps
  142. def reduceOption[B >: Node](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  143. def reduceRight[B >: Node](op: (Node, B) => B): B
    Definition Classes
    IterableOnceOps
  144. def reduceRightOption[B >: Node](op: (Node, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  145. def reverse: NodeSeq
    Definition Classes
    SeqOps
  146. def reverseIterator: collection.Iterator[Node]
    Definition Classes
    SeqOps
  147. def runWith[U](action: (Node) => U): (Int) => Boolean
    Definition Classes
    PartialFunction
  148. def sameElements[B >: Node](that: collection.IterableOnce[B]): Boolean
    Definition Classes
    SeqOps
  149. def scan[B >: Node](z: B)(op: (B, B) => B): collection.immutable.Seq[B]
    Definition Classes
    IterableOps
  150. def scanLeft[B](z: B)(op: (B, Node) => B): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  151. def scanRight[B](z: B)(op: (Node, B) => B): collection.immutable.Seq[B]
    Definition Classes
    IterableOps
  152. 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
  153. def search[B >: Node](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    SeqOps
  154. def search[B >: Node](elem: B)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    SeqOps
  155. def segmentLength(p: (Node) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  156. final def segmentLength(p: (Node) => Boolean): Int
    Definition Classes
    SeqOps
  157. final def size: Int
    Definition Classes
    SeqOps → IterableOnceOps
  158. final def sizeCompare(that: collection.Iterable[_]): Int
    Definition Classes
    SeqOps → IterableOps
  159. final def sizeCompare(otherSize: Int): Int
    Definition Classes
    SeqOps → IterableOps
  160. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  161. def slice(from: Int, until: Int): NodeSeq
    Definition Classes
    IterableOps → IterableOnceOps
  162. def sliding(size: Int, step: Int): collection.Iterator[NodeSeq]
    Definition Classes
    IterableOps
  163. def sliding(size: Int): collection.Iterator[NodeSeq]
    Definition Classes
    IterableOps
  164. def sortBy[B](f: (Node) => B)(implicit ord: Ordering[B]): NodeSeq
    Definition Classes
    SeqOps
  165. def sortWith(lt: (Node, Node) => Boolean): NodeSeq
    Definition Classes
    SeqOps
  166. def sorted[B >: Node](implicit ord: Ordering[B]): NodeSeq
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  167. def span(p: (Node) => Boolean): (NodeSeq, NodeSeq)
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  168. def splitAt(n: Int): (NodeSeq, NodeSeq)
    Definition Classes
    IterableOps → IterableOnceOps
  169. def startsWith[B >: Node](that: collection.IterableOnce[B], offset: Int): Boolean
    Definition Classes
    SeqOps
  170. def stepper[S <: Stepper[_]](implicit shape: StepperShape[Node, S]): S
    Definition Classes
    IterableOnce
  171. def strict_!=(other: Equality): Boolean
    Definition Classes
    Equality
  172. def strict_==(other: Equality): Boolean
    Definition Classes
    NodeNodeSeqEquality
  173. def sum[B >: Node](implicit num: math.Numeric[B]): B
    Definition Classes
    IterableOnceOps
  174. def tail: NodeSeq
    Definition Classes
    IterableOps
  175. def tails: collection.Iterator[NodeSeq]
    Definition Classes
    IterableOps
  176. def take(n: Int): NodeSeq
    Definition Classes
    IterableOps → IterableOnceOps
  177. def takeRight(n: Int): NodeSeq
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  178. def takeWhile(p: (Node) => Boolean): NodeSeq
    Definition Classes
    IterableOps → IterableOnceOps
  179. def tapEach[U](f: (Node) => U): NodeSeq
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  180. 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
    NodeNodeSeq
  181. def theSeq: collection.Seq[Node]

    returns a sequence consisting of only this node

    returns a sequence consisting of only this node

    Definition Classes
    NodeNodeSeq
  182. def to[C1](factory: Factory[Node, C1]): C1
    Definition Classes
    IterableOnceOps
  183. def toArray[B >: Node](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  184. final def toBuffer[B >: Node]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  185. def toIndexedSeq: collection.immutable.IndexedSeq[Node]
    Definition Classes
    IterableOnceOps
  186. final def toIterable: SpecialNode.this.type
    Definition Classes
    Iterable → IterableOps
  187. def toList: collection.immutable.List[Node]
    Definition Classes
    IterableOnceOps
  188. def toMap[K, V](implicit ev: <:<[Node, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  189. final def toSeq: SpecialNode.this.type
    Definition Classes
    Seq → IterableOnceOps
  190. def toSet[B >: Node]: Set[B]
    Definition Classes
    IterableOnceOps
  191. def toString(): String

    Same as toString(false).

    Same as toString(false).

    Definition Classes
    NodeNodeSeq → Seq → Function1 → Iterable → AnyRef → Any
  192. def toVector: collection.immutable.Vector[Node]
    Definition Classes
    IterableOnceOps
  193. def transpose[B](implicit asIterable: (Node) => collection.Iterable[B]): collection.immutable.Seq[collection.immutable.Seq[B]]
    Definition Classes
    IterableOps
  194. def unapply(a: Int): Option[Node]
    Definition Classes
    PartialFunction
  195. def unzip[A1, A2](implicit asPair: (Node) => (A1, A2)): (collection.immutable.Seq[A1], collection.immutable.Seq[A2])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  196. 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
    StrictOptimizedIterableOps → IterableOps
  197. def updated[B >: Node](index: Int, elem: B): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  198. def view: SeqView[Node]
    Definition Classes
    SeqOps → IterableOps
  199. def withFilter(p: (Node) => Boolean): WithFilter[Node, [_]collection.immutable.Seq[_]]
    Definition Classes
    IterableOps
  200. def xmlType(): TypeSymbol

    Returns a type symbol (e.g.

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

    Definition Classes
    Node
  201. final def xml_!=(other: Any): Boolean
    Definition Classes
    Equality
  202. final def xml_==(other: Any): Boolean
    Definition Classes
    Equality
  203. def xml_sameElements[A](that: Iterable[A]): Boolean
    Definition Classes
    NodeSeq
  204. def zip[B](that: collection.IterableOnce[B]): collection.immutable.Seq[(Node, B)]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  205. def zipAll[A1 >: Node, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): collection.immutable.Seq[(A1, B)]
    Definition Classes
    IterableOps
  206. def zipWithIndex: collection.immutable.Seq[(Node, Int)]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps

Deprecated Value Members

  1. final def /:[B](z: B)(op: (B, Node) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  2. final def :\[B](z: B)(op: (Node, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  3. def aggregate[B](z: => B)(seqop: (B, Node) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  4. def companion: IterableFactory[[_]collection.immutable.Seq[_]]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding("Use iterableFactory instead", "2.13.0") @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  5. final def copyToBuffer[B >: Node](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  6. def hasDefiniteSize: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  7. final def prefixLength(p: (Node) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use segmentLength instead of prefixLength

  8. final def repr: NodeSeq
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  9. def reverseMap[B](f: (Node) => B): collection.immutable.Seq[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)

  10. def seq: SpecialNode.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  11. final def toIterator: collection.Iterator[Node]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  12. final def toStream: collection.immutable.Stream[Node]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  13. final def toTraversable: collection.Traversable[Node]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use toIterable instead

  14. final def union[B >: Node](that: collection.Seq[B]): collection.immutable.Seq[B]
    Definition Classes
    SeqOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use concat instead

  15. def view(from: Int, until: Int): View[Node]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)