scala-xml/scala.xml/NodeSeq

NodeSeq

abstract class NodeSeq extends AbstractSeq[Node] with Seq[Node] with ScalaVersionSpecificNodeSeq with Equality with Serializable

This class implements a wrapper around Seq[Node] that adds XPath and comprehension methods.

Companion
object
trait Serializable
trait Equality
trait ScalaVersionSpecificNodeSeq
trait StrictOptimizedSeqOps[Node, Seq, NodeSeq]
trait StrictOptimizedSeqOps[Node, Seq, NodeSeq]
trait StrictOptimizedIterableOps[Node, Seq, NodeSeq]
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 PartialFunction[Int, Node]
trait Int => Node
class AbstractIterable[Node]
trait Iterable[Node]
trait IterableFactoryDefaults[Node, [A] =>> Seq[A]]
trait IterableOps[Node, Seq, NodeSeq]
trait IterableOnceOps[Node, Seq, NodeSeq]
trait IterableOnce[Node]
class Object
trait Matchable
class Any
class Document
class Node
class Elem
class Group
class Atom[A]
class PCData
class Text
class Unparsed
class Comment
class EntityRef
class ProcInstr

Value members

Abstract methods

def theSeq: Seq[Node]

Concrete methods

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.

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

def apply(i: Int): Node
def apply(f: Node => Boolean): NodeSeq
override def canEqual(other: Any): Boolean
Definition Classes
Equality -> Seq -> Equals
override def iterator: Iterator[Node]
Definition Classes
IterableOnce
def length: Int
override def strict_==(other: Equality): Boolean
Definition Classes
def text: String
override def toString(): String
Definition Classes
Seq -> Function1 -> Iterable -> Any
def xml_sameElements[A](that: Iterable[A]): Boolean

Inherited methods

