class Unparsed extends Atom[String]
An XML node for unparsed content. It will be output verbatim, all bets are off regarding wellformedness etc.
- Alphabetic
- By Inheritance
- Unparsed
- Atom
- Serializable
- Serializable
- SpecialNode
- XMLEvent
- Node
- NodeSeq
- Equality
- Seq
- Iterable
- Traversable
- Immutable
- AbstractSeq
- Seq
- SeqLike
- GenSeq
- GenSeqLike
- PartialFunction
- Function1
- AbstractIterable
- Iterable
- IterableLike
- Equals
- GenIterable
- GenIterableLike
- AbstractTraversable
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
Unparsed(data: String)
- data
content in this node, may not be null.
Type Members
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
++[B >: Node, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: Node, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: Node, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
- Definition Classes
- TraversableLike
-
def
+:[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
/:[B](z: B)(op: (B, Node) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:+[B >: Node, That](elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
:\[B](z: B)(op: (Node, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
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 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
-
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"
;\\ "_"
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
-
def
addString(b: StringBuilder): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
aggregate[B](z: ⇒ B)(seqop: (B, Node) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
andThen[C](k: (Node) ⇒ C): PartialFunction[Int, C]
- Definition Classes
- PartialFunction → Function1
-
def
apply(f: (Node) ⇒ Boolean): NodeSeq
- Definition Classes
- NodeSeq
-
def
apply(i: Int): Node
- Definition Classes
- NodeSeq → SeqLike → GenSeqLike → 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[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[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.type
always empty
- def basisForHashCode: Seq[Any]
-
def
buildString(sb: StringBuilder): StringBuilder
Returns text, with some characters escaped according to XML specification.
Returns text, with some characters escaped according to XML specification.
- Definition Classes
- Unparsed → 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.type
always empty
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
collect[B, That](pf: PartialFunction[Node, B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[Node, B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
combinations(n: Int): collection.Iterator[NodeSeq]
- Definition Classes
- SeqLike
-
def
companion: GenericCompanion[collection.immutable.Seq]
- Definition Classes
- Seq → Seq → GenSeq → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → GenericTraversableTemplate
-
def
compose[A](g: (A) ⇒ Int): (A) ⇒ Node
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
contains[A1 >: Node](elem: A1): Boolean
- Definition Classes
- SeqLike
-
def
containsSlice[B](that: GenSeq[B]): Boolean
- Definition Classes
- SeqLike
-
def
copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: Node](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: Node](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: Node](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
corresponds[B](that: GenSeq[B])(p: (Node, B) ⇒ Boolean): Boolean
- Definition Classes
- SeqLike → GenSeqLike
-
def
count(p: (Node) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
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 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
-
def
diff[B >: Node](that: GenSeq[B]): NodeSeq
- Definition Classes
- SeqLike → GenSeqLike
-
def
distinct: NodeSeq
- Definition Classes
- SeqLike → GenSeqLike
-
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
- IterableLike → TraversableLike → GenTraversableLike
-
def
dropRight(n: Int): NodeSeq
- Definition Classes
- IterableLike
-
def
dropWhile(p: (Node) ⇒ Boolean): NodeSeq
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
endsWith[B](that: GenSeq[B]): Boolean
- Definition Classes
- SeqLike → GenSeqLike
-
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
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
filter(p: (Node) ⇒ Boolean): NodeSeq
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterNot(p: (Node) ⇒ Boolean): NodeSeq
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: (Node) ⇒ Boolean): Option[Node]
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
flatMap[B, That](f: (Node) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): collection.immutable.Seq[B]
- Definition Classes
- GenericTraversableTemplate
-
def
fold[A1 >: Node](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, Node) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: (Node, B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
forall(p: (Node) ⇒ Boolean): Boolean
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: (Node) ⇒ U): Unit
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
-
def
genericBuilder[B]: Builder[B, collection.immutable.Seq[B]]
- Definition Classes
- GenericTraversableTemplate
-
final
def
getClass(): Class[_]
- 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
- TraversableLike → GenTraversableLike
-
def
grouped(size: Int): collection.Iterator[NodeSeq]
- Definition Classes
- IterableLike
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
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
- IterableLike → TraversableLike → GenTraversableLike
-
def
headOption: Option[Node]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
indexOf[B >: Node](elem: B, from: Int): Int
- Definition Classes
- GenSeqLike
-
def
indexOf[B >: Node](elem: B): Int
- Definition Classes
- GenSeqLike
-
def
indexOfSlice[B >: Node](that: GenSeq[B], from: Int): Int
- Definition Classes
- SeqLike
-
def
indexOfSlice[B >: Node](that: GenSeq[B]): Int
- Definition Classes
- SeqLike
-
def
indexWhere(p: (Node) ⇒ Boolean, from: Int): Int
- Definition Classes
- SeqLike → GenSeqLike
-
def
indexWhere(p: (Node) ⇒ Boolean): Int
- Definition Classes
- GenSeqLike
-
def
indices: collection.immutable.Range
- Definition Classes
- SeqLike
-
def
init: NodeSeq
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
inits: collection.Iterator[NodeSeq]
- Definition Classes
- TraversableLike
-
def
intersect[B >: Node](that: GenSeq[B]): NodeSeq
- Definition Classes
- SeqLike → GenSeqLike
-
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
- GenSeqLike
-
def
isEmpty: Boolean
- Definition Classes
- SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
def
iterator: collection.Iterator[Node]
- Definition Classes
- NodeSeq → IterableLike → GenIterableLike
-
def
label: String
label of this node.
-
def
last: Node
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
lastIndexOf[B >: Node](elem: B, end: Int): Int
- Definition Classes
- GenSeqLike
-
def
lastIndexOf[B >: Node](elem: B): Int
- Definition Classes
- GenSeqLike
-
def
lastIndexOfSlice[B >: Node](that: GenSeq[B], end: Int): Int
- Definition Classes
- SeqLike
-
def
lastIndexOfSlice[B >: Node](that: GenSeq[B]): Int
- Definition Classes
- SeqLike
-
def
lastIndexWhere(p: (Node) ⇒ Boolean, end: Int): Int
- Definition Classes
- SeqLike → GenSeqLike
-
def
lastIndexWhere(p: (Node) ⇒ Boolean): Int
- Definition Classes
- GenSeqLike
-
def
lastOption: Option[Node]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
length: Int
- Definition Classes
- NodeSeq → SeqLike → GenSeqLike
-
def
lengthCompare(len: Int): Int
- Definition Classes
- SeqLike
-
def
lift: (Int) ⇒ Option[Node]
- Definition Classes
- PartialFunction
-
def
map[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
max[B >: Node](implicit cmp: Ordering[B]): Node
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
min[B >: Node](implicit cmp: Ordering[B]): Node
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
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
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
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
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
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
orElse[A1 <: Int, B1 >: Node](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
- Definition Classes
- PartialFunction
-
def
padTo[B >: Node, That](len: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
par: ParSeq[Node]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[Node, ParSeq[Node]]
- Attributes
- protected[this]
- Definition Classes
- Seq → SeqLike → Iterable → TraversableLike → Parallelizable
-
def
partition(p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq)
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
patch[B >: Node, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
permutations: collection.Iterator[NodeSeq]
- Definition Classes
- SeqLike
-
def
prefix: String
prefix of this node
prefix of this node
- Definition Classes
- Node
-
def
prefixLength(p: (Node) ⇒ Boolean): Int
- Definition Classes
- GenSeqLike
-
def
product[B >: Node](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: Node](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: Node](op: (B, Node) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: Node](op: (B, Node) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: Node](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: Node](op: (Node, B) ⇒ B): B
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: Node](op: (Node, B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
repr: NodeSeq
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
reverse: NodeSeq
- Definition Classes
- SeqLike → GenSeqLike
-
def
reverseIterator: collection.Iterator[Node]
- Definition Classes
- SeqLike
-
def
reverseMap[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
reversed: List[Node]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
runWith[U](action: (Node) ⇒ U): (Int) ⇒ Boolean
- Definition Classes
- PartialFunction
-
def
sameElements[B >: Node](that: GenIterable[B]): Boolean
- Definition Classes
- IterableLike → GenIterableLike
-
def
scan[B >: Node, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[NodeSeq, B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
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.
-
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
segmentLength(p: (Node) ⇒ Boolean, from: Int): Int
- Definition Classes
- SeqLike → GenSeqLike
-
def
seq: collection.immutable.Seq[Node]
- Definition Classes
- Seq → Seq → GenSeq → GenSeqLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
def
size: Int
- Definition Classes
- SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, until: Int): NodeSeq
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
sliding(size: Int, step: Int): collection.Iterator[NodeSeq]
- Definition Classes
- IterableLike
-
def
sliding(size: Int): collection.Iterator[NodeSeq]
- Definition Classes
- IterableLike
-
def
sortBy[B](f: (Node) ⇒ B)(implicit ord: math.Ordering[B]): NodeSeq
- Definition Classes
- SeqLike
-
def
sortWith(lt: (Node, Node) ⇒ Boolean): NodeSeq
- Definition Classes
- SeqLike
-
def
sorted[B >: Node](implicit ord: math.Ordering[B]): NodeSeq
- Definition Classes
- SeqLike
-
def
span(p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq)
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (NodeSeq, NodeSeq)
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
startsWith[B](that: GenSeq[B], offset: Int): Boolean
- Definition Classes
- SeqLike → GenSeqLike
-
def
startsWith[B](that: GenSeq[B]): Boolean
- Definition Classes
- GenSeqLike
-
def
strict_!=(other: Equality): Boolean
- Definition Classes
- Equality
- def strict_==(other: Equality): Boolean
-
def
stringPrefix: String
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
sum[B >: Node](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tail: NodeSeq
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
tails: collection.Iterator[NodeSeq]
- Definition Classes
- TraversableLike
-
def
take(n: Int): NodeSeq
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
def
takeRight(n: Int): NodeSeq
- Definition Classes
- IterableLike
-
def
takeWhile(p: (Node) ⇒ Boolean): NodeSeq
- Definition Classes
- IterableLike → TraversableLike → GenTraversableLike
-
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: Seq[Node]
returns a sequence consisting of only this node
-
def
thisCollection: collection.Seq[Node]
- Attributes
- protected[this]
- Definition Classes
- SeqLike → IterableLike → TraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Node, Col[Node]]): Col[Node]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: Node](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[B >: Node]: Buffer[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: NodeSeq): collection.Seq[Node]
- Attributes
- protected[this]
- Definition Classes
- SeqLike → IterableLike → TraversableLike
-
def
toIndexedSeq: collection.immutable.IndexedSeq[Node]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: collection.Iterable[Node]
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
toIterator: collection.Iterator[Node]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toList: List[Node]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[Node, (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSeq: collection.immutable.Seq[Node]
- Definition Classes
- Seq → SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
-
def
toSet[B >: Node]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: collection.immutable.Stream[Node]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
-
def
toString(): String
Same as
toString(false)
. -
def
toTraversable: collection.Traversable[Node]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[Node]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
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 anIllegalArgumentException
if collections are not uniformly sized.
-
def
union[B >: Node, That](that: GenSeq[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
unzip[A1, A2](implicit asPair: (Node) ⇒ (A1, A2)): (collection.immutable.Seq[A1], collection.immutable.Seq[A2])
- Definition Classes
- GenericTraversableTemplate
-
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
-
def
updated[B >: Node, That](index: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
view(from: Int, until: Int): SeqView[Node, NodeSeq]
- Definition Classes
- SeqLike → IterableLike → TraversableLike
-
def
view: SeqView[Node, NodeSeq]
- Definition Classes
- SeqLike → IterableLike → TraversableLike
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
withFilter(p: (Node) ⇒ Boolean): FilterMonadic[Node, NodeSeq]
- Definition Classes
- TraversableLike → FilterMonadic
-
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[A1 >: Node, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
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
-
def
zipWithIndex[A1 >: Node, That](implicit bf: CanBuildFrom[NodeSeq, (A1, Int), That]): That
- Definition Classes
- IterableLike → GenIterableLike