strawman.collections.CollectionStrawMan6

IterableMonoTransforms

Related Doc: package CollectionStrawMan6

trait IterableMonoTransforms[+A, +Repr] extends Any

Type-preserving transforms over iterables. Operations defined here return in their result iterables of the same type as the one they are invoked on.

Linear Supertypes
Any
Known Subclasses
::, ArrayBuffer, ArrayBufferView, ArrayOps, ArrayView, Buildable, Concat, Drop, Drop, Elems, Empty, Empty, Filter, FlatMap, IndexedView, Iterable, IterableLike, LazyList, LinearSeq, LinearSeqLike, List, ListBuffer, Map, Map, Nil, Partitioned, Reverse, Seq, SeqLike, SeqMonoTransforms, StringOps, StringView, Take, Take, View, Zip
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. IterableMonoTransforms
  2. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def coll: Iterable[A]

    Attributes
    protected

  2. abstract def fromIterableWithSameElemType(coll: Iterable[A]): Repr

    Attributes
    protected[this]

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

    Definition Classes
    Any

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  2. final def ##(): Int

    Definition Classes
    Any

  3. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  4. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  5. def drop(n: Int): Repr

    The rest of the collection without its n first elements.

    The rest of the collection without its n first elements. For linear, immutable collections this should avoid making a copy.

  6. def equals(arg0: Any): Boolean

    Definition Classes
    Any

  7. def filter(p: (A) ⇒ Boolean): Repr

    All elements satisfying predicate p

  8. def hashCode(): Int

    Definition Classes
    Any

  9. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  10. def partition(p: (A) ⇒ Boolean): (Repr, Repr)

    A pair of, first, all elements that satisfy prediacte p and, second, all elements that do not.

    A pair of, first, all elements that satisfy prediacte p and, second, all elements that do not. Interesting because it splits a collection in two.

    The default implementation provided here needs to traverse the collection twice. Strict collections have an overridden version of partition in Buildable, which requires only a single traversal.

  11. def tail: Repr

    The rest of the collection without its first element.

  12. def take(n: Int): Repr

    A collection containing the first n elements of this collection.

  13. def toString(): String

    Definition Classes
    Any

Inherited from Any

Ungrouped