scala.xml

NodeBuffer

class NodeBuffer extends ArrayBuffer[Node]

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

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

Source
NodeBuffer.scala
Version

1.0

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. NodeBuffer
  2. ArrayBuffer
  3. Serializable
  4. Serializable
  5. CustomParallelizable
  6. ResizableArray
  7. IndexedSeq
  8. IndexedSeq
  9. Builder
  10. IndexedSeqOptimized
  11. IndexedSeqOptimized
  12. IndexedSeqLike
  13. IndexedSeqLike
  14. Buffer
  15. BufferLike
  16. Subtractable
  17. Scriptable
  18. Shrinkable
  19. Growable
  20. Seq
  21. SeqLike
  22. Cloneable
  23. Seq
  24. SeqLike
  25. GenSeq
  26. GenSeqLike
  27. PartialFunction
  28. Function1
  29. Iterable
  30. Iterable
  31. IterableLike
  32. Equals
  33. GenIterable
  34. GenIterableLike
  35. Traversable
  36. Mutable
  37. Traversable
  38. GenTraversable
  39. GenericTraversableTemplate
  40. TraversableLike
  41. GenTraversableLike
  42. Parallelizable
  43. TraversableOnce
  44. GenTraversableOnce
  45. FilterMonadic
  46. HasNewBuilder
  47. AnyRef
  48. Any
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NodeBuffer ()

Type Members

  1. class Elements extends BufferedIterator[A] with Serializable

    The class of the iterator returned by the iterator method.

  2. type Self = ArrayBuffer[Node]

    The type implementing this traversable

    The type implementing this traversable

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

    A class supporting filtered operations.

