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
- Alphabetic
- By Inheritance
Inherited
- Source
- Closeable
- AutoCloseable
- Iterator
- TraversableOnce
- GenTraversableOnce
- AnyRef
- Any
Implicitly
- by MonadOps
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- by alternateImplicit
Instance Constructors
- î
new Source()
Concrete Value Members
- î
final def !=(arg0: Any): Boolean
- î
final def ##(): Int
- î
def +(other: String): String
- î
def ++(that: â collection.Iterator[Char]): collection.Iterator[Char]
- î
def ->[B](y: B): (Source, B)
- î
final def ==(arg0: Any): Boolean
- î
def addString(b: StringBuilder): StringBuilder
- î
def addString(b: StringBuilder, sep: String): StringBuilder
- î
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- î
def aggregate[B](z: â B)(seqop: (B, Char) â B, combop: (B, B) â B): B
- î
final def asInstanceOf[T0]: T0
- î
def buffered: collection.BufferedIterator[Char]
- î
def ch: Char
- î
def clone(): AnyRef
- î
def close(): Unit
- î
def collect[B](pf: PartialFunction[Char, B]): collection.Iterator[B]
- î
def collectFirst[B](pf: PartialFunction[Char, B]): Option[B]
- î
def contains(elem: Any): Boolean
- î
def copyToArray(xs: Array[Char], start: Int, len: Int): Unit
- î
def copyToArray(xs: Array[A]): Unit
- î
def copyToArray(xs: Array[A], start: Int): Unit
- î
def copyToBuffer[B >: Char](dest: Buffer[B]): Unit
- î
def corresponds[B](that: GenTraversableOnce[B])(p: (Char, B) â Boolean): Boolean
- î
def count(p: (Char) â Boolean): Int
- î
var descr: String
- î
def drop(n: Int): collection.Iterator[Char]
- î
def dropWhile(p: (Char) â Boolean): collection.Iterator[Char]
- î
def duplicate: (collection.Iterator[Char], collection.Iterator[Char])
- î
def ensuring(cond: (Source) â Boolean, msg: â Any): Source
- î
def ensuring(cond: (Source) â Boolean): Source
- î
def ensuring(cond: Boolean, msg: â Any): Source
- î
def ensuring(cond: Boolean): Source
- î
final def eq(arg0: AnyRef): Boolean
- î
def equals(arg0: Any): Boolean
- î
def exists(p: (Char) â Boolean): Boolean
- î
def filter(p: (Char) â Boolean): collection.Iterator[Char]
- î
def filterNot(p: (Char) â Boolean): collection.Iterator[Char]
- î
def finalize(): Unit
- î
def find(p: (Char) â Boolean): Option[Char]
- î
def flatMap[B](f: (Char) â GenTraversableOnce[B]): collection.Iterator[B]
- î
def fold[A1 >: Char](z: A1)(op: (A1, A1) â A1): A1
- î
def foldLeft[B](z: B)(op: (B, Char) â B): B
- î
def foldRight[B](z: B)(op: (Char, B) â B): B
- î
def forall(p: (Char) â Boolean): Boolean
- î
def foreach(f: (Char) â Unit): Unit
- î
def formatted(fmtstr: String): String
- î
final def getClass(): Class[_]
- î
def getLines(): Iterator[String]
- î
def grouped[B >: Char](size: Int): GroupedIterator[B]
- î
def hasDefiniteSize: Boolean
- î
def hasNext: Boolean
- î
def hashCode(): Int
- î
def indexOf[B >: Char](elem: B, from: Int): Int
- î
def indexOf[B >: Char](elem: B): Int
- î
def indexWhere(p: (Char) â Boolean, from: Int): Int
- î
def indexWhere(p: (Char) â Boolean): Int
- î
def isEmpty: Boolean
- î
final def isInstanceOf[T0]: Boolean
- î
def isTraversableAgain: Boolean
- î
def length: Int
- î
def map[B](f: (Char) â B): collection.Iterator[B]
- î
def max: A
- î
def maxBy[B](f: (A) â B): A
- î
def min: A
- î
def minBy[B](f: (A) â B): A
- î
def mkString: String
- î
def mkString(sep: String): String
- î
def mkString(start: String, sep: String, end: String): String
- î
final def ne(arg0: AnyRef): Boolean
- î
var nerrors: Int
- î
def next(): Char
- î
def nonEmpty: Boolean
- î
final def notify(): Unit
- î
final def notifyAll(): Unit
- î
var nwarnings: Int
- î
def padTo(len: Int, elem: Char): collection.Iterator[Char]
- î
def partition(p: (Char) â Boolean): (collection.Iterator[Char], collection.Iterator[Char])
- î
def patch[B >: Char](from: Int, patchElems: collection.Iterator[B], replaced: Int): collection.Iterator[B]
- î
def pos: Int
- î
def product: A
- î
def reduce[A1 >: Char](op: (A1, A1) â A1): A1
- î
def reduceLeft[B >: Char](op: (B, Char) â B): B
- î
def reduceLeftOption[B >: Char](op: (B, Char) â B): Option[B]
- î
def reduceOption[A1 >: Char](op: (A1, A1) â A1): Option[A1]
- î
def reduceRight[B >: Char](op: (Char, B) â B): B
- î
def reduceRightOption[B >: Char](op: (Char, B) â B): Option[B]
- î
def report(pos: Int, msg: String, out: PrintStream): Unit
- î
def reportError(pos: Int, msg: String, out: PrintStream = Console.err): Unit
- î
def reportWarning(pos: Int, msg: String, out: PrintStream = Console.out): Unit
- î
def reset(): Source
- î
def reversed: List[Char]
- î
def sameElements(that: collection.Iterator[_]): Boolean
- î
def scanLeft[B](z: B)(op: (B, Char) â B): collection.Iterator[B]
- î
def scanRight[B](z: B)(op: (Char, B) â B): collection.Iterator[B]
- î
def seq: collection.Iterator[Char]
- î
def size: Int
- î
def sizeHintIfCheap: Int
- î
def slice(from: Int, until: Int): collection.Iterator[Char]
- î
def sliceIterator(from: Int, until: Int): collection.Iterator[Char]
- î
def sliding[B >: Char](size: Int, step: Int = 1): GroupedIterator[B]
- î
def span(p: (Char) â Boolean): (collection.Iterator[Char], collection.Iterator[Char])
- î
def sum: A
- î
final def synchronized[T0](arg0: â T0): T0
- î
def take(n: Int): collection.Iterator[Char]
- î
def takeWhile(p: (Char) â Boolean): collection.Iterator[Char]
- î
def to[Col[_]]: Col[A]
- î
def toArray: Array[A]
- î
def toBuffer[B >: Char]: Buffer[B]
- î
def toIndexedSeq: collection.immutable.IndexedSeq[Char]
- î
def toIterable: collection.Iterable[Char]
- î
def toIterator: collection.Iterator[Char]
- î
def toList: List[Char]
- î
def toMap[T, U]: Map[T, U]
- î
def toSeq: collection.Seq[Char]
- î
def toSet[B >: Char]: Set[B]
- î
def toStream: collection.immutable.Stream[Char]
- î
def toString(): String
- î
def toTraversable: collection.Traversable[Char]
- î
def toVector: Vector[Char]
- î
final def wait(): Unit
- î
final def wait(arg0: Long, arg1: Int): Unit
- î
final def wait(arg0: Long): Unit
- î
def withClose(f: () â Unit): Source.this.type
- î
def withDescription(text: String): Source.this.type
- î
def withFilter(p: (Char) â Boolean): collection.Iterator[Char]
- î
def withPositioning(pos: Positioner): Source.this.type
- î
def withPositioning(on: Boolean): Source.this.type
- î
def withReset(f: () â Source): Source.this.type
- î
def zip[B](that: collection.Iterator[B]): collection.Iterator[(Char, B)]
- î
def zipAll[B](that: collection.Iterator[B], thisElem: Char, thatElem: B): collection.Iterator[(Char, B)]
- î
def zipWithIndex: collection.Iterator[(Char, Int)]
- î
def â[B](y: B): (Source, B)
- î
object NoPositioner extends Positioner
- î
object RelaxedPosition extends Position
- î
object RelaxedPositioner extends Positioner
Deprecated Value Members
- î
def /:[B](z: B)(op: (B, Char) â B): B
- î
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