Showing content from https://www.scala-lang.org/api/2.11.12/scala-compiler/scala/tools/nsc/util/JavaCharArrayReader.html below:
JavaCharArrayReader - Scala Compiler 2.11.12
final def !=(arg0: Any): Boolean
final def ##(): Int
def +(other: String): String
def ++[B >: Char](that: â GenTraversableOnce[B]): collection.Iterator[B]
def ->[B](y: B): (JavaCharArrayReader, B)
def /:[B](z: B)(op: (B, Char) â B): B
def :\[B](z: B)(op: (Char, B) â B): 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
var bp: Int
def buffered: collection.BufferedIterator[Char]
var ch: Char
def clone(): AnyRef
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 copy: JavaCharArrayReader
def copyToArray[B >: Char](xs: Array[B], start: Int, len: Int): Unit
def copyToArray[B >: Char](xs: Array[B]): Unit
def copyToArray[B >: Char](xs: Array[B], 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
def cpos: Int
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: (JavaCharArrayReader) â Boolean, msg: â Any): JavaCharArrayReader
def ensuring(cond: (JavaCharArrayReader) â Boolean): JavaCharArrayReader
def ensuring(cond: Boolean, msg: â Any): JavaCharArrayReader
def ensuring(cond: Boolean): JavaCharArrayReader
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[U](f: (Char) â U): Unit
def formatted(fmtstr: String): String
final def getClass(): Class[_]
def grouped[B >: Char](size: Int): GroupedIterator[B]
def hasDefiniteSize: Boolean
def hasNext: Boolean
def hashCode(): Int
def indexOf[B >: Char](elem: B): Int
def indexWhere(p: (Char) â Boolean): Int
def isEmpty: Boolean
final def isInstanceOf[T0]: Boolean
def isTraversableAgain: Boolean
var isUnicode: Boolean
def length: Int
def map[B](f: (Char) â B): collection.Iterator[B]
def max[B >: Char](implicit cmp: Ordering[B]): Char
def maxBy[B](f: (Char) â B)(implicit cmp: Ordering[B]): Char
def min[B >: Char](implicit cmp: Ordering[B]): Char
def minBy[B](f: (Char) â B)(implicit cmp: Ordering[B]): Char
def mkString: String
def mkString(sep: String): String
def mkString(start: String, sep: String, end: String): String
final def ne(arg0: AnyRef): Boolean
def next(): Char
def nonEmpty: Boolean
final def notify(): Unit
final def notifyAll(): Unit
def padTo[A1 >: Char](len: Int, elem: A1): collection.Iterator[A1]
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 product[B >: Char](implicit num: Numeric[B]): B
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 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 slice(from: Int, until: Int): collection.Iterator[Char]
def sliding[B >: Char](size: Int, step: Int): GroupedIterator[B]
def span(p: (Char) â Boolean): (collection.Iterator[Char], collection.Iterator[Char])
def sum[B >: Char](implicit num: Numeric[B]): B
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[_]](implicit cbf: CanBuildFrom[Nothing, Char, Col[Char]]): Col[Char]
def toArray[B >: Char](implicit arg0: ClassTag[B]): Array[B]
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](implicit ev: <:<[Char, (T, U)]): Map[T, U]
def toSeq: collection.Seq[Char]
def toSet[B >: Char]: collection.immutable.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 withFilter(p: (Char) â Boolean): collection.Iterator[Char]
def zip[B](that: collection.Iterator[B]): collection.Iterator[(Char, B)]
def zipAll[B, A1 >: Char, B1 >: B](that: collection.Iterator[B], thisElem: A1, thatElem: B1): collection.Iterator[(A1, B1)]
def zipWithIndex: collection.Iterator[(Char, Int)]
def â[B](y: B): (JavaCharArrayReader, B)
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