Scaladoc for scala.xml.NodeBuffer

Inherits

ArrayBuffer
ResizableArray
IndexedSeq
IndexedSeq
Builder
IndexedSeqLike
IndexedSeqLike
Buffer
BufferLike
Cloneable
Subtractable
Addable
Scriptable
Shrinkable
Growable
Seq
Seq
SeqLike
PartialFunction
Function1
Iterable
Iterable
IterableLike
Equals
Traversable
Mutable
Traversable
GenericTraversableTemplate
TraversableLike
HasNewBuilder
AnyRef
Any

Type Members

class WithFilter extends AnyRef

A class supporting filtered operations

Value Members

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

elem1
the first element to add.
elem2
the second element to add.
elems
the remaining elements to add.
returns
a new buffer with the given elements added.

definition classes: BufferLike ⇐ Addable
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.

elem
the element to add.
returns
a fresh collection with elem added.

definition classes: BufferLike ⇐ Addable
def ++(iter: Iterator[Node]): ArrayBuffer[Node]

Adds a number of elements provided by an iterator and returns the collection itself

Adds a number of elements provided by an iterator and returns the collection itself.

iter
the iterator
returns
a new buffer with the given elements added.

definition classes: BufferLike ⇐ Addable
def ++(iter: Traversable[Node]): ArrayBuffer[Node]

Adds a number of elements provided by a traversable object and returns either the collection itself

Adds a number of elements provided by a traversable object and returns either the collection itself.

iter
the iterable object.
returns
a new buffer with the given elements added.

definition classes: BufferLike ⇐ Addable
def ++(that: Iterator[Node]): Traversable[Node]

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

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

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

Concatenates this buffer with the elements of an iterator

Concatenates this buffer with the elements of an iterator.

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

definition classes: TraversableLike
def ++(that: Traversable[Node]): Traversable[Node]

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

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

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

Concatenates this buffer with the elements of a traversable collection

Concatenates this buffer with the elements of a traversable collection.

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

definition classes: TraversableLike
def ++=(iter: Traversable[Node]): ArrayBuffer[Node]

Appends a number of elements provided by an iterable object via its iterator method

Appends a number of elements provided by an iterable object via its iterator method. The identity of the buffer is returned.

iter
the iterfable object.
returns
the updated buffer.

definition classes: ArrayBuffer ⇐ Growable
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
def ++=(iter: Iterator[Node]): Growable[Node]

Appends all elements produced by an iterator to this buffer

Appends all elements produced by an iterator to this buffer.

iter
the iterator producing the elements to append.
returns
the buffer itself.

definition classes: Growable
def ++=:(iter: Traversable[Node]): ArrayBuffer[Node]

Prepends a number of elements provided by an iterable object via its iterator method

Prepends a number of elements provided by an iterable object via its iterator method. The identity of the buffer is returned.

iter
the iterable object.
returns
the updated buffer.

definition classes: ArrayBuffer ⇐ BufferLike
def ++=:(iter: Iterator[Node]): ArrayBuffer[Node]

Prepends the elements produced by an iterator to this buffer

Prepends the elements produced by an iterator to this buffer.

iter
the iterator producing the elements to prepend.
returns
the buffer itself.

definition classes: BufferLike
def +:(elem: Node): Seq[Node]

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

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

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

Prepends an element to this buffer

Prepends an element to this buffer

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

definition classes: SeqLike
def +=(elem: Node): ArrayBuffer[Node]

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

elem
the element to append.
returns
the builder itself.

definition classes: ArrayBuffer ⇐ Builder ⇐ BufferLike ⇐ Growable
def +=(elem1: Node, elem2: Node, elems: Node*): Growable[Node]

Appends two or more elements to this buffer

Appends two or more elements to this buffer.

elem1
the first element to append.
elem2
the second element to append.
elems
the remaining elements to append.
returns
the buffer itself

definition classes: Growable
def +=:(elem: Node): ArrayBuffer[Node]

Prepends a single element to this buffer and return the identity of the buffer

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

elem
the element to append.
returns
the updated buffer.

definition classes: ArrayBuffer ⇐ BufferLike
def -(elem1: Node, elem2: Node, elems: Node*): ArrayBuffer[Node]

Removes two or more elements from this collection and returns the collection itself

Removes two or more elements from this collection and returns the collection itself.

elem1
the first element to remove.
elem2
the second element to remove.
elems
the remaining elements to remove.
returns
a new buffer that contains all elements of the current buffer except one less occurrence of each of the given elements.

definition classes: BufferLike ⇐ Subtractable
def -(elem: Node): ArrayBuffer[Node]

Removes a single element from this collection and returns the collection itself

Removes a single element from this collection and returns the collection itself.

elem
the element to remove.
returns
a new collection that contains all elements of the current buffer except one less occurrence of elem.

definition classes: BufferLike ⇐ Subtractable
def --(iter: Iterator[Node]): ArrayBuffer[Node]

