scala-xml
API
Generated with
scala-xml/scala.xml/Node

Node

scala.xml.Node
See theNode companion object
abstract class Node extends NodeSeq

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

Attributes

Companion
object
Graph
Supertypes
class NodeSeq
trait Serializable
trait Equality
trait Seq[Node]
trait SeqOps[Node, Seq, NodeSeq]
trait Iterable[Node]
class AbstractSeq[Node]
trait Seq[Node]
trait Equals
trait SeqOps[Node, Seq, NodeSeq]
trait Int => Node
trait Iterable[Node]
class Object
trait Matchable
class Any
Show all
Known subtypes
class Elem
class Group
class SpecialNode
class Atom[A]
class PCData
class Text
class Unparsed
class Comment
class EntityRef
class ProcInstr
Show all

Members list

Value members

Abstract methods

def child: Seq[Node]

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

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

Attributes

Returns

all children of this node

def label: String

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

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

Attributes

Concrete methods

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

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

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

Value parameters

key

of queried attribute.

Attributes

Returns

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

final def attribute(uri: String, key: String): Option[Seq[Node]]

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

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

Value parameters

key

of queried attribute.

uri

namespace of queried attribute (may not be null).

Attributes

Returns

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

def attributes: MetaData

Returns attribute meaning all attributes of this node, prefixed and unprefixed, in no particular order. In class Node, this defaults to Null (the empty attribute list).

Returns attribute meaning all attributes of this node, prefixed and unprefixed, in no particular order. In class Node, this defaults to Null (the empty attribute list).

Attributes

Returns

all attributes of this node

def buildString(stripComments: Boolean): String

String representation of this node

String representation of this node

Value parameters

stripComments

if true, strips comment nodes from result

Attributes

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

Attributes

Definition Classes
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.

Attributes

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.

Attributes

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.

Attributes

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

Value parameters

pre

the prefix whose namespace name we would like to obtain

Attributes

Returns

the namespace if scope != null and prefix was found, else null

def isAtom: Boolean

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

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

Attributes

def nameToString(sb: StringBuilder): StringBuilder

Appends qualified name of this node to StringBuilder.

Appends qualified name of this node to StringBuilder.

Attributes

def namespace: String

convenience, same as getNamespace(this.prefix)

convenience, same as getNamespace(this.prefix)

Attributes

def nonEmptyChildren: Seq[Node]

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

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

Attributes

def prefix: String

prefix of this node

prefix of this node

Attributes

def scope: NamespaceBinding

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

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

Attributes

override def strict_==(other: Equality): Boolean

Attributes

