scala.xml

Atom

class Atom [+A] extends SpecialNode with Serializable

The class Atom provides an XML node for text (PCDATA). It is used in both non-bound and bound XML representations.

Source
Atom.scala
Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. Atom
  2. Serializable
  3. Serializable
  4. SpecialNode
  5. XMLEvent
  6. Node
  7. NodeSeq
  8. Equality
  9. Seq
  10. Seq
  11. SeqLike
  12. GenSeq
  13. GenSeqLike
  14. PartialFunction
  15. Function1
  16. Iterable
  17. Iterable
  18. IterableLike
  19. Equals
  20. GenIterable
  21. GenIterableLike
  22. Traversable
  23. Immutable
  24. Traversable
  25. GenTraversable
  26. GenericTraversableTemplate
  27. TraversableLike
  28. GenTraversableLike
  29. Parallelizable
  30. TraversableOnce
  31. GenTraversableOnce
  32. FilterMonadic
  33. HasNewBuilder
  34. AnyRef
  35. Any
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Atom (data: A)

Type Members

  1. type Self = NodeSeq

    The type implementing this traversable

    The type implementing this traversable

    Attributes
    protected
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]

    A class supporting filtered operations.

Value Members

  1. def != (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef
  2. def != (arg0: Any): Boolean

    Test two objects for inequality.

    Test two objects for inequality.

    returns

    true if !(this == that), false otherwise.

    Attributes
    final
    Definition Classes
    Any
  3. def ## (): Int

    Equivalent to x.hashCode except for boxed numeric types.

    Equivalent to x.hashCode except for boxed numeric types. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them.

    returns

    a hash value consistent with ==

    Attributes
    final
    Definition Classes
    AnyRef → Any
  4. def ++ [B >: Node, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Definition Classes
    TraversableLike
    Annotations
    @bridge()
  5. def ++ [B] (that: GenTraversableOnce[B]): immutable.Seq[B]

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

    [use case]

    Concatenates this immutable sequence with the elements of a traversable collection.

    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new collection of type That which contains all elements of this immutable sequence followed by all elements of that.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  6. def ++ [B >: Node, That] (that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Concatenates this immutable sequence with the elements of a traversable collection.

    Concatenates this immutable 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 immutable sequence followed by all elements of that.

    Definition Classes
    TraversableLike → GenTraversableLike
  7. def ++: [B >: Node, That] (that: Traversable[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions.

    This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions. Since TraversableOnce has no '++' method, we have to implement that directly, but Traversable and down can use the overload.

    Definition Classes
    TraversableLike
  8. def ++: [B] (that: TraversableOnce[B]): immutable.Seq[B]

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

    [use case]

    Concatenates this immutable sequence with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new collection of type That which contains all elements of this immutable sequence followed by all elements of that.

    Attributes
    abstract
    Definition Classes
    TraversableLike
  9. def ++: [B >: Node, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Concatenates this immutable sequence with the elements of a traversable collection.

    Concatenates this immutable sequence with the elements of a traversable collection. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

    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 immutable sequence followed by all elements of that.

    Definition Classes
    TraversableLike
  10. def +: (elem: Node): immutable.Seq[Node]

    [use case] Prepends an element to this immutable sequence

    [use case]

    Prepends an element to this immutable sequence

    elem

    the prepended element

    returns

    a new collection of type That consisting of elem followed by all elements of this immutable sequence.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  11. def +: [B >: Node, That] (elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Prepends an element to this immutable sequence

    Prepends an element to this immutable sequence

    B

    the element type of the returned immutable 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 immutable sequence.

    Definition Classes
    SeqLike → GenSeqLike
  12. def /: [B] (z: B)(op: (B, Node) ⇒ B): B

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

    Applies a binary operator to a start value and all elements of this immutable 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 immutable sequence, going left to right with the start value z on the left:

                op(...op(op(z, x,,1,,), x,,2,,), ..., x,,n,,)
    

    where x,,1,,, ..., x,,n,, are the elements of this immutable sequence.

    Definition Classes
    TraversableOnceGenTraversableOnce
  13. def /:\ [A1 >: Node] (z: A1)(op: (A1, A1) ⇒ A1): A1

    A syntactic sugar for out of order folding.

    A syntactic sugar for out of order folding. See fold.

    Definition Classes
    GenTraversableOnce
  14. def :+ (elem: Node): immutable.Seq[Node]

    [use case] Appends an element to this immutable sequence

    [use case]

    Appends an element to this immutable sequence

    Note: will not terminate for infinite-sized collections.

    elem

    the appended element

    returns

    a new collection of type That consisting of all elements of this immutable sequence followed by elem.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  15. def :+ [B >: Node, That] (elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Appends an element to this immutable sequence

    Appends an element to this immutable sequence

    Note: will not terminate for infinite-sized collections.

    B

    the element type of the returned immutable 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 immutable sequence followed by elem.

    Definition Classes
    SeqLike → GenSeqLike
  16. def :\ [B] (z: B)(op: (Node, B) ⇒ B): B

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

    Applies a binary operator to all elements of this immutable 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 immutable sequence, going right to left with the start value z on the right:

                op(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))
    

    where x,,1,,, ..., x,,n,, are the elements of this immutable sequence.

    Definition Classes
    TraversableOnceGenTraversableOnce
  17. def == (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef
  18. def == (arg0: Any): Boolean

    Test two objects for equality.

    Test two objects for equality.

    returns

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

    Attributes
    final
    Definition Classes
    Any
  19. def \ (that: String): NodeSeq

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

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

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

    For attribute projections, the resulting 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
  20. def \\ (that: String): NodeSeq

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

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

    For attribute projections, the resulting 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
  21. def addString (b: StringBuilder): StringBuilder

    Appends all elements of this immutable sequence to a string builder.

    Appends all elements of this immutable sequence to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this immutable 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
    TraversableOnce
  22. def addString (b: StringBuilder, sep: String): StringBuilder

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

    Appends all elements of this immutable 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 immutable 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
    TraversableOnce
  23. def addString (b: StringBuilder, start: String, sep: String, end: String): StringBuilder

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

    Appends all elements of this immutable 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 immutable 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
    TraversableOnce
  24. def aggregate [B] (z: B)(seqop: (B, Node) ⇒ B, combop: (B, B) ⇒ B): B

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

    This is a more general form of fold and reduce. It has similar semantics, but does not require the result to be a supertype of the element type. It traverses the elements in different partitions sequentially, using seqop to update the result, and then applies combop to results from different partitions. The implementation of this operation may operate on an arbitrary number of collection partitions, so combop may be invoked arbitrary number of times.

    For example, one might want to process some elements and then produce a Set. In this case, seqop would process an element and append it to the list, while combop would concatenate two lists from different partitions together. The initial value z would be an empty set.

       pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)
    

    Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).

    z

    the initial value for the accumulated result of the partition - this will typically be the neutral element for the seqop operator (e.g. Nil for list concatenation or 0 for summation)

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Definition Classes
    TraversableOnceGenTraversableOnce
  25. 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
    PartialFunctionFunction1
  26. def apply (f: (Node) ⇒ Boolean): NodeSeq

    Definition Classes
    NodeSeq
  27. def apply (i: Int): Node

    Selects an element by its index in the immutable sequence.

    Selects an element by its index in the immutable sequence.

    returns

    the element of this immutable sequence at index idx, where 0 indicates the first element.

    Definition Classes
    NodeSeqSeqLike → GenSeqLike → Function1
  28. def asInstanceOf [T0] : T0

    Cast the receiver object to be of type T0.

    Cast the receiver object to be of type T0.

    Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression 1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expression List(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.

    returns

    the receiver object.

    Attributes
    final
    Definition Classes
    Any
  29. def attribute (uri: String, key: String): Option[Seq[Node]]

    Convenience method, looks up a prefixed attribute in attributes of this node.

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

    uri

    namespace of queried attribute (may not be null).

    key

    of queried attribute.

    returns

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

    Attributes
    final
    Definition Classes
    Node
  30. def attribute (key: String): Option[Seq[Node]]

    Convenience method, looks up an unprefixed attribute in attributes of this node.

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

    key

    of queried attribute.

    returns

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

    Attributes
    final
    Definition Classes
    Node
  31. def attributes : Null

    always empty

    always empty

    returns

    all attributes of this node

    Attributes
    final
    Definition Classes
    SpecialNodeNode
  32. def basisForHashCode : Seq[Any]

    Definition Classes
    AtomNodeNodeSeq → Equality
  33. def buildString (sb: StringBuilder): StringBuilder

    Returns text, with some characters escaped according to the XML specification.

    Returns text, with some characters escaped according to the XML specification.

    sb

    ...

    returns

    ...

    Definition Classes
    AtomSpecialNode
  34. def buildString (stripComments: Boolean): String

    String representation of this node

    String representation of this node

    returns

    ...

    Definition Classes
    Node
  35. def canEqual (other: Any): Boolean

    We insist we're only equal to other xml.

    We insist we're only equal to other xml.Equality implementors, which heads off a lot of inconsistency up front.

    returns

    true if this instance can possibly equal that, otherwise false

    Definition Classes
    AtomNodeNodeSeq → Equality → IterableLikeEquals
  36. def child : Nil

    always empty

    always empty

    returns

    all children of this node

    Attributes
    final
    Definition Classes
    SpecialNodeNode
  37. def clone (): AnyRef

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  38. def collect [B] (pf: PartialFunction[Node, B]): immutable.Seq[B]

    [use case] Builds a new collection by applying a partial function to all elements of this immutable sequence on which the function is defined.

    [use case]

    Builds a new collection by applying a partial function to all elements of this immutable sequence on which the function is defined.

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the immutable sequence.

    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.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  39. def collect [B, That] (pf: PartialFunction[Node, B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Builds a new collection by applying a partial function to all elements of this immutable sequence on which the function is defined.

    Builds a new collection by applying a partial function to all elements of this immutable 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 immutable 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 → GenTraversableLike
  40. def collectFirst [B] (pf: PartialFunction[Node, B]): Option[B]

    Finds the first element of the immutable sequence for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the immutable sequence for which the given partial function is defined, and applies the partial function to it.

    Note: may not terminate for infinite-sized collections.

    pf

    the partial function

    returns

    an option value containing pf applied to the first value for which it is defined, or None if none exists.

    Definition Classes
    TraversableOnce
    Example:
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

  41. def combinations (n: Int): Iterator[NodeSeq]

    Iterates over combinations.

    Iterates over combinations.

    returns

    An Iterator which traverses the possible n-element combinations of this immutable sequence.

    Definition Classes
    SeqLike
    Example:
    1. "abbbc".combinations(2) = Iterator(ab, ac, bb, bc)

  42. def companion : GenericCompanion[Seq]

    The factory companion object that builds instances of class immutable.

    The factory companion object that builds instances of class immutable.Seq. (or its Iterable superclass where class immutable.Seq is not a Seq.)

    Definition Classes
    SeqSeqGenSeqIterableIterableGenIterableTraversableTraversableGenTraversableGenericTraversableTemplate
  43. def compose [A] (g: (A) ⇒ Int): (A) ⇒ Node

    Composes two instances of Function1 in a new Function1, with this function applied last.

    Composes two instances of Function1 in a new Function1, with this function applied last.

    A

    the type to which function g can be applied

    g

    a function A => T1

    returns

    a new function f such that f(x) == apply(g(x))

    Definition Classes
    Function1
  44. def contains (elem: Any): Boolean

    Tests whether this immutable sequence contains a given value as an element.

    Tests whether this immutable 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 immutable sequence has an element that is is equal (wrt ==) to elem, false otherwise.

    Definition Classes
    SeqLike
  45. def containsSlice [B] (that: Seq[B]): Boolean

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  46. def containsSlice [B] (that: GenSeq[B]): Boolean

    Tests whether this immutable sequence contains a given sequence as a slice.

    Tests whether this immutable 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 immutable sequence contains a slice with the same elements as that, otherwise false.

    Definition Classes
    SeqLike
  47. def copyToArray (xs: Array[Node], start: Int, len: Int): Unit

    [use case] Copies elements of this immutable sequence to an array.

    [use case]

    Copies elements of this immutable sequence to an array. Fills the given array xs with at most len elements of this immutable sequence, starting at position start. Copying will stop once either the end of the current immutable 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
    Definition Classes
    TraversableLike
  48. def copyToArray [B >: Node] (xs: Array[B], start: Int, len: Int): Unit

    Copies elements of this immutable sequence to an array.

    Copies elements of this immutable sequence to an array. Fills the given array xs with at most len elements of this immutable sequence, starting at position start. Copying will stop once either the end of the current immutable 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
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  49. def copyToArray (xs: Array[Node]): Unit

    [use case] Copies values of this immutable sequence to an array.

    [use case]

    Copies values of this immutable sequence to an array. Fills the given array xs with values of this immutable sequence. Copying will stop once either the end of the current immutable sequence is reached, or the end of the array is reached.

    xs

    the array to fill.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  50. def copyToArray [B >: Node] (xs: Array[B]): Unit

    Copies values of this immutable sequence to an array.

    Copies values of this immutable sequence to an array. Fills the given array xs with values of this immutable sequence. Copying will stop once either the end of the current immutable 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
    TraversableOnceGenTraversableOnce
  51. def copyToArray (xs: Array[Node], start: Int): Unit

    [use case] Copies values of this immutable sequence to an array.

    [use case]

    Copies values of this immutable sequence to an array. Fills the given array xs with values of this immutable sequence, beginning at index start. Copying will stop once either the end of the current immutable sequence is reached, or the end of the array is reached.

    xs

    the array to fill.

    start

    the starting index.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  52. def copyToArray [B >: Node] (xs: Array[B], start: Int): Unit

    Copies values of this immutable sequence to an array.

    Copies values of this immutable sequence to an array. Fills the given array xs with values of this immutable sequence, beginning at index start. Copying will stop once either the end of the current immutable 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
    TraversableOnceGenTraversableOnce
  53. def copyToBuffer [B >: Node] (dest: Buffer[B]): Unit

    Copies all elements of this immutable sequence to a buffer.

    Copies all elements of this immutable sequence to a buffer.

    Note: will not terminate for infinite-sized collections.

    dest

    The buffer to which elements are copied.

    Definition Classes
    TraversableOnce
  54. def corresponds [B] (that: Seq[B])(p: (Node, B) ⇒ Boolean): Boolean

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  55. def corresponds [B] (that: GenSeq[B])(p: (Node, B) ⇒ Boolean): Boolean

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

    Tests whether every element of this immutable 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 immutable sequence and y of that, otherwise false.

    Definition Classes
    SeqLike → GenSeqLike
  56. def count (p: (Node) ⇒ Boolean): Int

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

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

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    TraversableOnceGenTraversableOnce
  57. val data : A

  58. 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
  59. 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
  60. def diff [B >: Node] (that: Seq[B]): NodeSeq

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  61. def diff (that: Seq[Node]): immutable.Seq[Node]

    [use case] Computes the multiset difference between this immutable sequence and another sequence.

    [use case]

    Computes the multiset difference between this immutable sequence and another sequence.

    Note: will not terminate for infinite-sized collections.

    that

    the sequence of elements to remove

    returns

    a new collection of type That which contains all elements of this immutable 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
    Definition Classes
    SeqLike
  62. def diff [B >: Node] (that: GenSeq[B]): NodeSeq

    Computes the multiset difference between this immutable sequence and another sequence.

    Computes the multiset difference between this immutable sequence and another sequence.

    Note: will not terminate for infinite-sized collections.

    B

    the element type of the returned immutable sequence.

    that

    the sequence of elements to remove

    returns

    a new collection of type That which contains all elements of this immutable 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 → GenSeqLike
  63. def distinct : NodeSeq

    Builds a new immutable sequence from this immutable sequence without any duplicate elements.

    Builds a new immutable sequence from this immutable sequence without any duplicate elements.

    Note: will not terminate for infinite-sized collections.

    returns

    A new immutable sequence which contains the first occurrence of every element of this immutable sequence.

    Definition Classes
    SeqLike → GenSeqLike
  64. def doCollectNamespaces : Boolean

    The logic formerly found in typeTag$, as best I could infer it.

    The logic formerly found in typeTag$, as best I could infer it.

    Attributes
    final
    Definition Classes
    AtomNode
  65. def doTransform : Boolean

    Attributes
    final
    Definition Classes
    AtomNode
  66. 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 immutable sequence.

    returns

    a immutable sequence consisting of all elements of this immutable sequence except the first n ones, or else the empty immutable sequence, if this immutable sequence has less than n elements.

    Definition Classes
    IterableLikeTraversableLike → GenTraversableLike
  67. def dropRight (n: Int): NodeSeq

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

    The number of elements to take

    returns

    a immutable sequence consisting of all elements of this immutable sequence except the last n ones, or else the empty immutable sequence, if this immutable sequence has less than n elements.

    Definition Classes
    IterableLike
  68. 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 immutable sequence whose first element does not satisfy the predicate p.

    Definition Classes
    TraversableLike → GenTraversableLike
  69. def endsWith [B] (that: Seq[B]): Boolean

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  70. def endsWith [B] (that: GenSeq[B]): Boolean

    Tests whether this immutable sequence ends with the given sequence.

    Tests whether this immutable sequence ends with the given sequence.

    Note: will not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

    true if this immutable sequence has that as a suffix, false otherwise.

    Definition Classes
    SeqLike → GenSeqLike
  71. def eq (arg0: AnyRef): Boolean

    Tests whether the argument (arg0) is a reference to the receiver object (this).

    Tests whether the argument (arg0) is a reference to the receiver object (this).

    The eq method implements an equivalence relation on non-null instances of AnyRef, and has three additional properties:

    • It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false.
    • For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false.
    • null.eq(null) returns true.

    When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).

    returns

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

    Attributes
    final
    Definition Classes
    AnyRef
  72. def equals (other: Any): Boolean

    The universal equality method defined in AnyRef.

    The universal equality method defined in AnyRef.

    returns

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

    Definition Classes
    Equality → Equals → AnyRef → Any
  73. def exists (p: (Node) ⇒ Boolean): Boolean

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

    Tests whether a predicate holds for some of the elements of this immutable 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 immutable sequence, otherwise false.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  74. def filter (p: (Node) ⇒ Boolean): NodeSeq

    Selects all elements of this immutable sequence which satisfy a predicate.

    Selects all elements of this immutable sequence which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new immutable sequence consisting of all elements of this immutable sequence that satisfy the given predicate p. The order of the elements is preserved.

    Definition Classes
    TraversableLike → GenTraversableLike
  75. def filterNot (p: (Node) ⇒ Boolean): NodeSeq

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    TraversableLike → GenTraversableLike
  76. def finalize (): Unit

    Called by the garbage collector on the receiver object when there are no more references to the object.

    Called by the garbage collector on the receiver object when there are no more references to the object.

    The details of when and if the finalize method is invoked, as well as the interaction between finalize and non-local returns and exceptions, are all platform dependent.

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  77. def find (p: (Node) ⇒ Boolean): Option[Node]

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

    Finds the first element of the immutable 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 immutable sequence that satisfies p, or None if none exists.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  78. def flatMap [B] (f: (Node) ⇒ GenTraversableOnce[B]): immutable.Seq[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new collection of type That resulting from applying the given collection-valued function f to each element of this immutable sequence and concatenating the results.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  79. def flatMap [B, That] (f: (Node) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

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

    Builds a new collection by applying a function to all elements of this immutable 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 immutable sequence and concatenating the results.

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  80. def flatten [B] : immutable.Seq[B]

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

    [use case]

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

    B

    the type of the elements of each traversable collection.

    returns

    a new immutable sequence resulting from concatenating all element immutable sequences.

    Attributes
    abstract
    Definition Classes
    GenericTraversableTemplate
  81. def flatten [B] (implicit asTraversable: (Node) ⇒ TraversableOnce[B]): Traversable[B]

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

    Converts this immutable sequence of traversable collections into a immutable 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 immutable sequence is a Traversable.

    returns

    a new immutable sequence resulting from concatenating all element immutable sequences.

    Definition Classes
    TraversableGenericTraversableTemplate
    Annotations
    @bridge()
  82. def fold [A1 >: Node] (z: A1)(op: (A1, A1) ⇒ A1): A1

    Folds the elements of this sequence using the specified associative binary operator.

    Folds the elements of this sequence using the specified associative binary operator. The order in which the elements are reduced is unspecified and may be nondeterministic.

    Note this method has a different signature than the foldLeft and foldRight methods of the trait Traversable. The result of folding may only be a supertype of this parallel collection's type parameter T.

    z

    a neutral element for the fold operation, it may be added to the result an arbitrary number of times, not changing the result (e.g. Nil for list concatenation, 0 for addition, or 1 for multiplication)

    op

    a binary operator that must be associative

    returns

    the result of applying fold operator op between all the elements and z

    Definition Classes
    TraversableOnceGenTraversableOnce
  83. def foldLeft [B] (z: B)(op: (B, Node) ⇒ B): B

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

    Applies a binary operator to a start value and all elements of this immutable 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 immutable sequence, going left to right with the start value z on the left:

                op(...op(z, x,,1,,), x,,2,,, ..., x,,n,,)
    

    where x,,1,,, ..., x,,n,, are the elements of this immutable sequence.

    Definition Classes
    TraversableOnceGenTraversableOnce
  84. def foldRight [B] (z: B)(op: (Node, B) ⇒ B): B

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

    Applies a binary operator to all elements of this immutable 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 immutable sequence, going right to left with the start value z on the right:

                op(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))
    

    where x,,1,,, ..., x,,n,, are the elements of this immutable sequence.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  85. def forall (p: (Node) ⇒ Boolean): Boolean

    Tests whether a predicate holds for all elements of this immutable sequence.

    Tests whether a predicate holds for all elements of this immutable 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 immutable sequence, otherwise false.

    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  86. def foreach (f: (Node) ⇒ Unit): Unit

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

    [use case]

    Applies a function f to all elements of this immutable sequence.

    f

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

    Attributes
    abstract
    Definition Classes
    IterableLike
  87. def foreach [U] (f: (Node) ⇒ U): Unit

    Applies a function f to all elements of this immutable sequence.

    Applies a function f to all elements of this immutable 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
    IterableLikeTraversableLike → GenTraversableLike → TraversableOnceGenTraversableOnceFilterMonadic
  88. def genericBuilder [B] : Builder[B, Seq[B]]

    The generic builder that builds instances of immutable.

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

    Definition Classes
    GenericTraversableTemplate
  89. def getClass (): java.lang.Class[_ <: java.lang.Object]

    A representation that corresponds to the dynamic class of the receiver object.

    A representation that corresponds to the dynamic class of the receiver object.

    The nature of the representation is platform dependent.

    returns

    a representation that corresponds to the dynamic class of the receiver object.

    Attributes
    final
    Definition Classes
    AnyRef
  90. def getNamespace (pre: String): String

    Convenience method, same as scope.getURI(pre) but additionally checks if scope is null.

    Convenience method, same as scope.getURI(pre) but additionally checks if scope is null.

    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
  91. def groupBy [K] (f: (Node) ⇒ K): Map[K, NodeSeq]

    Partitions this immutable sequence into a map of immutable sequences according to some discriminator function.

    Partitions this immutable sequence into a map of immutable 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 immutable sequence.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to immutable 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 immutable sequence of those elements x for which f(x) equals k.

    Definition Classes
    TraversableLike → GenTraversableLike
  92. def grouped (size: Int): Iterator[NodeSeq]

    Partitions elements in fixed size immutable sequences.

    Partitions elements in fixed size immutable sequences.

    size

    the number of elements per group

    returns

    An iterator producing immutable sequences of size size, except the last will be truncated if the elements don't divide evenly.

    Definition Classes
    IterableLike
    See also

    Iterator#grouped

  93. def hasDefiniteSize : Boolean

    Tests whether this immutable sequence is known to have a finite size.

    Tests whether this immutable 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.

    returns

    true if this collection is known to have finite size, false otherwise.

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
  94. def hashCode (): Int

    It's be nice to make these final, but there are probably people out there subclassing the XML types, especially when it comes to equals.

    It's be nice to make these final, but there are probably people out there subclassing the XML types, especially when it comes to equals. However WE at least can pretend they are final since clearly individual classes cannot be trusted to maintain a semblance of order.

    returns

    the hash code value for this object.

    Definition Classes
    Equality → AnyRef → Any
  95. def head : Node

    Selects the first element of this immutable sequence.

    Selects the first element of this immutable sequence.

    returns

    the first element of this immutable sequence.

    Definition Classes
    IterableLike → GenIterableLike → TraversableLike → GenTraversableLike
  96. def headOption : Option[Node]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

    the first element of this immutable sequence if it is nonempty, None if it is empty.

    Definition Classes
    TraversableLike
  97. def indexOf (elem: Node, from: Int): Int

    [use case] Finds index of first occurrence of some value in this immutable sequence after or at some start index.

    [use case]

    Finds index of first occurrence of some value in this immutable sequence after or at some start index.

    elem

    the element value to search for.

    from

    the start index

    returns

    the index >= from of the first element of this immutable sequence that is equal (wrt ==) to elem, or -1, if none exists.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  98. def indexOf [B >: Node] (elem: B, from: Int): Int

    Finds index of first occurrence of some value in this immutable sequence after or at some start index.

    Finds index of first occurrence of some value in this immutable 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 immutable sequence that is equal (wrt ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
  99. def indexOf (elem: Node): Int

    [use case] Finds index of first occurrence of some value in this immutable sequence.

    [use case]

    Finds index of first occurrence of some value in this immutable sequence.

    elem

    the element value to search for.

    returns

    the index of the first element of this immutable sequence that is equal (wrt ==) to elem, or -1, if none exists.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  100. def indexOf [B >: Node] (elem: B): Int

    Finds index of first occurrence of some value in this immutable sequence.

    Finds index of first occurrence of some value in this immutable 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 immutable sequence that is equal (wrt ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
  101. def indexOfSlice [B >: Node] (that: Seq[B], from: Int): Int

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  102. def indexOfSlice [B >: Node] (that: GenSeq[B], from: Int): Int

    Finds first index after or at a start index where this immutable sequence contains a given sequence as a slice.

    Finds first index after or at a start index where this immutable 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 immutable sequence starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

    Definition Classes
    SeqLike
  103. def indexOfSlice [B >: Node] (that: Seq[B]): Int

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  104. def indexOfSlice [B >: Node] (that: GenSeq[B]): Int

    Finds first index where this immutable sequence contains a given sequence as a slice.

    Finds first index where this immutable 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 immutable sequence starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

    Definition Classes
    SeqLike
  105. 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 immutable sequence that satisfies the predicate p, or -1, if none exists.

    Definition Classes
    SeqLike → GenSeqLike
  106. 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 immutable sequence that satisfies the predicate p, or -1, if none exists.

    Definition Classes
    GenSeqLike
  107. def indices : Range

    Produces the range of all indices of this sequence.

    Produces the range of all indices of this sequence.

    returns

    a Range value from 0 to one less than the length of this immutable sequence.

    Definition Classes
    SeqLike
  108. def init : NodeSeq

    Selects all elements except the last.

    Selects all elements except the last.

    returns

    a immutable sequence consisting of all elements of this immutable sequence except the last one.

    Definition Classes
    TraversableLike
  109. def inits : Iterator[NodeSeq]

    Iterates over the inits of this immutable sequence.

    Iterates over the inits of this immutable sequence. The first value will be this immutable sequence and the final one will be an empty immutable sequence, with the intervening values the results of successive applications of init.

    returns

    an iterator over all the inits of this immutable sequence

    Definition Classes
    TraversableLike
    Example:
    1. List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)

  110. def intersect [B >: Node] (that: Seq[B]): NodeSeq

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  111. def intersect (that: Seq[Node]): immutable.Seq[Node]

    [use case] Computes the multiset intersection between this immutable sequence and another sequence.

    [use case]

    Computes the multiset intersection between this immutable sequence and another sequence.

    Note: may not terminate for infinite-sized collections.

    that

    the sequence of elements to intersect with.

    returns

    a new collection of type That which contains all elements of this immutable 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
    Definition Classes
    SeqLike
  112. def intersect [B >: Node] (that: GenSeq[B]): NodeSeq

    Computes the multiset intersection between this immutable sequence and another sequence.

    Computes the multiset intersection between this immutable sequence and another sequence.

    Note: may not terminate for infinite-sized collections.

    B

    the element type of the returned immutable sequence.

    that

    the sequence of elements to intersect with.

    returns

    a new collection of type That which contains all elements of this immutable 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 → GenSeqLike
  113. def isAtom : Boolean

    used internally.

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

    Definition Classes
    Node
  114. def isDefinedAt (idx: Int): Boolean

    Tests whether this immutable sequence contains given index.

    Tests whether this immutable 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 immutable sequence contains an element at position idx, false otherwise.

    Definition Classes
    GenSeqLike
  115. def isEmpty : Boolean

    Tests whether the immutable sequence is empty.

    Tests whether the immutable sequence is empty.

    returns

    true if the immutable sequence contains no elements, false otherwise.

    Definition Classes
    IterableLike → GenIterableLike → TraversableLikeTraversableOnceGenTraversableOnce
  116. def isInstanceOf [T0] : Boolean

    Test whether the dynamic type of the receiver object is T0.

    Test whether the dynamic type of the receiver object is T0.

    Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression 1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the specified type.

    returns

    true if the receiver object is an instance of erasure of type T0; false otherwise.

    Attributes
    final
    Definition Classes
    Any
  117. def isTraversableAgain : Boolean

    Tests whether this immutable sequence can be repeatedly traversed.

    Tests whether this immutable sequence can be repeatedly traversed.

    returns

    true

    Attributes
    final
    Definition Classes
    GenTraversableLike → GenTraversableOnce
  118. 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.

    returns

    the new iterator

    Definition Classes
    NodeSeqIterableLike → GenIterableLike
  119. def label : String

    label of this node.

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

    Definition Classes
    AtomNode
  120. def last : Node

    Selects the last element.

    Selects the last element.

    returns

    The last element of this immutable sequence.

    Definition Classes
    TraversableLike
  121. def lastIndexOf (elem: Node, end: Int): Int

    [use case] Finds index of last occurrence of some value in this immutable sequence before or at a given end index.

    [use case]

    Finds index of last occurrence of some value in this immutable sequence before or at a given end index.

    elem

    the element value to search for.

    end

    the end index.

    returns

    the index <= end of the last element of this immutable sequence that is equal (wrt ==) to elem, or -1, if none exists.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  122. def lastIndexOf [B >: Node] (elem: B, end: Int): Int

    Finds index of last occurrence of some value in this immutable sequence before or at a given end index.

    Finds index of last occurrence of some value in this immutable 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 immutable sequence that is equal (wrt ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
  123. def lastIndexOf (elem: Node): Int

    [use case] Finds index of last occurrence of some value in this immutable sequence.

    [use case]

    Finds index of last occurrence of some value in this immutable sequence.

    elem

    the element value to search for.

    returns

    the index of the last element of this immutable sequence that is equal (wrt ==) to elem, or -1, if none exists.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  124. def lastIndexOf [B >: Node] (elem: B): Int

    Finds index of last occurrence of some value in this immutable sequence.

    Finds index of last occurrence of some value in this immutable 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 immutable sequence that is equal (wrt ==) to elem, or -1, if none exists.

    Definition Classes
    GenSeqLike
  125. def lastIndexOfSlice [B >: Node] (that: Seq[B], end: Int): Int

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  126. def lastIndexOfSlice [B >: Node] (that: GenSeq[B], end: Int): Int

    Finds last index before or at a given end index where this immutable sequence contains a given sequence as a slice.

    Finds last index before or at a given end index where this immutable sequence contains a given sequence as a slice.

    that

    the sequence to test

    end

    the end index

    returns

    the last index <= end such that the elements of this immutable sequence starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

    Definition Classes
    SeqLike
  127. def lastIndexOfSlice [B >: Node] (that: Seq[B]): Int

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  128. def lastIndexOfSlice [B >: Node] (that: GenSeq[B]): Int

    Finds last index where this immutable sequence contains a given sequence as a slice.

    Finds last index where this immutable 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 immutable sequence starting a this index match the elements of sequence that, or -1 of no such subsequence exists.

    Definition Classes
    SeqLike
  129. 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 immutable sequence that satisfies the predicate p, or -1, if none exists.

    Definition Classes
    SeqLike → GenSeqLike
  130. 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 immutable sequence that satisfies the predicate p, or -1, if none exists.

    Definition Classes
    GenSeqLike
  131. def lastOption : Option[Node]

    Optionally selects the last element.

    Optionally selects the last element.

    returns

    the last element of this immutable sequence$ if it is nonempty, None if it is empty.

    Definition Classes
    TraversableLike
  132. def length : Int

    The length of the immutable sequence.

    The length of the immutable sequence.

    Note: will not terminate for infinite-sized collections.

    Note: xs.length and xs.size yield the same result.

    returns

    the number of elements in this immutable sequence.

    Definition Classes
    NodeSeqSeqLike → GenSeqLike
  133. def lengthCompare (len: Int): Int

    Compares the length of this immutable sequence to a test value.

    Compares the length of this immutable 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
  134. 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.

    returns

    a function that takes an argument x to Some(this(x)) if this is defined for x, and to None otherwise.

    Definition Classes
    PartialFunction
    See also

    Function.unlift

  135. def map [B] (f: (Node) ⇒ B): immutable.Seq[B]

    [use case] Builds a new collection by applying a function to all elements of this immutable sequence.

    [use case]

    Builds a new collection by applying a function to all elements of this immutable sequence.

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new collection of type That resulting from applying the given function f to each element of this immutable sequence and collecting the results.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  136. def map [B, That] (f: (Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Builds a new collection by applying a function to all elements of this immutable sequence.

    Builds a new collection by applying a function to all elements of this immutable 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 immutable sequence and collecting the results.

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  137. def max : Node

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this immutable sequence with respect to the ordering cmp.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  138. def max [B >: Node] (implicit 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 immutable sequence with respect to the ordering cmp.

    Definition Classes
    TraversableOnceGenTraversableOnce
  139. def maxBy [B] (f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node

    Definition Classes
    TraversableOnceGenTraversableOnce
  140. def min : Node

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this immutable sequence with respect to the ordering cmp.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  141. def min [B >: Node] (implicit 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 immutable sequence with respect to the ordering cmp.

    Definition Classes
    TraversableOnceGenTraversableOnce
  142. def minBy [B] (f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node

    Definition Classes
    TraversableOnceGenTraversableOnce
  143. def mkString : String

    Displays all elements of this immutable sequence in a string.

    Displays all elements of this immutable sequence in a string.

    returns

    a string representation of this immutable sequence. In the resulting string the string representations (w.r.t. the method toString) of all elements of this immutable sequence follow each other without any separator string.

    Definition Classes
    TraversableOnceGenTraversableOnce
  144. def mkString (sep: String): String

    Displays all elements of this immutable sequence in a string using a separator string.

    Displays all elements of this immutable sequence in a string using a separator string.

    sep

    the separator string.

    returns

    a string representation of this immutable sequence. In the resulting string the string representations (w.r.t. the method toString) of all elements of this immutable sequence are separated by the string sep.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("|") = "1|2|3"

  145. def mkString (start: String, sep: String, end: String): String

    Displays all elements of this immutable sequence in a string using start, end, and separator strings.

    Displays all elements of this immutable 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 immutable 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 immutable sequence are separated by the string sep.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"

  146. 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
  147. def namespace : Null

    always Node.

    always Node.EmptyNamespace

    Attributes
    final
    Definition Classes
    SpecialNodeNode
  148. def ne (arg0: AnyRef): Boolean

    Equivalent to !(this eq that).

    Equivalent to !(this eq that).

    returns

    true if the argument is not a reference to the receiver object; false otherwise.

    Attributes
    final
    Definition Classes
    AnyRef
  149. def newBuilder : Builder[Node, NodeSeq]

    Creates a list buffer as builder for this class

    Creates a list buffer as builder for this class

    Attributes
    protected[this]
    Definition Classes
    NodeSeqGenericTraversableTemplateTraversableLikeHasNewBuilder
  150. def nonEmpty : Boolean

    Tests whether the immutable sequence is not empty.

    Tests whether the immutable sequence is not empty.

    returns

    true if the immutable sequence contains at least one element, false otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  151. def nonEmptyChildren : Seq[Node]

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

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

    Definition Classes
    Node
  152. def notify (): Unit

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Attributes
    final
    Definition Classes
    AnyRef
  153. def notifyAll (): Unit

    Wakes up all threads that are waiting on the receiver object's monitor.

    Wakes up all threads that are waiting on the receiver object's monitor.

    Attributes
    final
    Definition Classes
    AnyRef
  154. 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
  155. def padTo (len: Int, elem: Node): immutable.Seq[Node]

    [use case] Appends an element value to this immutable sequence until a given target length is reached.

    [use case]

    Appends an element value to this immutable sequence until a given target length is reached.

    len

    the target length

    elem

    the padding value

    returns

    a new collection of type That consisting of all elements of this immutable sequence followed by the minimal number of occurrences of elem so that the resulting collection has a length of at least len.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  156. def padTo [B >: Node, That] (len: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Appends an element value to this immutable sequence until a given target length is reached.

    Appends an element value to this immutable sequence until a given target length is reached.

    B

    the element type of the returned immutable 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 immutable 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 → GenSeqLike
  157. def par : ParSeq[Node]

    Returns a parallel implementation of this collection.

    Returns a parallel implementation of this collection.

    For most collection types, this method creates a new parallel collection by copying all the elements. For these collection, par takes linear time. Mutable collections in this category do not produce a mutable parallel collection that has the same underlying dataset, so changes in one collection will not be reflected in the other one.

    Specific collections (e.g. ParArray or mutable.ParHashMap) override this default behaviour by creating a parallel collection which shares the same underlying dataset. For these collections, par takes constant or sublinear time.

    All parallel collections return a reference to themselves.

    returns

    a parallel implementation of this collection

    Definition Classes
    Parallelizable
  158. def parCombiner : Combiner[Node, ParSeq[Node]]

    The default par implementation uses the combiner provided by this method to create a new parallel collection.

    The default par implementation uses the combiner provided by this method to create a new parallel collection.

    returns

    a combiner for the parallel collection of type ParRepr

    Attributes
    protected[this]
    Definition Classes
    SeqSeqLikeIterableTraversableLikeParallelizable
  159. def partition (p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq)

    Partitions this immutable sequence in two immutable sequences according to a predicate.

    Partitions this immutable sequence in two immutable sequences according to a predicate.

    p

    the predicate on which to partition.

    returns

    a pair of immutable sequences: the first immutable sequence consists of all elements that satisfy the predicate p and the second immutable sequence consists of all elements that don't. The relative order of the elements in the resulting immutable sequences is the same as in the original immutable sequence.

    Definition Classes
    TraversableLike → GenTraversableLike
  160. def patch [B >: Node, That] (from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  161. def patch (from: Int, that: GenSeq[Node], replaced: Int): immutable.Seq[Node]

    [use case] Produces a new immutable sequence where a slice of elements in this immutable sequence is replaced by another sequence.

    [use case]

    Produces a new immutable sequence where a slice of elements in this immutable sequence is replaced by another sequence.

    from

    the index of the first replaced element

    replaced

    the number of elements to drop in the original immutable sequence

    returns

    a new immutable sequence consisting of all elements of this immutable sequence except that replaced elements starting from from are replaced by patch.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  162. def patch [B >: Node, That] (from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Produces a new immutable sequence where a slice of elements in this immutable sequence is replaced by another sequence.

    Produces a new immutable sequence where a slice of elements in this immutable sequence is replaced by another sequence.

    B

    the element type of the returned immutable 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 immutable 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 immutable sequence consisting of all elements of this immutable sequence except that replaced elements starting from from are replaced by patch.

    Definition Classes
    SeqLike → GenSeqLike
  163. def permutations : Iterator[NodeSeq]

    Iterates over distinct permutations.

    Iterates over distinct permutations.

    returns

    An Iterator which traverses the distinct permutations of this immutable sequence.

    Definition Classes
    SeqLike
    Example:
    1. "abb".permutations = Iterator(abb, bab, bba)

  164. def prefix : String

    prefix of this node

    prefix of this node

    Definition Classes
    Node
  165. def prefixLength (p: (Node) ⇒ Boolean): Int

    Returns the length of the longest prefix whose elements all satisfy some predicate.

    Returns the length of the longest prefix whose elements all satisfy some predicate.

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    returns

    the length of the longest prefix of this immutable sequence such that every element of the segment satisfies the predicate p.

    Definition Classes
    GenSeqLike
  166. def product : Node

    [use case] Multiplies up the elements of this collection.

    [use case]

    Multiplies up the elements of this collection.

    returns

    the product of all elements of this immutable sequence with respect to the * operator in num.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  167. def product [B >: Node] (implicit 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 immutable sequence with respect to the * operator in num.

    Definition Classes
    TraversableOnceGenTraversableOnce
  168. def reduce [A1 >: Node] (op: (A1, A1) ⇒ A1): A1

    Reduces the elements of this sequence using the specified associative binary operator.

    Reduces the elements of this sequence using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    Note this method has a different signature than the reduceLeft and reduceRight methods of the trait Traversable. The result of reducing may only be a supertype of this parallel collection's type parameter T.

    op

    A binary operator that must be associative.

    returns

    The result of applying reduce operator op between all the elements if the collection is nonempty.

    Definition Classes
    TraversableOnceGenTraversableOnce
  169. def reduceLeft [B >: Node] (op: (B, Node) ⇒ B): B

    Definition Classes
    TraversableOnce
  170. def reduceLeftOption [B >: Node] (op: (B, Node) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this immutable sequence, going left to right.

    Optionally applies a binary operator to all elements of this immutable 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 immutable sequence is nonempty, None otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  171. def reduceOption [A1 >: Node] (op: (A1, A1) ⇒ A1): Option[A1]

    Optionally reduces the elements of this sequence using the specified associative binary operator.

    Optionally reduces the elements of this sequence using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    Note this method has a different signature than the reduceLeftOption and reduceRightOption methods of the trait Traversable. The result of reducing may only be a supertype of this parallel collection's type parameter T.

    op

    A binary operator that must be associative.

    returns

    An option value containing result of applying reduce operator op between all the elements if the collection is nonempty, and None otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  172. def reduceRight [B >: Node] (op: (Node, B) ⇒ B): B

    Applies a binary operator to all elements of this immutable sequence, going right to left.

    Applies a binary operator to all elements of this immutable 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 immutable sequence, going right to left:

                op(x,,1,,, op(x,,2,,, ..., op(x,,n-1,,, x,,n,,)...))
    

    where x,,1,,, ..., x,,n,, are the elements of this immutable sequence.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  173. def reduceRightOption [B >: Node] (op: (Node, B) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this immutable sequence, going right to left.

    Optionally applies a binary operator to all elements of this immutable 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 immutable sequence is nonempty, None otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  174. def repr : NodeSeq

    The collection of type immutable sequence underlying this TraversableLike object.

    The collection of type immutable sequence underlying this TraversableLike object. By default this is implemented as the TraversableLike object itself, but this can be overridden.

    Definition Classes
    TraversableLike → GenTraversableLike
  175. def reverse : NodeSeq

    Returns new immutable sequence wih elements in reversed order.

    Returns new immutable sequence wih elements in reversed order.

    Note: will not terminate for infinite-sized collections.

    returns

    A new immutable sequence with all elements of this immutable sequence in reversed order.

    Definition Classes
    SeqLike → GenSeqLike
  176. 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.

    returns

    an iterator yielding the elements of this immutable sequence in reversed order

    Definition Classes
    SeqLike
  177. def reverseMap [B] (f: (Node) ⇒ B): immutable.Seq[B]

    [use case] Builds a new collection by applying a function to all elements of this immutable sequence and collecting the results in reversed order.

    [use case]

    Builds a new collection by applying a function to all elements of this immutable sequence and collecting the results in reversed order.

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new collection of type That resulting from applying the given function f to each element of this immutable sequence and collecting the results in reversed order.

    Note: xs.reverseMap(f) is the same as xs.reverse.map(f) but might be more efficient.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  178. def reverseMap [B, That] (f: (Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Builds a new collection by applying a function to all elements of this immutable sequence and collecting the results in reversed order.

    Builds a new collection by applying a function to all elements of this immutable 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 immutable sequence and collecting the results in reversed order.

    Definition Classes
    SeqLike → GenSeqLike
  179. def reversed : List[Node]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  180. def sameElements [B >: Node] (that: Iterable[B]): Boolean

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  181. def sameElements (that: GenIterable[Node]): Boolean

    [use case] Checks if the other iterable collection contains the same elements in the same order as this immutable sequence.

    [use case]

    Checks if the other iterable collection contains the same elements in the same order as this immutable sequence.

    that

    the collection to compare with.

    returns

    true, if both collections contain the same elements in the same order, false otherwise.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  182. def sameElements [B >: Node] (that: GenIterable[B]): Boolean

    Checks if the other iterable collection contains the same elements in the same order as this immutable sequence.

    Checks if the other iterable collection contains the same elements in the same order as this immutable 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 → GenIterableLike
  183. def scan [B >: Node, That] (z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[NodeSeq, B, That]): That

    Computes a prefix scan of the elements of the collection.

    Computes a prefix scan of the elements of the collection.

    Note: The neutral element z may be applied more than once.

    B

    element type of the resulting collection

    That

    type of the resulting collection

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    cbf

    combiner factory which provides a combiner

    returns

    a new immutable sequence containing the prefix scan of the elements in this immutable sequence

    Definition Classes
    TraversableLike → GenTraversableLike
  184. def scanLeft [B, That] (z: B)(op: (B, Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Produces a collection containing cummulative results of applying the operator going left to right.

    Produces a collection containing cummulative results of applying the operator going left to right.

    Note: will not terminate for infinite-sized collections.

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the 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

    collection with intermediate results

    Definition Classes
    TraversableLike → GenTraversableLike
  185. def scanRight [B, That] (z: B)(op: (Node, B) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Produces a collection containing cummulative results of applying the operator going right to left.

    Produces a collection containing cummulative results of applying the operator going right to left. The head of the collection is the last cummulative result.

    Note: will not terminate for infinite-sized collections.

    Example:

       List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)
    
    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the 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

    collection with intermediate results

    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    "This scanRight definition has changed in 2.9.\n" + "The previous behavior can be reproduced with scanRight.reverse."

  186. 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
  187. def segmentLength (p: (Node) ⇒ Boolean, from: Int): Int

    Computes length of longest segment whose elements all satisfy some predicate.

    Computes length of longest segment whose elements all satisfy some predicate.

    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 immutable sequence starting from index from such that every element of the segment satisfies the predicate p.

    Definition Classes
    SeqLike → GenSeqLike
  188. def seq : Seq[Node]

    A version of this collection with all of the operations implemented sequentially (i.

    A version of this collection with all of the operations implemented sequentially (i.e. in a single-threaded manner).

    This method returns a reference to this collection. In parallel collections, it is redefined to return a sequential implementation of this collection. In both cases, it has O(1) complexity.

    returns

    a sequential view of the collection.

    Definition Classes
    SeqSeqGenSeqIterableIterableGenIterableTraversableTraversableGenTraversableParallelizableTraversableOnceGenTraversableOnce
  189. def size : Int

    The size of this immutable sequence, equivalent to length.

    The size of this immutable sequence, equivalent to length.

    Note: will not terminate for infinite-sized collections.

    returns

    the number of elements in this immutable sequence.

    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnceGenTraversableOnce
  190. def slice (from: Int, until: Int): NodeSeq

    Selects an interval of elements.

    Selects an interval of elements. The returned collection is made up of all elements x which satisfy the invariant:

       from <= indexOf(x) < until
    
    from

    the lowest index to include from this immutable sequence.

    until

    the highest index to EXCLUDE from this immutable sequence.

    returns

    a immutable sequence containing the elements greater than or equal to index from extending up to (but not including) index until of this immutable sequence.

    Definition Classes
    IterableLikeTraversableLike → GenTraversableLike
  191. def sliding [B >: Node] (size: Int, step: Int): Iterator[NodeSeq]

    Definition Classes
    IterableLike
  192. 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 immutable sequences of size size, except the last and the only element will be truncated if there are fewer elements than size.

    Definition Classes
    IterableLike
    See also

    Iterator#sliding

  193. def sortBy [B] (f: (Node) ⇒ B)(implicit ord: Ordering[B]): NodeSeq

    Sorts this immutable.

    Sorts this immutable.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 immutable sequence consisting of the elements of this immutable sequence sorted according to the ordering where x < y if ord.lt(f(x), f(y)).

    Definition Classes
    SeqLike
    Example:
    1.    val words = "The quick brown fox jumped over the lazy dog".split(' ')
         // this works because scala.Ordering will implicitly provide an Ordering[Tuple2[Int, Char]]
         words.sortBy(x => (x.length, x.head))
         res0: Array[String] = Array(The, dog, fox, the, lazy, over, brown, quick, jumped)
      
    See also

    scala.math.Ordering

    Note: will not terminate for infinite-sized collections.

  194. def sortWith (lt: (Node, Node) ⇒ Boolean): NodeSeq

    Sorts this immutable sequence according to a comparison function.

    Sorts this immutable 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 immutable sequence consisting of the elements of this immutable sequence sorted according to the comparison function lt.

    Definition Classes
    SeqLike
    Example:
    1.    List("Steve", "Tom", "John", "Bob").sortWith(_.compareTo(_) < 0) =
         List("Bob", "John", "Steve", "Tom")
      
  195. def sorted [B >: Node] (implicit ord: Ordering[B]): NodeSeq

    Sorts this immutable sequence according to an Ordering.

    Sorts this immutable 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 immutable sequence consisting of the elements of this immutable sequence sorted according to the ordering ord.

    Definition Classes
    SeqLike
    See also

    scala.math.Ordering

  196. def span (p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq)

    Splits this immutable sequence into a prefix/suffix pair according to a predicate.

    Splits this immutable 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 immutable sequence whose elements all satisfy p, and the rest of this immutable sequence.

    Definition Classes
    TraversableLike → GenTraversableLike
  197. def splitAt (n: Int): (NodeSeq, NodeSeq)

    Splits this immutable sequence into two at a given position.

    Splits this immutable 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 immutable sequences consisting of the first n elements of this immutable sequence, and the other elements.

    Definition Classes
    TraversableLike → GenTraversableLike
  198. def startsWith [B] (that: Seq[B], offset: Int): Boolean

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  199. def startsWith [B] (that: GenSeq[B], offset: Int): Boolean

    Tests whether this immutable sequence contains the given sequence at a given index.

    Tests whether this immutable 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 immutable sequence at index offset, otherwise false.

    Definition Classes
    SeqLike → GenSeqLike
  200. def startsWith [B] (that: Seq[B]): Boolean

    Definition Classes
    GenSeqLike
    Annotations
    @bridge()
  201. def startsWith [B] (that: GenSeq[B]): Boolean

    Tests whether this immutable sequence starts with the given sequence.

    Tests whether this immutable sequence starts with the given sequence.

    that

    the sequence to test

    returns

    true if this collection has that as a prefix, false otherwise.

    Definition Classes
    GenSeqLike
  202. def strict_!= (other: Equality): Boolean

    Definition Classes
    Equality
  203. def strict_== (other: Equality): Boolean

    Definition Classes
    AtomNodeNodeSeq → Equality
  204. def stringPrefix : String

    Defines the prefix of this object's toString representation.

    Defines the prefix of this object's toString representation.

    returns

    a string representation which starts the result of toString applied to this immutable sequence. By default the string prefix is the simple name of the collection class immutable sequence.

    Definition Classes
    TraversableLike → GenTraversableLike
  205. def sum : Node

    [use case] Sums up the elements of this collection.

    [use case]

    Sums up the elements of this collection.

    returns

    the sum of all elements of this immutable sequence with respect to the + operator in num.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  206. def sum [B >: Node] (implicit 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 immutable sequence with respect to the + operator in num.

    Definition Classes
    TraversableOnceGenTraversableOnce
  207. def synchronized [T0] (arg0: ⇒ T0): T0

    Attributes
    final
    Definition Classes
    AnyRef
  208. def tail : NodeSeq

    Selects all elements except the first.

    Selects all elements except the first.

    returns

    a immutable sequence consisting of all elements of this immutable sequence except the first one.

    Definition Classes
    TraversableLike → GenTraversableLike
  209. def tails : Iterator[NodeSeq]

    Iterates over the tails of this immutable sequence.

    Iterates over the tails of this immutable sequence. The first value will be this immutable sequence and the final one will be an empty immutable sequence, with the intervening values the results of successive applications of tail.

    returns

    an iterator over all the tails of this immutable sequence

    Definition Classes
    TraversableLike
    Example:
    1. List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)

  210. def take (n: Int): NodeSeq

    Selects first n elements.

    Selects first n elements.

    n

    Tt number of elements to take from this immutable sequence.

    returns

    a immutable sequence consisting only of the first n elements of this immutable sequence, or else the whole immutable sequence, if it has less than n elements.

    Definition Classes
    IterableLikeTraversableLike → GenTraversableLike
  211. def takeRight (n: Int): NodeSeq

    Selects last n elements.

    Selects last n elements.

    n

    the number of elements to take

    returns

    a immutable sequence consisting only of the last n elements of this immutable sequence, or else the whole immutable sequence, if it has less than n elements.

    Definition Classes
    IterableLike
  212. 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 immutable sequence whose elements all satisfy the predicate p.

    Definition Classes
    IterableLikeTraversableLike → GenTraversableLike
  213. 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 {
    ^
    
    Definition Classes
    AtomNodeNodeSeq
  214. def theSeq : Seq[Node]

    returns a sequence consisting of only this node

    returns a sequence consisting of only this node

    Definition Classes
    NodeNodeSeq
  215. def thisCollection : Seq[Node]

    The underlying collection seen as an instance of immutable.Seq.

    The underlying collection seen as an instance of immutable.Seq. By default this is implemented as the current collection object itself, but this can be overridden.

    Attributes
    protected[this]
    Definition Classes
    SeqLikeIterableLikeTraversableLike
  216. def toArray : Array[Node]

    [use case] Converts this immutable sequence to an array.

    [use case]

    Converts this immutable sequence to an array.

    Note: will not terminate for infinite-sized collections.

    returns

    an array containing all elements of this immutable sequence.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  217. def toArray [B >: Node] (implicit arg0: ClassManifest[B]): Array[B]

    Converts this immutable sequence to an array.

    Converts this immutable 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 immutable sequence.

    Definition Classes
    TraversableOnceGenTraversableOnce
  218. def toBuffer [B >: Node] : Buffer[B]

    Converts this immutable sequence to a mutable buffer.

    Converts this immutable sequence to a mutable buffer.

    Note: will not terminate for infinite-sized collections.

    returns

    a buffer containing all elements of this immutable sequence.

    Definition Classes
    TraversableOnceGenTraversableOnce
  219. def toCollection (repr: NodeSeq): Seq[Node]

    A conversion from collections of type Repr to immutable.Seq objects.

    A conversion from collections of type Repr to immutable.Seq objects. By default this is implemented as just a cast, but this can be overridden.

    Attributes
    protected[this]
    Definition Classes
    SeqLikeIterableLikeTraversableLike
  220. def toIndexedSeq [B >: Node] : IndexedSeq[B]

    Converts this immutable sequence to an indexed sequence.

    Converts this immutable sequence to an indexed sequence.

    Note: will not terminate for infinite-sized collections.

    returns

    an indexed sequence containing all elements of this immutable sequence.

    Definition Classes
    TraversableOnceGenTraversableOnce
  221. def toIterable : Iterable[Node]

    Converts this immutable sequence to an iterable collection.

    Converts this immutable sequence to an iterable collection. Note that the choice of target Iterable is lazy in this default implementation as this TraversableOnce may be lazy and unevaluated (i.e. it may be an iterator which is only traversable once).

    Note: will not terminate for infinite-sized collections.

    returns

    an Iterable containing all elements of this immutable sequence.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  222. def toIterator : Iterator[Node]

    Returns an Iterator over the elements in this immutable sequence.

    Returns an Iterator over the elements in this immutable sequence. Will return the same Iterator if this instance is already an Iterator.

    Note: will not terminate for infinite-sized collections.

    returns

    an Iterator containing all elements of this immutable sequence.

    Definition Classes
    TraversableLikeGenTraversableOnce
  223. def toList : List[Node]

    Converts this immutable sequence to a list.

    Converts this immutable sequence to a list.

    Note: will not terminate for infinite-sized collections.

    returns

    a list containing all elements of this immutable sequence.

    Definition Classes
    TraversableOnceGenTraversableOnce
  224. def toMap [T, U] : Map[T, U]

    [use case] Converts this immutable sequence to a map.

    [use case]

    Converts this immutable sequence to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) 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.

    returns

    a map containing all elements of this immutable sequence.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  225. def toMap [T, U] (implicit ev: <:<[Node, (T, U)]): Map[T, U]

    Converts this immutable sequence to a map.

    Converts this immutable sequence to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) 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.

    returns

    a map containing all elements of this immutable sequence.

    Definition Classes
    TraversableOnceGenTraversableOnce
  226. def toSeq : Seq[Node]

    Converts this immutable sequence to a sequence.

    Converts this immutable sequence to a sequence.

    Note: will not terminate for infinite-sized collections.

    Overridden for efficiency.

    returns

    a sequence containing all elements of this immutable sequence.

    Definition Classes
    SeqSeqLike → GenSeqLike → TraversableOnceGenTraversableOnce
  227. def toSet [B >: Node] : Set[B]

    Converts this immutable sequence to a set.

    Converts this immutable sequence to a set.

    Note: will not terminate for infinite-sized collections.

    returns

    a set containing all elements of this immutable sequence.

    Definition Classes
    TraversableOnceGenTraversableOnce
  228. def toStream : Stream[Node]

    Converts this immutable sequence to a stream.

    Converts this immutable sequence to a stream.

    Note: will not terminate for infinite-sized collections.

    returns

    a stream containing all elements of this immutable sequence.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableOnce
  229. def toString (): String

    Same as toString(false).

    Same as toString(false).

    returns

    a string representation of this collection. By default this string consists of the stringPrefix of this immutable sequence, followed by all elements separated by commas and enclosed in parentheses.

    Definition Classes
    NodeNodeSeqSeqLikeFunction1TraversableLike → AnyRef → Any
    See also

    toString(Boolean)

  230. def toTraversable : Traversable[Node]

    Converts this immutable sequence to an unspecified Traversable.

    Converts this immutable sequence to an unspecified Traversable. Will return the same collection if this instance is already Traversable.

    Note: will not terminate for infinite-sized collections.

    returns

    a Traversable containing all elements of this immutable sequence.

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
  231. def transpose [B] (implicit asTraversable: (Node) ⇒ TraversableOnce[B]): Traversable[Traversable[B]]

    Transposes this immutable sequence of traversable collections into a immutable sequence of immutable sequences.

    Transposes this immutable sequence of traversable collections into a immutable sequence of immutable sequences.

    B

    the type of the elements of each traversable collection.

    asTraversable

    an implicit conversion which asserts that the element type of this immutable sequence is a Traversable.

    returns

    a two-dimensional immutable sequence of immutable sequences which has as nth row the nth column of this immutable sequence.

    Definition Classes
    TraversableGenericTraversableTemplate
    Annotations
    @bridge()
  232. def union (that: Seq[Node]): immutable.Seq[Node]

    [use case] Produces a new sequence which contains all elements of this immutable sequence and also all elements of a given sequence.

    [use case]

    Produces a new sequence which contains all elements of this immutable 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 collection of type That which contains all elements of this immutable sequence followed by all elements of that.

    Attributes
    abstract
    Definition Classes
    SeqLike
  233. def union [B >: Node, That] (that: GenSeq[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Produces a new sequence which contains all elements of this immutable sequence and also all elements of a given sequence.

    Produces a new sequence which contains all elements of this immutable 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-part 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 immutable 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 immutable sequence followed by all elements of that.

    Definition Classes
    SeqLike → GenSeqLike
  234. def union [B >: Node, That] (that: Seq[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    Definition Classes
    GenSeqLike
    Annotations
    @bridge()
  235. def unzip [A1, A2] (implicit asPair: (Node) ⇒ (A1, A2)): (Seq[A1], Seq[A2])

    Converts this immutable sequence of pairs into two collections of the first and second half of each pair.

    Converts this immutable sequence of pairs into two collections of the first and second half of each pair.

    asPair

    an implicit conversion which asserts that the element type of this immutable sequence is a pair.

    returns

    a pair immutable sequences, containing the first, respectively second half of each element pair of this immutable sequence.

    Definition Classes
    GenericTraversableTemplate
  236. def unzip3 [A1, A2, A3] (implicit asTriple: (Node) ⇒ (A1, A2, A3)): (Seq[A1], Seq[A2], Seq[A3])

    Converts this immutable sequence of triples into three collections of the first, second, and third element of each triple.

    Converts this immutable sequence of triples into three collections of the first, second, and third element of each triple.

    returns

    a triple immutable sequences, containing the first, second, respectively third member of each element triple of this immutable sequence.

    Definition Classes
    GenericTraversableTemplate
  237. def updated (index: Int, elem: Node): immutable.Seq[Node]

    [use case] A copy of this immutable sequence with one single replaced element.

    [use case]

    A copy of this immutable sequence with one single replaced element.

    index

    the position of the replacement

    elem

    the replacing element

    returns

    a new immutable sequence which is a copy of this immutable sequence with the element at position index replaced by elem.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  238. def updated [B >: Node, That] (index: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    A copy of this immutable sequence with one single replaced element.

    A copy of this immutable sequence with one single replaced element.

    B

    the element type of the returned immutable 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 immutable sequence which is a copy of this immutable sequence with the element at position index replaced by elem.

    Definition Classes
    SeqLike → GenSeqLike
  239. def view (from: Int, until: Int): SeqView[Node, NodeSeq]

    Creates a non-strict view of a slice of this immutable sequence.

    Creates a non-strict view of a slice of this immutable sequence.

    Note: the difference between view and slice is that view produces a view of the current immutable sequence, whereas slice produces a new immutable 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 immutable sequence, starting at index from and extending up to (but not including) index until.

    Definition Classes
    SeqLikeIterableLikeTraversableLike
  240. def view : SeqView[Node, NodeSeq]

    Creates a non-strict view of this immutable sequence.

    Creates a non-strict view of this immutable sequence.

    returns

    a non-strict view of this immutable sequence.

    Definition Classes
    SeqLikeIterableLikeTraversableLike
  241. def wait (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()
  242. def wait (arg0: Long, arg1: Int): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()
  243. def wait (arg0: Long): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()
  244. def withFilter (p: (Node) ⇒ Boolean): FilterMonadic[Node, NodeSeq]

    Creates a non-strict filter of this immutable sequence.

    Creates a non-strict filter of this immutable 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 immutable sequence which satisfy the predicate p.

    Definition Classes
    TraversableLikeFilterMonadic
  245. def xmlType (): TypeSymbol

    Returns a type symbol (e.

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

    Definition Classes
    Node
  246. def xml_!= (other: Any): Boolean

    Attributes
    final
    Definition Classes
    Equality
  247. def xml_== (other: Any): Boolean

    Attributes
    final
    Definition Classes
    Equality
  248. def xml_sameElements [A] (that: Iterable[A]): Boolean

    Definition Classes
    NodeSeq
  249. def zip [A1 >: Node, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  250. def zip [B] (that: GenIterable[B]): immutable.Seq[(Node, B)]

    [use case] Returns a immutable sequence formed from this immutable sequence and another iterable collection by combining corresponding elements in pairs.

    [use case]

    Returns a immutable sequence formed from this immutable 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 collection of type That containing pairs consisting of corresponding elements of this immutable sequence and that. The length of the returned collection is the minimum of the lengths of this immutable sequence and that.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  251. def zip [A1 >: Node, B, That] (that: GenIterable[B])(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That

    Returns a immutable sequence formed from this immutable sequence and another iterable collection by combining corresponding elements in pairs.

    Returns a immutable sequence formed from this immutable 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 immutable sequence and that. The length of the returned collection is the minimum of the lengths of this immutable sequence and that.

    Definition Classes
    IterableLike → GenIterableLike
  252. def zipAll [B, A1 >: Node, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  253. def zipAll [B] (that: Iterable[B], thisElem: Node, thatElem: B): immutable.Seq[(Node, B)]

    [use case] Returns a immutable sequence formed from this immutable sequence and another iterable collection by combining corresponding elements in pairs.

    [use case]

    Returns a immutable sequence formed from this immutable 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 immutable sequence is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this immutable sequence.

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this immutable sequence and that. The length of the returned collection is the maximum of the lengths of this immutable sequence and that. If this immutable sequence is shorter than that, thisElem values are used to pad the result. If that is shorter than this immutable sequence, thatElem values are used to pad the result.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  254. def zipAll [B, A1 >: Node, That] (that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That

    Returns a immutable sequence formed from this immutable sequence and another iterable collection by combining corresponding elements in pairs.

    Returns a immutable sequence formed from this immutable 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 immutable sequence is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this immutable sequence.

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this immutable sequence and that. The length of the returned collection is the maximum of the lengths of this immutable sequence and that. If this immutable sequence is shorter than that, thisElem values are used to pad the result. If that is shorter than this immutable sequence, thatElem values are used to pad the result.

    Definition Classes
    IterableLike → GenIterableLike
  255. def zipWithIndex : immutable.Seq[(Node, Int)]

    [use case] Zips this immutable sequence with its indices.

    [use case]

    Zips this immutable sequence with its indices.

    returns

    A new collection of type That containing pairs consisting of all elements of this immutable sequence paired with their index. Indices start at 0.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  256. def zipWithIndex [A1 >: Node, That] (implicit bf: CanBuildFrom[NodeSeq, (A1, Int), That]): That

    Zips this immutable sequence with its indices.

    Zips this immutable 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 immutable sequence paired with their index. Indices start at 0.

    Definition Classes
    IterableLike → GenIterableLike
  257. def elements : Iterator[Node]

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use iterator' instead

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

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

    Tests whether every element of this immutable 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 immutable sequence and y of that, otherwise false.

    Definition Classes
    SeqLike
    Annotations
    @deprecated
    Deprecated

    use corresponds instead

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

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

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

    Definition Classes
    SeqLike
    Annotations
    @deprecated
    Deprecated

    Use indexWhere(p) instead.

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

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

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

    Definition Classes
    SeqLike
    Annotations
    @deprecated
    Deprecated

    use lastIndexWhere instead

  261. def first : Node

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use head' instead

  262. def firstOption : Option[Node]

    None if iterable is empty.

    None if iterable is empty.

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use headOption' instead

  263. 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
    SeqLikeIterableLike
    Annotations
    @deprecated
    Deprecated

    use view' instead

  264. def reversedElements : Iterator[Node]

    Definition Classes
    SeqLike
    Annotations
    @deprecated
    Deprecated

    use reverseIterator' instead

Inherited from Serializable

Inherited from Serializable

Inherited from SpecialNode

Inherited from XMLEvent

Inherited from Node

Inherited from NodeSeq

Inherited from Equality

Inherited from Seq[Node]

Inherited from Seq[Node]

Inherited from SeqLike[Node, NodeSeq]

Inherited from GenSeq[Node]

Inherited from GenSeqLike[Node, NodeSeq]

Inherited from PartialFunction[Int, Node]

Inherited from (Int) ⇒ Node

Inherited from Iterable[Node]

Inherited from Iterable[Node]

Inherited from IterableLike[Node, NodeSeq]

Inherited from Equals

Inherited from GenIterable[Node]

Inherited from GenIterableLike[Node, NodeSeq]

Inherited from Traversable[Node]

Inherited from Immutable

Inherited from Traversable[Node]

Inherited from GenTraversable[Node]

Inherited from GenericTraversableTemplate[Node, Seq]

Inherited from TraversableLike[Node, NodeSeq]

Inherited from GenTraversableLike[Node, NodeSeq]

Inherited from Parallelizable[Node, ParSeq[Node]]

Inherited from TraversableOnce[Node]

Inherited from GenTraversableOnce[Node]

Inherited from FilterMonadic[Node, NodeSeq]

Inherited from HasNewBuilder[Node, NodeSeq]

Inherited from AnyRef

Inherited from Any