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.

linear super types: ArrayBuffer[Node], ResizableArray[Node], IndexedSeq[Node], IndexedSeq[Node], Builder[Node, ArrayBuffer[Node]], IndexedSeqOptimized[Node, ArrayBuffer[Node]], IndexedSeqOptimized[Node, ArrayBuffer[Node]], IndexedSeqLike[Node, ArrayBuffer[Node]], IndexedSeqLike[Node, ArrayBuffer[Node]], Buffer[Node], BufferLike[Node, ArrayBuffer[Node]], Cloneable[ArrayBuffer[Node]], Subtractable[Node, ArrayBuffer[Node]], Scriptable[Node], Shrinkable[Node], Growable[Node], Seq[Node], Seq[Node], SeqLike[Node, ArrayBuffer[Node]], PartialFunction[Int, Node], (Int) ⇒ Node, Iterable[Node], Iterable[Node], IterableLike[Node, ArrayBuffer[Node]], Equals, Traversable[Node], Mutable, Traversable[Node], GenericTraversableTemplate[Node, ArrayBuffer], TraversableLike[Node, ArrayBuffer[Node]], TraversableOnce[Node], FilterMonadic[Node, ArrayBuffer[Node]], HasNewBuilder[Node, ArrayBuffer[Node]], AnyRef, Any
source: NodeBuffer.scala
    version
  1. 1.0

Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. NodeBuffer
  2. ArrayBuffer
  3. ResizableArray
  4. IndexedSeq
  5. IndexedSeq
  6. Builder
  7. IndexedSeqOptimized
  8. IndexedSeqOptimized
  9. IndexedSeqLike
  10. IndexedSeqLike
  11. Buffer
  12. BufferLike
  13. Cloneable
  14. Subtractable
  15. Scriptable
  16. Shrinkable
  17. Growable
  18. Seq
  19. Seq
  20. SeqLike
  21. PartialFunction
  22. Function1
  23. Iterable
  24. Iterable
  25. IterableLike
  26. Equals
  27. Traversable
  28. Mutable
  29. Traversable
  30. GenericTraversableTemplate
  31. TraversableLike
  32. TraversableOnce
  33. FilterMonadic
  34. HasNewBuilder
  35. AnyRef
  36. Any
Visibility
  1. Public
  2. All
Impl.
  1. Concrete
  2. Abstract

Instance constructors

  1. new NodeBuffer ()