@inline
final def ++(suffix: Seq[Node]): NodeSeq
Inherited from
ScalaVersionSpecificNodeSeq
@inline
final def ++[B >: Node](suffix: IterableOnce[B]): Seq[B]
Inherited from
IterableOps
@inline
final override def ++:[B >: Node](prefix: IterableOnce[B]): Seq[B]
Definition Classes
SeqOps -> IterableOps
Inherited from
SeqOps
@inline
final def +:[B >: Node](elem: B): Seq[B]
Inherited from
SeqOps
@inline
final def :+[B >: Node](elem: B): Seq[B]
Inherited from
SeqOps
@inline
final def :++[B >: Node](suffix: IterableOnce[B]): Seq[B]
Inherited from
SeqOps
@inline
final def addString(b: StringBuilder): StringBuilder
Inherited from
IterableOnceOps
@inline
final def addString(b: StringBuilder, sep: String): StringBuilder
Inherited from
IterableOnceOps
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
Inherited from
IterableOnceOps
def andThen[C](k: PartialFunction[Node, C]): PartialFunction[Int, C]
Inherited from
PartialFunction
override def andThen[C](k: Node => C): PartialFunction[Int, C]
Definition Classes
PartialFunction -> Function1
Inherited from
PartialFunction
def appended(base: Node): NodeSeq
Inherited from
ScalaVersionSpecificNodeSeq
override def appended[B >: Node](elem: B): Seq[B]
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from
StrictOptimizedSeqOps
def appendedAll(suffix: IterableOnce[Node]): NodeSeq
Inherited from
ScalaVersionSpecificNodeSeq
override def appendedAll[B >: Node](suffix: IterableOnce[B]): Seq[B]
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from
StrictOptimizedSeqOps
def applyOrElse[A1 <: Int, B1 >: Node](x: A1, default: A1 => B1): B1
Inherited from
PartialFunction
override def collect[B](pf: PartialFunction[Node, B]): Seq[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def collectFirst[B](pf: PartialFunction[Node, B]): Option[B]
Inherited from
IterableOnceOps
def combinations(n: Int): Iterator[NodeSeq]
Inherited from
SeqOps
def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, Node]
Inherited from
PartialFunction
@unspecialized
def compose[A](g: A => Int): A => Node
Inherited from
Function1
def concat(suffix: IterableOnce[Node]): NodeSeq
Inherited from
ScalaVersionSpecificNodeSeq
@inline
final override def concat[B >: Node](suffix: IterableOnce[B]): Seq[B]
Definition Classes
SeqOps -> IterableOps
Inherited from
SeqOps
def contains[A1 >: Node](elem: A1): Boolean
Inherited from
SeqOps
def containsSlice[B >: Node](that: Seq[B]): Boolean
Inherited from
SeqOps
def copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Int
Inherited from
IterableOnceOps
@deprecatedOverriding(message = "This should always forward to the 3-arg version of this method", since = "2.13.4")
def copyToArray[B >: Node](xs: Array[B], start: Int): Int
Inherited from
IterableOnceOps
@deprecatedOverriding(message = "This should always forward to the 3-arg version of this method", since = "2.13.4")
def copyToArray[B >: Node](xs: Array[B]): Int
Inherited from
IterableOnceOps
def corresponds[B](that: IterableOnce[B])(p: (Node, B) => Boolean): Boolean
Inherited from
IterableOnceOps
def corresponds[B](that: Seq[B])(p: (Node, B) => Boolean): Boolean
Inherited from
SeqOps
def count(p: Node => Boolean): Int
Inherited from
IterableOnceOps
override def diff[B >: Node](that: Seq[B]): NodeSeq
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from
StrictOptimizedSeqOps
def distinct: NodeSeq
Inherited from
SeqOps
override def distinctBy[B](f: Node => B): NodeSeq
Definition Classes
StrictOptimizedSeqOps -> StrictOptimizedSeqOps -> SeqOps
Inherited from
StrictOptimizedSeqOps
def drop(n: Int): NodeSeq
Inherited from
IterableOps
override def dropRight(n: Int): NodeSeq
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def dropWhile(p: Node => Boolean): NodeSeq
Inherited from
IterableOps
def elementWise: ElementWiseExtractor[Int, Node]
Inherited from
PartialFunction
override def empty: NodeSeq
Definition Classes
ScalaVersionSpecificNodeSeq -> IterableOps
Inherited from
ScalaVersionSpecificNodeSeq
def endsWith[B >: Node](that: Iterable[B]): Boolean
Inherited from
SeqOps
override def equals(other: Any): Boolean
Definition Classes
Equality -> Equals -> Any
Inherited from
Equality
def exists(p: Node => Boolean): Boolean
Inherited from
IterableOnceOps
override def filter(pred: Node => Boolean): NodeSeq
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
override def filterNot(pred: Node => Boolean): NodeSeq
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def find(p: Node => Boolean): Option[Node]
Inherited from
IterableOnceOps
def findLast(p: Node => Boolean): Option[Node]
Inherited from
SeqOps
def flatMap(f: Node => IterableOnce[Node]): NodeSeq
Inherited from
ScalaVersionSpecificNodeSeq
override def flatMap[B](f: Node => IterableOnce[B]): Seq[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
override def flatten[B](implicit toIterableOnce: Node => IterableOnce[B]): Seq[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def fold[A1 >: Node](z: A1)(op: (A1, A1) => A1): A1
Inherited from
IterableOnceOps
def foldLeft[B](z: B)(op: (B, Node) => B): B
Inherited from
IterableOnceOps
def foldRight[B](z: B)(op: (Node, B) => B): B
Inherited from
IterableOnceOps
def forall(p: Node => Boolean): Boolean
Inherited from
IterableOnceOps
def foreach[U](f: Node => U): Unit
Inherited from
IterableOnceOps
override def fromSpecific(coll: IterableOnce[Node]): NodeSeq
Definition Classes
ScalaVersionSpecificNodeSeq -> IterableOps
Inherited from
ScalaVersionSpecificNodeSeq
def groupBy[K](f: Node => K): Map[K, NodeSeq]
Inherited from
IterableOps
def groupMap[K, B](key: Node => K)(f: Node => B): Map[K, Seq[B]]
Inherited from
IterableOps
def groupMapReduce[K, B](key: Node => K)(f: Node => B)(reduce: (B, B) => B): Map[K, B]
Inherited from
IterableOps
def grouped(size: Int): Iterator[NodeSeq]
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.

Definition Classes
Equality -> Any
Inherited from
Equality
def head: Node
Inherited from
IterableOps
def headOption: Option[Node]
Inherited from
IterableOps
@deprecatedOverriding(message = "Override indexOf(elem, from) instead - indexOf(elem) calls indexOf(elem, 0)", since = "2.13.0")
def indexOf[B >: Node](elem: B): Int
Inherited from
SeqOps
def indexOf[B >: Node](elem: B, from: Int): Int
Inherited from
SeqOps
@deprecatedOverriding(message = "Override indexOfSlice(that, from) instead - indexOfSlice(that) calls indexOfSlice(that, 0)", since = "2.13.0")
def indexOfSlice[B >: Node](that: Seq[B]): Int
Inherited from
SeqOps
def indexOfSlice[B >: Node](that: Seq[B], from: Int): Int
Inherited from
SeqOps
@deprecatedOverriding(message = "Override indexWhere(p, from) instead - indexWhere(p) calls indexWhere(p, 0)", since = "2.13.0")
def indexWhere(p: Node => Boolean): Int
Inherited from
SeqOps
def indexWhere(p: Node => Boolean, from: Int): Int
Inherited from
SeqOps
def indices: Range
Inherited from
SeqOps
def init: NodeSeq
Inherited from
IterableOps
def inits: Iterator[NodeSeq]
Inherited from
IterableOps
override def intersect[B >: Node](that: Seq[B]): NodeSeq
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from
StrictOptimizedSeqOps
def isDefinedAt(idx: Int): Boolean
Inherited from
SeqOps
override def isEmpty: Boolean
Definition Classes
SeqOps -> IterableOnceOps
Inherited from
SeqOps
override def isTraversableAgain: Boolean
Definition Classes
IterableOps -> IterableOnceOps
Inherited from
IterableOps
override def iterableFactory: SeqFactory[[A] =>> Seq[A]]
Definition Classes
Seq -> Seq -> Iterable -> Iterable -> IterableOps
Inherited from
Seq
def knownSize: Int
Inherited from
IterableOnce
def last: Node
Inherited from
IterableOps
def lastIndexOf[B >: Node](elem: B, end: Int): Int
Inherited from
SeqOps
@deprecatedOverriding(message = "Override lastIndexOfSlice(that, end) instead - lastIndexOfSlice(that) calls lastIndexOfSlice(that, Int.MaxValue)", since = "2.13.0")
def lastIndexOfSlice[B >: Node](that: Seq[B]): Int
Inherited from
SeqOps
def lastIndexOfSlice[B >: Node](that: Seq[B], end: Int): Int
Inherited from
SeqOps
@deprecatedOverriding(message = "Override lastIndexWhere(p, end) instead - lastIndexWhere(p) calls lastIndexWhere(p, Int.MaxValue)", since = "2.13.0")
def lastIndexWhere(p: Node => Boolean): Int
Inherited from
SeqOps
def lastIndexWhere(p: Node => Boolean, end: Int): Int
Inherited from
SeqOps
def lastOption: Option[Node]
Inherited from
IterableOps
def lazyZip[B](that: Iterable[B]): LazyZip2[Node, B, NodeSeq]
Inherited from
Iterable
def lengthCompare(that: Iterable[_]): Int
Inherited from
SeqOps
def lengthCompare(len: Int): Int
Inherited from
SeqOps
@inline
final def lengthIs: SizeCompareOps
Inherited from
SeqOps
def lift: Int => Option[Node]
Inherited from
PartialFunction
def map(f: Node => Node): NodeSeq
Inherited from
ScalaVersionSpecificNodeSeq
override def map[B](f: Node => B): Seq[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def max[B >: Node](implicit ord: Ordering[B]): Node
Inherited from
IterableOnceOps
def maxBy[B](f: Node => B)(implicit cmp: Ordering[B]): Node
Inherited from
IterableOnceOps
def maxByOption[B](f: Node => B)(implicit cmp: Ordering[B]): Option[Node]
Inherited from
IterableOnceOps
def maxOption[B >: Node](implicit ord: Ordering[B]): Option[Node]
Inherited from
IterableOnceOps
def min[B >: Node](implicit ord: Ordering[B]): Node
Inherited from
IterableOnceOps
def minBy[B](f: Node => B)(implicit cmp: Ordering[B]): Node
Inherited from
IterableOnceOps
def minByOption[B](f: Node => B)(implicit cmp: Ordering[B]): Option[Node]
Inherited from
IterableOnceOps
def minOption[B >: Node](implicit ord: Ordering[B]): Option[Node]
Inherited from
IterableOnceOps
@inline
final def mkString: String
Inherited from
IterableOnceOps
@inline
final def mkString(sep: String): String
Inherited from
IterableOnceOps
final def mkString(start: String, sep: String, end: String): String
Inherited from
IterableOnceOps
override def newSpecificBuilder: Builder[Node, NodeSeq]
Definition Classes
ScalaVersionSpecificNodeSeq -> IterableOps
Inherited from
ScalaVersionSpecificNodeSeq
@deprecatedOverriding(message = "nonEmpty is defined as !isEmpty; override isEmpty instead", since = "2.13.0")
def nonEmpty: Boolean
Inherited from
IterableOnceOps
def orElse[A1 <: Int, B1 >: Node](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
Inherited from
PartialFunction
override def padTo[B >: Node](len: Int, elem: B): Seq[B]
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from
StrictOptimizedSeqOps
override def partition(p: Node => Boolean): (NodeSeq, NodeSeq)
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
override def partitionMap[A1, A2](f: Node => Either[A1, A2]): (Seq[A1], Seq[A2])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
override def patch[B >: Node](from: Int, other: IterableOnce[B], replaced: Int): Seq[B]
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from
StrictOptimizedSeqOps
def permutations: Iterator[NodeSeq]
Inherited from
SeqOps
def prepended(base: Node): NodeSeq
Inherited from
ScalaVersionSpecificNodeSeq
override def prepended[B >: Node](elem: B): Seq[B]
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from
StrictOptimizedSeqOps
def prependedAll(prefix: IterableOnce[Node]): NodeSeq
Inherited from
ScalaVersionSpecificNodeSeq
override def prependedAll[B >: Node](prefix: IterableOnce[B]): Seq[B]
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from
StrictOptimizedSeqOps
def product[B >: Node](implicit num: Numeric[B]): B
Inherited from
IterableOnceOps
def reduce[B >: Node](op: (B, B) => B): B
Inherited from
IterableOnceOps
def reduceLeft[B >: Node](op: (B, Node) => B): B
Inherited from
IterableOnceOps
def reduceLeftOption[B >: Node](op: (B, Node) => B): Option[B]
Inherited from
IterableOnceOps
def reduceOption[B >: Node](op: (B, B) => B): Option[B]
Inherited from
IterableOnceOps
def reduceRight[B >: Node](op: (Node, B) => B): B
Inherited from
IterableOnceOps
def reduceRightOption[B >: Node](op: (Node, B) => B): Option[B]
Inherited from
IterableOnceOps
def reverse: NodeSeq
Inherited from
SeqOps
def reverseIterator: Iterator[Node]
Inherited from
SeqOps
protected def reversed: Iterable[Node]
Inherited from
IterableOnceOps
def runWith[U](action: Node => U): Int => Boolean
Inherited from
PartialFunction
def sameElements[B >: Node](that: IterableOnce[B]): Boolean
Inherited from
SeqOps
def scala$collection$SeqOps$$super$concat[B >: Node](suffix: IterableOnce[B]): Seq[B]
Inherited from
SeqOps
def scala$collection$SeqOps$$super$sizeCompare(that: Iterable[_]): Int
Inherited from
SeqOps
def scala$collection$SeqOps$$super$sizeCompare(otherSize: Int): Int
Inherited from
SeqOps
def scala$collection$immutable$StrictOptimizedSeqOps$$super$sorted[B >: Node](implicit ord: Ordering[B]): NodeSeq
Inherited from
StrictOptimizedSeqOps
def scan[B >: Node](z: B)(op: (B, B) => B): Seq[B]
Inherited from
IterableOps
override def scanLeft[B](z: B)(op: (B, Node) => B): Seq[B]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def scanRight[B](z: B)(op: (Node, B) => B): Seq[B]
Inherited from
IterableOps
def search[B >: Node](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
Inherited from
SeqOps
def search[B >: Node](elem: B)(implicit ord: Ordering[B]): SearchResult
Inherited from
SeqOps
def segmentLength(p: Node => Boolean, from: Int): Int
Inherited from
SeqOps
final def segmentLength(p: Node => Boolean): Int
Inherited from
SeqOps
final override def size: Int
Definition Classes
SeqOps -> IterableOnceOps
Inherited from
SeqOps
final override def sizeCompare(that: Iterable[_]): Int
Definition Classes
SeqOps -> IterableOps
Inherited from
SeqOps
final override def sizeCompare(otherSize: Int): Int
Definition Classes
SeqOps -> IterableOps
Inherited from
SeqOps
@inline
final def sizeIs: SizeCompareOps
Inherited from
IterableOps
def slice(from: Int, until: Int): NodeSeq
Inherited from
IterableOps
def sliding(size: Int, step: Int): Iterator[NodeSeq]
Inherited from
IterableOps
def sliding(size: Int): Iterator[NodeSeq]
Inherited from
IterableOps
def sortBy[B](f: Node => B)(implicit ord: Ordering[B]): NodeSeq
Inherited from
SeqOps
def sortWith(lt: (Node, Node) => Boolean): NodeSeq
Inherited from
SeqOps
override def sorted[B >: Node](implicit ord: Ordering[B]): NodeSeq
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from
StrictOptimizedSeqOps
override def span(p: Node => Boolean): (NodeSeq, NodeSeq)
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
override def splitAt(n: Int): (NodeSeq, NodeSeq)
Definition Classes
IterableOps -> IterableOnceOps
Inherited from
IterableOps
def startsWith[B >: Node](that: IterableOnce[B], offset: Int): Boolean
Inherited from
SeqOps
def stepper[S <: Stepper[_]](implicit shape: StepperShape[Node, S]): S
Inherited from
IterableOnce
def strict_!=(other: Equality): Boolean
Inherited from
Equality
def sum[B >: Node](implicit num: Numeric[B]): B
Inherited from
IterableOnceOps
def tail: NodeSeq
Inherited from
IterableOps
def tails: Iterator[NodeSeq]
Inherited from
IterableOps
def take(n: Int): NodeSeq
Inherited from
IterableOps
override def takeRight(n: Int): NodeSeq
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def takeWhile(p: Node => Boolean): NodeSeq
Inherited from
IterableOps
override def tapEach[U](f: Node => U): NodeSeq
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps
def to[C1](factory: Factory[Node, C1]): C1
Inherited from
IterableOnceOps
def toArray[B >: Node](implicit ClassTag[B]): Array[B]
Inherited from
IterableOnceOps
@inline
final def toBuffer[B >: Node]: Buffer[B]
Inherited from
IterableOnceOps
def toIndexedSeq: IndexedSeq[Node]
Inherited from
IterableOnceOps
final def toIterable: NodeSeq
Inherited from
Iterable
def toList: List[Node]
Inherited from
IterableOnceOps
def toMap[K, V](implicit ev: Node <:< (K, V)): Map[K, V]
Inherited from
IterableOnceOps
final override def toSeq: NodeSeq
Definition Classes
Seq -> IterableOnceOps
Inherited from
Seq
def toSet[B >: Node]: Set[B]
Inherited from
IterableOnceOps
def toVector: Vector[Node]
Inherited from
IterableOnceOps
def transpose[B](implicit asIterable: Node => Iterable[B]): Seq[Seq[B]]
Inherited from
IterableOps
def unapply(a: Int): Option[Node]
Inherited from
PartialFunction
override def unzip[A1, A2](implicit asPair: Node => (A1, A2)): (Seq[A1], Seq[A2])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
override def unzip3[A1, A2, A3](implicit asTriple: Node => (A1, A2, A3)): (Seq[A1], Seq[A2], Seq[A3])
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
override def updated[B >: Node](index: Int, elem: B): Seq[B]
Definition Classes
StrictOptimizedSeqOps -> SeqOps
Inherited from
StrictOptimizedSeqOps
override def view: SeqView[Node]
Definition Classes
SeqOps -> IterableOps
Inherited from
SeqOps
def withFilter(p: Node => Boolean): WithFilter[Node, Seq]
Inherited from
IterableOps
final def xml_!=(other: Any): Boolean
Inherited from
Equality
final def xml_==(other: Any): Boolean
Inherited from
Equality
override def zip[B](that: IterableOnce[B]): Seq[(Node, B)]
Definition Classes
StrictOptimizedIterableOps -> IterableOps
Inherited from
StrictOptimizedIterableOps
def zipAll[A1 >: Node, B](that: Iterable[B], thisElem: A1, thatElem: B): Seq[(A1, B)]
Inherited from
IterableOps
override def zipWithIndex: Seq[(Node, Int)]
Definition Classes
StrictOptimizedIterableOps -> IterableOps -> IterableOnceOps
Inherited from
StrictOptimizedIterableOps

Deprecated and Inherited methods

@inline @deprecated(message = "Use foldLeft instead of /:", since = "2.13.0")
final def /:[B](z: B)(op: (B, Node) => B): B
Deprecated
[Since version 2.13.0] Use foldLeft instead of /:
Inherited from
IterableOnceOps
@inline @deprecated(message = "Use foldRight instead of :\\", since = "2.13.0")
final def :\[B](z: B)(op: (Node, B) => B): B
Deprecated
[Since version 2.13.0] Use foldRight instead of :\\
Inherited from
IterableOnceOps
@deprecated(message = "`aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.", since = "2.13.0")
def aggregate[B](z: => B)(seqop: (B, Node) => B, combop: (B, B) => B): B
Deprecated
[Since version 2.13.0] `aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.
Inherited from
IterableOnceOps
@inline @deprecatedOverriding(message = "Use iterableFactory instead", since = "2.13.0") @deprecated(message = "Use iterableFactory instead", since = "2.13.0")
def companion: IterableFactory[Seq]
Deprecated
[Since version 2.13.0] Use iterableFactory instead
Inherited from
IterableOps
@inline @deprecated(message = "Use `dest ++= coll` instead", since = "2.13.0")
final def copyToBuffer[B >: Node](dest: Buffer[B]): Unit
Deprecated
[Since version 2.13.0] Use `dest ++= coll` instead
Inherited from
IterableOnceOps
@deprecated(message = "Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)", since = "2.13.0")
def hasDefiniteSize: Boolean
Deprecated
[Since version 2.13.0] Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
Inherited from
IterableOnceOps
@inline @deprecated(message = "Use segmentLength instead of prefixLength", since = "2.13.0")
final def prefixLength(p: Node => Boolean): Int
Deprecated
[Since version 2.13.0] Use segmentLength instead of prefixLength
Inherited from
SeqOps
@deprecated(message = "Use coll instead of repr in a collection implementation, use the collection value itself from the outside", since = "2.13.0")
final def repr: NodeSeq
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
@deprecated(message = "Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)", since = "2.13.0")
def reverseMap[B](f: Node => B): Seq[B]
Deprecated
[Since version 2.13.0] Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)
Inherited from
SeqOps
@deprecated(message = "Iterable.seq always returns the iterable itself", since = "2.13.0")
def seq: NodeSeq
Deprecated
[Since version 2.13.0] Iterable.seq always returns the iterable itself
Inherited from
Iterable
@inline @deprecated(message = "Use .iterator instead of .toIterator", since = "2.13.0")
final def toIterator: Iterator[Node]
Deprecated
[Since version 2.13.0] Use .iterator instead of .toIterator
Inherited from
IterableOnceOps
@inline @deprecated(message = "Use .to(LazyList) instead of .toStream", since = "2.13.0")
final def toStream: Stream[Node]
Deprecated
[Since version 2.13.0] Use .to(LazyList) instead of .toStream
Inherited from
IterableOnceOps
@deprecated(message = "Use toIterable instead", since = "2.13.0")
final def toTraversable: Iterable[Node]
Deprecated
[Since version 2.13.0] Use toIterable instead
Inherited from
IterableOps
@inline @deprecated(message = "Use `concat` instead", since = "2.13.0")
final def union[B >: Node](that: Seq[B]): Seq[B]
Deprecated
[Since version 2.13.0] Use `concat` instead
Inherited from
SeqOps
@deprecated(message = "Use .view.slice(from, until) instead of .view(from, until)", since = "2.13.0")
def view(from: Int, until: Int): View[Node]
Deprecated
[Since version 2.13.0] Use .view.slice(from, until) instead of .view(from, until)
Inherited from
IterableOps