class PCData extends Atom[String]
This class (which is not used by all XML parsers, but always used by the XHTML one) represents parseable character data, which appeared as CDATA sections in the input and is to be preserved as CDATA section in the output.
- Alphabetic
- By Inheritance
- PCData
- Atom
- SpecialNode
- XMLEvent
- Node
- NodeSeq
- Serializable
- Equality
- ScalaVersionSpecificNodeSeq
- StrictOptimizedSeqOps
- StrictOptimizedSeqOps
- StrictOptimizedIterableOps
- Seq
- SeqOps
- Iterable
- AbstractSeq
- Seq
- Equals
- SeqOps
- PartialFunction
- Function1
- AbstractIterable
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new PCData(data: String)
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##(): Int
- Definition Classes
- AnyRef → Any
- final def ++(suffix: Seq[Node]): NodeSeq
- Definition Classes
- ScalaVersionSpecificNodeSeq
- Annotations
- @inline()
- final def ++[B >: Node](suffix: collection.IterableOnce[B]): collection.immutable.Seq[B]
- Definition Classes
- IterableOps
- Annotations
- @inline()
- final def ++:[B >: Node](prefix: collection.IterableOnce[B]): collection.immutable.Seq[B]
- Definition Classes
- SeqOps → IterableOps
- Annotations
- @inline()
- final def +:[B >: Node](elem: B): collection.immutable.Seq[B]
- Definition Classes
- SeqOps
- Annotations
- @inline()
- final def :+[B >: Node](elem: B): collection.immutable.Seq[B]
- Definition Classes
- SeqOps
- Annotations
- @inline()
- final def :++[B >: Node](suffix: collection.IterableOnce[B]): collection.immutable.Seq[B]
- Definition Classes
- SeqOps
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def \(that: String): NodeSeq
Projection function, which returns elements of
this
sequence based on the stringthat
.Projection function, which returns elements of
this
sequence based on the stringthat
. 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"
ofthis
;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
- 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
- def \\(that: String): NodeSeq
Projection function, which returns elements of
this
sequence and of all its subsequences, based on the stringthat
.Projection function, which returns elements of
this
sequence and of all its subsequences, based on the stringthat
. 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), includingthis
;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
- final def addString(b: collection.mutable.StringBuilder): collection.mutable.StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def addString(b: collection.mutable.StringBuilder, sep: String): collection.mutable.StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def addString(b: collection.mutable.StringBuilder, start: String, sep: String, end: String): collection.mutable.StringBuilder
- Definition Classes
- IterableOnceOps
- def andThen[C](k: PartialFunction[Node, C]): PartialFunction[Int, C]
- Definition Classes
- PartialFunction
- def andThen[C](k: (Node) => C): PartialFunction[Int, C]
- Definition Classes
- PartialFunction → Function1
- def appended(base: Node): NodeSeq
- Definition Classes
- ScalaVersionSpecificNodeSeq
- def appended[B >: Node](elem: B): collection.immutable.Seq[B]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def appendedAll(suffix: collection.IterableOnce[Node]): NodeSeq
- Definition Classes
- ScalaVersionSpecificNodeSeq
- def appendedAll[B >: Node](suffix: collection.IterableOnce[B]): collection.immutable.Seq[B]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def apply(f: (Node) => Boolean): NodeSeq
- Definition Classes
- NodeSeq
- def apply(i: Int): Node
- Definition Classes
- NodeSeq → SeqOps → Function1
- def applyOrElse[A1 <: Int, B1 >: Node](x: A1, default: (A1) => B1): B1
- Definition Classes
- PartialFunction
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- 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, otherwisenull
.
- Definition Classes
- Node
- 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, otherwisenull
.
- Definition Classes
- Node
- final def attributes: Null
always empty
- def basisForHashCode: collection.Seq[Any]
- def buildString(sb: StringBuilder): StringBuilder
Returns text, with some characters escaped according to the XML specification.
Returns text, with some characters escaped according to the XML specification.
- sb
the input string buffer associated to some XML element
- returns
the input string buffer with the formatted CDATA section
- Definition Classes
- PCData → Atom → SpecialNode
- 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
- 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. - final def child: collection.immutable.Nil
always empty
- def className: String
- Attributes
- protected[this]
- Definition Classes
- Iterable
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def coll: PCData.this.type
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[B](pf: PartialFunction[Node, B]): collection.immutable.Seq[B]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[Node, B]): Option[B]
- Definition Classes
- IterableOnceOps
- def combinations(n: Int): collection.Iterator[NodeSeq]
- Definition Classes
- SeqOps
- def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, Node]
- Definition Classes
- PartialFunction
- def compose[A](g: (A) => Int): (A) => Node
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- def concat(suffix: collection.IterableOnce[Node]): NodeSeq
- Definition Classes
- ScalaVersionSpecificNodeSeq
- final def concat[B >: Node](suffix: collection.IterableOnce[B]): collection.immutable.Seq[B]
- Definition Classes
- SeqOps → IterableOps
- Annotations
- @inline()
- def contains[A1 >: Node](elem: A1): Boolean
- Definition Classes
- SeqOps
- def containsSlice[B](that: collection.Seq[B]): Boolean
- Definition Classes
- SeqOps
- def copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: Node](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: Node](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- def corresponds[B](that: collection.Seq[B])(p: (Node, B) => Boolean): Boolean
- Definition Classes
- SeqOps
- def corresponds[B](that: collection.IterableOnce[B])(p: (Node, B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count(p: (Node) => Boolean): Int
- Definition Classes
- IterableOnceOps
- val data: String
- Definition Classes
- Atom
- 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
- 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
- def diff[B >: Node](that: collection.Seq[B]): NodeSeq
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def distinct: NodeSeq
- Definition Classes
- SeqOps
- def distinctBy[B](f: (Node) => B): NodeSeq
- Definition Classes
- StrictOptimizedSeqOps → StrictOptimizedSeqOps → SeqOps
- final def doCollectNamespaces: Boolean
The logic formerly found in typeTag$, as best I could infer it.
- final def doTransform: Boolean
- def drop(n: Int): NodeSeq
- Definition Classes
- IterableOps → IterableOnceOps
- def dropRight(n: Int): NodeSeq
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def dropWhile(p: (Node) => Boolean): NodeSeq
- Definition Classes
- IterableOps → IterableOnceOps
- def elementWise: ElementWiseExtractor[Int, Node]
- Definition Classes
- PartialFunction
- def empty: NodeSeq
- Definition Classes
- ScalaVersionSpecificNodeSeq → IterableOps
- def endsWith[B >: Node](that: collection.Iterable[B]): Boolean
- Definition Classes
- SeqOps
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(other: Any): Boolean
- Definition Classes
- Equality → Equals → AnyRef → Any
- def exists(p: (Node) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def filter(pred: (Node) => Boolean): NodeSeq
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def filterImpl(pred: (Node) => Boolean, isFlipped: Boolean): NodeSeq
- Attributes
- protected[collection]
- Definition Classes
- StrictOptimizedIterableOps
- def filterNot(pred: (Node) => Boolean): NodeSeq
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def find(p: (Node) => Boolean): Option[Node]
- Definition Classes
- IterableOnceOps
- def findLast(p: (Node) => Boolean): Option[Node]
- Definition Classes
- SeqOps
- def flatMap(f: (Node) => collection.IterableOnce[Node]): NodeSeq
- Definition Classes
- ScalaVersionSpecificNodeSeq
- def flatMap[B](f: (Node) => collection.IterableOnce[B]): collection.immutable.Seq[B]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def flatten[B](implicit toIterableOnce: (Node) => collection.IterableOnce[B]): collection.immutable.Seq[B]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def fold[A1 >: Node](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, Node) => B): B
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: (Node, B) => B): B
- Definition Classes
- IterableOnceOps
- def forall(p: (Node) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def foreach[U](f: (Node) => U): Unit
- Definition Classes
- IterableOnceOps
- def fromSpecific(coll: collection.IterableOnce[Node]): NodeSeq
- Definition Classes
- ScalaVersionSpecificNodeSeq → IterableOps
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def getNamespace(pre: String): String
Convenience method, same as
scope.getURI(pre)
but additionally checks if scope isnull
.Convenience method, same as
scope.getURI(pre)
but additionally checks if scope isnull
.- pre
the prefix whose namespace name we would like to obtain
- returns
the namespace if
scope != null
and prefix was found, elsenull
- Definition Classes
- Node
- def groupBy[K](f: (Node) => K): Map[K, NodeSeq]
- Definition Classes
- IterableOps
- def groupMap[K, B](key: (Node) => K)(f: (Node) => B): Map[K, collection.immutable.Seq[B]]
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: (Node) => K)(f: (Node) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
- IterableOps
- def grouped(size: Int): collection.Iterator[NodeSeq]
- Definition Classes
- IterableOps
- 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
- def head: Node
- Definition Classes
- IterableOps
- def headOption: Option[Node]
- Definition Classes
- IterableOps
- 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")
- def indexOf[B >: Node](elem: B, from: Int): Int
- Definition Classes
- SeqOps
- 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")
- def indexOfSlice[B >: Node](that: collection.Seq[B], from: Int): Int
- Definition Classes
- SeqOps
- 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")
- def indexWhere(p: (Node) => Boolean, from: Int): Int
- Definition Classes
- SeqOps
- def indices: collection.immutable.Range
- Definition Classes
- SeqOps
- def init: NodeSeq
- Definition Classes
- IterableOps
- def inits: collection.Iterator[NodeSeq]
- Definition Classes
- IterableOps
- def intersect[B >: Node](that: collection.Seq[B]): NodeSeq
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def isAtom: Boolean
used internally.
used internally. Atom/Molecule = -1 PI = -2 Comment = -3 EntityRef = -5
- Definition Classes
- Node
- def isDefinedAt(idx: Int): Boolean
- Definition Classes
- SeqOps
- def isEmpty: Boolean
- Definition Classes
- SeqOps → IterableOnceOps
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isTraversableAgain: Boolean
- Definition Classes
- IterableOps → IterableOnceOps
- def iterableFactory: SeqFactory[collection.immutable.Seq]
- Definition Classes
- Seq → Seq → Iterable → Iterable → IterableOps
- def iterator: collection.Iterator[Node]
- Definition Classes
- NodeSeq → IterableOnce
- def knownSize: Int
- Definition Classes
- IterableOnce
- def label: String
label of this node.
- def last: Node
- Definition Classes
- IterableOps
- def lastIndexOf[B >: Node](elem: B, end: Int): Int
- Definition Classes
- SeqOps
- 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")
- def lastIndexOfSlice[B >: Node](that: collection.Seq[B], end: Int): Int
- Definition Classes
- SeqOps
- 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")
- def lastIndexWhere(p: (Node) => Boolean, end: Int): Int
- Definition Classes
- SeqOps
- def lastOption: Option[Node]
- Definition Classes
- IterableOps
- def lazyZip[B](that: collection.Iterable[B]): LazyZip2[Node, B, PCData.this.type]
- Definition Classes
- Iterable
- def length: Int
- Definition Classes
- NodeSeq → SeqOps
- def lengthCompare(that: collection.Iterable[_]): Int
- Definition Classes
- SeqOps
- def lengthCompare(len: Int): Int
- Definition Classes
- SeqOps
- final def lengthIs: SizeCompareOps
- Definition Classes
- SeqOps
- Annotations
- @inline()
- def lift: (Int) => Option[Node]
- Definition Classes
- PartialFunction
- def map(f: (Node) => Node): NodeSeq
- Definition Classes
- ScalaVersionSpecificNodeSeq
- def map[B](f: (Node) => B): collection.immutable.Seq[B]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def max[B >: Node](implicit ord: math.Ordering[B]): Node
- Definition Classes
- IterableOnceOps
- def maxBy[B](f: (Node) => B)(implicit cmp: math.Ordering[B]): Node
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: (Node) => B)(implicit cmp: math.Ordering[B]): Option[Node]
- Definition Classes
- IterableOnceOps
- def maxOption[B >: Node](implicit ord: math.Ordering[B]): Option[Node]
- Definition Classes
- IterableOnceOps
- def min[B >: Node](implicit ord: math.Ordering[B]): Node
- Definition Classes
- IterableOnceOps
- def minBy[B](f: (Node) => B)(implicit cmp: math.Ordering[B]): Node
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: (Node) => B)(implicit cmp: math.Ordering[B]): Option[Node]
- Definition Classes
- IterableOnceOps
- def minOption[B >: Node](implicit ord: math.Ordering[B]): Option[Node]
- Definition Classes
- IterableOnceOps
- final def mkString: String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(sep: String): String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(start: String, sep: String, end: String): String
- Definition Classes
- IterableOnceOps
- def nameToString(sb: StringBuilder): StringBuilder
Appends qualified name of this node to
StringBuilder
.Appends qualified name of this node to
StringBuilder
.- Definition Classes
- Node
- final def namespace: Null
always Node.EmptyNamespace
always Node.EmptyNamespace
- Definition Classes
- SpecialNode → Node
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newSpecificBuilder: Builder[Node, NodeSeq]
- Definition Classes
- ScalaVersionSpecificNodeSeq → IterableOps
- def nonEmpty: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding("nonEmpty is defined as !isEmpty; override isEmpty instead", "2.13.0")
- 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
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def occCounts[B](sq: collection.Seq[B]): Map[B, Int]
- Attributes
- protected[collection]
- Definition Classes
- SeqOps
- def orElse[A1 <: Int, B1 >: Node](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
- Definition Classes
- PartialFunction
- def padTo[B >: Node](len: Int, elem: B): collection.immutable.Seq[B]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def partition(p: (Node) => Boolean): (NodeSeq, NodeSeq)
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def partitionMap[A1, A2](f: (Node) => Either[A1, A2]): (collection.immutable.Seq[A1], collection.immutable.Seq[A2])
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def patch[B >: Node](from: Int, other: collection.IterableOnce[B], replaced: Int): collection.immutable.Seq[B]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def permutations: collection.Iterator[NodeSeq]
- Definition Classes
- SeqOps
- def prefix: String
prefix of this node
prefix of this node
- Definition Classes
- Node
- def prepended(base: Node): NodeSeq
- Definition Classes
- ScalaVersionSpecificNodeSeq
- def prepended[B >: Node](elem: B): collection.immutable.Seq[B]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def prependedAll(prefix: collection.IterableOnce[Node]): NodeSeq
- Definition Classes
- ScalaVersionSpecificNodeSeq
- def prependedAll[B >: Node](prefix: collection.IterableOnce[B]): collection.immutable.Seq[B]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def product[B >: Node](implicit num: math.Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def reduce[B >: Node](op: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeft[B >: Node](op: (B, Node) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: Node](op: (B, Node) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: Node](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: Node](op: (Node, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: Node](op: (Node, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reverse: NodeSeq
- Definition Classes
- SeqOps
- def reverseIterator: collection.Iterator[Node]
- Definition Classes
- SeqOps
- def reversed: collection.Iterable[Node]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- def runWith[U](action: (Node) => U): (Int) => Boolean
- Definition Classes
- PartialFunction
- def sameElements[B >: Node](that: collection.IterableOnce[B]): Boolean
- Definition Classes
- SeqOps
- def scan[B >: Node](z: B)(op: (B, B) => B): collection.immutable.Seq[B]
- Definition Classes
- IterableOps
- def scanLeft[B](z: B)(op: (B, Node) => B): collection.immutable.Seq[B]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def scanRight[B](z: B)(op: (Node, B) => B): collection.immutable.Seq[B]
- Definition Classes
- IterableOps
- 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
- def search[B >: Node](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
- Definition Classes
- SeqOps
- def search[B >: Node](elem: B)(implicit ord: Ordering[B]): SearchResult
- Definition Classes
- SeqOps
- def segmentLength(p: (Node) => Boolean, from: Int): Int
- Definition Classes
- SeqOps
- final def segmentLength(p: (Node) => Boolean): Int
- Definition Classes
- SeqOps
- final def size: Int
- Definition Classes
- SeqOps → IterableOnceOps
- final def sizeCompare(that: collection.Iterable[_]): Int
- Definition Classes
- SeqOps → IterableOps
- final def sizeCompare(otherSize: Int): Int
- Definition Classes
- SeqOps → IterableOps
- final def sizeIs: SizeCompareOps
- Definition Classes
- IterableOps
- Annotations
- @inline()
- def slice(from: Int, until: Int): NodeSeq
- Definition Classes
- IterableOps → IterableOnceOps
- def sliding(size: Int, step: Int): collection.Iterator[NodeSeq]
- Definition Classes
- IterableOps
- def sliding(size: Int): collection.Iterator[NodeSeq]
- Definition Classes
- IterableOps
- def sortBy[B](f: (Node) => B)(implicit ord: Ordering[B]): NodeSeq
- Definition Classes
- SeqOps
- def sortWith(lt: (Node, Node) => Boolean): NodeSeq
- Definition Classes
- SeqOps
- def sorted[B >: Node](implicit ord: Ordering[B]): NodeSeq
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def span(p: (Node) => Boolean): (NodeSeq, NodeSeq)
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def splitAt(n: Int): (NodeSeq, NodeSeq)
- Definition Classes
- IterableOps → IterableOnceOps
- def startsWith[B >: Node](that: collection.IterableOnce[B], offset: Int): Boolean
- Definition Classes
- SeqOps
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[Node, S]): S
- Definition Classes
- IterableOnce
- final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[Node, B]): C2
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedConcat[B >: Node, C2](that: collection.IterableOnce[B], b: Builder[B, C2]): C2
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (Node) => collection.IterableOnce[B]): C2
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (Node) => collection.IterableOnce[B]): C2
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (Node) => B): C2
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedZip[B, C2](that: collection.IterableOnce[B], b: Builder[(Node, B), C2]): C2
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- def strict_!=(other: Equality): Boolean
- Definition Classes
- Equality
- def strict_==(other: Equality): Boolean
- def stringPrefix: String
- Attributes
- protected[this]
- Definition Classes
- Seq → Iterable
- def sum[B >: Node](implicit num: math.Numeric[B]): B
- Definition Classes
- IterableOnceOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tail: NodeSeq
- Definition Classes
- IterableOps
- def tails: collection.Iterator[NodeSeq]
- Definition Classes
- IterableOps
- def take(n: Int): NodeSeq
- Definition Classes
- IterableOps → IterableOnceOps
- def takeRight(n: Int): NodeSeq
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def takeWhile(p: (Node) => Boolean): NodeSeq
- Definition Classes
- IterableOps → IterableOnceOps
- def tapEach[U](f: (Node) => U): NodeSeq
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- 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 { ^
- def theSeq: collection.Seq[Node]
returns a sequence consisting of only this node
- def to[C1](factory: Factory[Node, C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray[B >: Node](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: Node]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toIndexedSeq: collection.immutable.IndexedSeq[Node]
- Definition Classes
- IterableOnceOps
- final def toIterable: PCData.this.type
- Definition Classes
- Iterable → IterableOps
- def toList: collection.immutable.List[Node]
- Definition Classes
- IterableOnceOps
- def toMap[K, V](implicit ev: <:<[Node, (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- final def toSeq: PCData.this.type
- Definition Classes
- Seq → IterableOnceOps
- def toSet[B >: Node]: Set[B]
- Definition Classes
- IterableOnceOps
- def toString(): String
Same as
toString(false)
. - def toVector: collection.immutable.Vector[Node]
- Definition Classes
- IterableOnceOps
- def transpose[B](implicit asIterable: (Node) => collection.Iterable[B]): collection.immutable.Seq[collection.immutable.Seq[B]]
- Definition Classes
- IterableOps
- def unapply(a: Int): Option[Node]
- Definition Classes
- PartialFunction
- def unzip[A1, A2](implicit asPair: (Node) => (A1, A2)): (collection.immutable.Seq[A1], collection.immutable.Seq[A2])
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- 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
- def updated[B >: Node](index: Int, elem: B): collection.immutable.Seq[B]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def view: SeqView[Node]
- Definition Classes
- SeqOps → IterableOps
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- def withFilter(p: (Node) => Boolean): WithFilter[Node, [_]collection.immutable.Seq[_]]
- Definition Classes
- IterableOps
- def xmlType(): TypeSymbol
Returns a type symbol (e.g.
Returns a type symbol (e.g. DTD, XSD), default
null
.- Definition Classes
- Node
- final def xml_!=(other: Any): Boolean
- Definition Classes
- Equality
- final def xml_==(other: Any): Boolean
- Definition Classes
- Equality
- def xml_sameElements[A](that: Iterable[A]): Boolean
- Definition Classes
- NodeSeq
- def zip[B](that: collection.IterableOnce[B]): collection.immutable.Seq[(Node, B)]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def zipAll[A1 >: Node, B](that: collection.Iterable[B], thisElem: A1, thatElem: B): collection.immutable.Seq[(A1, B)]
- Definition Classes
- IterableOps
- def zipWithIndex: collection.immutable.Seq[(Node, Int)]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
Deprecated Value Members
- 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 /:
- 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 :\
- 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. UsefoldLeft(z)(seqop)
instead.
- 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
- 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
- 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)
- final def prefixLength(p: (Node) => Boolean): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use segmentLength instead of prefixLength
- 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
- 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)
- def seq: PCData.this.type
- Definition Classes
- Iterable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
- final def toIterator: collection.Iterator[Node]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- 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
- final def toTraversable: collection.Traversable[Node]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use toIterable instead
- 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
- 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)