scala.collection.immutable.StreamViewLike

# Zipped

#### trait Zipped[B] extends Zipped[B] with Transformed[(A, B)]

Definition Classes
  StreamViewLike → SeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike
Source
  StreamViewLike.scala

Linear Supertypes
Transformed[(A, B)], StreamView[(A, B), Coll], StreamViewLike[(A, B), Coll, StreamView[(A, B), Coll]], Zipped[B], Transformed[(A, B)], SeqView[(A, B), Coll], SeqViewLike[(A, B), Coll, StreamView[(A, B), Coll]], Seq[(A, B)], SeqLike[(A, B), StreamView[(A, B), Coll]], PartialFunction[Int, (A, B)], (Int) ⇒ (A, B), Zipped[B], Transformed[(A, B)], GenSeqView[(A, B), Coll], GenSeqViewLike[(A, B), Coll, StreamView[(A, B), Coll]], GenSeq[(A, B)], GenSeqLike[(A, B), StreamView[(A, B), Coll]], Zipped[B], Zipped[B], Transformed[(A, B)], Transformed[(A, B)], Transformed[(A, B)], Transformed[(A, B)], IterableView[(A, B), Coll], GenIterableView[(A, B), Coll], IterableViewLike[(A, B), Coll, StreamView[(A, B), Coll]], GenIterableViewLike[(A, B), Coll, StreamView[(A, B), Coll]], TraversableView[(A, B), Coll], GenTraversableView[(A, B), Coll], TraversableViewLike[(A, B), Coll, StreamView[(A, B), Coll]], GenTraversableViewLike[(A, B), Coll, StreamView[(A, B), Coll]], ViewMkString[(A, B)], Iterable[(A, B)], IterableLike[(A, B), StreamView[(A, B), Coll]], Equals, GenIterable[(A, B)], GenIterableLike[(A, B), StreamView[(A, B), Coll]], Traversable[(A, B)], GenTraversable[(A, B)], GenericTraversableTemplate[(A, B), Seq], TraversableLike[(A, B), StreamView[(A, B), Coll]], GenTraversableLike[(A, B), StreamView[(A, B), Coll]], Parallelizable[(A, B), ParSeq[(A, B)]], TraversableOnce[(A, B)], GenTraversableOnce[(A, B)], FilterMonadic[(A, B), StreamView[(A, B), Coll]], HasNewBuilder[(A, B), StreamView[(A, B), Coll]], AnyRef, Any
Ordering

1. Alphabetic
2. By inheritance

Inherited

1. Hide All
2. Show all

1. Zipped
2. Transformed
3. StreamView
4. StreamViewLike
5. Zipped
6. Transformed
7. SeqView
8. SeqViewLike
9. Seq
10. SeqLike
11. PartialFunction
12. Function1
13. Zipped
14. Transformed
15. GenSeqView
16. GenSeqViewLike
17. GenSeq
18. GenSeqLike
19. Zipped
20. Zipped
21. Transformed
22. Transformed
23. Transformed
24. Transformed
25. IterableView
26. GenIterableView
27. IterableViewLike
28. GenIterableViewLike
29. TraversableView
30. GenTraversableView
31. TraversableViewLike
32. GenTraversableViewLike
33. ViewMkString
34. Iterable
35. IterableLike
36. Equals
37. GenIterable
38. GenIterableLike
39. Traversable
40. GenTraversable
41. GenericTraversableTemplate
42. TraversableLike
43. GenTraversableLike
44. Parallelizable
45. TraversableOnce
46. GenTraversableOnce
47. FilterMonadic
48. HasNewBuilder
49. AnyRef
50. Any

Visibility

1. Public
2. All

### Type Members

1. #### trait Appended[B >: A] extends Appended[B] with Transformed[B]

   Definition Classes
     StreamViewLike → SeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike → TraversableViewLike → GenTraversableViewLike

2. #### trait DroppedWhile extends DroppedWhile with Transformed[A]

   Definition Classes
     StreamViewLike → SeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike → TraversableViewLike → GenTraversableViewLike

3. #### trait EmptyView extends Transformed[Nothing] with EmptyView

   Definition Classes
     StreamViewLike → SeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike → TraversableViewLike → GenTraversableViewLike

4. #### trait Filtered extends Filtered with Transformed[A]

   Definition Classes
     StreamViewLike → SeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike → TraversableViewLike → GenTraversableViewLike

5. #### trait FlatMapped[B] extends FlatMapped[B] with Transformed[B]

   Definition Classes
     StreamViewLike → SeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike → TraversableViewLike → GenTraversableViewLike

6. #### trait Forced[B] extends Forced[B] with Transformed[B]

   A fall back which forces everything into a vector and then applies an operation on it.

7. #### trait Mapped[B] extends Mapped[B] with Transformed[B]

   Definition Classes
     StreamViewLike → SeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike → TraversableViewLike → GenTraversableViewLike

8. #### trait Patched[B >: A] extends Patched[B] with Transformed[B]

   Definition Classes
     StreamViewLike → SeqViewLike → GenSeqViewLike

9. #### trait Prepended[B >: A] extends Prepended[B] with Transformed[B]

   Definition Classes
     StreamViewLike → SeqViewLike → GenSeqViewLike

10. #### trait Reversed extends Reversed with Transformed[A]

    Definition Classes
      StreamViewLike → SeqViewLike → GenSeqViewLike

11. #### type Self = StreamView[(A, B), Coll]

    The type implementing this traversable

    The type implementing this traversable

    Attributes
      protected
    Definition Classes
      TraversableLike

12. #### trait Sliced extends Sliced with Transformed[A]

    Definition Classes
      StreamViewLike → SeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike → TraversableViewLike → GenTraversableViewLike

13. #### trait TakenWhile extends TakenWhile with Transformed[A]

    Definition Classes
      StreamViewLike → SeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike → TraversableViewLike → GenTraversableViewLike

14. #### trait Transformed[+B] extends StreamView[B, Coll] with Transformed[B]

    The implementation base trait of this view.

15. #### class WithFilter extends FilterMonadic[A, Repr]

    A class supporting filtered operations.

16. #### trait Zipped[B] extends Zipped[B] with Transformed[(A, B)]

    Definition Classes
      StreamViewLike → SeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike

17. #### trait ZippedAll[A1 >: A, B] extends ZippedAll[A1, B] with Transformed[(A1, B)]

    Definition Classes
      StreamViewLike → SeqViewLike → GenSeqViewLike → IterableViewLike → GenIterableViewLike

### Abstract Value Members

1. #### abstract val other: GenIterable[B]

   Attributes
     protected[this]
   Definition Classes
     Zipped

### Concrete Value Members

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

   Definition Classes
     AnyRef

2. #### final def !=(arg0: Any): Boolean

   Test two objects for inequality.

   Test two objects for inequality.

   returns

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

   Definition Classes
     Any

3. #### final def ##(): Int

   Equivalent to `x.hashCode` except for boxed numeric types and `null`.

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

   returns

     a hash value consistent with ==

   Definition Classes
     AnyRef → Any

4. #### def ++[B](that: GenTraversableOnce[B]): Seq[B]

   [use case]

   [use case]
   B

     the element type of the returned collection.

   that

     the traversable to append.

   returns

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

   Definition Classes
     TraversableViewLike → TraversableLike → GenTraversableLike

