Packages

t

scala.collection

IterableOnceOps

trait IterableOnceOps[+A, +CC[_], +C] extends Any

This implementation trait can be mixed into an IterableOnce to get the basic methods that are shared between Iterator and Iterable. The IterableOnce must support multiple calls to iterator() but may or may not return the same Iterator every time.

Self Type
IterableOnceOps[A, CC, C] with IterableOnce[A]
Source
IterableOnce.scala
Linear Supertypes
Known Subclasses
ValueSet, AbstractIterable, AbstractIterator, AbstractMap, AbstractSeq, BitSet, BitSetOps, BufferedIterator, IndexedSeq, IndexedSeqOps, IndexedView, Drop, DropRight, Id, Map, Prepended, Reverse, Slice, Take, TakeRight, Iterable, IterableOps, Iterator, GroupedIterator, LinearSeq, LinearSeqOps, Map, MapOps, KeySet, MapView, FilterKeys, Id, MapValues, Seq, SeqOps, SeqView, Id, Map, Prepended, Take, Set, SetOps, SortedMap, SortedMapOps, KeySortedSet, SortedSet, SortedSetOps, StrictOptimizedIterableOps, StrictOptimizedSeqOps, StrictOptimizedSortedSetOps, StringOps, StringView, View, Appended, Concat, DistinctBy, Drop, DropWhile, Elems, Empty, Fill, Filter, FlatMap, Iterate, Map, PadTo, Partitioned, Prepended, ScanLeft, Single, Tabulate, Take, TakeWhile, Updated, Zip, ZipAll, ZipWithIndex, Map, TrieMap, ::, BitSet, BitSet1, BitSet2, BitSetN, ChampHashMap, ChampHashSet, HashMap, HashMap1, HashTrieMap, HashSet, ImmutableArray, ofBoolean, ofByte, ofChar, ofDouble, ofFloat, ofInt, ofLong, ofRef, ofShort, ofUnit, IndexedSeq, IndexedSeqOps, IntMap, Iterable, LazyList, Cons, Empty, LinearSeq, LinearSeqOps, List, ListMap, Node, ListSet, Node, LongMap, Map, Map1, Map2, Map3, Map4, WithDefault, MapOps, ImmutableKeySet, Nil, NumericRange, Exclusive, Inclusive, Queue, Range, Exclusive, Inclusive, Seq, SeqOps, Set, Set1, Set2, Set3, Set4, SetOps, SortedMap, WithDefault, SortedMapOps, ImmutableKeySortedSet, SortedSet, SortedSetOps, Cons, Empty, StrictOptimizedSeqOps, TreeMap, TreeSet, Vector, VectorIterator, WrappedString, AbstractBuffer, AbstractIterable, AbstractMap, AbstractSeq, AbstractSet, AnyRefMap, ArrayBuffer, ArrayBufferView, ArrayDeque, BitSet, Buffer, HashMap, HashSet, IndexedOptimizedBuffer, IndexedOptimizedSeq, IndexedSeq, IndexedSeqOps, Iterable, IterableOps, LinkedHashMap, LinkedKeySet, LinkedHashSet, ListBuffer, ListMap, LongMap, Map, WithDefault, MapOps, MultiMap, PriorityQueue, Queue, Seq, SeqOps, Set, SetOps, SortedMap, WithDefault, SortedMapOps, SortedSet, SortedSetOps, Stack, StringBuilder, TreeMap, TreeSet, UnrolledBuffer, WrappedArray, ofBoolean, ofByte, ofChar, ofDouble, ofFloat, ofInt, ofLong, ofRef, ofShort, ofUnit, BufferedSource, BufferedLineIterator, Source, LineIterator, SystemProperties, MatchIterator, DefaultMap, Stream, OpenHashMap
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IterableOnceOps
  2. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def collect[B](pf: PartialFunction[A, B]): CC[B]

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

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

    B

    the element type of the returned $coll.

    pf

    the partial function which filters and maps the $coll.

    returns

    a new $coll 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.

    Note

    Reuse: $consumesAndProducesIterator

  2. abstract def drop(n: Int): C

    Selects all elements except first n ones.

    Selects all elements except first n ones. $orderDependent

    n

    the number of elements to drop from this $coll.

    returns

    a $coll consisting of all elements of this $coll except the first n ones, or else the empty $coll, if this $coll has less than n elements. If n is negative, don't drop any elements.

    Note

    Reuse: $consumesAndProducesIterator

  3. abstract def dropWhile(p: (A) ⇒ Boolean): C

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate. $orderDependent

    p

    The predicate used to test elements.

    returns

    the longest suffix of this $coll whose first element does not satisfy the predicate p.

    Note

    Reuse: $consumesAndProducesIterator

  4. abstract def filter(p: (A) ⇒ Boolean): C

    Selects all elements of this $coll which satisfy a predicate.

    Selects all elements of this $coll which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new iterator consisting of all elements of this $coll that satisfy the given predicate p. The order of the elements is preserved.

  5. abstract def filterNot(pred: (A) ⇒ Boolean): C

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

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

    pred

    the predicate used to test elements.

    returns

    a new $coll consisting of all elements of this $coll that do not satisfy the given predicate pred. Their order may not be preserved.

  6. abstract def flatMap[B](f: (A) ⇒ IterableOnce[B]): CC[B]

    Builds a new $coll by applying a function to all elements of this $coll and using the elements of the resulting collections.

    Builds a new $coll by applying a function to all elements of this $coll and using the elements of the resulting collections.

    For example:

    def getWords(lines: Seq[String]): Seq[String] = lines flatMap (line => line split "\\W+")

    The type of the resulting collection is guided by the static type of $coll. This might cause unexpected results sometimes. For example:

    // lettersOf will return a Seq[Char] of likely repeated letters, instead of a Set
    def lettersOf(words: Seq[String]) = words flatMap (word => word.toSet)
    
    // lettersOf will return a Set[Char], not a Seq
    def lettersOf(words: Seq[String]) = words.toSet flatMap (word => word.toSeq)
    
    // xs will be an Iterable[Int]
    val xs = Map("a" -> List(11,111), "b" -> List(22,222)).flatMap(_._2)
    
    // ys will be a Map[Int, Int]
    val ys = Map("a" -> List(1 -> 11,1 -> 111), "b" -> List(2 -> 22,2 -> 222)).flatMap(_._2)
    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

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

    Note

    Reuse: $consumesAndProducesIterator

  7. abstract def flatten[B](implicit asIterable: (A) ⇒ IterableOnce[B]): CC[B]

    Converts this $coll of traversable collections into a $coll formed by the elements of these traversable collections.

    Converts this $coll of traversable collections into a $coll formed by the elements of these traversable collections.

    The resulting collection's type will be guided by the type of $coll. For example:

    val xs = List(
               Set(1, 2, 3),
               Set(1, 2, 3)
             ).flatten
    // xs == List(1, 2, 3, 1, 2, 3)
    
    val ys = Set(
               List(1, 2, 3),
               List(3, 2, 1)
             ).flatten
    // ys == Set(1, 2, 3)
    B

    the type of the elements of each traversable collection.

    asIterable

    an implicit conversion which asserts that the element type of this $coll is a GenTraversable.

    returns

    a new $coll resulting from concatenating all element ${coll}s.

    Note

    Reuse: $consumesAndProducesIterator

  8. abstract def getClass(): Class[_]

    Returns the runtime class representation of the object.

    Returns the runtime class representation of the object.

    returns

    a class object corresponding to the runtime type of the receiver.

    Definition Classes
    Any
  9. abstract def map[B](f: (A) ⇒ B): CC[B]

    Builds a new $coll by applying a function to all elements of this $coll.

    Builds a new $coll by applying a function to all elements of this $coll.

    B

    the element type of the returned $coll.

    f

    the function to apply to each element.

    returns

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

    Note

    Reuse: $consumesAndProducesIterator

  10. abstract def scanLeft[B](z: B)(op: (B, A) ⇒ B): CC[B]

    Produces a $coll containing cumulative results of applying the operator going left to right, including the initial value.

    Produces a $coll containing cumulative results of applying the operator going left to right, including the initial value.

    $willNotTerminateInf $orderDependent

    B

    the type of the elements in the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    returns

    collection with intermediate results

    Note

    Reuse: $consumesAndProducesIterator

  11. abstract def slice(from: Int, until: Int): C

    Selects an interval of elements.

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

    from <= indexOf(x) < until

    $orderDependent

    from

    the lowest index to include from this $coll.

    until

    the lowest index to EXCLUDE from this $coll.

    returns

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

    Note

    Reuse: $consumesAndProducesIterator

  12. abstract def span(p: (A) ⇒ Boolean): (C, C)

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

    Splits this $coll 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. $orderDependent

    p

    the test predicate

    returns

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

    Note

    Reuse: $consumesOneAndProducesTwoIterators

  13. abstract def take(n: Int): C

    Selects first n elements.

    Selects first n elements. $orderDependent

    n

    the number of elements to take from this $coll.

    returns

    a $coll consisting only of the first n elements of this $coll, or else the whole $coll, if it has less than n elements. If n is negative, returns an empty $coll.

    Note

    Reuse: $consumesAndProducesIterator

  14. abstract def takeWhile(p: (A) ⇒ Boolean): C

    Takes longest prefix of elements that satisfy a predicate.

    Takes longest prefix of elements that satisfy a predicate. $orderDependent

    p

    The predicate used to test elements.

    returns

    the longest prefix of this $coll whose elements all satisfy the predicate p.

    Note

    Reuse: $consumesAndProducesIterator

  15. abstract def zipWithIndex: CC[(A, Int)]

    Zips this $coll with its indices.

    Zips this $coll with its indices.

    returns

    A new $coll containing pairs consisting of all elements of this $coll paired with their index. Indices start at 0.

    Example:
    1. List("a", "b", "c").zipWithIndex == List(("a", 0), ("b", 1), ("c", 2))

    Note

    Reuse: $consumesAndProducesIterator

