Packages

abstract class Node extends NodeSeq

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

Instance Constructors

  1. new Node()

Type Members

  1. type Self = NodeSeq
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def child: collection.Seq[Node]

    Returns child axis i.e.

    Returns child axis i.e. all children of this node.

    returns

    all children of this node

  2. abstract def label: String

    label of this node.

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

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def ++[B >: Node, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  4. def ++:[B >: Node, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike
  5. def ++:[B >: Node, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike
  6. def +:[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  7. def :+[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  8. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  9. 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
  10. 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
  11. 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
  12. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  13. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  14. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  15. def aggregate[B](z: ⇒ B)(seqop: (B, Node) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  16. def andThen[C](k: (Node) ⇒ C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  17. def apply(f: (Node) ⇒ Boolean): NodeSeq
    Definition Classes
    NodeSeq
  18. def apply(i: Int): Node
    Definition Classes
    NodeSeq → SeqLike → GenSeqLike → Function1
  19. def applyOrElse[A1 <: Int, B1 >: Node](x: A1, default: (A1) ⇒ B1): B1
    Definition Classes
    PartialFunction
  20. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  21. 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.

  22. 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.

  23. def attributes: MetaData

    Returns attribute meaning all attributes of this node, prefixed and unprefixed, in no particular order.

    Returns attribute meaning all attributes of this node, prefixed and unprefixed, in no particular order. In class Node, this defaults to Null (the empty attribute list).

    returns

    all attributes of this node

  24. def basisForHashCode: collection.Seq[Any]
    Attributes
    protected
    Definition Classes
    Node → NodeSeq → Equality
  25. def buildString(stripComments: Boolean): String

    String representation of this node

    String representation of this node

    stripComments

    if true, strips comment nodes from result

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

  42. 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.

  43. def diff[B >: Node](that: GenSeq[B]): NodeSeq
    Definition Classes
    SeqLike → GenSeqLike
  44. def distinct: NodeSeq
    Definition Classes
    SeqLike → GenSeqLike
  45. def doCollectNamespaces: Boolean

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

  46. def doTransform: Boolean
  47. def drop(n: Int): NodeSeq
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  48. def dropRight(n: Int): NodeSeq
    Definition Classes
    IterableLike
  49. def dropWhile(p: (Node) ⇒ Boolean): NodeSeq
    Definition Classes
    TraversableLike → GenTraversableLike
  50. def endsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  51. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  52. def equals(other: Any): Boolean
    Definition Classes
    Equality → Equals → AnyRef → Any
  53. def exists(p: (Node) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  54. def filter(p: (Node) ⇒ Boolean): NodeSeq
    Definition Classes
    TraversableLike → GenTraversableLike
  55. def filterNot(p: (Node) ⇒ Boolean): NodeSeq
    Definition Classes
    TraversableLike → GenTraversableLike
  56. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  57. def find(p: (Node) ⇒ Boolean): Option[Node]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  58. def flatMap[B, That](f: (Node) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  59. def flatten[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): collection.immutable.Seq[B]
    Definition Classes
    GenericTraversableTemplate
  60. def fold[A1 >: Node](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  61. def foldLeft[B](z: B)(op: (B, Node) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  62. def foldRight[B](z: B)(op: (Node, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  63. def forall(p: (Node) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  64. def foreach[U](f: (Node) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  65. def genericBuilder[B]: Builder[B, collection.immutable.Seq[B]]
    Definition Classes
    GenericTraversableTemplate
  66. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  67. 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

  68. def groupBy[K](f: (Node) ⇒ K): Map[K, NodeSeq]
    Definition Classes
    TraversableLike → GenTraversableLike
  69. def grouped(size: Int): collection.Iterator[NodeSeq]
    Definition Classes
    IterableLike
  70. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  71. 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
  72. def head: Node
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  73. def headOption: Option[Node]
    Definition Classes
    TraversableLike → GenTraversableLike
  74. def indexOf[B >: Node](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  75. def indexOf[B >: Node](elem: B): Int
    Definition Classes
    GenSeqLike
  76. def indexOfSlice[B >: Node](that: GenSeq[B], from: Int): Int
    Definition Classes
    SeqLike
  77. def indexOfSlice[B >: Node](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  78. def indexWhere(p: (Node) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  79. def indexWhere(p: (Node) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  80. def indices: collection.immutable.Range
    Definition Classes
    SeqLike
  81. def init: NodeSeq
    Definition Classes
    TraversableLike → GenTraversableLike
  82. def inits: collection.Iterator[NodeSeq]
    Definition Classes
    TraversableLike
  83. def intersect[B >: Node](that: GenSeq[B]): NodeSeq
    Definition Classes
    SeqLike → GenSeqLike
  84. def isAtom: Boolean

    used internally.

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

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

    Appends qualified name of this node to StringBuilder.

  110. def namespace: String

    convenience, same as getNamespace(this.prefix)

  111. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  112. def newBuilder: Builder[Node, NodeSeq]

    Creates a list buffer as builder for this class

    Creates a list buffer as builder for this class

    Attributes
    protected[this]
    Definition Classes
    ScalaVersionSpecificNodeSeq → TraversableLike → HasNewBuilder
  113. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. def nonEmptyChildren: collection.Seq[Node]

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

  115. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  116. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  117. def orElse[A1 <: Int, B1 >: Node](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  118. def padTo[B >: Node, That](len: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  119. def par: ParSeq[Node]
    Definition Classes
    Parallelizable
  120. def parCombiner: Combiner[Node, ParSeq[Node]]
    Attributes
    protected[this]
    Definition Classes
    Seq → SeqLike → Iterable → TraversableLike → Parallelizable
  121. def partition(p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq)
    Definition Classes
    TraversableLike → GenTraversableLike
  122. def patch[B >: Node, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  123. def permutations: collection.Iterator[NodeSeq]
    Definition Classes
    SeqLike
  124. def prefix: String

    prefix of this node

  125. def prefixLength(p: (Node) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  126. def product[B >: Node](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  127. def reduce[A1 >: Node](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  128. def reduceLeft[B >: Node](op: (B, Node) ⇒ B): B
    Definition Classes
    TraversableOnce
  129. def reduceLeftOption[B >: Node](op: (B, Node) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. def reduceOption[A1 >: Node](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. def reduceRight[B >: Node](op: (Node, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  132. def reduceRightOption[B >: Node](op: (Node, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  133. def repr: NodeSeq
    Definition Classes
    TraversableLike → GenTraversableLike
  134. def reverse: NodeSeq
    Definition Classes
    SeqLike → GenSeqLike
  135. def reverseIterator: collection.Iterator[Node]
    Definition Classes
    SeqLike
  136. def reverseMap[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  137. def reversed: List[Node]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  138. def runWith[U](action: (Node) ⇒ U): (Int) ⇒ Boolean
    Definition Classes
    PartialFunction
  139. def sameElements[B >: Node](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  140. def scan[B >: Node, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  141. def scanLeft[B, That](z: B)(op: (B, Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  142. 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.

  143. 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".

  144. def segmentLength(p: (Node) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  145. def seq: collection.immutable.Seq[Node]
    Definition Classes
    Seq → Seq → GenSeq → GenSeqLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  146. def size: Int
    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  147. def sizeHintIfCheap: Int
    Attributes
    protected[collection]
    Definition Classes
    GenTraversableOnce
  148. def slice(from: Int, until: Int): NodeSeq
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  149. def sliding(size: Int, step: Int): collection.Iterator[NodeSeq]
    Definition Classes
    IterableLike
  150. def sliding(size: Int): collection.Iterator[NodeSeq]
    Definition Classes
    IterableLike
  151. def sortBy[B](f: (Node) ⇒ B)(implicit ord: math.Ordering[B]): NodeSeq
    Definition Classes
    SeqLike
  152. def sortWith(lt: (Node, Node) ⇒ Boolean): NodeSeq
    Definition Classes
    SeqLike
  153. def sorted[B >: Node](implicit ord: math.Ordering[B]): NodeSeq
    Definition Classes
    SeqLike
  154. def span(p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq)
    Definition Classes
    TraversableLike → GenTraversableLike
  155. def splitAt(n: Int): (NodeSeq, NodeSeq)
    Definition Classes
    TraversableLike → GenTraversableLike
  156. def startsWith[B](that: GenSeq[B], offset: Int): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  157. def startsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    GenSeqLike
  158. def strict_!=(other: Equality): Boolean
    Definition Classes
    Equality
  159. def strict_==(other: Equality): Boolean
    Definition Classes
    Node → NodeSeq → Equality
  160. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  161. def sum[B >: Node](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  162. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  163. def tail: NodeSeq
    Definition Classes
    TraversableLike → GenTraversableLike
  164. def tails: collection.Iterator[NodeSeq]
    Definition Classes
    TraversableLike
  165. def take(n: Int): NodeSeq
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  166. def takeRight(n: Int): NodeSeq
    Definition Classes
    IterableLike
  167. def takeWhile(p: (Node) ⇒ Boolean): NodeSeq
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  168. 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
  169. 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
  170. def thisCollection: collection.Seq[Node]
    Attributes
    protected[this]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  171. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Node, Col[Node]]): Col[Node]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  172. def toArray[B >: Node](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  173. def toBuffer[B >: Node]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  174. def toCollection(repr: NodeSeq): collection.Seq[Node]
    Attributes
    protected[this]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  175. def toIndexedSeq: collection.immutable.IndexedSeq[Node]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  176. def toIterable: collection.Iterable[Node]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  177. def toIterator: collection.Iterator[Node]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  178. def toList: List[Node]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  179. def toMap[T, U](implicit ev: <:<[Node, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  180. def toSeq: collection.immutable.Seq[Node]
    Definition Classes
    Seq → SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  181. def toSet[B >: Node]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  182. def toStream: collection.immutable.Stream[Node]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  183. def toString(): String

    Same as toString(false).

    Same as toString(false).

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

  187. def union[B >: Node, That](that: GenSeq[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  188. def unzip[A1, A2](implicit asPair: (Node) ⇒ (A1, A2)): (collection.immutable.Seq[A1], collection.immutable.Seq[A2])
    Definition Classes
    GenericTraversableTemplate
  189. 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
  190. def updated[B >: Node, That](index: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  191. def view(from: Int, until: Int): SeqView[Node, NodeSeq]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  192. def view: SeqView[Node, NodeSeq]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  193. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  194. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  195. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  196. def withFilter(p: (Node) ⇒ Boolean): FilterMonadic[Node, NodeSeq]
    Definition Classes
    TraversableLike → FilterMonadic
  197. def xmlType(): TypeSymbol

    Returns a type symbol (e.g.

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

  198. final def xml_!=(other: Any): Boolean
    Definition Classes
    Equality
  199. final def xml_==(other: Any): Boolean
    Definition Classes
    Equality
  200. def xml_sameElements[A](that: Iterable[A]): Boolean
    Definition Classes
    NodeSeq
  201. def zip[A1 >: Node, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  202. 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
  203. 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 :\

Inherited from NodeSeq

Inherited from Serializable

Inherited from java.io.Serializable

Inherited from Equality

Inherited from ScalaVersionSpecificNodeSeq

Inherited from collection.immutable.Seq[Node]

Inherited from collection.immutable.Iterable[Node]

Inherited from collection.immutable.Traversable[Node]

Inherited from Immutable

Inherited from AbstractSeq[Node]

Inherited from collection.Seq[Node]

Inherited from SeqLike[Node, NodeSeq]

Inherited from GenSeq[Node]

Inherited from GenSeqLike[Node, NodeSeq]

Inherited from PartialFunction[Int, Node]

Inherited from (Int) ⇒ Node

Inherited from AbstractIterable[Node]

Inherited from collection.Iterable[Node]

Inherited from IterableLike[Node, NodeSeq]

Inherited from Equals

Inherited from GenIterable[Node]

Inherited from GenIterableLike[Node, NodeSeq]

Inherited from AbstractTraversable[Node]

Inherited from collection.Traversable[Node]

Inherited from GenTraversable[Node]

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

Inherited from TraversableLike[Node, NodeSeq]

Inherited from GenTraversableLike[Node, NodeSeq]

Inherited from Parallelizable[Node, ParSeq[Node]]

Inherited from collection.TraversableOnce[Node]

Inherited from GenTraversableOnce[Node]

Inherited from FilterMonadic[Node, NodeSeq]

Inherited from HasNewBuilder[Node, NodeSeq]

Inherited from AnyRef

Inherited from Any

Ungrouped