scala.xml

NodeBuffer

class NodeBuffer extends ArrayBuffer[Node]

This class acts as a Buffer for nodes. If it is used as a sequence of nodes Seq[Node], it must be ensured that no updates occur after that point, because scala.xml.Node is assumed to be immutable.

Despite this being a sequence, don't use it as key in a hashtable. Calling the hashcode function will result in a runtime error.

Source
NodeBuffer.scala
Version

1.0

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. NodeBuffer
  2. ArrayBuffer
  3. Serializable
  4. Serializable
  5. CustomParallelizable
  6. ResizableArray
  7. IndexedSeq
  8. IndexedSeq
  9. Builder
  10. IndexedSeqOptimized
  11. IndexedSeqOptimized
  12. IndexedSeqLike
  13. IndexedSeqLike
  14. AbstractBuffer
  15. Buffer
  16. BufferLike
  17. Subtractable
  18. Scriptable
  19. Shrinkable
  20. Growable
  21. Clearable
  22. AbstractSeq
  23. Seq
  24. SeqLike
  25. Cloneable
  26. Iterable
  27. Traversable
  28. Mutable
  29. AbstractSeq
  30. Seq
  31. SeqLike
  32. GenSeq
  33. GenSeqLike
  34. PartialFunction
  35. Function1
  36. AbstractIterable
  37. Iterable
  38. IterableLike
  39. Equals
  40. GenIterable
  41. GenIterableLike
  42. AbstractTraversable
  43. Traversable
  44. GenTraversable
  45. GenericTraversableTemplate
  46. TraversableLike
  47. GenTraversableLike
  48. Parallelizable
  49. TraversableOnce
  50. GenTraversableOnce
  51. FilterMonadic
  52. HasNewBuilder
  53. AnyRef
  54. Any
Implicitly
  1. by seqToNodeSeq
  2. by traversable2ops
  3. by MonadOps
  4. by flattenTraversableOnce
  5. by any2stringadd
  6. by any2stringfmt
  7. by any2ArrowAssoc
  8. by any2Ensuring
  9. by alternateImplicit
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NodeBuffer()

Type Members

  1. class Elements extends AbstractIterator[A] with BufferedIterator[A] with Serializable

    The class of the iterator returned by the iterator method.

  2. type Self = ArrayBuffer[Node]

    The type implementing this traversable

    The type implementing this traversable

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

    A class supporting filtered operations.