Definition Classes
override def text: String

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:

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 {
^

Attributes

Definition Classes
override def theSeq: Seq[Node]

returns a sequence consisting of only this node

returns a sequence consisting of only this node

Attributes

Definition Classes
override def toString: String

Same as toString('''false''').

Same as toString('''false''').

Attributes

Definition Classes
NodeSeq -> Seq -> Function1 -> Iterable -> Any
def xmlType: TypeSymbol

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

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

Attributes

Inherited methods

final def ++(suffix: Seq[Node]): NodeSeq

Attributes

Inherited from:
ScalaVersionSpecificNodeSeq (hidden)
final def ++[B >: Node](suffix: IterableOnce[B]): Seq[B]

Attributes

Inherited from:
IterableOps
final override def ++:[B >: Node](prefix: IterableOnce[B]): Seq[B]

Attributes

Definition Classes
Inherited from:
SeqOps
final def +:[B >: Node](elem: B): Seq[B]

Attributes

Inherited from:
SeqOps
final def :+[B >: Node](elem: B): Seq[B]

Attributes

Inherited from:
SeqOps
final def :++[B >: Node](suffix: IterableOnce[B]): Seq[B]

Attributes

Inherited from:
SeqOps
def \(that: String): NodeSeq

Projection function, which returns elements of this sequence based on the string that. Use:

Projection function, which returns elements of this sequence based on the string that. Use:

  • this \ "foo" to get a list of all children that are labelled with "foo";
  • this \ "_" to get a list of all child elements (wildcard);
  • this \ "@foo" to get the unprefixed attribute "foo" of this;
  • this \ "@{uri}foo" to get the prefixed attribute "pre:foo" whose prefix "pre" is resolved to the namespace "uri".

For attribute projections, the resulting scala.xml.NodeSeq attribute values are wrapped in a scala.xml.Group.

There is no support for searching a prefixed attribute by its literal prefix.

The document order is preserved.

Attributes

Inherited from:
NodeSeq
def \@(attributeName: String): String

Convenience method which returns string text of the named attribute. Use:

Convenience method which returns string text of the named attribute. Use:

  • that \@ "foo" to get the string text of attribute "foo";

Attributes

Inherited from:
NodeSeq
def \\(that: String): NodeSeq

Projection function, which returns elements of this sequence and of all its subsequences, based on the string that. Use:

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", includingthis`;
  • this \\ "_" to get a list of all elements (wildcard), including this;
  • this \\ "@foo" to get all unprefixed attributes "foo";
  • this \\ "@{uri}foo" to get all prefixed attribute "pre:foo" whose prefix "pre" is resolved to the namespace "uri".

For attribute projections, the resulting scala.xml.NodeSeq attribute values are wrapped in a scala.xml.Group.

There is no support for searching a prefixed attribute by its literal prefix.

The document order is preserved.

Attributes

Inherited from:
NodeSeq
final def addString(b: StringBuilder): b.type

Attributes

Inherited from:
IterableOnceOps
final def addString(b: StringBuilder, sep: String): b.type

Attributes

Inherited from:
IterableOnceOps
def addString(b: StringBuilder, start: String, sep: String, end: String): b.type

Attributes

Inherited from:
IterableOnceOps
def andThen[C](k: PartialFunction[Node, C]): PartialFunction[Int, C]

Attributes

Inherited from:
PartialFunction
override def andThen[C](k: Node => C): PartialFunction[Int, C]

Attributes

Definition Classes
Inherited from:
PartialFunction
def appended(base: Node): NodeSeq

Attributes

Inherited from:
ScalaVersionSpecificNodeSeq (hidden)
override def appended[B >: Node](elem: B): Seq[B]

Attributes

Definition Classes
Inherited from:
StrictOptimizedSeqOps
def appendedAll(suffix: IterableOnce[Node]): NodeSeq

Attributes

Inherited from:
ScalaVersionSpecificNodeSeq (hidden)
override def appendedAll[B >: Node](suffix: IterableOnce[B]): Seq[B]

Attributes

Definition Classes
Inherited from:
StrictOptimizedSeqOps
def apply(f: Node => Boolean): NodeSeq

Attributes

Inherited from:
NodeSeq
override def apply(i: Int): Node

Attributes

Definition Classes
Inherited from:
NodeSeq
def applyOrElse[A1 <: Int, B1 >: Node](x: A1, default: A1 => B1): B1

Attributes

Inherited from:
PartialFunction
override def collect[B](pf: PartialFunction[Node, B]): Seq[B]

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
def collectFirst[B](pf: PartialFunction[Node, B]): Option[B]

Attributes

Inherited from:
IterableOnceOps
def combinations(n: Int): Iterator[NodeSeq]

Attributes

Inherited from:
SeqOps
def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, Node]

Attributes

Inherited from:
PartialFunction
def compose[A](g: A => Int): A => Node

Attributes

Inherited from:
Function1
def concat(suffix: IterableOnce[Node]): NodeSeq

Attributes

Inherited from:
ScalaVersionSpecificNodeSeq (hidden)
final override def concat[B >: Node](suffix: IterableOnce[B]): Seq[B]

Attributes

Definition Classes
Inherited from:
SeqOps
def contains[A1 >: Node](elem: A1): Boolean

Attributes

Inherited from:
SeqOps
def containsSlice[B >: Node](that: Seq[B]): Boolean

Attributes

Inherited from:
SeqOps
def copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Int

Attributes

Inherited from:
IterableOnceOps
def copyToArray[B >: Node](xs: Array[B], start: Int): Int

Attributes

Inherited from:
IterableOnceOps
def copyToArray[B >: Node](xs: Array[B]): Int

Attributes

