Scaladoc for scala.xml.ProcInstr

Inherits

Product
SpecialNode
XMLEvent
Node
NodeSeq
Seq
Seq
SeqLike
PartialFunction
Function1
Iterable
Iterable
IterableLike
Equals
Traversable
Immutable
Traversable
GenericTraversableTemplate
TraversableLike
HasNewBuilder
AnyRef
Any

Type Members

class WithFilter extends AnyRef

A class supporting filtered operations

Value Members

def ++(that: Iterator[Node]): Traversable[Node]

[use case] Concatenates this sequence with the elements of an iterator
[use case]
Concatenates this sequence with the elements of an iterator.

that
the iterator to append.
returns
a new sequence which contains all elements of this sequence followed by all elements of that.

attributes: abstract

Go to: companion
def ++[B >: Node, That](that: Iterator[B])(bf: CanBuildFrom[NodeSeq, B, That]): That

Concatenates this sequence with the elements of an iterator

Concatenates this sequence with the elements of an iterator.

B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
that
the iterator to append.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.
returns
a new collection of type That which contains all elements of this sequence followed by all elements of that.

definition classes: TraversableLike

Go to: companion
def ++(that: Traversable[Node]): Traversable[Node]

[use case] Concatenates this sequence with the elements of a traversable collection
[use case]
Concatenates this sequence with the elements of a traversable collection.

that
the traversable to append.
returns
a new sequence which contains all elements of this sequence followed by all elements of that.

attributes: abstract

Go to: companion
def ++[B >: Node, That](that: Traversable[B])(bf: CanBuildFrom[NodeSeq, B, That]): That

Concatenates this sequence with the elements of a traversable collection

Concatenates this sequence with the elements of a traversable collection.

B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
that
the traversable to append.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.
returns
a new collection of type That which contains all elements of this sequence followed by all elements of that.

definition classes: TraversableLike

Go to: companion
def +:(elem: Node): Seq[Node]

[use case] Prepends an element to this sequence
[use case]
Prepends an element to this sequence

elem
the prepended element
returns
a new sequence consisting of elem followed by all elements of this sequence.

attributes: abstract

Go to: companion
def +:[B >: Node, That](elem: B)(bf: CanBuildFrom[NodeSeq, B, That]): That

Prepends an element to this sequence

Prepends an element to this sequence

B
the element type of the returned sequence.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
elem
the prepended element
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.
returns
a new collection of type That consisting of elem followed by all elements of this sequence.

definition classes: SeqLike

Go to: companion
def /:[B](z: B)(op: (B, Node) ⇒ B): B

Applies a binary operator to a start value and all elements of this sequence, going left to right

Applies a binary operator to a start value and all elements of this sequence, going left to right.
Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.
Note: will not terminate for infinite-sized collections.

B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this sequence$, going left to right with the start value z on the left: {{{ op(...op(op(z, x₁), x₂), ..., x_n) }}} where x,,1,,, ..., x,,n,, are the elements of this sequence.

definition classes: TraversableLike

Go to: companion
def :+(elem: Node): Seq[Node]

[use case] Appends an element to this sequence
[use case]
Appends an element to this sequence
Note: will not terminate for infinite-sized collections.

elem
the appended element
returns
a new sequence consisting of all elements of this sequence followed by elem.

attributes: abstract

Go to: companion
def :+[B >: Node, That](elem: B)(bf: CanBuildFrom[NodeSeq, B, That]): That

Appends an element to this sequence

Appends an element to this sequence
Note: will not terminate for infinite-sized collections.

B
the element type of the returned sequence.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
elem
the appended element
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.
returns
a new collection of type That consisting of all elements of this sequence followed by elem.

definition classes: SeqLike

Go to: companion
def :\[B](z: B)(op: (Node, B) ⇒ B): B

Applies a binary operator to all elements of this sequence and a start value, going right to left

Applies a binary operator to all elements of this sequence and a start value, going right to left.
Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.
Note: will not terminate for infinite-sized collections.