5. #### def ++:[B >: (A, B), That](that: Traversable[B])(implicit bf: CanBuildFrom[StreamView[(A, B), Coll], B, That]): That

   As with `++`, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

   As with `++`, returns a new collection containing the elements from the left operand followed by the elements from the right operand.

   It differs from `++` in that the right operand determines the type of the resulting collection rather than the left one. Mnemonic: the COLon is on the side of the new COLlection type.

   Example:

           scala> val x = List(1)
           x: List[Int] = List(1)

           scala> val y = LinkedList(2)
           y: scala.collection.mutable.LinkedList[Int] = LinkedList(2)

           scala> val z = x ++: y
           z: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)

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

   Since `TraversableOnce` has no `++` method, we have to implement that directly, but `Traversable` and down can use the overload.

   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 sequence followed by all elements of `that`.

   Definition Classes
     TraversableLike

6. #### def ++:[B](that: TraversableOnce[B]): Seq[B]

   [use case]

   [use case]
   B

     the element type of the returned collection.

   that

     the traversable to append.

   returns

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

   Definition Classes
     TraversableLike

7. #### def +:(elem: (A, B)): Seq[A]

   [use case]

   [use case]
   elem

     the prepended element

   returns

     a new sequence consisting of `elem` followed by all elements of this sequence.

   Definition Classes
     SeqViewLike → SeqLike → GenSeqLike

8. #### def /:[B](z: B)(op: (B, (A, B)) ⇒ B): B

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

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

   Note: `/:` is alternate syntax for `foldLeft`; `z /: xs` is the same as `xs foldLeft z`.

   Examples:

   Note that the folding function used to compute b is equivalent to that used to compute c.

            scala> val a = LinkedList(1,2,3,4)
            a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

            scala> val b = (5 /: a)(_+_)
            b: Int = 15

            scala> val c = (5 /: a)((x,y) => x + y)
            c: Int = 15

   Note: will not terminate for infinite-sized collections.

   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 sequence, going left to right with the start value `z` on the left:

                     op(...op(op(z, x1), x2), ..., xn)

     where `x1, ..., xn` are the elements of this sequence.

   Definition Classes
     TraversableOnce → GenTraversableOnce

9. #### def /:\[A1 >: (A, B)](z: A1)(op: (A1, A1) ⇒ A1): A1

   A syntactic sugar for out of order folding.

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

   Example:

            scala> val a = LinkedList(1,2,3,4)
            a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

            scala> val b = (a /:\ 5)(_+_)
            b: Int = 15

   Definition Classes
     GenTraversableOnce

10. #### def :+(elem: (A, B)): Seq[A]

    [use case]

    [use case]
    elem

      the appended element

    returns

      a new sequence consisting of all elements of this sequence followed by `elem`. @example

                scala> import scala.collection.mutable.LinkedList
                import scala.collection.mutable.LinkedList

                scala> val a = LinkedList(1)
                a: scala.collection.mutable.LinkedList[Int] = LinkedList(1)

                scala> val b = a :+ 2
                b: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2)

                scala> println(a)
                LinkedList(1)

    Definition Classes
      SeqViewLike → SeqLike → GenSeqLike

