scala.collection.JavaConversions

JListWrapper

class JListWrapper [A] (underlying: List[A]) extends Buffer[A] with Product

go to: companion
linear super types: Product, Buffer[A], BufferLike[A, Buffer[A]], Cloneable[Buffer[A]], Subtractable[A, Buffer[A]], Scriptable[A], Shrinkable[A], Growable[A], Seq[A], Seq[A], SeqLike[A, Buffer[A]], PartialFunction[Int, A], (Int) ⇒ A, Iterable[A], Iterable[A], IterableLike[A, Buffer[A]], Equals, Traversable[A], Mutable, Traversable[A], GenericTraversableTemplate[A, Buffer], TraversableLike[A, Buffer[A]], TraversableOnce[A], FilterMonadic[A, Buffer[A]], HasNewBuilder[A, Buffer[A]], AnyRef, Any
source: JavaConversions.scala
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. JListWrapper
  2. Product
  3. Buffer
  4. BufferLike
  5. Cloneable
  6. Subtractable
  7. Scriptable
  8. Shrinkable
  9. Growable
  10. Seq
  11. Seq
  12. SeqLike
  13. PartialFunction
  14. Function1
  15. Iterable
  16. Iterable
  17. IterableLike
  18. Equals
  19. Traversable
  20. Mutable
  21. Traversable
  22. GenericTraversableTemplate
  23. TraversableLike
  24. TraversableOnce
  25. FilterMonadic
  26. HasNewBuilder
  27. AnyRef
  28. Any
Visibility
  1. Public
  2. All
Impl.
  1. Concrete
  2. Abstract

Instance constructors

  1. new JListWrapper (underlying: List[A])

Type Members

  1. type Self = Buffer[A]

    The type implementing this traversable

    The type implementing this traversable

    attributes: protected
    definition classes: TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]

    A class supporting filtered operations.