Inherited from:
IterableOnceOps
def corresponds[B](that: IterableOnce[B])(p: (Node, B) => Boolean): Boolean

Attributes

Inherited from:
IterableOnceOps
def corresponds[B](that: Seq[B])(p: (Node, B) => Boolean): Boolean

Attributes

Inherited from:
SeqOps
def count(p: Node => Boolean): Int

Attributes

Inherited from:
IterableOnceOps
override def diff[B >: Node](that: Seq[B]): NodeSeq

Attributes

Definition Classes
Inherited from:
StrictOptimizedSeqOps
def distinct: NodeSeq

Attributes

Inherited from:
SeqOps
override def distinctBy[B](f: Node => B): NodeSeq

Attributes

Definition Classes
Inherited from:
StrictOptimizedSeqOps
def drop(n: Int): NodeSeq

Attributes

Inherited from:
IterableOps
override def dropRight(n: Int): NodeSeq

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
def dropWhile(p: Node => Boolean): NodeSeq

Attributes

Inherited from:
IterableOps
def elementWise: ElementWiseExtractor[Int, Node]

Attributes

Inherited from:
PartialFunction
override def empty: NodeSeq

Attributes

Definition Classes
ScalaVersionSpecificNodeSeq -> IterableOps
Inherited from:
ScalaVersionSpecificNodeSeq (hidden)
def endsWith[B >: Node](that: Iterable[B]): Boolean

Attributes

Inherited from:
SeqOps
override def equals(other: Any): Boolean

Compares the receiver object (this) with the argument object (that) for equivalence.

Compares the receiver object (this) with the argument object (that) for equivalence.

Any implementation of this method should be an equivalence relation:

  • It is reflexive: for any instance x of type Any, x.equals(x) should return true.
  • It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true.
  • It is transitive: for any instances x, y, and z of type Any if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is usually necessary to override hashCode to ensure that objects which are "equal" (o1.equals(o2) returns true) hash to the same scala.Int. (o1.hashCode.equals(o2.hashCode)).

Value parameters

that

the object to compare against this object for equality.

Attributes

Returns

true if the receiver object is equivalent to the argument; false otherwise.

Definition Classes
Equality -> Equals -> Any
Inherited from:
Equality
def exists(p: Node => Boolean): Boolean

Attributes

Inherited from:
IterableOnceOps
override def filter(pred: Node => Boolean): NodeSeq

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
override def filterNot(pred: Node => Boolean): NodeSeq

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
def find(p: Node => Boolean): Option[Node]

Attributes

Inherited from:
IterableOnceOps
def findLast(p: Node => Boolean): Option[Node]

Attributes

Inherited from:
SeqOps
def flatMap(f: Node => IterableOnce[Node]): NodeSeq

Attributes

Inherited from:
ScalaVersionSpecificNodeSeq (hidden)
override def flatMap[B](f: Node => IterableOnce[B]): Seq[B]

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
override def flatten[B](implicit toIterableOnce: Node => IterableOnce[B]): Seq[B]

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
def fold[A1 >: Node](z: A1)(op: (A1, A1) => A1): A1

Attributes

Inherited from:
IterableOnceOps
def foldLeft[B](z: B)(op: (B, Node) => B): B

Attributes

Inherited from:
IterableOnceOps
def foldRight[B](z: B)(op: (Node, B) => B): B

Attributes

Inherited from:
IterableOnceOps
def forall(p: Node => Boolean): Boolean

Attributes

Inherited from:
IterableOnceOps
def foreach[U](f: Node => U): Unit

Attributes

Inherited from:
IterableOnceOps
override def fromSpecific(coll: IterableOnce[Node]): NodeSeq

Attributes

Definition Classes
ScalaVersionSpecificNodeSeq -> IterableOps
Inherited from:
ScalaVersionSpecificNodeSeq (hidden)
def groupBy[K](f: Node => K): Map[K, NodeSeq]

Attributes

Inherited from:
IterableOps
def groupMap[K, B](key: Node => K)(f: Node => B): Map[K, Seq[B]]

Attributes

Inherited from:
IterableOps
def groupMapReduce[K, B](key: Node => K)(f: Node => B)(reduce: (B, B) => B): Map[K, B]