Value Members

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

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

    Test two objects for inequality.

    Test two objects for inequality.

    returns

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

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

    Equivalent to x.hashCode except for boxed numeric types.

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

    returns

    a hash value consistent with ==

    Attributes
    final
    Definition Classes
    AnyRef → Any
  4. def &+ (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

  5. def ++ (xs: TraversableOnce[Node]): ArrayBuffer[Node]

    Definition Classes
    BufferLike
    Annotations
    @bridge()
  6. def ++ (xs: GenTraversableOnce[Node]): ArrayBuffer[Node]

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

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

    xs

    the traversable object.

    returns

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

    Definition Classes
    BufferLike
    Annotations
    @migration
    Migration

    "As of 2.8, ++ always creates a new collection, even on Buffers.\n"+ "Use ++= instead if you intend to add by side effect to an existing collection.\n"

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

    Definition Classes
    TraversableLike
    Annotations
    @bridge()
  8. def ++ [B] (that: GenTraversableOnce[B]): ArrayBuffer[B]

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

    [use case]

    Concatenates this arraybuffer with the elements of a traversable collection.

    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  9. def ++ [B >: Node, That] (that: GenTraversableOnce[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. This is usually the canBuildFrom value defined in object ArrayBuffer.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLike
  10. def ++: [B >: Node, That] (that: Traversable[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

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

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

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

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

    [use case]

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

    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Attributes
    abstract
    Definition Classes
    TraversableLike
  12. def ++: [B >: Node, 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. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

    B

    the element type of the returned collection.

    That

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

    that

    the traversable to append.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B. This is usually the canBuildFrom value defined in object ArrayBuffer.

    returns

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

    Definition Classes
    TraversableLike
  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 ++=: (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
  15. 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 collection of type That consisting of elem followed by all elements of this arraybuffer.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  16. def +: [B >: Node, 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. This is usually the canBuildFrom value defined in object ArrayBuffer.

    returns

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

    Definition Classes
    SeqLikeGenSeqLike
  17. 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
  18. 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
  19. 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
  20. def - (elem1: Node, elem2: Node, elems: Node*): ArrayBuffer[Node]

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

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

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

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

    Definition Classes
    BufferLikeSubtractable
    Annotations
    @migration
    Migration

    "As of 2.8, - always creates a new collection, even on Buffers.\n"+ "Use -= instead if you intend to remove by side effect from an existing collection.\n"

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

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

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

    elem

    the element to remove.

    returns

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

    Definition Classes
    BufferLikeSubtractable
    Annotations
    @migration
    Migration

    "As of 2.8, - always creates a new collection, even on Buffers.\n"+ "Use -= instead if you intend to remove by side effect from an existing collection.\n"

  22. def -- (xs: TraversableOnce[Node]): ArrayBuffer[Node]

    Definition Classes
    BufferLikeSubtractable
    Annotations
    @bridge()
  23. def -- (xs: GenTraversableOnce[Node]): ArrayBuffer[Node]

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

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

    xs

    the traversable object.

    returns

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

    Definition Classes
    BufferLikeSubtractable
    Annotations
    @migration
    Migration

    "As of 2.8, -- always creates a new collection, even on Buffers.\n"+ "Use --= instead if you intend to remove by side effect from an existing collection.\n"

  24. 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
  25. 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
  26. 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
  27. 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, x,,1,,), x,,2,,), ..., x,,n,,)
    

    where x,,1,,, ..., x,,n,, are the elements of this arraybuffer.

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

    A syntactic sugar for out of order folding.

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

    Definition Classes
    GenTraversableOnce
  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 collection of type That consisting of all elements of this arraybuffer followed by elem.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  30. def :+ [B >: Node, 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. This is usually the canBuildFrom value defined in object ArrayBuffer.

    returns

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

    Definition Classes
    SeqLikeGenSeqLike
  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(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))
    

    where x,,1,,, ..., x,,n,, are the elements of this arraybuffer.

    Definition Classes
    TraversableOnceGenTraversableOnce
  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

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

    Test two objects for equality.

    Test two objects for equality.

    returns

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

    Attributes
    final
    Definition Classes
    Any
  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 aggregate [B] (z: B)(seqop: (B, Node) ⇒ B, combop: (B, B) ⇒ B): B

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

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

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

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

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

    z

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

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Definition Classes
    TraversableOnceGenTraversableOnce
  39. 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
  40. 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
  41. 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
  42. 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
    ResizableArraySeqLikeGenSeqLikeFunction1
  43. var array : Array[AnyRef]

    Attributes
    protected
    Definition Classes
    ResizableArray
  44. def asInstanceOf [T0] : T0

    Cast the receiver object to be of type T0.

    Cast the receiver object to be of type T0.

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

    returns

    the receiver object.

    Attributes
    final
    Definition Classes
    Any
  45. 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
  46. 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
  47. 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
  48. 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 collection of type That resulting from applying the partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  49. 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. This is usually the canBuildFrom value defined in object ArrayBuffer.

    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
    TraversableLikeGenTraversableLike
  50. def collectFirst [B] (pf: PartialFunction[Node, B]): Option[B]

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

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

    pf

    the partial function

    returns

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

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

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

    Iterates over combinations.

    Iterates over combinations.

    returns

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

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

  52. def companion : GenericCompanion[ArrayBuffer]

    The factory companion object that builds instances of class ArrayBuffer.

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

    Definition Classes
    ArrayBufferResizableArrayIndexedSeqIndexedSeqBufferSeqSeqGenSeqIterableIterableGenIterableTraversableTraversableGenTraversableGenericTraversableTemplate
  53. def compose [A] (g: (A) ⇒ Int): (A) ⇒ Node

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

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

    A

    the type to which function g can be applied

    g

    a function A => T1

    returns

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

    Definition Classes
    Function1
  54. 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
  55. def containsSlice [B] (that: Seq[B]): Boolean

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

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

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

    that

    the sequence to test

    returns

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

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

    Move parts of the array.

    Move parts of the array.

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

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

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

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    starting index.

    len

    number of elements to copy

    Definition Classes
    ResizableArrayIndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  59. 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
    GenTraversableOnce
  60. def copyToArray [B >: Node] (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
    TraversableOnceGenTraversableOnce
  61. 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, beginning at index start. Copying will stop once either the end of the current arraybuffer is reached, or the end of the array is reached.

    xs

    the array to fill.

    start

    the starting index.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  62. def copyToArray [B >: Node] (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, beginning at index start. Copying will stop once either the end of the current arraybuffer is reached, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    Definition Classes
    TraversableOnceGenTraversableOnce
  63. def copyToBuffer [B >: Node] (dest: Buffer[B]): Unit

    Copies all elements of this arraybuffer to a buffer.

    Copies all elements of this arraybuffer to a buffer.

    dest

    The buffer to which elements are copied.

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

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

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

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

    B

    the type of the elements of that

    that

    the other sequence

    p

    the test predicate, which relates elements from both sequences

    returns

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

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

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

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

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    Definition Classes
    TraversableOnceGenTraversableOnce
  67. def diff [B >: Node] (that: Seq[B]): ArrayBuffer[Node]

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  68. 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 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.

    Attributes
    abstract
    Definition Classes
    SeqLike
  69. def diff [B >: Node] (that: GenSeq[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
    SeqLikeGenSeqLike
  70. def distinct : ArrayBuffer[Node]

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

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

    returns

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

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

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    n

    the number of elements to drop from this arraybuffer.

    returns

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

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

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

    The number of elements to take

    returns

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

    Definition Classes
    IndexedSeqOptimizedIterableLike
  73. 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
    IndexedSeqOptimizedTraversableLikeGenTraversableLike
  74. def endsWith [B] (that: GenSeq[B]): Boolean

    Tests whether this arraybuffer ends with the given sequence.

    Tests whether this arraybuffer ends with the given sequence.

    that

    the sequence to test

    returns

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

    Definition Classes
    IndexedSeqOptimizedSeqLikeGenSeqLike
  75. def endsWith [B] (that: Seq[B]): Boolean

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  76. 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
  77. def eq (arg0: AnyRef): Boolean

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

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

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

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

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

    returns

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

    Attributes
    final
    Definition Classes
    AnyRef
  78. def equals (that: Any): Boolean

    The equals method for arbitrary sequences.

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

    that

    The object to compare the sequence to

    returns

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

    Definition Classes
    GenSeqLikeEquals → AnyRef → Any
  79. def exists (p: (Node) ⇒ Boolean): Boolean

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

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

    p

    the predicate used to test elements.

    returns

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

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

    Selects all elements of this arraybuffer which satisfy a predicate.

    Selects all elements of this arraybuffer which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

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

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

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLike
  82. def finalize (): Unit

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

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

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

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

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  84. def flatMap [B] (f: (Node) ⇒ GenTraversableOnce[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 collection of type That resulting from applying the given collection-valued function f to each element of this arraybuffer and concatenating the results.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  85. def flatMap [B, That] (f: (Node) ⇒ GenTraversableOnce[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. This is usually the canBuildFrom value defined in object ArrayBuffer.

    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
    TraversableLikeGenTraversableLikeFilterMonadic
  86. 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
  87. def flatten [B] (implicit asTraversable: (Node) ⇒ TraversableOnce[B]): Traversable[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
    TraversableGenericTraversableTemplate
    Annotations
    @bridge()
  88. def fold [A1 >: Node] (z: A1)(op: (A1, A1) ⇒ A1): A1

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

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

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

    z

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

    op

    a binary operator that must be associative

    returns

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

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

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

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

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this arraybuffer, going left to right with the start value z on the left:

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

    where x,,1,,, ..., x,,n,, are the elements of this arraybuffer.

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

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

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

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this arraybuffer, going right to left with the start value z on the right:

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

    where x,,1,,, ..., x,,n,, are the elements of this arraybuffer.

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

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  92. 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
  93. 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.

    Definition Classes
    ResizableArrayIndexedSeqOptimizedIterableLikeGenericTraversableTemplateTraversableLikeGenTraversableLikeTraversableOnceGenTraversableOnceFilterMonadic
  94. 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
  95. def getClass (): java.lang.Class[_]

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

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

    The nature of the representation is platform dependent.

    returns

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

    Attributes
    final
    Definition Classes
    AnyRef → Any
  96. def groupBy [K] (f: (Node) ⇒ K): Map[K, ArrayBuffer[Node]]

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

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

    Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new arraybuffer.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to arraybuffers such that the following invariant holds:

                    (xs partition f)(k) = xs filter (x => f(x) == k)
    

    That is, every key k is bound to a arraybuffer of those elements x for which f(x) equals k.

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

    Partitions elements in fixed size arraybuffers.

    Partitions elements in fixed size arraybuffers.

    size

    the number of elements per group

    returns

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

    Definition Classes
    IterableLike
    See also

    Iterator#grouped

  98. def hasDefiniteSize : Boolean

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

    Tests whether this arraybuffer is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end.

    Note: many collection methods will not work on collections of infinite sizes.

    returns

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

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
  99. def hashCode (): Int

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

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

    returns

    the hash code value for this object.

    Definition Classes
    GenSeqLike → AnyRef → Any
  100. 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
    IndexedSeqOptimizedIterableLikeGenIterableLikeTraversableLikeGenTraversableLike
  101. 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
  102. 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
    GenSeqLike
  103. def indexOf [B >: Node] (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
    GenSeqLike
  104. 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
    GenSeqLike
  105. def indexOf [B >: Node] (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
    GenSeqLike
  106. def indexOfSlice [B >: Node] (that: Seq[B], from: Int): Int

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

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

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

    that

    the sequence to test

    from

    the start index

    returns

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

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

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

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

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

    that

    the sequence to test

    returns

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

    Definition Classes
    SeqLike
  110. def indexWhere (p: (Node) ⇒ Boolean, from: Int): Int

    Finds index of the first element satisfying some predicate after or at some start index.

    Finds index of the first element satisfying some predicate after or at some start index.

    p

    the predicate used to test elements.

    from

    the start index

    returns

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

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

    Finds index of first element satisfying some predicate.

    Finds index of first element satisfying some predicate.

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    GenSeqLike
  112. 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
  113. 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
  114. val initialSize : Int

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

    Iterates over the inits of this arraybuffer.

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

    returns

    an iterator over all the inits of this arraybuffer

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

  116. 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
  117. 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
  118. def intersect [B >: Node] (that: Seq[B]): ArrayBuffer[Node]

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  119. 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 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.

    Attributes
    abstract
    Definition Classes
    SeqLike
  120. def intersect [B >: Node] (that: GenSeq[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
    SeqLikeGenSeqLike
  121. def isDefinedAt (idx: Int): Boolean

    Tests whether this arraybuffer contains given index.

    Tests whether this arraybuffer contains given index.

    The implementations of methods apply and isDefinedAt turn a Seq[A] into a PartialFunction[Int, A].

    idx

    the index to test

    returns

    true if this arraybuffer contains an element at position idx, false otherwise.

    Definition Classes
    GenSeqLike
  122. def isEmpty : Boolean

    Tests whether the arraybuffer is empty.

    Tests whether the arraybuffer is empty.

    returns

    true if the arraybuffer contains no elements, false otherwise.

    Definition Classes
    IndexedSeqOptimizedIterableLikeGenIterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  123. def isInstanceOf [T0] : Boolean

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

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

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

    returns

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

    Attributes
    final
    Definition Classes
    Any
  124. 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
    GenTraversableLikeGenTraversableOnce
  125. def iterator : Iterator[Node]

    Creates a new iterator over all elements contained in this iterable object.

    Creates a new iterator over all elements contained in this iterable object.

    returns

    the new iterator

    Definition Classes
    IndexedSeqLikeIterableLikeGenIterableLike
  126. def last : Node

    Selects the last element.

    Selects the last element.

    returns

    The last element of this arraybuffer.

    Definition Classes
    IndexedSeqOptimizedTraversableLike
  127. 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
    GenSeqLike
  128. def lastIndexOf [B >: Node] (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
    GenSeqLike
  129. 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
    GenSeqLike
  130. def lastIndexOf [B >: Node] (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
    GenSeqLike
  131. def lastIndexOfSlice [B >: Node] (that: Seq[B], end: Int): Int

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

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

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

    that

    the sequence to test

    end

    the end index

    returns

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

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

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

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

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

    that

    the sequence to test

    returns

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

    Definition Classes
    SeqLike
  135. def lastIndexWhere (p: (Node) ⇒ Boolean, end: Int): Int

    Finds index of last element satisfying some predicate before or at given end index.

    Finds index of last element satisfying some predicate before or at given end index.

    p

    the predicate used to test elements.

    returns

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

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

    Finds index of last element satisfying some predicate.

    Finds index of last element satisfying some predicate.

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    GenSeqLike
  137. 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
  138. def length : Int

    Returns the length of this resizable array.

    Returns the length of this resizable array.

    returns

    the number of elements in this arraybuffer.

    Definition Classes
    ResizableArraySeqLikeGenSeqLike
  139. 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
  140. def lift : (Int) ⇒ Option[Node]

    Turns this partial function into an plain function returning an Option result.

    Turns this partial function into an plain function returning an Option result.

    returns

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

    Definition Classes
    PartialFunction
    See also

    Function.unlift

  141. 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 collection of type That resulting from applying the given function f to each element of this arraybuffer and collecting the results.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  142. 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. This is usually the canBuildFrom value defined in object ArrayBuffer.

    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
    TraversableLikeGenTraversableLikeFilterMonadic
  143. 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
  144. def max : Node

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  145. def max [B >: Node] (implicit cmp: Ordering[B]): Node

    Finds the largest element.

    Finds the largest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

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

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  147. def min : Node

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  148. def min [B >: Node] (implicit cmp: Ordering[B]): Node

    Finds the smallest element.

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

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

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  150. def mkString : String

    Displays all elements of this arraybuffer in a string.

    Displays all elements of this arraybuffer in a string.

    returns

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

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

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

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

    sep

    the separator string.

    returns

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

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

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

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

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

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    a string representation of this arraybuffer. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this arraybuffer are separated by the string sep.

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

  153. def ne (arg0: AnyRef): Boolean

    Equivalent to !(this eq that).

    Equivalent to !(this eq that).

    returns

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

    Attributes
    final
    Definition Classes
    AnyRef
  154. 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
  155. def nonEmpty : Boolean

    Tests whether the arraybuffer is not empty.

    Tests whether the arraybuffer is not empty.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  156. 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
  157. 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
  158. def orElse [A1 <: Int, B1 >: Node] (that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.

    Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.

    A1

    the argument type of the fallback function

    B1

    the result type of the fallback function

    that

    the fallback function

    returns

    a partial function which has as domain the union of the domains of this partial function and that. The resulting partial function takes x to this(x) where this is defined, and to that(x) where it is not.

    Definition Classes
    PartialFunction
  159. 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 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.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  160. def padTo [B >: Node, 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. This is usually the canBuildFrom value defined in object ArrayBuffer.

    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
    SeqLikeGenSeqLike
  161. def par : ParArray[Node]

    Returns a parallel implementation of this collection.

    Returns a parallel implementation of this collection.

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

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

    All parallel collections return a reference to themselves.

    returns

    a parallel implementation of this collection

    Definition Classes
    ArrayBufferCustomParallelizableParallelizable
  162. def parCombiner : Combiner[Node, ParArray[Node]]

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

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

    returns

    a combiner for the parallel collection of type ParRepr

    Attributes
    protected[this]
    Definition Classes
    CustomParallelizableParallelizable
  163. def partition (p: (Node) ⇒ Boolean): (ArrayBuffer[Node], ArrayBuffer[Node])

    Partitions this arraybuffer in two arraybuffers according to a predicate.

    Partitions this arraybuffer in two arraybuffers according to a predicate.

    p

    the predicate on which to partition.

    returns

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

    Definition Classes
    TraversableLikeGenTraversableLike
  164. def patch [B >: Node, That] (from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  165. def patch (from: Int, that: GenSeq[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
    GenSeqLike
  166. def patch [B >: Node, That] (from: Int, patch: GenSeq[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. This is usually the canBuildFrom value defined in object ArrayBuffer.

    returns

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

    Definition Classes
    SeqLikeGenSeqLike
  167. def permutations : Iterator[ArrayBuffer[Node]]

    Iterates over distinct permutations.

    Iterates over distinct permutations.

    returns

    An Iterator which traverses the distinct permutations of this arraybuffer.

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

  168. def prefixLength (p: (Node) ⇒ Boolean): Int

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

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

    p

    the predicate used to test elements.

    returns

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

    Definition Classes
    GenSeqLike
  169. 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
  170. 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
  171. def product : Node

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

    [use case]

    Multiplies up the elements of this collection.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  172. def product [B >: Node] (implicit num: Numeric[B]): B

    Multiplies up the elements of this collection.

    Multiplies up the elements of this collection.

    B

    the result type of the * operator.

    num

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

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  173. 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
  174. def reduce [A1 >: Node] (op: (A1, A1) ⇒ A1): A1

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

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

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

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

    op

    A binary operator that must be associative.

    returns

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

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

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

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

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

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

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

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

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

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

    op

    A binary operator that must be associative.

    returns

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

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

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

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

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

    where x,,1,,, ..., x,,n,, are the elements of this arraybuffer.

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

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

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

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  180. 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
  181. 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
  182. 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
  183. def repr : ArrayBuffer[Node]

    The collection of type arraybuffer underlying this TraversableLike object.

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

    Definition Classes
    TraversableLikeGenTraversableLike
  184. 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
  185. def reverse : ArrayBuffer[Node]

    Returns new arraybuffer wih elements in reversed order.

    Returns new arraybuffer wih elements in reversed order.

    returns

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

    Definition Classes
    IndexedSeqOptimizedSeqLikeGenSeqLike
  186. 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
  187. 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.

    f

    the function to apply to each element.

    returns

    a new collection of type That resulting from applying the given function f to each element of this 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.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  188. 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. This is usually the canBuildFrom value defined in object ArrayBuffer.

    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
    SeqLikeGenSeqLike
  189. def reversed : List[Node]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  190. def sameElements (that: GenIterable[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
    GenIterableLike
  191. def sameElements [B >: Node] (that: GenIterable[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
    IndexedSeqOptimizedIterableLikeGenIterableLike
  192. def sameElements [B >: Node] (that: Iterable[B]): Boolean

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  193. def scan [B >: Node, That] (z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

    Computes a prefix scan of the elements of the collection.

    Computes a prefix scan of the elements of the collection.

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

    B

    element type of the resulting collection

    That

    type of the resulting collection

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    cbf

    combiner factory which provides a combiner

    returns

    a new arraybuffer containing the prefix scan of the elements in this arraybuffer

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

    returns

    collection with intermediate results

    Definition Classes
    TraversableLikeGenTraversableLike
  195. 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. The head of the collection is the last cummulative result.

    Example:

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

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B. This is usually the canBuildFrom value defined in object ArrayBuffer.

    returns

    collection with intermediate results

    Definition Classes
    TraversableLikeGenTraversableLike
    Annotations
    @migration
    Migration

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

  196. def segmentLength (p: (Node) ⇒ Boolean, from: Int): Int

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

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

    p

    the predicate used to test elements.

    from

    the index where the search starts.

    returns

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

    Definition Classes
    IndexedSeqOptimizedSeqLikeGenSeqLike
  197. def seq : Seq[Node]

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

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

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

    returns

    a sequential view of the collection.

    Definition Classes
    SeqSeqGenSeqIterableIterableGenIterableTraversableTraversableGenTraversableParallelizableTraversableOnceGenTraversableOnce
  198. def size : Int

    The size of this arraybuffer, equivalent to length.

    The size of this arraybuffer, equivalent to length.

    returns

    the number of elements in this arraybuffer.

    Definition Classes
    SeqLikeGenTraversableLikeTraversableOnceGenTraversableOnce
  199. var size0 : Int

    Attributes
    protected
    Definition Classes
    ResizableArray
  200. 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
  201. def sizeHint (coll: scala.collection.TraversableLike[_, _], delta: Int = 0): Unit

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

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

    coll

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

    delta

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

    Definition Classes
    Builder
  202. 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
  203. def slice (from: Int, until: Int): ArrayBuffer[Node]

    Selects an interval of elements.

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

       from <= indexOf(x) < until
    
    from

    the lowest index to include from this arraybuffer.

    until

    the highest index to EXCLUDE from this arraybuffer.

    returns

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

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

    Definition Classes
    IterableLike
  205. def sliding [B >: Node] (size: Int): Iterator[ArrayBuffer[Node]]

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)

    size

    the number of elements per group

    returns

    An iterator producing arraybuffers of size size, except the last and the only element will be truncated if there are fewer elements than size.

    Definition Classes
    IterableLike
    See also

    Iterator#sliding

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

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

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

    B

    the target type of the transformation f, and the type where the ordering ord is defined.

    f

    the transformation function mapping elements to some other domain B.

    ord

    the ordering assumed on domain B.

    returns

    a arraybuffer consisting of the elements of this arraybuffer sorted according to the ordering where x < y if ord.lt(f(x), f(y)).

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

    scala.math.Ordering

  207. 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
    Example:
    1.    List("Steve", "Tom", "John", "Bob").sortWith(_.compareTo(_) < 0) =
         List("Bob", "John", "Steve", "Tom")
      
  208. def sorted [B >: Node] (implicit ord: Ordering[B]): ArrayBuffer[Node]

    Sorts this arraybuffer according to an Ordering.

    Sorts this arraybuffer according to an Ordering.

    The sort is stable. That is, elements that are equal 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

    scala.math.Ordering

  209. 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
    IndexedSeqOptimizedTraversableLikeGenTraversableLike
  210. def splitAt (n: Int): (ArrayBuffer[Node], ArrayBuffer[Node])

    Splits this arraybuffer into two at a given position.

    Splits this arraybuffer into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).

    n

    the position at which to split.

    returns

    a pair of arraybuffers consisting of the first n elements of this arraybuffer, and the other elements.

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

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

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

    If the both the receiver object, this and the argument, that are infinite sequences this method may not terminate.

    that

    the sequence to test

    offset

    the index where the sequence is searched.

    returns

    true if the sequence that is contained in this arraybuffer at index offset, otherwise false.

    Definition Classes
    IndexedSeqOptimizedSeqLikeGenSeqLike
  212. def startsWith [B] (that: Seq[B], offset: Int): Boolean

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  213. def startsWith [B] (that: Seq[B]): Boolean

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

    Tests whether this arraybuffer starts with the given sequence.

    Tests whether this arraybuffer starts with the given sequence.

    that

    the sequence to test

    returns

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

    Definition Classes
    GenSeqLike
  215. def stringPrefix : String

    Defines the prefix of the string representation.

    Defines the prefix of the string representation.

    returns

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

    Definition Classes
    ArrayBufferBufferLikeTraversableLikeGenTraversableLike
  216. def sum : Node

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

    [use case]

    Sums up the elements of this collection.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  217. def sum [B >: Node] (implicit num: Numeric[B]): B

    Sums up the elements of this collection.

    Sums up the elements of this collection.

    B

    the result type of the + operator.

    num

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

    returns

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

    Definition Classes
    TraversableOnceGenTraversableOnce
  218. def swap (a: Int, b: Int): Unit

    Swap two elements of this array.

    Swap two elements of this array.

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

    Attributes
    final
    Definition Classes
    AnyRef
  220. def tail : ArrayBuffer[Node]

    Selects all elements except the first.

    Selects all elements except the first.

    returns

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

    Definition Classes
    IndexedSeqOptimizedTraversableLikeGenTraversableLike
  221. def tails : Iterator[ArrayBuffer[Node]]

    Iterates over the tails of this arraybuffer.

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

    returns

    an iterator over all the tails of this arraybuffer

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

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

    Selects first n elements.

    Selects first n elements.

    n

    Tt number of elements to take from this arraybuffer.

    returns

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

    Definition Classes
    IndexedSeqOptimizedIterableLikeTraversableLikeGenTraversableLike
  223. 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
  224. 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
    IndexedSeqOptimizedIterableLikeTraversableLikeGenTraversableLike
  225. 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
  226. 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.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  227. def toArray [B >: Node] (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
    TraversableOnceGenTraversableOnce
  228. def toBuffer [A1 >: Node] : Buffer[A1]

    Overridden for efficiency

    Overridden for efficiency

    returns

    a buffer containing all elements of this arraybuffer.

    Definition Classes
    IndexedSeqLikeTraversableOnceGenTraversableOnce
  229. 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
  230. def toIndexedSeq [B >: Node] : 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
    TraversableOnceGenTraversableOnce
  231. def toIterable : Iterable[Node]

    Converts this arraybuffer to an iterable collection.

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

    returns

    an Iterable containing all elements of this arraybuffer.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  232. 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
    TraversableLikeGenTraversableOnce
  233. def toList : List[Node]

    Converts this arraybuffer to a list.

    Converts this arraybuffer to a list.

    returns

    a list containing all elements of this arraybuffer.

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

    [use case] Converts this arraybuffer to a map.

    [use case]

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

    returns

    a map containing all elements of this arraybuffer.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  235. 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 ((T, U)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    returns

    a map containing all elements of this arraybuffer.

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

    Converts this arraybuffer to a sequence.

    Converts this arraybuffer to a sequence.

    Overridden for efficiency.

    returns

    a sequence containing all elements of this arraybuffer.

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

    Converts this arraybuffer to a set.

    Converts this arraybuffer to a set.

    returns

    a set containing all elements of this arraybuffer.

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

    Converts this arraybuffer to a stream.

    Converts this arraybuffer to a stream.

    returns

    a stream containing all elements of this arraybuffer.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableOnce
  239. 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
  240. def toTraversable : Traversable[Node]

    Converts this arraybuffer to an unspecified Traversable.

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

    returns

    a Traversable containing all elements of this arraybuffer.

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
  241. def transform (f: (Node) ⇒ Node): NodeBuffer.this.type

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

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

    f

    the transformation to apply

    returns

    the sequence itself.

    Definition Classes
    SeqLike
  242. def transpose [B] (implicit asTraversable: (Node) ⇒ TraversableOnce[B]): Traversable[Traversable[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
    TraversableGenericTraversableTemplate
    Annotations
    @bridge()
  243. 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
  244. 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
  245. 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 collection of type That which contains all elements of this arraybuffer followed by all elements of that.

    Attributes
    abstract
    Definition Classes
    SeqLike
  246. def union [B >: Node, That] (that: GenSeq[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. This is usually the canBuildFrom value defined in object ArrayBuffer.

    returns

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

    Definition Classes
    SeqLikeGenSeqLike
  247. def union [B >: Node, That] (that: Seq[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

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

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

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

    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
  249. def unzip3 [A1, A2, A3] (implicit asTriple: (Node) ⇒ (A1, A2, A3)): (ArrayBuffer[A1], ArrayBuffer[A2], ArrayBuffer[A3])

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

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

    returns

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

    Definition Classes
    GenericTraversableTemplate
  250. 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
    ResizableArrayIndexedSeqLikeSeqLike
  251. 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 new arraybuffer which is a copy of this arraybuffer with the element at position index replaced by elem.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  252. def updated [B >: Node, 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. This is usually the canBuildFrom value defined in object ArrayBuffer.

    returns

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

    Definition Classes
    SeqLikeGenSeqLike
  253. 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.@note 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
  254. def view : IndexedSeqView[Node, ArrayBuffer[Node]]

    Creates a view of this iterable @see Iterable.

    Creates a view of this iterable @see Iterable.View

    returns

    a non-strict view of this arraybuffer.

    Definition Classes
    IndexedSeqLikeSeqLikeIterableLikeTraversableLike
  255. def wait (): Unit

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

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

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()
  258. 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
  259. def zip [B] (that: GenIterable[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 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.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  260. def zip [A1 >: Node, B, That] (that: GenIterable[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
    IndexedSeqOptimizedIterableLikeGenIterableLike
  261. def zip [A1 >: Node, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[ArrayBuffer[Node], (A1, B), That]): That

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  262. def zipAll [B, A1 >: Node, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[ArrayBuffer[Node], (A1, B), That]): That

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  263. 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.

    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.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  264. def zipAll [B, A1 >: Node, That] (that: GenIterable[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
    IterableLikeGenIterableLike
  265. def zipWithIndex : ArrayBuffer[(Node, Int)]

    [use case] Zips this arraybuffer with its indices.

    [use case]

    Zips this arraybuffer with its indices.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  266. def zipWithIndex [A1 >: Node, 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
    IndexedSeqOptimizedIterableLikeGenIterableLike

Deprecated Value Members

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

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

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

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

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

    replace by: buf ++= src.view(start, end)

  4. def elements : Iterator[Node]

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use iterator' instead

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

    use corresponds instead

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

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

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

    Definition Classes
    SeqLike
    Annotations
    @deprecated
    Deprecated

    Use indexWhere(p) instead.

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

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

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

    Definition Classes
    SeqLike
    Annotations
    @deprecated
    Deprecated

    use lastIndexWhere instead

  8. def first : Node

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use head' instead

  9. def firstOption : Option[Node]

    None if iterable is empty.

    None if iterable is empty.

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use headOption' instead

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

    use view' instead

  11. def reversedElements : Iterator[Node]

    Definition Classes
    SeqLike
    Annotations
    @deprecated
    Deprecated

    use reverseIterator' instead

Inherited from ArrayBuffer[Node]

Inherited from Serializable

Inherited from Serializable

Inherited from CustomParallelizable[Node, ParArray[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 Subtractable[Node, ArrayBuffer[Node]]

Inherited from Scriptable[Node]

Inherited from Shrinkable[Node]

Inherited from Growable[Node]

Inherited from Seq[Node]

Inherited from SeqLike[Node, ArrayBuffer[Node]]

Inherited from Cloneable[ArrayBuffer[Node]]

Inherited from Seq[Node]

Inherited from SeqLike[Node, ArrayBuffer[Node]]

Inherited from GenSeq[Node]

Inherited from GenSeqLike[Node, ArrayBuffer[Node]]

Inherited from PartialFunction[Int, Node]

Inherited from (Int) ⇒ Node

Inherited from Iterable[Node]

Inherited from Iterable[Node]

Inherited from IterableLike[Node, ArrayBuffer[Node]]

Inherited from Equals

Inherited from GenIterable[Node]

Inherited from GenIterableLike[Node, ArrayBuffer[Node]]

Inherited from Traversable[Node]

Inherited from Mutable

Inherited from Traversable[Node]

Inherited from GenTraversable[Node]

Inherited from GenericTraversableTemplate[Node, ArrayBuffer]

Inherited from TraversableLike[Node, ArrayBuffer[Node]]

Inherited from GenTraversableLike[Node, ArrayBuffer[Node]]

Inherited from Parallelizable[Node, ParArray[Node]]

Inherited from TraversableOnce[Node]

Inherited from GenTraversableOnce[Node]

Inherited from FilterMonadic[Node, ArrayBuffer[Node]]

Inherited from HasNewBuilder[Node, ArrayBuffer[Node]]

Inherited from AnyRef

Inherited from Any