The type implementing this traversable
A class supporting filtered operations .
o != arg0 is the same as !(o == (arg0)).
o != arg0 is the same as !(o == (arg0)).
the object to compare against this object for dis-equality .
false if the receiver object is equivalent to the argument; true otherwise.
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 all similar methods throughout the collections hierarchy. similar but undeprecated methods throughout the collections hierarchy. You are strongly recommended to use '++=' instead.
the first element to add .
the second element to add .
the remaining elements to add .
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.
the element to add .
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 .
the traversable object .
[use case] Concatenates this list buffer with the elements of a traversable collection .
Concatenates this list buffer with the elements of a traversable collection .
the traversable to append .
a new list buffer which contains all elements of this list buffer
followed by all elements of that.
Concatenates this list buffer with the elements of a traversable collection .
Concatenates this list buffer with the elements of a traversable collection .
the element type of the returned collection .
the class of the returned collection. In the standard library configuration,
That is always ListBuffer[B] because an implicit of type CanBuildFrom[ListBuffer, B, ListBuffer[B]] is defined in object ListBuffer.
the traversable to append .
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr and the new element type B.
a new collection of type That which contains all elements of this list buffer
followed by all elements of that.
Adds a number of elements in an array
Adds a number of elements in an array
the array
the first element to append
the number of elements to append
replace by: buf ++= src.view(start, end)
Appends all elements produced by a TraversableOnce to this list buffer .
Appends all elements produced by a TraversableOnce to this list buffer .
the list buffer itself .
Prepends elements to this buffer .
Prepends elements to this buffer .
the TraversableOnce containing the elements to prepend .
the buffer itself .
[use case] Prepends an element to this list buffer
Prepends an element to this list buffer
the prepended element
a new list buffer consisting of elem followed
by all elements of this list buffer.
Prepends an element to this list buffer
Prepends an element to this list buffer
the element type of the returned list buffer .
the class of the returned collection. In the standard library configuration,
That is always ListBuffer[B] because an implicit of type CanBuildFrom[ListBuffer, B, ListBuffer[B]] is defined in object ListBuffer.
the prepended element
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr and the new element type B.
a new collection of type That consisting of elem followed
by all elements of this list buffer.
Appends a single element to this buffer .
Appends a single element to this buffer . This operation takes constant time.
the element to append .
this list buffer .
Appends two or more elements to this list buffer .
Appends two or more elements to this list buffer .
the first element to append .
the second element to append .
the remaining elements to append .
the list buffer itself
Prepends a single element to this buffer .
Prepends a single element to this buffer . This operation takes constant time.
the element to prepend .
this list buffer .
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 .
the first element to remove .
the second element to remove .
the remaining elements to remove . @return a new list buffer that contains all elements of the current list buffer except one less occurrence of each of the given elements.
Removes a single element from this collection and returns the collection itself .
Removes a single element from this collection and returns the collection itself .
the element to [email protected] a new collection that contains all elements of the current list buffer
except one less occurrence of elem.
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 .
a new list buffer that contains all elements of the current list buffer
except one less occurrence of each of the elements of elems[email protected] iter the Traversable object.
Removes all elements produced by an iterator from this list buffer .
Removes all elements produced by an iterator from this list buffer .
the list buffer itself
Remove a single element from this buffer .
Remove a single element from this buffer . May take time linear in the buffer size.
this list buffer .
Removes two or more elements from this list buffer .
Removes two or more elements from this list buffer .
the first element to remove .
the second element to remove .
the remaining elements to remove .
the list buffer itself
Applies a binary operator to a start value and all elements of this list buffer, going left to right .
Applies a binary operator to a start value and all elements of this list buffer, going left to right .
Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.
the result type of the binary operator .
the start value .
the binary operator .
the result of inserting op between consecutive elements of this list buffer,
going left to right with the start value z on the left:
op(...op(op(z, x1), x2), ..., xn)
where x,,1,,, ..., x,,n,, are the elements of this list buffer.
[use case] Appends an element to this list buffer
Appends an element to this list buffer
the appended element
a new list buffer consisting of
all elements of this list buffer followed by elem.
Appends an element to this list buffer
Appends an element to this list buffer
the element type of the returned list buffer .
the class of the returned collection. In the standard library configuration,
That is always ListBuffer[B] because an implicit of type CanBuildFrom[ListBuffer, B, ListBuffer[B]] is defined in object ListBuffer.
the appended element
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr and the new element type B.
a new collection of type That consisting of
all elements of this list buffer followed by elem.
Applies a binary operator to all elements of this list buffer and a start value, going right to left .
Applies a binary operator to all elements of this list buffer and a start value, going right to left .
Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.
the result type of the binary operator .
the start value
the binary operator
the result of inserting op between consecutive elements of this list buffer,
going right to left with the start value z on the right:
op(x1, op(x2, ... op(xn, z)...))
where x,,1,,, ..., x,,n,, are the elements of this list buffer.
Send a message to this scriptable object .
Send a message to this scriptable object .
the message to send .
o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).
o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).
the object to compare against this object for equality .
true if the receiver object is equivalent to the argument; false otherwise.
o == arg0 is the same as o.equals(arg0).
o == arg0 is the same as o.equals(arg0).
the object to compare against this object for equality .
true if the receiver object is equivalent to the argument; false otherwise.
Appends all elements of this list buffer to a string builder .
Appends all elements of this list buffer to a string builder.
The written text consists of the string representations (w.r.t. the method toString)
of all elements of this list buffer without any separator string.
the string builder to which elements are appended .
the string builder b to which elements were appended.
Appends all elements of this list buffer to a string builder using a separator string .
Appends all elements of this list 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 list buffer, separated by the string sep.
the string builder to which elements are appended .
the separator string .
the string builder b to which elements were appended.
Appends all elements of this list buffer to a string builder using start, end, and separator strings .
Appends all elements of this list 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 list buffer are separated by the string sep.
the string builder to which elements are appended .
the starting string .
the separator string .
the ending string .
the string builder b to which elements were appended.
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 .
the result type of the transformation function .
the transformation function
a partial function with the same domain as this partial function, which maps
arguments x to k(this(x)).
Appends the given elements to this buffer .
Appends the given elements to this buffer .
the elements to append .
Appends the elements contained in a traversable object to this buffer .
Appends the elements contained in a traversable object to this buffer .
the traversable object containing the elements to append .
Selects an element by its index in the list buffer .
Selects an element by its index in the list buffer .
the element of this list buffer at index idx, where 0 indicates the first element.
This method is used to cast the receiver object to be of type T0.
This method is used to cast the receiver object to be of type T0.
Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expressionList(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as
part of compilation it is not possible to check whether the contents of the list are of the requested typed.
the receiver object .
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 .
The object with which this list buffer should be compared
true, if this list buffer can possibly equal that, false otherwise. The test
takes into consideration only the run-time types of objects but ignores their elements.
Clears the buffer contents .
Clears the buffer contents .
Returns a clone of this buffer .
Returns a clone of this buffer .
a ListBuffer with the same elements .
[use case] Builds a new collection by applying a partial function to all elements of this list buffer on which the function is defined .
Builds a new collection by applying a partial function to all elements of this list buffer on which the function is defined .
the element type of the returned collection .
the partial function which filters and maps the list buffer .
a new list 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.
Builds a new collection by applying a partial function to all elements of this list buffer on which the function is defined .
Builds a new collection by applying a partial function to all elements of this list buffer on which the function is defined .
the element type of the returned collection .
the class of the returned collection. In the standard library configuration,
That is always ListBuffer[B] because an implicit of type CanBuildFrom[ListBuffer, B, ListBuffer[B]] is defined in object ListBuffer.
the partial function which filters and maps the list buffer .
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr and the new element type B.
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.
The factory companion object that builds instances of class ListBuffer .
The factory companion object that builds instances of class ListBuffer .
(f compose g)(x) == f(g(x))
(f compose g)(x) == f(g(x))
Tests whether this list buffer contains a given value as an element .
Tests whether this list buffer contains a given value as an element .
the element to test .
true if this list buffer has an element that is
is equal (wrt ==) to elem, false otherwise.
Tests whether this list buffer contains a given sequence as a slice .
Tests whether this list buffer contains a given sequence as a slice .
the sequence to test
true if this list buffer contains a slice with the same elements
as that, otherwise false.
[use case] Copies values of this list buffer to an array .
Copies values of this list buffer to an array.
Fills the given array xs with values of this list buffer.
Copying will stop once either the end of the current list buffer is reached,
or the end of the array is reached.
the array to fill .
Copies values of this list buffer to an array .
Copies values of this list buffer to an array.
Fills the given array xs with values of this list buffer.
Copying will stop once either the end of the current list buffer is reached,
or the end of the array is reached.
the type of the elements of the array .
the array to fill .
[use case] Copies values of this list buffer to an array .
Copies values of this list buffer to an array.
Fills the given array xs with values of this list buffer, after skipping start values.
Copying will stop once either the end of the current list buffer is reached,
or the end of the array is reached.
the array to fill .
the starting index .
Copies values of this list buffer to an array .
Copies values of this list buffer to an array.
Fills the given array xs with values of this list buffer, after skipping start values.
Copying will stop once either the end of the current list buffer is reached,
or the end of the array is reached.
the type of the elements of the array .
the array to fill .
the starting index .
[use case] Copies elements of this list buffer to an array .
Copies elements of this list buffer to an array.
Fills the given array xs with at most len elements of
this list buffer, starting at position start.
Copying will stop once either the end of the current list buffer is reached,
or the end of the array is reached, or len elements have been copied.
the array to fill .
the starting index .
the maximal number of elements to copy .
Copies elements of this list buffer to an array .
Copies elements of this list buffer to an array.
Fills the given array xs with at most len elements of
this list buffer, starting at position start.
Copying will stop once either the end of the current list buffer is reached,
or the end of the array is reached, or len elements have been copied.
the type of the elements of the array .
the array to fill .
the starting index .
the maximal number of elements to copy .
Copies all elements of this list buffer to a buffer .
Copies all elements of this list buffer to a buffer .
The buffer to which elements are copied .
Tests whether every element of this list buffer relates to the corresponding element of another sequence by satisfying a test predicate .
Tests whether every element of this list buffer relates to the corresponding element of another sequence by satisfying a test predicate .
the type of the elements of that
the other sequence
the test predicate, which relates elements from both sequences
true if both sequences have the same length and
p(x, y) is true for all corresponding elements x of this list buffer
and y of that, otherwise false.
Counts the number of elements in the list buffer which satisfy a predicate .
Counts the number of elements in the list buffer which satisfy a predicate .
the predicate used to test elements .
the number of elements satisfying the predicate p.
[use case] Computes the multiset difference between this list buffer and another sequence .
Computes the multiset difference between this list buffer and another sequence .
the sequence of elements to remove
a new list buffer which contains all elements of this list 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.
Computes the multiset difference between this list buffer and another sequence .
Computes the multiset difference between this list buffer and another sequence .
the element type of the returned list buffer .
the sequence of elements to remove
a new collection of type That which contains all elements of this list 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.
Builds a new list buffer from this list buffer without any duplicate elements .
Builds a new list buffer from this list buffer without any duplicate elements .
A new list buffer which contains the first occurrence of every element of this list buffer .
Selects all elements except first n ones.
Selects all elements except first n ones.
the number of elements to drop from this list buffer .
a list buffer consisting of all elements of this list buffer except the first n ones, or else the
empty list buffer, if this list buffer has less than n elements.
Selects all elements except last n ones.
Selects all elements except last n ones.
The number of elements to take
a list buffer consisting of all elements of this list buffer except the first n ones, or else the
empty list buffer, if this list buffer has less than n elements.
Drops longest prefix of elements that satisfy a predicate .
Drops longest prefix of elements that satisfy a predicate .
The predicate used to test elements .
the longest suffix of this list buffer whose first element
does not satisfy the predicate p.
use iterator' instead
Tests whether this list buffer ends with the given sequence .
Tests whether this list buffer ends with the given sequence .
the sequence to test
true if this list buffer has that as a suffix, false otherwise.
This method is used to test whether the argument (arg0) is a reference to the
receiver object (this).
This method is used to test whether the argument (arg0) is a reference to the
receiver object (this).
The eq method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on
non-null instances of AnyRef:
* It is reflexive: for any non-null instance x of type AnyRef, x.eq(x) returns true.
* It is symmetric: for any non-null instances x and y of type AnyRef, x.eq(y) returns true if and
only if y.eq(x) returns true.
* It is transitive: for any non-null instances x, y, and z of type AnyRef if x.eq(y) returns true and y.eq(z) returns true, then x.eq(z) returns true.
Additionally, the eq method has three other properties.
* It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of
x.eq(y) consistently returns true or consistently returns false.
* For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false.
* null.eq(null) returns true.
When overriding the equals or hashCode methods, it is important to ensure that their behavior is
consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they
should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).
the object to compare against this object for reference equality .
true if the argument is a reference to the receiver object; false otherwise.
The equality method defined in AnyRef.
The equality method defined in AnyRef[email protected] true if the receiver object is equivalent to the argument; false otherwise. */
Tests whether every element of this list buffer relates to the corresponding element of another sequence by satisfying a test predicate .
Tests whether every element of this list buffer relates to the corresponding element of another sequence by satisfying a test predicate .
the type of the elements of that
the other sequence
true if both sequences have the same length and
p(x, y) is true for all corresponding elements x of this list buffer
and y of that, otherwise false.
use corresponds instead
Tests whether a predicate holds for some of the elements of this list buffer .
Tests whether a predicate holds for some of the elements of this list buffer .
the predicate used to test elements .
true if the given predicate p holds for some of the elements
of this list buffer, otherwise false.
Selects all elements of this list buffer which satisfy a predicate .
Selects all elements of this list buffer which satisfy a predicate .
the predicate used to test elements .
a new list buffer consisting of all elements of this list buffer that satisfy the given
predicate p. The order of the elements is preserved.
Selects all elements of this list buffer which do not satisfy a predicate .
Selects all elements of this list buffer which do not satisfy a predicate .
the predicate used to test elements .
a new list buffer consisting of all elements of this list buffer that do not satisfy the given
predicate p. The order of the elements is preserved.
This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object .
This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object .
The details of when and if the finalize method are invoked, as well as the interaction between finalizeand non-local returns and exceptions, are all platform dependent.
Finds the first element of the list buffer satisfying a predicate, if any .
Finds the first element of the list buffer satisfying a predicate, if any .
the predicate used to test elements .
an option value containing the first element in the list buffer
that satisfies p, or None if none exists.
Returns index of the first element satisfying a predicate, or -1.
Returns index of the first element satisfying a predicate, or -1.
Returns index of the last element satisfying a predicate, or -1 .
Returns index of the last element satisfying a predicate, or -1 .
use lastIndexWhere instead
use head' instead
None if iterable is empty.
[use case] Builds a new collection by applying a function to all elements of this list buffer and concatenating the results .
Builds a new collection by applying a function to all elements of this list buffer and concatenating the results .
the element type of the returned collection .
the function to apply to each element .
a new list buffer resulting from applying the given collection-valued function
f to each element of this list buffer and concatenating the results.
Builds a new collection by applying a function to all elements of this list buffer and concatenating the results .
Builds a new collection by applying a function to all elements of this list buffer and concatenating the results .
the element type of the returned collection .
the class of the returned collection. In the standard library configuration,
That is always ListBuffer[B] because an implicit of type CanBuildFrom[ListBuffer, B, ListBuffer[B]] is defined in object ListBuffer.
the function to apply to each element .
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr and the new element type B.
a new collection of type That resulting from applying the given collection-valued function
f to each element of this list buffer and concatenating the results.
[use case] Converts this list buffer of traversable collections into a list buffer in which all element collections are concatenated .
Converts this list buffer of traversable collections into a list buffer in which all element collections are concatenated .
the type of the elements of each traversable collection .
a new list buffer resulting from concatenating all element list buffers .
Converts this list buffer of traversable collections into a list buffer in which all element collections are concatenated .
Converts this list buffer of traversable collections into a list buffer in which all element collections are concatenated .
the type of the elements of each traversable collection .
an implicit conversion which asserts that the element type of this
list buffer is a Traversable.
a new list buffer resulting from concatenating all element list buffers .
Applies a binary operator to a start value and all elements of this list buffer, going left to right .
Applies a binary operator to a start value and all elements of this list buffer, going left to right .
the result type of the binary operator .
the start value .
the binary operator .
the result of inserting op between consecutive elements of this list buffer,
going left to right with the start value z on the left:
op(...op(z, x1), x2, ..., xn)
where x,,1,,, ..., x,,n,, are the elements of this list buffer.
Applies a binary operator to all elements of this list buffer and a start value, going right to left .
Applies a binary operator to all elements of this list buffer and a start value, going right to left .
the result type of the binary operator .
the start value .
the binary operator .
the result of inserting op between consecutive elements of this list buffer,
going right to left with the start value z on the right:
op(x1, op(x2, ... op(xn, z)...))
where x,,1,,, ..., x,,n,, are the elements of this list buffer.
Tests whether a predicate holds for all elements of this list buffer .
Tests whether a predicate holds for all elements of this list buffer .
the predicate used to test elements .
true if the given predicate p holds for all elements
of this list buffer, otherwise false.
[use case] Applies a function f to all elements of this list buffer.
Applies a function f to all elements of this list buffer.
the function that is applied for its side-effect to every element.
The result of function f is discarded.
Applies a function f to all elements of this list buffer.
Applies a function f to all elements of this list buffer.
the function that is applied for its side-effect to every element.
The result of function f is discarded.
The generic builder that builds instances of ListBuffer at arbitrary element types .
The generic builder that builds instances of ListBuffer at arbitrary element types .
Returns a representation that corresponds to the dynamic class of the receiver object .
Returns a representation that corresponds to the dynamic class of the receiver object .
The nature of the representation is platform dependent.
a representation that corresponds to the dynamic class of the receiver object .
Partitions this list buffer into a map of list buffers according to some discriminator function .
Partitions this list buffer into a map of list 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 list buffer.
the type of keys returned by the discriminator function .
the discriminator function .
A map from keys to list 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 list buffer of those elements x for which f(x) equals k.
Partitions elements in fixed size list buffers .
Partitions elements in fixed size list buffers .
the number of elements per group
An iterator producing list buffers of size size, except the
last will be truncated if the elements don't divide evenly.
Iterator#grouped
Tests whether this list buffer is known to have a finite size .
Tests whether this list 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.
true if this collection is known to have finite size, false otherwise.
Hashcodes for ListBuffer produce a value from the hashcodes of all the elements of the list buffer .
Hashcodes for ListBuffer produce a value from the hashcodes of all the elements of the list buffer . @return the hash code value for the object. */
Selects the first element of this list buffer .
Selects the first element of this list buffer .
the first element of this list buffer .
Optionally selects the first element .
Optionally selects the first element .
the first element of this list buffer if it is nonempty, None if it is empty.
[use case] Finds index of first occurrence of some value in this list buffer after or at some start index .
Finds index of first occurrence of some value in this list buffer after or at some start index .
the element value to search for .
the start index
the index >= from of the first element of this list buffer that is equal (wrt ==)
to elem, or -1, if none exists.
Finds index of first occurrence of some value in this list buffer after or at some start index .
Finds index of first occurrence of some value in this list buffer after or at some start index .
the type of the element elem.
the element value to search for .
the start index
the index >= from of the first element of this list buffer that is equal (wrt ==)
to elem, or -1, if none exists.
[use case] Finds index of first occurrence of some value in this list buffer .
Finds index of first occurrence of some value in this list buffer .
the element value to search for .
the index of the first element of this list buffer that is equal (wrt ==)
to elem, or -1, if none exists.
Finds index of first occurrence of some value in this list buffer .
Finds index of first occurrence of some value in this list buffer .
the type of the element elem.
the element value to search for .
the index of the first element of this list buffer that is equal (wrt ==)
to elem, or -1, if none exists.
Finds first index after or at a start index where this list buffer contains a given sequence as a slice .
Finds first index after or at a start index where this list buffer contains a given sequence as a slice .
the sequence to test
the start index
the first index >= from such that the elements of this list buffer starting at this index
match the elements of sequence that, or -1 of no such subsequence exists.
Finds first index where this list buffer contains a given sequence as a slice .
Finds first index where this list buffer contains a given sequence as a slice .
the sequence to test
the first index such that the elements of this list buffer starting at this index
match the elements of sequence that, or -1 of no such subsequence exists.
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 .
the predicate used to test elements .
the start index
the index >= from of the first element of this list buffer that satisfies the predicate p,
or -1, if none exists.
Finds index of first element satisfying some predicate .
Finds index of first element satisfying some predicate .
the predicate used to test elements .
the index of the first element of this list buffer that satisfies the predicate p,
or -1, if none exists.
Produces the range of all indices of this sequence .
Produces the range of all indices of this sequence .
a Range value from 0 to one less than the length of this list buffer.
Selects all elements except the last .
Selects all elements except the last .
a list buffer consisting of all elements of this list buffer except the last one .
Inserts new elements at a given index into this buffer .
Inserts new elements at a given index into this buffer .
the index where new elements are inserted .
the traversable collection containing the elements to insert .
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 new
one. Instead, it will insert a new element at index n.
the index where a new element will be inserted .
[use case] Computes the multiset intersection between this list buffer and another sequence .
Computes the multiset intersection between this list buffer and another sequence .
the sequence of elements to intersect with .
a new list buffer which contains all elements of this list 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.
Computes the multiset intersection between this list buffer and another sequence .
Computes the multiset intersection between this list buffer and another sequence .
the element type of the returned list buffer .
the sequence of elements to intersect with .
a new collection of type That which contains all elements of this list 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.
Tests whether this list buffer contains given index .
Tests whether this list buffer contains given index .
The implementations of methods apply and isDefinedAt turn a Seq[A] into
a PartialFunction[Int, A].
true if this list buffer contains an element at position idx, false otherwise.
Tests whether this list buffer is empty .
Tests whether this list buffer is empty .
true if the list buffer contain no elements, false otherwise.
This method is used to test whether the dynamic type of the receiver object is T0.
This method is used to test whether the dynamic type of the receiver object is T0.
Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will
return true. In the latter example, because the type argument is erased as part of compilation it is not
possible to check whether the contents of the list are of the requested typed.
true if the receiver object is an instance of erasure of type T0; false otherwise.
Tests whether this list buffer can be repeatedly traversed .
Tests whether this list buffer can be repeatedly traversed .
true
Creates a new iterator over all elements contained in this iterable object .
Creates a new iterator over all elements contained in this iterable object .
the new iterator
Selects the last element .
Selects the last element .
the first element of this list buffer .
[use case] Finds index of last occurrence of some value in this list buffer before or at a given end index .
Finds index of last occurrence of some value in this list buffer before or at a given end index .
the element value to search for .
the end index .
the index <= end of the last element of this list buffer that is equal (wrt ==)
to elem, or -1, if none exists.
Finds index of last occurrence of some value in this list buffer before or at a given end index .
Finds index of last occurrence of some value in this list buffer before or at a given end index .
the type of the element elem.
the element value to search for .
the end index .
the index <= end of the last element of this list buffer that is equal (wrt ==)
to elem, or -1, if none exists.
[use case] Finds index of last occurrence of some value in this list buffer .
Finds index of last occurrence of some value in this list buffer .
the element value to search for .
the index of the last element of this list buffer that is equal (wrt ==)
to elem, or -1, if none exists.
Finds index of last occurrence of some value in this list buffer .
Finds index of last occurrence of some value in this list buffer .
the type of the element elem.
the element value to search for .
the index of the last element of this list buffer that is equal (wrt ==)
to elem, or -1, if none exists.
Finds last index before or at a given end index where this list buffer contains a given sequence as a slice .
Finds last index before or at a given end index where this list buffer contains a given sequence as a slice .
the sequence to test
the end index
the last index <= end such that the elements of this list buffer starting at this index
match the elements of sequence that, or -1 of no such subsequence exists.
Finds last index where this list buffer contains a given sequence as a slice .
Finds last index where this list buffer contains a given sequence as a slice .
the sequence to test
the last index such that the elements of this list buffer starting a this index
match the elements of sequence that, or -1 of no such subsequence exists.
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 .
the predicate used to test elements .
the index <= end of the last element of this list buffer that satisfies the predicate p,
or -1, if none exists.
Finds index of last element satisfying some predicate .
Finds index of last element satisfying some predicate .
the predicate used to test elements .
the index of the last element of this list buffer that satisfies the predicate p,
or -1, if none exists.
Optionally selects the last element .
Optionally selects the last element .
the last element of this list buffer$ if it is nonempty, None if it is empty.
The current length of the buffer .
The current length of the buffer .
This operation takes constant [email protected] the number of elements in this list buffer.
Compares the length of this list buffer to a test value .
Compares the length of this list buffer to a test value .
the test value that gets compared with the length .
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.
Turns this partial function into an plain function returning an Option result.
Turns this partial function into an plain function returning an Option result.
a function that takes an argument x to Some(this(x)) if this is defined for x, and to None otherwise.
[use case] Builds a new collection by applying a function to all elements of this list buffer .
Builds a new collection by applying a function to all elements of this list buffer .
the element type of the returned collection .
the function to apply to each element .
a new list buffer resulting from applying the given function
f to each element of this list buffer and collecting the results.
Builds a new collection by applying a function to all elements of this list buffer .
Builds a new collection by applying a function to all elements of this list buffer .
the element type of the returned collection .
the class of the returned collection. In the standard library configuration,
That is always ListBuffer[B] because an implicit of type CanBuildFrom[ListBuffer, B, ListBuffer[B]] is defined in object ListBuffer.
the function to apply to each element .
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr and the new element type B.
a new collection of type That resulting from applying the given function
f to each element of this list buffer and collecting the results.
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 .
the type of collection returned by f.
the transformation function .
a new builder which is the same as the current builder except that a transformation function is applied to this builder's result .
[use case] Finds the largest element .
Finds the largest element .
the largest element of this list buffer .
Finds the largest element .
Finds the largest element .
The type over which the ordering is defined .
An ordering to be used for comparing elements .
the largest element of this list buffer with respect to the ordering cmp.
[use case] Finds the smallest element .
Finds the smallest element .
the smallest element of this list buffer
Finds the smallest element .
Finds the smallest element .
The type over which the ordering is defined .
An ordering to be used for comparing elements .
the smallest element of this list buffer with respect to the ordering cmp.
Displays all elements of this list buffer in a string .
Displays all elements of this list buffer in a string .
a string representation of this list buffer. In the resulting string
the string representations (w.r.t. the method toString)
of all elements of this list buffer follow each other without any separator string.
Displays all elements of this list buffer in a string using a separator string .
Displays all elements of this list buffer in a string using a separator string .
the separator string .
a string representation of this list buffer. In the resulting string
the string representations (w.r.t. the method toString)
of all elements of this list buffer are separated by the string sep.
Displays all elements of this list buffer in a string using start, end, and separator strings .
Displays all elements of this list buffer in a string using start, end, and separator strings .
the starting string .
the separator string .
the ending string .
a string representation of this list 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 list buffer are separated by the string sep.
o.ne(arg0) is the same as !(o.eq(arg0)).
o.ne(arg0) is the same as !(o.eq(arg0)).
the object to compare against this object for reference dis-equality .
false if the argument is not a reference to the receiver object; true otherwise.
The builder that builds instances of type ListBuffer[A]
The builder that builds instances of type ListBuffer[A]
Tests whether the list buffer is not empty .
Tests whether the list buffer is not empty .
true if the list buffer contains at least one element, false otherwise.
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 .
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 .
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 .
the argument type of the fallback function
the result type of the fallback function
the fallback function
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.
[use case] Appends an element value to this list buffer until a given target length is reached .
Appends an element value to this list buffer until a given target length is reached .
the target length
the padding value
a new list buffer consisting of
all elements of this list buffer followed by the minimal number of occurrences of elem so
that the resulting list buffer has a length of at least len.
Appends an element value to this list buffer until a given target length is reached .
Appends an element value to this list buffer until a given target length is reached .
the element type of the returned list buffer .
the class of the returned collection. In the standard library configuration,
That is always ListBuffer[B] because an implicit of type CanBuildFrom[ListBuffer, B, ListBuffer[B]] is defined in object ListBuffer.
the target length
the padding value
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr and the new element type B.
a new collection of type That consisting of
all elements of this list buffer followed by the minimal number of occurrences of elem so
that the resulting collection has a length of at least len.
Partitions this list buffer in two list buffers according to a predicate .
Partitions this list buffer in two list buffers according to a predicate .
the predicate on which to partition .
a pair of list buffers: the first list buffer consists of all elements that
satisfy the predicate p and the second list buffer consists of all elements
that don't. The relative order of the elements in the resulting list buffers
is the same as in the original list buffer.
[use case] Produces a new list buffer where a slice of elements in this list buffer is replaced by another sequence .
Produces a new list buffer where a slice of elements in this list buffer is replaced by another sequence .
the index of the first replaced element
the number of elements to drop in the original list buffer
a new list buffer consisting of all elements of this list buffer
except that replaced elements starting from from are replaced
by patch.
Produces a new list buffer where a slice of elements in this list buffer is replaced by another sequence .
Produces a new list buffer where a slice of elements in this list buffer is replaced by another sequence .
the element type of the returned list buffer .
the class of the returned collection. In the standard library configuration,
That is always ListBuffer[B] because an implicit of type CanBuildFrom[ListBuffer, B, ListBuffer[B]] is defined in object ListBuffer.
the index of the first replaced element
the replacement sequence
the number of elements to drop in the original list buffer
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr and the new element type B.
a new list buffer consisting of all elements of this list buffer
except that replaced elements starting from from are replaced
by patch.
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 .
the predicate used to test elements .
the length of the longest prefix of this list buffer
such that every element of the segment satisfies the predicate p.
Prepends given elements to this buffer .
Prepends given elements to this buffer .
the elements to prepend .
Prepends the elements contained in a traversable object to this buffer .
Prepends the elements contained in a traversable object to this buffer .
Prepends the elements of this buffer to a given list
Prepends the elements of this buffer to a given list
the list to which elements are prepended
[use case] Multiplies up the elements of this collection .
Multiplies up the elements of this collection .
the product of all elements in this list buffer of numbers of type Int.
Instead of Int, any other type T with an implicit Numeric[T] implementation
can be used as element type of the list buffer and as result type of product.
Examples of such types are: Long, Float, Double, BigInt.
Multiplies up the elements of this collection .
Multiplies up the elements of this collection .
the result type of the * operator.
an implicit parameter defining a set of numeric operations
which includes the * operator to be used in forming the product.
the product of all elements of this list buffer with respect to the * operator in num.
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 .
use view' instead
expose the underlying list but do not mark it as [email protected] A sequence which refers to this buffer for all its operations .
expose the underlying list but do not mark it as [email protected] A sequence which refers to this buffer for all its operations .
Applies a binary operator to all elements of this list buffer, going left to right .
Applies a binary operator to all elements of this list buffer, going left to right .
the result type of the binary operator .
the binary operator .
the result of inserting op between consecutive elements of this list buffer,
going left to right:
op(...(op(x1, x2), ... ) , xn)
where x,,1,,, ..., x,,n,, are the elements of this list buffer.
Optionally applies a binary operator to all elements of this list buffer, going left to right .
Optionally applies a binary operator to all elements of this list buffer, going left to right .
the result type of the binary operator .
the binary operator .
an option value containing the result of reduceLeft(op) is this list buffer is nonempty,
None otherwise.
Applies a binary operator to all elements of this list buffer, going right to left .
Applies a binary operator to all elements of this list buffer, going right to left .
the result type of the binary operator .
the binary operator .
the result of inserting op between consecutive elements of this list buffer,
going right to left:
op(x1, op(x2, ..., op(xn-1, xn)...))
where x,,1,,, ..., x,,n,, are the elements of this list buffer.
Optionally applies a binary operator to all elements of this list buffer, going right to left .
Optionally applies a binary operator to all elements of this list buffer, going right to left .
the result type of the binary operator .
the binary operator .
an option value containing the result of reduceRight(op) is this list buffer is nonempty,
None otherwise.
Removes the element on a given index position .
Removes the element on a given index position . May take time linear in the buffer size.
the index which refers to the element to delete .
n the element that was formerly at position n.
Removes a given number of elements on a given index position .
Removes a given number of elements on a given index position . May take time linear in the buffer size.
the index which refers to the first element to remove .
the number of elements to remove .
The collection of type list buffer underlying this TraversableLike object.
The collection of type list buffer underlying this TraversableLike object.
By default this is implemented as the TraversableLike object itself, but this can be overridden.
Produces a collection from the added elements .
Produces a collection from the added elements . The builder's contents are undefined after this operation.
a collection containing the elements added to this builder .
Returns new list buffer wih elements in reversed order .
Returns new list buffer wih elements in reversed order .
A new list buffer with all elements of this list buffer in reversed order .
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.
an iterator yielding the elements of this list buffer in reversed order
[use case] Builds a new collection by applying a function to all elements of this list buffer and collecting the results in reversed order .
Builds a new collection by applying a function to all elements of this list buffer and collecting the results in reversed order .
the element type of the returned collection .
Note: xs.reverseMap(f) is the same as xs.reverse.map(f) but might be more efficient.
the function to apply to each element .
a new list buffer resulting from applying the given function
f to each element of this list buffer and collecting the results in reversed order.
Builds a new collection by applying a function to all elements of this list buffer and collecting the results in reversed order .
Builds a new collection by applying a function to all elements of this list 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.
the element type of the returned collection .
the class of the returned collection. In the standard library configuration,
That is always ListBuffer[B] because an implicit of type CanBuildFrom[ListBuffer, B, ListBuffer[B]] is defined in object ListBuffer.
the function to apply to each element .
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr and the new element type B.
a new collection of type That resulting from applying the given function
f to each element of this list buffer and collecting the results in reversed order.
use reverseIterator' instead
[use case] Checks if the other iterable collection contains the same elements in the same order as this list buffer .
Checks if the other iterable collection contains the same elements in the same order as this list buffer .
the collection to compare with .
true, if both collections contain the same elements in the same order, false otherwise.
Checks if the other iterable collection contains the same elements in the same order as this list buffer .
Checks if the other iterable collection contains the same elements in the same order as this list buffer .
the type of the elements of collection that.
the collection to compare with .
true, if both collections contain the same elements in the same order, false otherwise.
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 .
the type of the elements in the resulting collection
the actual type of the resulting collection
the initial value
the binary operator applied to the intermediate result and the element
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr and the new element type B.
collection with intermediate results
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 type of the elements in the resulting collection
the actual type of the resulting collection
the initial value
the binary operator applied to the intermediate result and the element
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr and the new element type B.
collection with intermediate results
Computes length of longest segment whose elements all satisfy some predicate .
Computes length of longest segment whose elements all satisfy some predicate .
the predicate used to test elements .
the index where the search starts .
the length of the longest segment of this list buffer starting from index from such that every element of the segment satisfies the predicate p.
The size of this list buffer .
The size of this list buffer .
the number of elements in this list buffer .
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.
the hint how many elements will be added .
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)
the index of the first returned element in this list buffer .
the index one past the last returned element in this list buffer .
a list buffer containing the elements starting at index from and extending up to (but not including) index until of this list buffer.
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 . )
the number of elements per group
An iterator producing list buffers of size size, except the
last will be truncated if the elements don't divide evenly.
Iterator#sliding
Sorts this ListBuffer according to the Ordering which results from transforming an implicitly given Ordering with a transformation function .
Sorts this ListBuffer according to the Ordering which results from transforming an implicitly given Ordering with a transformation function .
the target type of the transformation f, and the type where
the ordering ord is defined.
the transformation function mapping elements
to some other domain B.
the ordering assumed on domain B.
a list buffer consisting of the elements of this list buffer
sorted according to the ordering where x < y if
ord.lt(f(x), f(y)).
scala . math.Ordering
Sorts this list buffer according to a comparison function .
Sorts this list 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.
the comparison function which tests whether its first argument precedes its second argument in the desired ordering .
a list buffer consisting of the elements of this list buffer
sorted according to the comparison function lt.
Sorts this list buffer according to an Ordering .
Sorts this list 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.
the ordering to be used to compare elements .
a list buffer consisting of the elements of this list buffer
sorted according to the ordering ord.
scala . math.Ordering
Splits this list buffer into a prefix/suffix pair according to a predicate .
Splits this list 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.
the test predicate
a pair consisting of the longest prefix of this list buffer whose
elements all satisfy p, and the rest of this list buffer.
Splits this list buffer into two at a given position .
Splits this list 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).
the position at which to split .
a pair of list buffers consisting of the first n elements of this list buffer, and the other elements.
Tests whether this list buffer starts with the given sequence .
Tests whether this list buffer starts with the given sequence .
the sequence to test
true if this collection has that as a prefix, false otherwise.
Tests whether this list buffer contains the given sequence at a given index .
Tests whether this list 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.
the sequence to test
the index where the sequence is searched .
true if the sequence that is contained in this list buffer at index offset,
otherwise false.
Defines the prefix of the string representation .
Defines the prefix of the string representation .
the string representation of this buffer .
[use case] Sums up the elements of this collection .
Sums up the elements of this collection .
the sum of all elements in this list buffer of numbers of type Int.
Instead of Int, any other type T with an implicit Numeric[T] implementation
can be used as element type of the list buffer and as result type of sum.
Examples of such types are: Long, Float, Double, BigInt.
Sums up the elements of this collection .
Sums up the elements of this collection .
the result type of the + operator.
an implicit parameter defining a set of numeric operations
which includes the + operator to be used in forming the sum.
the sum of all elements of this list buffer with respect to the + operator in num.
Selects all elements except the first .
Selects all elements except the first .
a list buffer consisting of all elements of this list buffer except the first one .
Selects first n elements.
Selects first n elements.
Tt number of elements to take from this list buffer .
a list buffer consisting only of the first n elements of this list buffer, or else the
whole list buffer, if it has less than n elements.
Selects last n elements.
Selects last n elements.
the number of elements to take
a list buffer consisting only of the last n elements of this list buffer, or else the
whole list buffer, if it has less than n elements.
Takes longest prefix of elements that satisfy a predicate .
Takes longest prefix of elements that satisfy a predicate .
The predicate used to test elements .
the longest prefix of this list buffer whose elements all satisfy
the predicate p.
The underlying collection seen as an instance of ListBuffer.
The underlying collection seen as an instance of ListBuffer.
By default this is implemented as the current collection object itself,
but this can be overridden.
[use case] Converts this list buffer to an array .
Converts this list buffer to an array .
an array containing all elements of this list buffer.
A ClassManifest must be available for the element type of this list buffer.
Converts this list buffer to an array .
Converts this list buffer to an array .
the type of the elements of the array. A ClassManifest for this type must
be available.
an array containing all elements of this list buffer .
A conversion from collections of type Repr to ListBuffer objects.
A conversion from collections of type Repr to ListBuffer objects.
By default this is implemented as just a cast, but this can be overridden.
Converts this list buffer to an indexed sequence .
Converts this list buffer to an indexed sequence .
an indexed sequence containing all elements of this list buffer .
Converts this list buffer to an iterable collection .
Converts this list buffer to an iterable collection .
an Iterable containing all elements of this list buffer.
Returns an Iterator over the elements in this list buffer .
Returns an Iterator over the elements in this list buffer . Will return the same Iterator if this instance is already an Iterator.
an Iterator containing all elements of this list buffer .
Converts this buffer to a list .
Converts this buffer to a list . Takes constant time. The buffer is copied lazily, the first time it is mut[email protected] a list containing all elements of this list buffer.
Converts this list buffer to a map .
Converts this list 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.
a map containing all elements of this list buffer .
Converts this list buffer to a sequence .
Converts this list buffer to a sequence .
a sequence containing all elements of this list buffer .
Converts this list buffer to a set .
Converts this list buffer to a set .
a set containing all elements of this list buffer .
Converts this list buffer to a stream .
Converts this list buffer to a stream .
a stream containing all elements of this list buffer .
Converts this list buffer to a string .
Converts this list buffer to a string .
a string representation of this collection. By default this
string consists of the stringPrefix of this list buffer,
followed by all elements separated by commas and enclosed in parentheses.
Converts this list buffer to an unspecified Traversable .
Converts this list buffer to an unspecified Traversable . Will return the same collection if this instance is already Traversable.
a Traversable containing all elements of this list buffer .
Transposes this list buffer of traversable collections into a list buffer of list buffers .
Transposes this list buffer of traversable collections into a list buffer of list buffers .
the type of the elements of each traversable collection .
an implicit conversion which asserts that the element type of this
list buffer is a Traversable.
a two-dimensional list buffer of list buffers which has as nth row the nth column of this list buffer.
Removes the last n elements of this buffer.
Removes the last n elements of this buffer.
the number of elements to remove from the end of this buffer .
Removes the first n elements of this buffer.
Removes the first n elements of this buffer.
the number of elements to remove from the beginning of this buffer .
The iterable object to which calls are forwarded
The iterable object to which calls are forwarded
[use case] Produces a new sequence which contains all elements of this list buffer and also all elements of a given sequence .
Produces a new sequence which contains all elements of this list buffer and also all elements of
a given sequence. xs union ys is equivalent to xs ++ ys.
the sequence to add .
a new list buffer which contains all elements of this list buffer
followed by all elements of that.
Produces a new sequence which contains all elements of this list buffer and also all elements of a given sequence .
Produces a new sequence which contains all elements of this list 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-part of diff and intersect which also work on multi-sets.
the element type of the returned list buffer .
the class of the returned collection. In the standard library configuration,
That is always ListBuffer[B] because an implicit of type CanBuildFrom[ListBuffer, B, ListBuffer[B]] is defined in object ListBuffer.
the sequence to add .
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr and the new element type B.
a new collection of type That which contains all elements of this list buffer
followed by all elements of that.
Converts this list buffer of pairs into two collections of the first and second halfs of each pair .
Converts this list buffer of pairs into two collections of the first and second halfs of each pair .
an implicit conversion which asserts that the element type of this list buffer is a pair .
a pair list buffers, containing the first, respectively second half of each element pair of this list buffer .
Replaces element at index n with the new element
newelem.
Replaces element at index n with the new element
newelem. Takes time linear in the buffer size. (except the
first element, which is updated in constant time).
the index of the element to replace .
the new element .
[use case] A copy of this list buffer with one single replaced element .
A copy of this list buffer with one single replaced element .
the position of the replacement
the replacing element
a copy of this list buffer with the element at position index replaced by elem.
A copy of this list buffer with one single replaced element .
A copy of this list buffer with one single replaced element .
the element type of the returned list buffer .
the class of the returned collection. In the standard library configuration,
That is always ListBuffer[B] because an implicit of type CanBuildFrom[ListBuffer, B, ListBuffer[B]] is defined in object ListBuffer.
the position of the replacement
the replacing element
an implicit value of class CanBuildFrom which determines the
result class That from the current representation type Repr and the new element type B.
a new list buffer which is a copy of this list buffer with the element at position index replaced by elem.
Creates a non-strict view of a slice of this list buffer .
Creates a non-strict view of a slice of this list buffer .
Note: the difference between view and slice is that view produces
a view of the current list buffer, whereas slice produces a new list buffer.
Note: view(from, to) is equivalent to view.slice(from, to)
the index of the first element of the view
the index of the element following the view
a non-strict view of a slice of this list buffer, starting at index from and extending up to (but not including) index until.
Creates a non-strict view of this list buffer .
Creates a non-strict view of this list buffer .
a non-strict view of this list buffer .
Creates a non-strict filter of this list buffer .
Creates a non-strict filter of this list 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.
the predicate used to test elements .
an object of class WithFilter, which supports
map, flatMap, foreach, and withFilter operations.
All these operations apply to those elements of this list buffer which
satisfy the predicate p.
[use case] Returns a list buffer formed from this list buffer and another iterable collection by combining corresponding elements in pairs .
Returns a list buffer formed from this list 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.
the type of the second half of the returned pairs
The iterable providing the second half of each result pair
a new list buffer containing pairs consisting of
corresponding elements of this list buffer and that. The length
of the returned collection is the minimum of the lengths of this list buffer and that.
Returns a list buffer formed from this list buffer and another iterable collection by combining corresponding elements in pairs .
Returns a list buffer formed from this list 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.
the type of the first half of the returned pairs (this is always a supertype
of the collection's element type A).
the type of the second half of the returned pairs
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.
The iterable providing the second half of each result pair
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).
a new collection of type That containing pairs consisting of
corresponding elements of this list buffer and that. The length
of the returned collection is the minimum of the lengths of this list buffer and that.
[use case] Returns a list buffer formed from this list buffer and another iterable collection by combining corresponding elements in pairs .
Returns a list buffer formed from this list 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.
the type of the second half of the returned pairs
The iterable providing the second half of each result pair
the element to be used to fill up the result if this list buffer is shorter than that.
the element to be used to fill up the result if that is shorter than this list buffer.
a new list buffer containing pairs consisting of
corresponding elements of this list buffer and that. The length
of the returned collection is the maximum of the lengths of this list buffer and that.
If this list buffer is shorter than that, thisElem values are used to pad the result.
If that is shorter than this list buffer, thatElem values are used to pad the result.
Returns a list buffer formed from this list buffer and another iterable collection by combining corresponding elements in pairs .
Returns a list buffer formed from this list 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.
the iterable providing the second half of each result pair
the element to be used to fill up the result if this list buffer is shorter than that.
the element to be used to fill up the result if that is shorter than this list buffer.
a new collection of type That containing pairs consisting of
corresponding elements of this list buffer and that. The length
of the returned collection is the maximum of the lengths of this list buffer and that.
If this list buffer is shorter than that, thisElem values are used to pad the result.
If that is shorter than this list buffer, thatElem values are used to pad the result.
[use case] Zips this list buffer with its indices .
Zips this list buffer with its indices .
A new list buffer containing pairs consisting of all elements of this
list buffer paired with their index. Indices start at 0.
@example
List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))
Zips this list buffer with its indices .
Zips this list buffer with its indices .
the type of the first half of the returned pairs (this is always a supertype
of the collection's element type A).
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.
A new collection of type That containing pairs consisting of all elements of this
list buffer paired with their index. Indices start at 0.
A
Bufferimplementation back up by a list. It provides constant time prepend and append. Most other operations are linear.the type of this list buffer's elements .
version
2 . 8
since
1
authors:
Martin Odersky
Matthias Zenger