scala.collection

IterableLike

trait IterableLike [+A, +Repr] extends Equals with TraversableLike[A, Repr]

A template trait for iterable collections of type Iterable[A].

This is a base trait for all Scala collections that define an iterator method to step through one-by-one the collection's elements. Implementations of this trait need to provide a concrete method with signature:

      def iterator: Iterator[A]

They also need to provide a method newBuilder which creates a builder for collections of the same kind.

This trait implements Iterable's foreach method by stepping through all elements using iterator. Subclasses should re-implement foreach with something more efficient, if possible.

This trait adds methods iterator, sameElements, takeRight, dropRight to the methods inherited from trait Traversable.

Note: This trait replaces every method that uses break in TraversableLike by an iterator version.

A

the element type of the collection

Repr

the type of the actual collection containing the elements.

linear super types: TraversableLike[A, Repr], TraversableOnce[A], FilterMonadic[A, Repr], HasNewBuilder[A, Repr], Equals, AnyRef, Any
known subclasses: Iterable, IterableForwarder, SeqLike, Seq, SeqForwarder, LinearSeqLike, LinearSeq, Iterable, Seq, LinearSeq, Queue, IndexedSeqLike, IndexedSeqOptimized, StringLike, StringOps, LinearSeqOptimized, Iterable, Seq, LinearSeq, MutableList, Queue, IndexedSeqLike, IndexedSeqOptimized, IndexedSeq, IndexedSeq, StringBuilder, SynchronizedQueue, ArrayLike, WrappedArray, ArrayOps, ofUnit, ofBoolean, ofDouble, ofFloat, ofLong, ofInt, ofChar, ofShort, ofByte, ofRef, MapLike, DefaultValuesIterable, SetLike, Set, DefaultKeySet, MapLike, Map, Map, ListMap, HashMap, ResizableArray, BufferLike, Buffer, ArrayBuffer, Script, SetLike, Set, HashSet, ConcurrentMap, ObservableSet, IterableViewLike, Transformed, Zipped, DroppedWhile, TakenWhile, Filtered, Appended, FlatMapped, Mapped, Sliced, Forced, ZippedAll, IterableView, SeqViewLike, Transformed, Patched, Reversed, ZippedAll, Zipped, DroppedWhile, TakenWhile, Filtered, Appended, FlatMapped, Mapped, Sliced, Forced, Prepended, SeqView, IndexedSeqView, Transformed, DroppedWhile, TakenWhile, Filtered, Sliced, Reversed, IterableProxyLike, SetProxyLike, SetProxy, LinkedListLike, DoubleLinkedListLike, JPropertiesWrapper, JDictionaryWrapper, JMapWrapperLike, JConcurrentMapWrapper, JMapWrapper, JSetWrapper, JListWrapper, JCollectionWrapper, JIterableWrapper, WeakHashMap, DefaultMapModel, OpenHashMap, History, LinkedHashMap, ObservableBuffer, MapProxyLike, MapProxy, ObservableMap, MultiMap, PriorityQueue, SynchronizedMap, LinkedList, LinkedHashSet, SynchronizedPriorityQueue, Stack, SynchronizedStack, PriorityQueueProxy, ImmutableSetAdaptor, DoubleLinkedList, SynchronizedBuffer, RevertibleHistory, BufferProxy, QueueProxy, ArrayStack, ofUnit, ofBoolean, ofDouble, ofFloat, ofLong, ofInt, ofChar, ofShort, ofByte, ofRef, BitSetLike, BitSet, BitSet, List, ListBuffer, ImmutableMapAdaptor, StackProxy, ArraySeq, SynchronizedSet, IndexedSeq, Vector, MapLike, Map, IntMap, ::, ListMap, Node, SortedSetLike, SortedSet, Set, SortedSet, TreeSet, HashMap, HashTrieMap, HashMap1, HashSet, HashTrieSet, HashSet1, LongMap, NumericRange, Exclusive, Inclusive, Stream, Cons, Empty, SetProxy, SortedMapLike, DefaultKeySortedSet, SortedMap, SortedMap, Range, ByOne, Inclusive, Set4, Set3, Set2, Set1, EmptySet, MapProxy, WrappedString, Nil, TreeMap, Impl, Map4, Map3, Map2, Map1, EmptyMap, WithDefault, PagedSeq, Stack, DefaultMap, BitSet, BitSetN, BitSet2, BitSet1, ListSet, Node, SetProxy, MapProxy, IterableProxy, SeqProxyLike, DefaultMap, SeqProxy, ValueSet, SelectionSet, columns, rows, BufferWrapper, pages, Content, RefBuffer, items, Indices, indices, AbsScope, UnPicklerEnv, PicklerEnv, Scope, NodeSeq, Node, Elem, SpecialNode, Atom, Unparsed, Group, MetaData, Attribute, PrefixedAttribute, Text, EntityRef, Document, Comment, ProcInstr, PCData, Null, NodeBuffer, UnprefixedAttribute, EmptySet, EmptyMap
self type: IterableLike[A, Repr]
source: IterableLike.scala
    version
  1. 2.8

    since
  1. 2.8

Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. IterableLike
  2. TraversableLike
  3. TraversableOnce
  4. FilterMonadic
  5. HasNewBuilder
  6. Equals
  7. AnyRef
  8. Any