Value Members

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

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

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

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

    arg0

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

    returns

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

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

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

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

    attributes: final
    definition classes: AnyRef
  6. def + (elem1: A, elem2: A, elems: A*) : Buffer[A]

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

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

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

    elem1

    the first element to add.

    elem2

    the second element to add.

    elems

    the remaining elements to add.

    definition classes: BufferLike
      deprecated:
  7. def + (elem: A) : Buffer[A]

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

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

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

    elem

    the element to add.

    definition classes: BufferLike
      deprecated:
  8. def ++ (xs: TraversableOnce[A]) : Buffer[A]

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

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

    xs

    the traversable object.

    returns

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

    definition classes: BufferLike
  9. def ++ (that: TraversableOnce[A]) : Buffer[A]

    [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
    definition classes: TraversableLike
  10. def ++ [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[Buffer[A], 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
  11. def ++: (xs: Traversable[A]) : Buffer[A]

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

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

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

    xs

    elements to prepend

    returns

    this buffer

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

  12. def ++= (src: Array[A], start: Int, len: Int) : Unit

    Adds a number of elements in an array

    Adds a number of elements in an array

    src

    the array

    start

    the first element to append

    len

    the number of elements to append

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

  13. def ++= (xs: TraversableOnce[A]) : JListWrapper.this.type

    Appends all elements produced by a TraversableOnce to this buffer.

    Appends all elements produced by a TraversableOnce to this buffer.

    returns

    the buffer itself.

    definition classes: Growable
  14. def ++=: (xs: TraversableOnce[A]) : JListWrapper.this.type

    Prepends elements to this buffer.

    Prepends elements to this buffer.

    xs

    the TraversableOnce containing the elements to prepend.

    returns

    the buffer itself.

    definition classes: BufferLike
  15. def +: (elem: A) : Buffer[A]

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

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

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

    returns

    this buffer

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

  16. def +: (elem: A) : Buffer[A]

    [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
    definition classes: SeqLike
  17. def +: [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[Buffer[A], 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
  18. def += (elem: A) : JListWrapper.this.type

    Appends a single element to this buffer.

    Appends a single element to this buffer.

    elem

    the element to append.

    returns

    the buffer itself

    definition classes: JListWrapperBufferLikeGrowable
  19. def += (elem1: A, elem2: A, elems: A*) : JListWrapper.this.type

    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
  20. def +=: (elem: A) : JListWrapper.this.type

    Prepends a single element to this buffer.

    Prepends a single element to this buffer.

    elem

    the element to prepend.

    returns

    the buffer itself.

    definition classes: JListWrapperBufferLike
  21. def - (elem1: A, elem2: A, elems: A*) : Buffer[A]

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

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

    elem1

    the first element to remove.

    elem2

    the second element to remove.

    elems

    the remaining elements to remove.

    returns

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

    definition classes: BufferLikeSubtractable
  22. def - (elem: A) : Buffer[A]

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

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

    elem

    the element to remove.

    returns

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

    definition classes: BufferLikeSubtractable
  23. def -- (xs: TraversableOnce[A]) : Buffer[A]

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

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

    xs

    the traversable object.

    returns

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

    definition classes: BufferLikeSubtractable
  24. def --= (xs: TraversableOnce[A]) : JListWrapper.this.type

    Removes all elements produced by an iterator from this buffer.

    Removes all elements produced by an iterator from this buffer.

    returns

    the buffer itself

    definition classes: Shrinkable
  25. def -= (x: A) : JListWrapper.this.type

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

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

    x

    the element to remove.

    returns

    the buffer itself

    definition classes: BufferLikeShrinkable
  26. def -= (elem1: A, elem2: A, elems: A*) : JListWrapper.this.type

    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
  27. def /: [B] (z: B)(op: (B, A) ⇒ 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, x1), x2), ..., xn) where x,,1,,, ..., x,,n,, are the elements of this buffer.

    definition classes: TraversableOnce
  28. def :+ (elem: A) : Buffer[A]

    [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
    definition classes: SeqLike
  29. def :+ [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[Buffer[A], 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
  30. def :\ [B] (z: B)(op: (A, 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(x1, op(x2, ... op(xn, z)...)) where x,,1,,, ..., x,,n,, are the elements of this buffer.

    definition classes: TraversableOnce
  31. def << (cmd: Message[A]) : Unit

    Send a message to this scriptable object.

    Send a message to this scriptable object.

    cmd

    the message to send.

    definition classes: BufferLikeScriptable
  32. def == (arg0: AnyRef) : Boolean

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

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

    arg0

    the object to compare against this object for equality.

    returns

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

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

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

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

    arg0

    the object to compare against this object for equality.

    returns

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

    attributes: final
    definition classes: Any
  34. 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: TraversableOnce
  35. 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: TraversableOnce
  36. 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: TraversableOnce
  37. def andThen [C] (k: (A) ⇒ C) : PartialFunction[Int, C]

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

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

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

    a partial function with the same domain as this partial function, which maps arguments x to k(this(x)).

    definition classes: PartialFunctionFunction1
  38. def append (elems: A*) : Unit

    Appends the given elements to this buffer.

    Appends the given elements to this buffer.

    elems

    the elements to append.

    definition classes: BufferLike
  39. def appendAll (xs: TraversableOnce[A]) : Unit

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

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

    xs

    the traversable object containing the elements to append.

    definition classes: BufferLike
  40. def apply (i: Int) : A

    Selects an element by its index in the buffer.

    Selects an element by its index in the buffer.

    returns

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

    definition classes: JListWrapperBufferLikeSeqLikeFunction1
  41. def asInstanceOf [T0] : T0

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

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

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

    returns

    the receiver object.

    attributes: final
    definition classes: Any
  42. 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: IterableLikeEquals
  43. def clear () : Unit

    Clears the buffer's contents.

    Clears the buffer's contents. After this operation, the buffer is empty.

    definition classes: JListWrapperBufferLikeGrowable
  44. def clone () : Buffer[A]

    This method creates and returns a copy of the receiver object.

    This method creates and returns a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    definition classes: Cloneable → AnyRef
  45. def collect [B] (pf: PartialFunction[A, B]) : Buffer[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
    definition classes: TraversableLike
  46. def collect [B, That] (pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Buffer[A], 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
  47. def companion : GenericCompanion[Buffer]

    The factory companion object that builds instances of class Buffer.

    The factory companion object that builds instances of class Buffer.

    definition classes: BufferSeqSeqIterableIterableTraversableTraversableGenericTraversableTemplate
  48. def compose [A] (g: (A) ⇒ Int) : (A) ⇒ A

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

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

    definition classes: Function1
  49. 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
  50. 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
  51. def copyToArray (xs: Array[A], start: Int, len: 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 at most len 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, or len elements have been copied.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

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

    Copies elements of this buffer to an array.

    Copies elements of this buffer to an array. Fills the given array xs with at most len 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, or len elements have been copied.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  53. def copyToArray (xs: Array[A]) : Unit

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

    [use case]

    Copies values of this buffer to an array. Fills the given array xs with values of this buffer. 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
    definition classes: TraversableOnce
  54. def copyToArray [B >: A] (xs: Array[B]) : Unit

    Copies values of this buffer to an array.

    Copies values of this buffer to an array. Fills the given array xs with values of this buffer. 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: TraversableOnce
  55. def copyToArray (xs: Array[A], start: Int) : Unit

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

    [use case]

    Copies values of this buffer to an array. Fills the given array xs with values of this buffer, after skipping start values. 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
    definition classes: TraversableOnce
  56. def copyToArray [B >: A] (xs: Array[B], start: Int) : Unit

    Copies values of this buffer to an array.

    Copies values of this buffer to an array. Fills the given array xs with values of this buffer, after skipping start values. 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: TraversableOnce
  57. def copyToBuffer [B >: A] (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: TraversableOnce
  58. def corresponds [B] (that: Seq[B])(p: (A, 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
  59. def count (p: (A) ⇒ 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: TraversableOnce
  60. def diff (that: Seq[A]) : Buffer[A]

    [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
    definition classes: SeqLike
  61. def diff [B >: A] (that: Seq[B]) : Buffer[A]

    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 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
  62. def distinct : Buffer[A]

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

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

    returns

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

    definition classes: SeqLike
  63. def drop (n: Int) : Buffer[A]

    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: TraversableLike
  64. def dropRight (n: Int) : Buffer[A]

    Selects all elements except last n ones.

    Selects all elements except last 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: IterableLike
  65. def dropWhile (p: (A) ⇒ Boolean) : Buffer[A]

    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: TraversableLike
  66. def elements : Iterator[A]

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

  67. 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: SeqLike
  68. def eq (arg0: AnyRef) : Boolean

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

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

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

    Additionally, the eq method has three other properties. * It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false. * For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false. * null.eq(null) returns true.

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

    arg0

    the object to compare against this object for reference equality.

    returns

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

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

    The equality method defined in AnyRef.

    The equality method defined in AnyRef.@return true if the receiver object is equivalent to the argument; false otherwise. */

    definition classes: SeqLikeEquals → AnyRef → Any
  70. def equalsWith [B] (that: Seq[B])(f: (A, 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
      deprecated:
    1. use corresponds instead

  71. def exists (p: (A) ⇒ 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: IterableLikeTraversableLikeTraversableOnce
  72. def filter (p: (A) ⇒ Boolean) : Buffer[A]

    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
  73. def filterNot (p: (A) ⇒ Boolean) : Buffer[A]

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

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

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

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

    attributes: protected
    definition classes: AnyRef
  75. def find (p: (A) ⇒ Boolean) : Option[A]

    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: IterableLikeTraversableLikeTraversableOnce
  76. def findIndexOf (p: (A) ⇒ Boolean) : Int

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

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

    definition classes: SeqLike
  77. def findLastIndexOf (p: (A) ⇒ Boolean) : Int

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

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

    definition classes: SeqLike
      deprecated:
    1. use lastIndexWhere instead

  78. def first : A

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

  79. def firstOption : Option[A]

    None if iterable is empty.

    None if iterable is empty.

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

  80. def flatMap [B] (f: (A) ⇒ Traversable[B]) : Buffer[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
    definition classes: TraversableLike
  81. def flatMap [B, That] (f: (A) ⇒ Traversable[B])(implicit bf: CanBuildFrom[Buffer[A], 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: TraversableLikeFilterMonadic
  82. def flatten [B] : Buffer[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
    definition classes: GenericTraversableTemplate
  83. def flatten [B] (implicit asTraversable: (A) ⇒ Traversable[B]) : Buffer[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
  84. def foldLeft [B] (z: B)(op: (B, A) ⇒ 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, x1), x2, ..., xn) where x,,1,,, ..., x,,n,, are the elements of this buffer.

    definition classes: TraversableOnce
  85. def foldRight [B] (z: B)(op: (A, 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(x1, op(x2, ... op(xn, z)...)) where x,,1,,, ..., x,,n,, are the elements of this buffer.

    definition classes: IterableLikeTraversableOnce
  86. def forall (p: (A) ⇒ 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: IterableLikeTraversableLikeTraversableOnce
  87. def foreach (f: (A) ⇒ 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
    definition classes: IterableLike
  88. def foreach [U] (f: (A) ⇒ 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: IterableLikeTraversableLikeTraversableOnceFilterMonadic
  89. def genericBuilder [B] : Builder[B, Buffer[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
  90. def getClass () : java.lang.Class[_]

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

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

    The nature of the representation is platform dependent.

    returns

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

    attributes: final
    definition classes: AnyRef
  91. def groupBy [K] (f: (A) ⇒ K) : Map[K, Buffer[A]]

    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
  92. def grouped (size: Int) : Iterator[Buffer[A]]

    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
      see also:
    1. Iterator#grouped

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

    returns

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

    definition classes: TraversableLikeTraversableOnce
  94. 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.@return the hash code value for the object. */

    definition classes: SeqLike → AnyRef → Any
  95. def head : A

    Selects the first element of this buffer.

    Selects the first element of this buffer.

    returns

    the first element of this buffer.

    definition classes: IterableLikeTraversableLike
  96. def headOption : Option[A]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

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

    definition classes: TraversableLike
  97. def indexOf (elem: A, from: Int) : 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.

    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.

    attributes: abstract
    definition classes: SeqLike
  98. def indexOf [B >: A] (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
  99. def indexOf (elem: A) : 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
    definition classes: SeqLike
  100. def indexOf [B >: A] (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
  101. def indexOfSlice [B >: A] (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
  102. def indexOfSlice [B >: A] (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
  103. def indexWhere (p: (A) ⇒ 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: SeqLike
  104. def indexWhere (p: (A) ⇒ 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
  105. def indices : Range

    Produces the range of all indices of this sequence.

    Produces the range of all indices of this sequence.

    returns

    a Range value from 0 to one less than the length of this buffer.

    definition classes: SeqLike
  106. def init : Buffer[A]

    Selects all elements except the last.

    Selects all elements except the last.

    returns

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

    definition classes: TraversableLike
  107. def insert (n: Int, elems: A*) : 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
  108. def insertAll (i: Int, elems: Traversable[A]) : Unit

    Inserts new elements at a given index into this buffer.

    Inserts new elements at a given index into this buffer.

    elems

    the traversable collection containing the elements to insert.

    definition classes: JListWrapperBufferLike
  109. def intersect (that: Seq[A]) : Buffer[A]

    [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
    definition classes: SeqLike
  110. def intersect [B >: A] (that: Seq[B]) : Buffer[A]

    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 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
  111. 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
  112. def isEmpty : Boolean

    Tests whether this buffer is empty.

    Tests whether this buffer is empty.

    returns

    true if the buffer contain no elements, false otherwise.

  113. def isInstanceOf [T0] : Boolean

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

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

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

    returns

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

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

    Tests whether this buffer can be repeatedly traversed.

    Tests whether this buffer can be repeatedly traversed.

    returns

    true

    attributes: final
    definition classes: TraversableLikeTraversableOnce
  115. def iterator : Iterator[A]

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

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

    returns

    the new iterator

    definition classes: JListWrapperIterableLike
  116. def last : A

    Selects the last element.

    Selects the last element.

    returns

    the first element of this buffer.

    definition classes: TraversableLike
  117. def lastIndexOf (elem: A, end: Int) : 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.

    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.

    attributes: abstract
    definition classes: SeqLike
  118. def lastIndexOf [B >: A] (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
  119. def lastIndexOf (elem: A) : 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
    definition classes: SeqLike
  120. def lastIndexOf [B >: A] (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
  121. def lastIndexOfSlice [B >: A] (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 index

    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
  122. def lastIndexOfSlice [B >: A] (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
  123. def lastIndexWhere (p: (A) ⇒ 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: SeqLike
  124. def lastIndexWhere (p: (A) ⇒ 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
  125. def lastOption : Option[A]

    Optionally selects the last element.

    Optionally selects the last element.

    returns

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

    definition classes: TraversableLike
  126. def length : Int

    The length of the buffer.

    The length of the buffer.

    Note: xs.length and xs.size yield the same result.

    returns

    the number of elements in this buffer.

    definition classes: JListWrapperBufferLikeSeqLike
  127. 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: SeqLike
  128. def lift : (Int) ⇒ Option[A]

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

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

    returns

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

    definition classes: PartialFunction
  129. def map [B] (f: (A) ⇒ B) : Buffer[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
    definition classes: TraversableLike
  130. def map [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[Buffer[A], 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: TraversableLikeFilterMonadic
  131. def max : A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this buffer.

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

    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: TraversableOnce
  133. def min : A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this buffer

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

    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: TraversableOnce
  135. def mkString : String

    Displays all elements of this buffer in a string.

    Displays all elements of this buffer in a 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 follow each other without any separator string.

    definition classes: TraversableOnce
  136. 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: TraversableOnce
  137. 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: TraversableOnce
  138. def ne (arg0: AnyRef) : Boolean

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

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

    arg0

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

    returns

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

    attributes: final
    definition classes: AnyRef
  139. def newBuilder : Builder[A, Buffer[A]]

    The builder that builds instances of type Buffer[A]

    The builder that builds instances of type Buffer[A]

    attributes: protected[this]
    definition classes: GenericTraversableTemplateHasNewBuilder
  140. def nonEmpty : Boolean

    Tests whether the buffer is not empty.

    Tests whether the buffer is not empty.

    returns

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

    definition classes: TraversableOnce
  141. def notify () : Unit

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

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

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

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

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

    attributes: final
    definition classes: AnyRef
  143. def orElse [A1 <: A, B1 >: B] (that: PartialFunction[A1, B1]) : PartialFunction[A1, B1]

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

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

    A1

    the argument type of the fallback function

    B1

    the result type of the fallback function

    that

    the fallback function

    returns

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

    definition classes: PartialFunction
  144. def padTo (len: Int, elem: A) : Buffer[A]

    [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
    definition classes: SeqLike
  145. def padTo [B >: A, That] (len: Int, elem: B)(implicit bf: CanBuildFrom[Buffer[A], 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
  146. def partition (p: (A) ⇒ Boolean) : (Buffer[A], Buffer[A])

    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
  147. def patch (from: Int, that: Seq[A], replaced: Int) : Buffer[A]

    [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
    definition classes: SeqLike
  148. def patch [B >: A, That] (from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[Buffer[A], 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 buffer consisting of all elements of this buffer except that replaced elements starting from from are replaced by patch.

    definition classes: SeqLike
  149. def prefixLength (p: (A) ⇒ Boolean) : Int

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

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

    p

    the predicate used to test elements.

    returns

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

    definition classes: SeqLike
  150. def prepend (elems: A*) : Unit

    Prepends given elements to this buffer.

    Prepends given elements to this buffer.

    elems

    the elements to prepend.

    definition classes: BufferLike
  151. def prependAll (xs: TraversableOnce[A]) : Unit

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

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

    definition classes: BufferLike
  152. def product : Int

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

    [use case]

    Multiplies up the elements of this collection.

    returns

    the product of all elements in this 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 buffer and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

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

    Multiplies up the elements of this collection.

    Multiplies up the elements of this collection.

    B

    the result type of the * operator.

    num

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

    returns

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

    definition classes: TraversableOnce
  154. def productArity : Int

    return k for a product A(x_1,...,x_k)

    return k for a product A(x_1,...,x_k)

    definition classes: JListWrapperProduct
  155. def productElement (arg0: Int) : Any

    For a product A(x_1,...,x_k), returns x_(n+1) for 0 <= n < k

    For a product A(x_1,...,x_k), returns x_(n+1) for 0 <= n < k

    returns

    The element n elements after the first element

    definition classes: JListWrapperProduct
  156. def productElements : Iterator[Any]

    definition classes: Product
      deprecated:
    1. use productIterator instead

  157. def productIterator : Iterator[Any]

    An iterator that returns all fields of this product

    An iterator that returns all fields of this product

    definition classes: Product
  158. def productPrefix : String

    By default the empty string.

    By default the empty string. Implementations may override this method in order to prepend a string prefix to the result of the toString methods.

    definition classes: JListWrapperProduct
  159. def projection : SeqView[A, Buffer[A]]

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

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

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

  160. def readOnly : Seq[A]

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

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

    returns

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

    definition classes: BufferLike
  161. def reduceLeft [B >: A] (op: (B, A) ⇒ 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(x1, x2), ... ) , xn) where x,,1,,, ..., x,,n,, are the elements of this buffer.

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

    definition classes: IterableLikeTraversableOnce
  164. def reduceRightOption [B >: A] (op: (A, 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: TraversableOnce
  165. def remove (i: Int) : A

    Removes the element at a given index from this buffer.

    Removes the element at a given index from this buffer.

    returns

    the previous element at index n

    definition classes: JListWrapperBufferLike
  166. def remove (n: Int, count: Int) : Unit

    Removes a number of elements from a given index position.

    Removes a number of elements from a given index position.

    n

    the index which refers to the first element to remove.

    count

    the number of elements to remove.

    definition classes: BufferLike
  167. def repr : Buffer[A]

    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
  168. def result : JListWrapper[A]

  169. def reverse : Buffer[A]

    Returns new buffer wih elements in reversed order.

    Returns new buffer wih elements in reversed order.

    returns

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

    definition classes: SeqLike
  170. def reverseIterator : Iterator[A]

    An iterator yielding elements in reversed order.

    An iterator yielding elements in reversed order.

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

    returns

    an iterator yielding the elements of this buffer in reversed order

    definition classes: SeqLike
  171. def reverseMap [B] (f: (A) ⇒ B) : Buffer[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
    definition classes: SeqLike
  172. def reverseMap [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[Buffer[A], 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
  173. def reversed : List[A]

    attributes: protected[this]
    definition classes: TraversableOnce
  174. def reversedElements : Iterator[A]

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

  175. def sameElements (that: Iterable[A]) : 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
    definition classes: IterableLike
  176. def sameElements [B >: A] (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: IterableLike
  177. def scanLeft [B, That] (z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[Buffer[A], B, That]) : That

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

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

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

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

    returns

    collection with intermediate results

    definition classes: TraversableLike
  178. def scanRight [B, That] (z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[Buffer[A], B, That]) : That

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

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

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

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

    returns

    collection with intermediate results

    definition classes: TraversableLike
  179. def segmentLength (p: (A) ⇒ Boolean, from: Int) : Int

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

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

    p

    the predicate used to test elements.

    from

    the index where the search starts.

    returns

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

    definition classes: SeqLike
  180. def size : Int

    The size of this buffer, equivalent to length.

    The size of this buffer, equivalent to length.

    returns

    the number of elements in this buffer.

    definition classes: SeqLikeTraversableOnce
  181. def slice (from: Int, until: Int) : Buffer[A]

    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: IterableLikeTraversableLike
  182. def sliding [B >: A] (size: Int, step: Int) : Iterator[Buffer[A]]

    definition classes: IterableLike
  183. def sliding [B >: A] (size: Int) : Iterator[Buffer[A]]

    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
      see also:
    1. Iterator#sliding

  184. def sortBy [B] (f: (A) ⇒ B)(implicit ord: Ordering[B]) : Buffer[A]

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

  185. def sortWith (lt: (A, A) ⇒ Boolean) : Buffer[A]

    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
  186. def sorted [B >: A] (implicit ord: Ordering[B]) : Buffer[A]

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

  187. def span (p: (A) ⇒ Boolean) : (Buffer[A], Buffer[A])

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

    Splits 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: TraversableLike
  188. def splitAt (n: Int) : (Buffer[A], Buffer[A])

    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: TraversableLike
  189. 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.

    definition classes: SeqLike
  190. 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: SeqLike
  191. def stringPrefix : String

    Defines the prefix of this object's toString representation.

    Defines the prefix of this object's toString representation.

    returns

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

    definition classes: BufferLikeTraversableLike
  192. def sum : Int

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

    [use case]

    Sums up the elements of this collection.

    returns

    the sum of all elements in this 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 buffer and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

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

    Sums up the elements of this collection.

    Sums up the elements of this collection.

    B

    the result type of the + operator.

    num

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

    returns

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

    definition classes: TraversableOnce
  194. def synchronized [T0] (arg0: T0) : T0

    attributes: final
    definition classes: AnyRef
  195. def tail : Buffer[A]

    Selects all elements except the first.

    Selects all elements except the first.

    returns

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

    definition classes: TraversableLike
  196. def take (n: Int) : Buffer[A]

    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: IterableLikeTraversableLike
  197. def takeRight (n: Int) : Buffer[A]

    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: IterableLike
  198. def takeWhile (p: (A) ⇒ Boolean) : Buffer[A]

    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: IterableLikeTraversableLike
  199. def thisCollection : Seq[A]

    The underlying collection seen as an instance of Buffer.

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

    attributes: protected[this]
    definition classes: SeqLikeIterableLikeTraversableLike
  200. def toArray : Array[A]

    [use case] Converts this buffer to an array.

    [use case]

    Converts this buffer to an array.

    returns

    an array containing all elements of this buffer. A ClassManifest must be available for the element type of this buffer.

    attributes: abstract
    definition classes: TraversableOnce
  201. def toArray [B >: A] (implicit 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: TraversableOnce
  202. def toBuffer [B >: A] : Buffer[B]

    Converts this buffer to a mutable buffer.

    Converts this buffer to a mutable buffer.

    returns

    a buffer containing all elements of this buffer.

    definition classes: TraversableOnce
  203. def toCollection (repr: Buffer[A]) : Seq[A]

    A conversion from collections of type Repr to Buffer objects.

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

    attributes: protected[this]
    definition classes: SeqLikeIterableLikeTraversableLike
  204. def toIndexedSeq [B >: A] : IndexedSeq[B]

    Converts this buffer to an indexed sequence.

    Converts this buffer to an indexed sequence.

    returns

    an indexed sequence containing all elements of this buffer.

    definition classes: TraversableOnce
  205. def toIterable : Iterable[A]

    Converts this buffer to an iterable collection.

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

    returns

    an Iterable containing all elements of this buffer.

    definition classes: IterableLikeTraversableOnce
  206. def toIterator : Iterator[A]

    Returns an Iterator over the elements in this buffer.

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

    returns

    an Iterator containing all elements of this buffer.

    definition classes: TraversableLikeTraversableOnce
  207. def toList : List[A]

    Converts this buffer to a list.

    Converts this buffer to a list.

    returns

    a list containing all elements of this buffer.

    definition classes: TraversableOnce
  208. def toMap [T, U] (implicit ev: <:<[A, (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.

    returns

    a map containing all elements of this buffer.

    definition classes: TraversableOnce
  209. def toSeq : Seq[A]

    Converts this buffer to a sequence.

    Converts this buffer to a sequence.

    Overridden for efficiency.@return a sequence containing all the elements of this buffer.

    definition classes: SeqLikeIterableLikeTraversableOnce
  210. def toSet [B >: A] : Set[B]

    Converts this buffer to a set.

    Converts this buffer to a set.

    returns

    a set containing all elements of this buffer.

    definition classes: TraversableOnce
  211. def toStream : Stream[A]

    Converts this buffer to a stream.

    Converts this buffer to a stream.

    returns

    a stream containing all elements of this buffer.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  212. def toString () : String

    Converts this buffer to a string.

    Converts this buffer to a string.

    returns

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

    definition classes: SeqLikeTraversableLike → AnyRef → Any
  213. def toTraversable : Traversable[A]

    Converts this buffer to an unspecified Traversable.

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

    returns

    a Traversable containing all elements of this buffer.

    definition classes: TraversableLikeTraversableOnce
  214. def transpose [B] (implicit asTraversable: (A) ⇒ Traversable[B]) : Buffer[Buffer[B]]

    Transposes this buffer of traversable collections into a buffer of buffers.

    Transposes this buffer of traversable collections into a buffer of buffers.

    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 two-dimensional buffer of buffers which has as nth row the nth column of this buffer.

    definition classes: GenericTraversableTemplate
  215. 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
  216. 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
  217. val underlying : List[A]

  218. def union (that: Seq[A]) : Buffer[A]

    [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
    definition classes: SeqLike
  219. def union [B >: A, That] (that: Seq[B])(implicit bf: CanBuildFrom[Buffer[A], 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-part 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
  220. def unzip [A1, A2] (implicit asPair: (A) ⇒ (A1, A2)) : (Buffer[A1], Buffer[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
  221. def update (i: Int, elem: A) : Unit

    Replaces element at given index with a new value.

    Replaces element at given index with a new value.

    definition classes: JListWrapperBufferLikeSeq
  222. def updated (index: Int, elem: A) : Buffer[A]

    [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
    definition classes: SeqLike
  223. def updated [B >: A, That] (index: Int, elem: B)(implicit bf: CanBuildFrom[Buffer[A], 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 buffer which is a copy of this buffer with the element at position index replaced by elem.

    definition classes: SeqLike
  224. def view (from: Int, until: Int) : SeqView[A, Buffer[A]]

    Creates a non-strict view of a slice of this buffer.

    Creates a non-strict view of a slice of this buffer.

    Note: the difference between view and slice is that view produces a view of the current buffer, whereas slice produces a new buffer.

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

    from

    the index of the first element of the view

    until

    the index of the element following the view

    returns

    a non-strict view of a slice of this buffer, starting at index from and extending up to (but not including) index until.

    definition classes: SeqLikeIterableLikeTraversableLike
  225. def view : SeqView[A, Buffer[A]]

    Creates a non-strict view of this buffer.

    Creates a non-strict view of this buffer.

    returns

    a non-strict view of this buffer.

    definition classes: SeqLikeIterableLikeTraversableLike
  226. def wait () : Unit

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

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

    attributes: final
    definition classes: AnyRef
  229. def withFilter (p: (A) ⇒ Boolean) : FilterMonadic[A, Buffer[A]]

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

    definition classes: TraversableLikeFilterMonadic
  230. def zip [B] (that: Iterable[B]) : Buffer[(A, 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
    definition classes: IterableLike
  231. def zip [A1 >: A, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[Buffer[A], (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: IterableLike
  232. def zipAll [B] (that: Iterable[B], thisElem: A, thatElem: B) : Buffer[(A, 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
    definition classes: IterableLike
  233. def zipAll [B, A1 >: A, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Buffer[A], (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
  234. def zipWithIndex : Buffer[(A, Int)]

    [use case] Zips this buffer with its indices.

    [use case]

    Zips this buffer with its indices.

    returns

    A new buffer containing pairs consisting of all elements of this buffer paired with their index. Indices start at 0. @example List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))

    attributes: abstract
    definition classes: IterableLike
  235. def zipWithIndex [A1 >: A, That] (implicit bf: CanBuildFrom[Buffer[A], (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: IterableLike

Inherited from Product

Inherited from Buffer[A]

Inherited from BufferLike[A, Buffer[A]]

Inherited from Cloneable[Buffer[A]]

Inherited from Subtractable[A, Buffer[A]]

Inherited from Scriptable[A]

Inherited from Shrinkable[A]

Inherited from Growable[A]

Inherited from Seq[A]

Inherited from Seq[A]

Inherited from SeqLike[A, Buffer[A]]

Inherited from PartialFunction[Int, A]

Inherited from (Int) ⇒ A

Inherited from Iterable[A]

Inherited from Iterable[A]

Inherited from IterableLike[A, Buffer[A]]

Inherited from Equals

Inherited from Traversable[A]

Inherited from Mutable

Inherited from Traversable[A]

Inherited from GenericTraversableTemplate[A, Buffer]

Inherited from TraversableLike[A, Buffer[A]]

Inherited from TraversableOnce[A]

Inherited from FilterMonadic[A, Buffer[A]]

Inherited from HasNewBuilder[A, Buffer[A]]

Inherited from AnyRef

Inherited from Any