Value Members

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

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

    Test two objects for inequality.

    Test two objects for inequality.

    returns

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

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

    Equivalent to x.hashCode except for boxed numeric types and null.

    Equivalent to x.hashCode except for boxed numeric types and null. 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. For null returns a hashcode where null.hashCode throws a NullPointerException.

    returns

    a hash value consistent with ==

    Definition Classes
    AnyRef → Any
  4. def &+(o: Any): NodeBuffer

    Append given object to this buffer, returns reference on this NodeBuffer for convenience.

    Append given object to this buffer, returns reference on this NodeBuffer for convenience. Some rules apply: - If argument o is null, it is ignored. - If it is an Iterator or Iterable, its elements will be added. - If o is a node, it is added as it is. - If it is anything else, it gets wrapped in an Atom.

    o

    converts to an xml node and adds to this node buffer

    returns

    this nodebuffer

  5. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to StringAdd performed by method any2stringadd in scala.Predef.
    Definition Classes
    StringAdd
  6. def ++(xs: GenTraversableOnce[Node]): ArrayBuffer[Node]

    Creates a new collection containing both the elements of this collection and the provided traversable object.

    Creates a new collection containing both the elements of this collection and the provided traversable object.

    xs

    the traversable object.

    returns

    a new collection consisting of all the elements of this collection and xs.

    Definition Classes
    BufferLike
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) ++ creates a new buffer. Use ++= to add an element from this buffer and return that buffer itself.

  7. def ++[B](that: GenTraversableOnce[B]): `ArrayBuffer`[B]

    [use case] Returns a new arraybuffer containing the elements from the left hand operand followed by the elements from the right hand operand.

    [use case]

    Returns a new arraybuffer containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the arraybuffer is the most specific superclass encompassing the element types of the two operands.

    Example:

    scala> val a = LinkedList(1)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1)
    
    scala> val b = LinkedList(2)
    b: scala.collection.mutable.LinkedList[Int] = LinkedList(2)
    
    scala> val c = a ++ b
    c: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
    
    scala> val d = LinkedList('a')
    d: scala.collection.mutable.LinkedList[Char] = LinkedList(a)
    
    scala> val e = c ++ d
    e: scala.collection.mutable.LinkedList[AnyVal] = LinkedList(1, 2, a)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new arraybuffer which contains all elements of this arraybuffer followed by all elements of that.

    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def ++[B >: Node, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

  8. def ++:[B >: Node, That](that: Traversable[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one. Mnemonic: the COLon is on the side of the new COLlection type.

    Example:

    scala> val x = List(1)
    x: List[Int] = List(1)
    
    scala> val y = LinkedList(2)
    y: scala.collection.mutable.LinkedList[Int] = LinkedList(2)
    
    scala> val z = x ++: y
    z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)

    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.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. In the standard library configuration, That is always ArrayBuffer[B] because an implicit of type CanBuildFrom[ArrayBuffer, B, ArrayBuffer[B]] is defined in object ArrayBuffer.

    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. This is usually the canBuildFrom value defined in object ArrayBuffer.

    returns

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

    Definition Classes
    TraversableLike
  9. def ++:[B](that: TraversableOnce[B]): `ArrayBuffer`[B]

    [use case] As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    [use case]

    As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one. Mnemonic: the COLon is on the side of the new COLlection type.

    Example:

    scala> val x = List(1)
    x: List[Int] = List(1)
    
    scala> val y = LinkedList(2)
    y: scala.collection.mutable.LinkedList[Int] = LinkedList(2)
    
    scala> val z = x ++: y
    z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new arraybuffer which contains all elements of this arraybuffer followed by all elements of that.

    Definition Classes
    TraversableLike
    Full Signature

    def ++:[B >: Node, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

  10. def ++=(xs: TraversableOnce[Node]): NodeBuffer.this.type

    Appends a number of elements provided by a traversable object.

    Appends a number of elements provided by a traversable object. The identity of the buffer is returned.

    xs

    the traversable object.

    returns

    the updated buffer.

    Definition Classes
    ArrayBufferGrowable
  11. def ++=:(xs: TraversableOnce[Node]): NodeBuffer.this.type

    Prepends a number of elements provided by a traversable object.

    Prepends a number of elements provided by a traversable object. The identity of the buffer is returned.

    xs

    the traversable object.

    returns

    the updated buffer.

    Definition Classes
    ArrayBufferBufferLike
  12. def +:(elem: A): `ArrayBuffer`[A]

    [use case] A copy of the arraybuffer with an element prepended.

    [use case]

    A copy of the arraybuffer with an element prepended.

    Note that :-ending operators are right associative (see example). A mnemonic for +: vs. :+ is: the COLon goes on the COLlection side.

    Also, the original arraybuffer is not modified, so you will want to capture the result.

    Example:

    scala> val x = LinkedList(1)
    x: scala.collection.mutable.LinkedList[Int] = LinkedList(1)
    
    scala> val y = 2 +: x
    y: scala.collection.mutable.LinkedList[Int] = LinkedList(2, 1)
    
    scala> println(x)
    LinkedList(1)
    elem

    the prepended element

    returns

    a new arraybuffer consisting of elem followed by all elements of this arraybuffer.

    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

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

  13. def +=(elem: Node): NodeBuffer.this.type

    Appends a single element to this buffer and returns the identity of the buffer.

    Appends a single element to this buffer and returns the identity of the buffer. It takes constant amortized time.

    elem

    the element to append.

    returns

    the updated buffer.

    Definition Classes
    ArrayBufferBuilderBufferLikeGrowable
  14. def +=(elem1: Node, elem2: Node, elems: Node*): NodeBuffer.this.type

    Appends two or more elements to this arraybuffer.

    Appends two or more elements to this arraybuffer.

    elem1

    the first element to append.

    elem2

    the second element to append.

    elems

    the remaining elements to append.

    returns

    the arraybuffer itself

    Definition Classes
    Growable
  15. def +=:(elem: Node): NodeBuffer.this.type

    Prepends a single element to this buffer and returns the identity of the buffer.

    Prepends a single element to this buffer and returns the identity of the buffer. It takes time linear in the buffer size.

    elem

    the element to append.

    returns

    the updated buffer.

    Definition Classes
    ArrayBufferBufferLike
  16. def -(elem1: Node, elem2: Node, elems: Node*): ArrayBuffer[Node]

    Creates a new collection with all the elements of this collection except the two or more specified elements.

    Creates a new collection with all the elements of this collection except the two or more specified elements.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    a new collection consisting of all the elements of this collection except elem1, elem2 and those in elems.

    Definition Classes
    BufferLikeSubtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new buffer. Use -= to remove an element from this buffer and return that buffer itself.

  17. def -(elem: Node): ArrayBuffer[Node]

    Creates a new collection with all the elements of this collection except elem.

    Creates a new collection with all the elements of this collection except elem.

    elem

    the element to remove.

    returns

    a new collection consisting of all the elements of this collection except elem.

    Definition Classes
    BufferLikeSubtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) - creates a new buffer. Use -= to remove an element from this buffer and return that buffer itself.

  18. def --(xs: GenTraversableOnce[Node]): ArrayBuffer[Node]

    Creates a new collection with all the elements of this collection except those provided by the specified traversable object.

    Creates a new collection with all the elements of this collection except those provided by the specified traversable object.

    xs

    the traversable object.

    returns

    a new collection with all the elements of this collection except those in xs

    Definition Classes
    BufferLikeSubtractable
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) -- creates a new buffer. Use --= to remove an element from this buffer and return that buffer itself.

  19. def --=(xs: TraversableOnce[Node]): NodeBuffer.this.type

    Removes all elements produced by an iterator from this arraybuffer.

    Removes all elements produced by an iterator from this arraybuffer.

    xs

    the iterator producing the elements to remove.

    returns

    the arraybuffer itself

    Definition Classes
    Shrinkable
  20. def -=(x: Node): NodeBuffer.this.type

    Removes a single element from this buffer, at its first occurrence.

    Removes a single element from this buffer, at its first occurrence. If the buffer does not contain that element, it is unchanged.

    x

    the element to remove.

    returns

    the buffer itself

    Definition Classes
    BufferLikeShrinkable
  21. def -=(elem1: Node, elem2: Node, elems: Node*): NodeBuffer.this.type

    Removes two or more elements from this arraybuffer.

    Removes two or more elements from this arraybuffer.

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

    the arraybuffer itself

    Definition Classes
    Shrinkable
  22. def ->[B](y: B): (NodeBuffer, B)

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to ArrowAssoc[NodeBuffer] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  23. def /:[B](z: B)(op: (B, Node) ⇒ B): B

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

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

    Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = (5 /: a)(_+_)
    b: Int = 15
    
    scala> val c = (5 /: a)((x,y) => x + y)
    c: Int = 15
    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 arraybuffer, going left to right with the start value z on the left:

    op(...op(op(z, x_1), x_2), ..., x_n)

    where x1, ..., xn are the elements of this arraybuffer.

    Definition Classes
    TraversableOnceGenTraversableOnce
  24. def :+(elem: A): `ArrayBuffer`[A]

    [use case] A copy of this arraybuffer with an element appended.

    [use case]

    A copy of this arraybuffer with an element appended.

    A mnemonic for +: vs. :+ is: the COLon goes on the COLlection side.

    Example:

    scala> import scala.collection.mutable.LinkedList
    import scala.collection.mutable.LinkedList
    
    scala> val a = LinkedList(1)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1)
    
    scala> val b = a :+ 2
    b: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
    
    scala> println(a)
    LinkedList(1)
    elem

    the appended element

    returns

    a new arraybuffer consisting of all elements of this arraybuffer followed by elem.

    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

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

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

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

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

    Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = (a :\ 5)(_+_)
    b: Int = 15
    
    scala> val c = (a :\ 5)((x,y) => x + y)
    c: Int = 15
    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 arraybuffer, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this arraybuffer.

    Definition Classes
    TraversableOnceGenTraversableOnce
  26. def <<(cmd: Message[Node]): Unit

    Send a message to this scriptable object.

    Send a message to this scriptable object.

    cmd

    the message to send.

    Definition Classes
    BufferLikeScriptable
  27. final def ==(arg0: AnyRef): Boolean

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

    Test two objects for equality.

    Test two objects for equality. The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).

    returns

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

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Definition Classes
    NodeSeq
  30. 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.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Definition Classes
    NodeSeq
  31. def addString(b: StringBuilder): StringBuilder

    Appends all elements of this arraybuffer to a string builder.

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

    Example:

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> val h = a.addString(b)
    b: StringBuilder = 1234
    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    Definition Classes
    TraversableOnce
  32. def addString(b: StringBuilder, sep: String): StringBuilder

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

    Appends all elements of this arraybuffer 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 arraybuffer, separated by the string sep.

    Example:

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> a.addString(b, ", ")
    res0: StringBuilder = 1, 2, 3, 4
    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
  33. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

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

    Appends all elements of this arraybuffer 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 arraybuffer are separated by the string sep.

    Example:

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> a.addString(b, "LinkedList(", ", ", ")")
    res1: StringBuilder = LinkedList(1, 2, 3, 4)
    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
  34. 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 an 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).

    B

    the type of accumulated results

    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
  35. 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
  36. def append(elems: Node*): Unit

    Appends the given elements to this buffer.

    Appends the given elements to this buffer.

    elems

    the elements to append.

    Definition Classes
    BufferLike
  37. def appendAll(xs: TraversableOnce[Node]): Unit

    Appends the elements contained in a traversable object to this buffer.

    Appends the elements contained in a traversable object to this buffer.

    xs

    the traversable object containing the elements to append.

    Definition Classes
    BufferLike
  38. def apply(idx: Int): Node

    Selects an element by its index in the arraybuffer.

    Selects an element by its index in the arraybuffer.

    Example:

    scala> val x = LinkedList(1, 2, 3, 4, 5)
    x: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4, 5)
    
    scala> x(3)
    res1: Int = 4
    idx

    The index to select.

    returns

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

    Definition Classes
    ResizableArraySeqLikeGenSeqLikeFunction1
    Exceptions thrown
    `IndexOutOfBoundsException`

    if idx does not satisfy 0 <= idx < length.

  39. def applyOrElse[A1 <: Int, B1 >: Node](x: A1, default: (A1) ⇒ B1): B1

    TODO: comment

    TODO: comment

    Definition Classes
    PartialFunction
    Since

    2.10

  40. var array: Array[AnyRef]

    Attributes
    protected
    Definition Classes
    ResizableArray
  41. final 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.

    Definition Classes
    Any
    Exceptions thrown
    ClassCastException

    if the receiver object is not an instance of the erasure of type T0.

  42. def asParIterable: ParIterable[Node]

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to TraversableOps[Node] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  43. def asParSeq: ParSeq[Node]

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to TraversableOps[Node] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  44. def canEqual(that: Any): Boolean

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

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

    that

    The object with which this arraybuffer should be compared

    returns

    true, if this arraybuffer can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

    Definition Classes
    IterableLikeEquals
  45. def clear(): Unit

    Clears the contents of this builder.

    Clears the contents of this builder. After execution of this method the builder will contain no elements.

    Definition Classes
    ArrayBufferBuilderBufferLikeGrowableClearable
  46. def clone(): ArrayBuffer[Node]

    Return a clone of this buffer.

    Return a clone of this buffer.

    returns

    an ArrayBuffer with the same elements.

    Definition Classes
    ArrayBufferCloneable → AnyRef
  47. def collect[B](pf: PartialFunction[A, B]): `ArrayBuffer`[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the arraybuffer.

    returns

    a new arraybuffer resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def collect[B, That](pf: PartialFunction[Node, B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

  48. def collectFirst[B](pf: PartialFunction[Node, B]): Option[B]

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

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

    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)

  49. def combinations(n: Int): Iterator[ArrayBuffer[Node]]

    Iterates over combinations.

    Iterates over combinations.

    returns

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

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

  50. def companion: GenericCompanion[ArrayBuffer]

    The factory companion object that builds instances of class ArrayBuffer.

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

    Definition Classes
    ArrayBufferResizableArrayIndexedSeqIndexedSeqBufferSeqIterableTraversableSeqGenSeqIterableGenIterableTraversableGenTraversableGenericTraversableTemplate
  51. 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
    Annotations
    @unspecialized()
  52. def contains(elem: Any): Boolean

    Tests whether this arraybuffer contains a given value as an element.

    Tests whether this arraybuffer contains a given value as an element.

    elem

    the element to test.

    returns

    true if this arraybuffer has an element that is equal (as determined by ==) to elem, false otherwise.

    Definition Classes
    SeqLike
  53. def containsSlice[B](that: GenSeq[B]): Boolean

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

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

    that

    the sequence to test

    returns

    true if this arraybuffer contains a slice with the same elements as that, otherwise false.

    Definition Classes
    SeqLike
  54. def copy(m: Int, n: Int, len: Int): Unit

    Move parts of the array.

    Move parts of the array.

    Attributes
    protected
    Definition Classes
    ResizableArray
  55. def copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Unit

    Fills the given array xs with at most len elements of this traversable starting at position start.

    Fills the given array xs with at most len elements of this traversable starting at position start.

    Copying will stop once either the end of the current traversable is reached or len elements have been copied or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    starting index.

    len

    number of elements to copy

    Definition Classes
    ResizableArrayIndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  56. def copyToArray(xs: Array[A]): Unit

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

    [use case]

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

    xs

    the array to fill.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

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

  57. def copyToArray(xs: Array[A], start: Int): Unit

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

    [use case]

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

    xs

    the array to fill.

    start

    the starting index.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

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

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

    Copies all elements of this arraybuffer to a buffer.

    Copies all elements of this arraybuffer to a buffer.

    dest

    The buffer to which elements are copied.

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

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

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

    Definition Classes
    SeqLikeGenSeqLike
  60. def count(p: (Node) ⇒ Boolean): Int

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

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

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    TraversableOnceGenTraversableOnce
  61. def diff(that: Seq[Node]): `ArrayBuffer`[Node]

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

    [use case]

    Computes the multiset difference between this arraybuffer and another sequence.

    that

    the sequence of elements to remove

    returns

    a new arraybuffer which contains all elements of this arraybuffer 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
    SeqLikeGenSeqLike
    Full Signature

    def diff[B >: Node](that: GenSeq[B]): ArrayBuffer[Node]

  62. def distinct: ArrayBuffer[Node]

    Builds a new arraybuffer from this arraybuffer without any duplicate elements.

    Builds a new arraybuffer from this arraybuffer without any duplicate elements.

    returns

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

    Definition Classes
    SeqLikeGenSeqLike
  63. def drop(n: Int): ArrayBuffer[Node]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    n

    the number of elements to drop from this arraybuffer.

    returns

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

    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeGenTraversableLike
  64. def dropRight(n: Int): ArrayBuffer[Node]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

    The number of elements to take

    returns

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

    Definition Classes
    IndexedSeqOptimizedIterableLike
  65. def dropWhile(p: (Node) ⇒ Boolean): ArrayBuffer[Node]

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    returns

    the longest suffix of this arraybuffer whose first element does not satisfy the predicate p.

    Definition Classes
    IndexedSeqOptimizedTraversableLikeGenTraversableLike
  66. def endsWith[B](that: GenSeq[B]): Boolean

    Tests whether this arraybuffer ends with the given sequence.

    Tests whether this arraybuffer ends with the given sequence.

    that

    the sequence to test

    returns

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

    Definition Classes
    IndexedSeqOptimizedSeqLikeGenSeqLike
  67. def ensureSize(n: Int): Unit

    Ensure that the internal array has at n cells.

    Ensure that the internal array has at n cells.

    Attributes
    protected
    Definition Classes
    ResizableArray
  68. def ensuring(cond: (NodeBuffer) ⇒ Boolean, msg: ⇒ Any): NodeBuffer

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to Ensuring[NodeBuffer] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  69. def ensuring(cond: (NodeBuffer) ⇒ Boolean): NodeBuffer

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to Ensuring[NodeBuffer] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  70. def ensuring(cond: Boolean, msg: ⇒ Any): NodeBuffer

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to Ensuring[NodeBuffer] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  71. def ensuring(cond: Boolean): NodeBuffer

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to Ensuring[NodeBuffer] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  72. final 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.

    Definition Classes
    AnyRef
  73. def equals(that: Any): Boolean

    The equals method for arbitrary sequences.

    The equals method for arbitrary sequences. Compares this sequence to some other object.

    that

    The object to compare the sequence to

    returns

    true if that is a sequence that has the same elements as this sequence in the same order, false otherwise

    Definition Classes
    GenSeqLikeEqualsAny
  74. def exists(p: (Node) ⇒ Boolean): Boolean

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

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

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for some of the elements of this arraybuffer, otherwise false.

    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  75. def filter(p: (Node) ⇒ Boolean): ArrayBuffer[Node]

    Selects all elements of this arraybuffer which satisfy a predicate.

    Selects all elements of this arraybuffer which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLike
  76. def filterNot(p: (Node) ⇒ Boolean): ArrayBuffer[Node]

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLike
  77. 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()
    Note

    not specified by SLS as a member of AnyRef

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

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

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

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the arraybuffer that satisfies p, or None if none exists.

    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  79. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): `ArrayBuffer`[B]

    [use case] Builds a new collection by applying a function to all elements of this arraybuffer and using the elements of the resulting collections.

    [use case]

    Builds a new collection by applying a function to all elements of this arraybuffer and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of arraybuffer. This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be a an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

    def flatMap[B, That](f: (Node) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

  80. def flatten[B]: `ArrayBuffer`[B]

    [use case] Converts this arraybuffer of traversable collections into a arraybuffer formed by the elements of these traversable collections.

    [use case]

    Converts this arraybuffer of traversable collections into a arraybuffer formed by the elements of these traversable collections.

    The resulting collection's type will be guided by the static type of arraybuffer. For example:

    val xs = List(Set(1, 2, 3), Set(1, 2, 3))
    // xs == List(1, 2, 3, 1, 2, 3)
    
    val ys = Set(List(1, 2, 3), List(3, 2, 1))
    // ys == Set(1, 2, 3)
    B

    the type of the elements of each traversable collection.

    returns

    a new arraybuffer resulting from concatenating all element arraybuffers.

    Definition Classes
    GenericTraversableTemplate
    Full Signature

    def flatten[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): ArrayBuffer[B]

  81. def fold[A1 >: Node](z: A1)(op: (A1, A1) ⇒ A1): A1

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

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

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

    A1

    a type parameter for the binary operator, a supertype of A.

    z

    a neutral element for the fold operation; may be added to the result an arbitrary number of times, and must not change 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
  82. def foldLeft[B](z: B)(op: (B, Node) ⇒ B): B

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

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

    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 arraybuffer, going left to right with the start value z on the left:

    op(...op(z, x_1), x_2, ..., x_n)

    where x1, ..., xn are the elements of this arraybuffer.

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

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

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

    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 arraybuffer, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this arraybuffer.

    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableOnceGenTraversableOnce
  84. def forall(p: (Node) ⇒ Boolean): Boolean

    Tests whether a predicate holds for all elements of this arraybuffer.

    Tests whether a predicate holds for all elements of this arraybuffer.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for all elements of this arraybuffer, otherwise false.

    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  85. def foreach(f: (A) ⇒ Unit): Unit

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

    [use case]

    Applies a function f to all elements of this arraybuffer.

    Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.

    f

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

    Definition Classes
    ResizableArrayIndexedSeqOptimizedIterableLikeGenericTraversableTemplateTraversableLikeGenTraversableLikeTraversableOnceGenTraversableOnceFilterMonadic
    Full Signature

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

  86. def formatted(fmtstr: String): String

    Returns string formatted according to given format string.

    Returns string formatted according to given format string. Format strings are as for String.format (@see java.lang.String.format).

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  87. def genericBuilder[B]: Builder[B, ArrayBuffer[B]]

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

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

    Definition Classes
    GenericTraversableTemplate
  88. final def getClass(): Class[_]

    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.

    Definition Classes
    AnyRef → Any
    Note

    not specified by SLS as a member of AnyRef

  89. def groupBy[K](f: (Node) ⇒ K): Map[K, ArrayBuffer[Node]]

    Partitions this arraybuffer into a map of arraybuffers according to some discriminator function.

    Partitions this arraybuffer into a map of arraybuffers 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 arraybuffer.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLike
  90. def grouped(size: Int): Iterator[ArrayBuffer[Node]]

    Partitions elements in fixed size arraybuffers.

    Partitions elements in fixed size arraybuffers.

    size

    the number of elements per group

    returns

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

    Definition Classes
    IterableLike
    See also

    Iterator, method grouped

  91. def hasDefiniteSize: Boolean

    Tests whether this arraybuffer is known to have a finite size.

    Tests whether this arraybuffer 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
  92. def hashCode(): Int

    Hashcodes for ArrayBuffer produce a value from the hashcodes of all the elements of the arraybuffer.

    Hashcodes for ArrayBuffer produce a value from the hashcodes of all the elements of the arraybuffer.

    returns

    the hash code value for this object.

    Definition Classes
    IndexedSeqLikeGenSeqLikeAny
  93. def head: Node

    Selects the first element of this arraybuffer.

    Selects the first element of this arraybuffer.

    returns

    the first element of this arraybuffer.

    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeGenTraversableLike
    Exceptions thrown
    `NoSuchElementException`

    if the arraybuffer is empty.

  94. def headOption: Option[Node]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLike
  95. def ifParSeq[R](isbody: (ParSeq[Node]) ⇒ R): Otherwise[R]

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to TraversableOps[Node] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  96. def indexOf(elem: Node, from: Int): Int

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

    [use case]

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

    Definition Classes
    GenSeqLike
    Full Signature

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

  97. def indexOf(elem: Node): Int

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

    [use case]

    Finds index of first occurrence of some value in this arraybuffer.

    elem

    the element value to search for.

    returns

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

    Definition Classes
    GenSeqLike
    Full Signature

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

  98. def indexOfSlice[B >: Node](that: GenSeq[B], from: Int): Int

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

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

    that

    the sequence to test

    from

    the start index

    returns

    the first index >= from such that the elements of this arraybuffer starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

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

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

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

    that

    the sequence to test

    returns

    the first index such that the elements of this arraybuffer starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

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

    p

    the predicate used to test elements.

    from

    the start index

    returns

    the index >= from of the first element of this arraybuffer that satisfies the predicate p, or -1, if none exists.

    Definition Classes
    IndexedSeqOptimizedSeqLikeGenSeqLike
  101. def indexWhere(p: (Node) ⇒ Boolean): Int

    Finds index of first element satisfying some predicate.

    Finds index of first element satisfying some predicate.

    p

    the predicate used to test elements.

    returns

    the index of the first element of this arraybuffer that satisfies the predicate p, or -1, if none exists.

    Definition Classes
    GenSeqLike
  102. 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 arraybuffer.

    Definition Classes
    SeqLike
  103. def init: ArrayBuffer[Node]

    Selects all elements except the last.

    Selects all elements except the last.

    returns

    a arraybuffer consisting of all elements of this arraybuffer except the last one.

    Definition Classes
    IndexedSeqOptimizedTraversableLikeGenTraversableLike
    Exceptions thrown
    `UnsupportedOperationException`

    if the arraybuffer is empty.

  104. val initialSize: Int

    Attributes
    protected
    Definition Classes
    ArrayBufferResizableArray
  105. def inits: Iterator[ArrayBuffer[Node]]

    Iterates over the inits of this arraybuffer.

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

    returns

    an iterator over all the inits of this arraybuffer

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

  106. def insert(n: Int, elems: Node*): Unit

    Inserts new elements at a given index into this buffer.

    Inserts new elements at a given index into this buffer.

    n

    the index where new elements are inserted.

    elems

    the traversable collection containing the elements to insert.

    Definition Classes
    BufferLike
    Exceptions thrown
    IndexOutOfBoundsException

    if the index n is not in the valid range 0 <= n <= length.

  107. def insertAll(n: Int, seq: Traversable[Node]): Unit

    Inserts new elements at the index n.

    Inserts new elements at the index n. Opposed to method update, this method will not replace an element with a one. Instead, it will insert a new element at index n.

    n

    the index where a new element will be inserted.

    seq

    the traversable object providing all elements to insert.

    Definition Classes
    ArrayBufferBufferLike
    Exceptions thrown
    Predef.IndexOutOfBoundsException

    if n is out of bounds.

  108. def intersect(that: Seq[Node]): `ArrayBuffer`[Node]

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

    [use case]

    Computes the multiset intersection between this arraybuffer and another sequence.

    that

    the sequence of elements to intersect with.

    returns

    a new arraybuffer which contains all elements of this arraybuffer 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
    SeqLikeGenSeqLike
    Full Signature

    def intersect[B >: Node](that: GenSeq[B]): ArrayBuffer[Node]

  109. def isDefinedAt(idx: Int): Boolean

    Tests whether this arraybuffer contains given index.

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

    Definition Classes
    GenSeqLike
  110. def isEmpty: Boolean

    Tests whether this arraybuffer is empty.

    Tests whether this arraybuffer is empty.

    returns

    true if the arraybuffer contain no elements, false otherwise.

    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  111. final 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.

    Definition Classes
    Any
  112. def isParIterable: Boolean

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to TraversableOps[Node] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  113. def isParSeq: Boolean

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to TraversableOps[Node] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  114. def isParallel: Boolean

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to TraversableOps[Node] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  115. final def isTraversableAgain: Boolean

    Tests whether this arraybuffer can be repeatedly traversed.

    Tests whether this arraybuffer can be repeatedly traversed.

    returns

    true

    Definition Classes
    TraversableLikeGenTraversableLikeGenTraversableOnce
  116. 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
    IndexedSeqLikeIterableLikeGenIterableLike
  117. def last: Node

    Selects the last element.

    Selects the last element.

    returns

    The last element of this arraybuffer.

    Definition Classes
    IndexedSeqOptimizedTraversableLikeGenTraversableLike
    Exceptions thrown
    NoSuchElementException

    If the arraybuffer is empty.

  118. def lastIndexOf(elem: Node, end: Int): Int

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

    [use case]

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

    Definition Classes
    GenSeqLike
    Full Signature

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

  119. def lastIndexOf(elem: Node): Int

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

    [use case]

    Finds index of last occurrence of some value in this arraybuffer.

    elem

    the element value to search for.

    returns

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

    Definition Classes
    GenSeqLike
    Full Signature

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

  120. def lastIndexOfSlice[B >: Node](that: GenSeq[B], end: Int): Int

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

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

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

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

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

    that

    the sequence to test

    returns

    the last index such that the elements of this arraybuffer starting a this index match the elements of sequence that, or -1 of no such subsequence exists.

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

    Definition Classes
    IndexedSeqOptimizedSeqLikeGenSeqLike
  123. def lastIndexWhere(p: (Node) ⇒ Boolean): Int

    Finds index of last element satisfying some predicate.

    Finds index of last element satisfying some predicate.

    p

    the predicate used to test elements.

    returns

    the index of the last element of this arraybuffer that satisfies the predicate p, or -1, if none exists.

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

    Optionally selects the last element.

    Optionally selects the last element.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLike
  125. def length: Int

    Returns the length of this resizable array.

    Returns the length of this resizable array.

    returns

    the number of elements in this arraybuffer.

    Definition Classes
    ResizableArraySeqLikeGenSeqLike
  126. def lengthCompare(len: Int): Int

    Compares the length of this arraybuffer to a test value.

    Compares the length of this arraybuffer 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
    IndexedSeqOptimizedSeqLike
  127. 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

  128. def map[B](f: (A) ⇒ B): `ArrayBuffer`[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new arraybuffer resulting from applying the given function f to each element of this arraybuffer and collecting the results.

    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

    def map[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

  129. def mapResult[NewTo](f: (ArrayBuffer[Node]) ⇒ NewTo): Builder[Node, NewTo]

    Creates a new builder by applying a transformation function to the results of this builder.

    Creates a new builder by applying a transformation function to the results of this builder.

    NewTo

    the type of collection returned by f.

    f

    the transformation function.

    returns

    a new builder which is the same as the current builder except that a transformation function is applied to this builder's result.

    Definition Classes
    Builder
  130. def max: A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this arraybuffer.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def max[B >: Node](implicit cmp: Ordering[B]): Node

  131. def maxBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node

    Definition Classes
    TraversableOnceGenTraversableOnce
  132. def min: A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this arraybuffer

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def min[B >: Node](implicit cmp: Ordering[B]): Node

  133. def minBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node

    Definition Classes
    TraversableOnceGenTraversableOnce
  134. def mkString: String

    Displays all elements of this arraybuffer in a string.

    Displays all elements of this arraybuffer in a string.

    returns

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

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

    Displays all elements of this arraybuffer in a string using a separator string.

    Displays all elements of this arraybuffer in a string using a separator string.

    sep

    the separator string.

    returns

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

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

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

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

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

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

  137. final 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.

    Definition Classes
    AnyRef
  138. def newBuilder: Builder[Node, ArrayBuffer[Node]]

    The builder that builds instances of type ArrayBuffer[A]

    The builder that builds instances of type ArrayBuffer[A]

    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplateHasNewBuilder
  139. def nonEmpty: Boolean

    Tests whether the arraybuffer is not empty.

    Tests whether the arraybuffer is not empty.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  140. final 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.

    Definition Classes
    AnyRef
    Note

    not specified by SLS as a member of AnyRef

  141. final 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.

    Definition Classes
    AnyRef
    Note

    not specified by SLS as a member of AnyRef

  142. 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
  143. def padTo(len: Int, elem: A): `ArrayBuffer`[A]

    [use case] A copy of this arraybuffer with an element value appended until a given target length is reached.

    [use case]

    A copy of this arraybuffer with an element value appended until a given target length is reached.

    len

    the target length

    elem

    the padding value

    returns

    a new arraybuffer consisting of all elements of this arraybuffer followed by the minimal number of occurrences of elem so that the resulting arraybuffer has a length of at least len.

    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def padTo[B >: Node, That](len: Int, elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

  144. def par: ParArray[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
    ArrayBufferCustomParallelizableParallelizable
  145. def parCombiner: Combiner[Node, ParArray[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
    CustomParallelizableParallelizable
  146. def partition(p: (Node) ⇒ Boolean): (ArrayBuffer[Node], ArrayBuffer[Node])

    Partitions this arraybuffer in two arraybuffers according to a predicate.

    Partitions this arraybuffer in two arraybuffers according to a predicate.

    p

    the predicate on which to partition.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLike
  147. def patch(from: Int, that: GenSeq[A], replaced: Int): `ArrayBuffer`[A]

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

    [use case]

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

    from

    the index of the first replaced element

    replaced

    the number of elements to drop in the original arraybuffer

    returns

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

    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def patch[B >: Node, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

  148. def permutations: Iterator[ArrayBuffer[Node]]

    Iterates over distinct permutations.

    Iterates over distinct permutations.

    returns

    An Iterator which traverses the distinct permutations of this arraybuffer.

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    GenSeqLike
  150. def prepend(elems: Node*): Unit

    Prepends given elements to this buffer.

    Prepends given elements to this buffer.

    elems

    the elements to prepend.

    Definition Classes
    BufferLike
  151. def prependAll(xs: TraversableOnce[Node]): Unit

    Prepends the elements contained in a traversable object to this buffer.

    Prepends the elements contained in a traversable object to this buffer.

    xs

    the collection containing the elements to prepend.

    Definition Classes
    BufferLike
  152. def product: A

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

    [use case]

    Multiplies up the elements of this collection.

    returns

    the product of all elements in this arraybuffer of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the arraybuffer and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def product[B >: Node](implicit num: Numeric[B]): B

  153. def readOnly: Seq[Node]

    Provide a read-only view of this buffer as a sequence

    Provide a read-only view of this buffer as a sequence

    returns

    A sequence which refers to this buffer for all its operations.

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

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

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

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

    A1

    A type parameter for the binary operator, a supertype of A.

    op

    A binary operator that must be associative.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
    Exceptions thrown
    UnsupportedOperationException

    if this arraybuffer is empty.

  155. def reduceLeft[B >: Node](op: (B, Node) ⇒ B): B

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

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceLeft(op) is this arraybuffer is nonempty, None otherwise.

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

    Reduces the elements of this arraybuffer, if any, using the specified associative binary operator.

    Reduces the elements of this arraybuffer, if any, using the specified associative binary operator.

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

    A1

    A type parameter for the binary operator, a supertype of A.

    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
  158. def reduceRight[B >: Node](op: (Node, B) ⇒ B): B

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this arraybuffer, going right to left:

    op(x_1, op(x_2, ..., op(x_{n-1}, x_n)...))

    where x1, ..., xn are the elements of this arraybuffer.

    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableOnceGenTraversableOnce
    Exceptions thrown
    `UnsupportedOperationException`

    if this arraybuffer is empty.

  159. def reduceRightOption[B >: Node](op: (Node, B) ⇒ B): Option[B]

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceRight(op) is this arraybuffer is nonempty, None otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  160. def reduceToSize(sz: Int): Unit

    Remove elements of this array at indices after sz.

    Remove elements of this array at indices after sz.

    Definition Classes
    ResizableArray
  161. def remove(n: Int): Node

    Removes the element at a given index position.

    Removes the element at a given index position.

    n

    the index which refers to the element to delete.

    returns

    the element that was formerly at position n.

    Definition Classes
    ArrayBufferBufferLike
  162. def remove(n: Int, count: Int): Unit

    Removes the element on a given index position.

    Removes the element on a given index position. It takes time linear in the buffer size.

    n

    the index which refers to the first element to delete.

    count

    the number of elements to delete

    Definition Classes
    ArrayBufferBufferLike
    Exceptions thrown
    Predef.IndexOutOfBoundsException

    if n is out of bounds.

  163. def repr: ArrayBuffer[Node]

    The collection of type arraybuffer underlying this TraversableLike object.

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

    Definition Classes
    TraversableLikeGenTraversableLike
  164. def result(): ArrayBuffer[Node]

    Produces a collection from the added elements.

    Produces a collection from the added elements. The builder's contents are undefined after this operation.

    returns

    a collection containing the elements added to this builder.

    Definition Classes
    ArrayBufferBuilder
  165. def reverse: ArrayBuffer[Node]

    Returns new arraybuffer wih elements in reversed order.

    Returns new arraybuffer wih elements in reversed order.

    returns

    A new arraybuffer with all elements of this arraybuffer in reversed order.

    Definition Classes
    IndexedSeqOptimizedSeqLikeGenSeqLike
  166. def reverseIterator: Iterator[Node]

    An iterator yielding elements in reversed order.

    An iterator yielding elements in reversed order.

    Note: xs.reverseIterator is the same as xs.reverse.iterator but might be more efficient.

    returns

    an iterator yielding the elements of this arraybuffer in reversed order

    Definition Classes
    IndexedSeqOptimizedSeqLike
  167. def reverseMap[B](f: (A) ⇒ B): `ArrayBuffer`[B]

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

    [use case]

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

    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.

    f

    the function to apply to each element.

    returns

    a new arraybuffer resulting from applying the given function f to each element of this arraybuffer and collecting the results in reversed order.

    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def reverseMap[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

  168. def reversed: List[Node]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  169. def run[U](x: Int)(action: (Node) ⇒ U): Boolean

    TODO: comment

    TODO: comment

    Definition Classes
    PartialFunction
    Since

    2.10

  170. def runWith[U](action: (Node) ⇒ U): (Int) ⇒ Boolean

    TODO: comment

    TODO: comment

    Definition Classes
    PartialFunction
    Since

    2.10

  171. def sameElements(that: GenIterable[A]): Boolean

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

    [use case]

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

    that

    the collection to compare with.

    returns

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

    Definition Classes
    IndexedSeqOptimizedIterableLikeGenIterableLike
    Full Signature

    def sameElements[B >: Node](that: GenIterable[B]): Boolean

  172. def scan[B >: Node, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[ArrayBuffer[Node], 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 arraybuffer containing the prefix scan of the elements in this arraybuffer

    Definition Classes
    TraversableLikeGenTraversableLike
  173. def scanLeft[B, That](z: B)(op: (B, Node) ⇒ B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

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

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

    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. This is usually the canBuildFrom value defined in object ArrayBuffer.

    returns

    collection with intermediate results

    Definition Classes
    TraversableLikeGenTraversableLike
  174. def scanRight[B, That](z: B)(op: (Node, B) ⇒ B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

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

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

    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. This is usually the canBuildFrom value defined in object ArrayBuffer.

    returns

    collection with intermediate results

    Definition Classes
    TraversableLikeGenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

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

    p

    the predicate used to test elements.

    from

    the index where the search starts.

    returns

    the length of the longest segment of this arraybuffer starting from index from such that every element of the segment satisfies the predicate p.

    Definition Classes
    IndexedSeqOptimizedSeqLikeGenSeqLike
  176. def seq: IndexedSeq[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
    IndexedSeqIndexedSeqIndexedSeqLikeSeqSeqGenSeqGenSeqLikeIterableIterableGenIterableTraversableTraversableGenTraversableParallelizableTraversableOnceGenTraversableOnce
  177. def size: Int

    The size of this arraybuffer, equivalent to length.

    The size of this arraybuffer, equivalent to length.

    returns

    the number of elements in this arraybuffer.

    Definition Classes
    SeqLikeGenTraversableLikeTraversableOnceGenTraversableOnce
  178. var size0: Int

    Attributes
    protected
    Definition Classes
    ResizableArray
  179. def sizeHint(len: Int): Unit

    Gives a hint how many elements are expected to be added when the next result is called.

    Gives a hint how many elements are expected to be added when the next result is called. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    Definition Classes
    ArrayBufferBuilder
  180. def sizeHint(coll: scala.collection.TraversableLike[_, _], delta: Int = 0): Unit

    Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta.

    Gives a hint that one expects the result of this builder to have the same size as the given collection, plus some delta. This will provide a hint only if the collection is known to have a cheap size method. Currently this is assumed to be the case if and only if the collection is of type IndexedSeqLike. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    coll

    the collection which serves as a hint for the result's size.

    delta

    a correction to add to the coll.size to produce the size hint.

    Definition Classes
    Builder
  181. def sizeHintBounded(size: Int, boundingColl: scala.collection.TraversableLike[_, _]): Unit

    Gives a hint how many elements are expected to be added when the next result is called, together with an upper bound given by the size of some other collection.

    Gives a hint how many elements are expected to be added when the next result is called, together with an upper bound given by the size of some other collection. Some builder classes will optimize their representation based on the hint. However, builder implementations are still required to work correctly even if the hint is wrong, i.e. a different number of elements is added.

    size

    the hint how many elements will be added.

    boundingColl

    the bounding collection. If it is an IndexedSeqLike, then sizes larger than collection's size are reduced.

    Definition Classes
    Builder
  182. def slice(from: Int, until: Int): ArrayBuffer[Node]

    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
    returns

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

    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeGenTraversableLike
  183. def sliding(size: Int, step: Int): Iterator[ArrayBuffer[Node]]

    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

    step

    the distance between the first elements of successive groups (defaults to 1)

    returns

    An iterator producing arraybuffers 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, method sliding

  184. def sliding(size: Int): Iterator[ArrayBuffer[Node]]

    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 arraybuffers 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, method sliding

  185. def sortBy[B](f: (Node) ⇒ B)(implicit ord: Ordering[B]): ArrayBuffer[Node]

    Sorts this ArrayBuffer according to the Ordering which results from transforming an implicitly given Ordering with a transformation function.

    Sorts this ArrayBuffer 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 arraybuffer consisting of the elements of this arraybuffer 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

    Ordering

  186. def sortWith(lt: (Node, Node) ⇒ Boolean): ArrayBuffer[Node]

    Sorts this arraybuffer according to a comparison function.

    Sorts this arraybuffer according to a comparison function.

    The sort is stable. That is, elements that are equal (as determined by 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 arraybuffer consisting of the elements of this arraybuffer 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")
  187. def sorted[B >: Node](implicit ord: Ordering[B]): ArrayBuffer[Node]

    Sorts this arraybuffer according to an Ordering.

    Sorts this arraybuffer according to an Ordering.

    The sort is stable. That is, elements that are equal (as determined by 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 arraybuffer consisting of the elements of this arraybuffer sorted according to the ordering ord.

    Definition Classes
    SeqLike
    See also

    Ordering

  188. def span(p: (Node) ⇒ Boolean): (ArrayBuffer[Node], ArrayBuffer[Node])

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

    Splits this arraybuffer 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.

    returns

    a pair consisting of the longest prefix of this arraybuffer whose elements all satisfy p, and the rest of this arraybuffer.

    Definition Classes
    IndexedSeqOptimizedTraversableLikeGenTraversableLike
  189. def splitAt(n: Int): (ArrayBuffer[Node], ArrayBuffer[Node])

    Splits this arraybuffer into two at a given position.

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

    Definition Classes
    IndexedSeqOptimizedTraversableLikeGenTraversableLike
  190. def startsWith[B](that: GenSeq[B], offset: Int): Boolean

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

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

    Note: 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 arraybuffer at index offset, otherwise false.

    Definition Classes
    IndexedSeqOptimizedSeqLikeGenSeqLike
  191. def startsWith[B](that: GenSeq[B]): Boolean

    Tests whether this arraybuffer starts with the given sequence.

    Tests whether this arraybuffer 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
  192. def strict_!=(other: Equality): Boolean

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Definition Classes
    Equality
  193. def strict_==(other: Equality): Boolean

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Definition Classes
    NodeSeqEquality
  194. def stringPrefix: String

    Defines the prefix of the string representation.

    Defines the prefix of the string representation.

    returns

    a string representation which starts the result of toString applied to this set. Unless overridden this is simply "Buffer".

    Definition Classes
    ArrayBufferBufferLikeTraversableLikeGenTraversableLike
  195. def sum: A

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

    [use case]

    Sums up the elements of this collection.

    returns

    the sum of all elements in this arraybuffer of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the arraybuffer and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

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

  196. def swap(a: Int, b: Int): Unit

    Swap two elements of this array.

    Swap two elements of this array.

    Attributes
    protected
    Definition Classes
    ResizableArray
  197. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  198. def tail: ArrayBuffer[Node]

    Selects all elements except the first.

    Selects all elements except the first.

    returns

    a arraybuffer consisting of all elements of this arraybuffer except the first one.

    Definition Classes
    IndexedSeqOptimizedTraversableLikeGenTraversableLike
    Exceptions thrown
    `UnsupportedOperationException`

    if the arraybuffer is empty.

  199. def tails: Iterator[ArrayBuffer[Node]]

    Iterates over the tails of this arraybuffer.

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

    returns

    an iterator over all the tails of this arraybuffer

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

  200. def take(n: Int): ArrayBuffer[Node]

    Selects first n elements.

    Selects first n elements.

    n

    Tt number of elements to take from this arraybuffer.

    returns

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

    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeGenTraversableLike
  201. def takeRight(n: Int): ArrayBuffer[Node]

    Selects last n elements.

    Selects last n elements.

    n

    the number of elements to take

    returns

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

    Definition Classes
    IndexedSeqOptimizedIterableLike
  202. def takeWhile(p: (Node) ⇒ Boolean): ArrayBuffer[Node]

    Takes longest prefix of elements that satisfy a predicate.

    Takes longest prefix of elements that satisfy a predicate.

    returns

    the longest prefix of this arraybuffer whose elements all satisfy the predicate p.

    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeGenTraversableLike
  203. def text: String

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Definition Classes
    NodeSeq
  204. def theSeq: Seq[Node]

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Definition Classes
    NodeSeq
  205. def thisCollection: IndexedSeq[Node]

    The underlying collection seen as an instance of ArrayBuffer.

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

    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLikeIndexedSeqLikeSeqLikeIterableLikeTraversableLike
  206. def to[Col[_]]: Col[A]

    [use case] Converts this arraybuffer into another by copying all elements.

    [use case]

    Converts this arraybuffer into another by copying all elements.

    Col

    The collection type to build.

    returns

    a new collection containing all elements of this arraybuffer.

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
    Full Signature

    def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Node, Col[Node]]): Col[Node]

  207. def toArray: Array[A]

    [use case] Converts this arraybuffer to an array.

    [use case]

    Converts this arraybuffer to an array.

    returns

    an array containing all elements of this arraybuffer. An ClassTag must be available for the element type of this arraybuffer.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def toArray[B >: Node](implicit arg0: ClassTag[B]): Array[B]

  208. def toBuffer[A1 >: Node]: Buffer[A1]

    Overridden for efficiency

    Overridden for efficiency

    returns

    a buffer containing all elements of this arraybuffer.

    Definition Classes
    IndexedSeqLikeTraversableOnceGenTraversableOnce
  209. def toCollection(repr: ArrayBuffer[Node]): IndexedSeq[Node]

    A conversion from collections of type Repr to ArrayBuffer objects.

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

    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLikeIndexedSeqLikeSeqLikeIterableLikeTraversableLike
  210. def toIndexedSeq: IndexedSeq[Node]

    Converts this arraybuffer to an indexed sequence.

    Converts this arraybuffer to an indexed sequence.

    returns

    an indexed sequence containing all elements of this arraybuffer.

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

    Converts this arraybuffer to an iterable collection.

    Converts this arraybuffer 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).

    returns

    an Iterable containing all elements of this arraybuffer.

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

    Returns an Iterator over the elements in this arraybuffer.

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

    returns

    an Iterator containing all elements of this arraybuffer.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableOnce
  213. def toList: List[Node]

    Converts this arraybuffer to a list.

    Converts this arraybuffer to a list.

    returns

    a list containing all elements of this arraybuffer.

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

    [use case] Converts this arraybuffer to a map.

    [use case]

    Converts this arraybuffer 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.

    returns

    a map of type immutable.Map[T, U] containing all key/value pairs of type (T, U) of this arraybuffer.

    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def toMap[T, U](implicit ev: <:<[Node, (T, U)]): Map[T, U]

  215. def toParArray: ParArray[Node]

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to TraversableOps[Node] performed by method traversable2ops in scala.collection.parallel.
    Definition Classes
    TraversableOps
  216. def toSeq: Seq[Node]

    Converts this arraybuffer to a sequence.

    Converts this arraybuffer to a sequence.

    Overridden for efficiency.

    returns

    a sequence containing all elements of this arraybuffer.

    Definition Classes
    SeqLikeGenSeqLikeTraversableOnceGenTraversableOnce
  217. def toSet[B >: Node]: Set[B]

    Converts this arraybuffer to a set.

    Converts this arraybuffer to a set.

    returns

    a set containing all elements of this arraybuffer.

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

    Converts this arraybuffer to a stream.

    Converts this arraybuffer to a stream.

    returns

    a stream containing all elements of this arraybuffer.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableOnce
  219. def toString(): String

    Converts this arraybuffer to a string.

    Converts this arraybuffer to a string.

    returns

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

    Definition Classes
    SeqLikeTraversableLikeAny
  220. def toTraversable: Traversable[Node]

    Converts this arraybuffer to an unspecified Traversable.

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

    returns

    a Traversable containing all elements of this arraybuffer.

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
  221. def toVector: Vector[Node]

    Converts this arraybuffer to a Vector.

    Converts this arraybuffer to a Vector.

    returns

    a vector containing all elements of this arraybuffer.

    Definition Classes
    TraversableOnceGenTraversableOnce
  222. def transform(f: (Node) ⇒ Node): NodeBuffer.this.type

    Applies a transformation function to all values contained in this sequence.

    Applies a transformation function to all values contained in this sequence. The transformation function produces new values from existing elements.

    f

    the transformation to apply

    returns

    the sequence itself.

    Definition Classes
    SeqLike
  223. def transpose[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): ArrayBuffer[ArrayBuffer[B]]

    Transposes this arraybuffer of traversable collections into a arraybuffer of arraybuffers.

    Transposes this arraybuffer of traversable collections into a arraybuffer of arraybuffers.

    B

    the type of the elements of each traversable collection.

    asTraversable

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

    returns

    a two-dimensional arraybuffer of arraybuffers which has as nth row the nth column of this arraybuffer.

    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

    Exceptions thrown
    `IllegalArgumentException`

    if all collections in this arraybuffer are not of the same size.

  224. def trimEnd(n: Int): Unit

    Removes the last n elements of this buffer.

    Removes the last n elements of this buffer.

    n

    the number of elements to remove from the end of this buffer.

    Definition Classes
    BufferLike
  225. def trimStart(n: Int): Unit

    Removes the first n elements of this buffer.

    Removes the first n elements of this buffer.

    n

    the number of elements to remove from the beginning of this buffer.

    Definition Classes
    BufferLike
  226. def union(that: Seq[Node]): `ArrayBuffer`[Node]

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

    [use case]

    Produces a new sequence which contains all elements of this arraybuffer and also all elements of a given sequence. xs union ys is equivalent to xs ++ ys.

    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.

    that

    the sequence to add.

    returns

    a new arraybuffer which contains all elements of this arraybuffer followed by all elements of that.

    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def union[B >: Node, That](that: GenSeq[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

  227. def unzip[A1, A2](implicit asPair: (Node) ⇒ (A1, A2)): (ArrayBuffer[A1], ArrayBuffer[A2])

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

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

    A1

    the type of the first half of the element pairs

    A2

    the type of the second half of the element pairs

    asPair

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

    returns

    a pair arraybuffers, containing the first, respectively second half of each element pair of this arraybuffer.

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

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

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

    A1

    the type of the first member of the element triples

    A2

    the type of the second member of the element triples

    A3

    the type of the third member of the element triples

    asTriple

    an implicit conversion which asserts that the element type of this arraybuffer is a triple.

    returns

    a triple arraybuffers, containing the first, second, respectively third member of each element triple of this arraybuffer.

    Definition Classes
    GenericTraversableTemplate
  229. def update(idx: Int, elem: Node): Unit

    Replaces element at given index with a new value.

    Replaces element at given index with a new value.

    idx

    the index of the element to replace.

    elem

    the new value.

    Definition Classes
    ResizableArrayIndexedSeqLikeSeqLike
    Exceptions thrown
    IndexOutOfBoundsException

    if the index is not valid.

  230. def updated(index: Int, elem: A): `ArrayBuffer`[A]

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

    [use case]

    A copy of this arraybuffer with one single replaced element.

    index

    the position of the replacement

    elem

    the replacing element

    returns

    a copy of this arraybuffer with the element at position index replaced by elem.

    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def updated[B >: Node, That](index: Int, elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

  231. def view(from: Int, until: Int): IndexedSeqView[Node, ArrayBuffer[Node]]

    A sub-sequence view starting at index from and extending up to (but not including) index until.

    A sub-sequence view starting at index from and extending up to (but not including) index until.

    from

    The index of the first element of the slice

    until

    The index of the element following the slice

    returns

    a non-strict view of a slice of this arraybuffer, starting at index from and extending up to (but not including) index until[email protected] The difference between view and slice is that view produces a view of the current sequence, whereas slice produces a new sequence.

    Definition Classes
    IndexedSeqLikeSeqLikeIterableLikeTraversableLike
    Note

    view(from, to) is equivalent to view.slice(from, to)

  232. def view: IndexedSeqView[Node, ArrayBuffer[Node]]

    Creates a view of this iterable @see Iterable.

    Creates a view of this iterable @see Iterable.View

    returns

    a non-strict view of this arraybuffer.

    Definition Classes
    IndexedSeqLikeSeqLikeIterableLikeTraversableLike
  233. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws()
  236. def withFilter(p: (Node) ⇒ Boolean): FilterMonadic[Node, ArrayBuffer[Node]]

    Creates a non-strict filter of this arraybuffer.

    Creates a non-strict filter of this arraybuffer.

    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 arraybuffer which satisfy the predicate p.

    Definition Classes
    TraversableLikeFilterMonadic
  237. final def xml_!=(other: Any): Boolean

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Definition Classes
    Equality
  238. final def xml_==(other: Any): Boolean

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Definition Classes
    Equality
  239. def xml_sameElements[A](that: Iterable[A]): Boolean

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Definition Classes
    NodeSeq
  240. def zip[B](that: GenIterable[B]): `ArrayBuffer`[(A, B)]

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

    [use case]

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

    Definition Classes
    IndexedSeqOptimizedIterableLikeGenIterableLike
    Full Signature

    def zip[A1 >: Node, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], (A1, B), That]): That

  241. def zipAll[B](that: Iterable[B], thisElem: A, thatElem: B): `ArrayBuffer`[(A, B)]

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

    [use case]

    Returns a arraybuffer formed from this arraybuffer and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    thisElem

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

    thatElem

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

    returns

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

    Definition Classes
    IterableLikeGenIterableLike
    Full Signature

    def zipAll[B, A1 >: Node, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], (A1, B), That]): That

  242. def zipWithIndex: `ArrayBuffer`[(A, Int)]

    [use case] Zips this arraybuffer with its indices.

    [use case]

    Zips this arraybuffer with its indices.

    returns

    A new arraybuffer containing pairs consisting of all elements of this arraybuffer paired with their index. Indices start at 0.

    Definition Classes
    IndexedSeqOptimizedIterableLikeGenIterableLike
    Full Signature

    def zipWithIndex[A1 >: Node, That](implicit bf: CanBuildFrom[ArrayBuffer[Node], (A1, Int), That]): That

    Example:
    1. List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))

  243. def [B](y: B): (NodeBuffer, B)

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to ArrowAssoc[NodeBuffer] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implict Value Members

  1. def ++[B](that: GenTraversableOnce[B]): Traversable[B]

    [use case] Returns a new traversable collection containing the elements from the left hand operand followed by the elements from the right hand operand.

    [use case]

    Returns a new traversable collection containing the elements from the left hand operand followed by the elements from the right hand operand. The element type of the traversable collection is the most specific superclass encompassing the element types of the two operands.

    Example:

    scala> val a = LinkedList(1)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1)
    
    scala> val b = LinkedList(2)
    b: scala.collection.mutable.LinkedList[Int] = LinkedList(2)
    
    scala> val c = a ++ b
    c: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
    
    scala> val d = LinkedList('a')
    d: scala.collection.mutable.LinkedList[Char] = LinkedList(a)
    
    scala> val e = c ++ d
    e: scala.collection.mutable.LinkedList[AnyVal] = LinkedList(1, 2, a)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new traversable collection which contains all elements of this traversable collection followed by all elements of that.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).++(that)
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

  2. def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

    As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one. Mnemonic: the COLon is on the side of the new COLlection type.

    Example:

    scala> val x = List(1)
    x: List[Int] = List(1)
    
    scala> val y = LinkedList(2)
    y: scala.collection.mutable.LinkedList[Int] = LinkedList(2)
    
    scala> val z = x ++: y
    z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)

    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.

    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 and the new element type B.

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).++:(that)(bf)
    Definition Classes
    TraversableLike
  3. def ++:[B](that: TraversableOnce[B]): Traversable[B]

    [use case] As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    [use case]

    As with ++, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

    It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one. Mnemonic: the COLon is on the side of the new COLlection type.

    Example:

    scala> val x = List(1)
    x: List[Int] = List(1)
    
    scala> val y = LinkedList(2)
    y: scala.collection.mutable.LinkedList[Int] = LinkedList(2)
    
    scala> val z = x ++: y
    z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

    a new traversable collection which contains all elements of this traversable collection followed by all elements of that.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).++:(that)
    Definition Classes
    TraversableLike
    Full Signature

    def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

  4. def +:(elem: A): `Seq`[A]

    [use case] A copy of the sequence with an element prepended.

    [use case]

    A copy of the sequence with an element prepended.

    Note that :-ending operators are right associative (see example). A mnemonic for +: vs. :+ is: the COLon goes on the COLlection side.

    Also, the original sequence is not modified, so you will want to capture the result.

    Example:

    scala> val x = LinkedList(1)
    x: scala.collection.mutable.LinkedList[Int] = LinkedList(1)
    
    scala> val y = 2 +: x
    y: scala.collection.mutable.LinkedList[Int] = LinkedList(2, 1)
    
    scala> println(x)
    LinkedList(1)
    elem

    the prepended element

    returns

    a new sequence consisting of elem followed by all elements of this sequence.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).+:(elem)
    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

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

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

    Applies a binary operator to a start value and all elements of this traversable or iterator, going left to right.

    Applies a binary operator to a start value and all elements of this traversable or iterator, going left to right.

    Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = (5 /: a)(_+_)
    b: Int = 15
    
    scala> val c = (5 /: a)((x,y) => x + y)
    c: Int = 15

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

    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 traversable or iterator, going left to right with the start value z on the left:

    op(...op(op(z, x_1), x_2), ..., x_n)

    where x1, ..., xn are the elements of this traversable or iterator.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq)./:(z)(op)
    Definition Classes
    TraversableOnceGenTraversableOnce
  6. def :+(elem: A): `Seq`[A]

    [use case] A copy of this sequence with an element appended.

    [use case]

    A copy of this sequence with an element appended.

    A mnemonic for +: vs. :+ is: the COLon goes on the COLlection side.

    Note: will not terminate for infinite-sized collections.

    Example:

    scala> import scala.collection.mutable.LinkedList
    import scala.collection.mutable.LinkedList
    
    scala> val a = LinkedList(1)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1)
    
    scala> val b = a :+ 2
    b: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)
    
    scala> println(a)
    LinkedList(1)
    elem

    the appended element

    returns

    a new sequence consisting of all elements of this sequence followed by elem.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).:+(elem)
    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

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

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

    Applies a binary operator to all elements of this traversable or iterator and a start value, going right to left.

    Applies a binary operator to all elements of this traversable or iterator 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.

    Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = (a :\ 5)(_+_)
    b: Int = 15
    
    scala> val c = (a :\ 5)((x,y) => x + y)
    c: Int = 15
    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 traversable or iterator, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this traversable or iterator.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).:\(z)(op)
    Definition Classes
    TraversableOnceGenTraversableOnce
  8. def addString(b: StringBuilder): StringBuilder

    Appends all elements of this traversable or iterator to a string builder.

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

    Example:

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> val h = a.addString(b)
    b: StringBuilder = 1234
    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).addString(b)
    Definition Classes
    TraversableOnce
  9. def addString(b: StringBuilder, sep: String): StringBuilder

    Appends all elements of this traversable or iterator to a string builder using a separator string.

    Appends all elements of this traversable or iterator 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 traversable or iterator, separated by the string sep.

    Example:

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> a.addString(b, ", ")
    res0: StringBuilder = 1, 2, 3, 4
    b

    the string builder to which elements are appended.

    sep

    the separator string.

    returns

    the string builder b to which elements were appended.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).addString(b, sep)
    Definition Classes
    TraversableOnce
  10. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Appends all elements of this traversable or iterator to a string builder using start, end, and separator strings.

    Appends all elements of this traversable or iterator 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 traversable or iterator are separated by the string sep.

    Example:

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> a.addString(b, "LinkedList(", ", ", ")")
    res1: StringBuilder = LinkedList(1, 2, 3, 4)
    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.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).addString(b, start, sep, end)
    Definition Classes
    TraversableOnce
  11. 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 an 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).

    B

    the type of accumulated results

    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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).aggregate(z)(seqop, combop)
    Definition Classes
    TraversableOnceGenTraversableOnce
  12. 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)).

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).andThen(k)
    Definition Classes
    PartialFunctionFunction1
  13. def apply(f: (Node) ⇒ Boolean): NodeSeq

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).apply(f)
    Definition Classes
    NodeSeq
  14. 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.

    Example:

    scala> val x = LinkedList(1, 2, 3, 4, 5)
    x: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4, 5)
    
    scala> x(3)
    res1: Int = 4
    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).apply(i)
    Definition Classes
    NodeSeqSeqLikeGenSeqLikeFunction1
    Exceptions thrown
    `IndexOutOfBoundsException`

    if idx does not satisfy 0 <= idx < length.

  15. def applyOrElse[A1 <: A, B1 >: B](x: A1, default: (A1) ⇒ B1): B1

    TODO: comment

    TODO: comment

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).applyOrElse(x, default)
    Definition Classes
    PartialFunction
    Since

    2.10

  16. def canEqual(other: Any): Boolean

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

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

    returns

    true if this instance can possibly equal that, otherwise false

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).canEqual(other)
    Definition Classes
    NodeSeqEqualityIterableLikeEquals
  17. def collect[B](pf: PartialFunction[A, B]): Traversable[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the traversable collection.

    returns

    a new traversable collection resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).collect(pf)
    Definition Classes
    TraversableLikeGenTraversableLike
    Full Signature

    def collect[B, That](pf: PartialFunction[Node, B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

  18. def collectFirst[B](pf: PartialFunction[Node, B]): Option[B]

    Finds the first element of the traversable or iterator for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the traversable or iterator for which the given partial function is defined, and applies the partial function to it.

    Note: may not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    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.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).collectFirst(pf)
    Definition Classes
    TraversableOnce
    Example:
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

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

    Iterates over combinations.

    Iterates over combinations.

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).combinations(n)
    Definition Classes
    SeqLike
    Example:
    1. "abbbc".combinations(2) = Iterator(ab, ac, bb, bc)

  20. def companion: GenericCompanion[Seq]

    The factory companion object that builds instances of class immutable.Seq.

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).companion
    Definition Classes
    SeqSeqGenSeqIterableIterableGenIterableTraversableTraversableGenTraversableGenericTraversableTemplate
  21. 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))

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).compose(g)
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  22. def contains(elem: Any): Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    elem

    the element to test.

    returns

    true if this sequence has an element that is equal (as determined by ==) to elem, false otherwise.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).contains(elem)
    Definition Classes
    SeqLike
  23. def containsSlice[B](that: GenSeq[B]): Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).containsSlice(that)
    Definition Classes
    SeqLike
  24. def copyToArray(xs: Array[A], start: Int, len: Int): Unit

    [use case] Copies elements of this iterable collection to an array.

    [use case]

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

    Note: will not terminate for infinite-sized collections.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).copyToArray(xs, start, len)
    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
    Full Signature

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

  25. def copyToArray(xs: Array[A]): Unit

    [use case] Copies values of this traversable or iterator to an array.

    [use case]

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

    Note: will not terminate for infinite-sized collections.

    xs

    the array to fill.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).copyToArray(xs)
    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

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

  26. def copyToArray(xs: Array[A], start: Int): Unit

    [use case] Copies values of this traversable or iterator to an array.

    [use case]

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

    Note: will not terminate for infinite-sized collections.

    xs

    the array to fill.

    start

    the starting index.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).copyToArray(xs, start)
    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

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

  27. def copyToBuffer[B >: A](dest: Buffer[B]): Unit

    Copies all elements of this traversable or iterator to a buffer.

    Copies all elements of this traversable or iterator to a buffer.

    Note: will not terminate for infinite-sized collections.

    dest

    The buffer to which elements are copied.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).copyToBuffer(dest)
    Definition Classes
    TraversableOnce
  28. def corresponds[B](that: GenSeq[B])(p: (Node, B) ⇒ Boolean): Boolean

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

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

    B

    the type of the elements of that

    that

    the other sequence

    p

    the test predicate, which relates elements from both sequences

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).corresponds(that)(p)
    Definition Classes
    SeqLikeGenSeqLike
  29. def count(p: (Node) ⇒ Boolean): Int

    Counts the number of elements in the traversable or iterator which satisfy a predicate.

    Counts the number of elements in the traversable or iterator which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).count(p)
    Definition Classes
    TraversableOnceGenTraversableOnce
  30. def diff(that: Seq[Node]): `Seq`[Node]

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

    [use case]

    Computes the multiset difference between this sequence and another sequence.

    Note: will not terminate for infinite-sized collections.

    that

    the sequence of elements to remove

    returns

    a new sequence which contains all elements of this sequence except some of occurrences of elements that also appear in that. If an element value x appears n times in that, then the first n occurrences of x will not form part of the result, but any following occurrences will.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).diff(that)
    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def diff[B >: A](that: GenSeq[B]): NodeSeq

  31. def distinct: NodeSeq

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

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

    Note: will not terminate for infinite-sized collections.

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).distinct
    Definition Classes
    SeqLikeGenSeqLike
  32. def drop(n: Int): NodeSeq

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the number of elements to drop from this iterable collection.

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).drop(n)
    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
  33. def dropRight(n: Int): NodeSeq

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    The number of elements to take

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).dropRight(n)
    Definition Classes
    IterableLike
  34. def dropWhile(p: (Node) ⇒ Boolean): NodeSeq

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    the longest suffix of this traversable collection whose first element does not satisfy the predicate p.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).dropWhile(p)
    Definition Classes
    TraversableLikeGenTraversableLike
  35. def endsWith[B](that: GenSeq[B]): Boolean

    Tests whether this sequence ends with the given sequence.

    Tests whether this sequence ends with the given sequence.

    Note: will not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).endsWith(that)
    Definition Classes
    SeqLikeGenSeqLike
  36. 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.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).equals(other)
    Definition Classes
    EqualityEquals → AnyRef → Any
  37. def exists(p: (Node) ⇒ Boolean): Boolean

    Tests whether a predicate holds for some of the elements of this iterable collection.

    Tests whether a predicate holds for some of the elements of this iterable collection.

    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 iterable collection, otherwise false.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).exists(p)
    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  38. def filter(p: (Node) ⇒ Boolean): NodeSeq

    Selects all elements of this traversable collection which satisfy a predicate.

    Selects all elements of this traversable collection which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).filter(p)
    Definition Classes
    TraversableLikeGenTraversableLike
  39. def filter(p: (Node) ⇒ Boolean): TraversableOnce[Node]

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to MonadOps[Node] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: MonadOps[Node]).filter(p)
    Definition Classes
    MonadOps
  40. def filterNot(p: (Node) ⇒ Boolean): NodeSeq

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

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

    p

    the predicate used to test elements.

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).filterNot(p)
    Definition Classes
    TraversableLikeGenTraversableLike
  41. def find(p: (Node) ⇒ Boolean): Option[Node]

    Finds the first element of the iterable collection satisfying a predicate, if any.

    Finds the first element of the iterable collection satisfying a predicate, if any.

    Note: may not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the iterable collection that satisfies p, or None if none exists.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).find(p)
    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  42. def flatMap[B](f: (A) ⇒ GenTraversableOnce[B]): Traversable[B]

    [use case] Builds a new collection by applying a function to all elements of this traversable collection and using the elements of the resulting collections.

    [use case]

    Builds a new collection by applying a function to all elements of this traversable collection and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of traversable collection. This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be a an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).flatMap(f)
    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

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

  43. def flatMap[B](f: (Node) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to MonadOps[Node] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: MonadOps[Node]).flatMap(f)
    Definition Classes
    MonadOps
  44. def flatten[B]: CC[B]

    [use case] Converts this collection of traversable collections into a collection formed by the elements of these traversable collections.

    [use case]

    Converts this collection of traversable collections into a collection formed by the elements of these traversable collections.

    The resulting collection's type will be guided by the static type of collection. For example:

    val xs = List(Set(1, 2, 3), Set(1, 2, 3))
    // xs == List(1, 2, 3, 1, 2, 3)
    
    val ys = Set(List(1, 2, 3), List(3, 2, 1))
    // ys == Set(1, 2, 3)
    B

    the type of the elements of each traversable collection.

    returns

    a new collection resulting from concatenating all element collections.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).flatten
    Definition Classes
    GenericTraversableTemplate
    Full Signature

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

  45. def flatten: Iterator[Node]

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to FlattenOps[Node] performed by method flattenTraversableOnce in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: FlattenOps[Node]).flatten
    Definition Classes
    FlattenOps
  46. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

    Folds the elements of this traversable or iterator using the specified associative binary operator.

    Folds the elements of this traversable or iterator using the specified associative binary operator.

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

    A1

    a type parameter for the binary operator, a supertype of A.

    z

    a neutral element for the fold operation; may be added to the result an arbitrary number of times, and must not change 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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).fold(z)(op)
    Definition Classes
    TraversableOnceGenTraversableOnce
  47. def foldLeft[B](z: B)(op: (B, Node) ⇒ B): B

    Applies a binary operator to a start value and all elements of this traversable or iterator, going left to right.

    Applies a binary operator to a start value and all elements of this traversable or iterator, going left to right.

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

    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 traversable or iterator, going left to right with the start value z on the left:

    op(...op(z, x_1), x_2, ..., x_n)

    where x1, ..., xn are the elements of this traversable or iterator.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).foldLeft(z)(op)
    Definition Classes
    TraversableOnceGenTraversableOnce
  48. def foldRight[B](z: B)(op: (Node, B) ⇒ B): B

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

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

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    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 iterable collection, going right to left with the start value z on the right:

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this iterable collection.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).foldRight(z)(op)
    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  49. def forall(p: (Node) ⇒ Boolean): Boolean

    Tests whether a predicate holds for all elements of this iterable collection.

    Tests whether a predicate holds for all elements of this iterable collection.

    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 iterable collection, otherwise false.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).forall(p)
    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  50. def foreach(f: (Node) ⇒ Unit): Unit

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

    [use case]

    Applies a function f to all elements of this iterable collection.

    Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.

    f

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).foreach(f)
    Definition Classes
    IterableLikeTraversableLikeGenTraversableLikeTraversableOnceGenTraversableOnceFilterMonadic
    Full Signature

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

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

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

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).genericBuilder
    Definition Classes
    GenericTraversableTemplate
  52. def groupBy[K](f: (Node) ⇒ K): Map[K, NodeSeq]

    Partitions this traversable collection into a map of traversable collections according to some discriminator function.

    Partitions this traversable collection into a map of traversable collections 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 traversable collection.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).groupBy(f)
    Definition Classes
    TraversableLikeGenTraversableLike
  53. def grouped(size: Int): Iterator[NodeSeq]

    Partitions elements in fixed size iterable collections.

    Partitions elements in fixed size iterable collections.

    size

    the number of elements per group

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).grouped(size)
    Definition Classes
    IterableLike
    See also

    Iterator, method grouped

  54. def hasDefiniteSize: Boolean

    Tests whether this traversable collection is known to have a finite size.

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).hasDefiniteSize
    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
  55. 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.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).hashCode()
    Definition Classes
    Equality → AnyRef → Any
  56. def head: Node

    Selects the first element of this iterable collection.

    Selects the first element of this iterable collection.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    the first element of this iterable collection.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).head
    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
    Exceptions thrown
    `NoSuchElementException`

    if the iterable collection is empty.

  57. def headOption: Option[Node]

    Optionally selects the first element.

    Optionally selects the first element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    the first element of this traversable collection if it is nonempty, None if it is empty.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).headOption
    Definition Classes
    TraversableLikeGenTraversableLike
  58. def indexOf(elem: Node, from: Int): Int

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

    [use case]

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

    Note: may not terminate for infinite-sized collections.

    elem

    the element value to search for.

    from

    the start index

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).indexOf(elem, from)
    Definition Classes
    GenSeqLike
    Full Signature

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

  59. def indexOf(elem: Node): Int

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

    [use case]

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

    Note: may not terminate for infinite-sized collections.

    elem

    the element value to search for.

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).indexOf(elem)
    Definition Classes
    GenSeqLike
    Full Signature

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

  60. def indexOfSlice[B >: A](that: GenSeq[B], from: Int): Int

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

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

    Note: may not terminate for infinite-sized collections.

    that

    the sequence to test

    from

    the start index

    returns

    the first index >= from such that the elements of this sequence starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).indexOfSlice(that, from)
    Definition Classes
    SeqLike
  61. def indexOfSlice[B >: A](that: GenSeq[B]): Int

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

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

    Note: may not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

    the first index such that the elements of this sequence starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).indexOfSlice(that)
    Definition Classes
    SeqLike
  62. def indexWhere(p: (Node) ⇒ Boolean, from: Int): Int

    Finds index of the first element satisfying some predicate after or at some start index.

    Finds index of the first element satisfying some predicate after or at some start index.

    Note: may not terminate for infinite-sized collections.

    p

    the predicate used to test elements.

    from

    the start index

    returns

    the index >= from of the first element of this sequence that satisfies the predicate p, or -1, if none exists.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).indexWhere(p, from)
    Definition Classes
    SeqLikeGenSeqLike
  63. 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 general sequence that satisfies the predicate p, or -1, if none exists.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).indexWhere(p)
    Definition Classes
    GenSeqLike
  64. 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 sequence.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).indices
    Definition Classes
    SeqLike
  65. def init: NodeSeq

    Selects all elements except the last.

    Selects all elements except the last.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    a traversable collection consisting of all elements of this traversable collection except the last one.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).init
    Definition Classes
    TraversableLikeGenTraversableLike
    Exceptions thrown
    `UnsupportedOperationException`

    if the traversable collection is empty.

  66. def inits: Iterator[NodeSeq]

    Iterates over the inits of this traversable collection.

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

    returns

    an iterator over all the inits of this traversable collection

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).inits
    Definition Classes
    TraversableLike
    Example:
    1. List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)

  67. def intersect(that: Seq[Node]): `Seq`[Node]

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

    [use case]

    Computes the multiset intersection between this sequence and another sequence.

    Note: may not terminate for infinite-sized collections.

    that

    the sequence of elements to intersect with.

    returns

    a new sequence which contains all elements of this sequence which also appear in that. If an element value x appears n times in that, then the first n occurrences of x will be retained in the result, but any following occurrences will be omitted.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).intersect(that)
    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def intersect[B >: A](that: GenSeq[B]): NodeSeq

  68. def isDefinedAt(idx: Int): Boolean

    Tests whether this general sequence contains given index.

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).isDefinedAt(idx)
    Definition Classes
    GenSeqLike
  69. def isEmpty: Boolean

    Tests whether this iterable collection is empty.

    Tests whether this iterable collection is empty.

    returns

    true if the iterable collection contain no elements, false otherwise.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).isEmpty
    Definition Classes
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  70. final def isTraversableAgain: Boolean

    Tests whether this traversable collection can be repeatedly traversed.

    Tests whether this traversable collection can be repeatedly traversed.

    returns

    true

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).isTraversableAgain
    Definition Classes
    TraversableLikeGenTraversableLikeGenTraversableOnce
  71. 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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).iterator
    Definition Classes
    NodeSeqIterableLikeGenIterableLike
  72. def last: Node

    Selects the last element.

    Selects the last element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    The last element of this traversable collection.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).last
    Definition Classes
    TraversableLikeGenTraversableLike
    Exceptions thrown
    NoSuchElementException

    If the traversable collection is empty.

  73. def lastIndexOf(elem: Node, end: Int): Int

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

    [use case]

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).lastIndexOf(elem, end)
    Definition Classes
    GenSeqLike
    Full Signature

    def lastIndexOf[B >: A](elem: B, end: Int): Int

  74. def lastIndexOf(elem: Node): Int

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

    [use case]

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

    Note: will not terminate for infinite-sized collections.

    elem

    the element value to search for.

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).lastIndexOf(elem)
    Definition Classes
    GenSeqLike
    Full Signature

    def lastIndexOf[B >: A](elem: B): Int

  75. def lastIndexOfSlice[B >: A](that: GenSeq[B], end: Int): Int

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

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

    that

    the sequence to test

    end

    the end index

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).lastIndexOfSlice(that, end)
    Definition Classes
    SeqLike
  76. def lastIndexOfSlice[B >: A](that: GenSeq[B]): Int

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

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

    Note: will not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

    the last index such that the elements of this sequence starting a this index match the elements of sequence that, or -1 of no such subsequence exists.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).lastIndexOfSlice(that)
    Definition Classes
    SeqLike
  77. def lastIndexWhere(p: (Node) ⇒ Boolean, end: Int): Int

    Finds index of last element satisfying some predicate before or at given end index.

    Finds index of last element satisfying some predicate before or at given end index.

    p

    the predicate used to test elements.

    returns

    the index <= end of the last element of this sequence that satisfies the predicate p, or -1, if none exists.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).lastIndexWhere(p, end)
    Definition Classes
    SeqLikeGenSeqLike
  78. 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 general sequence that satisfies the predicate p, or -1, if none exists.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).lastIndexWhere(p)
    Definition Classes
    GenSeqLike
  79. def lastOption: Option[Node]

    Optionally selects the last element.

    Optionally selects the last element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    the last element of this traversable collection$ if it is nonempty, None if it is empty.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).lastOption
    Definition Classes
    TraversableLikeGenTraversableLike
  80. 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.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).length
    Definition Classes
    NodeSeqSeqLikeGenSeqLike
  81. def lengthCompare(len: Int): Int

    Compares the length of this sequence to a test value.

    Compares the length of this sequence to a test value.

    len

    the test value that gets compared with the length.

    returns

    A value x where

    x <  0       if this.length <  len
    x == 0       if this.length == len
    x >  0       if this.length >  len

    The method as implemented here does not call length directly; its running time is O(length min len) instead of O(length). The method should be overwritten if computing length is cheap.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).lengthCompare(len)
    Definition Classes
    SeqLike
  82. 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.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).lift
    Definition Classes
    PartialFunction
    See also

    Function.unlift

  83. def map[B](f: (A) ⇒ B): Traversable[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new traversable collection resulting from applying the given function f to each element of this traversable collection and collecting the results.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).map(f)
    Definition Classes
    TraversableLikeGenTraversableLikeFilterMonadic
    Full Signature

    def map[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

  84. def map[B](f: (Node) ⇒ B): TraversableOnce[B]

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to MonadOps[Node] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: MonadOps[Node]).map(f)
    Definition Classes
    MonadOps
  85. def max: A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this traversable or iterator.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).max
    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def max[B >: A](implicit cmp: Ordering[B]): Node

  86. def maxBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).maxBy(f)(cmp)
    Definition Classes
    TraversableOnceGenTraversableOnce
  87. def min: A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this traversable or iterator

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).min
    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def min[B >: A](implicit cmp: Ordering[B]): Node

  88. def minBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).minBy(f)(cmp)
    Definition Classes
    TraversableOnceGenTraversableOnce
  89. def mkString: String

    Displays all elements of this traversable or iterator in a string.

    Displays all elements of this traversable or iterator in a string.

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).mkString
    Definition Classes
    TraversableOnceGenTraversableOnce
  90. def mkString(sep: String): String

    Displays all elements of this traversable or iterator in a string using a separator string.

    Displays all elements of this traversable or iterator in a string using a separator string.

    sep

    the separator string.

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).mkString(sep)
    Definition Classes
    TraversableOnceGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("|") = "1|2|3"

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

    Displays all elements of this traversable or iterator in a string using start, end, and separator strings.

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).mkString(start, sep, end)
    Definition Classes
    TraversableOnceGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"

  92. def nonEmpty: Boolean

    Tests whether the traversable or iterator is not empty.

    Tests whether the traversable or iterator is not empty.

    returns

    true if the traversable or iterator contains at least one element, false otherwise.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).nonEmpty
    Definition Classes
    TraversableOnceGenTraversableOnce
  93. def orElse[A1 <: A, B1 >: B](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.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).orElse(that)
    Definition Classes
    PartialFunction
  94. def padTo(len: Int, elem: A): `Seq`[A]

    [use case] A copy of this sequence with an element value appended until a given target length is reached.

    [use case]

    A copy of this sequence with an element value appended until a given target length is reached.

    len

    the target length

    elem

    the padding value

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).padTo(len, elem)
    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def padTo[B >: A, That](len: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).par
    Definition Classes
    Parallelizable
  96. def partition(p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq)

    Partitions this traversable collection in two traversable collections according to a predicate.

    Partitions this traversable collection in two traversable collections according to a predicate.

    p

    the predicate on which to partition.

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).partition(p)
    Definition Classes
    TraversableLikeGenTraversableLike
  97. def patch(from: Int, that: GenSeq[A], replaced: Int): `Seq`[A]

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

    [use case]

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

    from

    the index of the first replaced element

    replaced

    the number of elements to drop in the original sequence

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).patch(from, that, replaced)
    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def patch[B >: A, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

  98. def permutations: Iterator[NodeSeq]

    Iterates over distinct permutations.

    Iterates over distinct permutations.

    returns

    An Iterator which traverses the distinct permutations of this sequence.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).permutations
    Definition Classes
    SeqLike
    Example:
    1. "abb".permutations = Iterator(abb, bab, bba)

  99. 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 general sequence such that every element of the segment satisfies the predicate p.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).prefixLength(p)
    Definition Classes
    GenSeqLike
  100. def product: A

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

    [use case]

    Multiplies up the elements of this collection.

    returns

    the product of all elements in this traversable or iterator of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the traversable or iterator and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).product
    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def product[B >: A](implicit num: Numeric[B]): B

  101. def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1

    Reduces the elements of this traversable or iterator using the specified associative binary operator.

    Reduces the elements of this traversable or iterator using the specified associative binary operator.

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

    A1

    A type parameter for the binary operator, a supertype of A.

    op

    A binary operator that must be associative.

    returns

    The result of applying reduce operator op between all the elements if the traversable or iterator is nonempty.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).reduce(op)
    Definition Classes
    TraversableOnceGenTraversableOnce
    Exceptions thrown
    UnsupportedOperationException

    if this traversable or iterator is empty.

  102. def reduceLeft[B >: A](op: (B, Node) ⇒ B): B

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).reduceLeft(op)
    Definition Classes
    TraversableOnce
  103. def reduceLeftOption[B >: A](op: (B, Node) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this traversable or iterator, going left to right.

    Optionally applies a binary operator to all elements of this traversable or iterator, going left to right.

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceLeft(op) is this traversable or iterator is nonempty, None otherwise.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).reduceLeftOption(op)
    Definition Classes
    TraversableOnceGenTraversableOnce
  104. def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]

    Reduces the elements of this traversable or iterator, if any, using the specified associative binary operator.

    Reduces the elements of this traversable or iterator, if any, using the specified associative binary operator.

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

    A1

    A type parameter for the binary operator, a supertype of A.

    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.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).reduceOption(op)
    Definition Classes
    TraversableOnceGenTraversableOnce
  105. def reduceRight[B >: A](op: (Node, B) ⇒ B): B

    Applies a binary operator to all elements of this iterable collection, going right to left.

    Applies a binary operator to all elements of this iterable collection, going right to left.

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this iterable collection, going right to left:

    op(x_1, op(x_2, ..., op(x_{n-1}, x_n)...))

    where x1, ..., xn are the elements of this iterable collection.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).reduceRight(op)
    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
    Exceptions thrown
    `UnsupportedOperationException`

    if this iterable collection is empty.

  106. def reduceRightOption[B >: A](op: (Node, B) ⇒ B): Option[B]

    Optionally applies a binary operator to all elements of this traversable or iterator, going right to left.

    Optionally applies a binary operator to all elements of this traversable or iterator, going right to left.

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered or the operator is associative and commutative.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceRight(op) is this traversable or iterator is nonempty, None otherwise.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).reduceRightOption(op)
    Definition Classes
    TraversableOnceGenTraversableOnce
  107. def repr: NodeSeq

    The collection of type traversable collection underlying this TraversableLike object.

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).repr
    Definition Classes
    TraversableLikeGenTraversableLike
  108. def reverse: NodeSeq

    Returns new sequence wih elements in reversed order.

    Returns new sequence wih elements in reversed order.

    Note: will not terminate for infinite-sized collections.

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).reverse
    Definition Classes
    SeqLikeGenSeqLike
  109. 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 sequence in reversed order

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).reverseIterator
    Definition Classes
    SeqLike
  110. def reverseMap[B](f: (A) ⇒ B): `Seq`[B]

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

    [use case]

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

    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.

    f

    the function to apply to each element.

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).reverseMap(f)
    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def reverseMap[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

  111. def run[U](x: Int)(action: (Node) ⇒ U): Boolean

    TODO: comment

    TODO: comment

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).run(x)(action)
    Definition Classes
    PartialFunction
    Since

    2.10

  112. def runWith[U](action: (Node) ⇒ U): (Int) ⇒ Boolean

    TODO: comment

    TODO: comment

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).runWith(action)
    Definition Classes
    PartialFunction
    Since

    2.10

  113. def sameElements(that: GenIterable[A]): Boolean

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

    [use case]

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

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    Note: will not terminate for infinite-sized collections.

    that

    the collection to compare with.

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).sameElements(that)
    Definition Classes
    IterableLikeGenIterableLike
    Full Signature

    def sameElements[B >: A](that: GenIterable[B]): Boolean

  114. def scan[B >: A, 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 traversable collection containing the prefix scan of the elements in this traversable collection

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).scan(z)(op)(cbf)
    Definition Classes
    TraversableLikeGenTraversableLike
  115. def scanLeft[B, That](z: B)(op: (B, Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

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

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

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    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 and the new element type B.

    returns

    collection with intermediate results

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).scanLeft(z)(op)(bf)
    Definition Classes
    TraversableLikeGenTraversableLike
  116. def scanRight[B, That](z: B)(op: (Node, B) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

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

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

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    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 and the new element type B.

    returns

    collection with intermediate results

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).scanRight(z)(op)(bf)
    Definition Classes
    TraversableLikeGenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).segmentLength(p, from)
    Definition Classes
    SeqLikeGenSeqLike
  118. val self: Any

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to StringAdd performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (nodeBuffer: StringAdd).self
    Definition Classes
    StringAdd
  119. val self: Any

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to StringFormat performed by method any2stringfmt in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (nodeBuffer: StringFormat).self
    Definition Classes
    StringFormat
  120. 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.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).seq
    Definition Classes
    SeqSeqGenSeqGenSeqLikeIterableIterableGenIterableTraversableTraversableGenTraversableParallelizableTraversableOnceGenTraversableOnce
  121. def size: Int

    The size of this sequence, equivalent to length.

    The size of this sequence, equivalent to length.

    Note: will not terminate for infinite-sized collections.

    returns

    the number of elements in this sequence.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).size
    Definition Classes
    SeqLikeGenTraversableLikeTraversableOnceGenTraversableOnce
  122. 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

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).slice(from, until)
    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
  123. def sliding(size: Int, step: 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

    step

    the distance between the first elements of successive groups (defaults to 1)

    returns

    An iterator producing iterable collections of size size, except the last and the only element will be truncated if there are fewer elements than size.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).sliding(size, step)
    Definition Classes
    IterableLike
    See also

    Iterator, method sliding

  124. def sliding(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 iterable collections of size size, except the last and the only element will be truncated if there are fewer elements than size.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).sliding(size)
    Definition Classes
    IterableLike
    See also

    Iterator, method sliding

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

    Sorts this Seq according to the Ordering which results from transforming an implicitly given Ordering with a transformation function.

    Sorts this Seq according to the Ordering which results from transforming an implicitly given Ordering with a transformation function.

    B

    the target type of the transformation f, and the type where the ordering ord is defined.

    f

    the transformation function mapping elements to some other domain B.

    ord

    the ordering assumed on domain B.

    returns

    a sequence consisting of the elements of this sequence sorted according to the ordering where x < y if ord.lt(f(x), f(y)).

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).sortBy(f)(ord)
    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

    Ordering

    Note: will not terminate for infinite-sized collections.

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

    Sorts this sequence according to a comparison function.

    Sorts this sequence according to a comparison function.

    Note: will not terminate for infinite-sized collections.

    The sort is stable. That is, elements that are equal (as determined by lt) appear in the same order in the sorted sequence as in the original.

    lt

    the comparison function which tests whether its first argument precedes its second argument in the desired ordering.

    returns

    a sequence consisting of the elements of this sequence sorted according to the comparison function lt.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).sortWith(lt)
    Definition Classes
    SeqLike
    Example:
    1. List("Steve", "Tom", "John", "Bob").sortWith(_.compareTo(_) < 0) =
      List("Bob", "John", "Steve", "Tom")
  127. def sorted[B >: A](implicit ord: Ordering[B]): NodeSeq

    Sorts this sequence according to an Ordering.

    Sorts this sequence according to an Ordering.

    The sort is stable. That is, elements that are equal (as determined by lt) appear in the same order in the sorted sequence as in the original.

    ord

    the ordering to be used to compare elements.

    returns

    a sequence consisting of the elements of this sequence sorted according to the ordering ord.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).sorted(ord)
    Definition Classes
    SeqLike
    See also

    Ordering

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

    Splits this traversable collection into a prefix/suffix pair according to a predicate.

    Splits this traversable collection 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.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    a pair consisting of the longest prefix of this traversable collection whose elements all satisfy p, and the rest of this traversable collection.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).span(p)
    Definition Classes
    TraversableLikeGenTraversableLike
  129. def splitAt(n: Int): (NodeSeq, NodeSeq)

    Splits this traversable collection into two at a given position.

    Splits this traversable collection into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the position at which to split.

    returns

    a pair of traversable collections consisting of the first n elements of this traversable collection, and the other elements.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).splitAt(n)
    Definition Classes
    TraversableLikeGenTraversableLike
  130. def startsWith[B](that: GenSeq[B], offset: Int): Boolean

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

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

    Note: If the both the receiver object this and the argument that are infinite sequences this method may not terminate.

    that

    the sequence to test

    offset

    the index where the sequence is searched.

    returns

    true if the sequence that is contained in this sequence at index offset, otherwise false.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).startsWith(that, offset)
    Definition Classes
    SeqLikeGenSeqLike
  131. def startsWith[B](that: GenSeq[B]): Boolean

    Tests whether this general sequence starts with the given sequence.

    Tests whether this general sequence starts with the given sequence.

    that

    the sequence to test

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).startsWith(that)
    Definition Classes
    GenSeqLike
  132. 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 traversable collection. By default the string prefix is the simple name of the collection class traversable collection.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).stringPrefix
    Definition Classes
    TraversableLikeGenTraversableLike
  133. def sum: A

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

    [use case]

    Sums up the elements of this collection.

    returns

    the sum of all elements in this traversable or iterator of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the traversable or iterator and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).sum
    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def sum[B >: A](implicit num: Numeric[B]): B

  134. def tail: NodeSeq

    Selects all elements except the first.

    Selects all elements except the first.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    a traversable collection consisting of all elements of this traversable collection except the first one.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).tail
    Definition Classes
    TraversableLikeGenTraversableLike
    Exceptions thrown
    `UnsupportedOperationException`

    if the traversable collection is empty.

  135. def tails: Iterator[NodeSeq]

    Iterates over the tails of this traversable collection.

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

    returns

    an iterator over all the tails of this traversable collection

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).tails
    Definition Classes
    TraversableLike
    Example:
    1. List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)

  136. def take(n: Int): NodeSeq

    Selects first n elements.

    Selects first n elements.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    Tt number of elements to take from this iterable collection.

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).take(n)
    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
  137. def takeRight(n: Int): NodeSeq

    Selects last n elements.

    Selects last n elements.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the number of elements to take

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).takeRight(n)
    Definition Classes
    IterableLike
  138. def takeWhile(p: (Node) ⇒ Boolean): NodeSeq

    Takes longest prefix of elements that satisfy a predicate.

    Takes longest prefix of elements that satisfy a predicate.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    the longest prefix of this iterable collection whose elements all satisfy the predicate p.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).takeWhile(p)
    Definition Classes
    IterableLikeTraversableLikeGenTraversableLike
  139. def to[Col[_]]: Col[A]

    [use case] Converts this traversable collection into another by copying all elements.

    [use case]

    Converts this traversable collection into another by copying all elements.

    Note: will not terminate for infinite-sized collections.

    Col

    The collection type to build.

    returns

    a new collection containing all elements of this traversable collection.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).to
    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
    Full Signature

    def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Node, Col[Node]]): Col[Node]

  140. def toArray: Array[A]

    [use case] Converts this traversable or iterator to an array.

    [use case]

    Converts this traversable or iterator to an array.

    Note: will not terminate for infinite-sized collections.

    returns

    an array containing all elements of this traversable or iterator. An ClassTag must be available for the element type of this traversable or iterator.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).toArray
    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]

  141. def toBuffer[B >: A]: Buffer[B]

    Converts this traversable or iterator to a mutable buffer.

    Converts this traversable or iterator to a mutable buffer.

    Note: will not terminate for infinite-sized collections.

    returns

    a buffer containing all elements of this traversable or iterator.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).toBuffer
    Definition Classes
    TraversableOnceGenTraversableOnce
  142. def toIndexedSeq: IndexedSeq[Node]

    Converts this traversable or iterator to an indexed sequence.

    Converts this traversable or iterator to an indexed sequence.

    Note: will not terminate for infinite-sized collections.

    returns

    an indexed sequence containing all elements of this traversable or iterator.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).toIndexedSeq
    Definition Classes
    TraversableOnceGenTraversableOnce
  143. def toIterable: Iterable[Node]

    Converts this iterable collection to an iterable collection.

    Converts this iterable collection 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 iterable collection.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).toIterable
    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  144. def toIterator: Iterator[Node]

    Returns an Iterator over the elements in this iterable collection.

    Returns an Iterator over the elements in this iterable collection. 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 iterable collection.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).toIterator
    Definition Classes
    IterableLikeTraversableLikeGenTraversableOnce
  145. def toList: List[Node]

    Converts this traversable or iterator to a list.

    Converts this traversable or iterator to a list.

    Note: will not terminate for infinite-sized collections.

    returns

    a list containing all elements of this traversable or iterator.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).toList
    Definition Classes
    TraversableOnceGenTraversableOnce
  146. def toMap[T, U]: Map[T, U]

    [use case] Converts this traversable or iterator to a map.

    [use case]

    Converts this traversable or iterator 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 of type immutable.Map[T, U] containing all key/value pairs of type (T, U) of this traversable or iterator.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).toMap
    Definition Classes
    TraversableOnceGenTraversableOnce
    Full Signature

    def toMap[T, U](implicit ev: <:<[Node, (T, U)]): Map[T, U]

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).toSeq
    Definition Classes
    SeqSeqLikeGenSeqLikeTraversableOnceGenTraversableOnce
  148. def toSet[B >: A]: Set[B]

    Converts this traversable or iterator to a set.

    Converts this traversable or iterator to a set.

    Note: will not terminate for infinite-sized collections.

    returns

    a set containing all elements of this traversable or iterator.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).toSet
    Definition Classes
    TraversableOnceGenTraversableOnce
  149. def toStream: Stream[Node]

    Converts this iterable collection to a stream.

    Converts this iterable collection to a stream.

    Note: will not terminate for infinite-sized collections.

    returns

    a stream containing all elements of this iterable collection.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).toStream
    Definition Classes
    IterableLikeTraversableLikeGenTraversableOnce
  150. def toString(): String

    Converts this immutable sequence to a string.

    Converts this immutable sequence to a string.

    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.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).toString()
    Definition Classes
    NodeSeqSeqLikeFunction1TraversableLike → AnyRef → Any
  151. def toTraversable: Traversable[Node]

    Converts this traversable collection to an unspecified Traversable.

    Converts this traversable collection 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 traversable collection.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).toTraversable
    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
  152. def toVector: Vector[Node]

    Converts this traversable or iterator to a Vector.

    Converts this traversable or iterator to a Vector.

    Note: will not terminate for infinite-sized collections.

    returns

    a vector containing all elements of this traversable or iterator.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).toVector
    Definition Classes
    TraversableOnceGenTraversableOnce
  153. def transpose[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): Seq[Seq[B]]

    Transposes this collection of traversable collections into a collection of collections.

    Transposes this collection of traversable collections into a collection of collections.

    B

    the type of the elements of each traversable collection.

    asTraversable

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

    returns

    a two-dimensional collection of collections which has as nth row the nth column of this collection.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).transpose(asTraversable)
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

    Exceptions thrown
    `IllegalArgumentException`

    if all collections in this collection are not of the same size.

  154. def union(that: Seq[Node]): `Seq`[Node]

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

    [use case]

    Produces a new sequence which contains all elements of this sequence and also all elements of a given sequence. xs union ys is equivalent to xs ++ ys.

    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.

    that

    the sequence to add.

    returns

    a new sequence which contains all elements of this sequence followed by all elements of that.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).union(that)
    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def union[B >: A, That](that: GenSeq[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

  155. def unzip[A1, A2](implicit asPair: (Node) ⇒ (A1, A2)): (Seq[A1], Seq[A2])

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

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

    A1

    the type of the first half of the element pairs

    A2

    the type of the second half of the element pairs

    asPair

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

    returns

    a pair collections, containing the first, respectively second half of each element pair of this collection.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).unzip(asPair)
    Definition Classes
    GenericTraversableTemplate
  156. def unzip3[A1, A2, A3](implicit asTriple: (Node) ⇒ (A1, A2, A3)): (Seq[A1], Seq[A2], Seq[A3])

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

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

    A1

    the type of the first member of the element triples

    A2

    the type of the second member of the element triples

    A3

    the type of the third member of the element triples

    asTriple

    an implicit conversion which asserts that the element type of this collection is a triple.

    returns

    a triple collections, containing the first, second, respectively third member of each element triple of this collection.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).unzip3(asTriple)
    Definition Classes
    GenericTraversableTemplate
  157. def updated(index: Int, elem: A): `Seq`[A]

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

    [use case]

    A copy of this sequence with one single replaced element.

    index

    the position of the replacement

    elem

    the replacing element

    returns

    a copy of this sequence with the element at position index replaced by elem.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).updated(index, elem)
    Definition Classes
    SeqLikeGenSeqLike
    Full Signature

    def updated[B >: A, That](index: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That

  158. def view(from: Int, until: Int): SeqView[Node, NodeSeq]

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

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

    Note: the difference between view and slice is that view produces a view of the current sequence, whereas slice produces a new sequence.

    Note: view(from, to) is equivalent to view.slice(from, to)

    from

    the index of the first element of the view

    until

    the index of the element following the view

    returns

    a non-strict view of a slice of this sequence, starting at index from and extending up to (but not including) index until.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).view(from, until)
    Definition Classes
    SeqLikeIterableLikeTraversableLike
  159. def view: SeqView[Node, NodeSeq]

    Creates a non-strict view of this sequence.

    Creates a non-strict view of this sequence.

    returns

    a non-strict view of this sequence.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).view
    Definition Classes
    SeqLikeIterableLikeTraversableLike
  160. def withFilter(p: (Node) ⇒ Boolean): FilterMonadic[Node, NodeSeq]

    Creates a non-strict filter of this traversable collection.

    Creates a non-strict filter of this traversable collection.

    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.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    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 traversable collection which satisfy the predicate p.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).withFilter(p)
    Definition Classes
    TraversableLikeFilterMonadic
  161. def withFilter(p: (Node) ⇒ Boolean): Iterator[Node]

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to MonadOps[Node] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: MonadOps[Node]).withFilter(p)
    Definition Classes
    MonadOps
  162. def zip[B](that: GenIterable[B]): Iterable[(A, B)]

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

    [use case]

    Returns a iterable collection formed from this iterable collection 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.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    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 iterable collection containing pairs consisting of corresponding elements of this iterable collection and that. The length of the returned collection is the minimum of the lengths of this iterable collection and that.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).zip(that)
    Definition Classes
    IterableLikeGenIterableLike
    Full Signature

    def zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That

  163. def zipAll[B](that: Iterable[B], thisElem: A, thatElem: B): Iterable[(A, B)]

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

    [use case]

    Returns a iterable collection formed from this iterable collection 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.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this iterable collection is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this iterable collection.

    returns

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

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).zipAll(that, thisElem, thatElem)
    Definition Classes
    IterableLikeGenIterableLike
    Full Signature

    def zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That

  164. def zipWithIndex: Iterable[(A, Int)]

    [use case] Zips this iterable collection with its indices.

    [use case]

    Zips this iterable collection with its indices.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    A new iterable collection containing pairs consisting of all elements of this iterable collection paired with their index. Indices start at 0.

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq).zipWithIndex
    Definition Classes
    IterableLikeGenIterableLike
    Full Signature

    def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[NodeSeq, (A1, Int), That]): That

    Example:
    1. List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))

