Scala Standard Library 2.13.1 - scala.collection.AbstractIterable (original) (raw)
abstract class AbstractIterable[+A] extends Iterable[A]
Ordering
- Alphabetic
- By Inheritance
Inherited
- AbstractIterable
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
Implicitly
by iterableOnceExtensionMethods
by any2stringadd
by StringFormat
by Ensuring
by ArrowAssoc
Hide All
Show All
Visibility
- Public
- Protected
Instance Constructors
- new AbstractIterable()
Abstract Value Members
Concrete Value Members
- final def !=(arg0: Any): Boolean
- final def ##(): Int
- def +(other: String): String
- final def ++[B >: A](suffix: IterableOnce[B]): Iterable[B]
- def ->[B](y: B): (AbstractIterable[A], B)
- final def ==(arg0: Any): Boolean
- final def addString(b: mutable.StringBuilder): mutable.StringBuilder
- final def addString(b: mutable.StringBuilder, sep: String): mutable.StringBuilder
- def addString(b: mutable.StringBuilder, start: String, sep: String, end: String): mutable.StringBuilder
- final def asInstanceOf[T0]: T0
- def className: String
- def clone(): AnyRef
- final def coll: AbstractIterable.this.type
- def collect[B](pf: PartialFunction[A, B]): Iterable[B]
- def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
- def concat[B >: A](suffix: IterableOnce[B]): Iterable[B]
- def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Int
- def copyToArray[B >: A](xs: Array[B], start: Int): Int
- def copyToArray[B >: A](xs: Array[B]): Int
- def corresponds[B](that: IterableOnce[B])(p: (A, B) => Boolean): Boolean
- def count(p: (A) => Boolean): Int
- def drop(n: Int): Iterable[A]
- def dropRight(n: Int): Iterable[A]
- def dropWhile(p: (A) => Boolean): Iterable[A]
- def empty: Iterable[A]
- def ensuring(cond: (AbstractIterable[A]) => Boolean, msg: => Any): AbstractIterable[A]
- def ensuring(cond: (AbstractIterable[A]) => Boolean): AbstractIterable[A]
- def ensuring(cond: Boolean, msg: => Any): AbstractIterable[A]
- def ensuring(cond: Boolean): AbstractIterable[A]
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- def exists(p: (A) => Boolean): Boolean
- def filter(pred: (A) => Boolean): Iterable[A]
- def filterNot(pred: (A) => Boolean): Iterable[A]
- def finalize(): Unit
- def find(p: (A) => Boolean): Option[A]
- def flatMap[B](f: (A) => IterableOnce[B]): Iterable[B]
- def flatten[B](implicit asIterable: (A) => IterableOnce[B]): Iterable[B]
- def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
- def foldLeft[B](z: B)(op: (B, A) => B): B
- def foldRight[B](z: B)(op: (A, B) => B): B
- def forall(p: (A) => Boolean): Boolean
- def foreach[U](f: (A) => U): Unit
- def formatted(fmtstr: String): String
- def fromSpecific(coll: IterableOnce[A]): Iterable[A]
- final def getClass(): Class[_ <: AnyRef]
- def groupBy[K](f: (A) => K): immutable.Map[K, Iterable[A]]
- def groupMap[K, B](key: (A) => K)(f: (A) => B): immutable.Map[K, Iterable[B]]
- def groupMapReduce[K, B](key: (A) => K)(f: (A) => B)(reduce: (B, B) => B): immutable.Map[K, B]
- def grouped(size: Int): Iterator[Iterable[A]]
- def hashCode(): Int
- def head: A
- def headOption: Option[A]
- def init: Iterable[A]
- def inits: Iterator[Iterable[A]]
- def isEmpty: Boolean
- final def isInstanceOf[T0]: Boolean
- def isTraversableAgain: Boolean
- def iterableFactory: IterableFactory[Iterable]
- def knownSize: Int
- def last: A
- def lastOption: Option[A]
- def lazyZip[B](that: Iterable[B]): LazyZip2[A, B, AbstractIterable.this.type]
- def map[B](f: (A) => B): Iterable[B]
- def max[B >: A](implicit ord: math.Ordering[B]): A
- def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
- def maxByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
- def maxOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
- def min[B >: A](implicit ord: math.Ordering[B]): A
- def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
- def minByOption[B](f: (A) => B)(implicit cmp: math.Ordering[B]): Option[A]
- def minOption[B >: A](implicit ord: math.Ordering[B]): Option[A]
- final def mkString: String
- final def mkString(sep: String): String
- final def mkString(start: String, sep: String, end: String): String
- final def ne(arg0: AnyRef): Boolean
- def newSpecificBuilder: Builder[A, Iterable[A]]
- def nonEmpty: Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- def partition(p: (A) => Boolean): (Iterable[A], Iterable[A])
- def partitionMap[A1, A2](f: (A) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
- def product[B >: A](implicit num: math.Numeric[B]): B
- def reduce[B >: A](op: (B, B) => B): B
- def reduceLeft[B >: A](op: (B, A) => B): B
- def reduceLeftOption[B >: A](op: (B, A) => B): Option[B]
- def reduceOption[B >: A](op: (B, B) => B): Option[B]
- def reduceRight[B >: A](op: (A, B) => B): B
- def reduceRightOption[B >: A](op: (A, B) => B): Option[B]
- def reversed: Iterable[A]
- def scan[B >: A](z: B)(op: (B, B) => B): Iterable[B]
- def scanLeft[B](z: B)(op: (B, A) => B): Iterable[B]
- def scanRight[B](z: B)(op: (A, B) => B): Iterable[B]
- def size: Int
- def sizeCompare(that: Iterable[_]): Int
- def sizeCompare(otherSize: Int): Int
- final def sizeIs: SizeCompareOps
- def slice(from: Int, until: Int): Iterable[A]
- def sliding(size: Int, step: Int): Iterator[Iterable[A]]
- def sliding(size: Int): Iterator[Iterable[A]]
- def span(p: (A) => Boolean): (Iterable[A], Iterable[A])
- def splitAt(n: Int): (Iterable[A], Iterable[A])
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[A, S]): S
- def stringPrefix: String
- def sum[B >: A](implicit num: math.Numeric[B]): B
- final def synchronized[T0](arg0: => T0): T0
- def tail: Iterable[A]
- def tails: Iterator[Iterable[A]]
- def take(n: Int): Iterable[A]
- def takeRight(n: Int): Iterable[A]
- def takeWhile(p: (A) => Boolean): Iterable[A]
- def tapEach[U](f: (A) => U): Iterable[A]
- def to[C1](factory: Factory[A, C1]): C1
- def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
- final def toBuffer[B >: A]: Buffer[B]
- def toIndexedSeq: immutable.IndexedSeq[A]
- final def toIterable: AbstractIterable.this.type
- def toList: immutable.List[A]
- def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
- def toSeq: immutable.Seq[A]
- def toSet[B >: A]: immutable.Set[B]
- def toString(): String
- def toVector: immutable.Vector[A]
- def transpose[B](implicit asIterable: (A) => Iterable[B]): Iterable[Iterable[B]]
- def unzip[A1, A2](implicit asPair: (A) => (A1, A2)): (Iterable[A1], Iterable[A2])
- def unzip3[A1, A2, A3](implicit asTriple: (A) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
- def view: View[A]
- final def wait(): Unit
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- def withFilter(p: (A) => Boolean): WithFilter[A, Iterable]
- def zip[B](that: IterableOnce[B]): Iterable[(A, B)]
- def zipAll[A1 >: A, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
- def zipWithIndex: Iterable[(A, Int)]
Deprecated Value Members
- def ++:[B >: A](that: IterableOnce[B]): Iterable[B]
- def /:[B](z: B)(op: (B, A) => B): B
- final def /:[B](z: B)(op: (B, A) => B): B
- def :\[B](z: B)(op: (A, B) => B): B
- final def :\[B](z: B)(op: (A, B) => B): B
- def aggregate[B](z: => B)(seqop: (B, A) => B, combop: (B, B) => B): B
- def collectFirst[B](f: PartialFunction[A, B]): Option[B]
- def companion: IterableFactory[Iterable]
- def copyToBuffer(dest: Buffer[A]): Unit
- final def copyToBuffer[B >: A](dest: Buffer[B]): Unit
- def count(f: (A) => Boolean): Int
- def exists(f: (A) => Boolean): Boolean
- def filter(f: (A) => Boolean): Iterator[A]
- def find(p: (A) => Boolean): Option[A]
- def flatMap[B](f: (A) => IterableOnce[B]): IterableOnce[B]
- def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
- def foldLeft[B](z: B)(op: (B, A) => B): B
- def foldRight[B](z: B)(op: (A, B) => B): B
- def forall(f: (A) => Boolean): Boolean
- def foreach[U](f: (A) => U): Unit
- def hasDefiniteSize: Boolean
- def isEmpty: Boolean
- def map[B](f: (A) => B): IterableOnce[B]
- def max(implicit ord: math.Ordering[A]): A
- def maxBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
- def min(implicit ord: math.Ordering[A]): A
- def minBy[B](f: (A) => B)(implicit cmp: math.Ordering[B]): A
- def mkString: String
- def mkString(sep: String): String
- def mkString(start: String, sep: String, end: String): String
- def nonEmpty: Boolean
- def product(implicit num: math.Numeric[A]): A
- def reduce(f: (A, A) => A): A
- def reduceLeft(f: (A, A) => A): A
- def reduceLeftOption(f: (A, A) => A): Option[A]
- def reduceOption(f: (A, A) => A): Option[A]
- def reduceRight(f: (A, A) => A): A
- def reduceRightOption(f: (A, A) => A): Option[A]
- final def repr: Iterable[A]
- def sameElements[B >: A](that: IterableOnce[B]): Boolean
- def seq: AbstractIterable.this.type
- def size: Int
- def sum(implicit num: math.Numeric[A]): A
- def to[C1](factory: Factory[A, C1]): C1
- def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
- def toBuffer[B >: A]: Buffer[B]
- def toIndexedSeq: IndexedSeq[A]
- final def toIterable: Iterable[A]
- def toIterator: Iterator[A]
- final def toIterator: Iterator[A]
- def toList: immutable.List[A]
- def toMap[K, V](implicit ev: <:<[A, (K, V)]): immutable.Map[K, V]
- def toSeq: immutable.Seq[A]
- def toSet[B >: A]: immutable.Set[B]
- def toStream: immutable.Stream[A]
- final def toStream: immutable.Stream[A]
- final def toTraversable: Traversable[A]
- final def toTraversable: Traversable[A]
- def toVector: immutable.Vector[A]
- def view(from: Int, until: Int): View[A]
- def withFilter(f: (A) => Boolean): Iterator[A]
- def →[B](y: B): (AbstractIterable[A], B)