scala.xml

ProcInstr

case class ProcInstr(target: String, proctext: String) extends SpecialNode with Product with Serializable

an XML node for processing instructions (PI)

target

target name of this PI

proctext

text contained in this node, may not contain "?>"

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

Instance Constructors

  1. new ProcInstr(target: String, proctext: String)

    target

    target name of this PI

    proctext

    text contained in this node, may not contain "?>"

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. def ++[B >: Node, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    Any
  25. 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
  26. 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
  27. final def attributes: Null.type

    always empty

    always empty

    returns

    all attributes of this node

    Definition Classes
    SpecialNodeNode
  28. def basisForHashCode: Seq[Any]

    Attributes
    protected
    Definition Classes
    NodeNodeSeqEquality
  29. def buildString(sb: StringBuilder): collection.mutable.StringBuilder

    appends "<?" target (" "+text)?+"?>" to this stringbuffer.

    appends "<?" target (" "+text)?+"?>" to this stringbuffer.

    Definition Classes
    ProcInstrSpecialNode
  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. final def child: collection.immutable.Nil.type

    always empty

    always empty

    returns

    all children of this node

    Definition Classes
    SpecialNodeNode
  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 copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Unit

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

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

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

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

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

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

    Definition Classes
    SeqLike → GenSeqLike
  50. def distinct: NodeSeq

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

    Definition Classes
    ProcInstrNode
  53. def drop(n: Int): NodeSeq

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    IterableLike
  76. def hasDefiniteSize: Boolean

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

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

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

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

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

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

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

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

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

    Definition Classes
    SeqLike
  87. def init: NodeSeq

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

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

    Definition Classes
    SeqLike → GenSeqLike
  90. def isAtom: Boolean

    used internally.

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

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

    Definition Classes
    GenSeqLike
  92. def isEmpty: Boolean

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

    Definition Classes
    Any
  94. final def isTraversableAgain: Boolean

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

    Definition Classes
    NodeSeq → IterableLike → GenIterableLike
  96. final def label: String

    label of this node.

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

    Definition Classes
    ProcInstrNode
  97. def last: Node

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

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

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

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

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  105. def length: Int

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

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

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

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

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

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def mkString: String

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

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

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

    Appends qualified name of this node to StringBuilder.

    Appends qualified name of this node to StringBuilder.

    Definition Classes
    Node
  117. final def namespace: scala.Null

    always Node.

    always Node.EmptyNamespace

    Definition Classes
    SpecialNodeNode
  118. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  119. 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
  120. def nonEmpty: Boolean

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

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

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

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

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

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

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

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

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

    Definition Classes
    SeqLike
  131. def prefix: String

    prefix of this node

    prefix of this node

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

    Definition Classes
    GenSeqLike
  133. val proctext: String

    text contained in this node, may not contain "?>"

  134. def product[B >: Node](implicit num: Numeric[B]): B

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

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

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

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

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  141. def repr: NodeSeq

    Definition Classes
    TraversableLike → GenTraversableLike
  142. def reverse: NodeSeq

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

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

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

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

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

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

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

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

  151. def scope: NamespaceBinding

    method returning the namespace bindings of this node.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    NodeNodeSeqEquality
  167. def stringPrefix: String

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

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

    Definition Classes
    AnyRef
  170. def tail: NodeSeq

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

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

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

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

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  175. val target: String

    target name of this PI

  176. def text: String

    Returns a text representation of this node.

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

    doc\DocGenerator.scala:1219: error: object creation impossible, since there is a deferred declaration of method text in class Node of type => String which is not implemented in a subclass
    new SpecialNode {
    ^
    Definition Classes
    ProcInstrNodeNodeSeq
  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 Product

Inherited from SpecialNode

Inherited from XMLEvent

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