scala.xml

Elem

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
Learn more about member selection
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. type Self = NodeSeq

    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]

    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. 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

  5. def ++[B >: Node, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  6. def ++:[B >: Node, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Definition Classes
    TraversableLike
  7. def ++:[B >: Node, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Definition Classes
    TraversableLike
  8. def +:[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Definition Classes
    SeqLike → GenSeqLike
  9. def /:[B](z: B)(op: (B, Node) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. def :+[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Definition Classes
    SeqLike → GenSeqLike
  11. def :\[B](z: B)(op: (Node, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  12. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  13. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  14. 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
  15. 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
  16. 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
  17. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce
  18. def addString(b: StringBuilder, sep: String): StringBuilder

    Definition Classes
    TraversableOnce
  19. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Definition Classes
    TraversableOnce
  20. def aggregate[B](z: ⇒ B)(seqop: (B, Node) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  21. def andThen[C](k: (Node) ⇒ C): PartialFunction[Int, C]

    Definition Classes
    PartialFunction → Function1
  22. def apply(f: (Node) ⇒ Boolean): NodeSeq

    Definition Classes
    NodeSeq
  23. def apply(i: Int): Node

    Definition Classes
    NodeSeq → SeqLike → GenSeqLike → Function1
  24. def applyOrElse[A1 <: Int, B1 >: Node](x: A1, default: (A1) ⇒ B1): B1

    Definition Classes
    PartialFunction
  25. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  26. 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
  27. 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
  28. val 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

    Definition Classes
    ElemNode
  29. def basisForHashCode: Seq[Any]

    Attributes
    protected
    Definition Classes
    ElemNodeNodeSeqEquality
  30. 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
  31. 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 → IterableLike → Equals
  32. val child: Node*

    the children of this node

    the children of this node

    Copyright 2008 Google Inc. All Rights Reserved.

    Definition Classes
    ElemNode
  33. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. def collect[B, That](pf: PartialFunction[Node, B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  35. def collectFirst[B](pf: PartialFunction[Node, B]): Option[B]

    Definition Classes
    TraversableOnce
  36. def combinations(n: Int): collection.Iterator[NodeSeq]

    Definition Classes
    SeqLike
  37. def companion: GenericCompanion[collection.immutable.Seq]

    Definition Classes
    Seq → Seq → GenSeq → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
  38. def compose[A](g: (A) ⇒ Int): (A) ⇒ Node

    Definition Classes
    Function1
    Annotations
    @unspecialized()
  39. def contains[A1 >: Node](elem: A1): Boolean

    Definition Classes
    SeqLike
  40. def containsSlice[B](that: GenSeq[B]): Boolean

    Definition Classes
    SeqLike
  41. 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

  42. def copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Unit

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  43. def copyToArray[B >: Node](xs: Array[B]): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce
  44. def copyToArray[B >: Node](xs: Array[B], start: Int): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce
  45. def copyToBuffer[B >: Node](dest: Buffer[B]): Unit

    Definition Classes
    TraversableOnce
  46. def corresponds[B](that: GenSeq[B])(p: (Node, B) ⇒ Boolean): Boolean

    Definition Classes
    SeqLike → GenSeqLike
  47. def count(p: (Node) ⇒ Boolean): Int

    Definition Classes
    TraversableOnce → GenTraversableOnce
  48. 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
  49. 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
  50. def diff[B >: Node](that: GenSeq[B]): NodeSeq

    Definition Classes
    SeqLike → GenSeqLike
  51. def distinct: NodeSeq

    Definition Classes
    SeqLike → GenSeqLike
  52. 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
    ElemNode
  53. final def doTransform: Boolean

    Definition Classes
    ElemNode
  54. def drop(n: Int): NodeSeq

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  55. def dropRight(n: Int): NodeSeq

    Definition Classes
    IterableLike
  56. def dropWhile(p: (Node) ⇒ Boolean): NodeSeq

    Definition Classes
    TraversableLike → GenTraversableLike
  57. def endsWith[B](that: GenSeq[B]): Boolean

    Definition Classes
    SeqLike → GenSeqLike
  58. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  59. def equals(other: Any): Boolean

    Definition Classes
    Equality → Equals → AnyRef → Any
  60. def exists(p: (Node) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  61. def filter(p: (Node) ⇒ Boolean): NodeSeq

    Definition Classes
    TraversableLike → GenTraversableLike
  62. def filterNot(p: (Node) ⇒ Boolean): NodeSeq

    Definition Classes
    TraversableLike → GenTraversableLike
  63. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  64. def find(p: (Node) ⇒ Boolean): Option[Node]

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  65. def flatMap[B, That](f: (Node) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  66. def flatten[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): collection.immutable.Seq[B]

    Definition Classes
    GenericTraversableTemplate
  67. def fold[A1 >: Node](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce
  68. def foldLeft[B](z: B)(op: (B, Node) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  69. def foldRight[B](z: B)(op: (Node, B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  70. def forall(p: (Node) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  71. def foreach[U](f: (Node) ⇒ U): Unit

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  72. def genericBuilder[B]: Builder[B, collection.immutable.Seq[B]]

    Definition Classes
    GenericTraversableTemplate
  73. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  74. 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
  75. def groupBy[K](f: (Node) ⇒ K): Map[K, NodeSeq]

    Definition Classes
    TraversableLike → GenTraversableLike
  76. def grouped(size: Int): collection.Iterator[NodeSeq]

    Definition Classes
    IterableLike
  77. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  78. 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
  79. def head: Node

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  80. def headOption: Option[Node]

    Definition Classes
    TraversableLike → GenTraversableLike
  81. def indexOf[B >: Node](elem: B, from: Int): Int

    Definition Classes
    GenSeqLike
  82. def indexOf[B >: Node](elem: B): Int

    Definition Classes
    GenSeqLike
  83. def indexOfSlice[B >: Node](that: GenSeq[B], from: Int): Int

    Definition Classes
    SeqLike
  84. def indexOfSlice[B >: Node](that: GenSeq[B]): Int

    Definition Classes
    SeqLike
  85. def indexWhere(p: (Node) ⇒ Boolean, from: Int): Int

    Definition Classes
    SeqLike → GenSeqLike
  86. def indexWhere(p: (Node) ⇒ Boolean): Int

    Definition Classes
    GenSeqLike
  87. def indices: collection.immutable.Range

    Definition Classes
    SeqLike
  88. def init: NodeSeq

    Definition Classes
    TraversableLike → GenTraversableLike
  89. def inits: collection.Iterator[NodeSeq]

    Definition Classes
    TraversableLike
  90. def intersect[B >: Node](that: GenSeq[B]): NodeSeq

    Definition Classes
    SeqLike → GenSeqLike
  91. def isAtom: Boolean

    used internally.

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

    Definition Classes
    Node
  92. def isDefinedAt(idx: Int): Boolean

    Definition Classes
    GenSeqLike
  93. def isEmpty: Boolean

    Definition Classes
    SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  94. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  95. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  96. def iterator: collection.Iterator[Node]

    Definition Classes
    NodeSeq → IterableLike → GenIterableLike
  97. val label: String

    the element name

    the element name

    Definition Classes
    ElemNode
  98. def last: Node

    Definition Classes
    TraversableLike → GenTraversableLike
  99. def lastIndexOf[B >: Node](elem: B, end: Int): Int

    Definition Classes
    GenSeqLike
  100. def lastIndexOf[B >: Node](elem: B): Int

    Definition Classes
    GenSeqLike
  101. def lastIndexOfSlice[B >: Node](that: GenSeq[B], end: Int): Int

    Definition Classes
    SeqLike
  102. def lastIndexOfSlice[B >: Node](that: GenSeq[B]): Int

    Definition Classes
    SeqLike
  103. def lastIndexWhere(p: (Node) ⇒ Boolean, end: Int): Int

    Definition Classes
    SeqLike → GenSeqLike
  104. def lastIndexWhere(p: (Node) ⇒ Boolean): Int

    Definition Classes
    GenSeqLike
  105. def lastOption: Option[Node]

    Definition Classes
    TraversableLike → GenTraversableLike
  106. def length: Int

    Definition Classes
    NodeSeq → SeqLike → GenSeqLike
  107. def lengthCompare(len: Int): Int

    Definition Classes
    SeqLike
  108. def lift: (Int) ⇒ Option[Node]

    Definition Classes
    PartialFunction
  109. def map[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  110. def max[B >: Node](implicit cmp: Ordering[B]): Node

    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def maxBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node

    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def min[B >: Node](implicit cmp: Ordering[B]): Node

    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def minBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node

    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. val minimizeEmpty: Boolean

    true if this element should be serialized as minimized (i.

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

  115. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. def mkString(start: String, sep: String, end: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. def nameToString(sb: StringBuilder): StringBuilder

    Appends qualified name of this node to StringBuilder.

    Appends qualified name of this node to StringBuilder.

    Definition Classes
    Node
  119. def namespace: String

    convenience, same as getNamespace(this.prefix)

    convenience, same as getNamespace(this.prefix)

    Definition Classes
    Node
  120. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  121. 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
    NodeSeq → GenericTraversableTemplate → TraversableLike → HasNewBuilder
  122. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce
  123. 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
  124. final def notify(): Unit

    Definition Classes
    AnyRef
  125. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  126. def orElse[A1 <: Int, B1 >: Node](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Definition Classes
    PartialFunction
  127. def padTo[B >: Node, That](len: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Definition Classes
    SeqLike → GenSeqLike
  128. def par: ParSeq[Node]

    Definition Classes
    Parallelizable
  129. def parCombiner: Combiner[Node, ParSeq[Node]]

    Attributes
    protected[this]
    Definition Classes
    Seq → SeqLike → Iterable → TraversableLike → Parallelizable
  130. def partition(p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq)

    Definition Classes
    TraversableLike → GenTraversableLike
  131. def patch[B >: Node, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Definition Classes
    SeqLike → GenSeqLike
  132. def permutations: collection.Iterator[NodeSeq]

    Definition Classes
    SeqLike
  133. val prefix: String

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

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

    Definition Classes
    ElemNode
  134. def prefixLength(p: (Node) ⇒ Boolean): Int

    Definition Classes
    GenSeqLike
  135. def product[B >: Node](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. def reduce[A1 >: Node](op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce
  137. def reduceLeft[B >: Node](op: (B, Node) ⇒ B): B

    Definition Classes
    TraversableOnce
  138. def reduceLeftOption[B >: Node](op: (B, Node) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  139. def reduceOption[A1 >: Node](op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  140. def reduceRight[B >: Node](op: (Node, B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  141. def reduceRightOption[B >: Node](op: (Node, B) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  142. def repr: NodeSeq

    Definition Classes
    TraversableLike → GenTraversableLike
  143. def reverse: NodeSeq

    Definition Classes
    SeqLike → GenSeqLike
  144. def reverseIterator: collection.Iterator[Node]

    Definition Classes
    SeqLike
  145. def reverseMap[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Definition Classes
    SeqLike → GenSeqLike
  146. def reversed: List[Node]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  147. def runWith[U](action: (Node) ⇒ U): (Int) ⇒ Boolean

    Definition Classes
    PartialFunction
  148. def sameElements[B >: Node](that: GenIterable[B]): Boolean

    Definition Classes
    IterableLike → GenIterableLike
  149. def scan[B >: Node, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[NodeSeq, B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  150. def scanLeft[B, That](z: B)(op: (B, Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  151. 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.

  152. val scope: NamespaceBinding

    the scope containing the namespace bindings

    the scope containing the namespace bindings

    Definition Classes
    ElemNode
  153. def segmentLength(p: (Node) ⇒ Boolean, from: Int): Int

    Definition Classes
    SeqLike → GenSeqLike
  154. def seq: collection.immutable.Seq[Node]

    Definition Classes
    Seq → Seq → GenSeq → GenSeqLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  155. def size: Int

    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  156. def slice(from: Int, until: Int): NodeSeq

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  157. def sliding(size: Int, step: Int): collection.Iterator[NodeSeq]

    Definition Classes
    IterableLike
  158. def sliding(size: Int): collection.Iterator[NodeSeq]

    Definition Classes
    IterableLike
  159. def sortBy[B](f: (Node) ⇒ B)(implicit ord: math.Ordering[B]): NodeSeq

    Definition Classes
    SeqLike
  160. def sortWith(lt: (Node, Node) ⇒ Boolean): NodeSeq

    Definition Classes
    SeqLike
  161. def sorted[B >: Node](implicit ord: math.Ordering[B]): NodeSeq

    Definition Classes
    SeqLike
  162. def span(p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq)

    Definition Classes
    TraversableLike → GenTraversableLike
  163. def splitAt(n: Int): (NodeSeq, NodeSeq)

    Definition Classes
    TraversableLike → GenTraversableLike
  164. def startsWith[B](that: GenSeq[B], offset: Int): Boolean

    Definition Classes
    SeqLike → GenSeqLike
  165. def startsWith[B](that: GenSeq[B]): Boolean

    Definition Classes
    GenSeqLike
  166. def strict_!=(other: Equality): Boolean

    Definition Classes
    Equality
  167. def strict_==(other: Equality): Boolean

    Definition Classes
    NodeNodeSeqEquality
  168. def stringPrefix: String

    Definition Classes
    TraversableLike → GenTraversableLike
  169. def sum[B >: Node](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  170. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  171. def tail: NodeSeq

    Definition Classes
    TraversableLike → GenTraversableLike
  172. def tails: collection.Iterator[NodeSeq]

    Definition Classes
    TraversableLike
  173. def take(n: Int): NodeSeq

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  174. def takeRight(n: Int): NodeSeq

    Definition Classes
    IterableLike
  175. def takeWhile(p: (Node) ⇒ Boolean): NodeSeq

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  176. def text: String

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

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

    Definition Classes
    ElemNodeNodeSeq
  177. def theSeq: Seq[Node]

    returns a sequence consisting of only this node

    returns a sequence consisting of only this node

    Definition Classes
    NodeNodeSeq
  178. def thisCollection: collection.Seq[Node]

    Attributes
    protected[this]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  179. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Node, Col[Node]]): Col[Node]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  180. def toArray[B >: Node](implicit arg0: ClassTag[B]): Array[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  181. def toBuffer[B >: Node]: Buffer[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  182. def toCollection(repr: NodeSeq): collection.Seq[Node]

    Attributes
    protected[this]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  183. def toIndexedSeq: collection.immutable.IndexedSeq[Node]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  184. def toIterable: collection.Iterable[Node]

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  185. def toIterator: collection.Iterator[Node]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  186. def toList: List[Node]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  187. def toMap[T, U](implicit ev: <:<[Node, (T, U)]): Map[T, U]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  188. def toSeq: collection.immutable.Seq[Node]

    Definition Classes
    Seq → SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  189. def toSet[B >: Node]: Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  190. def toStream: collection.immutable.Stream[Node]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  191. def toString(): String

    Same as toString(false).

    Same as toString(false).

    Definition Classes
    NodeNodeSeq → SeqLike → Function1 → TraversableLike → AnyRef → Any
  192. def toTraversable: collection.Traversable[Node]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  193. def toVector: Vector[Node]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  194. 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.

  195. def union[B >: Node, That](that: GenSeq[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Definition Classes
    SeqLike → GenSeqLike
  196. def unzip[A1, A2](implicit asPair: (Node) ⇒ (A1, A2)): (collection.immutable.Seq[A1], collection.immutable.Seq[A2])

    Definition Classes
    GenericTraversableTemplate
  197. 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
  198. def updated[B >: Node, That](index: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Definition Classes
    SeqLike → GenSeqLike
  199. def view(from: Int, until: Int): SeqView[Node, NodeSeq]

    Definition Classes
    SeqLike → IterableLike → TraversableLike
  200. def view: SeqView[Node, NodeSeq]

    Definition Classes
    SeqLike → IterableLike → TraversableLike
  201. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  202. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  203. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  204. def withFilter(p: (Node) ⇒ Boolean): FilterMonadic[Node, NodeSeq]

    Definition Classes
    TraversableLike → FilterMonadic
  205. def xmlType(): TypeSymbol

    Returns a type symbol (e.

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

    Definition Classes
    Node
  206. final def xml_!=(other: Any): Boolean

    Definition Classes
    Equality
  207. final def xml_==(other: Any): Boolean

    Definition Classes
    Equality
  208. def xml_sameElements[A](that: Iterable[A]): Boolean

    Definition Classes
    NodeSeq
  209. def zip[A1 >: Node, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike
  210. 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
  211. def zipWithIndex[A1 >: Node, That](implicit bf: CanBuildFrom[NodeSeq, (A1, Int), That]): That

    Definition Classes
    IterableLike → GenIterableLike

Inherited from Serializable

Inherited from java.io.Serializable

Inherited from Node

Inherited from NodeSeq

Inherited from Equality

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