Packages

class Elem extends Node with Serializable

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Elem
  2. Node
  3. NodeSeq
  4. Serializable
  5. Equality
  6. ScalaVersionSpecificNodeSeq
  7. StrictOptimizedSeqOps
  8. StrictOptimizedSeqOps
  9. StrictOptimizedIterableOps
  10. Seq
  11. SeqOps
  12. Iterable
  13. AbstractSeq
  14. Seq
  15. Equals
  16. SeqOps
  17. PartialFunction
  18. Function1
  19. AbstractIterable
  20. Iterable
  21. IterableFactoryDefaults
  22. IterableOps
  23. IterableOnceOps
  24. IterableOnce
  25. AnyRef
  26. 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

  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.

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. 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

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

    Convenience method, looks up a prefixed attribute in attributes of this node.

    Convenience method, looks up a prefixed attribute in attributes of this node. Same as attributes.getValue(uri, this, key)-

    uri

    namespace of queried attribute (may not be null).

    key

    of queried attribute.

    returns

    value of PrefixedAttribute with given namespace and given key, otherwise null.

    Definition Classes
    Node
  25. final def attribute(key: String): Option[collection.Seq[Node]]

    Convenience method, looks up an unprefixed attribute in attributes of this node.

    Convenience method, looks up an unprefixed attribute in attributes of this node. Same as attributes.getValue(key)

    key

    of queried attribute.

    returns

    value of UnprefixedAttribute with given key in attributes, if it exists, otherwise null.

    Definition Classes
    Node
  26. 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
  27. def basisForHashCode: collection.Seq[Any]
    Attributes
    protected
    Definition Classes
    ElemNodeNodeSeqEquality
  28. 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
  29. def canEqual(other: Any): Boolean

    We insist we're only equal to other xml.Equality implementors, which heads off a lot of inconsistency up front.

    We insist we're only equal to other xml.Equality implementors, which heads off a lot of inconsistency up front.

    Definition Classes
    NodeNodeSeqEquality → Seq → Equals
  30. val child: Node*

    Returns child axis i.e.

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

    returns

    all children of this node

    Definition Classes
    ElemNode
  31. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  32. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  33. final def coll: Elem.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  34. def collect[B](pf: PartialFunction[Node, B]): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  35. def collectFirst[B](pf: PartialFunction[Node, B]): Option[B]
    Definition Classes
    IterableOnceOps
  36. def combinations(n: Int): collection.Iterator[NodeSeq]
    Definition Classes
    SeqOps
  37. def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, Node]
    Definition Classes
    PartialFunction
  38. def compose[A](g: (A) => Int): (A) => Node
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  39. final def concat[B >: Node](suffix: collection.IterableOnce[B]): collection.immutable.Seq[B]
    Definition Classes
    SeqOps → IterableOps
    Annotations
    @inline()
  40. def contains[A1 >: Node](elem: A1): Boolean
    Definition Classes
    SeqOps
  41. def containsSlice[B](that: collection.Seq[B]): Boolean
    Definition Classes
    SeqOps
  42. def copy(prefix: String = this.prefix, label: String = this.label, attributes: MetaData = this.attributes, scope: NamespaceBinding = this.scope, minimizeEmpty: Boolean = this.minimizeEmpty, child: collection.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

  43. def copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  44. def copyToArray[B >: Node](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
  45. def copyToArray[B >: Node](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
  46. def corresponds[B](that: collection.Seq[B])(p: (Node, B) => Boolean): Boolean
    Definition Classes
    SeqOps
  47. def corresponds[B](that: collection.IterableOnce[B])(p: (Node, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  48. def count(p: (Node) => Boolean): Int
    Definition Classes
    IterableOnceOps
  49. 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
  50. def descendant_or_self: List[Node]

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

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

    Definition Classes
    Node
  51. def diff[B >: Node](that: collection.Seq[B]): NodeSeq
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  52. def distinct: NodeSeq
    Definition Classes
    SeqOps
  53. def distinctBy[B](f: (Node) => B): NodeSeq
    Definition Classes
    StrictOptimizedSeqOps → StrictOptimizedSeqOps → SeqOps
  54. 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
  55. final def doTransform: Boolean
    Definition Classes
    ElemNode
  56. def drop(n: Int): NodeSeq
    Definition Classes
    IterableOps → IterableOnceOps
  57. def dropRight(n: Int): NodeSeq
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  58. def dropWhile(p: (Node) => Boolean): NodeSeq
    Definition Classes
    IterableOps → IterableOnceOps
  59. def elementWise: ElementWiseExtractor[Int, Node]
    Definition Classes
    PartialFunction
  60. def empty: NodeSeq
    Definition Classes
    ScalaVersionSpecificNodeSeq → IterableOps
  61. def endsWith[B >: Node](that: collection.Iterable[B]): Boolean
    Definition Classes
    SeqOps
  62. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  63. def equals(other: Any): Boolean
    Definition Classes
    Equality → Equals → AnyRef → Any
  64. def exists(p: (Node) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  65. def filter(pred: (Node) => Boolean): NodeSeq
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  66. def filterImpl(pred: (Node) => Boolean, isFlipped: Boolean): NodeSeq
    Attributes
    protected[scala.collection]
    Definition Classes
    StrictOptimizedIterableOps
  67. def filterNot(pred: (Node) => Boolean): NodeSeq
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  68. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  69. def find(p: (Node) => Boolean): Option[Node]
    Definition Classes
    IterableOnceOps
  70. def findLast(p: (Node) => Boolean): Option[Node]
    Definition Classes
    SeqOps
  71. def flatMap[B](f: (Node) => collection.IterableOnce[B]): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  72. def flatten[B](implicit toIterableOnce: (Node) => collection.IterableOnce[B]): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  73. def fold[A1 >: Node](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  74. def foldLeft[B](z: B)(op: (B, Node) => B): B
    Definition Classes
    IterableOnceOps
  75. def foldRight[B](z: B)(op: (Node, B) => B): B
    Definition Classes
    IterableOnceOps
  76. def forall(p: (Node) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  77. def foreach[U](f: (Node) => U): Unit
    Definition Classes
    IterableOnceOps
  78. def fromSpecific(coll: collection.IterableOnce[Node]): NodeSeq
    Definition Classes
    ScalaVersionSpecificNodeSeq → IterableOps
  79. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  80. 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
  81. def groupBy[K](f: (Node) => K): Map[K, NodeSeq]
    Definition Classes
    IterableOps
  82. def groupMap[K, B](key: (Node) => K)(f: (Node) => B): Map[K, collection.immutable.Seq[B]]
    Definition Classes
    IterableOps
  83. def groupMapReduce[K, B](key: (Node) => K)(f: (Node) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  84. def grouped(size: Int): collection.Iterator[NodeSeq]
    Definition Classes
    IterableOps
  85. 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
  86. def head: Node
    Definition Classes
    IterableOps
  87. def headOption: Option[Node]
    Definition Classes
    IterableOps
  88. def indexOf[B >: Node](elem: B): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override indexOf(elem, from) instead - indexOf(elem) calls indexOf(elem, 0)", "2.13.0")
  89. def indexOf[B >: Node](elem: B, from: Int): Int
    Definition Classes
    SeqOps
  90. def indexOfSlice[B >: Node](that: collection.Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override indexOfSlice(that, from) instead - indexOfSlice(that) calls indexOfSlice(that, 0)", "2.13.0")
  91. def indexOfSlice[B >: Node](that: collection.Seq[B], from: Int): Int
    Definition Classes
    SeqOps
  92. def indexWhere(p: (Node) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override indexWhere(p, from) instead - indexWhere(p) calls indexWhere(p, 0)", "2.13.0")
  93. def indexWhere(p: (Node) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  94. def indices: collection.immutable.Range
    Definition Classes
    SeqOps
  95. def init: NodeSeq
    Definition Classes
    IterableOps
  96. def inits: collection.Iterator[NodeSeq]
    Definition Classes
    IterableOps
  97. def intersect[B >: Node](that: collection.Seq[B]): NodeSeq
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  98. def isAtom: Boolean

    used internally.

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

    Definition Classes
    Node
  99. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    SeqOps
  100. def isEmpty: Boolean
    Definition Classes
    SeqOps → IterableOnceOps
  101. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  102. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  103. def iterableFactory: SeqFactory[collection.immutable.Seq]
    Definition Classes
    Seq → Seq → Iterable → Iterable → IterableOps
  104. def iterator: collection.Iterator[Node]
    Definition Classes
    NodeSeq → IterableOnce
  105. def knownSize: Int
    Definition Classes
    IterableOnce
  106. val label: String

    label of this node.

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

    Definition Classes
    ElemNode
  107. def last: Node
    Definition Classes
    IterableOps
  108. def lastIndexOf[B >: Node](elem: B, end: Int): Int
    Definition Classes
    SeqOps
  109. def lastIndexOfSlice[B >: Node](that: collection.Seq[B]): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override lastIndexOfSlice(that, end) instead - lastIndexOfSlice(that) calls lastIndexOfSlice(that, Int.MaxValue)", "2.13.0")
  110. def lastIndexOfSlice[B >: Node](that: collection.Seq[B], end: Int): Int
    Definition Classes
    SeqOps
  111. def lastIndexWhere(p: (Node) => Boolean): Int
    Definition Classes
    SeqOps
    Annotations
    @deprecatedOverriding("Override lastIndexWhere(p, end) instead - lastIndexWhere(p) calls lastIndexWhere(p, Int.MaxValue)", "2.13.0")
  112. def lastIndexWhere(p: (Node) => Boolean, end: Int): Int
    Definition Classes
    SeqOps
  113. def lastOption: Option[Node]
    Definition Classes
    IterableOps
  114. def lazyZip[B](that: collection.Iterable[B]): LazyZip2[Node, B, Elem.this.type]
    Definition Classes
    Iterable
  115. def length: Int
    Definition Classes
    NodeSeq → SeqOps
  116. def lengthCompare(that: collection.Iterable[_]): Int
    Definition Classes
    SeqOps
  117. def lengthCompare(len: Int): Int
    Definition Classes
    SeqOps
  118. final def lengthIs: SizeCompareOps
    Definition Classes
    SeqOps
    Annotations
    @inline()
  119. def lift: (Int) => Option[Node]
    Definition Classes
    PartialFunction
  120. def map[B](f: (Node) => B): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  121. def max[B >: Node](implicit ord: math.Ordering[B]): Node
    Definition Classes
    IterableOnceOps
  122. def maxBy[B](f: (Node) => B)(implicit cmp: math.Ordering[B]): Node
    Definition Classes
    IterableOnceOps
  123. def maxByOption[B](f: (Node) => B)(implicit cmp: math.Ordering[B]): Option[Node]
    Definition Classes
    IterableOnceOps
  124. def maxOption[B >: Node](implicit ord: math.Ordering[B]): Option[Node]
    Definition Classes
    IterableOnceOps
  125. def min[B >: Node](implicit ord: math.Ordering[B]): Node
    Definition Classes
    IterableOnceOps
  126. def minBy[B](f: (Node) => B)(implicit cmp: math.Ordering[B]): Node
    Definition Classes
    IterableOnceOps
  127. def minByOption[B](f: (Node) => B)(implicit cmp: math.Ordering[B]): Option[Node]
    Definition Classes
    IterableOnceOps
  128. def minOption[B >: Node](implicit ord: math.Ordering[B]): Option[Node]
    Definition Classes
    IterableOnceOps
  129. val minimizeEmpty: Boolean
  130. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  131. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  132. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  133. def nameToString(sb: StringBuilder): StringBuilder

    Appends qualified name of this node to StringBuilder.

    Appends qualified name of this node to StringBuilder.

    Definition Classes
    Node
  134. def namespace: String

    convenience, same as getNamespace(this.prefix)

    convenience, same as getNamespace(this.prefix)

    Definition Classes
    Node
  135. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  136. def newSpecificBuilder: Builder[Node, NodeSeq]
    Definition Classes
    ScalaVersionSpecificNodeSeq → IterableOps
  137. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
  138. def nonEmptyChildren: collection.Seq[Node]

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

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

    Definition Classes
    Node
  139. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  140. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  141. def occCounts[B](sq: collection.Seq[B]): Map[B, Int]
    Attributes
    protected[scala.collection]
    Definition Classes
    SeqOps
  142. def orElse[A1 <: Int, B1 >: Node](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  143. def padTo[B >: Node](len: Int, elem: B): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  144. def partition(p: (Node) => Boolean): (NodeSeq, NodeSeq)
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  145. def partitionMap[A1, A2](f: (Node) => Either[A1, A2]): (collection.immutable.Seq[A1], collection.immutable.Seq[A2])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  146. def patch[B >: Node](from: Int, other: collection.IterableOnce[B], replaced: Int): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  147. def permutations: collection.Iterator[NodeSeq]
    Definition Classes
    SeqOps
  148. val prefix: String

    prefix of this node

    prefix of this node

    Definition Classes
    ElemNode
  149. def prepended[B >: Node](elem: B): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  150. def prependedAll[B >: Node](prefix: collection.IterableOnce[B]): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  151. def product[B >: Node](implicit num: math.Numeric[B]): B
    Definition Classes
    IterableOnceOps
  152. def reduce[B >: Node](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  153. def reduceLeft[B >: Node](op: (B, Node) => B): B
    Definition Classes
    IterableOnceOps
  154. def reduceLeftOption[B >: Node](op: (B, Node) => B): Option[B]
    Definition Classes
    IterableOnceOps
  155. def reduceOption[B >: Node](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  156. def reduceRight[B >: Node](op: (Node, B) => B): B
    Definition Classes
    IterableOnceOps
  157. def reduceRightOption[B >: Node](op: (Node, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  158. def reverse: NodeSeq
    Definition Classes
    SeqOps
  159. def reverseIterator: collection.Iterator[Node]
    Definition Classes
    SeqOps
  160. def reversed: collection.Iterable[Node]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  161. def runWith[U](action: (Node) => U): (Int) => Boolean
    Definition Classes
    PartialFunction
  162. def sameElements[B >: Node](that: collection.IterableOnce[B]): Boolean
    Definition Classes
    SeqOps
  163. def scan[B >: Node](z: B)(op: (B, B) => B): collection.immutable.Seq[B]
    Definition Classes
    IterableOps
  164. def scanLeft[B](z: B)(op: (B, Node) => B): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  165. def scanRight[B](z: B)(op: (Node, B) => B): collection.immutable.Seq[B]
    Definition Classes
    IterableOps
  166. val scope: NamespaceBinding

    method returning the namespace bindings of this node.

    method returning the namespace bindings of this node. by default, this is TopScope, which means there are no namespace bindings except the predefined one for "xml".

    Definition Classes
    ElemNode
  167. def search[B >: Node](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    SeqOps
  168. def search[B >: Node](elem: B)(implicit ord: Ordering[B]): SearchResult
    Definition Classes
    SeqOps
  169. def segmentLength(p: (Node) => Boolean, from: Int): Int
    Definition Classes
    SeqOps
  170. final def segmentLength(p: (Node) => Boolean): Int
    Definition Classes
    SeqOps
  171. final def size: Int
    Definition Classes
    SeqOps → IterableOnceOps
  172. final def sizeCompare(that: collection.Iterable[_]): Int
    Definition Classes
    SeqOps → IterableOps
  173. final def sizeCompare(otherSize: Int): Int
    Definition Classes
    SeqOps → IterableOps
  174. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  175. def slice(from: Int, until: Int): NodeSeq
    Definition Classes
    IterableOps → IterableOnceOps
  176. def sliding(size: Int, step: Int): collection.Iterator[NodeSeq]
    Definition Classes
    IterableOps
  177. def sliding(size: Int): collection.Iterator[NodeSeq]
    Definition Classes
    IterableOps
  178. def sortBy[B](f: (Node) => B)(implicit ord: Ordering[B]): NodeSeq
    Definition Classes
    SeqOps
  179. def sortWith(lt: (Node, Node) => Boolean): NodeSeq
    Definition Classes
    SeqOps
  180. def sorted[B >: Node](implicit ord: Ordering[B]): NodeSeq
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  181. def span(p: (Node) => Boolean): (NodeSeq, NodeSeq)
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  182. def splitAt(n: Int): (NodeSeq, NodeSeq)
    Definition Classes
    IterableOps → IterableOnceOps
  183. def startsWith[B >: Node](that: collection.IterableOnce[B], offset: Int): Boolean
    Definition Classes
    SeqOps
  184. def stepper[S <: Stepper[_]](implicit shape: StepperShape[Node, S]): S
    Definition Classes
    IterableOnce
  185. final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[Node, B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  186. final def strictOptimizedConcat[B >: Node, C2](that: collection.IterableOnce[B], b: Builder[B, C2]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  187. final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (Node) => collection.IterableOnce[B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  188. final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (Node) => collection.IterableOnce[B]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  189. final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (Node) => B): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  190. final def strictOptimizedZip[B, C2](that: collection.IterableOnce[B], b: Builder[(Node, B), C2]): C2
    Attributes
    protected[this]
    Definition Classes
    StrictOptimizedIterableOps
    Annotations
    @inline()
  191. def strict_!=(other: Equality): Boolean
    Definition Classes
    Equality
  192. def strict_==(other: Equality): Boolean
    Definition Classes
    NodeNodeSeqEquality
  193. def stringPrefix: String
    Attributes
    protected[this]
    Definition Classes
    Seq → Iterable
    Annotations
    @deprecatedOverriding("Compatibility override", "2.13.0")
  194. def sum[B >: Node](implicit num: math.Numeric[B]): B
    Definition Classes
    IterableOnceOps
  195. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  196. def tail: NodeSeq
    Definition Classes
    IterableOps
  197. def tails: collection.Iterator[NodeSeq]
    Definition Classes
    IterableOps
  198. def take(n: Int): NodeSeq
    Definition Classes
    IterableOps → IterableOnceOps
  199. def takeRight(n: Int): NodeSeq
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  200. def takeWhile(p: (Node) => Boolean): NodeSeq
    Definition Classes
    IterableOps → IterableOnceOps
  201. def tapEach[U](f: (Node) => U): NodeSeq
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps
  202. def text: String

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

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

    Definition Classes
    ElemNodeNodeSeq
  203. def theSeq: collection.Seq[Node]

    returns a sequence consisting of only this node

    returns a sequence consisting of only this node

    Definition Classes
    NodeNodeSeq
  204. def to[C1](factory: Factory[Node, C1]): C1
    Definition Classes
    IterableOnceOps
  205. def toArray[B >: Node](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  206. final def toBuffer[B >: Node]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  207. def toIndexedSeq: collection.immutable.IndexedSeq[Node]
    Definition Classes
    IterableOnceOps
  208. final def toIterable: Elem.this.type
    Definition Classes
    Iterable → IterableOps
  209. def toList: collection.immutable.List[Node]
    Definition Classes
    IterableOnceOps
  210. def toMap[K, V](implicit ev: <:<[Node, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  211. final def toSeq: Elem.this.type
    Definition Classes
    Seq → IterableOnceOps
  212. def toSet[B >: Node]: Set[B]
    Definition Classes
    IterableOnceOps
  213. def toString(): String

    Same as toString(false).

    Same as toString(false).

    Definition Classes
    NodeNodeSeq → Seq → Function1 → Iterable → AnyRef → Any
  214. def toVector: collection.immutable.Vector[Node]
    Definition Classes
    IterableOnceOps
  215. def transpose[B](implicit asIterable: (Node) => collection.Iterable[B]): collection.immutable.Seq[collection.immutable.Seq[B]]
    Definition Classes
    IterableOps
  216. def unapply(a: Int): Option[Node]
    Definition Classes
    PartialFunction
  217. def unzip[A1, A2](implicit asPair: (Node) => (A1, A2)): (collection.immutable.Seq[A1], collection.immutable.Seq[A2])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  218. def unzip3[A1, A2, A3](implicit asTriple: (Node) => (A1, A2, A3)): (collection.immutable.Seq[A1], collection.immutable.Seq[A2], collection.immutable.Seq[A3])
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  219. def updated[B >: Node](index: Int, elem: B): collection.immutable.Seq[B]
    Definition Classes
    StrictOptimizedSeqOps → SeqOps
  220. def view: SeqView[Node]
    Definition Classes
    SeqOps → IterableOps
  221. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  222. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  223. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  224. def withFilter(p: (Node) => Boolean): WithFilter[Node, [_]collection.immutable.Seq[_]]
    Definition Classes
    IterableOps
  225. def xmlType(): TypeSymbol

    Returns a type symbol (e.g.

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

    Definition Classes
    Node
  226. final def xml_!=(other: Any): Boolean
    Definition Classes
    Equality
  227. final def xml_==(other: Any): Boolean
    Definition Classes
    Equality
  228. def xml_sameElements[A](that: Iterable[A]): Boolean
    Definition Classes
    NodeSeq
  229. def zip[B](that: collection.IterableOnce[B]): collection.immutable.Seq[(Node, B)]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps
  230. def zipAll[A1 >: Node, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): collection.immutable.Seq[(A1, B)]
    Definition Classes
    IterableOps
  231. def zipWithIndex: collection.immutable.Seq[(Node, Int)]
    Definition Classes
    StrictOptimizedIterableOps → IterableOps → IterableOnceOps

Deprecated Value Members

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

    (Since version 2.13.0) Use foldLeft instead of /:

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

    (Since version 2.13.0) Use foldRight instead of :\

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

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

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

    (Since version 2.13.0) Use iterableFactory instead

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

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

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

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

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

    (Since version 2.13.0) Use segmentLength instead of prefixLength

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

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

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

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

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

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

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

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

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

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

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

    (Since version 2.13.0) Use toIterable instead

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

    (Since version 2.13.0) Use concat instead

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

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

Inherited from Node

Inherited from NodeSeq

Inherited from java.io.Serializable

Inherited from Equality

Inherited from ScalaVersionSpecificNodeSeq

Inherited from AbstractSeq[Node]

Inherited from collection.Seq[Node]

Inherited from Equals

Inherited from PartialFunction[Int, Node]

Inherited from (Int) => Node

Inherited from AbstractIterable[Node]

Inherited from collection.Iterable[Node]

Inherited from AnyRef

Inherited from Any

Ungrouped