Packages

t

strawman.collection

SeqMonoTransforms

trait SeqMonoTransforms[+A, +Repr] extends IterableMonoTransforms[A, Repr]

Type-preserving transforms over sequences.

Linear Supertypes
IterableMonoTransforms[A, Repr], Any
Known Subclasses
ArrayOps, IndexedSeq, LinearSeq, LinearSeqLike, Seq, SeqLike, StringOps, ::, LazyList, Empty, List, Nil, Seq, ArrayBuffer, GrowableSeq, IndexedOptimizedGrowableSeq, IndexedOptimizedSeq, ListBuffer, Seq
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SeqMonoTransforms
  2. IterableMonoTransforms
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def coll: Iterable[A]
    Attributes
    protected
    Definition Classes
    IterableMonoTransforms
  2. abstract def fromIterableWithSameElemType(coll: Iterable[A]): Repr
    Attributes
    protected[this]
    Definition Classes
    IterableMonoTransforms
  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.

    Definition Classes
    IterableMonoTransforms
  6. def equals(arg0: Any): Boolean
    Definition Classes
    Any
  7. def filter(p: (A) ⇒ Boolean): Repr

    All elements satisfying predicate p

    All elements satisfying predicate p

    Definition Classes
    IterableMonoTransforms
  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.

    Definition Classes
    IterableMonoTransforms
  11. def reverse: Repr
  12. def tail: Repr

    The rest of the collection without its first element.

    The rest of the collection without its first element.

    Definition Classes
    IterableMonoTransforms
  13. def take(n: Int): Repr

    A collection containing the first n elements of this collection.

    A collection containing the first n elements of this collection.

    Definition Classes
    IterableMonoTransforms
  14. def toString(): String
    Definition Classes
    Any

Inherited from IterableMonoTransforms[A, Repr]

Inherited from Any

Ungrouped