Packages

class Elem extends Node with Serializable

The case class Elem extends the Node class, providing an immutable data object representing an XML element.

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

Instance Constructors

  1. new Elem(prefix: String, label: String, attributes1: MetaData, scope: NamespaceBinding, minimizeEmpty: Boolean, child: Node*)

    prefix

    namespace prefix (may be null, but not the empty string)

    label

    the element name

    attributes1

    the attribute map

    scope

    the scope containing the namespace bindings

    minimizeEmpty

    true if this element should be serialized as minimized (i.e. "<el/>") when empty; false if it should be written out in long form.

    child

    the children of this node Copyright 2008 Google Inc. All Rights Reserved.

  2. new Elem(prefix: String, label: String, attributes: MetaData, scope: NamespaceBinding, child: Node*)
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) This constructor is retained for backward compatibility. Please use the primary constructor, which lets you specify your own preference for minimizeEmpty.

Type Members

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

Value Members

  1. final def %(updates: MetaData): Elem

    Returns a new element with updated attributes, resolving namespace uris from this element's scope.

    Returns a new element with updated attributes, resolving namespace uris from this element's scope. See MetaData.update for details.

    updates

    MetaData with new and updated attributes

    returns

    a new symbol with updated attributes

  2. def ++[B >: Node, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  3. def ++:[B >: Node, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike
  4. def ++:[B >: Node, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike
  5. def +:[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  6. def /:[B](z: B)(op: (B, Node) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  7. def :+[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  8. def :\[B](z: B)(op: (Node, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  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 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
  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";
    • \\ "_" 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
  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 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
  21. 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
  22. val attributes: MetaData
    Definition Classes
    Elem → Node
  23. 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
  24. 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
  25. val child: Node*
    Definition Classes
    Elem → Node
  26. def collect[B, That](pf: PartialFunction[Node, B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  27. def collectFirst[B](pf: PartialFunction[Node, B]): Option[B]
    Definition Classes
    TraversableOnce
  28. def combinations(n: Int): collection.Iterator[NodeSeq]
    Definition Classes
    SeqLike
  29. def companion: GenericCompanion[collection.immutable.Seq]
    Definition Classes
    Seq → Seq → GenSeq → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  30. def compose[A](g: (A) ⇒ Int): (A) ⇒ Node
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  31. def contains[A1 >: Node](elem: A1): Boolean
    Definition Classes
    SeqLike
  32. def containsSlice[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike
  33. def copy(prefix: String = this.prefix, label: String = this.label, attributes: MetaData = this.attributes, scope: NamespaceBinding = this.scope, minimizeEmpty: Boolean = this.minimizeEmpty, child: Seq[Node] = this.child.toSeq): Elem

    Returns a copy of this element with any supplied arguments replacing this element's value for that field.

    Returns a copy of this element with any supplied arguments replacing this element's value for that field.

    returns

    a new symbol with updated attributes

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

    used internally.

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

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

    Appends qualified name of this node to StringBuilder.

    Appends qualified name of this node to StringBuilder.

    Definition Classes
    Node
  107. def namespace: String

    convenience, same as getNamespace(this.prefix)

    convenience, same as getNamespace(this.prefix)

    Definition Classes
    Node
  108. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. 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
  110. def orElse[A1 <: Int, B1 >: Node](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  111. def padTo[B >: Node, That](len: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  112. def par: ParSeq[Node]
    Definition Classes
    Parallelizable
  113. def partition(p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq)
    Definition Classes
    TraversableLike → GenTraversableLike
  114. def patch[B >: Node, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  115. def permutations: collection.Iterator[NodeSeq]
    Definition Classes
    SeqLike
  116. val prefix: String
    Definition Classes
    Elem → Node
  117. def prefixLength(p: (Node) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  118. def product[B >: Node](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. def reduce[A1 >: Node](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  120. def reduceLeft[B >: Node](op: (B, Node) ⇒ B): B
    Definition Classes
    TraversableOnce
  121. def reduceLeftOption[B >: Node](op: (B, Node) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  122. def reduceOption[A1 >: Node](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  123. def reduceRight[B >: Node](op: (Node, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  124. def reduceRightOption[B >: Node](op: (Node, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  125. def repr: NodeSeq
    Definition Classes
    TraversableLike → GenTraversableLike
  126. def reverse: NodeSeq
    Definition Classes
    SeqLike → GenSeqLike
  127. def reverseIterator: collection.Iterator[Node]
    Definition Classes
    SeqLike
  128. def reverseMap[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  129. def runWith[U](action: (Node) ⇒ U): (Int) ⇒ Boolean
    Definition Classes
    PartialFunction
  130. def sameElements[B >: Node](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  131. def scan[B >: Node, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  132. def scanLeft[B, That](z: B)(op: (B, Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  133. 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.

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

    Returns concatenation of text(n) for each child n.

    Returns concatenation of text(n) for each child n.

    Definition Classes
    Elem → Node → NodeSeq
  158. def theSeq: Seq[Node]

    returns a sequence consisting of only this node

    returns a sequence consisting of only this node

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

    Same as toString(false).

    Same as toString(false).

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

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

    Returns a type symbol (e.g.

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

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