Deprecated Value Members

  1. def /:\[A1 >: A](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.

    Example:

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = (a /:\ 5)(_+_)
    b: Int = 15
    Implicit information
    This member is added by an implicit conversion from NodeBuffer to NodeSeq performed by method seqToNodeSeq in scala.xml.NodeSeq.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (nodeBuffer: NodeSeq)./:\(z)(op)
    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

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

    Example:

    scala> val a = LinkedList(1,2,3,4)
    a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)
    
    scala> val b = (a /:\ 5)(_+_)
    b: Int = 15
    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

  3. def x: NodeBuffer

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to ArrowAssoc[NodeBuffer] performed by method any2ArrowAssoc in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (nodeBuffer: ArrowAssoc[NodeBuffer]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  4. def x: NodeBuffer

    Implicit information
    This member is added by an implicit conversion from NodeBuffer to Ensuring[NodeBuffer] performed by method any2Ensuring in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (nodeBuffer: Ensuring[NodeBuffer]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

Inherited from ArrayBuffer[Node]

Inherited from Serializable

Inherited from Serializable

Inherited from ResizableArray[Node]

Inherited from IndexedSeq[Node]

Inherited from IndexedSeq[Node]

Inherited from Builder[Node, ArrayBuffer[Node]]

Inherited from IndexedSeqLike[Node, ArrayBuffer[Node]]

Inherited from IndexedSeqLike[Node, ArrayBuffer[Node]]

Inherited from AbstractBuffer[Node]

Inherited from Buffer[Node]

Inherited from BufferLike[Node, ArrayBuffer[Node]]

Inherited from Subtractable[Node, ArrayBuffer[Node]]

Inherited from Scriptable[Node]

Inherited from Shrinkable[Node]

Inherited from Growable[Node]

Inherited from Clearable

Inherited from AbstractSeq[Node]

Inherited from Seq[Node]

Inherited from SeqLike[Node, ArrayBuffer[Node]]

Inherited from Cloneable[ArrayBuffer[Node]]

Inherited from Iterable[Node]

Inherited from Traversable[Node]

Inherited from Mutable

Inherited from AbstractSeq[Node]

Inherited from Seq[Node]

Inherited from SeqLike[Node, ArrayBuffer[Node]]

Inherited from GenSeq[Node]

Inherited from GenSeqLike[Node, ArrayBuffer[Node]]

Inherited from PartialFunction[Int, Node]

Inherited from (Int) ⇒ Node

Inherited from AbstractIterable[Node]

Inherited from Iterable[Node]

Inherited from IterableLike[Node, ArrayBuffer[Node]]

Inherited from Equals

Inherited from GenIterable[Node]

Inherited from GenIterableLike[Node, ArrayBuffer[Node]]

Inherited from AbstractTraversable[Node]

Inherited from Traversable[Node]

Inherited from GenTraversable[Node]

Inherited from TraversableLike[Node, ArrayBuffer[Node]]

Inherited from Parallelizable[Node, ParArray[Node]]

Inherited from TraversableOnce[Node]

Inherited from GenTraversableOnce[Node]

Inherited from FilterMonadic[Node, ArrayBuffer[Node]]

Inherited from HasNewBuilder[Node, ArrayBuffer[Node]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion seqToNodeSeq from NodeBuffer to NodeSeq

Inherited by implicit conversion traversable2ops from NodeBuffer to TraversableOps[Node]

Inherited by implicit conversion MonadOps from NodeBuffer to MonadOps[Node]

Inherited by implicit conversion flattenTraversableOnce from NodeBuffer to FlattenOps[Node]

Inherited by implicit conversion any2stringadd from NodeBuffer to StringAdd

Inherited by implicit conversion any2stringfmt from NodeBuffer to StringFormat

Inherited by implicit conversion any2ArrowAssoc from NodeBuffer to ArrowAssoc[NodeBuffer]

Inherited by implicit conversion any2Ensuring from NodeBuffer to Ensuring[NodeBuffer]

Inherited by implicit conversion alternateImplicit from NodeBuffer to ForceImplicitAmbiguity