Removes a number of elements provided by an iterator and returns the collection itself

Removes a number of elements provided by an iterator and returns the collection itself.

iter
the iterator
returns
a new buffer that contains all elements of the current buffer except one less occurrence of each of the elements produced by iter.

definition classes: BufferLike ⇐ Subtractable
def --(iter: Traversable[Node]): ArrayBuffer[Node]

Removes a number of elements provided by a Traversable object and returns the collection itself

Removes a number of elements provided by a Traversable object and returns the collection itself.

iter
the Traversable object.
returns
a new buffer that contains all elements of the current buffer except one less occurrence of each of the elements of elems.

definition classes: BufferLike ⇐ Subtractable
def --=(iter: Traversable[Node]): Shrinkable[Node]

Removes all elements contained in a traversable collection from this buffer

Removes all elements contained in a traversable collection from this buffer.

iter
the collection containing the elements to remove.
returns
the buffer itself

definition classes: Shrinkable
def --=(iter: Iterator[Node]): Shrinkable[Node]

Removes all elements produced by an iterator from this buffer

Removes all elements produced by an iterator from this buffer.

iter
the iterator producing the elements to remove.
returns
the buffer itself

definition classes: Shrinkable
def -=(x: Node): ArrayBuffer[Node]

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: BufferLike ⇐ Shrinkable
def -=(elem1: Node, elem2: Node, elems: Node*): Shrinkable[Node]

Removes two or more elements from this buffer

Removes two or more elements from this buffer.

elem1
the first element to remove.
elem2
the second element to remove.
elems
the remaining elements to remove.
returns
the buffer itself

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

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

Applies a binary operator to a start value and all elements of this buffer, 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 buffer$, going left to right with the start value z on the left: {{{ op(...op(op(z, x₁), x₂), ..., x_n) }}} where x,,1,,, ..., x,,n,, are the elements of this buffer.

definition classes: TraversableLike
def :+(elem: Node): Seq[Node]

[use case] Appends an element to this buffer
[use case]
Appends an element to this buffer

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

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

Appends an element to this buffer

Appends an element to this buffer

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

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

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