Attributes

Inherited from:
IterableOps
def grouped(size: Int): Iterator[NodeSeq]

Attributes

Inherited from:
IterableOps
override 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. However WE at least can pretend they are final since clearly individual classes cannot be trusted to maintain a semblance of order.

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.

Attributes

Definition Classes
Equality -> Any
Inherited from:
Equality
def head: Node

Attributes

Inherited from:
IterableOps
def headOption: Option[Node]

Attributes

Inherited from:
IterableOps
def indexOf[B >: Node](elem: B): Int

Attributes

Inherited from:
SeqOps
def indexOf[B >: Node](elem: B, from: Int): Int

Attributes

Inherited from:
SeqOps
def indexOfSlice[B >: Node](that: Seq[B]): Int

Attributes

Inherited from:
SeqOps
def indexOfSlice[B >: Node](that: Seq[B], from: Int): Int

Attributes

Inherited from:
SeqOps
def indexWhere(p: Node => Boolean): Int

Attributes

Inherited from:
SeqOps
def indexWhere(p: Node => Boolean, from: Int): Int

Attributes

Inherited from:
SeqOps
def indices: Range

Attributes

Inherited from:
SeqOps
def init: NodeSeq

Attributes

Inherited from:
IterableOps
def inits: Iterator[NodeSeq]

Attributes

Inherited from:
IterableOps
override def intersect[B >: Node](that: Seq[B]): NodeSeq

Attributes

Definition Classes
Inherited from:
StrictOptimizedSeqOps
def isDefinedAt(idx: Int): Boolean

Attributes

Inherited from:
SeqOps
override def isEmpty: Boolean

Attributes

Definition Classes
Inherited from:
SeqOps
override def isTraversableAgain: Boolean

Attributes

Definition Classes
Inherited from:
IterableOps
override def iterableFactory: SeqFactory[Seq]

Attributes

Definition Classes
Inherited from:
Seq
override def iterator: Iterator[Node]

Attributes

Definition Classes
Inherited from:
NodeSeq
def knownSize: Int

Attributes

Inherited from:
IterableOnce
def last: Node

Attributes

Inherited from:
IterableOps
def lastIndexOf[B >: Node](elem: B, end: Int): Int

Attributes

Inherited from:
SeqOps
def lastIndexOfSlice[B >: Node](that: Seq[B]): Int

Attributes

Inherited from:
SeqOps
def lastIndexOfSlice[B >: Node](that: Seq[B], end: Int): Int

Attributes

Inherited from:
SeqOps
def lastIndexWhere(p: Node => Boolean): Int

Attributes

Inherited from:
SeqOps
def lastIndexWhere(p: Node => Boolean, end: Int): Int

Attributes

Inherited from:
SeqOps
def lastOption: Option[Node]

Attributes

Inherited from:
IterableOps
def lazyZip[B](that: Iterable[B]): LazyZip2[Node, B, Iterable.this.type]

Attributes

Inherited from:
Iterable
override def length: Int

Attributes

Definition Classes
Inherited from:
NodeSeq
def lengthCompare(that: Iterable[_]): Int

Attributes

Inherited from:
SeqOps
def lengthCompare(len: Int): Int

Attributes

Inherited from:
SeqOps
final def lengthIs: SizeCompareOps

Attributes

Inherited from:
SeqOps
def lift: Int => Option[Node]

Attributes

Inherited from:
PartialFunction
def map(f: Node => Node): NodeSeq

Attributes

Inherited from:
ScalaVersionSpecificNodeSeq (hidden)
override def map[B](f: Node => B): Seq[B]

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
def max[B >: Node](implicit ord: Ordering[B]): Node

Attributes

Inherited from:
IterableOnceOps
def maxBy[B](f: Node => B)(implicit ord: Ordering[B]): Node

Attributes

Inherited from:
IterableOnceOps
def maxByOption[B](f: Node => B)(implicit ord: Ordering[B]): Option[Node]

Attributes

Inherited from:
IterableOnceOps
def maxOption[B >: Node](implicit ord: Ordering[B]): Option[Node]

Attributes

Inherited from:
IterableOnceOps
def min[B >: Node](implicit ord: Ordering[B]): Node