B
the result type of the binary operator.
z
the start value
op
the binary operator
returns
the result of inserting op between consecutive elements of this sequence$, going right to left with the start value z on the right: {{{ op(x₁, op(x₂, ... op(x_n, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this sequence.

definition classes: TraversableLike

Go to: companion
def \(that: String): NodeSeq

Projection function

Projection function. Similar to XPath, use this \ "foo" to get a list of all elements of this sequence that are labelled with "foo". Use \ "_" as a wildcard. Use ns \ "@foo" to get the unprefixed attribute "foo". Use ns \ "@{uri}foo" to get the prefixed attribute "pre:foo" whose prefix "pre" is resolved to the namespace "uri". For attribute projections, the resulting NodeSeq attribute values are wrapped in a Group. There is no support for searching a prefixed attribute by its literal prefix. The document order is preserved.

that
...
returns
...

definition classes: NodeSeq

Go to: companion
def \\(that: String): NodeSeq

projection function

projection function. Similar to XPath, use this \\ 'foo to get a list of all elements of this sequence that are labelled with "foo". Use \\ "_" as a wildcard. Use ns \\ "@foo" to get the unprefixed attribute "foo". Use ns \\ "@{uri}foo" to get each prefixed attribute "pre:foo" whose prefix "pre" is resolved to the namespace "uri". For attribute projections, the resulting NodeSeq attribute values are wrapped in a Group. There is no support for searching a prefixed attribute by its literal prefix. The document order is preserved.

that
...
returns
...

definition classes: NodeSeq

Go to: companion
def addString(b: StringBuilder): StringBuilder

Appends all elements of this sequence to a string builder

Appends all elements of this sequence to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this sequence without any separator string.

b
the string builder to which elements are appended.
returns
the string builder b to which elements were appended.

definition classes: TraversableLike

Go to: companion
def addString(b: StringBuilder, sep: String): StringBuilder

Appends all elements of this sequence to a string builder using a separator string

Appends all elements of this sequence to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method toString) of all elements of this sequence, separated by the string sep.

b
the string builder to which elements are appended.
sep
the separator string.
returns
the string builder b to which elements were appended.

definition classes: TraversableLike

Go to: companion
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

Appends all elements of this sequence to a string builder using start, end, and separator strings

Appends all elements of this sequence to a string builder using start, end, and separator strings. The written text begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this sequence are separated by the string sep.

b
the string builder to which elements are appended.
start
the starting string.
sep
the separator string.
end
the ending string.
returns
the string builder b to which elements were appended.

definition classes: TraversableLike

Go to: companion
def andThen[C](k: (Node) ⇒ C): PartialFunction[Int, C]

Composes this partial function with a transformation function that gets applied to results of this partial function

Composes this partial function with a transformation function that gets applied to results of this partial function.

C
the result type of the transformation function.
k
the transformation function
returns
a partial function with the same domain as this partial function, which maps arguments x to k(this(x)).

definition classes: PartialFunction ⇐ Function1

Go to: companion
def apply(f: (Node) ⇒ Boolean): NodeSeq
def apply(i: Int): Node

Selects an element by its index in the sequence

Selects an element by its index in the sequence.

definition classes: NodeSeq ⇐ SeqLike ⇐ Function1

Go to: companion
def buildString(sb: StringBuilder): StringBuilder

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

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

Go to: companion
def buildString(stripComments: Boolean): String

String representation of this node

String representation of this node

definition classes: Node

Go to: companion
def canEqual(that: Any): Boolean

Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind

Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

that
The object with which this sequence should be compared
returns
true, if this sequence can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

definition classes: IterableLike ⇐ Equals

Go to: companion
def companion: GenericCompanion[Seq[A][A]]

The factory companion object that builds instances of class Seq

The factory companion object that builds instances of class Seq.

definition classes: Seq ⇐ Seq ⇐ Iterable ⇐ Iterable ⇐ Traversable ⇐ Traversable ⇐ GenericTraversableTemplate

Go to: companion
def compose[A](g: (A) ⇒ Int): (A) ⇒ Node

(f compose g)(x) == f(g(x))

(f compose g)(x) == f(g(x))

definition classes: Function1

Go to: companion
def contains(elem: Any): Boolean

Tests whether this sequence contains a given value as an element

Tests whether this sequence contains a given value as an element.
Note: may not terminate for infinite-sized collections.

elem
the element to test.
returns
true if this sequence has an element that is is equal (wrt ==) to elem, false otherwise.

definition classes: SeqLike

Go to: companion
def containsSlice[B](that: Seq[B]): Boolean

Tests whether this sequence contains a given sequence as a slice

Tests whether this sequence contains a given sequence as a slice.
Note: may not terminate for infinite-sized collections.

that
the sequence to test
returns
true if this sequence contains a slice with the same elements as that, otherwise false.

definition classes: SeqLike

Go to: companion
def copyToArray(xs: Array[Node], start: Int, len: Int): Unit

[use case] Copies elements of this sequence to an array
[use case]
Copies elements of this sequence to an array. Fills the given array xs with at most len elements of this sequence, starting at position start. Copying will stop once either the end of the current sequence is reached, or the end of the array is reached, or len elements have been copied.

xs
the array to fill.
start
the starting index.
len
the maximal number of elements to copy.

attributes: abstract

Go to: companion
def copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Unit

Copies elements of this sequence to an array

Copies elements of this sequence to an array. Fills the given array xs with at most len elements of this sequence, starting at position start. Copying will stop once either the end of the current sequence is reached, or the end of the array is reached, or len elements have been copied.
Note: will not terminate for infinite-sized collections.

B
the type of the elements of the array.
xs
the array to fill.
start
the starting index.
len
the maximal number of elements to copy.

definition classes: IterableLike ⇐ TraversableLike

Go to: companion
def copyToArray(xs: Array[Node], start: Int): Unit

[use case] Copies elements of this sequence to an array
[use case]
Copies elements of this sequence to an array. Fills the given array xs with all elements of this sequence, starting at position 0. Copying will stop once either the end of the current sequence is reached, or the end of the array is reached.

xs
the array to fill.

attributes: abstract

Go to: companion
def copyToArray[B >: Node](xs: Array[B]): Unit

Copies elements of this sequence to an array

Copies elements of this sequence to an array. Fills the given array xs with all elements of this sequence, starting at position 0. Copying will stop once either the end of the current sequence is reached, or the end of the array is reached.
Note: will not terminate for infinite-sized collections.

B
the type of the elements of the array.
xs
the array to fill.

definition classes: TraversableLike

Go to: companion
def copyToArray(xs: Array[Node], start: Int): Unit

[use case] Copies elements of this sequence to an array
[use case]
Copies elements of this sequence to an array. Fills the given array xs with all elements of this sequence, starting at position start. Copying will stop once either the end of the current sequence is reached, or the end of the array is reached.

xs
the array to fill.
start
the starting index.

attributes: abstract

Go to: companion
def copyToArray[B >: Node](xs: Array[B], start: Int): Unit

Copies elements of this sequence to an array

Copies elements of this sequence to an array. Fills the given array xs with all elements of this sequence, starting at position start. Copying will stop once either the end of the current sequence is reached, or the end of the array is reached.
Note: will not terminate for infinite-sized collections.

B
the type of the elements of the array.
xs
the array to fill.
start
the starting index.

definition classes: TraversableLike

Go to: companion
def copyToBuffer[B >: Node](dest: Buffer[B]): Unit

Copies all elements of this sequence to a buffer

Copies all elements of this sequence to a buffer.
Note: will not terminate for infinite-sized collections.

dest
The buffer to which elements are copied.

definition classes: TraversableLike

Go to: companion
def corresponds[B](that: Seq[B])(p: (Node, B) ⇒ Boolean): Boolean

Tests whether every element of this sequence relates to the corresponding element of another sequence by satisfying a test predicate

Tests whether every element of this sequence relates to the corresponding element of another sequence by satisfying a test predicate.

B
the type of the elements of that
that
the other sequence
p
the test predicate, which relates elements from both sequences
returns
true if both sequences have the same length and p(x, y) is true for all corresponding elements x of this sequence and y of that, otherwise false.

definition classes: SeqLike

Go to: companion
def count(p: (Node) ⇒ Boolean): Int

Counts the number of elements in the sequence which satisfy a predicate

Counts the number of elements in the sequence which satisfy a predicate.

p
the predicate used to test elements.
returns
the number of elements satisfying the predicate p.

definition classes: TraversableLike

Go to: companion
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

Go to: companion
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

Go to: companion
def diff[B >: Node, That](that: Seq[B]): NodeSeq

Computes the multiset difference between this sequence and another sequence

Computes the multiset difference between this sequence and another sequence.
Note: will not terminate for infinite-sized collections.

B
the element type of the returned sequence.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
that
the sequence of elements to remove
returns
a new collection of type That which contains all elements of this sequence except some of occurrences of elements that also appear in that. If an element value x appears n times in that, then the first n occurrences of x will not form part of the result, but any following occurrences will.

definition classes: SeqLike

Go to: companion
def drop(n: Int): NodeSeq

Selects all elements except first n ones

Selects all elements except first n ones.

n
the number of elements to drop from this sequence.
returns
a sequence consisting of all elements of this sequence except the first n ones, or else the empty sequence, if this sequence has less than n elements.

definition classes: TraversableLike

Go to: companion
def dropRight(n: Int): NodeSeq

Selects all elements except first n ones

Selects all elements except first n ones.

n
The number of elements to take
returns
a sequence consisting of all elements of this sequence except the first n ones, or else the empty sequence, if this sequence has less than n elements.

definition classes: IterableLike

Go to: companion
def dropWhile(p: (Node) ⇒ Boolean): NodeSeq

Drops longest prefix of elements that satisfy a predicate

Drops longest prefix of elements that satisfy a predicate.

p
The predicate used to test elements.
returns
the longest suffix of this sequence whose first element does not satisfy the predicate p.

definition classes: TraversableLike

Go to: companion
def elements: Iterator[Node]
def endsWith[B](that: Seq[B]): Boolean

Tests whether this sequence ends with the given sequence

Tests whether this sequence ends with the given sequence.
Note: will not terminate for infinite-sized collections.

that
the sequence to test
returns
true if this sequence has that as a suffix, false otherwise.

definition classes: SeqLike

Go to: companion
def equals(x: Any): Boolean

Returns true if x is structurally equal to this node

Returns true if x is structurally equal to this node. Compares prefix, label, attributes and children.

x
...
returns
true if ..

definition classes: Node ⇐ NodeSeq ⇐ SeqLike ⇐ Equals ⇐ AnyRef ⇐ Any

Go to: companion
def equalsWith[B](that: Seq[B])(f: (Node, B) ⇒ Boolean): Boolean

Tests whether every element of this sequence relates to the corresponding element of another sequence by satisfying a test predicate

Tests whether every element of this sequence relates to the corresponding element of another sequence by satisfying a test predicate.

B
the type of the elements of that
that
the other sequence
returns
true if both sequences have the same length and p(x, y) is true for all corresponding elements x of this sequence and y of that, otherwise false.

definition classes: SeqLike

Go to: companion
def exists(p: (Node) ⇒ Boolean): Boolean

Tests whether a predicate holds for some of the elements of this sequence

Tests whether a predicate holds for some of the elements of this sequence.
Note: may not terminate for infinite-sized collections.

p
the predicate used to test elements.
returns
true if the given predicate p holds for some of the elements of this sequence, otherwise false.

definition classes: IterableLike ⇐ TraversableLike

Go to: companion
def filter(p: (Node) ⇒ Boolean): NodeSeq

Selects all elements of this sequence which satisfy a predicate

Selects all elements of this sequence which satisfy a predicate.

p
the predicate used to test elements.
returns
a new sequence consisting of all elements of this sequence that satisfy the given predicate p. The order of the elements is preserved.

definition classes: TraversableLike

Go to: companion
def filterNot(p: (Node) ⇒ Boolean): NodeSeq

Selects all elements of this sequence which do not satisfy a predicate

Selects all elements of this sequence which do not satisfy a predicate.

p
the predicate used to test elements.
returns
a new sequence consisting of all elements of this sequence that do not satisfy the given predicate p. The order of the elements is preserved.

definition classes: TraversableLike

Go to: companion
def find(p: (Node) ⇒ Boolean): Option[Node]

Finds the first element of the sequence satisfying a predicate, if any

Finds the first element of the sequence satisfying a predicate, if any.
Note: may not terminate for infinite-sized collections.

p
the predicate used to test elements.
returns
an option value containing the first element in the sequence that satisfies p, or None if none exists.

definition classes: IterableLike ⇐ TraversableLike

Go to: companion
def findIndexOf(p: (Node) ⇒ Boolean): Int

Returns index of the first element satisying a predicate, or -1

Returns index of the first element satisying a predicate, or -1.

definition classes: SeqLike

Go to: companion
def findLastIndexOf(p: (Node) ⇒ Boolean): Int

Returns index of the last element satisying a predicate, or -1

Returns index of the last element satisying a predicate, or -1.

definition classes: SeqLike

Go to: companion
def first: Node
def firstOption: Option[Node]

None if iterable is empty

None if iterable is empty.

definition classes: IterableLike

Go to: companion
def flatMap[B](f: (Node) ⇒ Traversable[B]): Traversable[B]

[use case] Builds a new collection by applying a function to all elements of this sequence and concatenating the results
[use case]
Builds a new collection by applying a function to all elements of this sequence and concatenating the results.

B
the element type of the returned collection.
f
the function to apply to each element.
returns
a new sequence resulting from applying the given collection-valued function f to each element of this sequence and concatenating the results.

attributes: abstract

Go to: companion
def flatMap[B, That](f: (Node) ⇒ Traversable[B])(bf: CanBuildFrom[NodeSeq, B, That]): That

Builds a new collection by applying a function to all elements of this sequence and concatenating the results

Builds a new collection by applying a function to all elements of this sequence and concatenating the results.

B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
f
the function to apply to each element.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.
returns
a new collection of type That resulting from applying the given collection-valued function f to each element of this sequence and concatenating the results.

definition classes: TraversableLike

Go to: companion
def flatten[B]: CC[B]

[use case] Converts this sequence of traversable collections into a sequence in which all element collections are concatenated
[use case]
Converts this sequence of traversable collections into a sequence in which all element collections are concatenated.

B
the type of the elements of each traversable collection.
returns
a new sequence resulting from concatenating all element sequences.

attributes: abstract

Go to: companion
def flatten[B](asTraversable: (Node) ⇒ Traversable[B]): Seq[B]

Converts this sequence of traversable collections into a sequence in which all element collections are concatenated

Converts this sequence of traversable collections into a sequence in which all element collections are concatenated.

B
the type of the elements of each traversable collection.
asTraversable
an implicit conversion which asserts that the element type of this sequence is a Traversable.
returns
a new sequence resulting from concatenating all element sequences.

definition classes: GenericTraversableTemplate

Go to: companion
def foldLeft[B](z: B)(op: (B, Node) ⇒ B): B

Applies a binary operator to a start value and all elements of this sequence, going left to right

Applies a binary operator to a start value and all elements of this sequence, going left to right.
Note: will not terminate for infinite-sized collections.

B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this sequence$, going left to right with the start value z on the left: {{{ op(...op(z, x₁), x₂, ..., x_n) }}} where x,,1,,, ..., x,,n,, are the elements of this sequence.

definition classes: TraversableLike

Go to: companion
def foldRight[B](z: B)(op: (Node, B) ⇒ B): B

Applies a binary operator to all elements of this sequence and a start value, going right to left

Applies a binary operator to all elements of this sequence and a start value, going right to left.
Note: will not terminate for infinite-sized collections.

B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this sequence$, going right to left with the start value z on the right: {{{ op(x₁, op(x₂, ... op(x_n, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this sequence.

definition classes: IterableLike ⇐ TraversableLike

Go to: companion
def forall(p: (Node) ⇒ Boolean): Boolean

Tests whether a predicate holds for all elements of this sequence

Tests whether a predicate holds for all elements of this sequence.
Note: may not terminate for infinite-sized collections.

p
the predicate used to test elements.
returns
true if the given predicate p holds for all elements of this sequence, otherwise false.

definition classes: IterableLike ⇐ TraversableLike

Go to: companion
def foreach(f: (Node) ⇒ Unit): Unit

[use case] Applies a function f to all elements of this sequence
[use case]
Applies a function f to all elements of this sequence.

f
the function that is applied for its side-effect to every element. The result of function f is discarded.

attributes: abstract

Go to: companion
def foreach[U](f: (Node) ⇒ U): Unit

Applies a function f to all elements of this sequence

Applies a function f to all elements of this sequence.
Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.

U
the type parameter describing the result of function f. This result will always be ignored. Typically U is Unit, but this is not necessary.
f
the function that is applied for its side-effect to every element. The result of function f is discarded.

definition classes: IterableLike ⇐ TraversableLike

Go to: companion
def genericBuilder[B]: Builder[B, Seq[B]]

The generic builder that builds instances of Seq at arbitrary element types

The generic builder that builds instances of Seq at arbitrary element types.

definition classes: GenericTraversableTemplate

Go to: companion
def getNamespace(pre: String): String

Convenience method, same as scope
Convenience method, same as scope.getURI(pre) but additionally checks if scope is null. pre the prefix whose namespace name we would like to obtain returns the namespace if scope != null and prefix was found, else null definition classes: Node Go to: companion
def groupBy[K](f: (Node) ⇒ K): Map[K, NodeSeq] Partitions this sequence into a map of sequences according to some discriminator function Partitions this sequence into a map of sequences according to some discriminator function. Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new sequence. K the type of keys returned by the discriminator function. f the discriminator function. returns A map from keys to sequences such that the following invariant holds: {{{ (xs partition f)(k) = xs filter (x => f(x) == k) }}} That is, every key k is bound to a sequence of those elements x for which f(x) equals k. definition classes: TraversableLike Go to: companion
def grouped(size: Int): Iterator[NodeSeq] Partitions elements in fixed size sequences Partitions elements in fixed size sequences. size the number of elements per group returns An iterator producing sequences of size size, except the last will be truncated if the elements don't divide evenly. definition classes: IterableLike Go to: companion
def hasDefiniteSize: Boolean Tests whether this sequence is known to have a finite size Tests whether this sequence is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end. Note: many collection methods will not work on collections of infinite sizes. definition classes: TraversableLike Go to: companion
def hashCode(): Int Returns a hashcode Returns a hashcode. definition classes: Node ⇐ SeqLike ⇐ AnyRef ⇐ Any Go to: companion
def head: Node Selects the first element of this sequence Selects the first element of this sequence. definition classes: IterableLike ⇐ TraversableLike Go to: companion
def headOption: Option[Node] Optionally selects the first element Optionally selects the first element. definition classes: TraversableLike Go to: companion
def indexOf(elem: Node): Int [use case] Finds index of first occurrence of some value in this sequence after or at some start index [use case] Finds index of first occurrence of some value in this sequence after or at some start index. elem the element value to search for. returns the index >= from of the first element of this sequence that is equal (wrt ==) to elem, or -1, if none exists. attributes: abstract Go to: companion
def indexOf[B >: Node](elem: B, from: Int): Int Finds index of first occurrence of some value in this sequence after or at some start index Finds index of first occurrence of some value in this sequence after or at some start index. Note: may not terminate for infinite-sized collections. B the type of the element elem. elem the element value to search for. from the start index returns the index >= from of the first element of this sequence that is equal (wrt ==) to elem, or -1, if none exists. definition classes: SeqLike Go to: companion
def indexOf(elem: Node): Int [use case] Finds index of first occurrence of some value in this sequence [use case] Finds index of first occurrence of some value in this sequence. elem the element value to search for. returns the index of the first element of this sequence that is equal (wrt ==) to elem, or -1, if none exists. attributes: abstract Go to: companion
def indexOf[B >: Node](elem: B): Int Finds index of first occurrence of some value in this sequence Finds index of first occurrence of some value in this sequence. Note: may not terminate for infinite-sized collections. B the type of the element elem. elem the element value to search for. returns the index of the first element of this sequence that is equal (wrt ==) to elem, or -1, if none exists. definition classes: SeqLike Go to: companion
def indexOfSlice[B >: Node](that: Seq[B], from: Int): Int Finds first index after or at a start index where this sequence contains a given sequence as a slice Finds first index after or at a start index where this sequence contains a given sequence as a slice. Note: may not terminate for infinite-sized collections. that the sequence to test from the start index returns the first index >= from such that the elements of this sequence starting at this index match the elements of sequence that, or -1 of no such subsequence exists. definition classes: SeqLike Go to: companion
def indexOfSlice[B >: Node](that: Seq[B]): Int Finds first index where this sequence contains a given sequence as a slice Finds first index where this sequence contains a given sequence as a slice. Note: may not terminate for infinite-sized collections. that the sequence to test returns the first index such that the elements of this sequence starting at this index match the elements of sequence that, or -1 of no such subsequence exists. definition classes: SeqLike Go to: companion
def indexWhere(p: (Node) ⇒ Boolean, from: Int): Int Finds index of the first element satisfying some predicate after or at some start index Finds index of the first element satisfying some predicate after or at some start index. Note: may not terminate for infinite-sized collections. p the predicate used to test elements. from the start index returns the index >= from of the first element of this sequence that satisfies the predicate p, or -1, if none exists. definition classes: SeqLike Go to: companion
def indexWhere(p: (Node) ⇒ Boolean): Int Finds index of first element satisfying some predicate Finds index of first element satisfying some predicate. Note: may not terminate for infinite-sized collections. p the predicate used to test elements. returns the index of the first element of this sequence that satisfies the predicate p, or -1, if none exists. definition classes: SeqLike Go to: companion
def indices: Range Produces the range of all indices of this sequence Produces the range of all indices of this sequence. definition classes: SeqLike Go to: companion
def init: NodeSeq Selects all elements except the last Selects all elements except the last. definition classes: TraversableLike Go to: companion
def intersect[B >: Node, That](that: Seq[B]): NodeSeq Computes the multiset intersection between this sequence and another sequence Computes the multiset intersection between this sequence and another sequence. Note: may not terminate for infinite-sized collections. B the element type of the returned sequence. That the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found. that the sequence of elements to intersect with. returns a new collection of type That which contains all elements of this sequence which also appear in that. If an element value x appears n times in that, then the first n occurrences of x will be retained in the result, but any following occurrences will be omitted. definition classes: SeqLike Go to: companion
def isAtom: Boolean used internally used internally. Atom/Molecule = -1 PI = -2 Comment = -3 EntityRef = -5 definition classes: Node Go to: companion
def isDefinedAt(idx: Int): Boolean Tests whether this sequence contains given index Tests whether this sequence contains given index. The implementations of methods apply and isDefinedAt turn a Seq[A] into a PartialFunction[Int, A]. idx the index to test returns true if this sequence contains an element at position idx, false otherwise. definition classes: SeqLike Go to: companion
def isEmpty: Boolean Tests whether this sequence is empty Tests whether this sequence is empty. definition classes: IterableLike ⇐ TraversableLike Go to: companion
def iterator: Iterator[Node] Creates a new iterator over all elements contained in this iterable object Creates a new iterator over all elements contained in this iterable object. definition classes: NodeSeq ⇐ IterableLike Go to: companion
def last: Node Selects the last element Selects the last element. definition classes: TraversableLike Go to: companion
def lastIndexOf(elem: Node): Int [use case] Finds index of last occurrence of some value in this sequence before or at a given end index [use case] Finds index of last occurrence of some value in this sequence before or at a given end index. elem the element value to search for. returns the index <= end of the last element of this sequence that is equal (wrt ==) to elem, or -1, if none exists. attributes: abstract Go to: companion
def lastIndexOf[B >: Node](elem: B, end: Int): Int Finds index of last occurrence of some value in this sequence before or at a given end index Finds index of last occurrence of some value in this sequence before or at a given end index. B the type of the element elem. elem the element value to search for. end the end index. returns the index <= end of the last element of this sequence that is equal (wrt ==) to elem, or -1, if none exists. definition classes: SeqLike Go to: companion
def lastIndexOf(elem: Node): Int [use case] Finds index of last occurrence of some value in this sequence [use case] Finds index of last occurrence of some value in this sequence. elem the element value to search for. returns the index of the last element of this sequence that is equal (wrt ==) to elem, or -1, if none exists. attributes: abstract Go to: companion
def lastIndexOf[B >: Node](elem: B): Int Finds index of last occurrence of some value in this sequence Finds index of last occurrence of some value in this sequence. Note: will not terminate for infinite-sized collections. B the type of the element elem. elem the element value to search for. returns the index of the last element of this sequence that is equal (wrt ==) to elem, or -1, if none exists. definition classes: SeqLike Go to: companion
def lastIndexOfSlice[B >: Node](that: Seq[B], end: Int): Int Finds last index before or at a given end index where this sequence contains a given sequence as a slice Finds last index before or at a given end index where this sequence contains a given sequence as a slice. that the sequence to test end the end idnex returns the last index <= end such that the elements of this sequence starting at this index match the elements of sequence that, or -1 of no such subsequence exists. definition classes: SeqLike Go to: companion
def lastIndexOfSlice[B >: Node](that: Seq[B]): Int Finds last index where this sequence contains a given sequence as a slice Finds last index where this sequence contains a given sequence as a slice. Note: will not terminate for infinite-sized collections. that the sequence to test returns the last index such that the elements of this sequence starting a this index match the elements of sequence that, or -1 of no such subsequence exists. definition classes: SeqLike Go to: companion
def lastIndexWhere(p: (Node) ⇒ Boolean, end: Int): Int Finds index of last element satisfying some predicate before or at given end index Finds index of last element satisfying some predicate before or at given end index. p the predicate used to test elements. returns the index <= end of the last element of this sequence that satisfies the predicate p, or -1, if none exists. definition classes: SeqLike Go to: companion
def lastIndexWhere(p: (Node) ⇒ Boolean): Int Finds index of last element satisfying some predicate Finds index of last element satisfying some predicate. Note: will not terminate for infinite-sized collections. p the predicate used to test elements. returns the index of the last element of this sequence that satisfies the predicate p, or -1, if none exists. definition classes: SeqLike Go to: companion
def lastOption: Option[Node] Optionally selects the last element Optionally selects the last element. definition classes: TraversableLike Go to: companion
def length: Int The length of the sequence The length of the sequence. Note: will not terminate for infinite-sized collections. Note: xs.length and xs.size yield the same result. definition classes: NodeSeq ⇐ SeqLike Go to: companion
def lengthCompare(len: Int): Int Compares the length of this sequence to a test value Compares the length of this sequence to a test value. len the test value that gets compared with the length. returns A value x where {{{ x < 0 if this.length < len x == 0 if this.length == len x > 0 if this.length > len }}} The method as implemented here does not call length directly; its running time is O(length min len) instead of O(length). The method should be overwritten if computing length is cheap. definition classes: SeqLike Go to: companion
def lift: (Int) ⇒ Option[Node] Turns this partial function into an plain function returning an Option result Turns this partial function into an plain function returning an Option result. definition classes: PartialFunction Go to: companion
def map[B](f: (Node) ⇒ B): Traversable[B] [use case] Builds a new collection by applying a function to all elements of this sequence [use case] Builds a new collection by applying a function to all elements of this sequence. B the element type of the returned collection. f the function to apply to each element. returns a new sequence resulting from applying the given function f to each element of this sequence and collecting the results. attributes: abstract Go to: companion
def map[B, That](f: (Node) ⇒ B)(bf: CanBuildFrom[NodeSeq, B, That]): That Builds a new collection by applying a function to all elements of this sequence Builds a new collection by applying a function to all elements of this sequence. B the element type of the returned collection. That the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found. f the function to apply to each element. bf an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B. returns a new collection of type That resulting from applying the given function f to each element of this sequence and collecting the results. definition classes: TraversableLike Go to: companion
def max[B >: Node](cmp: Ordering[B]): Node Finds the largest element Finds the largest element. B The type over which the ordering is defined. cmp An ordering to be used for comparing elements. returns the largest element of this sequence with respect to the ordering cmp. definition classes: TraversableLike Go to: companion
def min: Node [use case] Finds the largest element [use case] Finds the largest element. attributes: abstract Go to: companion
def min: Node [use case] Finds the smallest element [use case] Finds the smallest element. attributes: abstract Go to: companion
def min[B >: Node](cmp: Ordering[B]): Node Finds the smallest element Finds the smallest element. B The type over which the ordering is defined. cmp An ordering to be used for comparing elements. returns the smallest element of this sequence with respect to the ordering cmp. definition classes: TraversableLike Go to: companion
def mkString: String Displays all elements of this sequence in a string Displays all elements of this sequence in a string. definition classes: TraversableLike Go to: companion
def mkString(sep: String): String Displays all elements of this sequence in a string using a separator string Displays all elements of this sequence in a string using a separator string. sep the separator string. returns a string representation of this sequence. In the resulting string the string representations (w.r.t. the method toString) of all elements of this sequence are separated by the string sep. definition classes: TraversableLike Go to: companion
def mkString(start: String, sep: String, end: String): String Displays all elements of this sequence in a string using start, end, and separator strings Displays all elements of this sequence in a string using start, end, and separator strings. start the starting string. sep the separator string. end the ending string. returns a string representation of this sequence. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this sequence are separated by the string sep. definition classes: TraversableLike Go to: companion
def nameToString(sb: StringBuilder): StringBuilder Appends qualified name of this node to StringBuilder Appends qualified name of this node to StringBuilder. sb ... returns ... definition classes: Node Go to: companion
def nonEmpty: Boolean Tests whether the sequence is not empty Tests whether the sequence is not empty. definition classes: TraversableLike Go to: companion
def orElse[A1 <: Int, B1 >: Node](that: PartialFunction[A1, B1]): PartialFunction[A1, B1] Composes this partial function with a fallback partial function which gets applied where this partial function is not defined Composes this partial function with a fallback partial function which gets applied where this partial function is not defined. A1 the argument type of the fallback function B1 the result type of the fallback function that the fallback function returns a partial function which has as domain the union of the domains of this partial function and that. The resulting partial function takes x to this(x) where this is defined, and to that(x) where it is not. definition classes: PartialFunction Go to: companion
def padTo(len: Int, elem: Node): Seq[Node] [use case] Appends an element value to this sequence until a given target length is reached [use case] Appends an element value to this sequence until a given target length is reached. len the target length elem the padding value returns a new sequence consisting of all elements of this sequence followed by the minimal number of occurrences of elem so that the resulting sequence has a length of at least len. attributes: abstract Go to: companion
def padTo[B >: Node, That](len: Int, elem: B)(bf: CanBuildFrom[NodeSeq, B, That]): That Appends an element value to this sequence until a given target length is reached Appends an element value to this sequence until a given target length is reached. B the element type of the returned sequence. That the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found. len the target length elem the padding value bf an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B. returns a new collection of type That consisting of all elements of this sequence followed by the minimal number of occurrences of elem so that the resulting collection has a length of at least len. definition classes: SeqLike Go to: companion
def partialMap[B](pf: PartialFunction[Node, B]): Traversable[B] [use case] Builds a new collection by applying a partial function to all elements of this sequence on which the function is defined [use case] Builds a new collection by applying a partial function to all elements of this sequence on which the function is defined. B the element type of the returned collection. pf the partial function which filters and maps the sequence. returns a new sequence resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved. attributes: abstract Go to: companion
def partialMap[B, That](pf: PartialFunction[Node, B])(bf: CanBuildFrom[NodeSeq, B, That]): That Builds a new collection by applying a partial function to all elements of this sequence on which the function is defined Builds a new collection by applying a partial function to all elements of this sequence on which the function is defined. B the element type of the returned collection. That the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found. pf the partial function which filters and maps the sequence. bf an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B. returns a new collection of type That resulting from applying the partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved. definition classes: TraversableLike Go to: companion
def partition(p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq) Partitions this sequence in two sequences according to a predicate Partitions this sequence in two sequences according to a predicate. p the predicate on which to partition. returns a pair of sequences: the first sequence consists of all elements that satisfy the predicate p and the second sequence consists of all elements that don't. The relative order of the elements in the resulting sequences is the same as in the original sequence. definition classes: TraversableLike Go to: companion
def patch(from: Int, that: Seq[Node], replaced: Int): Seq[Node] [use case] Produces a new sequence where a slice of elements in this sequence is replaced by another sequence [use case] Produces a new sequence where a slice of elements in this sequence is replaced by another sequence. from the index of the first replaced element replaced the number of elements to drop in the original sequence returns a new sequence consisting of all elements of this sequence except that replaced elements starting from from are replaced by patch. attributes: abstract Go to: companion
def patch[B >: Node, That](from: Int, patch: Seq[B], replaced: Int)(bf: CanBuildFrom[NodeSeq, B, That]): That Produces a new sequence where a slice of elements in this sequence is replaced by another sequence Produces a new sequence where a slice of elements in this sequence is replaced by another sequence. B the element type of the returned sequence. That the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found. from the index of the first replaced element patch the replacement sequence replaced the number of elements to drop in the original sequence bf an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B. returns a new collection of type That consisting of all elements of this sequence except that replaced elements starting from from are replaced by patch. definition classes: SeqLike Go to: companion
def prefix: String prefix of this node prefix of this node definition classes: Node Go to: companion
def prefixLength(p: (Node) ⇒ Boolean): Int Returns the length of the longest prefix whose elements all satisfy some preficate Returns the length of the longest prefix whose elements all satisfy some preficate. Note: may not terminate for infinite-sized collections. p the predicate used to test elements. returns the length of the longest prefix of this sequence such that every element of the segment satisfies the predicate p. definition classes: SeqLike Go to: companion
val proctext: String
def product: Int [use case] Multiplies up the elements of this collection [use case] Multiplies up the elements of this collection. attributes: abstract Go to: companion
def product[B >: Node](num: Numeric[B]): B Multiplies up the elements of this collection Multiplies up the elements of this collection. B the result type of the * operator. num an implicit parameter defining a set of numeric operations which includes the * operator to be used in forming the product. returns the product of all elements of this sequence with respect to the * operator in num. definition classes: TraversableLike Go to: companion
def productArity: Int return k for a product A(x_1, return k for a product A(x_1,...,x_k) Go to: companion
def productElement(arg0: Int): Any for a product A(x_1, for a product A(x_1,...,x_k), returns x_(n+1) for 0 <= n < k Go to: companion
def productElements: Iterator[Any]
def productIterator: Iterator[Any] An iterator that returns all fields of this product An iterator that returns all fields of this product definition classes: Product Go to: companion
def productPrefix: String By default the empty string By default the empty string. Implementations may override this method in order to prepend a string prefix to the result of the toString methods. Go to: companion
def projection: SeqView[Node, NodeSeq] returns a projection that can be used to call non-strict filter, map, and flatMap methods that build projections of the collection returns a projection that can be used to call non-strict filter, map, and flatMap methods that build projections of the collection. definition classes: SeqLike ⇐ IterableLike Go to: companion
def reduceLeft[B >: Node](op: (B, Node) ⇒ B): B Applies a binary operator to all elements of this sequence, going left to right Applies a binary operator to all elements of this sequence, going left to right. Note: will not terminate for infinite-sized collections. B the result type of the binary operator. op the binary operator. returns the result of inserting op between consecutive elements of this sequence$, going left to right: {{{ op(...(op(x₁, x₂), ... ) , x_n) }}} where x,,1,,, ..., x,,n,, are the elements of this sequence. definition classes: TraversableLike Go to: companion
def reduceLeftOption[B >: Node](op: (B, Node) ⇒ B): Option[B] Optionally applies a binary operator to all elements of this sequence, going left to right Optionally applies a binary operator to all elements of this sequence, going left to right. Note: will not terminate for infinite-sized collections. B the result type of the binary operator. op the binary operator. returns an option value containing the result of reduceLeft(op) is this sequence is nonempty, None otherwise. definition classes: TraversableLike Go to: companion
def reduceRight[B >: Node](op: (Node, B) ⇒ B): B Applies a binary operator to all elements of this sequence, going right to left Applies a binary operator to all elements of this sequence, going right to left. Note: will not terminate for infinite-sized collections. B the result type of the binary operator. op the binary operator. returns the result of inserting op between consecutive elements of this sequence$, going right to left: {{{ op(x₁, op(x₂, ..., op(x_n-1, x_n)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this sequence. definition classes: IterableLike ⇐ TraversableLike Go to: companion
def reduceRightOption[B >: Node](op: (Node, B) ⇒ B): Option[B] Optionally applies a binary operator to all elements of this sequence, going right to left Optionally applies a binary operator to all elements of this sequence, going right to left. Note: will not terminate for infinite-sized collections. B the result type of the binary operator. op the binary operator. returns an option value containing the result of reduceRight(op) is this sequence is nonempty, None otherwise. definition classes: TraversableLike Go to: companion
def removeDuplicates: NodeSeq Builds a new sequence from this sequence without any duplicate elements Builds a new sequence from this sequence without any duplicate elements. Note: will not terminate for infinite-sized collections. definition classes: SeqLike Go to: companion
def repr: NodeSeq The collection of type sequence underlying this TraversableLike object The collection of type sequence underlying this TraversableLike object. By default this is implemented as the TraversableLike object itself, but this can be overridden. definition classes: TraversableLike Go to: companion
def reverse: NodeSeq Returns new sequence wih elements in reversed order Returns new sequence wih elements in reversed order. Note: will not terminate for infinite-sized collections. definition classes: SeqLike Go to: companion
def reverseIterator: Iterator[Node] An iterator yielding elements in reversed order An iterator yielding elements in reversed order. Note: will not terminate for infinite-sized collections. Note: xs.reverseIterator is the same as xs.reverse.iterator but might be more efficient. definition classes: SeqLike Go to: companion
def reverseMap[B](f: (Node) ⇒ B): Seq[B] [use case] Builds a new collection by applying a function to all elements of this sequence and collecting the results in reversed order [use case] Builds a new collection by applying a function to all elements of this sequence and collecting the results in reversed order. B the element type of the returned collection. Note: xs.reverseMap(f) is the same as xs.reverse.map(f) but might be more efficient. f the function to apply to each element. returns a new sequence resulting from applying the given function f to each element of this sequence and collecting the results in reversed order. attributes: abstract Go to: companion
def reverseMap[B, That](f: (Node) ⇒ B)(bf: CanBuildFrom[NodeSeq, B, That]): That Builds a new collection by applying a function to all elements of this sequence and collecting the results in reversed order Builds a new collection by applying a function to all elements of this sequence and collecting the results in reversed order. Note: will not terminate for infinite-sized collections. Note: xs.reverseMap(f) is the same as xs.reverse.map(f) but might be more efficient. B the element type of the returned collection. That the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found. f the function to apply to each element. bf an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B. returns a new collection of type That resulting from applying the given function f to each element of this sequence and collecting the results in reversed order. definition classes: SeqLike Go to: companion
def reversedElements: Iterator[Node]
def sameElements(that: Iterable[Node]): Boolean [use case] Checks if the other iterable collection contains the same elements in the same order as this sequence [use case] Checks if the other iterable collection contains the same elements in the same order as this sequence. that the collection to compare with. returns true, if both collections contain the same elements in the same order, false otherwise. attributes: abstract Go to: companion
def sameElements[B >: Node](that: Iterable[B]): Boolean Checks if the other iterable collection contains the same elements in the same order as this sequence Checks if the other iterable collection contains the same elements in the same order as this sequence. Note: will not terminate for infinite-sized collections. B the type of the elements of collection that. that the collection to compare with. returns true, if both collections contain the same elements in the same order, false otherwise. definition classes: IterableLike Go to: companion
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 Go to: companion
def segmentLength(p: (Node) ⇒ Boolean, from: Int): Int Computes length of longest segment whose elements all satisfy some preficate Computes length of longest segment whose elements all satisfy some preficate. Note: may not terminate for infinite-sized collections. p the predicate used to test elements. from the index where the search starts. returns the length of the longest segment of this sequence starting from index from such that every element of the segment satisfies the predicate p. definition classes: SeqLike Go to: companion
def size: Int The size of this sequence, equivalent to length The size of this sequence, equivalent to length. Note: will not terminate for infinite-sized collections. definition classes: SeqLike ⇐ TraversableLike Go to: companion
def slice(from: Int, until: Int): NodeSeq Selects an interval of elements Selects an interval of elements. Note: c.slice(from, to) is equivalent to (but possibly more efficient than) c.drop(from).take(to - from) from the index of the first returned element in this sequence. until the index one past the last returned element in this sequence. returns a sequence containing the elements starting at index from and extending up to (but not including) index until of this sequence. definition classes: IterableLike ⇐ TraversableLike Go to: companion
def sliding[B >: Node](size: Int, step: Int): Iterator[NodeSeq]
def sliding[B >: Node](size: Int): Iterator[NodeSeq] Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.) size the number of elements per group returns An iterator producing sequences of size size, except the last will be truncated if the elements don't divide evenly. definition classes: IterableLike Go to: companion
def sortBy[B](f: (Node) ⇒ B)(ord: Ordering[B]): NodeSeq Sorts this Seq according to the Ordering which results from transforming an implicitly given Ordering with a transformation function Sorts this Seq according to the Ordering which results from transforming an implicitly given Ordering with a transformation function. B the target type of the transformation f, and the type where the ordering ord is defined. f the transformation function mapping elements to some other domain B. ord the ordering assumed on domain B. returns a sequence consisting of the elements of this sequence sorted according to the ordering where x < y if ord.lt(f(x), f(y)). definition classes: SeqLike Go to: companion
def sortWith[B >: Node](ord: Ordering[B]): NodeSeq Sorts this sequence according to an Ordering Sorts this sequence according to an Ordering. The sort is stable. That is, elements that are equal wrt lt appear in the same order in the sorted sequence as in the original. ord the ordering to be used to compare elements. returns a sequence consisting of the elements of this sequence sorted according to the ordering ord. definition classes: SeqLike Go to: companion
def sortWith(lt: (Node, Node) ⇒ Boolean): NodeSeq Sorts this sequence according to a comparison function Sorts this sequence according to a comparison function. Note: will not terminate for infinite-sized collections. The sort is stable. That is, elements that are equal wrt lt appear in the same order in the sorted sequence as in the original. lt the comparison function which tests whether its first argument precedes its second argument in the desired ordering. returns a sequence consisting of the elements of this sequence sorted according to the comparison function lt. definition classes: SeqLike Go to: companion
def span(p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq) Spits this sequence into a prefix/suffix pair according to a predicate Spits this sequence into a prefix/suffix pair according to a predicate. Note: c span p is equivalent to (but possibly more efficient than) (c takeWhile p, c dropWhile p), provided the evaluation of the predicate p does not cause any side-effects. p the test predicate returns a pair consisting of the longest prefix of this sequence whose elements all satisfy p, and the rest of this sequence. definition classes: TraversableLike Go to: companion
def splitAt(n: Int): (NodeSeq, NodeSeq) Splits this sequence into two at a given position Splits this sequence into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n). n the position at which to split. returns a pair of sequences consisting of the first n elements of this sequence, and the other elements. definition classes: TraversableLike Go to: companion
def startsWith[B](that: Seq[B]): Boolean Tests whether this sequence starts with the given sequence Tests whether this sequence starts with the given sequence. that the sequence to test returns true if this collection has that as a prefix, false otherwise. otherwise false definition classes: SeqLike Go to: companion
def startsWith[B](that: Seq[B], offset: Int): Boolean Tests whether this sequence contains the given sequence at a given index Tests whether this sequence contains the given sequence at a given index. If the both the receiver object, this and the argument, that are infinite sequences this method may not terminate. that the sequence to test offset the index where the sequence is searched. returns true if the sequence that is contained in this sequence at index offset, otherwise false. definition classes: SeqLike Go to: companion
def stringPrefix: String Defines the prefix of this object's toString representation Defines the prefix of this object's toString representation. definition classes: TraversableLike Go to: companion
def sum: Int [use case] Sums up the elements of this collection [use case] Sums up the elements of this collection. attributes: abstract Go to: companion
def sum[B >: Node](num: Numeric[B]): B Sums up the elements of this collection Sums up the elements of this collection. B the result type of the + operator. num an implicit parameter defining a set of numeric operations which includes the + operator to be used in forming the sum. returns the sum of all elements of this sequence with respect to the + operator in num. definition classes: TraversableLike Go to: companion
def tail: NodeSeq Selects all elements except the first Selects all elements except the first. definition classes: TraversableLike Go to: companion
def take(n: Int): NodeSeq Selects first n elements Selects first n elements. n Tt number of elements to take from this sequence. returns a sequence consisting only of the first n elements of this sequence, or else the whole sequence, if it has less than n elements. definition classes: IterableLike ⇐ TraversableLike Go to: companion
def takeRight(n: Int): NodeSeq Selects last n elements Selects last n elements. n the number of elements to take returns a sequence consisting only of the last n elements of this sequence, or else the whole sequence, if it has less than n elements. definition classes: IterableLike Go to: companion
def takeWhile(p: (Node) ⇒ Boolean): NodeSeq Takes longest prefix of elements that satisfy a predicate Takes longest prefix of elements that satisfy a predicate. p The predicate used to test elements. returns the longest prefix of this sequence whose elements all satisfy the predicate p. definition classes: IterableLike ⇐ TraversableLike Go to: companion
val target: String
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 { Go to: companion
def theSeq: Seq[Node] returns a sequence consisting of only this node returns a sequence consisting of only this node definition classes: Node ⇐ NodeSeq Go to: companion
def toArray: Array[Node] [use case] Converts this sequence to an array [use case] Converts this sequence to an array. Note: will not terminate for infinite-sized collections. attributes: abstract Go to: companion
def toArray[B >: Node](arg0: ClassManifest[B]): Array[B] Converts this sequence to an array Converts this sequence to an array. Note: will not terminate for infinite-sized collections. B the type of the elements of the array. A ClassManifest for this type must be available. returns an array containing all elements of this sequence. definition classes: TraversableLike Go to: companion
def toIndexedSeq[B >: Node]: IndexedSeq[B] Converts this sequence to an indexed sequence Converts this sequence to an indexed sequence. Note: will not terminate for infinite-sized collections. definition classes: TraversableLike Go to: companion
def toIterable: Iterable[Node] Converts this sequence to an iterable collection Converts this sequence to an iterable collection. Note: will not terminate for infinite-sized collections. definition classes: IterableLike ⇐ TraversableLike Go to: companion
def toList: List[Node] Converts this sequence to a list Converts this sequence to a list. Note: will not terminate for infinite-sized collections. definition classes: TraversableLike Go to: companion
def toMap[T, U](ev: <:<[Node, (T, U)]): Map[T, U] Converts this sequence to a map Converts this sequence to a map. This method is unavailable unless the elements are members of Tuple2, each ((K, V)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined. Note: will not terminate for infinite-sized collections. definition classes: TraversableLike Go to: companion
def toSeq: Seq[Node] Converts this sequence to a sequence Converts this sequence to a sequence. Note: will not terminate for infinite-sized collections. Overridden for efficiency. definition classes: SeqLike ⇐ TraversableLike Go to: companion
def toSet[B >: Node]: Set[B] Converts this sequence to a set Converts this sequence to a set. Note: will not terminate for infinite-sized collections. definition classes: TraversableLike Go to: companion
def toStream: Stream[Node] Converts this sequence to a stream Converts this sequence to a stream. Note: will not terminate for infinite-sized collections. definition classes: IterableLike ⇐ TraversableLike Go to: companion
def toString(): String Same as toString(false) Same as toString(false). definition classes: Node ⇐ NodeSeq ⇐ SeqLike ⇐ Function1 ⇐ TraversableLike ⇐ AnyRef ⇐ Any Go to: companion
def transpose[B](asTraversable: (Node) ⇒ Traversable[B]): Seq[Seq[B]] Transposes this sequence of traversable collections into Transposes this sequence of traversable collections into definition classes: GenericTraversableTemplate Go to: companion
def union(that: Seq[Node]): Seq[Node] [use case] Computes the multiset intersection between this sequence and another sequence [use case] Computes the multiset intersection between this sequence and another sequence. Note: may not terminate for infinite-sized collections. that the sequence of elements to intersect with. returns a new sequence which contains all elements of this sequence which also appear in that. If an element value x appears n times in that, then the first n occurrences of x will be retained in the result, but any following occurrences will be omitted. attributes: abstract Go to: companion
def union(that: Seq[Node]): Seq[Node] [use case] Computes the multiset difference between this sequence and another sequence [use case] Computes the multiset difference between this sequence and another sequence. Note: will not terminate for infinite-sized collections. that the sequence of elements to remove returns a new sequence which contains all elements of this sequence except some of occurrences of elements that also appear in that. If an element value x appears n times in that, then the first n occurrences of x will not form part of the result, but any following occurrences will. attributes: abstract Go to: companion
def union(that: Seq[Node]): Seq[Node] [use case] Produces a new sequence which contains all elements of this sequence and also all elements of a given sequence [use case] Produces a new sequence which contains all elements of this sequence and also all elements of a given sequence. xs union ys is equivalent to xs ++ ys. Note: will not terminate for infinite-sized collections. that the sequence to add. returns a new sequence which contains all elements of this sequence followed by all elements of that. attributes: abstract Go to: companion
def union[B >: Node, That](that: Seq[B])(bf: CanBuildFrom[NodeSeq, B, That]): That Produces a new sequence which contains all elements of this sequence and also all elements of a given sequence Produces a new sequence which contains all elements of this sequence and also all elements of a given sequence. xs union ys is equivalent to xs ++ ys. Note: will not terminate for infinite-sized collections. Another way to express this is that xs union ys computes the order-presevring multi-set union of xs and ys. union is hence a counter-oart of diff and intersect which also work on multi-sets. Note: will not terminate for infinite-sized collections. B the element type of the returned sequence. That the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found. that the sequence to add. bf an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B. returns a new collection of type That which contains all elements of this sequence followed by all elements of that. definition classes: SeqLike Go to: companion
def unzip[A1, A2](asPair: (Node) ⇒ (A1, A2)): (Seq[A1], Seq[A2]) Converts this sequence of pairs into two collections of the first and second halfs of each pair Converts this sequence of pairs into two collections of the first and second halfs of each pair. asPair an implicit conversion which asserts that the element type of this sequence is a pair. returns a pair sequences, containing the first, respectively second half of each element pair of this sequence. definition classes: GenericTraversableTemplate Go to: companion
def updated(index: Int, elem: Node): Seq[Node] [use case] A copy of this sequence with one single replaced element [use case] A copy of this sequence with one single replaced element. index the position of the replacement elem the replacing element returns a copy of this sequence with the element at position index replaced by elem. attributes: abstract Go to: companion
def updated[B >: Node, That](index: Int, elem: B)(bf: CanBuildFrom[NodeSeq, B, That]): That A copy of this sequence with one single replaced element A copy of this sequence with one single replaced element. B the element type of the returned sequence. That the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found. index the position of the replacement elem the replacing element bf an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B. returns a new collection of type That which is a copy of this sequence with the element at position index replaced by elem. definition classes: SeqLike Go to: companion
def view(from: Int, until: Int): SeqView[Node, NodeSeq] Creates a non-strict view of a slice of this sequence Creates a non-strict view of a slice of this sequence. Note: the difference between view and slice is that view produces a view of the current sequence, whereas slice produces a new sequence. Note: view(from, to) is equivalent to view.slice(from, to) from the index of the first element of the view until the index of the element following the view returns a non-strict view of a slice of this sequence, starting at index from and extending up to (but not including) index until. definition classes: SeqLike ⇐ IterableLike ⇐ TraversableLike Go to: companion
def view: SeqView[Node, NodeSeq] Creates a non-strict view of this sequence Creates a non-strict view of this sequence. definition classes: SeqLike ⇐ IterableLike ⇐ TraversableLike Go to: companion
def withFilter(p: (Node) ⇒ Boolean): WithFilter Creates a non-strict filter of this sequence Creates a non-strict filter of this sequence. Note: the difference between c filter p and c withFilter p is that the former creates a new collection, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations. p the predicate used to test elements. returns an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this sequence which satify the predicate p. definition classes: TraversableLike Go to: companion
def xmlType(): TypeSymbol Returns a type symbol (e Returns a type symbol (e.g. DTD, XSD), default null. definition classes: Node Go to: companion
def zip[B](that: Iterable[B]): Iterable[(Node, B)] [use case] Returns a sequence formed from this sequence and another iterable collection by combining corresponding elements in pairs [use case] Returns a sequence formed from this sequence and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored. B the type of the second half of the returned pairs that The iterable providing the second half of each result pair returns a new sequence containing pairs consisting of corresponding elements of this sequence and that. The length of the returned collection is the minimum of the lengths of this sequence$ and that. attributes: abstract Go to: companion
def zip[A1 >: Node, B, That](that: Iterable[B])(bf: CanBuildFrom[NodeSeq, (A1, B), That]): That Returns a sequence formed from this sequence and another iterable collection by combining corresponding elements in pairs Returns a sequence formed from this sequence and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored. A1 the type of the first half of the returned pairs (this is always a supertype of the collection's element type A). B the type of the second half of the returned pairs That the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, B) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That]. is found. that The iterable providing the second half of each result pair bf an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type (A1, B). returns a new collection of type That containing pairs consisting of corresponding elements of this sequence and that. The length of the returned collection is the minimum of the lengths of this sequence$ and that. definition classes: IterableLike Go to: companion
def zipAll[B](that: Iterable[B], thisElem: Node, thatElem: B): Iterable[(Node, B)] [use case] Returns a sequence formed from this sequence and another iterable collection by combining corresponding elements in pairs [use case] Returns a sequence formed from this sequence and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer. B the type of the second half of the returned pairs that The iterable providing the second half of each result pair thisElem the element to be used to fill up the result if this sequence is shorter than that. thatElem the element to be used to fill up the result if that is shorter than this sequence. returns a new sequence containing pairs consisting of corresponding elements of this sequence and that. The length of the returned collection is the maximum of the lengths of this sequence$ and that. If this sequence is shorter than that, thisElem values are used to pad the result. If that is shorter than this sequence, thatElem values are used to pad the result. attributes: abstract Go to: companion
def zipAll[B, A1 >: Node, That](that: Iterable[B], thisElem: A1, thatElem: B)(bf: CanBuildFrom[NodeSeq, (A1, B), That]): That Returns a sequence formed from this sequence and another iterable collection by combining corresponding elements in pairs Returns a sequence formed from this sequence and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer. that the iterable providing the second half of each result pair thisElem the element to be used to fill up the result if this sequence is shorter than that. thatElem the element to be used to fill up the result if that is shorter than this sequence. returns a new collection of type That containing pairs consisting of corresponding elements of this sequence and that. The length of the returned collection is the maximum of the lengths of this sequence$ and that. If this sequence is shorter than that, thisElem values are used to pad the result. If that is shorter than this sequence, thatElem values are used to pad the result. definition classes: IterableLike Go to: companion
def zipWithIndex: Iterable[(Node, Int)] [use case] Zips this sequence with its indices [use case] Zips this sequence with its indices. attributes: abstract Go to: companion
def zipWithIndex[A1 >: Node, That](bf: CanBuildFrom[NodeSeq, (A1, Int), That]): That Zips this sequence with its indices Zips this sequence with its indices. A1 the type of the first half of the returned pairs (this is always a supertype of the collection's element type A). That the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, Int) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That]. is found. returns A new collection of type That containing pairs consisting of all elements of this sequence paired with their index. Indices start at 0. definition classes: IterableLike Go to: companion


        
        
              Instance constructors
              
      
      new
      
        ProcInstr(target: String, proctext: String)
      
      
      
    

      
      new
      
        ProcInstr()

ProcInstr

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

Inherits

Type Members

class WithFilter extends AnyRef

Value Members

def ++(that: Iterator[Node]): Traversable[Node]

def ++[B >: Node, That](that: Iterator[B])(bf: CanBuildFrom[NodeSeq, B, That]): That

def ++(that: Traversable[Node]): Traversable[Node]

def ++[B >: Node, That](that: Traversable[B])(bf: CanBuildFrom[NodeSeq, B, That]): That

def +:(elem: Node): Seq[Node]

def +:[B >: Node, That](elem: B)(bf: CanBuildFrom[NodeSeq, B, That]): That

def /:[B](z: B)(op: (B, Node) ⇒ B): B

def :+(elem: Node): Seq[Node]

def :+[B >: Node, That](elem: B)(bf: CanBuildFrom[NodeSeq, B, That]): That

def :\[B](z: B)(op: (Node, B) ⇒ B): B

def \(that: String): NodeSeq

def \\(that: String): NodeSeq

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def andThen[C](k: (Node) ⇒ C): PartialFunction[Int, C]

def apply(f: (Node) ⇒ Boolean): NodeSeq

def apply(i: Int): Node

def buildString(sb: StringBuilder): StringBuilder

def buildString(stripComments: Boolean): String

def canEqual(that: Any): Boolean

def companion: GenericCompanion[Seq[A][A]]

def compose[A](g: (A) ⇒ Int): (A) ⇒ Node

def contains(elem: Any): Boolean

def containsSlice[B](that: Seq[B]): Boolean

def copyToArray(xs: Array[Node], start: Int, len: Int): Unit

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

def copyToArray(xs: Array[Node], start: Int): Unit

def copyToArray[B >: Node](xs: Array[B]): Unit

def copyToArray(xs: Array[Node], start: Int): Unit

def copyToArray[B >: Node](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: Node](dest: Buffer[B]): Unit

def corresponds[B](that: Seq[B])(p: (Node, B) ⇒ Boolean): Boolean

def count(p: (Node) ⇒ Boolean): Int

def descendant: List[Node]

def descendant_or_self: List[Node]

def diff[B >: Node, That](that: Seq[B]): NodeSeq

def drop(n: Int): NodeSeq

def dropRight(n: Int): NodeSeq

def dropWhile(p: (Node) ⇒ Boolean): NodeSeq

def elements: Iterator[Node]

def endsWith[B](that: Seq[B]): Boolean

def equals(x: Any): Boolean

def equalsWith[B](that: Seq[B])(f: (Node, B) ⇒ Boolean): Boolean

def exists(p: (Node) ⇒ Boolean): Boolean

def filter(p: (Node) ⇒ Boolean): NodeSeq

def filterNot(p: (Node) ⇒ Boolean): NodeSeq

def find(p: (Node) ⇒ Boolean): Option[Node]

def findIndexOf(p: (Node) ⇒ Boolean): Int

def findLastIndexOf(p: (Node) ⇒ Boolean): Int

def first: Node

def firstOption: Option[Node]

def flatMap[B](f: (Node) ⇒ Traversable[B]): Traversable[B]

def flatMap[B, That](f: (Node) ⇒ Traversable[B])(bf: CanBuildFrom[NodeSeq, B, That]): That

def flatten[B]: CC[B]

def flatten[B](asTraversable: (Node) ⇒ Traversable[B]): Seq[B]

def foldLeft[B](z: B)(op: (B, Node) ⇒ B): B

def foldRight[B](z: B)(op: (Node, B) ⇒ B): B

def forall(p: (Node) ⇒ Boolean): Boolean

def foreach(f: (Node) ⇒ Unit): Unit

def foreach[U](f: (Node) ⇒ U): Unit

def genericBuilder[B]: Builder[B, Seq[B]]

def getNamespace(pre: String): String

def groupBy[K](f: (Node) ⇒ K): Map[K, NodeSeq]

def grouped(size: Int): Iterator[NodeSeq]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Node

def headOption: Option[Node]

def indexOf(elem: Node): Int

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

def indexOf(elem: Node): Int

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

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