Visibility
  1. Public
  2. All
Impl.
  1. Concrete
  2. Abstract

Type Members

  1. type Self = Repr

    The type implementing this traversable

    The type implementing this traversable

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

    A class supporting filtered operations.

Value Members

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

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

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

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

    arg0

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

    returns

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

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

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

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

    attributes: final
    definition classes: AnyRef
  6. def ++ (that: TraversableOnce[A]) : Iterable[A]

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

    [use case]

    Concatenates this iterable collection with the elements of a traversable collection.

    that

    the traversable to append.

    returns

    a new iterable collection which contains all elements of this iterable collection followed by all elements of that.

    attributes: abstract
    definition classes: TraversableLike
  7. def ++ [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]) : That

    Concatenates this iterable collection with the elements of a traversable collection.

    Concatenates this iterable collection with the elements of a traversable collection.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    that

    the traversable to append.

    bf

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

    returns

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

    definition classes: TraversableLike
  8. def /: [B] (z: B)(op: (B, A) ⇒ B) : B

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

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

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

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    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 iterable collection, going left to right with the start value z on the left: op(...op(op(z, x1), x2), ..., xn) where x,,1,,, ..., x,,n,, are the elements of this iterable collection.

    definition classes: TraversableOnce
  9. def :\ [B] (z: B)(op: (A, B) ⇒ B) : B

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

    Applies a binary operator to all elements of this iterable collection 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.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    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 iterable collection, going right to left with the start value z on the right: op(x1, op(x2, ... op(xn, z)...)) where x,,1,,, ..., x,,n,, are the elements of this iterable collection.

    definition classes: TraversableOnce
  10. def == (arg0: AnyRef) : Boolean

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

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

    arg0

    the object to compare against this object for equality.

    returns

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

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

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

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

    arg0

    the object to compare against this object for equality.

    returns

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

    attributes: final
    definition classes: Any
  12. def addString (b: StringBuilder) : StringBuilder

    Appends all elements of this iterable collection to a string builder.

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

    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableOnce
  13. def addString (b: StringBuilder, sep: String) : StringBuilder

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

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

    b

    the string builder to which elements are appended.

    sep

    the separator string.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableOnce
  14. def addString (b: StringBuilder, start: String, sep: String, end: String) : StringBuilder

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

    Appends all elements of this iterable collection to a string builder using start, end, and separator strings. The written text begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this iterable collection are separated by the string sep.

    b

    the string builder to which elements are appended.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableOnce
  15. def asInstanceOf [T0] : T0

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

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

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

    returns

    the receiver object.

    attributes: final
    definition classes: Any
  16. 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 iterable collection should be compared

    returns

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

    definition classes: IterableLikeEquals
  17. def clone () : AnyRef

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

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

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    attributes: protected
    definition classes: AnyRef
  18. def collect [B] (pf: PartialFunction[A, B]) : Iterable[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the iterable collection.

    returns

    a new iterable collection resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    attributes: abstract
    definition classes: TraversableLike
  19. def collect [B, That] (pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Repr, B, That]) : That

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

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

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    pf

    the partial function which filters and maps the iterable collection.

    bf

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

    returns

    a new collection of type That resulting from applying the partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    definition classes: TraversableLike
  20. def copyToArray (xs: Array[A], start: Int, len: Int) : Unit

    [use case] Copies elements of this iterable collection to an array.

    [use case]

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

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

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

    Copies elements of this iterable collection to an array.

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

    Note: will not terminate for infinite-sized collections.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

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

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

    [use case]

    Copies values of this iterable collection to an array. Fills the given array xs with values of this iterable collection. Copying will stop once either the end of the current iterable collection is reached, or the end of the array is reached.

    xs

    the array to fill.

    attributes: abstract
    definition classes: TraversableOnce
  23. def copyToArray [B >: A] (xs: Array[B]) : Unit

    Copies values of this iterable collection to an array.

    Copies values of this iterable collection to an array. Fills the given array xs with values of this iterable collection. Copying will stop once either the end of the current iterable collection is reached, or the end of the array is reached.

    Note: will not terminate for infinite-sized collections.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    definition classes: TraversableOnce
  24. def copyToArray (xs: Array[A], start: Int) : Unit

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

    [use case]

    Copies values of this iterable collection to an array. Fills the given array xs with values of this iterable collection, after skipping start values. Copying will stop once either the end of the current iterable collection is reached, or the end of the array is reached.

    xs

    the array to fill.

    start

    the starting index.

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

    Copies values of this iterable collection to an array.

    Copies values of this iterable collection to an array. Fills the given array xs with values of this iterable collection, after skipping start values. Copying will stop once either the end of the current iterable collection is reached, or the end of the array is reached.

    Note: will not terminate for infinite-sized collections.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    definition classes: TraversableOnce
  26. def copyToBuffer [B >: A] (dest: Buffer[B]) : Unit

    Copies all elements of this iterable collection to a buffer.

    Copies all elements of this iterable collection to a buffer.

    Note: will not terminate for infinite-sized collections.

    dest

    The buffer to which elements are copied.

    definition classes: TraversableOnce
  27. def count (p: (A) ⇒ Boolean) : Int

    Counts the number of elements in the iterable collection which satisfy a predicate.

    Counts the number of elements in the iterable collection which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    definition classes: TraversableOnce
  28. def drop (n: Int) : Repr

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the number of elements to drop from this iterable collection.

    returns

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

    definition classes: TraversableLike
  29. def dropRight (n: Int) : Repr

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    The number of elements to take

    returns

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

  30. def dropWhile (p: (A) ⇒ Boolean) : Repr

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

    The predicate used to test elements.

    returns

    the longest suffix of this iterable collection whose first element does not satisfy the predicate p.

    definition classes: TraversableLike
  31. def elements : Iterator[A]

      deprecated:
    1. use iterator' instead

  32. def eq (arg0: AnyRef) : Boolean

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

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

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

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

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

    arg0

    the object to compare against this object for reference equality.

    returns

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

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

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.

    The default implementations of this method is an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation]: * It is reflexive: for any instance x of type Any, x.equals(x) should return true. * It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true. * It is transitive: for any instances x, y, and z of type AnyRef if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

    If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is often necessary to override hashCode to ensure that objects that are "equal" (o1.equals(o2) returns true) hash to the same scala.Int (o1.hashCode.equals(o2.hashCode)).

    arg0

    the object to compare against this object for equality.

    returns

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

    definition classes: AnyRef → Any
  34. def exists (p: (A) ⇒ Boolean) : Boolean

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

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

    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 iterable collection, otherwise false.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  35. def filter (p: (A) ⇒ Boolean) : Repr

    Selects all elements of this iterable collection which satisfy a predicate.

    Selects all elements of this iterable collection which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

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

    definition classes: TraversableLike
  36. def filterNot (p: (A) ⇒ Boolean) : Repr

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

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

    p

    the predicate used to test elements.

    returns

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

    definition classes: TraversableLike
  37. def finalize () : Unit

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

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

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

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

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

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

    Note: may not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

    the predicate used to test elements.

    returns

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

    definition classes: IterableLikeTraversableLikeTraversableOnce
  39. def first : A

      deprecated:
    1. use head' instead

  40. def firstOption : Option[A]

    None if iterable is empty.

    None if iterable is empty.

      deprecated:
    1. use headOption' instead

  41. def flatMap [B] (f: (A) ⇒ Traversable[B]) : Iterable[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    attributes: abstract
    definition classes: TraversableLike
  42. def flatMap [B, That] (f: (A) ⇒ Traversable[B])(implicit bf: CanBuildFrom[Repr, B, That]) : That

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

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

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    f

    the function to apply to each element.

    bf

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

    returns

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

    definition classes: TraversableLikeFilterMonadic
  43. def foldLeft [B] (z: B)(op: (B, A) ⇒ B) : B

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

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

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    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 iterable collection, going left to right with the start value z on the left: op(...op(z, x1), x2, ..., xn) where x,,1,,, ..., x,,n,, are the elements of this iterable collection.

    definition classes: TraversableOnce
  44. def foldRight [B] (z: B)(op: (A, B) ⇒ B) : B

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

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

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    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 iterable collection, going right to left with the start value z on the right: op(x1, op(x2, ... op(xn, z)...)) where x,,1,,, ..., x,,n,, are the elements of this iterable collection.

    definition classes: IterableLikeTraversableOnce
  45. def forall (p: (A) ⇒ Boolean) : Boolean

    Tests whether a predicate holds for all elements of this iterable collection.

    Tests whether a predicate holds for all elements of this iterable collection.

    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 iterable collection, otherwise false.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  46. def foreach (f: (A) ⇒ Unit) : Unit

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

    [use case]

    Applies a function f to all elements of this iterable collection.

    f

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

    attributes: abstract
  47. def foreach [U] (f: (A) ⇒ U) : Unit

    Applies a function f to all elements of this iterable collection.

    Applies a function f to all elements of this iterable collection.

    Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.

    U

    the type parameter describing the result of function f. This result will always be ignored. Typically U is Unit, but this is not necessary.

    f

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

    definition classes: IterableLikeTraversableLikeTraversableOnceFilterMonadic
  48. def getClass () : java.lang.Class[_]

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

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

    The nature of the representation is platform dependent.

    returns

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

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

    Partitions this iterable collection into a map of iterable collections according to some discriminator function.

    Partitions this iterable collection into a map of iterable collections 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 iterable collection.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

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

    definition classes: TraversableLike
  50. def grouped (size: Int) : Iterator[Repr]

    Partitions elements in fixed size iterable collections.

    Partitions elements in fixed size iterable collections.

    size

    the number of elements per group

    returns

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

      see also:
    1. Iterator#grouped

  51. def hasDefiniteSize : Boolean

    Tests whether this iterable collection is known to have a finite size.

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

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

    returns

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

    definition classes: TraversableLikeTraversableOnce
  52. def hashCode () : Int

    Returns a hash code value for the object.

    Returns a hash code value for the object.

    The default hashing algorithm is platform dependent.

    Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

    returns

    the hash code value for the object.

    definition classes: AnyRef → Any
  53. def head : A

    Selects the first element of this iterable collection.

    Selects the first element of this iterable collection.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    the first element of this iterable collection.

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

    Optionally selects the first element.

    Optionally selects the first element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

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

    definition classes: TraversableLike
  55. def init : Repr

    Selects all elements except the last.

    Selects all elements except the last.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    a iterable collection consisting of all elements of this iterable collection except the last one.

    definition classes: TraversableLike
  56. def isEmpty : Boolean

    Tests whether this iterable collection is empty.

    Tests whether this iterable collection is empty.

    returns

    true if the iterable collection contain no elements, false otherwise.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  57. def isInstanceOf [T0] : Boolean

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

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

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

    returns

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

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

    Tests whether this iterable collection can be repeatedly traversed.

    Tests whether this iterable collection can be repeatedly traversed.

    returns

    true

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

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

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

    returns

    the new iterator

    attributes: abstract
  60. def last : A

    Selects the last element.

    Selects the last element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    the first element of this iterable collection.

    definition classes: TraversableLike
  61. def lastOption : Option[A]

    Optionally selects the last element.

    Optionally selects the last element.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

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

    definition classes: TraversableLike
  62. def map [B] (f: (A) ⇒ B) : Iterable[B]

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

    [use case]

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

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    attributes: abstract
    definition classes: TraversableLike
  63. def map [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, That]) : That

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

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

    B

    the element type of the returned collection.

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    f

    the function to apply to each element.

    bf

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

    returns

    a new collection of type That resulting from applying the given function f to each element of this iterable collection and collecting the results.

    definition classes: TraversableLikeFilterMonadic
  64. def max : A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this iterable collection.

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

    Finds the largest element.

    Finds the largest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the largest element of this iterable collection with respect to the ordering cmp.

    definition classes: TraversableOnce
  66. def min : A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this iterable collection

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

    Finds the smallest element.

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the smallest element of this iterable collection with respect to the ordering cmp.

    definition classes: TraversableOnce
  68. def mkString : String

    Displays all elements of this iterable collection in a string.

    Displays all elements of this iterable collection in a string.

    returns

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

    definition classes: TraversableOnce
  69. def mkString (sep: String) : String

    Displays all elements of this iterable collection in a string using a separator string.

    Displays all elements of this iterable collection in a string using a separator string.

    sep

    the separator string.

    returns

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

    definition classes: TraversableOnce
  70. def mkString (start: String, sep: String, end: String) : String

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

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

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

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

    definition classes: TraversableOnce
  71. def ne (arg0: AnyRef) : Boolean

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

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

    arg0

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

    returns

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

    attributes: final
    definition classes: AnyRef
  72. def newBuilder : Builder[A, Repr]

    Creates a new builder for this collection type.

    Creates a new builder for this collection type.

    attributes: protected[this] abstract
    definition classes: TraversableLikeHasNewBuilder
  73. def nonEmpty : Boolean

    Tests whether the iterable collection is not empty.

    Tests whether the iterable collection is not empty.

    returns

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

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

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

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

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

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

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

    attributes: final
    definition classes: AnyRef
  76. def partition (p: (A) ⇒ Boolean) : (Repr, Repr)

    Partitions this iterable collection in two iterable collections according to a predicate.

    Partitions this iterable collection in two iterable collections according to a predicate.

    p

    the predicate on which to partition.

    returns

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

    definition classes: TraversableLike
  77. def product : Int

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

    [use case]

    Multiplies up the elements of this collection.

    returns

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

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

    Multiplies up the elements of this collection.

    Multiplies up the elements of this collection.

    B

    the result type of the * operator.

    num

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

    returns

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

    definition classes: TraversableOnce
  79. def projection : IterableView[A, Repr]

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

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

      deprecated:
    1. use view' instead

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

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

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

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this iterable collection, going left to right: op(...(op(x1, x2), ... ) , xn) where x,,1,,, ..., x,,n,, are the elements of this iterable collection.

    definition classes: TraversableOnce
  81. def reduceLeftOption [B >: A] (op: (B, A) ⇒ B) : Option[B]

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

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

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

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

    definition classes: TraversableOnce
  82. def reduceRight [B >: A] (op: (A, B) ⇒ B) : B

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

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

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this iterable collection, going right to left: op(x1, op(x2, ..., op(xn-1, xn)...)) where x,,1,,, ..., x,,n,, are the elements of this iterable collection.

    definition classes: IterableLikeTraversableOnce
  83. def reduceRightOption [B >: A] (op: (A, B) ⇒ B) : Option[B]

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

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

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

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

    definition classes: TraversableOnce
  84. def repr : Repr

    The collection of type iterable collection underlying this TraversableLike object.

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

    definition classes: TraversableLike
  85. def reversed : List[A]

    attributes: protected[this]
    definition classes: TraversableOnce
  86. def sameElements (that: Iterable[A]) : Boolean

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

    [use case]

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

    that

    the collection to compare with.

    returns

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

    attributes: abstract
  87. def sameElements [B >: A] (that: Iterable[B]) : Boolean

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

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

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    Note: will not terminate for infinite-sized collections.

    B

    the type of the elements of collection that.

    that

    the collection to compare with.

    returns

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

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

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    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 and the new element type B.

    returns

    collection with intermediate results

    definition classes: TraversableLike
  89. def scanRight [B, That] (z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[Repr, 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.

    Note: will not terminate for infinite-sized collections.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    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 and the new element type B.

    returns

    collection with intermediate results

    definition classes: TraversableLike
  90. def size : Int

    The size of this iterable collection.

    The size of this iterable collection.

    Note: will not terminate for infinite-sized collections.

    returns

    the number of elements in this iterable collection.

    definition classes: TraversableOnce
  91. def slice (from: Int, until: Int) : Repr

    Selects an interval of elements.

    Selects an interval of elements.

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

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    from

    the index of the first returned element in this iterable collection.

    until

    the index one past the last returned element in this iterable collection.

    returns

    a iterable collection containing the elements starting at index from and extending up to (but not including) index until of this iterable collection.

    definition classes: IterableLikeTraversableLike
  92. def sliding [B >: A] (size: Int, step: Int) : Iterator[Repr]

  93. def sliding [B >: A] (size: Int) : Iterator[Repr]

    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 iterable collections of size size, except the last will be truncated if the elements don't divide evenly.

      see also:
    1. Iterator#sliding

  94. def span (p: (A) ⇒ Boolean) : (Repr, Repr)

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

    Splits this iterable collection 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.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

    the test predicate

    returns

    a pair consisting of the longest prefix of this iterable collection whose elements all satisfy p, and the rest of this iterable collection.

    definition classes: TraversableLike
  95. def splitAt (n: Int) : (Repr, Repr)

    Splits this iterable collection into two at a given position.

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

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the position at which to split.

    returns

    a pair of iterable collections consisting of the first n elements of this iterable collection, and the other elements.

    definition classes: TraversableLike
  96. 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 iterable collection. By default the string prefix is the simple name of the collection class iterable collection.

    definition classes: TraversableLike
  97. def sum : Int

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

    [use case]

    Sums up the elements of this collection.

    returns

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

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

    Sums up the elements of this collection.

    Sums up the elements of this collection.

    B

    the result type of the + operator.

    num

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

    returns

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

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

    attributes: final
    definition classes: AnyRef
  100. def tail : Repr

    Selects all elements except the first.

    Selects all elements except the first.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    returns

    a iterable collection consisting of all elements of this iterable collection except the first one.

    definition classes: TraversableLike
  101. def take (n: Int) : Repr

    Selects first n elements.

    Selects first n elements.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    Tt number of elements to take from this iterable collection.

    returns

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

    definition classes: IterableLikeTraversableLike
  102. def takeRight (n: Int) : Repr

    Selects last n elements.

    Selects last n elements.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    n

    the number of elements to take

    returns

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

  103. def takeWhile (p: (A) ⇒ Boolean) : Repr

    Takes longest prefix of elements that satisfy a predicate.

    Takes longest prefix of elements that satisfy a predicate.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    p

    The predicate used to test elements.

    returns

    the longest prefix of this iterable collection whose elements all satisfy the predicate p.

    definition classes: IterableLikeTraversableLike
  104. def thisCollection : Iterable[A]

    The underlying collection seen as an instance of Iterable.

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

    attributes: protected[this]
    definition classes: IterableLikeTraversableLike
  105. def toArray : Array[A]

    [use case] Converts this iterable collection to an array.

    [use case]

    Converts this iterable collection to an array.

    Note: will not terminate for infinite-sized collections.

    returns

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

    attributes: abstract
    definition classes: TraversableOnce
  106. def toArray [B >: A] (implicit arg0: ClassManifest[B]) : Array[B]

    Converts this iterable collection to an array.

    Converts this iterable collection to an array.

    Note: will not terminate for infinite-sized collections.

    B

    the type of the elements of the array. A ClassManifest for this type must be available.

    returns

    an array containing all elements of this iterable collection.

    definition classes: TraversableOnce
  107. def toBuffer [B >: A] : Buffer[B]

    Converts this iterable collection to a mutable buffer.

    Converts this iterable collection to a mutable buffer.

    Note: will not terminate for infinite-sized collections.

    returns

    a buffer containing all elements of this iterable collection.

    definition classes: TraversableOnce
  108. def toCollection (repr: Repr) : Iterable[A]

    A conversion from collections of type Repr to Iterable objects.

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

    attributes: protected[this]
    definition classes: IterableLikeTraversableLike
  109. def toIndexedSeq [B >: A] : IndexedSeq[B]

    Converts this iterable collection to an indexed sequence.

    Converts this iterable collection to an indexed sequence.

    Note: will not terminate for infinite-sized collections.

    returns

    an indexed sequence containing all elements of this iterable collection.

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

    Converts this iterable collection to an iterable collection.

    Converts this iterable collection 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 iterable collection.

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

    Returns an Iterator over the elements in this iterable collection.

    Returns an Iterator over the elements in this iterable collection. 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 iterable collection.

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

    Converts this iterable collection to a list.

    Converts this iterable collection to a list.

    Note: will not terminate for infinite-sized collections.

    returns

    a list containing all elements of this iterable collection.

    definition classes: TraversableOnce
  113. def toMap [T, U] (implicit ev: <:<[A, (T, U)]) : Map[T, U]

    Converts this iterable collection to a map.

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

    Note: will not terminate for infinite-sized collections.

    returns

    a map containing all elements of this iterable collection.

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

    Converts this iterable collection to a sequence.

    Converts this iterable collection to a sequence.

    Note: will not terminate for infinite-sized collections.

    returns

    a sequence containing all the elements of this iterable collection.

    definition classes: IterableLikeTraversableOnce
  115. def toSet [B >: A] : Set[B]

    Converts this iterable collection to a set.

    Converts this iterable collection to a set.

    Note: will not terminate for infinite-sized collections.

    returns

    a set containing all elements of this iterable collection.

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

    Converts this iterable collection to a stream.

    Converts this iterable collection to a stream.

    Note: will not terminate for infinite-sized collections.

    returns

    a stream containing all elements of this iterable collection.

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

    Converts this iterable collection to a string.

    Converts this iterable collection to a string.

    returns

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

    definition classes: TraversableLike → AnyRef → Any
  118. def toTraversable : Traversable[A]

    Converts this iterable collection to an unspecified Traversable.

    Converts this iterable collection 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 iterable collection.

    definition classes: TraversableLikeTraversableOnce
  119. def view (from: Int, until: Int) : IterableView[A, Repr]

    Creates a non-strict view of a slice of this iterable collection.

    Creates a non-strict view of a slice of this iterable collection.

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

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

    Note: might return different results for different runs, unless the underlying collection type is ordered.

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

    definition classes: IterableLikeTraversableLike
  120. def view : IterableView[A, Repr]

    Creates a non-strict view of this iterable collection.

    Creates a non-strict view of this iterable collection.

    returns

    a non-strict view of this iterable collection.

    definition classes: IterableLikeTraversableLike
  121. def wait () : Unit

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

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

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

    Creates a non-strict filter of this iterable collection.

    Creates a non-strict filter of this iterable collection.

    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.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

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

    definition classes: TraversableLikeFilterMonadic
  125. def zip [B] (that: Iterable[B]) : Iterable[(A, B)]

    [use case] Returns a iterable collection formed from this iterable collection and another iterable collection by combining corresponding elements in pairs.

    [use case]

    Returns a iterable collection formed from this iterable collection and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    returns

    a new iterable collection containing pairs consisting of corresponding elements of this iterable collection and that. The length of the returned collection is the minimum of the lengths of this iterable collection and that.

    attributes: abstract
  126. def zip [A1 >: A, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[Repr, (A1, B), That]) : That

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

    Returns a iterable collection formed from this iterable collection and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    B

    the type of the second half of the returned pairs

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, B) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That]. is found.

    that

    The iterable providing the second half of each result pair

    bf

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

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this iterable collection and that. The length of the returned collection is the minimum of the lengths of this iterable collection and that.

  127. def zipAll [B] (that: Iterable[B], thisElem: A, thatElem: B) : Iterable[(A, B)]

    [use case] Returns a iterable collection formed from this iterable collection and another iterable collection by combining corresponding elements in pairs.

    [use case]

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

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this iterable collection is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this iterable collection.

    returns

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

    attributes: abstract
  128. def zipAll [B, A1 >: A, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Repr, (A1, B), That]) : That

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

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

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    that

    the iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this iterable collection is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this iterable collection.

    returns

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

  129. def zipWithIndex : Iterable[(A, Int)]

    [use case] Zips this iterable collection with its indices.

    [use case]

    Zips this iterable collection with its indices.

    returns

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

    attributes: abstract
  130. def zipWithIndex [A1 >: A, That] (implicit bf: CanBuildFrom[Repr, (A1, Int), That]) : That

    Zips this iterable collection with its indices.

    Zips this iterable collection with its indices.

    Note: might return different results for different runs, unless the underlying collection type is ordered.

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, Int) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That]. is found.

    returns

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

Inherited from TraversableLike[A, Repr]

Inherited from TraversableOnce[A]

Inherited from FilterMonadic[A, Repr]

Inherited from HasNewBuilder[A, Repr]

Inherited from Equals

Inherited from AnyRef

Inherited from Any