Type Members

  1. class Elements extends BufferedIterator[A]

    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. def != (arg0: AnyRef) : Boolean

    attributes: final
    definition classes: AnyRef
  2. def != (arg0: Any) : Boolean

    o != arg0 is the same as !(o == (arg0)).

    o != arg0 is the same as !(o == (arg0)).

    arg0

    the object to compare against this object for dis-equality.

    returns

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

    attributes: final
    definition classes: Any
  3. def ## () : Int

    attributes: final
    definition classes: AnyRef → Any
  4. def $asInstanceOf [T0] () : T0

    attributes: final
    definition classes: AnyRef
  5. def $isInstanceOf [T0] () : Boolean

    attributes: final
    definition classes: AnyRef
  6. 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 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

  7. def + (elem1: Node, elem2: Node, elems: Node*) : ArrayBuffer[Node]

    Adds two or more elements to this collection and returns the collection itself.

    Adds two or more elements to this collection and returns the collection itself.

    Note that for backward compatibility reasons, this method mutates the collection in place, unlike similar but undeprecated methods throughout the collections hierarchy. You are strongly recommended to use '++=' instead.

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    definition classes: BufferLike
      deprecated:
    1. "Use ++= instead if you intend to add by side effect to an existing collection.\012".+("Use clone() ++=' if you intend to create a new collection.")

  8. def + (elem: Node) : ArrayBuffer[Node]

    Adds a single element to this collection and returns the collection itself.

    Adds a single element to this collection and returns the collection itself.

    Note that for backward compatibility reasons, this method mutates the collection in place, unlike similar but undeprecated methods throughout the collections hierarchy. You are strongly recommended to use '+=' instead.

    elem

    the element to add.

    definition classes: BufferLike
      deprecated:
    1. "Use += instead if you intend to add by side effect to an existing collection.\012".+("Use clone() +=' if you intend to create a new collection.")

  9. def ++ (xs: TraversableOnce[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
  10. def ++ (that: TraversableOnce[Node]) : ArrayBuffer[Node]

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

    [use case]

    Concatenates this arraybuffer with the elements of a traversable collection.

    that

    the traversable to append.

    returns

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

    attributes: abstract
    definition classes: TraversableLike
  11. def ++ [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]) : That

    Concatenates this arraybuffer with the elements of a traversable collection.

    Concatenates this arraybuffer with the elements of a traversable collection.

    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.

    returns

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

    definition classes: TraversableLike
  12. def ++: (xs: Traversable[Node]) : ArrayBuffer[Node]

    This method prepends elements to the buffer and returns the same buffer.

    This method prepends elements to the buffer and returns the same buffer.

    Note that for backward compatibility reasons, this method mutates the collection in place, unlike similar but undeprecated methods throughout the collections hierarchy. You are strongly recommended to use ++=: instead.

    xs

    elements to prepend

    returns

    this buffer

    attributes: final
    definition classes: BufferLike
      deprecated:
    1. use ++=: instead

  13. 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
  14. def ++= (src: Array[Node], start: Int, len: Int) : Unit

    Adds a number of elements in an array

    Adds a number of elements in an array

    src

    the array

    start

    the first element to append

    len

    the number of elements to append

    definition classes: BufferLike
      deprecated:
    1. replace by: buf ++= src.view(start, end)

  15. 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
  16. def +: (elem: Node) : ArrayBuffer[Node]

    This method prepends elements to the buffer and returns the same buffer.

    This method prepends elements to the buffer and returns the same buffer.

    Note that for backward compatibility reasons, this method mutates the collection in place, unlike similar but undeprecated methods throughout the collections hierarchy. You are strongly recommended to use +=: instead.

    returns

    this buffer

    attributes: final
    definition classes: BufferLike
      deprecated:
    1. use +=:' instead

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

    [use case] Prepends an element to this arraybuffer

    [use case]

    Prepends an element to this arraybuffer

    elem

    the prepended element

    returns

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

    attributes: abstract
    definition classes: SeqLike
  18. def +: [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]) : That

    Prepends an element to this arraybuffer

    Prepends an element to this arraybuffer

    B

    the element type of the returned arraybuffer.

    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.

    elem

    the prepended element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

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

    definition classes: SeqLike
  19. 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
  20. 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
  21. 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
  22. 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
  23. 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
  24. def -- (xs: TraversableOnce[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
  25. 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.

    returns

    the arraybuffer itself

    definition classes: Shrinkable
  26. 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
  27. 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
  28. 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.

    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, x1), x2), ..., xn) where x,,1,,, ..., x,,n,, are the elements of this arraybuffer.

    definition classes: TraversableOnce
  29. def :+ (elem: Node) : ArrayBuffer[Node]

    [use case] Appends an element to this arraybuffer

    [use case]

    Appends an element to this arraybuffer

    elem

    the appended element

    returns

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

    attributes: abstract
    definition classes: SeqLike
  30. def :+ [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]) : That

    Appends an element to this arraybuffer

    Appends an element to this arraybuffer

    B

    the element type of the returned arraybuffer.

    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.

    elem

    the appended element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

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

    definition classes: SeqLike
  31. 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.

    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(x1, op(x2, ... op(xn, z)...)) where x,,1,,, ..., x,,n,, are the elements of this arraybuffer.

    definition classes: TraversableOnce
  32. 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
  33. def == (arg0: AnyRef) : Boolean

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

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

    attributes: final
    definition classes: AnyRef
  34. def == (arg0: Any) : Boolean

    o == arg0 is the same as o.equals(arg0).

    o == arg0 is the same as o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

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

    attributes: final
    definition classes: Any
  35. 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.

    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableOnce
  36. 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.

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

    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
  38. 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
  39. 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
  40. 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
  41. def apply (idx: Int) : Node

    Selects an element by its index in the arraybuffer.

    Selects an element by its index in the arraybuffer.

    idx

    The index to select.

    returns

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

    definition classes: ResizableArraySeqLikeFunction1
  42. var array : Array[AnyRef]

    attributes: protected
    definition classes: ResizableArray
  43. def asInstanceOf [T0] : T0

    This method is used to cast the receiver object to be of type T0.

    This method is used to 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 expression1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expressionList(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 typed.

    returns

    the receiver object.

    attributes: final
    definition classes: Any
  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: ArrayBufferBuilderBufferLikeGrowable
  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[Node, 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.

    attributes: abstract
    definition classes: TraversableLike
  48. def collect [B, That] (pf: PartialFunction[Node, B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]) : That

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

    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.

    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.

    pf

    the partial function which filters and maps the arraybuffer.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

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

    definition classes: TraversableLike
  49. 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.)

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

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

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

    definition classes: Function1
  51. 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 is equal (wrt ==) to elem, false otherwise.

    definition classes: SeqLike
  52. def containsSlice [B] (that: Seq[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
  53. def copy (m: Int, n: Int, len: Int) : Unit

    Move parts of the array.

    Move parts of the array.

    attributes: protected
    definition classes: ResizableArray
  54. def copyToArray [B >: A] (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.

    xs

    the array to fill.

    start

    starting index.

    len

    number of elements to [email protected] B the type of the elements of the array.

  55. def copyToArray (xs: Array[Node]) : 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.

    attributes: abstract
    definition classes: TraversableOnce
  56. def copyToArray [B >: A] (xs: Array[B]) : Unit

    Copies values of this arraybuffer to an array.

    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.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    definition classes: TraversableOnce
  57. def copyToArray (xs: Array[Node], 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, after skipping start values. 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.

    attributes: abstract
    definition classes: TraversableOnce
  58. def copyToArray [B >: A] (xs: Array[B], start: Int) : Unit

    Copies values of this arraybuffer to an array.

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

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    definition classes: TraversableOnce
  59. def copyToBuffer [B >: A] (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
  60. def corresponds [B] (that: Seq[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: SeqLike
  61. 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: TraversableOnce
  62. 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.

    attributes: abstract
    definition classes: SeqLike
  63. def diff [B >: A] (that: Seq[B]) : ArrayBuffer[Node]

    Computes the multiset difference between this arraybuffer and another sequence.

    Computes the multiset difference between this arraybuffer and another sequence.

    B

    the element type of the returned arraybuffer.

    that

    the sequence of elements to remove

    returns

    a new collection of type That 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: SeqLike
  64. 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: SeqLike
  65. 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: IndexedSeqOptimizedTraversableLike
  66. 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 first n ones, or else the empty arraybuffer, if this arraybuffer has less than n elements.

    definition classes: IndexedSeqOptimizedIterableLike
  67. 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.

    p

    The predicate used to test elements.

    returns

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

    definition classes: IndexedSeqOptimizedTraversableLike
  68. def elements : Iterator[Node]

    definition classes: IterableLike
      deprecated:
    1. use iterator' instead

  69. def endsWith [B] (that: Seq[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: IndexedSeqOptimizedSeqLike
  70. 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
  71. def eq (arg0: AnyRef) : Boolean

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    The eq method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on non-null instances of AnyRef: * It is reflexive: for any non-null instance x of type AnyRef, x.eq(x) returns true. * It is symmetric: for any non-null instances x and y of type AnyRef, x.eq(y) returns true if and only if y.eq(x) returns true. * It is transitive: for any non-null instances x, y, and z of type AnyRef if x.eq(y) returns true and y.eq(z) returns true, then x.eq(z) returns true.

    Additionally, the eq method has three other 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).

    arg0

    the object to compare against this object for reference equality.

    returns

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

    attributes: final
    definition classes: AnyRef
  72. def equals (that: Any) : Boolean

    The equality method defined in AnyRef.

    The equality method defined in AnyRef[email protected] true if the receiver object is equivalent to the argument; false otherwise. */

    definition classes: SeqLikeEquals → AnyRef → Any
  73. def equalsWith [B] (that: Seq[B])(f: (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

    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: SeqLike
      deprecated:
    1. use corresponds instead

  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.

  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: TraversableLike
  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: TraversableLike
  77. def finalize () : Unit

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

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

    attributes: protected[lang]
    definition classes: 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.

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

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

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

    definition classes: SeqLike
  80. def findLastIndexOf (p: (Node) ⇒ Boolean) : Int

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

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

    definition classes: SeqLike
      deprecated:
    1. use lastIndexWhere instead

  81. def first : Node

    definition classes: IterableLike
      deprecated:
    1. use head' instead

  82. def firstOption : Option[Node]

    None if iterable is empty.

    None if iterable is empty.

    definition classes: IterableLike
      deprecated:
    1. use headOption' instead

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

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

    [use case]

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

    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.

    attributes: abstract
    definition classes: TraversableLike
  84. def flatMap [B, That] (f: (Node) ⇒ Traversable[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]) : That

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

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

    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.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

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

    definition classes: TraversableLikeFilterMonadic
  85. def flatten [B] : ArrayBuffer[B]

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

    [use case]

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

    B

    the type of the elements of each traversable collection.

    returns

    a new arraybuffer resulting from concatenating all element arraybuffers.

    attributes: abstract
    definition classes: GenericTraversableTemplate
  86. def flatten [B] (implicit asTraversable: (Node) ⇒ Traversable[B]) : ArrayBuffer[B]

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

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

    B

    the type of the elements of each traversable collection.

    asTraversable

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

    returns

    a new arraybuffer resulting from concatenating all element arraybuffers.

    definition classes: GenericTraversableTemplate
  87. 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, x1), x2, ..., xn) where x,,1,,, ..., x,,n,, are the elements of this arraybuffer.

    definition classes: IndexedSeqOptimizedTraversableOnce
  88. 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(x1, op(x2, ... op(xn, z)...)) where x,,1,,, ..., x,,n,, are the elements of this arraybuffer.

    definition classes: IndexedSeqOptimizedIterableLikeTraversableOnce
  89. 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.

  90. def foreach (f: (Node) ⇒ 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.

    f

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

    attributes: abstract
    definition classes: IterableLike
  91. def foreach [U] (f: (Node) ⇒ U) : Unit

    Applies a function f to all elements of this arraybuffer.

    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.

    U

    the type parameter describing the result of function f. This result will always be ignored. Typically U is Unit, but this is not necessary.

    f

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

  92. 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
  93. def getClass () : java.lang.Class[_ <: java.lang.Object]

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

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

    The nature of the representation is platform dependent.

    returns

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

    attributes: final
    definition classes: AnyRef
  94. 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: TraversableLike
  95. 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:
    1. Iterator#grouped

  96. 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: TraversableLikeTraversableOnce
  97. 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 [email protected] the hash code value for the object. */

    definition classes: SeqLike → AnyRef → Any
  98. 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: IndexedSeqOptimizedIterableLikeTraversableLike
  99. 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: TraversableLike
  100. 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.

    attributes: abstract
    definition classes: SeqLike
  101. def indexOf [B >: A] (elem: B, from: Int) : Int

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

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

    B

    the type of the element elem.

    elem

    the element value to search for.

    from

    the start index

    returns

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

    definition classes: SeqLike
  102. 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.

    attributes: abstract
    definition classes: SeqLike
  103. def indexOf [B >: A] (elem: B) : Int

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

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

    B

    the type of the element elem.

    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: SeqLike
  104. def indexOfSlice [B >: A] (that: Seq[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
  105. def indexOfSlice [B >: A] (that: Seq[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
  106. 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: IndexedSeqOptimizedSeqLike
  107. 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: SeqLike
  108. 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
  109. 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: IndexedSeqOptimizedTraversableLike
  110. val initialSize : Int

    attributes: protected
    definition classes: ArrayBufferResizableArray
  111. 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
  112. 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
  113. 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.

    attributes: abstract
    definition classes: SeqLike
  114. def intersect [B >: A] (that: Seq[B]) : ArrayBuffer[Node]

    Computes the multiset intersection between this arraybuffer and another sequence.

    Computes the multiset intersection between this arraybuffer and another sequence.

    B

    the element type of the returned arraybuffer.

    that

    the sequence of elements to intersect with.

    returns

    a new collection of type That 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: SeqLike
  115. 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: SeqLike
  116. 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.

  117. def isInstanceOf [T0] : Boolean

    This method is used to test whether the dynamic type of the receiver object is T0.

    This method is used to test whether the dynamic type of the receiver object is T0.

    Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression1.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 requested typed.

    returns

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

    attributes: final
    definition classes: Any
  118. def isTraversableAgain : Boolean

    Tests whether this arraybuffer can be repeatedly traversed.

    Tests whether this arraybuffer can be repeatedly traversed.

    returns

    true

    attributes: final
    definition classes: TraversableLikeTraversableOnce
  119. 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: IndexedSeqLikeIterableLike
  120. def last : Node

    Selects the last element.

    Selects the last element.

    returns

    The last element of this arraybuffer.

    definition classes: IndexedSeqOptimizedTraversableLike
  121. 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.

    attributes: abstract
    definition classes: SeqLike
  122. def lastIndexOf [B >: A] (elem: B, end: Int) : Int

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

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

    B

    the type of the element elem.

    elem

    the element value to search for.

    end

    the end index.

    returns

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

    definition classes: SeqLike
  123. 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.

    attributes: abstract
    definition classes: SeqLike
  124. def lastIndexOf [B >: A] (elem: B) : Int

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

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

    B

    the type of the element elem.

    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: SeqLike
  125. def lastIndexOfSlice [B >: A] (that: Seq[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
  126. def lastIndexOfSlice [B >: A] (that: Seq[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
  127. 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: IndexedSeqOptimizedSeqLike
  128. 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: SeqLike
  129. 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: TraversableLike
  130. def length : Int

    Returns the length of this resizable array.

    Returns the length of this resizable [email protected] the number of elements in this arraybuffer.

    definition classes: ResizableArraySeqLike
  131. 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
  132. 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
  133. def map [B] (f: (Node) ⇒ 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.

    attributes: abstract
    definition classes: TraversableLike
  134. def map [B, That] (f: (Node) ⇒ B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]) : That

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

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

    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.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

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

    definition classes: TraversableLikeFilterMonadic
  135. 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
  136. def max : Node

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this arraybuffer.

    attributes: abstract
    definition classes: TraversableOnce
  137. def max [B >: A] (implicit cmp: Ordering[B]) : Node

    Finds the largest element.

    Finds the largest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the largest element of this arraybuffer with respect to the ordering cmp.

    definition classes: TraversableOnce
  138. def min : Node

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this arraybuffer

    attributes: abstract
    definition classes: TraversableOnce
  139. def min [B >: A] (implicit cmp: Ordering[B]) : Node

    Finds the smallest element.

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the smallest element of this arraybuffer with respect to the ordering cmp.

    definition classes: TraversableOnce
  140. 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: TraversableOnce
  141. 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: TraversableOnce
  142. 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: TraversableOnce
  143. def ne (arg0: AnyRef) : Boolean

    o.ne(arg0) is the same as !(o.eq(arg0)).

    o.ne(arg0) is the same as !(o.eq(arg0)).

    arg0

    the object to compare against this object for reference dis-equality.

    returns

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

    attributes: final
    definition classes: AnyRef
  144. 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
  145. 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: TraversableOnce
  146. def notify () : Unit

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

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

    attributes: final
    definition classes: AnyRef
  147. def notifyAll () : Unit

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

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

    attributes: final
    definition classes: AnyRef
  148. 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.

    definition classes: PartialFunction
  149. def padTo (len: Int, elem: Node) : ArrayBuffer[Node]

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

    [use case]

    Appends an element value to this arraybuffer 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.

    attributes: abstract
    definition classes: SeqLike
  150. def padTo [B >: A, That] (len: Int, elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]) : That

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

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

    B

    the element type of the returned arraybuffer.

    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.

    len

    the target length

    elem

    the padding value

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

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

    definition classes: SeqLike
  151. 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: TraversableLike
  152. def patch (from: Int, that: Seq[Node], replaced: Int) : ArrayBuffer[Node]

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

    attributes: abstract
    definition classes: SeqLike
  153. def patch [B >: A, That] (from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]) : That

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

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

    B

    the element type of the returned arraybuffer.

    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.

    from

    the index of the first replaced element

    patch

    the replacement sequence

    replaced

    the number of elements to drop in the original arraybuffer

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

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

    definition classes: SeqLike
  154. 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: SeqLike
  155. 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
  156. 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.

    definition classes: BufferLike
  157. def product : Node

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

    [use case]

    Multiplies up the elements of this collection.

    returns

    the product of all elements 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.

    attributes: abstract
    definition classes: TraversableOnce
  158. def product [B >: A] (implicit num: Numeric[B]) : B

    Multiplies up the elements of this collection.

    Multiplies up the elements of this collection.

    B

    the result type of the * operator.

    num

    an implicit parameter defining a set of numeric operations which includes the * operator to be used in forming the product.

    returns

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

    definition classes: TraversableOnce
  159. def projection : SeqView[Node, ArrayBuffer[Node]]

    returns a projection that can be used to call non-strict filter,map, and flatMap methods that build projections of the collection.

    returns a projection that can be used to call non-strict filter,map, and flatMap methods that build projections of the collection.

    definition classes: SeqLikeIterableLike
      deprecated:
    1. use view' instead

  160. 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
  161. def reduceLeft [B >: A] (op: (B, Node) ⇒ B) : B

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

    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

    the result of inserting op between consecutive elements of this arraybuffer, going left to right: op(...(op(x1, x2), ... ) , xn) where x,,1,,, ..., x,,n,, are the elements of this arraybuffer.

    definition classes: IndexedSeqOptimizedTraversableOnce
  162. def reduceLeftOption [B >: A] (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: TraversableOnce
  163. def reduceRight [B >: A] (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(x1, op(x2, ..., op(xn-1, xn)...)) where x,,1,,, ..., x,,n,, are the elements of this arraybuffer.

    definition classes: IndexedSeqOptimizedIterableLikeTraversableOnce
  164. def reduceRightOption [B >: A] (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: TraversableOnce
  165. 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
  166. 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
  167. 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
  168. 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: TraversableLike
  169. 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
  170. 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: IndexedSeqOptimizedSeqLike
  171. 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
  172. def reverseMap [B] (f: (Node) ⇒ 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.

    B

    the element type of the returned collection.

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

    f

    the function to apply to each element.

    returns

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

    attributes: abstract
    definition classes: SeqLike
  173. def reverseMap [B, That] (f: (Node) ⇒ B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]) : That

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

    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.

    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.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

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

    definition classes: SeqLike
  174. def reversed : List[Node]

    attributes: protected[this]
    definition classes: TraversableOnce
  175. def reversedElements : Iterator[Node]

    definition classes: SeqLike
      deprecated:
    1. use reverseIterator' instead

  176. def sameElements (that: Iterable[Node]) : 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.

    attributes: abstract
    definition classes: IterableLike
  177. def sameElements [B >: A] (that: Iterable[B]) : Boolean

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

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

    B

    the type of the elements of collection that.

    that

    the collection to compare with.

    returns

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

    definition classes: IndexedSeqOptimizedIterableLike
  178. def scanLeft [B, That] (z: B)(op: (B, Node) ⇒ B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]) : That

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

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

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    collection with intermediate results

    definition classes: TraversableLike
  179. def scanRight [B, That] (z: B)(op: (Node, B) ⇒ B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]) : That

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

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

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    collection with intermediate results

    definition classes: TraversableLike
  180. 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: IndexedSeqOptimizedSeqLike
  181. 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: SeqLikeTraversableOnce
  182. var size0 : Int

    attributes: protected
    definition classes: ResizableArray
  183. 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
  184. 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 ot 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
  185. 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
  186. def slice (from: Int, until: Int) : ArrayBuffer[Node]

    Selects an interval of elements.

    Selects an interval of elements.

    Note: c.slice(from, to) is equivalent to (but possibly more efficient than) c.drop(from).take(to - from)

    from

    the index of the first returned element in this arraybuffer.

    until

    the index one past the last returned element in this arraybuffer.

    returns

    a arraybuffer containing the elements starting at index from and extending up to (but not including) index until of this arraybuffer.

    definition classes: IndexedSeqOptimizedIterableLikeTraversableLike
  187. def sliding [B >: A] (size: Int, step: Int) : Iterator[ArrayBuffer[Node]]

    definition classes: IterableLike
  188. def sliding [B >: A] (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:
    1. Iterator#sliding

  189. 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
      see also:
    1. scala.math.Ordering

  190. 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 wrt lt appear in the same order in the sorted sequence as in the original.

    lt

    the comparison function which tests whether its first argument precedes its second argument in the desired ordering.

    returns

    a arraybuffer consisting of the elements of this arraybuffer sorted according to the comparison function lt.

    definition classes: SeqLike
  191. def sorted [B >: A] (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 wrt lt appear in the same order in the sorted sequence as in the original.

    ord

    the ordering to be used to compare elements.

    returns

    a arraybuffer consisting of the elements of this arraybuffer sorted according to the ordering ord.

    definition classes: SeqLike
      see also:
    1. scala.math.Ordering

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

    p

    the test predicate

    returns

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

    definition classes: IndexedSeqOptimizedTraversableLike
  193. 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: IndexedSeqOptimizedTraversableLike
  194. def startsWith [B] (that: Seq[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.

    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: IndexedSeqOptimizedSeqLike
  195. def startsWith [B] (that: Seq[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: SeqLike
  196. def stringPrefix : String

    Defines the prefix of the string representation.

    Defines the prefix of the string [email protected] a string representation which starts the result of toString applied to this set. Unless overridden this is simply "Buffer".

    definition classes: ArrayBufferBufferLikeTraversableLike
  197. def sum : Node

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

    [use case]

    Sums up the elements of this collection.

    returns

    the sum of all elements 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.

    attributes: abstract
    definition classes: TraversableOnce
  198. def sum [B >: A] (implicit num: Numeric[B]) : B

    Sums up the elements of this collection.

    Sums up the elements of this collection.

    B

    the result type of the + operator.

    num

    an implicit parameter defining a set of numeric operations which includes the + operator to be used in forming the sum.

    returns

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

    definition classes: TraversableOnce
  199. def swap (a: Int, b: Int) : Unit

    Swap two elements of this array.

    Swap two elements of this array.

    attributes: protected
    definition classes: ResizableArray
  200. def synchronized [T0] (arg0: T0) : T0

    attributes: final
    definition classes: AnyRef
  201. 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: IndexedSeqOptimizedTraversableLike
  202. 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: IndexedSeqOptimizedIterableLikeTraversableLike
  203. 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
  204. 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.

    p

    The predicate used to test elements.

    returns

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

    definition classes: IndexedSeqOptimizedIterableLikeTraversableLike
  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 toArray : Array[Node]

    [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. A ClassManifest must be available for the element type of this arraybuffer.

    attributes: abstract
    definition classes: TraversableOnce
  207. def toArray [B >: A] (implicit arg0: ClassManifest[B]) : Array[B]

    Converts this arraybuffer to an array.

    Converts this arraybuffer to an array.

    B

    the type of the elements of the array. A ClassManifest for this type must be available.

    returns

    an array containing all elements of this arraybuffer.

    definition classes: TraversableOnce
  208. def toBuffer [B >: A] : Buffer[B]

    Converts this arraybuffer to a mutable buffer.

    Converts this arraybuffer to a mutable buffer.

    returns

    a buffer containing all elements of this arraybuffer.

    definition classes: TraversableOnce
  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 [B >: A] : IndexedSeq[B]

    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: TraversableOnce
  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: IterableLikeTraversableOnce
  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: TraversableLikeTraversableOnce
  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: TraversableOnce
  214. def toMap [T, U] (implicit ev: <:<[Node, (T, U)]) : Map[T, U]

    Converts this arraybuffer to a map.

    Converts this arraybuffer to a map. This method is unavailable unless the elements are members of Tuple2, each ((K, V)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    returns

    a map containing all elements of this arraybuffer.

    definition classes: TraversableOnce
  215. def toSeq : Seq[Node]

    Converts this arraybuffer to a sequence.

    Converts this arraybuffer to a sequence.

    Overridden for [email protected] a sequence containing all the elements of this arraybuffer.

    definition classes: SeqLikeIterableLikeTraversableOnce
  216. def toSet [B >: A] : 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: TraversableOnce
  217. 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: IterableLikeTraversableLikeTraversableOnce
  218. 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: SeqLikeTraversableLike → AnyRef → Any
  219. 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: TraversableLikeTraversableOnce
  220. def transpose [B] (implicit asTraversable: (Node) ⇒ Traversable[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
  221. 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
  222. 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
  223. 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.

    that

    the sequence to add.

    returns

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

    attributes: abstract
    definition classes: SeqLike
  224. def union [B >: A, That] (that: Seq[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]) : That

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

    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.

    B

    the element type of the returned arraybuffer.

    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 sequence to add.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

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

    definition classes: SeqLike
  225. 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 halfs of each pair.

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

    asPair

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

    returns

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

    definition classes: GenericTraversableTemplate
  226. 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.

    elem

    the new value.

    definition classes: ResizableArrayIndexedSeqLikeSeq
  227. def updated (index: Int, elem: Node) : ArrayBuffer[Node]

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

    attributes: abstract
    definition classes: SeqLike
  228. def updated [B >: A, That] (index: Int, elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]) : That

    A copy of this arraybuffer with one single replaced element.

    A copy of this arraybuffer with one single replaced element.

    B

    the element type of the returned arraybuffer.

    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.

    index

    the position of the replacement

    elem

    the replacing element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

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

    definition classes: SeqLike
  229. 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
  230. def view : IndexedSeqView[Node, ArrayBuffer[Node]]

    Creates a view of this iterable @see Iterable.

    Creates a view of this iterable @see [email protected] a non-strict view of this arraybuffer.

    definition classes: IndexedSeqLikeSeqLikeIterableLikeTraversableLike
  231. def wait () : Unit

    attributes: final
    definition classes: AnyRef
  232. def wait (arg0: Long, arg1: Int) : Unit

    attributes: final
    definition classes: AnyRef
  233. def wait (arg0: Long) : Unit

    attributes: final
    definition classes: AnyRef
  234. 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
  235. def zip [B] (that: Iterable[B]) : ArrayBuffer[(Node, 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.

    attributes: abstract
    definition classes: IterableLike
  236. def zip [A1 >: A, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], (A1, B), That]) : That

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

    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.

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    B

    the type of the second half of the returned pairs

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, B) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That]. is found.

    that

    The iterable providing the second half of each result pair

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type (A1, B).

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this arraybuffer and that. The length of the returned collection is the minimum of the lengths of this arraybuffer and that.

    definition classes: IndexedSeqOptimizedIterableLike
  237. def zipAll [B] (that: Iterable[B], thisElem: Node, thatElem: B) : ArrayBuffer[(Node, 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.

    attributes: abstract
    definition classes: IterableLike
  238. def zipAll [B, A1 >: A, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], (A1, B), That]) : That

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

    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.

    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 collection of type That 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: IterableLike
  239. def zipWithIndex : ArrayBuffer[(Node, 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. @example List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))

    attributes: abstract
    definition classes: IterableLike
  240. def zipWithIndex [A1 >: A, That] (implicit bf: CanBuildFrom[ArrayBuffer[Node], (A1, Int), That]) : That

    Zips this arraybuffer with its indices.

    Zips this arraybuffer with its indices.

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, Int) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That]. is found.

    returns

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

    definition classes: IndexedSeqOptimizedIterableLike

Inherited from ArrayBuffer[Node]

Inherited from ResizableArray[Node]

Inherited from IndexedSeq[Node]

Inherited from IndexedSeq[Node]

Inherited from Builder[Node, ArrayBuffer[Node]]

Inherited from IndexedSeqOptimized[Node, ArrayBuffer[Node]]

Inherited from IndexedSeqOptimized[Node, ArrayBuffer[Node]]

Inherited from IndexedSeqLike[Node, ArrayBuffer[Node]]

Inherited from IndexedSeqLike[Node, ArrayBuffer[Node]]

Inherited from Buffer[Node]

Inherited from BufferLike[Node, ArrayBuffer[Node]]

Inherited from Cloneable[ArrayBuffer[Node]]

Inherited from Subtractable[Node, ArrayBuffer[Node]]

Inherited from Scriptable[Node]

Inherited from Shrinkable[Node]

Inherited from Growable[Node]

Inherited from Seq[Node]

Inherited from Seq[Node]

Inherited from SeqLike[Node, ArrayBuffer[Node]]

Inherited from PartialFunction[Int, Node]

Inherited from (Int) ⇒ Node

Inherited from Iterable[Node]

Inherited from Iterable[Node]

Inherited from IterableLike[Node, ArrayBuffer[Node]]

Inherited from Equals

Inherited from Traversable[Node]

Inherited from Mutable

Inherited from Traversable[Node]

Inherited from GenericTraversableTemplate[Node, ArrayBuffer]

Inherited from TraversableLike[Node, ArrayBuffer[Node]]

Inherited from TraversableOnce[Node]

Inherited from FilterMonadic[Node, ArrayBuffer[Node]]

Inherited from HasNewBuilder[Node, ArrayBuffer[Node]]

Inherited from AnyRef

Inherited from Any