Applies a binary operator to all elements of this buffer 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 buffer$, going right to left with the start value z on the right: {{{ op(x₁, op(x₂, ... op(x_n, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this buffer.

definition classes: TraversableLike
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: BufferLike ⇐ Scriptable
def addString(b: StringBuilder): StringBuilder

Appends all elements of this buffer to a string builder

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

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

definition classes: TraversableLike
def addString(b: StringBuilder, sep: String): StringBuilder

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

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

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

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

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

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

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

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

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

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

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

definition classes: PartialFunction ⇐ Function1
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
def appendAll(iter: Iterator[Node]): Unit

Appends the elements produced by an iterator to this buffer

Appends the elements produced by an iterator to this buffer.

definition classes: BufferLike
def appendAll(elems: Traversable[Node]): Unit

Appends the elements contained in a traversable collection to this buffer

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

elems
the collection containing the elements to append.

definition classes: BufferLike
def apply(idx: Int): Node

Selects an element by its index in the buffer

Selects an element by its index in the buffer.

idx
The index to select.
returns
the element of this buffer at index idx, where 0 indicates the first element.

definition classes: ResizableArray ⇐ SeqLike ⇐ Function1
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 buffer should be compared
returns
true, if this buffer can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

definition classes: IterableLike ⇐ Equals
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: ArrayBuffer ⇐ Builder ⇐ BufferLike ⇐ Growable
def clone(): ArrayBuffer[Node]

Return a clone of this buffer

Return a clone of this buffer.

definition classes: ArrayBuffer ⇐ Cloneable ⇐ AnyRef
def companion: GenericCompanion[ArrayBuffer[A][A]]

The factory companion object that builds instances of class Buffer

The factory companion object that builds instances of class Buffer.

definition classes: ArrayBuffer ⇐ ResizableArray ⇐ IndexedSeq ⇐ IndexedSeq ⇐ Buffer ⇐ Seq ⇐ Seq ⇐ Iterable ⇐ Iterable ⇐ Traversable ⇐ Traversable ⇐ GenericTraversableTemplate
def compose[A](g: (A) ⇒ Int): (A) ⇒ Node

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

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

definition classes: Function1
def contains(elem: Any): Boolean

Tests whether this buffer contains a given value as an element

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

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

definition classes: SeqLike
def containsSlice[B](that: Seq[B]): Boolean

Tests whether this buffer contains a given sequence as a slice

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

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

definition classes: SeqLike
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: ResizableArray ⇐ IndexedSeqLike ⇐ IterableLike ⇐ TraversableLike
def copyToArray(xs: Array[Node], start: Int): Unit

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

xs
the array to fill.

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

Copies elements of this buffer to an array

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

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

xs
the array to fill.
start
the starting index.

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

Copies elements of this buffer to an array

Copies elements of this buffer to an array. Fills the given array xs with all elements of this buffer, starting at position start. Copying will stop once either the end of the current buffer 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: TraversableLike
def copyToBuffer[B >: Node](dest: Buffer[B]): Unit

Copies all elements of this buffer to a buffer

Copies all elements of this buffer to a buffer.

dest
The buffer to which elements are copied.

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

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

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

definition classes: SeqLike
def count(p: (Node) ⇒ Boolean): Int

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

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

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

definition classes: TraversableLike
def diff[B >: Node, That](that: Seq[B]): ArrayBuffer[Node]

Computes the multiset difference between this buffer and another sequence

Computes the multiset difference between this buffer and another sequence.

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

definition classes: SeqLike
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 buffer.
returns
a buffer consisting of all elements of this buffer except the first n ones, or else the empty buffer, if this buffer has less than n elements.

definition classes: IndexedSeqLike ⇐ TraversableLike
def dropRight(n: Int): ArrayBuffer[Node]

Selects all elements except first n ones

Selects all elements except first n ones.

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

definition classes: IndexedSeqLike ⇐ IterableLike
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 buffer whose first element does not satisfy the predicate p.

definition classes: IndexedSeqLike ⇐ TraversableLike
def elements: Iterator[Node]
def endsWith[B](that: Seq[B]): Boolean

Tests whether this buffer ends with the given sequence

Tests whether this buffer ends with the given sequence.

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

definition classes: IndexedSeqLike ⇐ SeqLike
def equals(that: Any): Boolean

The equality method defined in AnyRef

The equality method defined in AnyRef.

definition classes: SeqLike ⇐ Equals ⇐ AnyRef ⇐ Any
def equalsWith[B](that: Seq[B])(f: (Node, B) ⇒ Boolean): Boolean

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

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

definition classes: SeqLike
def exists(p: (Node) ⇒ Boolean): Boolean

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

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

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

definition classes: IndexedSeqLike ⇐ IterableLike ⇐ TraversableLike
def filter(p: (Node) ⇒ Boolean): ArrayBuffer[Node]

Selects all elements of this buffer which satisfy a predicate

Selects all elements of this buffer which satisfy a predicate.

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

definition classes: TraversableLike
def filterNot(p: (Node) ⇒ Boolean): ArrayBuffer[Node]

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

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

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

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

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

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

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

definition classes: IndexedSeqLike ⇐ IterableLike ⇐ TraversableLike
def findIndexOf(p: (Node) ⇒ Boolean): Int

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

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

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

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

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

definition classes: SeqLike
def first: Node
def firstOption: Option[Node]

None if iterable is empty

None if iterable is empty.

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

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

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

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

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

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

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

definition classes: TraversableLike
def flatten[B]: CC[B]

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

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

attributes: abstract
def flatten[B](asTraversable: (Node) ⇒ Traversable[B]): ArrayBuffer[B]

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

Converts this buffer of traversable collections into a buffer 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 buffer is a Traversable.
returns
a new buffer resulting from concatenating all element buffers.

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

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

Applies a binary operator to a start value and all elements of this buffer, 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 buffer$, going left to right with the start value z on the left: {{{ op(...op(z, x₁), x₂, ..., x_n) }}} where x,,1,,, ..., x,,n,, are the elements of this buffer.

definition classes: IndexedSeqLike ⇐ TraversableLike
def foldRight[B](z: B)(op: (Node, B) ⇒ B): B

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

Applies a binary operator to all elements of this buffer 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 buffer$, going right to left with the start value z on the right: {{{ op(x₁, op(x₂, ... op(x_n, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this buffer.

definition classes: IndexedSeqLike ⇐ IterableLike ⇐ TraversableLike
def forall(p: (Node) ⇒ Boolean): Boolean

Tests whether a predicate holds for all elements of this buffer

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

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

definition classes: IndexedSeqLike ⇐ IterableLike ⇐ TraversableLike
def foreach(f: (Node) ⇒ Unit): Unit

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

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

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

Applies a function f to all elements of this buffer

Applies a function f to all elements of this buffer.
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: ResizableArray ⇐ IndexedSeqLike ⇐ IterableLike ⇐ GenericTraversableTemplate ⇐ TraversableLike
def genericBuilder[B]: Builder[B, ArrayBuffer[B]]

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

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

definition classes: GenericTraversableTemplate
def groupBy[K](f: (Node) ⇒ K): Map[K, ArrayBuffer[Node]]

Partitions this buffer into a map of buffers according to some discriminator function

Partitions this buffer into a map of buffers 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 buffer.

K
the type of keys returned by the discriminator function.
f
the discriminator function.
returns
A map from keys to buffers 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 buffer of those elements x for which f(x) equals k.

definition classes: TraversableLike
def grouped(size: Int): Iterator[ArrayBuffer[Node]]

Partitions elements in fixed size buffers

Partitions elements in fixed size buffers.

size
the number of elements per group
returns
An iterator producing buffers of size size, except the last will be truncated if the elements don't divide evenly.

definition classes: IterableLike
def hasDefiniteSize: Boolean

Tests whether this buffer is known to have a finite size

Tests whether this buffer is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end.
Note: many collection methods will not work on collections of infinite sizes.

definition classes: TraversableLike
def hashCode(): Int

Hashcodes for Buffer produce a value from the hashcodes of all the elements of the buffer

Hashcodes for Buffer produce a value from the hashcodes of all the elements of the buffer.

definition classes: SeqLike ⇐ AnyRef ⇐ Any
def head: Node

Selects the first element of this buffer

Selects the first element of this buffer.

definition classes: IndexedSeqLike ⇐ IterableLike ⇐ TraversableLike
def headOption: Option[Node]

Optionally selects the first element

Optionally selects the first element.

definition classes: TraversableLike
def indexOf(elem: Node): Int

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

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

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

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

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

definition classes: SeqLike
def indexOf(elem: Node): Int

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

elem
the element value to search for.
returns
the index of the first element of this buffer that is equal (wrt ==) to elem, or -1, if none exists.

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

Finds index of first occurrence of some value in this buffer

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

B
the type of the element elem.
elem
the element value to search for.
returns
the index of the first element of this buffer that is equal (wrt ==) to elem, or -1, if none exists.

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

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

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

definition classes: SeqLike
def indexOfSlice[B >: Node](that: Seq[B]): Int

Finds first index where this buffer contains a given sequence as a slice

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

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

definition classes: SeqLike
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 buffer that satisfies the predicate p, or -1, if none exists.

definition classes: IndexedSeqLike ⇐ SeqLike
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 buffer that satisfies the predicate p, or -1, if none exists.

definition classes: SeqLike
def indices: Range

Produces the range of all indices of this sequence

Produces the range of all indices of this sequence.

definition classes: SeqLike
def init: ArrayBuffer[Node]

Selects all elements except the last

Selects all elements except the last.

definition classes: IndexedSeqLike ⇐ TraversableLike
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
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.

definition classes: ArrayBuffer ⇐ BufferLike
def intersect[B >: Node, That](that: Seq[B]): ArrayBuffer[Node]

Computes the multiset intersection between this buffer and another sequence

Computes the multiset intersection between this buffer and another sequence.

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

definition classes: SeqLike
def isDefinedAt(idx: Int): Boolean

Tests whether this buffer contains given index

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

definition classes: SeqLike
def isEmpty: Boolean

Tests whether this buffer is empty

Tests whether this buffer is empty.

definition classes: IndexedSeqLike ⇐ IterableLike ⇐ TraversableLike
def iterator: Iterator[Node]

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

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

definition classes: IndexedSeqLike ⇐ IterableLike
def last: Node

Selects the last element

Selects the last element.

definition classes: IndexedSeqLike ⇐ TraversableLike
def lastIndexOf(elem: Node): Int

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

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

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

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

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

definition classes: SeqLike
def lastIndexOf(elem: Node): Int

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

elem
the element value to search for.
returns
the index of the last element of this buffer that is equal (wrt ==) to elem, or -1, if none exists.

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

Finds index of last occurrence of some value in this buffer

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

B
the type of the element elem.
elem
the element value to search for.
returns
the index of the last element of this buffer that is equal (wrt ==) to elem, or -1, if none exists.

definition classes: SeqLike
def lastIndexOfSlice[B >: Node](that: Seq[B], end: Int): Int

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

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

that
the sequence to test
end
the end idnex
returns
the last index <= end such that the elements of this buffer starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

definition classes: SeqLike
def lastIndexOfSlice[B >: Node](that: Seq[B]): Int

Finds last index where this buffer contains a given sequence as a slice

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

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

definition classes: SeqLike
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 buffer that satisfies the predicate p, or -1, if none exists.

definition classes: IndexedSeqLike ⇐ SeqLike
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 buffer that satisfies the predicate p, or -1, if none exists.

definition classes: SeqLike
def lastOption: Option[Node]

Optionally selects the last element

Optionally selects the last element.

definition classes: TraversableLike
def length: Int

Returns the length of this resizable array

Returns the length of this resizable array.

definition classes: ResizableArray ⇐ SeqLike
def lengthCompare(len: Int): Int

Compares the length of this buffer to a test value

Compares the length of this buffer 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: IndexedSeqLike ⇐ SeqLike
def lift: (Int) ⇒ Option[Node]

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

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

definition classes: PartialFunction
def map[B](f: (Node) ⇒ B): Traversable[B]

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

B
the element type of the returned collection.
f
the function to apply to each element.
returns
a new buffer resulting from applying the given function f to each element of this buffer and collecting the results.

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

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

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

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

definition classes: TraversableLike
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
def max[B >: Node](cmp: Ordering[B]): Node

Finds the largest element

Finds the largest element.

B
The type over which the ordering is defined.
cmp
An ordering to be used for comparing elements.
returns
the largest element of this buffer with respect to the ordering cmp.

definition classes: TraversableLike
def min: Node

[use case] Finds the largest element
[use case]
Finds the largest element.

attributes: abstract
def min: Node

[use case] Finds the smallest element
[use case]
Finds the smallest element.

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

Finds the smallest element

Finds the smallest element.

B
The type over which the ordering is defined.
cmp
An ordering to be used for comparing elements.
returns
the smallest element of this buffer with respect to the ordering cmp.

definition classes: TraversableLike
def mkString: String

Displays all elements of this buffer in a string

Displays all elements of this buffer in a string.

definition classes: TraversableLike
def mkString(sep: String): String

Displays all elements of this buffer in a string using a separator string

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

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

definition classes: TraversableLike
def mkString(start: String, sep: String, end: String): String

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

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

definition classes: TraversableLike
def nonEmpty: Boolean

Tests whether the buffer is not empty

Tests whether the buffer is not empty.

definition classes: TraversableLike
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
def padTo(len: Int, elem: Node): Seq[Node]

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

len
the target length
elem
the padding value
returns
a new buffer consisting of all elements of this buffer followed by the minimal number of occurrences of elem so that the resulting buffer has a length of at least len.

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

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

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

B
the element type of the returned buffer.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
len
the target length
elem
the padding value
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.
returns
a new collection of type That consisting of all elements of this buffer followed by the minimal number of occurrences of elem so that the resulting collection has a length of at least len.

definition classes: SeqLike
def partialMap[B](pf: PartialFunction[Node, B]): Traversable[B]

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

B
the element type of the returned collection.
pf
the partial function which filters and maps the buffer.
returns
a new buffer resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

attributes: abstract
def partialMap[B, That](pf: PartialFunction[Node, B])(bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

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

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

B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
pf
the partial function which filters and maps the buffer.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.
returns
a new collection of type That resulting from applying the partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

definition classes: TraversableLike
def partition(p: (Node) ⇒ Boolean): (ArrayBuffer[Node], ArrayBuffer[Node])

Partitions this buffer in two buffers according to a predicate

Partitions this buffer in two buffers according to a predicate.

p
the predicate on which to partition.
returns
a pair of buffers: the first buffer consists of all elements that satisfy the predicate p and the second buffer consists of all elements that don't. The relative order of the elements in the resulting buffers is the same as in the original buffer.

definition classes: TraversableLike
def patch(from: Int, that: Seq[Node], replaced: Int): Seq[Node]

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

from
the index of the first replaced element
replaced
the number of elements to drop in the original buffer
returns
a new buffer consisting of all elements of this buffer except that replaced elements starting from from are replaced by patch.

attributes: abstract
def patch[B >: Node, That](from: Int, patch: Seq[B], replaced: Int)(bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

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

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

B
the element type of the returned buffer.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
from
the index of the first replaced element
patch
the replacement sequence
replaced
the number of elements to drop in the original buffer
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.
returns
a new collection of type That consisting of all elements of this buffer except that replaced elements starting from from are replaced by patch.

definition classes: SeqLike
def prefixLength(p: (Node) ⇒ Boolean): Int

Returns the length of the longest prefix whose elements all satisfy some preficate

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

p
the predicate used to test elements.
returns
the length of the longest prefix of this buffer such that every element of the segment satisfies the predicate p.

definition classes: SeqLike
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
def prependAll(iter: Iterator[Node]): Unit

Prepends a number of elements produced by an iterator to this buffer

Prepends a number of elements produced by an iterator to this buffer.

iter
the iterator producing the elements to prepend.

definition classes: BufferLike
def prependAll(iter: Traversable[Node]): Unit

Prepends the elements contained in a traversable collection to this buffer

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

definition classes: BufferLike
def product: Int

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

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

Multiplies up the elements of this collection

Multiplies up the elements of this collection.

B
the result type of the * operator.
num
an implicit parameter defining a set of numeric operations which includes the * operator to be used in forming the product.
returns
the product of all elements of this buffer with respect to the * operator in num.

definition classes: TraversableLike
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: SeqLike ⇐ IterableLike
def readOnly: Seq[Node]

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

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

definition classes: BufferLike
def reduceLeft[B >: Node](op: (B, Node) ⇒ B): B

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

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

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

definition classes: IndexedSeqLike ⇐ TraversableLike
def reduceLeftOption[B >: Node](op: (B, Node) ⇒ B): Option[B]

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

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

definition classes: TraversableLike
def reduceRight[B >: Node](op: (Node, B) ⇒ B): B

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

Applies a binary operator to all elements of this buffer, 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 buffer$, going right to left: {{{ op(x₁, op(x₂, ..., op(x_n-1, x_n)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this buffer.

definition classes: IndexedSeqLike ⇐ IterableLike ⇐ TraversableLike
def reduceRightOption[B >: Node](op: (Node, B) ⇒ B): Option[B]

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

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

definition classes: TraversableLike
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
def remove(n: Int): Node

Removes the element on a given index position

Removes the element on 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: ArrayBuffer ⇐ BufferLike
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 elemenets to delete

definition classes: ArrayBuffer ⇐ BufferLike
def removeDuplicates: ArrayBuffer[Node]

Builds a new buffer from this buffer without any duplicate elements

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

definition classes: SeqLike
def repr: ArrayBuffer[Node]

The collection of type buffer underlying this TraversableLike object

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

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

definition classes: ArrayBuffer ⇐ Builder
def reverse: ArrayBuffer[Node]

Returns new buffer wih elements in reversed order

Returns new buffer wih elements in reversed order.

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

definition classes: IndexedSeqLike ⇐ SeqLike
def reverseMap[B](f: (Node) ⇒ B): Seq[B]

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

B
the element type of the returned collection.
Note: xs.reverseMap(f) is the same as xs.reverse.map(f) but might be more efficient.
f
the function to apply to each element.
returns
a new buffer resulting from applying the given function f to each element of this buffer and collecting the results in reversed order.

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

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

Builds a new collection by applying a function to all elements of this buffer 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. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
f
the function to apply to each element.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.
returns
a new collection of type That resulting from applying the given function f to each element of this buffer and collecting the results in reversed order.

definition classes: SeqLike
def reversedElements: Iterator[Node]
def sameElements(that: Iterable[Node]): Boolean

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

that
the collection to compare with.
returns
true, if both collections contain the same elements in the same order, false otherwise.

attributes: abstract
def sameElements[B >: Node](that: Iterable[B]): Boolean

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

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

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: IndexedSeqLike ⇐ IterableLike
def segmentLength(p: (Node) ⇒ Boolean, from: Int): Int

Computes length of longest segment whose elements all satisfy some preficate

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

p
the predicate used to test elements.
from
the index where the search starts.
returns
the length of the longest segment of this buffer starting from index from such that every element of the segment satisfies the predicate p.

definition classes: IndexedSeqLike ⇐ SeqLike
def size: Int

The size of this buffer, equivalent to length

The size of this buffer, equivalent to length.

definition classes: SeqLike ⇐ TraversableLike
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: ArrayBuffer ⇐ Builder
def slice(from: Int, until: Int): ArrayBuffer[Node]

Selects an interval of elements

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

from
the index of the first returned element in this buffer.
until
the index one past the last returned element in this buffer.
returns
a buffer containing the elements starting at index from and extending up to (but not including) index until of this buffer.

definition classes: IndexedSeqLike ⇐ IterableLike ⇐ TraversableLike
def sliding[B >: Node](size: Int, step: Int): Iterator[ArrayBuffer[Node]]
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 buffers of size size, except the last will be truncated if the elements don't divide evenly.

definition classes: IterableLike
def sortBy[B](f: (Node) ⇒ B)(ord: Ordering[B]): ArrayBuffer[Node]

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

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

definition classes: SeqLike
def sortWith[B >: Node](ord: Ordering[B]): ArrayBuffer[Node]

Sorts this buffer according to an Ordering

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

definition classes: SeqLike
def sortWith(lt: (Node, Node) ⇒ Boolean): ArrayBuffer[Node]

Sorts this buffer according to a comparison function

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

definition classes: SeqLike
def span(p: (Node) ⇒ Boolean): (ArrayBuffer[Node], ArrayBuffer[Node])

Spits this buffer into a prefix/suffix pair according to a predicate

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

definition classes: IndexedSeqLike ⇐ TraversableLike
def splitAt(n: Int): (ArrayBuffer[Node], ArrayBuffer[Node])

Splits this buffer into two at a given position

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

definition classes: IndexedSeqLike ⇐ TraversableLike
def startsWith[B](that: Seq[B], offset: Int): Boolean

Tests whether this buffer contains the given sequence at a given index

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

definition classes: IndexedSeqLike ⇐ SeqLike
def startsWith[B](that: Seq[B]): Boolean

Tests whether this buffer starts with the given sequence

Tests whether this buffer starts with the given sequence.

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

definition classes: SeqLike
def stringPrefix: String

Defines the prefix of the string representation

Defines the prefix of the string representation.

definition classes: ArrayBuffer ⇐ BufferLike ⇐ TraversableLike
def sum: Int

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

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

Sums up the elements of this collection

Sums up the elements of this collection.

B
the result type of the + operator.
num
an implicit parameter defining a set of numeric operations which includes the + operator to be used in forming the sum.
returns
the sum of all elements of this buffer with respect to the + operator in num.

definition classes: TraversableLike
def tail: ArrayBuffer[Node]

Selects all elements except the first

Selects all elements except the first.

definition classes: IndexedSeqLike ⇐ TraversableLike
def take(n: Int): ArrayBuffer[Node]

Selects first n elements

Selects first n elements.

n
Tt number of elements to take from this buffer.
returns
a buffer consisting only of the first n elements of this buffer, or else the whole buffer, if it has less than n elements.

definition classes: IndexedSeqLike ⇐ IterableLike ⇐ TraversableLike
def takeRight(n: Int): ArrayBuffer[Node]

Selects last n elements

Selects last n elements.

n
the number of elements to take
returns
a buffer consisting only of the last n elements of this buffer, or else the whole buffer, if it has less than n elements.

definition classes: IndexedSeqLike ⇐ IterableLike
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 buffer whose elements all satisfy the predicate p.

definition classes: IndexedSeqLike ⇐ IterableLike ⇐ TraversableLike
def toArray: Array[Node]

[use case] Converts this buffer to an array
[use case]
Converts this buffer to an array.

attributes: abstract
def toArray[B >: Node](arg0: ClassManifest[B]): Array[B]

Converts this buffer to an array

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

definition classes: TraversableLike
def toIndexedSeq[B >: Node]: IndexedSeq[B]

Converts this buffer to an indexed sequence

Converts this buffer to an indexed sequence.

definition classes: TraversableLike
def toIterable: Iterable[Node]

Converts this buffer to an iterable collection

Converts this buffer to an iterable collection.

definition classes: IterableLike ⇐ TraversableLike
def toList: List[Node]

Converts this buffer to a list

Converts this buffer to a list.

definition classes: TraversableLike
def toMap[T, U](ev: <:<[Node, (T, U)]): Map[T, U]

Converts this buffer to a map

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

definition classes: TraversableLike
def toSeq: Seq[Node]

Converts this buffer to a sequence

Converts this buffer to a sequence.
Overridden for efficiency.

definition classes: SeqLike ⇐ TraversableLike
def toSet[B >: Node]: Set[B]

Converts this buffer to a set

Converts this buffer to a set.

definition classes: TraversableLike
def toStream: Stream[Node]

Converts this buffer to a stream

Converts this buffer to a stream.

definition classes: IterableLike ⇐ TraversableLike
def toString(): String

Converts this buffer to a string

Converts this buffer to a string

definition classes: SeqLike ⇐ TraversableLike ⇐ AnyRef ⇐ Any
def transpose[B](asTraversable: (Node) ⇒ Traversable[B]): ArrayBuffer[ArrayBuffer[B]]

Transposes this buffer of traversable collections into

Transposes this buffer of traversable collections into

definition classes: GenericTraversableTemplate
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
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
def union(that: Seq[Node]): Seq[Node]

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

that
the sequence of elements to intersect with.
returns
a new buffer which contains all elements of this buffer 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
def union(that: Seq[Node]): Seq[Node]

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

that
the sequence of elements to remove
returns
a new buffer which contains all elements of this buffer 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
def union(that: Seq[Node]): Seq[Node]

[use case] Produces a new sequence which contains all elements of this buffer and also all elements of a given sequence
[use case]
Produces a new sequence which contains all elements of this buffer and also all elements of a given sequence. xs union ys is equivalent to xs ++ ys.

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

attributes: abstract
def union[B >: Node, That](that: Seq[B])(bf: CanBuildFrom[ArrayBuffer[Node], B, That]): That

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

Produces a new sequence which contains all elements of this buffer 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-oart of diff and intersect which also work on multi-sets.

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

definition classes: SeqLike
def unzip[A1, A2](asPair: (Node) ⇒ (A1, A2)): (ArrayBuffer[A1], ArrayBuffer[A2])

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

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

asPair
an implicit conversion which asserts that the element type of this buffer is a pair.
returns
a pair buffers, containing the first, respectively second half of each element pair of this buffer.

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

definition classes: ResizableArray ⇐ IndexedSeqLike ⇐ Seq
def updated(index: Int, elem: Node): Seq[Node]

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

index
the position of the replacement
elem
the replacing element
returns
a copy of this buffer with the element at position index replaced by elem.

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

A copy of this buffer with one single replaced element

A copy of this buffer with one single replaced element.

B
the element type of the returned buffer.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
index
the position of the replacement
elem
the replacing element
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.
returns
a new collection of type That which is a copy of this buffer with the element at position index replaced by elem.

definition classes: SeqLike
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 buffer, starting at index from and extending up to (but not including) index until.

definition classes: IndexedSeqLike ⇐ IndexedSeqLike ⇐ SeqLike ⇐ IterableLike ⇐ TraversableLike
def view: IndexedSeqView[Node, ArrayBuffer[Node]]

Creates a view of this iterable @see Iterable

Creates a view of this iterable @see Iterable.View

definition classes: IndexedSeqLike ⇐ IndexedSeqLike ⇐ SeqLike ⇐ IterableLike ⇐ TraversableLike
def withFilter(p: (Node) ⇒ Boolean): WithFilter

Creates a non-strict filter of this buffer

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

definition classes: TraversableLike
def zip[B](that: Iterable[B]): Iterable[(Node, B)]

[use case] Returns a buffer formed from this buffer and another iterable collection by combining corresponding elements in pairs
[use case]
Returns a buffer formed from this buffer 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 buffer containing pairs consisting of corresponding elements of this buffer and that. The length of the returned collection is the minimum of the lengths of this buffer$ and that.

attributes: abstract
def zip[A1 >: Node, B, That](that: Iterable[B])(bf: CanBuildFrom[ArrayBuffer[Node], (A1, B), That]): That

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

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

definition classes: IndexedSeqLike ⇐ IterableLike
def zipAll[B](that: Iterable[B], thisElem: Node, thatElem: B): Iterable[(Node, B)]

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

B
the type of the second half of the returned pairs
that
The iterable providing the second half of each result pair
thisElem
the element to be used to fill up the result if this buffer is shorter than that.
thatElem
the element to be used to fill up the result if that is shorter than this buffer.
returns
a new buffer containing pairs consisting of corresponding elements of this buffer and that. The length of the returned collection is the maximum of the lengths of this buffer$ and that. If this buffer is shorter than that, thisElem values are used to pad the result. If that is shorter than this buffer, thatElem values are used to pad the result.

attributes: abstract
def zipAll[B, A1 >: Node, That](that: Iterable[B], thisElem: A1, thatElem: B)(bf: CanBuildFrom[ArrayBuffer[Node], (A1, B), That]): That

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

Returns a buffer formed from this buffer 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 buffer is shorter than that.
thatElem
the element to be used to fill up the result if that is shorter than this buffer.
returns
a new collection of type That containing pairs consisting of corresponding elements of this buffer and that. The length of the returned collection is the maximum of the lengths of this buffer$ and that. If this buffer is shorter than that, thisElem values are used to pad the result. If that is shorter than this buffer, thatElem values are used to pad the result.

definition classes: IterableLike
def zipWithIndex: Iterable[(Node, Int)]

[use case] Zips this buffer with its indices
[use case]
Zips this buffer with its indices.

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

Zips this buffer with its indices

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

definition classes: IndexedSeqLike ⇐ IterableLike

Instance constructors

new NodeBuffer()
new NodeBuffer(initialSize: Int)

NodeBuffer

class NodeBuffer extends ArrayBuffer[Node]

Inherits

Type Members

class WithFilter extends AnyRef

Value Members

def &+(o: Any): NodeBuffer

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

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

def ++(iter: Iterator[Node]): ArrayBuffer[Node]

def ++(iter: Traversable[Node]): ArrayBuffer[Node]

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

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

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

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

def ++=(iter: Traversable[Node]): ArrayBuffer[Node]

def ++=(src: Array[Node], start: Int, len: Int): Unit

def ++=(iter: Iterator[Node]): Growable[Node]

def ++=:(iter: Traversable[Node]): ArrayBuffer[Node]

def ++=:(iter: Iterator[Node]): ArrayBuffer[Node]

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

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

def +=(elem: Node): ArrayBuffer[Node]

def +=(elem1: Node, elem2: Node, elems: Node*): Growable[Node]

def +=:(elem: Node): ArrayBuffer[Node]

def -(elem1: Node, elem2: Node, elems: Node*): ArrayBuffer[Node]

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

def --(iter: Iterator[Node]): ArrayBuffer[Node]

def --(iter: Traversable[Node]): ArrayBuffer[Node]

def --=(iter: Traversable[Node]): Shrinkable[Node]

def --=(iter: Iterator[Node]): Shrinkable[Node]

def -=(x: Node): ArrayBuffer[Node]

def -=(elem1: Node, elem2: Node, elems: Node*): Shrinkable[Node]

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

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

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

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

def <<(cmd: Message[Node]): Unit

def addString(b: StringBuilder): StringBuilder

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

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

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

def append(elems: Node*): Unit

def appendAll(iter: Iterator[Node]): Unit

def appendAll(elems: Traversable[Node]): Unit

def apply(idx: Int): Node

def canEqual(that: Any): Boolean

def clear(): Unit

def clone(): ArrayBuffer[Node]

def companion: GenericCompanion[ArrayBuffer[A][A]]

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

def contains(elem: Any): Boolean

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

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

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

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

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

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

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

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

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

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

def drop(n: Int): ArrayBuffer[Node]

def dropRight(n: Int): ArrayBuffer[Node]

def dropWhile(p: (Node) ⇒ Boolean): ArrayBuffer[Node]

def elements: Iterator[Node]

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

def equals(that: Any): Boolean

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

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

def filter(p: (Node) ⇒ Boolean): ArrayBuffer[Node]

def filterNot(p: (Node) ⇒ Boolean): ArrayBuffer[Node]

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

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

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

def first: Node

def firstOption: Option[Node]

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

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

def flatten[B]: CC[B]