A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from http://www.scala-lang.org/api/2.12.15/scala/io/Source.html below:

Scala Standard Library 2.12.15 - scala.io.Source

abstract class Source extends Iterator[Char] with Closeable

 

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Source
  2. Closeable
  3. AutoCloseable
  4. Iterator
  5. TraversableOnce
  6. GenTraversableOnce
  7. AnyRef
  8. Any
Implicitly
  1. by MonadOps
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
  6. by alternateImplicit
Instance Constructors
  1.  new Source()
Concrete Value Members
  1.  final def !=(arg0: Any): Boolean
  2.  final def ##(): Int
  3.  def +(other: String): String
  4.  def ++(that: ⇒ collection.Iterator[Char]): collection.Iterator[Char]
  5.  def ->[B](y: B): (Source, B)
  6.  final def ==(arg0: Any): Boolean
  7.  def addString(b: StringBuilder): StringBuilder
  8.  def addString(b: StringBuilder, sep: String): StringBuilder
  9.  def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
  10.  def aggregate[B](z: ⇒ B)(seqop: (B, Char) ⇒ B, combop: (B, B) ⇒ B): B
  11.  final def asInstanceOf[T0]: T0
  12.  def buffered: collection.BufferedIterator[Char]
  13.  def ch: Char
  14.  def clone(): AnyRef
  15.  def close(): Unit
  16.  def collect[B](pf: PartialFunction[Char, B]): collection.Iterator[B]
  17.  def collectFirst[B](pf: PartialFunction[Char, B]): Option[B]
  18.  def contains(elem: Any): Boolean
  19.  def copyToArray(xs: Array[Char], start: Int, len: Int): Unit
  20.  def copyToArray(xs: Array[A]): Unit
  21.  def copyToArray(xs: Array[A], start: Int): Unit
  22.  def copyToBuffer[B >: Char](dest: Buffer[B]): Unit
  23.  def corresponds[B](that: GenTraversableOnce[B])(p: (Char, B) ⇒ Boolean): Boolean
  24.  def count(p: (Char) ⇒ Boolean): Int
  25.  var descr: String
  26.  def drop(n: Int): collection.Iterator[Char]
  27.  def dropWhile(p: (Char) ⇒ Boolean): collection.Iterator[Char]
  28.  def duplicate: (collection.Iterator[Char], collection.Iterator[Char])
  29.  def ensuring(cond: (Source) ⇒ Boolean, msg: ⇒ Any): Source
  30.  def ensuring(cond: (Source) ⇒ Boolean): Source
  31.  def ensuring(cond: Boolean, msg: ⇒ Any): Source
  32.  def ensuring(cond: Boolean): Source
  33.  final def eq(arg0: AnyRef): Boolean
  34.  def equals(arg0: Any): Boolean
  35.  def exists(p: (Char) ⇒ Boolean): Boolean
  36.  def filter(p: (Char) ⇒ Boolean): collection.Iterator[Char]
  37.  def filterNot(p: (Char) ⇒ Boolean): collection.Iterator[Char]
  38.  def finalize(): Unit
  39.  def find(p: (Char) ⇒ Boolean): Option[Char]
  40.  def flatMap[B](f: (Char) ⇒ GenTraversableOnce[B]): collection.Iterator[B]
  41.  def fold[A1 >: Char](z: A1)(op: (A1, A1) ⇒ A1): A1
  42.  def foldLeft[B](z: B)(op: (B, Char) ⇒ B): B
  43.  def foldRight[B](z: B)(op: (Char, B) ⇒ B): B
  44.  def forall(p: (Char) ⇒ Boolean): Boolean
  45.  def foreach(f: (Char) ⇒ Unit): Unit
  46.  def formatted(fmtstr: String): String
  47.  final def getClass(): Class[_]
  48.  def getLines(): Iterator[String]
  49.  def grouped[B >: Char](size: Int): GroupedIterator[B]
  50.  def hasDefiniteSize: Boolean
  51.  def hasNext: Boolean
  52.  def hashCode(): Int
  53.  def indexOf[B >: Char](elem: B, from: Int): Int
  54.  def indexOf[B >: Char](elem: B): Int
  55.  def indexWhere(p: (Char) ⇒ Boolean, from: Int): Int
  56.  def indexWhere(p: (Char) ⇒ Boolean): Int
  57.  def isEmpty: Boolean
  58.  final def isInstanceOf[T0]: Boolean
  59.  def isTraversableAgain: Boolean
  60.  def length: Int
  61.  def map[B](f: (Char) ⇒ B): collection.Iterator[B]
  62.  def max: A
  63.  def maxBy[B](f: (A) ⇒ B): A
  64.  def min: A
  65.  def minBy[B](f: (A) ⇒ B): A
  66.  def mkString: String
  67.  def mkString(sep: String): String
  68.  def mkString(start: String, sep: String, end: String): String
  69.  final def ne(arg0: AnyRef): Boolean
  70.  var nerrors: Int
  71.  def next(): Char
  72.  def nonEmpty: Boolean
  73.  final def notify(): Unit
  74.  final def notifyAll(): Unit
  75.  var nwarnings: Int
  76.  def padTo(len: Int, elem: Char): collection.Iterator[Char]
  77.  def partition(p: (Char) ⇒ Boolean): (collection.Iterator[Char], collection.Iterator[Char])
  78.  def patch[B >: Char](from: Int, patchElems: collection.Iterator[B], replaced: Int): collection.Iterator[B]
  79.  def pos: Int
  80.  def product: A
  81.  def reduce[A1 >: Char](op: (A1, A1) ⇒ A1): A1
  82.  def reduceLeft[B >: Char](op: (B, Char) ⇒ B): B
  83.  def reduceLeftOption[B >: Char](op: (B, Char) ⇒ B): Option[B]
  84.  def reduceOption[A1 >: Char](op: (A1, A1) ⇒ A1): Option[A1]
  85.  def reduceRight[B >: Char](op: (Char, B) ⇒ B): B
  86.  def reduceRightOption[B >: Char](op: (Char, B) ⇒ B): Option[B]
  87.  def report(pos: Int, msg: String, out: PrintStream): Unit
  88.  def reportError(pos: Int, msg: String, out: PrintStream = Console.err): Unit
  89.  def reportWarning(pos: Int, msg: String, out: PrintStream = Console.out): Unit
  90.  def reset(): Source
  91.  def reversed: List[Char]
  92.  def sameElements(that: collection.Iterator[_]): Boolean
  93.  def scanLeft[B](z: B)(op: (B, Char) ⇒ B): collection.Iterator[B]
  94.  def scanRight[B](z: B)(op: (Char, B) ⇒ B): collection.Iterator[B]
  95.  def seq: collection.Iterator[Char]
  96.  def size: Int
  97.  def sizeHintIfCheap: Int
  98.  def slice(from: Int, until: Int): collection.Iterator[Char]
  99.  def sliceIterator(from: Int, until: Int): collection.Iterator[Char]
  100.  def sliding[B >: Char](size: Int, step: Int = 1): GroupedIterator[B]
  101.  def span(p: (Char) ⇒ Boolean): (collection.Iterator[Char], collection.Iterator[Char])
  102.  def sum: A
  103.  final def synchronized[T0](arg0: ⇒ T0): T0
  104.  def take(n: Int): collection.Iterator[Char]
  105.  def takeWhile(p: (Char) ⇒ Boolean): collection.Iterator[Char]
  106.  def to[Col[_]]: Col[A]
  107.  def toArray: Array[A]
  108.  def toBuffer[B >: Char]: Buffer[B]
  109.  def toIndexedSeq: collection.immutable.IndexedSeq[Char]
  110.  def toIterable: collection.Iterable[Char]
  111.  def toIterator: collection.Iterator[Char]
  112.  def toList: List[Char]
  113.  def toMap[T, U]: Map[T, U]
  114.  def toSeq: collection.Seq[Char]
  115.  def toSet[B >: Char]: Set[B]
  116.  def toStream: collection.immutable.Stream[Char]
  117.  def toString(): String
  118.  def toTraversable: collection.Traversable[Char]
  119.  def toVector: Vector[Char]
  120.  final def wait(): Unit
  121.  final def wait(arg0: Long, arg1: Int): Unit
  122.  final def wait(arg0: Long): Unit
  123.  def withClose(f: () ⇒ Unit): Source.this.type
  124.  def withDescription(text: String): Source.this.type
  125.  def withFilter(p: (Char) ⇒ Boolean): collection.Iterator[Char]
  126.  def withPositioning(pos: Positioner): Source.this.type
  127.  def withPositioning(on: Boolean): Source.this.type
  128.  def withReset(f: () ⇒ Source): Source.this.type
  129.  def zip[B](that: collection.Iterator[B]): collection.Iterator[(Char, B)]
  130.  def zipAll[B](that: collection.Iterator[B], thisElem: Char, thatElem: B): collection.Iterator[(Char, B)]
  131.  def zipWithIndex: collection.Iterator[(Char, Int)]
  132.  def →[B](y: B): (Source, B)
  133.  object NoPositioner extends Positioner
  134.  object RelaxedPosition extends Position
  135.  object RelaxedPositioner extends Positioner
Deprecated Value Members
  1.  def /:[B](z: B)(op: (B, Char) ⇒ B): B
  2.  def :\[B](z: B)(op: (Char, B) ⇒ B): B

Inherited from Closeable

Inherited from AutoCloseable


RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4