Concrete Value Members

  1. 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
  2. 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
    Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from IterableOnceOps[A, CC, C] to any2stringadd[IterableOnceOps[A, CC, C]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (IterableOnceOps[A, CC, C], B)
    Implicit
    This member is added by an implicit conversion from IterableOnceOps[A, CC, C] to ArrowAssoc[IterableOnceOps[A, CC, C]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. 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
  6. def addString(b: mutable.StringBuilder): mutable.StringBuilder

    Appends all elements of this $coll to a string builder.

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

    Example:

    scala> val a = List(1,2,3,4)
    a: List[Int] = List(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> val h = a.addString(b)
    h: StringBuilder = 1234
    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

  7. def addString(b: mutable.StringBuilder, sep: String): mutable.StringBuilder

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

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

    Example:

    scala> val a = List(1,2,3,4)
    a: List[Int] = List(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.

  8. def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): b.type

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

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

    Example:

    scala> val a = List(1,2,3,4)
    a: List[Int] = List(1, 2, 3, 4)
    
    scala> val b = new StringBuilder()
    b: StringBuilder =
    
    scala> a.addString(b , "List(" , ", " , ")")
    res5: StringBuilder = List(1, 2, 3, 4)
    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.

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

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

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

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

    $mayNotTerminateInf $orderDependent

    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.

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

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

    [use case] $willNotTerminateInf

    [use case]

    $willNotTerminateInf

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    Full Signature

    def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): xs.type

  12. def copyToArray(xs: Array[A], start: Int): Unit

    [use case] $willNotTerminateInf

    [use case]

    $willNotTerminateInf

    xs

    the array to fill.

    start

    the starting index.

    Full Signature

    def copyToArray[B >: A](xs: Array[B], start: Int = 0): xs.type

  13. def count(p: (A) ⇒ Boolean): Int

    Counts the number of elements in the $coll which satisfy a predicate.

    Counts the number of elements in the $coll which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

  14. def ensuring(cond: (IterableOnceOps[A, CC, C]) ⇒ Boolean, msg: ⇒ Any): IterableOnceOps[A, CC, C]
    Implicit
    This member is added by an implicit conversion from IterableOnceOps[A, CC, C] to Ensuring[IterableOnceOps[A, CC, C]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  15. def ensuring(cond: (IterableOnceOps[A, CC, C]) ⇒ Boolean): IterableOnceOps[A, CC, C]
    Implicit
    This member is added by an implicit conversion from IterableOnceOps[A, CC, C] to Ensuring[IterableOnceOps[A, CC, C]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  16. def ensuring(cond: Boolean, msg: ⇒ Any): IterableOnceOps[A, CC, C]
    Implicit
    This member is added by an implicit conversion from IterableOnceOps[A, CC, C] to Ensuring[IterableOnceOps[A, CC, C]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  17. def ensuring(cond: Boolean): IterableOnceOps[A, CC, C]
    Implicit
    This member is added by an implicit conversion from IterableOnceOps[A, CC, C] to Ensuring[IterableOnceOps[A, CC, C]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  18. def equals(arg0: Any): Boolean

    Compares the receiver object (this) with the argument object (that) for equivalence.

    Compares the receiver object (this) with the argument object (that) for equivalence.

    Any implementation of this method should be an 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 Any 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 usually necessary to override hashCode to ensure that objects which are "equal" (o1.equals(o2) returns true) hash to the same scala.Int. (o1.hashCode.equals(o2.hashCode)).

    returns

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

    Definition Classes
    Any
  19. def exists(p: (A) ⇒ Boolean): Boolean

    Tests whether a predicate holds for at least one element of this $coll.

    Tests whether a predicate holds for at least one element of this $coll.

    $mayNotTerminateInf

    p

    the predicate used to test elements.

    returns

    true if the given predicate p is satisfied by at least one element of this $coll, otherwise false

  20. def find(p: (A) ⇒ Boolean): Option[A]

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

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

    $mayNotTerminateInf $orderDependent

    p

    the predicate used to test elements.

    returns

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

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

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

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

    $willNotTerminateInf $orderDependentFold

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

    op(...op(z, x_1), x_2, ..., x_n)

    where x1, ..., xn are the elements of this $coll. Returns z if this $coll is empty.

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

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

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

    $willNotTerminateInf $orderDependentFold

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

    op(x_1, op(x_2, ... op(x_n, z)...))

    where x1, ..., xn are the elements of this $coll. Returns z if this $coll is empty.

  23. def forall(p: (A) ⇒ Boolean): Boolean

    Tests whether a predicate holds for all elements of this $coll.

    Tests whether a predicate holds for all elements of this $coll.

    $mayNotTerminateInf

    p

    the predicate used to test elements.

    returns

    true if this $coll is empty or the given predicate p holds for all elements of this $coll, otherwise false.

  24. def foreach[U](f: (A) ⇒ U): Unit

    Apply f to each element for its side effects Note: [U] parameter needed to help scalac's type inference.

  25. def formatted(fmtstr: String): String

    Returns string formatted according to given format string.

    Returns string formatted according to given format string. Format strings are as for String.format (@see java.lang.String.format).

    Implicit
    This member is added by an implicit conversion from IterableOnceOps[A, CC, C] to StringFormat[IterableOnceOps[A, CC, C]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  26. def hashCode(): Int

    Calculate a hash code value for the object.

    Calculate 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 this object.

    Definition Classes
    Any
  27. def isEmpty: Boolean

    Tests whether the $coll is empty.

    Tests whether the $coll is empty.

    Note: Implementations in subclasses that are not repeatedly traversable must take care not to consume any elements when isEmpty is called.

    returns

    true if the $coll contains no elements, false otherwise.

  28. 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
  29. def knownSize: Int

    The number of elements in this $coll, if it can be cheaply computed, -1 otherwise.

    The number of elements in this $coll, if it can be cheaply computed, -1 otherwise. Cheaply usually means: Not requiring a collection traversal.

  30. def max: A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this $coll.

    Full Signature

    def max[B >: A](implicit ord: math.Ordering[B]): A

    Exceptions thrown

    UnsupportedOperationException if this $coll is empty.

  31. def maxBy[B](f: (A) ⇒ B): A

    [use case] Finds the first element which yields the largest value measured by function f.

    [use case]

    Finds the first element which yields the largest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

    the first element of this $coll with the largest value measured by function f.

    Full Signature

    def maxBy[B](f: (A) ⇒ B)(implicit cmp: math.Ordering[B]): A

    Exceptions thrown

    UnsupportedOperationException if this $coll is empty.

  32. def min: A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this $coll

    Full Signature

    def min[B >: A](implicit ord: math.Ordering[B]): A

    Exceptions thrown

    UnsupportedOperationException if this $coll is empty.

  33. def minBy[B](f: (A) ⇒ B): A

    [use case] Finds the first element which yields the smallest value measured by function f.

    [use case]

    Finds the first element which yields the smallest value measured by function f.

    B

    The result type of the function f.

    f

    The measuring function.

    returns

    the first element of this $coll with the smallest value measured by function f.

    Full Signature

    def minBy[B](f: (A) ⇒ B)(implicit cmp: math.Ordering[B]): A

    Exceptions thrown

    UnsupportedOperationException if this $coll is empty.

  34. def mkString: String

    Displays all elements of this $coll in a string.

    Displays all elements of this $coll in a string.

    returns

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

  35. def mkString(sep: String): String

    Displays all elements of this $coll in a string using a separator string.

    Displays all elements of this $coll in a string using a separator string.

    sep

    the separator string.

    returns

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

    Example:
    1. List(1, 2, 3).mkString("|") = "1|2|3"

  36. def mkString(start: String, sep: String, end: String): String

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

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

    Example:
    1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"

  37. def nonEmpty: Boolean

    Tests whether the $coll is not empty.

    Tests whether the $coll is not empty.

    returns

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

    Annotations
    @deprecatedOverriding( message = ... , since = "2.13.0" )
  38. def product: A

    [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 $coll 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 $coll and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

    Full Signature

    def product[B >: A](implicit num: math.Numeric[B]): B

  39. def reduce[B >: A](op: (B, B) ⇒ B): B

    Reduces the elements of this $coll using the specified associative binary operator.

    Reduces the elements of this $coll using the specified associative binary operator.

    $undefinedorder

    B

    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 $coll is nonempty.

    Exceptions thrown

    UnsupportedOperationException if this $coll is empty.

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

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

    Applies a binary operator to all elements of this $coll, going left to right. $willNotTerminateInf $orderDependentFold

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this $coll, going left to right:

    op( op( ... op(x_1, x_2) ..., x_{n-1}), x_n)

    where x1, ..., xn are the elements of this $coll.

    Exceptions thrown

    UnsupportedOperationException if this $coll is empty.

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

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

    Optionally applies a binary operator to all elements of this $coll, going left to right. $willNotTerminateInf $orderDependentFold

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceLeft(op) if this $coll is nonempty, None otherwise.

  42. def reduceOption[B >: A](op: (B, B) ⇒ B): Option[B]

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

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

    $undefinedorder

    B

    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.

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

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

    Applies a binary operator to all elements of this $coll, going right to left. $willNotTerminateInf $orderDependentFold

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this $coll, going right to left:

    op(x_1, op(x_2, ..., op(x_{n-1}, x_n)...))

    where x1, ..., xn are the elements of this $coll.

    Exceptions thrown

    UnsupportedOperationException if this $coll is empty.

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

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

    Optionally applies a binary operator to all elements of this $coll, going right to left. $willNotTerminateInf $orderDependentFold

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceRight(op) if this $coll is nonempty, None otherwise.

  45. def reversed: Iterable[A]
    Attributes
    protected[this]
  46. def size: Int

    The size of this $coll.

    The size of this $coll.

    $willNotTerminateInf

    returns

    the number of elements in this $coll.

  47. def sum: A

    [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 $coll 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 $coll and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

    Full Signature

    def sum[B >: A](implicit num: math.Numeric[B]): B

  48. def to[C1](factory: Factory[A, C1]): C1

    Given a collection factory factory, convert this collection to the appropriate representation for the current element type A.

    Given a collection factory factory, convert this collection to the appropriate representation for the current element type A. Example uses:

    xs.to(List) xs.to(ArrayBuffer) xs.to(BitSet) // for xs: Iterable[Int]

  49. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]

    Convert collection to array.

  50. def toIndexedSeq: immutable.IndexedSeq[A]
  51. def toList: immutable.List[A]
  52. def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
  53. def toSeq: immutable.Seq[A]

    returns

    This collection as a Seq[A]. This is equivalent to to(Seq) but might be faster.

  54. def toSet[B >: A]: immutable.Set[B]
  55. def toString(): String

    Returns a string representation of the object.

    Returns a string representation of the object.

    The default representation is platform dependent.

    returns

    a string representation of the object.

    Definition Classes
    Any
  56. def toVector: immutable.Vector[A]
  57. def [B](y: B): (IterableOnceOps[A, CC, C], B)
    Implicit
    This member is added by an implicit conversion from IterableOnceOps[A, CC, C] to ArrowAssoc[IterableOnceOps[A, CC, C]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Deprecated Value Members

  1. final def /:[B](z: B)(op: (B, A) ⇒ B): B
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  2. final def :\[B](z: B)(op: (A, B) ⇒ B): B
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  3. final def toBuffer[B >: A]: Buffer[B]
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use ArrayBuffer.from(it) instead of it.toBuffer

  4. final def toIterator: Iterator[A]
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator() instead of .toIterator

  5. final def toStream: immutable.Stream[A]
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use Stream.from(it) instead of it.toStream

Inherited from Any

Inherited by implicit conversion any2stringadd from IterableOnceOps[A, CC, C] to any2stringadd[IterableOnceOps[A, CC, C]]

Inherited by implicit conversion StringFormat from IterableOnceOps[A, CC, C] to StringFormat[IterableOnceOps[A, CC, C]]

Inherited by implicit conversion Ensuring from IterableOnceOps[A, CC, C] to Ensuring[IterableOnceOps[A, CC, C]]

Inherited by implicit conversion ArrowAssoc from IterableOnceOps[A, CC, C] to ArrowAssoc[IterableOnceOps[A, CC, C]]

Ungrouped