11. #### def :\[B](z: B)(op: ((A, B), B) ⇒ B): B

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

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

    Note: `:\` is alternate syntax for `foldRight`; `xs :\ z` is the same as `xs foldRight z`.

    Note: will not terminate for infinite-sized collections.

    Examples:

    Note that the folding function used to compute b is equivalent to that used to compute c.

             scala> val a = LinkedList(1,2,3,4)
             a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

             scala> val b = (a :\ 5)(_+_)
             b: Int = 15

             scala> val c = (a :\ 5)((x,y) => x + y)
             c: Int = 15

    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 sequence, going right to left with the start value `z` on the right:

                      op(x1, op(x2, ... op(xn, z)...))

      where `x1, ..., xn` are the elements of this sequence.

    Definition Classes
      TraversableOnce → GenTraversableOnce

12. #### final def ==(arg0: AnyRef): Boolean

    Definition Classes
      AnyRef

13. #### final def ==(arg0: Any): Boolean

    Test two objects for equality.

    Test two objects for equality. The expression `x == that` is equivalent to `if (x eq null) that eq null else x.equals(that)`.

    returns

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

    Definition Classes
      Any

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

    Definition Classes
      ViewMkString

15. #### def addString(b: StringBuilder): StringBuilder

    Appends all elements of this sequence to a string builder.

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

    Example:

             scala> val a = LinkedList(1,2,3,4)
             a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

             scala> val b = new StringBuilder()
             b: StringBuilder =

             scala> val h = a.addString(b)
             b: StringBuilder = 1234

    b

      the string builder to which elements are appended.

    returns

      the string builder `b` to which elements were appended.

    Definition Classes
      TraversableOnce

16. #### def addString(b: StringBuilder, sep: String): StringBuilder

    Appends all elements of this sequence to a string builder using a separator string.

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

    Example:

             scala> val a = LinkedList(1,2,3,4)
             a: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4)

             scala> val b = new StringBuilder()
             b: StringBuilder =

             scala> a.addString(b, ", ")
             res0: StringBuilder = 1, 2, 3, 4

    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

17. #### def aggregate[B](z: B)(seqop: (B, (A, B)) ⇒ B, combop: (B, B) ⇒ B): B

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

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

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

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

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

    B

      the type of accumulated results

    z

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

    seqop

      an operator used to accumulate results within a partition

    combop

      an associative operator used to combine results from different partitions

    Definition Classes
      TraversableOnce → GenTraversableOnce

18. #### def andThen[C](k: ((A, B)) ⇒ C): PartialFunction[Int, C]

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

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

    C

      the result type of the transformation function.

    k

      the transformation function

    returns

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

    Definition Classes
      PartialFunction → Function1

19. #### def apply(idx: Int): (A, B)

    Selects an element by its index in the sequence.

    Selects an element by its index in the sequence.

    Example:

           scala> val x = LinkedList(1, 2, 3, 4, 5)
           x: scala.collection.mutable.LinkedList[Int] = LinkedList(1, 2, 3, 4, 5)

           scala> x(3)
           res1: Int = 4

    idx

      The index to select.

    returns

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

    Definition Classes
      Zipped → Transformed → GenSeqLike
    Exceptions thrown
      `IndexOutOfBoundsException`

      if `idx` does not satisfy `0 <= idx < length`.

20. #### final def asInstanceOf[T0]: T0

    Cast the receiver object to be of type `T0`.

    Cast the receiver object to be of type `T0`.

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

    returns

      the receiver object.

    Definition Classes
      Any
    Exceptions thrown
      ClassCastException

      if the receiver object is not an instance of the erasure of type `T0`.

21. #### 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 sequence should be compared

    returns

      `true`, if this sequence can possibly equal `that`, `false` otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

    Definition Classes
      IterableLike → Equals

22. #### def clone(): AnyRef

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the `clone` method is platform dependent.

    returns

      a copy of the receiver object.

    Attributes
      protected[lang]
    Definition Classes
      AnyRef
    Annotations
      @throws()
    Note

      not specified by SLS as a member of AnyRef

23. #### def collect[B](pf: PartialFunction[(A, B), B]): Seq[B]

    [use case]

    [use case]
    B

      the element type of the returned collection.

    pf

      the partial function which filters and maps the sequence.

    returns

      a new sequence 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.

    Definition Classes
      TraversableViewLike → TraversableLike → GenTraversableLike

24. #### def collectFirst[B](pf: PartialFunction[(A, B), B]): Option[B]

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

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

    Note: may not terminate for infinite-sized collections.

    pf

      the partial function

    returns

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

    Definition Classes
      TraversableOnce
    Example:

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

25. #### def combinations(n: Int): Iterator[StreamView[(A, B), Coll]]

    Iterates over combinations.

    Iterates over combinations.

    returns

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

    Definition Classes
      SeqLike
    Example:

    1. `"abbbc".combinations(2) = Iterator(ab, ac, bb, bc)`

26. #### def companion: GenericCompanion[Seq]

    The factory companion object that builds instances of class Seq.

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

    Definition Classes
      Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate

27. #### def compose[A](g: (A) ⇒ Int): (A) ⇒ (A, B)

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

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

    A

      the type to which function `g` can be applied

    g

      a function A => T1

    returns

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

    Definition Classes
      Function1

28. #### def contains(elem: Any): Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    elem

      the element to test.

    returns

      `true` if this sequence has an element that is is equal (wrt `==`) to `elem`, `false` otherwise.

    Definition Classes
      SeqLike

29. #### def containsSlice[B](that: GenSeq[B]): Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqLike

30. #### def copyToArray(xs: Array[(A, B)], start: Int, len: Int): Unit

    [use case]

    [use case]
    xs

      the array to fill.

    start

      the starting index.

    len

      the maximal number of elements to copy.

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

31. #### def copyToArray(xs: Array[(A, B)]): Unit

    [use case]

    [use case]
    xs

      the array to fill.

    Definition Classes
      TraversableOnce → GenTraversableOnce

32. #### def copyToArray(xs: Array[(A, B)], start: Int): Unit

    [use case]

    [use case]
    xs

      the array to fill.

    start

      the starting index.

    Definition Classes
      TraversableOnce → GenTraversableOnce

33. #### def copyToBuffer[B >: (A, B)](dest: Buffer[B]): Unit

    Copies all elements of this sequence to a buffer.

    Copies all elements of this sequence to a buffer.

    Note: will not terminate for infinite-sized collections.

    dest

      The buffer to which elements are copied.

    Definition Classes
      TraversableOnce

34. #### def corresponds[B](that: GenSeq[B])(p: ((A, B), B) ⇒ Boolean): Boolean

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

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

    Definition Classes
      SeqLike → GenSeqLike

35. #### def count(p: ((A, B)) ⇒ Boolean): Int

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

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

    p

      the predicate used to test elements.

    returns

      the number of elements satisfying the predicate `p`.

    Definition Classes
      TraversableOnce → GenTraversableOnce

36. #### def diff(that: Seq[(A, B)]): Seq[A]

    [use case]

    [use case]
    that

      the sequence of elements to remove

    returns

      a new sequence which contains all elements of this sequence 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
      SeqViewLike → SeqLike → GenSeqLike

37. #### def distinct: StreamView[(A, B), Coll]

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

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

    Note: will not terminate for infinite-sized collections.

    returns

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

    Definition Classes
      SeqLike → GenSeqLike

38. #### def drop(n: Int): StreamView[(A, B), Coll]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    n

      the number of elements to drop from this sequence.

    returns

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

    Definition Classes
      IterableViewLike → TraversableViewLike → IterableLike → TraversableLike → GenTraversableLike

39. #### def dropRight(n: Int): StreamView[(A, B), Coll]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

      The number of elements to take

    returns

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

    Definition Classes
      IterableLike

40. #### def dropWhile(p: ((A, B)) ⇒ Boolean): StreamView[(A, B), Coll]

    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 sequence whose first element does not satisfy the predicate `p`.

    Definition Classes
      TraversableViewLike → TraversableLike → GenTraversableLike

41. #### def endsWith[B](that: GenSeq[B]): Boolean

    Tests whether this sequence ends with the given sequence.

    Tests whether this sequence ends with the given sequence.

    Note: will not terminate for infinite-sized collections.

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqLike → GenSeqLike

42. #### final def eq(arg0: AnyRef): Boolean

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

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

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

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

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

    returns

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

    Definition Classes
      AnyRef

43. #### def equals(that: Any): Boolean

    The equals method for arbitrary sequences.

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

    that

      The object to compare the sequence to

    returns

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

    Definition Classes
      GenSeqLike → Equals → AnyRef → Any

44. #### def exists(p: ((A, B)) ⇒ Boolean): Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

45. #### def filter(p: ((A, B)) ⇒ Boolean): StreamView[(A, B), Coll]

    Selects all elements of this sequence which satisfy a predicate.

    Selects all elements of this sequence which satisfy a predicate.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      TraversableViewLike → TraversableLike → GenTraversableLike

46. #### def filterNot(p: ((A, B)) ⇒ Boolean): StreamView[(A, B), Coll]

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

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

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      TraversableLike → GenTraversableLike

47. #### def finalize(): Unit

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

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

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

    Attributes
      protected[lang]
    Definition Classes
      AnyRef
    Annotations
      @throws()
    Note

      not specified by SLS as a member of AnyRef

48. #### def find(p: ((A, B)) ⇒ Boolean): Option[(A, B)]

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

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

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

49. #### def flatMap[B](f: ((A, B)) ⇒ GenTraversableOnce[B]): Seq[B]

    [use case]

    [use case]
    B

      the element type of the returned collection.

    f

      the function to apply to each element.

    returns

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

    Definition Classes
      TraversableViewLike → TraversableLike → GenTraversableLike → FilterMonadic

50. #### def fold[A1 >: (A, B)](z: A1)(op: (A1, A1) ⇒ A1): A1

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

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

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

    A1

      a type parameter for the binary operator, a supertype of `A`.

    z

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

    op

      a binary operator that must be associative

    returns

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

    Definition Classes
      TraversableOnce → GenTraversableOnce

51. #### def foldLeft[B](z: B)(op: (B, (A, B)) ⇒ B): B

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

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

    Note: will not terminate for infinite-sized collections.

    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 sequence, going left to right with the start value `z` on the left:

                      op(...op(z, x1), x2, ..., xn)

      where `x1, ..., xn` are the elements of this sequence.

    Definition Classes
      TraversableOnce → GenTraversableOnce

52. #### def foldRight[B](z: B)(op: ((A, B), B) ⇒ B): B

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

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

    Note: will not terminate for infinite-sized collections.

    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 sequence, going right to left with the start value `z` on the right:

                      op(x1, op(x2, ... op(xn, z)...))

      where `x1, ..., xn` are the elements of this sequence.

    Definition Classes
      IterableLike → TraversableOnce → GenTraversableOnce

53. #### def forall(p: ((A, B)) ⇒ Boolean): Boolean

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

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

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

54. #### def force[B >: (A, B), That](implicit bf: CanBuildFrom[Coll, B, That]): That

    Definition Classes
      StreamViewLike → TraversableViewLike → GenTraversableViewLike

55. #### def foreach(f: ((A, B)) ⇒ Unit): Unit

    [use case]

    [use case]
    f

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

    Definition Classes
      Transformed → Transformed → Transformed → Transformed → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

56. #### def genericBuilder[B]: Builder[B, Seq[B]]

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

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

    Definition Classes
      GenericTraversableTemplate

57. #### final def getClass(): Class[_]

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

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

    The nature of the representation is platform dependent.

    returns

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

    Definition Classes
      AnyRef → Any
    Note

      not specified by SLS as a member of AnyRef

58. #### def groupBy[K](f: ((A, B)) ⇒ K): Map[K, StreamView[(A, B), Coll]]

    Partitions this sequence into a map of sequences according to some discriminator function.

    Partitions this sequence into a map of sequences 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 sequence.

    K

      the type of keys returned by the discriminator function.

    f

      the discriminator function.

    returns

      A map from keys to sequences 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 sequence of those elements `x` for which `f(x)` equals `k`.

    Definition Classes
      TraversableViewLike → TraversableLike → GenTraversableLike

59. #### def grouped(size: Int): Iterator[StreamView[(A, B), Coll]]

    Partitions elements in fixed size sequences.

    Partitions elements in fixed size sequences.

    size

      the number of elements per group

    returns

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

    Definition Classes
      IterableViewLike → IterableLike
    See also

      Iterator#grouped

60. #### def hasDefiniteSize: Boolean

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

    Tests whether this sequence 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
      TraversableLike → TraversableOnce → GenTraversableOnce

61. #### def hashCode(): Int

    Hashcodes for Seq produce a value from the hashcodes of all the elements of the sequence.

    Hashcodes for Seq produce a value from the hashcodes of all the elements of the sequence.

    returns

      the hash code value for this object.

    Definition Classes
      GenSeqLike → AnyRef → Any

62. #### def head: (A, B)

    Selects the first element of this sequence.

    Selects the first element of this sequence.

    returns

      the first element of this sequence.

    Definition Classes
      IterableLike → GenIterableLike → TraversableLike → GenTraversableLike
    Exceptions thrown
      `NoSuchElementException`

      if the sequence is empty.

63. #### def headOption: Option[(A, B)]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

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

    Definition Classes
      Transformed → TraversableLike

64. #### def indexOf(elem: (A, B), from: Int): Int

    [use case]

    [use case]
    elem

      the element value to search for.

    from

      the start index

    returns

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

    Definition Classes
      GenSeqLike

65. #### def indexOf(elem: (A, B)): Int

    [use case]

    [use case]
    elem

      the element value to search for.

    returns

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

    Definition Classes
      GenSeqLike

66. #### def indexOfSlice[B >: (A, B)](that: GenSeq[B], from: Int): Int

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

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

    Note: may not terminate for infinite-sized collections.

    that

      the sequence to test

    from

      the start index

    returns

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

    Definition Classes
      SeqLike

67. #### def indexOfSlice[B >: (A, B)](that: GenSeq[B]): Int

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

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

    Note: may not terminate for infinite-sized collections.

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqLike

68. #### def indexWhere(p: ((A, B)) ⇒ 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.

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    from

      the start index

    returns

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

    Definition Classes
      SeqLike → GenSeqLike

69. #### def indexWhere(p: ((A, B)) ⇒ Boolean): Int

    Finds index of first element satisfying some predicate.

    Finds index of first element satisfying some predicate.

    Note: may not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      GenSeqLike

70. #### 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 sequence.

    Definition Classes
      SeqLike

71. #### def init: StreamView[(A, B), Coll]

    Selects all elements except the last.

    Selects all elements except the last.

    returns

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

    Definition Classes
      TraversableViewLike → TraversableLike
    Exceptions thrown
      `UnsupportedOperationException`

      if the sequence is empty.

72. #### def inits: Iterator[StreamView[(A, B), Coll]]

    Iterates over the inits of this sequence.

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

    returns

      an iterator over all the inits of this sequence

    Definition Classes
      TraversableLike
    Example:

    1. `List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)`

73. #### def intersect(that: Seq[(A, B)]): Seq[A]

    [use case]

    [use case]
    that

      the sequence of elements to intersect with.

    returns

      a new sequence which contains all elements of this sequence 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
      SeqViewLike → SeqLike → GenSeqLike

74. #### def isDefinedAt(idx: Int): Boolean

    Tests whether this sequence contains given index.

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

    Definition Classes
      GenSeqLike

75. #### def isEmpty: Boolean

    Tests whether the sequence is empty.

    Tests whether the sequence is empty.

    returns

      `true` if the sequence contains no elements, `false` otherwise.

    Definition Classes
      IterableLike → GenIterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

76. #### final def isInstanceOf[T0]: Boolean

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

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

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

    returns

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

    Definition Classes
      Any

77. #### final def isTraversableAgain: Boolean

    Tests whether this sequence can be repeatedly traversed.

    Tests whether this sequence can be repeatedly traversed.

    returns

      `true`

    Definition Classes
      GenTraversableLike → GenTraversableOnce

78. #### def iterator: Iterator[(A, B)]

    Definition Classes
      Zipped → Transformed → GenIterableLike

79. #### def last: (A, B)

    Selects the last element.

    Selects the last element.

    returns

      The last element of this sequence.

    Definition Classes
      TraversableLike
    Exceptions thrown
      NoSuchElementException

      If the sequence is empty.

80. #### def lastIndexOf(elem: (A, B), end: Int): Int

    [use case]

    [use case]
    elem

      the element value to search for.

    end

      the end index.

    returns

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

    Definition Classes
      GenSeqLike

81. #### def lastIndexOf(elem: (A, B)): Int

    [use case]

    [use case]
    elem

      the element value to search for.

    returns

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

    Definition Classes
      GenSeqLike

82. #### def lastIndexOfSlice[B >: (A, B)](that: GenSeq[B], end: Int): Int

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

    Finds last index before or at a given end index where this sequence 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 sequence starting at this index match the elements of sequence `that`, or `-1` of no such subsequence exists.

    Definition Classes
      SeqLike

83. #### def lastIndexOfSlice[B >: (A, B)](that: GenSeq[B]): Int

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

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

    Note: will not terminate for infinite-sized collections.

    that

      the sequence to test

    returns

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

    Definition Classes
      SeqLike

84. #### def lastIndexWhere(p: ((A, B)) ⇒ 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 sequence that satisfies the predicate `p`, or `-1`, if none exists.

    Definition Classes
      SeqLike → GenSeqLike

85. #### def lastIndexWhere(p: ((A, B)) ⇒ Boolean): Int

    Finds index of last element satisfying some predicate.

    Finds index of last element satisfying some predicate.

    Note: will not terminate for infinite-sized collections.

    p

      the predicate used to test elements.

    returns

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

    Definition Classes
      GenSeqLike

86. #### def lastOption: Option[(A, B)]

    Optionally selects the last element.

    Optionally selects the last element.

    returns

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

    Definition Classes
      Transformed → TraversableLike

87. #### def length: Int

    The length of the sequence.

    The length of the sequence.

    Note: will not terminate for infinite-sized collections.

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

    returns

      the number of elements in this sequence.

    Definition Classes
      Zipped → Transformed → GenSeqLike

88. #### def lengthCompare(len: Int): Int

    Compares the length of this sequence to a test value.

    Compares the length of this sequence 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

89. #### def lift: (Int) ⇒ Option[(A, B)]

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

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

    returns

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

    Definition Classes
      PartialFunction
    See also

      Function.unlift

90. #### def map[B](f: ((A, B)) ⇒ B): Seq[B]

    [use case]

    [use case]
    B

      the element type of the returned collection.

    f

      the function to apply to each element.

    returns

      a new sequence resulting from applying the given function `f` to each element of this sequence and collecting the results.

    Definition Classes
      TraversableViewLike → TraversableLike → GenTraversableLike → FilterMonadic

91. #### def max: A

    [use case]

    [use case]
    returns

      the largest element of this sequence.

    Definition Classes
      TraversableOnce → GenTraversableOnce

92. #### def maxBy[B](f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)

    Definition Classes
      TraversableOnce → GenTraversableOnce

93. #### def min: A

    [use case]

    [use case]
    returns

      the smallest element of this sequence

    Definition Classes
      TraversableOnce → GenTraversableOnce

94. #### def minBy[B](f: ((A, B)) ⇒ B)(implicit cmp: Ordering[B]): (A, B)

    Definition Classes
      TraversableOnce → GenTraversableOnce

95. #### def missingCase(x: Int): (A, B)

    Attributes
      protected
    Definition Classes
      PartialFunction

96. #### def mkString(start: String, sep: String, end: String): String

    Definition Classes
      ViewMkString

97. #### def mkString(sep: String): String

    Definition Classes
      ViewMkString

98. #### def mkString: String

    Definition Classes
      ViewMkString

99. #### final def ne(arg0: AnyRef): Boolean

    Equivalent to `!(this eq that)`.

    Equivalent to `!(this eq that)`.

    returns

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

    Definition Classes
      AnyRef

100. #### def newAppended[B >: (A, B)](that: GenTraversable[B]): Transformed[B]

     Attributes
       protected
     Definition Classes
       StreamViewLike → SeqViewLike → IterableViewLike → TraversableViewLike

101. #### def newBuilder: Builder[(A, B), StreamView[(A, B), Coll]]

     The builder that builds instances of type Seq[A]

     The builder that builds instances of type Seq[A]

     Attributes
       protected[this]
     Definition Classes
       TraversableViewLike → GenericTraversableTemplate → TraversableLike → HasNewBuilder

102. #### def newDropped(n: Int): Transformed[(A, B)]

     Attributes
       protected
     Definition Classes
       SeqViewLike → IterableViewLike → TraversableViewLike

103. #### def newDroppedWhile(p: ((A, B)) ⇒ Boolean): Transformed[(A, B)]

     Attributes
       protected
     Definition Classes
       StreamViewLike → SeqViewLike → IterableViewLike → TraversableViewLike

104. #### def newFiltered(p: ((A, B)) ⇒ Boolean): Transformed[(A, B)]

     Attributes
       protected
     Definition Classes
       StreamViewLike → SeqViewLike → IterableViewLike → TraversableViewLike

105. #### def newFlatMapped[B](f: ((A, B)) ⇒ GenTraversableOnce[B]): Transformed[B]

     Attributes
       protected
     Definition Classes
       StreamViewLike → SeqViewLike → IterableViewLike → TraversableViewLike

106. #### def newForced[B](xs: ⇒ GenSeq[B]): Transformed[B]

     boilerplate

     boilerplate

     Attributes
       protected
     Definition Classes
       StreamViewLike → SeqViewLike → IterableViewLike → TraversableViewLike

107. #### def newMapped[B](f: ((A, B)) ⇒ B): Transformed[B]

     Attributes
       protected
     Definition Classes
       StreamViewLike → SeqViewLike → IterableViewLike → TraversableViewLike

108. #### def newPatched[B >: (A, B)](_from: Int, _patch: GenSeq[B], _replaced: Int): Transformed[B]

     Attributes
       protected
     Definition Classes
       StreamViewLike → SeqViewLike

109. #### def newPrepended[B >: (A, B)](elem: B): Transformed[B]

     Attributes
       protected
     Definition Classes
       StreamViewLike → SeqViewLike

110. #### def newReversed: Transformed[(A, B)]

     Attributes
       protected
     Definition Classes
       StreamViewLike → SeqViewLike

111. #### def newSliced(_endpoints: SliceInterval): Transformed[(A, B)]

     Attributes
       protected
     Definition Classes
       StreamViewLike → SeqViewLike → IterableViewLike → TraversableViewLike

112. #### def newTaken(n: Int): Transformed[(A, B)]

     Attributes
       protected
     Definition Classes
       SeqViewLike → IterableViewLike → TraversableViewLike

113. #### def newTakenWhile(p: ((A, B)) ⇒ Boolean): Transformed[(A, B)]

     Attributes
       protected
     Definition Classes
       StreamViewLike → SeqViewLike → IterableViewLike → TraversableViewLike

114. #### def newZipped[B](that: GenIterable[B]): Transformed[((A, B), B)]

     Boilerplate method, to override in each subclass This method could be eliminated if Scala had virtual classes

     Boilerplate method, to override in each subclass This method could be eliminated if Scala had virtual classes

     Attributes
       protected
     Definition Classes
       StreamViewLike → SeqViewLike → IterableViewLike

115. #### def newZippedAll[A1 >: (A, B), B](that: GenIterable[B], _thisElem: A1, _thatElem: B): Transformed[(A1, B)]

     Attributes
       protected
     Definition Classes
       StreamViewLike → SeqViewLike → IterableViewLike

116. #### def nonEmpty: Boolean

     Tests whether the sequence is not empty.

     Tests whether the sequence is not empty.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

117. #### final 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.

     Definition Classes
       AnyRef
     Note

       not specified by SLS as a member of AnyRef

118. #### final 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.

     Definition Classes
       AnyRef
     Note

       not specified by SLS as a member of AnyRef

119. #### def orElse[A1 <: Int, B1 >: (A, 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

120. #### def orElseFast[A1 <: Int, B1 >: (A, B)](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

     Definition Classes
       PartialFunction

121. #### def padTo(len: Int, elem: (A, B)): Seq[A]

     [use case]

     [use case]
     len

       the target length

     elem

       the padding value

     returns

       a new sequence consisting of all elements of this sequence followed by the minimal number of occurrences of `elem` so that the resulting sequence has a length of at least `len`.

     Definition Classes
       SeqViewLike → SeqLike → GenSeqLike

122. #### def par: ParSeq[(A, B)]

     Returns a parallel implementation of this collection.

     Returns a parallel implementation of this collection.

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

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

     All parallel collections return a reference to themselves.

     returns

       a parallel implementation of this collection

     Definition Classes
       Parallelizable

123. #### def parCombiner: Combiner[(A, B), ParSeq[(A, B)]]

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

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

     returns

       a combiner for the parallel collection of type `ParRepr`

     Attributes
       protected[this]
     Definition Classes
       SeqLike → TraversableLike → Parallelizable

124. #### def partition(p: ((A, B)) ⇒ Boolean): (StreamView[(A, B), Coll], StreamView[(A, B), Coll])

     Partitions this sequence in two sequences according to a predicate.

     Partitions this sequence in two sequences according to a predicate.

     p

       the predicate on which to partition.

     returns

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

     Definition Classes
       TraversableViewLike → TraversableLike → GenTraversableLike

125. #### def patch(from: Int, that: GenSeq[(A, B)], replaced: Int): Seq[A]

     [use case]

     [use case]
     from

       the index of the first replaced element

     replaced

       the number of elements to drop in the original sequence

     returns

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

     Definition Classes
       SeqViewLike → SeqLike → GenSeqLike

126. #### def permutations: Iterator[StreamView[(A, B), Coll]]

     Iterates over distinct permutations.

     Iterates over distinct permutations.

     returns

       An Iterator which traverses the distinct permutations of this sequence.

     Definition Classes
       SeqLike
     Example:

     1. `"abb".permutations = Iterator(abb, bab, bba)`

127. #### def prefixLength(p: ((A, B)) ⇒ 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.

     Note: may not terminate for infinite-sized collections.

     p

       the predicate used to test elements.

     returns

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

     Definition Classes
       GenSeqLike

128. #### def product: A

     [use case]

     [use case]
     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

129. #### def reduce[A1 >: (A, B)](op: (A1, A1) ⇒ A1): A1

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

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

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

     A1

       A type parameter for the binary operator, a supertype of `A`.

     op

       A binary operator that must be associative.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce
     Exceptions thrown
       UnsupportedOperationException

       if this sequence is empty.

130. #### def reduceLeft[B >: (A, B)](op: (B, (A, B)) ⇒ B): B

     Definition Classes
       TraversableOnce

131. #### def reduceLeftOption[B >: (A, B)](op: (B, (A, B)) ⇒ B): Option[B]

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

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

     Note: will not terminate for infinite-sized collections.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

132. #### def reduceOption[A1 >: (A, B)](op: (A1, A1) ⇒ A1): Option[A1]

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

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

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

     A1

       A type parameter for the binary operator, a supertype of `A`.

     op

       A binary operator that must be associative.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

133. #### def reduceRight[B >: (A, B)](op: ((A, B), B) ⇒ B): B

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

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

     Note: will not terminate for infinite-sized collections.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

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

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

       where `x1, ..., xn` are the elements of this sequence.

     Definition Classes
       IterableLike → TraversableOnce → GenTraversableOnce
     Exceptions thrown
       `UnsupportedOperationException`

       if this sequence is empty.

134. #### def reduceRightOption[B >: (A, B)](op: ((A, B), B) ⇒ B): Option[B]

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

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

     Note: will not terminate for infinite-sized collections.

     B

       the result type of the binary operator.

     op

       the binary operator.

     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

135. #### def repr: StreamView[(A, B), Coll]

     The collection of type sequence underlying this `TraversableLike` object.

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

     Definition Classes
       TraversableLike → GenTraversableLike

136. #### def reverse: StreamView[(A, B), Coll]

     Returns new sequence wih elements in reversed order.

     Returns new sequence wih elements in reversed order.

     Note: will not terminate for infinite-sized collections.

     returns

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

     Definition Classes
       SeqViewLike → SeqLike → GenSeqLike

137. #### def reverseIterator: Iterator[(A, B)]

     An iterator yielding elements in reversed order.

     An iterator yielding elements in reversed order.

     Note: will not terminate for infinite-sized collections.

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

     returns

       an iterator yielding the elements of this sequence in reversed order

     Definition Classes
       SeqLike

138. #### def reverseMap[B](f: ((A, B)) ⇒ B): Seq[B]

     [use case] Note: `xs.reverseMap(f)` is the same as `xs.reverse.map(f)` but might be more efficient.

     [use case]

     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.

     f

       the function to apply to each element.

     returns

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

     Definition Classes
       SeqViewLike → SeqLike → GenSeqLike

139. #### def reversed: List[(A, B)]

     Attributes
       protected[this]
     Definition Classes
       TraversableOnce

140. #### def sameElements(that: GenIterable[(A, B)]): Boolean

     [use case]

     [use case]
     that

       the collection to compare with.

     returns

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

     Definition Classes
       IterableLike → GenIterableLike

141. #### def scan[B >: (A, B), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[StreamView[(A, B), Coll], B, That]): That

     Computes a prefix scan of the elements of the collection.

     Computes a prefix scan of the elements of the collection.

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

     B

       element type of the resulting collection

     That

       type of the resulting collection

     z

       neutral element for the operator `op`

     op

       the associative operator for the scan

     cbf

       combiner factory which provides a combiner

     returns

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

     Definition Classes
       TraversableLike → GenTraversableLike

142. #### def scanLeft[B, That](z: B)(op: (B, (A, B)) ⇒ B)(implicit bf: CanBuildFrom[StreamView[(A, B), Coll], 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.

     Note: will not terminate for infinite-sized collections.

     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
       TraversableViewLike → TraversableLike → GenTraversableLike

143. #### def scanRight[B, That](z: B)(op: ((A, B), B) ⇒ B)(implicit bf: CanBuildFrom[StreamView[(A, B), Coll], B, That]): That

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

     Produces a collection containing cummulative results of applying the operator going right to left. The head of the collection is the last cummulative result.

     Note: will not terminate for infinite-sized collections.

     Example:

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

     B

       the type of the elements in the resulting collection

     That

       the actual type of the resulting collection

     z

       the initial value

     op

       the binary operator applied to the intermediate result and the element

     bf

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

     returns

       collection with intermediate results

     Definition Classes
       TraversableViewLike → TraversableLike → GenTraversableLike
     Annotations
       @migration
     Migration

       (Changed in version 2.9.0) The behavior of `scanRight` has changed. The previous behavior can be reproduced with scanRight.reverse.

144. #### def segmentLength(p: ((A, B)) ⇒ 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.

     Note: may not terminate for infinite-sized collections.

     p

       the predicate used to test elements.

     from

       the index where the search starts.

     returns

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

     Definition Classes
       SeqLike → GenSeqLike

145. #### def seq: Seq[(A, B)]

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

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

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

     returns

       a sequential view of the collection.

     Definition Classes
       Seq → GenSeq → GenSeqLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

146. #### def size: Int

     The size of this sequence, equivalent to `length`.

     The size of this sequence, equivalent to `length`.

     Note: will not terminate for infinite-sized collections.

     returns

       the number of elements in this sequence.

     Definition Classes
       SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce

147. #### def slice(from: Int, until: Int): StreamView[(A, B), Coll]

     Selects an interval of elements.

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

            from <= indexOf(x) < until

     from

       the lowest index to include from this sequence.

     until

       the highest index to EXCLUDE from this sequence.

     returns

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

     Definition Classes
       TraversableViewLike → TraversableLike → GenTraversableLike

148. #### def sliding(size: Int, step: Int): Iterator[StreamView[(A, B), Coll]]

     Definition Classes
       IterableViewLike → IterableLike

149. #### def sliding(size: Int): Iterator[StreamView[(A, B), Coll]]

     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 sequences of size `size`, except the last and the only element will be truncated if there are fewer elements than size.

     Definition Classes
       IterableLike
     See also

       Iterator#sliding

150. #### def sortBy[B](f: ((A, B)) ⇒ B)(implicit ord: Ordering[B]): StreamView[(A, B), Coll]

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

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

     Definition Classes
       SeqLike
     Example:

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

     See also

       scala.math.Ordering

       Note: will not terminate for infinite-sized collections.

151. #### def sortWith(lt: ((A, B), (A, B)) ⇒ Boolean): StreamView[(A, B), Coll]

     Sorts this sequence according to a comparison function.

     Sorts this sequence according to a comparison function.

     Note: will not terminate for infinite-sized collections.

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

     Definition Classes
       SeqLike
     Example:

     1.        List("Steve", "Tom", "John", "Bob").sortWith(_.compareTo(_) < 0) =
               List("Bob", "John", "Steve", "Tom")

152. #### def sorted[B >: (A, B)](implicit ord: Ordering[B]): StreamView[(A, B), Coll]

     Sorts this sequence according to an Ordering.

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

     Definition Classes
       SeqViewLike → SeqLike
     See also

       scala.math.Ordering

153. #### def span(p: ((A, B)) ⇒ Boolean): (StreamView[(A, B), Coll], StreamView[(A, B), Coll])

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

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

     Definition Classes
       TraversableViewLike → TraversableLike → GenTraversableLike

154. #### def splitAt(n: Int): (StreamView[(A, B), Coll], StreamView[(A, B), Coll])

     Splits this sequence into two at a given position.

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

     Definition Classes
       TraversableViewLike → TraversableLike → GenTraversableLike

155. #### def startsWith[B](that: GenSeq[B], offset: Int): Boolean

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

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

     Note: 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 sequence at index `offset`, otherwise `false`.

     Definition Classes
       SeqLike → GenSeqLike

156. #### def startsWith[B](that: GenSeq[B]): Boolean

     Tests whether this sequence starts with the given sequence.

     Tests whether this sequence starts with the given sequence.

     that

       the sequence to test

     returns

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

     Definition Classes
       GenSeqLike

157. #### 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 sequence. By default the string prefix is the simple name of the collection class sequence.

     Definition Classes
       StreamViewLike → SeqViewLike → IterableViewLike → TraversableViewLike → TraversableLike → GenTraversableLike

158. #### def sum: A

     [use case]

     [use case]
     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

159. #### final def synchronized[T0](arg0: ⇒ T0): T0

     Definition Classes
       AnyRef

160. #### def tail: StreamView[(A, B), Coll]

     Selects all elements except the first.

     Selects all elements except the first.

     returns

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

     Definition Classes
       TraversableLike → GenTraversableLike
     Exceptions thrown
       `UnsupportedOperationException`

       if the sequence is empty.

161. #### def tails: Iterator[StreamView[(A, B), Coll]]

     Iterates over the tails of this sequence.

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

     returns

       an iterator over all the tails of this sequence

     Definition Classes
       TraversableLike
     Example:

     1. `List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)`

162. #### def take(n: Int): StreamView[(A, B), Coll]

     Selects first n elements.

     Selects first n elements.

     n

       Tt number of elements to take from this sequence.

     returns

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

     Definition Classes
       IterableViewLike → TraversableViewLike → IterableLike → TraversableLike → GenTraversableLike

163. #### def takeRight(n: Int): StreamView[(A, B), Coll]

     Selects last n elements.

     Selects last n elements.

     n

       the number of elements to take

     returns

       a sequence consisting only of the last `n` elements of this sequence, or else the whole sequence, if it has less than `n` elements.

     Definition Classes
       IterableLike

164. #### def takeWhile(p: ((A, B)) ⇒ Boolean): StreamView[(A, B), Coll]

     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 sequence whose elements all satisfy the predicate `p`.

     Definition Classes
       TraversableViewLike → TraversableLike → GenTraversableLike

165. #### lazy val thatSeq: Seq[B]

     Attributes
       protected[this]
     Definition Classes
       Zipped

166. #### def thisCollection: Seq[(A, B)]

     The underlying collection seen as an instance of `Seq`.

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

     Attributes
       protected[this]
     Definition Classes
       SeqLike → IterableLike → TraversableLike

167. #### def thisSeq: Seq[(A, B)]

     Attributes
       protected[this]
     Definition Classes
       ViewMkString

168. #### def toArray: Array[A]

     [use case]

     [use case]
     returns

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

169. #### def toBuffer[B >: (A, B)]: Buffer[B]

     Converts this sequence to a mutable buffer.

     Converts this sequence to a mutable buffer.

     Note: will not terminate for infinite-sized collections.

     returns

       a buffer containing all elements of this sequence.

     Definition Classes
       TraversableOnce → GenTraversableOnce

170. #### def toCollection(repr: StreamView[(A, B), Coll]): Seq[(A, B)]

     A conversion from collections of type `Repr` to `Seq` objects.

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

     Attributes
       protected[this]
     Definition Classes
       SeqLike → IterableLike → TraversableLike

171. #### def toIndexedSeq: IndexedSeq[(A, B)]

     Converts this sequence to an indexed sequence.

     Converts this sequence to an indexed sequence.

     Note: will not terminate for infinite-sized collections.

     returns

       an indexed sequence containing all elements of this sequence.

     Definition Classes
       TraversableOnce → GenTraversableOnce

172. #### def toIterable: Iterable[(A, B)]

     Converts this sequence to an iterable collection.

     Converts this sequence 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).

     Note: will not terminate for infinite-sized collections.

     returns

       an `Iterable` containing all elements of this sequence.

     Definition Classes
       IterableLike → TraversableOnce → GenTraversableOnce

173. #### def toIterator: Iterator[(A, B)]

     Returns an Iterator over the elements in this sequence.

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

     Note: will not terminate for infinite-sized collections.

     returns

       an Iterator containing all elements of this sequence.

     Definition Classes
       IterableLike → TraversableLike → GenTraversableOnce

174. #### def toList: List[(A, B)]

     Converts this sequence to a list.

     Converts this sequence to a list.

     Note: will not terminate for infinite-sized collections.

     returns

       a list containing all elements of this sequence.

     Definition Classes
       TraversableOnce → GenTraversableOnce

175. #### def toMap[T, U]: Map[T, U]

     [use case]

     [use case]
     returns

       a map of type `immutable.Map[T, U]` containing all key/value pairs of type `(T, U)` of this sequence.

     Definition Classes
       TraversableOnce → GenTraversableOnce

176. #### def toSeq: Seq[(A, B)]

     Converts this sequence to a sequence.

     Converts this sequence to a sequence.

     Note: will not terminate for infinite-sized collections.

     Overridden for efficiency.

     returns

       a sequence containing all elements of this sequence.

     Definition Classes
       SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce

177. #### def toSet[B >: (A, B)]: Set[B]

     Converts this sequence to a set.

     Converts this sequence to a set.

     Note: will not terminate for infinite-sized collections.

     returns

       a set containing all elements of this sequence.

     Definition Classes
       TraversableOnce → GenTraversableOnce

178. #### def toStream: Stream[(A, B)]

     Converts this sequence to a stream.

     Converts this sequence to a stream.

     Note: will not terminate for infinite-sized collections.

     returns

       a stream containing all elements of this sequence.

     Definition Classes
       IterableLike → TraversableLike → GenTraversableOnce

179. #### def toString(): String

     Creates a String representation of this object.

     Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.

     returns

       a String representation of the object.

     Definition Classes
       Transformed → Transformed → Transformed → Transformed → Transformed → Transformed → Transformed → TraversableViewLike → SeqLike → TraversableLike → Function1 → AnyRef → Any

180. #### def toTraversable: Traversable[(A, B)]

     Converts this sequence to an unspecified Traversable.

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

     Note: will not terminate for infinite-sized collections.

     returns

       a Traversable containing all elements of this sequence.

     Definition Classes
       TraversableLike → TraversableOnce → GenTraversableOnce

181. #### lazy val underlying: Coll

     Definition Classes
       Transformed → GenTraversableViewLike

182. #### def union(that: Seq[(A, B)]): Seq[A]

     [use case]

     [use case]
     that

       the sequence to add.

     returns

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

     Definition Classes
       SeqViewLike → SeqLike → GenSeqLike

183. #### def unzip[A1, A2](implicit asPair: ((A, B)) ⇒ (A1, A2)): (Transformed[A1], Transformed[A2])

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

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

     asPair

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

     returns

       a pair sequences, containing the first, respectively second half of each element pair of this sequence.

     Definition Classes
       TraversableViewLike → GenericTraversableTemplate

184. #### def unzip3[A1, A2, A3](implicit asTriple: ((A, B)) ⇒ (A1, A2, A3)): (Transformed[A1], Transformed[A2], Transformed[A3])

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

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

     asTriple

       an implicit conversion which asserts that the element type of this sequence is a triple.

     returns

       a triple sequences, containing the first, second, respectively third member of each element triple of this sequence.

     Definition Classes
       TraversableViewLike → GenericTraversableTemplate

185. #### def updated(index: Int, elem: (A, B)): Seq[A]

     [use case]

     [use case]
     index

       the position of the replacement

     elem

       the replacing element

     returns

       a copy of this sequence with the element at position `index` replaced by `elem`.

     Definition Classes
       SeqViewLike → SeqLike → GenSeqLike

186. #### def view(from: Int, until: Int): SeqView[(A, B), StreamView[(A, B), Coll]]

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

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

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

     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 sequence, starting at index `from` and extending up to (but not including) index `until`.

     Definition Classes
       SeqLike → IterableLike → TraversableLike

187. #### def view: SeqView[(A, B), StreamView[(A, B), Coll]]

     Creates a non-strict view of this sequence.

     Creates a non-strict view of this sequence.

     returns

       a non-strict view of this sequence.

     Definition Classes
       SeqLike → IterableLike → TraversableLike

188. #### final def viewIdString: String

     Attributes
       protected[this]
     Definition Classes
       Transformed → GenTraversableViewLike

189. #### final def viewIdentifier: String

     Attributes
       protected[this]
     Definition Classes
       Zipped → GenTraversableViewLike

190. #### def viewToString: String

     Definition Classes
       GenTraversableViewLike

191. #### final def wait(): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws()

192. #### final def wait(arg0: Long, arg1: Int): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws()

193. #### final def wait(arg0: Long): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws()

194. #### def withFilter(p: ((A, B)) ⇒ Boolean): StreamView[(A, B), Coll]

     Creates a non-strict filter of this sequence.

     Creates a non-strict filter of this sequence.

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

     Definition Classes
       TraversableViewLike → TraversableLike → FilterMonadic

195. #### def zip[B](that: GenIterable[B]): Seq[(A, B)]

     [use case]

     [use case]
     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 sequence containing pairs consisting of corresponding elements of this sequence and `that`. The length of the returned collection is the minimum of the lengths of this sequence and `that`.

     Definition Classes
       IterableViewLike → IterableLike → GenIterableLike

196. #### def zipAll[B](that: Iterable[B], thisElem: (A, B), thatElem: B): Seq[(A, B)]

     [use case]

     [use case]
     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 sequence is shorter than `that`.

     thatElem

       the element to be used to fill up the result if `that` is shorter than this sequence.

     returns

       a new sequence containing pairs consisting of corresponding elements of this sequence and `that`. The length of the returned collection is the maximum of the lengths of this sequence and `that`. If this sequence is shorter than `that`, `thisElem` values are used to pad the result. If `that` is shorter than this sequence, `thatElem` values are used to pad the result.

     Definition Classes
       IterableViewLike → IterableLike → GenIterableLike

197. #### def zipWithIndex: Seq[(A, Int)]

     [use case]

     [use case]
     returns

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

     Definition Classes
       IterableViewLike → IterableLike → GenIterableLike

### Inherited from Transformed[(A, B)]

### Inherited from StreamView[(A, B), Coll]

### Inherited from StreamViewLike[(A, B), Coll, StreamView[(A, B), Coll]]

### Inherited from Zipped[B]

### Inherited from Transformed[(A, B)]

### Inherited from SeqView[(A, B), Coll]

### Inherited from SeqViewLike[(A, B), Coll, StreamView[(A, B), Coll]]

### Inherited from Seq[(A, B)]

### Inherited from SeqLike[(A, B), StreamView[(A, B), Coll]]

### Inherited from PartialFunction[Int, (A, B)]

### Inherited from (Int) ⇒ (A, B)

### Inherited from Zipped[B]

### Inherited from Transformed[(A, B)]

### Inherited from GenSeqView[(A, B), Coll]

### Inherited from GenSeqViewLike[(A, B), Coll, StreamView[(A, B), Coll]]

### Inherited from GenSeq[(A, B)]

### Inherited from GenSeqLike[(A, B), StreamView[(A, B), Coll]]

### Inherited from Zipped[B]

### Inherited from Transformed[(A, B)]

### Inherited from IterableView[(A, B), Coll]

### Inherited from GenIterableView[(A, B), Coll]

### Inherited from IterableViewLike[(A, B), Coll, StreamView[(A, B), Coll]]

### Inherited from GenIterableViewLike[(A, B), Coll, StreamView[(A, B), Coll]]

### Inherited from TraversableView[(A, B), Coll]

### Inherited from GenTraversableView[(A, B), Coll]

### Inherited from TraversableViewLike[(A, B), Coll, StreamView[(A, B), Coll]]

### Inherited from GenTraversableViewLike[(A, B), Coll, StreamView[(A, B), Coll]]

### Inherited from ViewMkString[(A, B)]

### Inherited from Iterable[(A, B)]

### Inherited from IterableLike[(A, B), StreamView[(A, B), Coll]]

### Inherited from Equals

### Inherited from GenIterable[(A, B)]

### Inherited from GenIterableLike[(A, B), StreamView[(A, B), Coll]]

### Inherited from Traversable[(A, B)]

### Inherited from GenTraversable[(A, B)]

### Inherited from GenericTraversableTemplate[(A, B), Seq]

### Inherited from TraversableLike[(A, B), StreamView[(A, B), Coll]]

### Inherited from GenTraversableLike[(A, B), StreamView[(A, B), Coll]]

### Inherited from Parallelizable[(A, B), ParSeq[(A, B)]]

### Inherited from TraversableOnce[(A, B)]

### Inherited from GenTraversableOnce[(A, B)]

### Inherited from FilterMonadic[(A, B), StreamView[(A, B), Coll]]

### Inherited from HasNewBuilder[(A, B), StreamView[(A, B), Coll]]

### Inherited from AnyRef

### Inherited from Any