Attributes

Inherited from:
IterableOnceOps
def minBy[B](f: Node => B)(implicit ord: Ordering[B]): Node

Attributes

Inherited from:
IterableOnceOps
def minByOption[B](f: Node => B)(implicit ord: Ordering[B]): Option[Node]

Attributes

Inherited from:
IterableOnceOps
def minOption[B >: Node](implicit ord: Ordering[B]): Option[Node]

Attributes

Inherited from:
IterableOnceOps
final def mkString: String

Attributes

Inherited from:
IterableOnceOps
final def mkString(sep: String): String

Attributes

Inherited from:
IterableOnceOps
final def mkString(start: String, sep: String, end: String): String

Attributes

Inherited from:
IterableOnceOps
override def newSpecificBuilder: Builder[Node, NodeSeq]

Attributes

Definition Classes
ScalaVersionSpecificNodeSeq -> IterableOps
Inherited from:
ScalaVersionSpecificNodeSeq (hidden)
def nonEmpty: Boolean

Attributes

Inherited from:
IterableOnceOps
def orElse[A1 <: Int, B1 >: Node](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

Attributes

Inherited from:
PartialFunction
override def padTo[B >: Node](len: Int, elem: B): Seq[B]

Attributes

Definition Classes
Inherited from:
StrictOptimizedSeqOps
override def partition(p: Node => Boolean): (NodeSeq, NodeSeq)

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
override def partitionMap[A1, A2](f: Node => Either[A1, A2]): (Seq[A1], Seq[A2])

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
override def patch[B >: Node](from: Int, other: IterableOnce[B], replaced: Int): Seq[B]

Attributes

Definition Classes
Inherited from:
StrictOptimizedSeqOps
def permutations: Iterator[NodeSeq]

Attributes

Inherited from:
SeqOps
def prepended(base: Node): NodeSeq

Attributes

Inherited from:
ScalaVersionSpecificNodeSeq (hidden)
override def prepended[B >: Node](elem: B): Seq[B]

Attributes

Definition Classes
Inherited from:
StrictOptimizedSeqOps
def prependedAll(prefix: IterableOnce[Node]): NodeSeq

Attributes

Inherited from:
ScalaVersionSpecificNodeSeq (hidden)
override def prependedAll[B >: Node](prefix: IterableOnce[B]): Seq[B]

Attributes

Definition Classes
Inherited from:
StrictOptimizedSeqOps
def product[B >: Node](implicit num: Numeric[B]): B

Attributes

Inherited from:
IterableOnceOps
def reduce[B >: Node](op: (B, B) => B): B

Attributes

Inherited from:
IterableOnceOps
def reduceLeft[B >: Node](op: (B, Node) => B): B

Attributes

Inherited from:
IterableOnceOps
def reduceLeftOption[B >: Node](op: (B, Node) => B): Option[B]

Attributes

Inherited from:
IterableOnceOps
def reduceOption[B >: Node](op: (B, B) => B): Option[B]

Attributes

Inherited from:
IterableOnceOps
def reduceRight[B >: Node](op: (Node, B) => B): B

Attributes

Inherited from:
IterableOnceOps
def reduceRightOption[B >: Node](op: (Node, B) => B): Option[B]

Attributes

Inherited from:
IterableOnceOps
def reverse: NodeSeq

Attributes

Inherited from:
SeqOps
def reverseIterator: Iterator[Node]

Attributes

Inherited from:
SeqOps
protected def reversed: Iterable[Node]

Attributes

Inherited from:
IterableOnceOps
def runWith[U](action: Node => U): Int => Boolean

Attributes

Inherited from:
PartialFunction
def sameElements[B >: Node](that: IterableOnce[B]): Boolean

Attributes

Inherited from:
SeqOps
def scala$collection$SeqOps$$super$concat[B >: Node](suffix: IterableOnce[B]): Seq[B]

Attributes

Inherited from:
SeqOps
def scala$collection$SeqOps$$super$sizeCompare(that: Iterable[_]): Int

Attributes

Inherited from:
SeqOps
def scan[B >: Node](z: B)(op: (B, B) => B): Seq[B]

Attributes

Inherited from:
IterableOps
override def scanLeft[B](z: B)(op: (B, Node) => B): Seq[B]

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
def scanRight[B](z: B)(op: (Node, B) => B): Seq[B]

Attributes

Inherited from:
IterableOps
def search[B >: Node](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult

Attributes

Inherited from:
SeqOps
def search[B >: Node](elem: B)(implicit ord: Ordering[B]): SearchResult

Attributes

Inherited from:
SeqOps
def segmentLength(p: Node => Boolean, from: Int): Int

Attributes

Inherited from:
SeqOps
final def segmentLength(p: Node => Boolean): Int

Attributes

Inherited from:
SeqOps
final override def size: Int

Attributes

Definition Classes
Inherited from:
SeqOps
final override def sizeCompare(that: Iterable[_]): Int

Attributes

Definition Classes
Inherited from:
SeqOps
final override def sizeCompare(otherSize: Int): Int

Attributes

Definition Classes
Inherited from:
SeqOps
final def sizeIs: SizeCompareOps

Attributes

Inherited from:
IterableOps
def slice(from: Int, until: Int): NodeSeq

Attributes

Inherited from:
IterableOps
def sliding(size: Int, step: Int): Iterator[NodeSeq]

Attributes

Inherited from:
IterableOps
def sliding(size: Int): Iterator[NodeSeq]

Attributes

Inherited from:
IterableOps
def sortBy[B](f: Node => B)(implicit ord: Ordering[B]): NodeSeq

Attributes

Inherited from:
SeqOps
def sortWith(lt: (Node, Node) => Boolean): NodeSeq

Attributes

Inherited from:
SeqOps
override def sorted[B >: Node](implicit ord: Ordering[B]): NodeSeq

Attributes

Definition Classes
Inherited from:
StrictOptimizedSeqOps
override def span(p: Node => Boolean): (NodeSeq, NodeSeq)

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
override def splitAt(n: Int): (NodeSeq, NodeSeq)

Attributes

Definition Classes
Inherited from:
IterableOps
def startsWith[B >: Node](that: IterableOnce[B], offset: Int): Boolean

Attributes

Inherited from:
SeqOps
def stepper[S <: Stepper[_]](implicit shape: StepperShape[Node, S]): S

Attributes

Inherited from:
IterableOnce
def strict_!=(other: Equality): Boolean

Attributes

Inherited from:
Equality
def sum[B >: Node](implicit num: Numeric[B]): B

Attributes

Inherited from:
IterableOnceOps
def tail: NodeSeq

Attributes

Inherited from:
IterableOps
def tails: Iterator[NodeSeq]

Attributes

Inherited from:
IterableOps
def take(n: Int): NodeSeq

Attributes

Inherited from:
IterableOps
override def takeRight(n: Int): NodeSeq

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
def takeWhile(p: Node => Boolean): NodeSeq

Attributes

Inherited from:
IterableOps
override def tapEach[U](f: Node => U): NodeSeq

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
def to[C1](factory: Factory[Node, C1]): C1

Attributes

Inherited from:
IterableOnceOps
def toArray[B >: Node : ClassTag]: Array[B]

Attributes

Inherited from:
IterableOnceOps
final def toBuffer[B >: Node]: Buffer[B]

Attributes

Inherited from:
IterableOnceOps
def toIndexedSeq: IndexedSeq[Node]

Attributes

Inherited from:
IterableOnceOps
def toList: List[Node]

Attributes

Inherited from:
IterableOnceOps
def toMap[K, V](implicit ev: Node <:< (K, V)): Map[K, V]

Attributes

Inherited from:
IterableOnceOps
final override def toSeq: Seq.this.type

Attributes

Definition Classes
Inherited from:
Seq
def toSet[B >: Node]: Set[B]

Attributes

Inherited from:
IterableOnceOps
def toVector: Vector[Node]

Attributes

Inherited from:
IterableOnceOps
def transpose[B](implicit asIterable: Node => Iterable[B]): Seq[Seq[B]]

Attributes

Inherited from:
IterableOps
def unapply(a: Int): Option[Node]

Attributes

Inherited from:
PartialFunction
override def unzip[A1, A2](implicit asPair: Node => (A1, A2)): (Seq[A1], Seq[A2])

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
override def unzip3[A1, A2, A3](implicit asTriple: Node => (A1, A2, A3)): (Seq[A1], Seq[A2], Seq[A3])

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
override def updated[B >: Node](index: Int, elem: B): Seq[B]

Attributes

Definition Classes
Inherited from:
StrictOptimizedSeqOps
override def view: SeqView[Node]

Attributes

Definition Classes
Inherited from:
SeqOps
def withFilter(p: Node => Boolean): WithFilter[Node, Seq]

Attributes

Inherited from:
IterableOps
final def xml_!=(other: Any): Boolean

Attributes

Inherited from:
Equality
final def xml_==(other: Any): Boolean

Attributes

Inherited from:
Equality
def xml_sameElements[A](that: Iterable[A]): Boolean

Attributes

Inherited from:
NodeSeq
override def zip[B](that: IterableOnce[B]): Seq[(Node, B)]

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps
def zipAll[A1 >: Node, B](that: Iterable[B], thisElem: A1, thatElem: B): Seq[(A1, B)]

Attributes

Inherited from:
IterableOps
override def zipWithIndex: Seq[(Node, Int)]

Attributes

Definition Classes
Inherited from:
StrictOptimizedIterableOps

Deprecated and Inherited methods

final def /:[B](z: B)(op: (B, Node) => B): B

Attributes

Deprecated
[Since version 2.13.0] Use foldLeft instead of /:
Inherited from:
IterableOnceOps
final def :\[B](z: B)(op: (Node, B) => B): B

Attributes

Deprecated
[Since version 2.13.0] Use foldRight instead of :\\
Inherited from:
IterableOnceOps
def aggregate[B](z: => B)(seqop: (B, Node) => B, combop: (B, B) => B): B

Attributes

Deprecated
[Since version 2.13.0] `aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.
Inherited from:
IterableOnceOps
def companion: IterableFactory[Seq]

Attributes

Deprecated
[Since version 2.13.0] Use iterableFactory instead
Inherited from:
IterableOps
final def copyToBuffer[B >: Node](dest: Buffer[B]): Unit

Attributes

Deprecated
[Since version 2.13.0] Use `dest ++= coll` instead
Inherited from:
IterableOnceOps
def hasDefiniteSize: Boolean

Attributes

Deprecated
[Since version 2.13.0] Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
Inherited from:
IterableOnceOps
final def prefixLength(p: Node => Boolean): Int

Attributes

Deprecated
[Since version 2.13.0] Use segmentLength instead of prefixLength
Inherited from:
SeqOps
final def repr: NodeSeq

Attributes

Deprecated
[Since version 2.13.0] Use coll instead of repr in a collection implementation, use the collection value itself from the outside
Inherited from:
IterableOps
def reverseMap[B](f: Node => B): Seq[B]

Attributes

Deprecated
[Since version 2.13.0] Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)
Inherited from:
SeqOps
def seq: Iterable.this.type

Attributes

Deprecated
[Since version 2.13.0] Iterable.seq always returns the iterable itself
Inherited from:
Iterable
final def toIterable: Iterable.this.type

Attributes

Deprecated
[Since version 2.13.7] toIterable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections
Inherited from:
Iterable
final def toIterator: Iterator[Node]

Attributes

Deprecated
[Since version 2.13.0] Use .iterator instead of .toIterator
Inherited from:
IterableOnceOps
final def toStream: Stream[Node]

Attributes

Deprecated
[Since version 2.13.0] Use .to(LazyList) instead of .toStream
Inherited from:
IterableOnceOps
final def toTraversable: Iterable[Node]

Attributes

Deprecated
[Since version 2.13.0] toTraversable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections
Inherited from:
IterableOps
final def union[B >: Node](that: Seq[B]): Seq[B]

Attributes

Deprecated
[Since version 2.13.0] Use `concat` instead
Inherited from:
SeqOps
def view(from: Int, until: Int): View[Node]

Attributes

Deprecated
[Since version 2.13.0] Use .view.slice(from, until) instead of .view(from, until)
Inherited from:
IterableOps
Generated with