Class/Object

scala.xml

Node

Related Docs: object Node | package xml

Permalink

abstract class Node extends NodeSeq

An abstract class representing XML with nodes of a labelled tree. This class contains an implementation of a subset of XPath for navigation.

Version

1.1

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

Instance Constructors

  1. new Node()

    Permalink

Type Members

  1. type Self = NodeSeq

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

    Permalink
    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def child: Seq[Node]

    Permalink

    Returns child axis i.e.

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

    returns

    all children of this node

  2. abstract def label: String

    Permalink

    label of this node.

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

Concrete Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def ++[B >: Node, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  11. def \(that: String): NodeSeq

    Permalink

    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
  12. def \@(attributeName: String): String

    Permalink

    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
  13. def \\(that: String): NodeSeq

    Permalink

    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
  14. def addString(b: StringBuilder): StringBuilder

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    PartialFunction
  22. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  23. final def attribute(uri: String, key: String): Option[Seq[Node]]

    Permalink

    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.

  24. final def attribute(key: String): Option[Seq[Node]]

    Permalink

    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.

  25. def attributes: MetaData

    Permalink

    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

  26. def basisForHashCode: Seq[Any]

    Permalink
    Attributes
    protected
    Definition Classes
    NodeNodeSeqEquality
  27. def buildString(stripComments: Boolean): String

    Permalink

    String representation of this node

    String representation of this node

    stripComments

    if true, strips comment nodes from result

  28. def canEqual(other: Any): Boolean

    Permalink

    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
  29. def clone(): AnyRef

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    SeqLike
  37. def copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Unit

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  43. def descendant: List[Node]

    Permalink

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

  44. def descendant_or_self: List[Node]

    Permalink

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

  45. def diff[B >: Node](that: GenSeq[B]): NodeSeq

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  46. def distinct: NodeSeq

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  47. def doCollectNamespaces: Boolean

    Permalink

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

  48. def doTransform: Boolean

    Permalink
  49. def drop(n: Int): NodeSeq

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  69. def getNamespace(pre: String): String

    Permalink

    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

  70. def groupBy[K](f: (Node) ⇒ K): Map[K, NodeSeq]

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

    Permalink
    Definition Classes
    IterableLike
  72. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  73. def hashCode(): Int

    Permalink

    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
  74. def head: Node

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    GenSeqLike
  82. def indices: collection.immutable.Range

    Permalink
    Definition Classes
    SeqLike
  83. def init: NodeSeq

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

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

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  86. def isAtom: Boolean

    Permalink

    used internally.

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

  87. def isDefinedAt(idx: Int): Boolean

    Permalink
    Definition Classes
    GenSeqLike
  88. def isEmpty: Boolean

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

    Permalink
    Definition Classes
    Any
  90. final def isTraversableAgain: Boolean

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

    Permalink
    Definition Classes
    NodeSeq → IterableLike → GenIterableLike
  92. def last: Node

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

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

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

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

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

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

    Permalink
    Definition Classes
    GenSeqLike
  99. def lastOption: Option[Node]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  100. def length: Int

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  108. def mkString: String

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

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

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

    Permalink

    Appends qualified name of this node to StringBuilder.

  112. def namespace: String

    Permalink

    convenience, same as getNamespace(this.prefix)

  113. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  114. def newBuilder: Builder[Node, NodeSeq]

    Permalink

    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
  115. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def nonEmptyChildren: Seq[Node]

    Permalink

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

  117. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  118. final def notifyAll(): Unit

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    SeqLike
  126. def prefix: String

    Permalink

    prefix of this node

  127. def prefixLength(p: (Node) ⇒ Boolean): Int

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def repr: NodeSeq

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  136. def reverse: NodeSeq

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

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

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

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

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

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

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

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

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

  145. def scope: NamespaceBinding

    Permalink

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

  146. def segmentLength(p: (Node) ⇒ Boolean, from: Int): Int

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    NodeNodeSeqEquality
  161. def stringPrefix: String

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

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

    Permalink
    Definition Classes
    AnyRef
  164. def tail: NodeSeq

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

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

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

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  169. def text: String

    Permalink

    Returns a text representation of this node.

    Returns a text representation of this node. Note that this is not equivalent to the XPath node-test called text(), it is rather an implementation of the XPath function string() Martin to Burak: to do: if you make this method abstract, the compiler will now complain if there's no implementation in a subclass. Is this what we want? Note that this would break doc/DocGenator and doc/ModelToXML, with an error message like:

    doc\DocGenerator.scala:1219: error: object creation impossible, since there is a deferred declaration of method text in class Node of type => String which is not implemented in a subclass
    new SpecialNode {
    ^
    Definition Classes
    NodeNodeSeq
  170. def theSeq: Seq[Node]

    Permalink

    returns a sequence consisting of only this node

    returns a sequence consisting of only this node

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  179. def toList: List[Node]

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

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

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

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

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

    Permalink

    Same as toString(false).

    Same as toString(false).

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

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  186. def toVector: Vector[Node]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  187. def transpose[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): collection.immutable.Seq[collection.immutable.Seq[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

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

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

    Permalink
    Definition Classes
    GenericTraversableTemplate
  190. def unzip3[A1, A2, A3](implicit asTriple: (Node) ⇒ (A1, A2, A3)): (collection.immutable.Seq[A1], collection.immutable.Seq[A2], collection.immutable.Seq[A3])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  191. def updated[B >: Node, That](index: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

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

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

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

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

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

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

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

    Permalink

    Returns a type symbol (e.g.

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

  199. final def xml_!=(other: Any): Boolean

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

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

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

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  203. def zipAll[B, A1 >: Node, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  204. def zipWithIndex[A1 >: Node, That](implicit bf: CanBuildFrom[NodeSeq, (A1, Int), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

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