A RetroSearch Logo

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

Search Query:

Showing content from https://www.scala-lang.org/api/2.11.12/scala-compiler/scala/tools/nsc/io/Jar.html below:

Jar - Scala Compiler 2.11.12

  • final def !=(arg0: Any): Boolean
  • final def ##(): Int
  • def +(other: String): String
  • def ++[B >: JarEntry, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[collection.Iterable[JarEntry], B, That]): That
  • def ++:[B >: JarEntry, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[collection.Iterable[JarEntry], B, That]): That
  • def ++:[B >: JarEntry, That](that: collection.TraversableOnce[B])(implicit bf: CanBuildFrom[collection.Iterable[JarEntry], B, That]): That
  • def ->[B](y: B): (Jar, B)
  • def /:[B](z: B)(op: (B, JarEntry) ⇒ B): B
  • def :\[B](z: B)(op: (JarEntry, 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, JarEntry) ⇒ B, combop: (B, B) ⇒ B): B
  • final def asInstanceOf[T0]: T0
  • def canEqual(that: Any): Boolean
  • def classPathElements: List[String]
  • def classPathString: Option[String]
  • def clone(): AnyRef
  • def collect[B, That](pf: PartialFunction[JarEntry, B])(implicit bf: CanBuildFrom[collection.Iterable[JarEntry], B, That]): That
  • def collectFirst[B](pf: PartialFunction[JarEntry, B]): Option[B]
  • def companion: GenericCompanion[collection.Iterable]
  • def copyToArray[B >: JarEntry](xs: Array[B], start: Int, len: Int): Unit
  • def copyToArray[B >: JarEntry](xs: Array[B]): Unit
  • def copyToArray[B >: JarEntry](xs: Array[B], start: Int): Unit
  • def copyToBuffer[B >: JarEntry](dest: Buffer[B]): Unit
  • def count(p: (JarEntry) ⇒ Boolean): Int
  • def drop(n: Int): collection.Iterable[JarEntry]
  • def dropRight(n: Int): collection.Iterable[JarEntry]
  • def dropWhile(p: (JarEntry) ⇒ Boolean): collection.Iterable[JarEntry]
  • def ensuring(cond: (Jar) ⇒ Boolean, msg: ⇒ Any): Jar
  • def ensuring(cond: (Jar) ⇒ Boolean): Jar
  • def ensuring(cond: Boolean, msg: ⇒ Any): Jar
  • def ensuring(cond: Boolean): Jar
  • final def eq(arg0: AnyRef): Boolean
  • def equals(arg0: Any): Boolean
  • def exists(p: (JarEntry) ⇒ Boolean): Boolean
  • def filter(p: (JarEntry) ⇒ Boolean): collection.Iterable[JarEntry]
  • def filterNot(p: (JarEntry) ⇒ Boolean): collection.Iterable[JarEntry]
  • def finalize(): Unit
  • def find(p: (JarEntry) ⇒ Boolean): Option[JarEntry]
  • def flatMap[B, That](f: (JarEntry) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[collection.Iterable[JarEntry], B, That]): That
  • def flatten[B](implicit asTraversable: (JarEntry) ⇒ GenTraversableOnce[B]): collection.Iterable[B]
  • def fold[A1 >: JarEntry](z: A1)(op: (A1, A1) ⇒ A1): A1
  • def foldLeft[B](z: B)(op: (B, JarEntry) ⇒ B): B
  • def foldRight[B](z: B)(op: (JarEntry, B) ⇒ B): B
  • def forall(p: (JarEntry) ⇒ Boolean): Boolean
  • def foreach[U](f: (JarEntry) ⇒ U): Unit
  • def formatted(fmtstr: String): String
  • def genericBuilder[B]: Builder[B, collection.Iterable[B]]
  • final def getClass(): Class[_]
  • def groupBy[K](f: (JarEntry) ⇒ K): Map[K, collection.Iterable[JarEntry]]
  • def grouped(size: Int): collection.Iterator[collection.Iterable[JarEntry]]
  • def hasDefiniteSize: Boolean
  • def hashCode(): Int
  • def head: JarEntry
  • def headOption: Option[JarEntry]
  • def init: collection.Iterable[JarEntry]
  • def inits: collection.Iterator[collection.Iterable[JarEntry]]
  • def isEmpty: Boolean
  • final def isInstanceOf[T0]: Boolean
  • final def isTraversableAgain: Boolean
  • def iterator: Iterator[JarEntry]
  • def jarWriter(mainAttrs: (Name, String)*): JarWriter
  • def last: JarEntry
  • def lastOption: Option[JarEntry]
  • def mainClass: Option[String]
  • lazy val manifest: Option[Manifest]
  • def map[B, That](f: (JarEntry) ⇒ B)(implicit bf: CanBuildFrom[collection.Iterable[JarEntry], B, That]): That
  • def max[B >: JarEntry](implicit cmp: Ordering[B]): JarEntry
  • def maxBy[B](f: (JarEntry) ⇒ B)(implicit cmp: Ordering[B]): JarEntry
  • def min[B >: JarEntry](implicit cmp: Ordering[B]): JarEntry
  • def minBy[B](f: (JarEntry) ⇒ B)(implicit cmp: Ordering[B]): JarEntry
  • def mkString: String
  • def mkString(sep: String): String
  • def mkString(start: String, sep: String, end: String): String
  • final def ne(arg0: AnyRef): Boolean
  • def newBuilder: Builder[JarEntry, collection.Iterable[JarEntry]]
  • def nonEmpty: Boolean
  • final def notify(): Unit
  • final def notifyAll(): Unit
  • def par: ParIterable[JarEntry]
  • def parCombiner: Combiner[JarEntry, ParIterable[JarEntry]]
  • def partition(p: (JarEntry) ⇒ Boolean): (collection.Iterable[JarEntry], collection.Iterable[JarEntry])
  • def product[B >: JarEntry](implicit num: Numeric[B]): B
  • def reduce[A1 >: JarEntry](op: (A1, A1) ⇒ A1): A1
  • def reduceLeft[B >: JarEntry](op: (B, JarEntry) ⇒ B): B
  • def reduceLeftOption[B >: JarEntry](op: (B, JarEntry) ⇒ B): Option[B]
  • def reduceOption[A1 >: JarEntry](op: (A1, A1) ⇒ A1): Option[A1]
  • def reduceRight[B >: JarEntry](op: (JarEntry, B) ⇒ B): B
  • def reduceRightOption[B >: JarEntry](op: (JarEntry, B) ⇒ B): Option[B]
  • def repr: collection.Iterable[JarEntry]
  • def reversed: List[JarEntry]
  • def sameElements[B >: JarEntry](that: GenIterable[B]): Boolean
  • def scan[B >: JarEntry, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[collection.Iterable[JarEntry], B, That]): That
  • def scanLeft[B, That](z: B)(op: (B, JarEntry) ⇒ B)(implicit bf: CanBuildFrom[collection.Iterable[JarEntry], B, That]): That
  • def scanRight[B, That](z: B)(op: (JarEntry, B) ⇒ B)(implicit bf: CanBuildFrom[collection.Iterable[JarEntry], B, That]): That
  • def seq: collection.Iterable[JarEntry]
  • def size: Int
  • def slice(from: Int, until: Int): collection.Iterable[JarEntry]
  • def sliding(size: Int, step: Int): collection.Iterator[collection.Iterable[JarEntry]]
  • def sliding(size: Int): collection.Iterator[collection.Iterable[JarEntry]]
  • def span(p: (JarEntry) ⇒ Boolean): (collection.Iterable[JarEntry], collection.Iterable[JarEntry])
  • def splitAt(n: Int): (collection.Iterable[JarEntry], collection.Iterable[JarEntry])
  • def stringPrefix: String
  • def sum[B >: JarEntry](implicit num: Numeric[B]): B
  • final def synchronized[T0](arg0: ⇒ T0): T0
  • def tail: collection.Iterable[JarEntry]
  • def tails: collection.Iterator[collection.Iterable[JarEntry]]
  • def take(n: Int): collection.Iterable[JarEntry]
  • def takeRight(n: Int): collection.Iterable[JarEntry]
  • def takeWhile(p: (JarEntry) ⇒ Boolean): collection.Iterable[JarEntry]
  • def thisCollection: collection.Iterable[JarEntry]
  • def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, JarEntry, Col[JarEntry]]): Col[JarEntry]
  • def toArray[B >: JarEntry](implicit arg0: ClassTag[B]): Array[B]
  • def toBuffer[B >: JarEntry]: Buffer[B]
  • def toCollection(repr: collection.Iterable[JarEntry]): collection.Iterable[JarEntry]
  • def toIndexedSeq: collection.immutable.IndexedSeq[JarEntry]
  • def toIterable: collection.Iterable[JarEntry]
  • def toIterator: collection.Iterator[JarEntry]
  • def toList: List[JarEntry]
  • def toMap[T, U](implicit ev: <:<[JarEntry, (T, U)]): Map[T, U]
  • def toParArray: ParArray[T]
  • def toSeq: collection.Seq[JarEntry]
  • def toSet[B >: JarEntry]: Set[B]
  • def toStream: collection.immutable.Stream[JarEntry]
  • def toString(): String
  • def toTraversable: collection.Traversable[JarEntry]
  • def toVector: Vector[JarEntry]
  • def transpose[B](implicit asTraversable: (JarEntry) ⇒ GenTraversableOnce[B]): collection.Iterable[collection.Iterable[B]]
  • def unzip[A1, A2](implicit asPair: (JarEntry) ⇒ (A1, A2)): (collection.Iterable[A1], collection.Iterable[A2])
  • def unzip3[A1, A2, A3](implicit asTriple: (JarEntry) ⇒ (A1, A2, A3)): (collection.Iterable[A1], collection.Iterable[A2], collection.Iterable[A3])
  • def view(from: Int, until: Int): IterableView[JarEntry, collection.Iterable[JarEntry]]
  • def view: IterableView[JarEntry, collection.Iterable[JarEntry]]
  • final def wait(): Unit
  • final def wait(arg0: Long, arg1: Int): Unit
  • final def wait(arg0: Long): Unit
  • def withEntryStream[A](name: String)(f: (Option[InputStream]) ⇒ A): A
  • def withFilter(p: (JarEntry) ⇒ Boolean): FilterMonadic[JarEntry, collection.Iterable[JarEntry]]
  • def withJarInput[T](f: (JarInputStream) ⇒ T): T
  • def zip[A1 >: JarEntry, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[collection.Iterable[JarEntry], (A1, B), That]): That
  • def zipAll[B, A1 >: JarEntry, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[collection.Iterable[JarEntry], (A1, B), That]): That
  • def zipWithIndex[A1 >: JarEntry, That](implicit bf: CanBuildFrom[collection.Iterable[JarEntry], (A1, Int), That]): That
  • def →[B](y: B): (Jar, 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