Created
May 6, 2011 17:15
-
-
Save xuwei-k/959360 to your computer and use it in GitHub Desktop.
scala 2.8.1 library implicit keyword
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
\scala\Array.scala | |
31,3 implicit def fallbackCanBuildFrom[T](implicit m: DummyImplicit): CanBuildFrom[Array[_], T, ArraySeq[T]] = | |
44,3 implicit def canBuildFrom[T](implicit m: ClassManifest[T]): CanBuildFrom[Array[_], T, Array[T]] = | |
53,21 def newBuilder[T](implicit m: ClassManifest[T]): ArrayBuilder[T] = ArrayBuilder.make[T]()(m) | |
\scala\Either.scala | |
56,38 def joinRight[A1 >: A, B1 >: B, C](implicit ev: B1 <:< Either[A1, C]): Either[A1, C] = this match { | |
64,37 def joinLeft[A1 >: A, B1 >: B, C](implicit ev: A1 <:< Either[C, B1]): Either[C, B1] = this match { | |
110,3 implicit def either2mergeable[A](x: Either[A, A]): MergeableEither[A] = new MergeableEither(x) | |
\scala\Enumeration.scala | |
270,5 implicit def canBuildFrom: CanBuildFrom[ValueSet, Value, ValueSet] = | |
\scala\LowPriorityImplicits.scala | |
25,3 implicit def genericWrapArray[T](xs: Array[T]): WrappedArray[T] = | |
28,3 implicit def wrapRefArray[T <: AnyRef](xs: Array[T]): WrappedArray[T] = if (xs ne null) new WrappedArray.ofRef[T](xs) else null | |
29,3 implicit def wrapIntArray(xs: Array[Int]): WrappedArray[Int] = if (xs ne null) new WrappedArray.ofInt(xs) else null | |
30,3 implicit def wrapDoubleArray(xs: Array[Double]): WrappedArray[Double] = if (xs ne null) new WrappedArray.ofDouble(xs) else null | |
31,3 implicit def wrapLongArray(xs: Array[Long]): WrappedArray[Long] = if (xs ne null) new WrappedArray.ofLong(xs) else null | |
32,3 implicit def wrapFloatArray(xs: Array[Float]): WrappedArray[Float] = if (xs ne null) new WrappedArray.ofFloat(xs) else null | |
33,3 implicit def wrapCharArray(xs: Array[Char]): WrappedArray[Char] = if (xs ne null) new WrappedArray.ofChar(xs) else null | |
34,3 implicit def wrapByteArray(xs: Array[Byte]): WrappedArray[Byte] = if (xs ne null) new WrappedArray.ofByte(xs) else null | |
35,3 implicit def wrapShortArray(xs: Array[Short]): WrappedArray[Short] = if (xs ne null) new WrappedArray.ofShort(xs) else null | |
36,3 implicit def wrapBooleanArray(xs: Array[Boolean]): WrappedArray[Boolean] = if (xs ne null) new WrappedArray.ofBoolean(xs) else null | |
37,3 implicit def wrapUnitArray(xs: Array[Unit]): WrappedArray[Unit] = if (xs ne null) new WrappedArray.ofUnit(xs) else null | |
39,3 implicit def wrapString(s: String): WrappedString = if (s ne null) new WrappedString(s) else null | |
40,3 implicit def unwrapString(ws: WrappedString): String = if (ws ne null) ws.self else null | |
42,3 implicit def fallbackStringCanBuildFrom[T]: CanBuildFrom[String, T, collection.immutable.IndexedSeq[T]] = | |
\scala\Option.scala | |
14,3 implicit def option2Iterable[A](xo: Option[A]): Iterable[A] = xo.toList | |
115,23 def orNull[A1 >: A](implicit ev: Null <:< A1): A1 = this getOrElse null | |
\scala\Predef.scala | |
45,7 def implicitly[T](implicit e: T) = e | |
46,19 def manifest[T](implicit m: Manifest[T]) = m | |
47,24 def classManifest[T](implicit m: ClassManifest[T]) = m | |
154,3 implicit def any2Ensuring[A](x: A): Ensuring[A] = new Ensuring(x) | |
174,3 implicit def any2ArrowAssoc[A](x: A): ArrowAssoc[A] = new ArrowAssoc(x) | |
201,3 implicit def byteWrapper(x: Byte) = new runtime.RichByte(x) | |
202,3 implicit def shortWrapper(x: Short) = new runtime.RichShort(x) | |
203,3 implicit def intWrapper(x: Int) = new runtime.RichInt(x) | |
204,3 implicit def charWrapper(c: Char) = new runtime.RichChar(c) | |
205,3 implicit def longWrapper(x: Long) = new runtime.RichLong(x) | |
206,3 implicit def floatWrapper(x: Float) = new runtime.RichFloat(x) | |
207,3 implicit def doubleWrapper(x: Double) = new runtime.RichDouble(x) | |
208,3 implicit def booleanWrapper(x: Boolean) = new runtime.RichBoolean(x) | |
210,3 implicit def exceptionWrapper(exc: Throwable) = new runtime.RichException(exc) | |
212,3 implicit def genericArrayOps[T](xs: Array[T]): ArrayOps[T] = (xs: AnyRef) match { // !!! drop the AnyRef and get unreachable code errors! | |
226,3 implicit def refArrayOps[T <: AnyRef](xs: Array[T]): ArrayOps[T] = new ArrayOps.ofRef[T](xs) | |
227,3 implicit def intArrayOps(xs: Array[Int]): ArrayOps[Int] = new ArrayOps.ofInt(xs) | |
228,3 implicit def doubleArrayOps(xs: Array[Double]): ArrayOps[Double] = new ArrayOps.ofDouble(xs) | |
229,3 implicit def longArrayOps(xs: Array[Long]): ArrayOps[Long] = new ArrayOps.ofLong(xs) | |
230,3 implicit def floatArrayOps(xs: Array[Float]): ArrayOps[Float] = new ArrayOps.ofFloat(xs) | |
231,3 implicit def charArrayOps(xs: Array[Char]): ArrayOps[Char] = new ArrayOps.ofChar(xs) | |
232,3 implicit def byteArrayOps(xs: Array[Byte]): ArrayOps[Byte] = new ArrayOps.ofByte(xs) | |
233,3 implicit def shortArrayOps(xs: Array[Short]): ArrayOps[Short] = new ArrayOps.ofShort(xs) | |
234,3 implicit def booleanArrayOps(xs: Array[Boolean]): ArrayOps[Boolean] = new ArrayOps.ofBoolean(xs) | |
235,3 implicit def unitArrayOps(xs: Array[Unit]): ArrayOps[Unit] = new ArrayOps.ofUnit(xs) | |
239,3 implicit def byte2short(x: Byte): Short = x.toShort | |
240,3 implicit def byte2int(x: Byte): Int = x.toInt | |
241,3 implicit def byte2long(x: Byte): Long = x.toLong | |
242,3 implicit def byte2float(x: Byte): Float = x.toFloat | |
243,3 implicit def byte2double(x: Byte): Double = x.toDouble | |
245,3 implicit def short2int(x: Short): Int = x.toInt | |
246,3 implicit def short2long(x: Short): Long = x.toLong | |
247,3 implicit def short2float(x: Short): Float = x.toFloat | |
248,3 implicit def short2double(x: Short): Double = x.toDouble | |
250,3 implicit def char2int(x: Char): Int = x.toInt | |
251,3 implicit def char2long(x: Char): Long = x.toLong | |
252,3 implicit def char2float(x: Char): Float = x.toFloat | |
253,3 implicit def char2double(x: Char): Double = x.toDouble | |
255,3 implicit def int2long(x: Int): Long = x.toLong | |
256,3 implicit def int2float(x: Int): Float = x.toFloat | |
257,3 implicit def int2double(x: Int): Double = x.toDouble | |
259,3 implicit def long2float(x: Long): Float = x.toFloat | |
260,3 implicit def long2double(x: Long): Double = x.toDouble | |
262,3 implicit def float2double(x: Float): Double = x.toDouble | |
266,3 implicit def byte2Byte(x: Byte) = java.lang.Byte.valueOf(x) | |
267,3 implicit def short2Short(x: Short) = java.lang.Short.valueOf(x) | |
268,3 implicit def char2Character(x: Char) = java.lang.Character.valueOf(x) | |
269,3 implicit def int2Integer(x: Int) = java.lang.Integer.valueOf(x) | |
270,3 implicit def long2Long(x: Long) = java.lang.Long.valueOf(x) | |
271,3 implicit def float2Float(x: Float) = java.lang.Float.valueOf(x) | |
272,3 implicit def double2Double(x: Double) = java.lang.Double.valueOf(x) | |
273,3 implicit def boolean2Boolean(x: Boolean) = java.lang.Boolean.valueOf(x) | |
277,3 implicit def any2stringadd(x: Any) = new runtime.StringAdd(x) | |
278,3 implicit def augmentString(x: String): StringOps = new StringOps(x) | |
279,3 implicit def unaugmentString(x: StringOps): String = x.repr | |
281,3 implicit def stringCanBuildFrom: CanBuildFrom[String, Char, String] = | |
287,3 implicit def seqToCharSequence(xs: collection.IndexedSeq[Char]): CharSequence = new CharSequence { | |
294,3 implicit def arrayToCharSequence(xs: Array[Char]): CharSequence = new CharSequence { | |
310,3 implicit def conforms[A]: A <:< A = new (A <:< A) {def apply(x: A) = x} // not in the <:< companion object because it is also intended to subsume identity (which is no longer implicit) | |
314,5 implicit def tpEquals[A]: A =:= A = new (A =:= A) {def apply(x: A) = x} | |
319,5 implicit def conformsOrViewsAs[A <% B, B]: A <%< B = new (A <%< B) {def apply(x: A) = x} | |
332,5 implicit def dummyImplicit: DummyImplicit = new DummyImplicit | |
\scala\Tuple2.scala | |
31,32 def zip[Repr1, El1, El2, To](implicit w1: T1 => TraversableLike[El1, Repr1], | |
51,38 def zipped[Repr1, El1, Repr2, El2](implicit w1: T1 => TraversableLike[El1, Repr1], w2: T2 => IterableLike[El2, Repr2]): Zipped[Repr1, El1, Repr2, El2] | |
55,40 def map[B, To](f: (El1, El2) => B)(implicit cbf: CanBuildFrom[Repr1, B, To]): To = { | |
66,57 def flatMap[B, To](f: (El1, El2) => Traversable[B])(implicit cbf: CanBuildFrom[Repr1, B, To]): To = { | |
77,52 def filter[To1, To2](f: (El1, El2) => Boolean)(implicit cbf1: CanBuildFrom[Repr1, El1, To1], cbf2: CanBuildFrom[Repr2, El2, To2]): (To1, To2) = { | |
\scala\Tuple3.scala | |
28,37 def zip[Repr1, El1, El2, El3, To](implicit w1: T1 => TraversableLike[El1, Repr1], | |
51,50 def zipped[Repr1, El1, Repr2, El2, Repr3, El3](implicit w1: T1 => TraversableLike[El1, Repr1], | |
59,45 def map[B, To](f: (El1, El2, El3) => B)(implicit cbf: CanBuildFrom[Repr1, B, To]): To = { | |
71,62 def flatMap[B, To](f: (El1, El2, El3) => Traversable[B])(implicit cbf: CanBuildFrom[Repr1, B, To]): To = { | |
84,18 implicit cbf1: CanBuildFrom[Repr1, El1, To1], | |
\scala\actors\Actor.scala | |
297,3 implicit def mkBody[a](body: => a) = new Body[a] { | |
\scala\actors\Combinators.scala | |
19,3 implicit def mkBody[a](body: => a): Actor.Body[a] | |
\scala\actors\Reactor.scala | |
257,3 implicit def mkBody[A](body: => A) = new Actor.Body[A] { | |
\scala\annotation\implicitNotFound.scala | |
18,13 final class implicitNotFound(msg: String) extends StaticAnnotation {} | |
\scala\collection\BitSet.scala | |
32,3 implicit def canBuildFrom: CanBuildFrom[BitSet, Int, BitSet] = bitsetCanBuildFrom | |
\scala\collection\IndexedSeq.scala | |
31,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, IndexedSeq[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\IndexedSeqOptimized.scala | |
88,48 def zip[A1 >: A, B, That](that: Iterable[B])(implicit bf: CanBuildFrom[Repr, (A1, B), That]): That = that match { | |
104,35 def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[Repr, (A1, Int), That]): That = { | |
\scala\collection\Iterable.scala | |
45,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, Iterable[A]] = new GenericCanBuildFrom[A] | |
51,32 def min[A](seq: Iterable[A])(implicit ord: Ordering[A]): A = seq.min | |
55,32 def max[A](seq: Iterable[A])(implicit ord: Ordering[A]): A = seq.max | |
\scala\collection\IterableLike.scala | |
245,48 def zip[A1 >: A, B, That](that: Iterable[B])(implicit bf: CanBuildFrom[Repr, (A1, B), That]): That = { | |
282,78 def zipAll[B, A1 >: A, That](that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Repr, (A1, B), That]): That = { | |
320,35 def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[Repr, (A1, Int), That]): That = { | |
\scala\collection\IterableProxyLike.scala | |
34,57 override def zip[A1 >: A, B, That](that: Iterable[B])(implicit bf: CanBuildFrom[Repr, (A1, B), That]): That = self.zip[A1, B, That](that)(bf) | |
35,87 override def zipAll[B, A1 >: A, That](that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Repr, (A1, B), That]): That = self.zipAll(that, thisElem, thatElem)(bf) | |
36,44 override def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[Repr, (A1, Int), That]): That = self.zipWithIndex(bf) | |
\scala\collection\IterableView.scala | |
26,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, IterableView[A, Iterable[_]]] = | |
\scala\collection\IterableViewLike.scala | |
85,57 override def zip[A1 >: A, B, That](that: Iterable[B])(implicit bf: CanBuildFrom[This, (A1, B), That]): That = { | |
92,44 override def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[This, (A1, Int), That]): That = | |
95,87 override def zipAll[B, A1 >: A, That](that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[This, (A1, B), That]): That = | |
\scala\collection\Iterator.scala | |
171,3 implicit def iteratorCanBuildFrom[T]: IteratorCanBuildFrom[T] = new IteratorCanBuildFrom[T] | |
189,3 implicit def iteratorIteratorWrapper[A](its: Iterator[Iterator[A]]): IteratorIteratorOps[A] = | |
\scala\collection\JavaConversions.scala | |
73,3 implicit def asJavaIterator[A](i : Iterator[A]): ju.Iterator[A] = i match { | |
94,3 implicit def asJavaEnumeration[A](i : Iterator[A]): ju.Enumeration[A] = i match { | |
115,3 implicit def asJavaIterable[A](i : Iterable[A]): jl.Iterable[A] = i match { | |
134,3 implicit def asJavaCollection[A](i : Iterable[A]): ju.Collection[A] = i match { | |
155,3 implicit def asJavaList[A](b : mutable.Buffer[A]): ju.List[A] = b match { | |
176,3 implicit def asJavaList[A](b : mutable.Seq[A]): ju.List[A] = b match { | |
197,3 implicit def asJavaList[A](b : Seq[A]): ju.List[A] = b match { | |
218,3 implicit def asJavaSet[A](s : mutable.Set[A]): ju.Set[A] = s match { | |
239,3 implicit def asJavaSet[A](s: Set[A]): ju.Set[A] = s match { | |
260,3 implicit def asJavaMap[A, B](m : mutable.Map[A, B]): ju.Map[A, B] = m match { | |
282,3 implicit def asJavaDictionary[A, B](m : mutable.Map[A, B]): ju.Dictionary[A, B] = m match { | |
304,3 implicit def asJavaMap[A, B](m : Map[A, B]): ju.Map[A, B] = m match { | |
326,3 implicit def asJavaConcurrentMap[A, B](m: mutable.ConcurrentMap[A, B]): juc.ConcurrentMap[A, B] = m match { | |
349,3 implicit def asScalaIterator[A](i : ju.Iterator[A]): Iterator[A] = i match { | |
370,3 implicit def enumerationAsScalaIterator[A](i : ju.Enumeration[A]): Iterator[A] = i match { | |
391,3 implicit def asScalaIterable[A](i : jl.Iterable[A]): Iterable[A] = i match { | |
409,3 implicit def asScalaIterable[A](i : ju.Collection[A]): Iterable[A] = i match { | |
430,3 implicit def asScalaBuffer[A](l : ju.List[A]): mutable.Buffer[A] = l match { | |
451,3 implicit def asScalaSet[A](s : ju.Set[A]): mutable.Set[A] = s match { | |
472,3 implicit def asScalaMap[A, B](m : ju.Map[A, B]): mutable.Map[A, B] = m match { | |
494,3 implicit def asScalaConcurrentMap[A, B](m: juc.ConcurrentMap[A, B]): mutable.ConcurrentMap[A, B] = m match { | |
511,3 implicit def dictionaryAsScalaMap[A, B](p: ju.Dictionary[A, B]): mutable.Map[A, B] = p match { | |
528,3 implicit def asScalaMap(p: ju.Properties): mutable.Map[String, String] = p match { | |
\scala\collection\JavaConverters.scala | |
114,3 implicit def asJavaIteratorConverter[A](i : Iterator[A]): AsJava[ju.Iterator[A]] = | |
130,3 implicit def asJavaEnumerationConverter[A](i : Iterator[A]): AsJavaEnumeration[A] = | |
146,3 implicit def asJavaIterableConverter[A](i : Iterable[A]): AsJava[jl.Iterable[A]] = | |
160,3 implicit def asJavaCollectionConverter[A](i : Iterable[A]): AsJavaCollection[A] = | |
176,3 implicit def asJavaListConverter[A](b : mutable.Buffer[A]): AsJava[ju.List[A]] = | |
192,3 implicit def asJavaListConverter[A](b : mutable.Seq[A]): AsJava[ju.List[A]] = | |
208,3 implicit def asJavaListConverter[A](b : Seq[A]): AsJava[ju.List[A]] = | |
224,3 implicit def asJavaSetConverter[A](s : mutable.Set[A]): AsJava[ju.Set[A]] = | |
240,3 implicit def asJavaSetConverter[A](s : Set[A]): AsJava[ju.Set[A]] = | |
256,3 implicit def asJavaMapConverter[A, B](m : mutable.Map[A, B]): AsJava[ju.Map[A, B]] = | |
272,3 implicit def asJavaDictionaryConverter[A, B](m : mutable.Map[A, B]): AsJavaDictionary[A, B] = | |
288,3 implicit def asJavaMapConverter[A, B](m : Map[A, B]): AsJava[ju.Map[A, B]] = | |
304,3 implicit def asJavaConcurrentMapConverter[A, B](m: mutable.ConcurrentMap[A, B]): AsJava[juc.ConcurrentMap[A, B]] = | |
320,3 implicit def asScalaIteratorConverter[A](i : ju.Iterator[A]): AsScala[Iterator[A]] = | |
336,3 implicit def enumerationAsScalaIteratorConverter[A](i : ju.Enumeration[A]): AsScala[Iterator[A]] = | |
352,3 implicit def asScalaIterableConverter[A](i : jl.Iterable[A]): AsScala[Iterable[A]] = | |
365,3 implicit def asScalaIterableConverter[A](i : ju.Collection[A]): AsScala[Iterable[A]] = | |
381,3 implicit def asScalaBufferConverter[A](l : ju.List[A]): AsScala[mutable.Buffer[A]] = | |
397,3 implicit def asScalaSetConverter[A](s : ju.Set[A]): AsScala[mutable.Set[A]] = | |
413,3 implicit def asScalaMapConverter[A, B](m : ju.Map[A, B]): AsScala[mutable.Map[A, B]] = | |
429,3 implicit def asScalaConcurrentMapConverter[A, B](m: juc.ConcurrentMap[A, B]): AsScala[mutable.ConcurrentMap[A, B]] = | |
441,3 implicit def dictionaryAsScalaMapConverter[A, B](p: ju.Dictionary[A, B]): AsScala[mutable.Map[A, B]] = | |
453,3 implicit def asScalaMapConverter(p: ju.Properties): AsScala[mutable.Map[String, String]] = | |
\scala\collection\LinearSeq.scala | |
31,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, LinearSeq[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\Map.scala | |
43,3 implicit def canBuildFrom[A, B]: CanBuildFrom[Coll, (A, B), Map[A, B]] = new MapCanBuildFrom[A, B] | |
\scala\collection\package.scala | |
75,29 def breakOut[From, T, To](implicit b : CanBuildFrom[Nothing, T, To]) = | |
\scala\collection\Seq.scala | |
36,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, Seq[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\SeqLike.scala | |
407,38 def reverseMap[B, That](f: A => B)(implicit bf: CanBuildFrom[Repr, B, That]): That = { | |
559,41 def union[B >: A, That](that: Seq[B])(implicit bf: CanBuildFrom[Repr, B, That]): That = | |
659,68 def patch[B >: A, That](from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[Repr, B, That]): That = { | |
678,50 def updated[B >: A, That](index: Int, elem: B)(implicit bf: CanBuildFrom[Repr, B, That]): That = { | |
698,33 def +:[B >: A, That](elem: B)(implicit bf: CanBuildFrom[Repr, B, That]): That = { | |
717,33 def :+[B >: A, That](elem: B)(implicit bf: CanBuildFrom[Repr, B, That]): That = { | |
738,46 def padTo[B >: A, That](len: Int, elem: B)(implicit bf: CanBuildFrom[Repr, B, That]): That = { | |
808,28 def sortBy[B](f: A => B)(implicit ord: Ordering[B]): Repr = sorted(ord on f) | |
821,22 def sorted[B >: A](implicit ord: Ordering[B]): Repr = { | |
\scala\collection\SeqProxyLike.scala | |
44,47 override def reverseMap[B, That](f: A => B)(implicit bf: CanBuildFrom[Repr, B, That]): That = self.reverseMap(f)(bf) | |
55,50 override def union[B >: A, That](that: Seq[B])(implicit bf: CanBuildFrom[Repr, B, That]): That = self.union(that)(bf) | |
59,77 override def patch[B >: A, That](from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[Repr, B, That]): That = self.patch(from, patch, replaced)(bf) | |
60,59 override def updated[B >: A, That](index: Int, elem: B)(implicit bf: CanBuildFrom[Repr, B, That]): That = self.updated(index, elem)(bf) | |
61,42 override def +:[B >: A, That](elem: B)(implicit bf: CanBuildFrom[Repr, B, That]): That = self.+:(elem)(bf) | |
62,42 override def :+[B >: A, That](elem: B)(implicit bf: CanBuildFrom[Repr, B, That]): That = self.:+(elem)(bf) | |
63,55 override def padTo[B >: A, That](len: Int, elem: B)(implicit bf: CanBuildFrom[Repr, B, That]): That = self.padTo(len, elem)(bf) | |
66,37 override def sortBy[B](f: A => B)(implicit ord: Ordering[B]): Repr = self.sortBy(f)(ord) | |
67,31 override def sorted[B >: A](implicit ord: Ordering[B]): Repr = self.sorted(ord) | |
\scala\collection\SeqView.scala | |
26,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, SeqView[A, Seq[_]]] = | |
\scala\collection\SeqViewLike.scala | |
189,77 override def patch[B >: A, That](from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[This, B, That]): That = { | |
196,55 override def padTo[B >: A, That](len: Int, elem: B)(implicit bf: CanBuildFrom[This, B, That]): That = | |
199,47 override def reverseMap[B, That](f: A => B)(implicit bf: CanBuildFrom[This, B, That]): That = | |
202,59 override def updated[B >: A, That](index: Int, elem: B)(implicit bf: CanBuildFrom[This, B, That]): That = { | |
207,42 override def +:[B >: A, That](elem: B)(implicit bf: CanBuildFrom[This, B, That]): That = | |
210,42 override def :+[B >: A, That](elem: B)(implicit bf: CanBuildFrom[This, B, That]): That = | |
213,50 override def union[B >: A, That](that: Seq[B])(implicit bf: CanBuildFrom[This, B, That]): That = | |
222,31 override def sorted[B >: A](implicit ord: Ordering[B]): This = | |
\scala\collection\Set.scala | |
41,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, Set[A]] = setCanBuildFrom[A] | |
\scala\collection\SortedMap.scala | |
33,19 def empty[A, B](implicit ord: Ordering[A]): immutable.SortedMap[A, B] = immutable.SortedMap.empty[A, B](ord) | |
35,3 implicit def canBuildFrom[A, B](implicit ord: Ordering[A]): CanBuildFrom[Coll, (A, B), SortedMap[A, B]] = new SortedMapCanBuildFrom[A, B] | |
\scala\collection\SortedMapLike.scala | |
30,3 implicit def ordering: Ordering[A] | |
38,5 implicit def ordering = self.ordering | |
\scala\collection\SortedSet.scala | |
29,16 def empty[A](implicit ord: Ordering[A]): immutable.SortedSet[A] = immutable.SortedSet.empty[A](ord) | |
30,3 implicit def canBuildFrom[A](implicit ord: Ordering[A]): CanBuildFrom[Coll, A, SortedSet[A]] = new SortedSetCanBuildFrom[A] | |
\scala\collection\SortedSetLike.scala | |
23,3 implicit def ordering: Ordering[A] | |
\scala\collection\Traversable.scala | |
29,57 override def ++[B >: A, That](xs: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[A], B, That]): That | |
30,40 override def map[B, That](f: A => B)(implicit bf: CanBuildFrom[Traversable[A], B, That]): That | |
31,57 override def flatMap[B, That](f: A => Traversable[B])(implicit bf: CanBuildFrom[Traversable[A], B, That]): That | |
93,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, Traversable[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\TraversableLike.scala | |
181,50 def ++[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]): That = { | |
203,31 def map[B, That](f: A => B)(implicit bf: CanBuildFrom[Repr, B, That]): That = { | |
225,48 def flatMap[B, That](f: A => Traversable[B])(implicit bf: CanBuildFrom[Repr, B, That]): That = { | |
269,51 def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Repr, B, That]): That = { | |
292,45 def filterMap[B, That](f: A => Option[B])(implicit bf: CanBuildFrom[Repr, B, That]): That = { | |
433,48 def scanLeft[B, That](z: B)(op: (B, A) => B)(implicit bf: CanBuildFrom[Repr, B, That]): That = { | |
454,49 def scanRight[B, That](z: B)(op: (A, B) => B)(implicit bf: CanBuildFrom[Repr, B, That]): That = { | |
783,33 def map[B, That](f: A => B)(implicit bf: CanBuildFrom[Repr, B, That]): That = { | |
805,50 def flatMap[B, That](f: A => Traversable[B])(implicit bf: CanBuildFrom[Repr, B, That]): That = { | |
\scala\collection\TraversableOnce.scala | |
288,19 def sum[B >: A](implicit num: Numeric[B]): B = foldLeft(num.zero)(num.plus) | |
304,23 def product[B >: A](implicit num: Numeric[B]): B = foldLeft(num.one)(num.times) | |
315,19 def min[B >: A](implicit cmp: Ordering[B]): A = { | |
331,19 def max[B >: A](implicit cmp: Ordering[B]): A = { | |
449,19 def toMap[T, U](implicit ev: A <:< (T, U)): immutable.Map[T, U] = { | |
\scala\collection\TraversableProxyLike.scala | |
33,57 override def ++[B >: A, That](xs: TraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]): That = self.++(xs)(bf) | |
34,40 override def map[B, That](f: A => B)(implicit bf: CanBuildFrom[Repr, B, That]): That = self.map(f)(bf) | |
35,57 override def flatMap[B, That](f: A => Traversable[B])(implicit bf: CanBuildFrom[Repr, B, That]): That = self.flatMap(f)(bf) | |
38,60 override def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Repr, B, That]): That = self.collect(pf)(bf) | |
53,57 override def scanLeft[B, That](z: B)(op: (B, A) => B)(implicit bf: CanBuildFrom[Repr, B, That]): That = self.scanLeft(z)(op)(bf) | |
54,58 override def scanRight[B, That](z: B)(op: (A, B) => B)(implicit bf: CanBuildFrom[Repr, B, That]): That = self.scanRight(z)(op)(bf) | |
55,28 override def sum[B >: A](implicit num: Numeric[B]): B = self.sum(num) | |
56,32 override def product[B >: A](implicit num: Numeric[B]): B = self.product(num) | |
57,28 override def min[B >: A](implicit cmp: Ordering[B]): A = self.min(cmp) | |
58,28 override def max[B >: A](implicit cmp: Ordering[B]): A = self.max(cmp) | |
84,28 override def toMap[T, U](implicit ev: A <:< (T, U)): immutable.Map[T, U] = self.toMap(ev) | |
\scala\collection\TraversableView.scala | |
34,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, TraversableView[A, Traversable[_]]] = | |
\scala\collection\TraversableViewLike.scala | |
55,27 def force[B >: A, That](implicit bf: CanBuildFrom[Coll, B, That]) = { | |
172,57 override def ++[B >: A, That](xs: TraversableOnce[B])(implicit bf: CanBuildFrom[This, B, That]): That = { | |
178,40 override def map[B, That](f: A => B)(implicit bf: CanBuildFrom[This, B, That]): That = { | |
185,60 override def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[This, B, That]): That = | |
188,57 override def flatMap[B, That](f: A => Traversable[B])(implicit bf: CanBuildFrom[This, B, That]): That = { | |
213,57 override def scanLeft[B, That](z: B)(op: (B, A) => B)(implicit bf: CanBuildFrom[This, B, That]): That = | |
216,58 override def scanRight[B, That](z: B)(op: (A, B) => B)(implicit bf: CanBuildFrom[This, B, That]): That = | |
\scala\collection\generic\FilterMonadic.scala | |
7,31 def map[B, That](f: A => B)(implicit bf: CanBuildFrom[Repr, B, That]): That | |
8,48 def flatMap[B, That](f: A => Traversable[B])(implicit bf: CanBuildFrom[Repr, B, That]): That | |
\scala\collection\generic\GenericTraversableTemplate.scala | |
76,21 def unzip[A1, A2](implicit asPair: A => /*<:<!!!*/ (A1, A2)): (CC[A1], CC[A2]) = { | |
95,18 def flatten[B](implicit asTraversable: A => /*<:<!!!*/ Traversable[B]): CC[B] = { | |
110,20 def transpose[B](implicit asTraversable: A => /*<:<!!!*/ Traversable[B]): CC[CC[B] @uncheckedVariance] = { | |
\scala\collection\generic\SortedMapFactory.scala | |
24,19 def empty[A, B](implicit ord: Ordering[A]): CC[A, B] | |
26,35 def apply[A, B](elems: (A, B)*)(implicit ord: Ordering[A]): CC[A, B] = (newBuilder[A, B](ord) ++= elems).result | |
28,24 def newBuilder[A, B](implicit ord: Ordering[A]): Builder[(A, B), CC[A, B]] = | |
31,37 class SortedMapCanBuildFrom[A, B](implicit ord: Ordering[A]) extends CanBuildFrom[Coll, (A, B), CC[A, B]] { | |
\scala\collection\generic\SortedSetFactory.scala | |
23,16 def empty[A](implicit ord: Ordering[A]): CC[A] | |
25,27 def apply[A](elems: A*)(implicit ord: Ordering[A]): CC[A] = (newBuilder[A](ord) ++= elems).result | |
27,21 def newBuilder[A](implicit ord: Ordering[A]): Builder[A, CC[A]] = new SetBuilder[A, CC[A]](empty) | |
29,3 implicit def newCanBuildFrom[A](implicit ord : Ordering[A]) : CanBuildFrom[Coll, A, CC[A]] = new SortedSetCanBuildFrom()(ord); | |
31,34 class SortedSetCanBuildFrom[A](implicit ord: Ordering[A]) extends CanBuildFrom[Coll, A, CC[A]] { | |
\scala\collection\generic\TraversableForwarder.scala | |
61,28 override def sum[B >: A](implicit num: Numeric[B]): B = underlying.sum(num) | |
62,32 override def product[B >: A](implicit num: Numeric[B]): B = underlying.product(num) | |
63,28 override def min[B >: A](implicit cmp: Ordering[B]): A = underlying.min(cmp) | |
64,28 override def max[B >: A](implicit cmp: Ordering[B]): A = underlying.max(cmp) | |
81,28 override def toMap[T, U](implicit ev: A <:< (T, U)): immutable.Map[T, U] = underlying.toMap(ev) | |
\scala\collection\immutable\BitSet.scala | |
70,3 implicit def canBuildFrom: CanBuildFrom[BitSet, Int, BitSet] = bitsetCanBuildFrom | |
\scala\collection\immutable\HashMap.scala | |
93,3 implicit def canBuildFrom[A, B]: CanBuildFrom[Coll, (A, B), HashMap[A, B]] = new MapCanBuildFrom[A, B] | |
\scala\collection\immutable\HashSet.scala | |
92,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, HashSet[A]] = setCanBuildFrom[A] | |
\scala\collection\immutable\IndexedSeq.scala | |
38,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, IndexedSeq[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\immutable\IntMap.scala | |
65,3 implicit def canBuildFrom[A, B] = new CanBuildFrom[IntMap[A], (Int, B), IntMap[B]] { | |
\scala\collection\immutable\Iterable.scala | |
35,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, Iterable[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\immutable\LinearSeq.scala | |
34,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, LinearSeq[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\immutable\List.scala | |
137,59 override def ++[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[List[A], B, That]): That = { | |
143,42 override def +:[B >: A, That](elem: B)(implicit bf: CanBuildFrom[List[A], B, That]): That = bf match { | |
443,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, List[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\immutable\ListMap.scala | |
23,3 implicit def canBuildFrom[A, B]: CanBuildFrom[Coll, (A, B), ListMap[A, B]] = | |
\scala\collection\immutable\ListSet.scala | |
23,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, ListSet[A]] = setCanBuildFrom[A] | |
\scala\collection\immutable\LongMap.scala | |
65,3 implicit def canBuildFrom[A, B] = new CanBuildFrom[LongMap[A], (Long, B), LongMap[B]] { | |
\scala\collection\immutable\Map.scala | |
57,3 implicit def canBuildFrom[A, B]: CanBuildFrom[Coll, (A, B), Map[A, B]] = new MapCanBuildFrom[A, B] | |
\scala\collection\immutable\MapLike.scala | |
119,42 def transform[C, That](f: (A, B) => C)(implicit bf: CanBuildFrom[This, (A, C), That]): That = { | |
\scala\collection\immutable\NumericRange.scala | |
42,4 (implicit num: Integral[T]) | |
159,50 private[immutable] def mapRange[A](fm: T => A)(implicit unum: Integral[A]): NumericRange[A] = { | |
209,49 class Inclusive[T](start: T, end: T, step: T)(implicit num: Integral[T]) | |
217,49 class Exclusive[T](start: T, end: T, step: T)(implicit num: Integral[T]) | |
225,43 def apply[T](start: T, end: T, step: T)(implicit num: Integral[T]): Exclusive[T] = | |
227,47 def inclusive[T](start: T, end: T, step: T)(implicit num: Integral[T]): Inclusive[T] = | |
\scala\collection\immutable\Queue.scala | |
147,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, Queue[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\immutable\Range.scala | |
307,5 implicit val bigDecAsIntegral = scala.Numeric.BigDecimalAsIfIntegral | |
322,5 implicit val bigDecAsIntegral = scala.Numeric.BigDecimalAsIfIntegral | |
323,5 implicit val doubleAsIntegral = scala.Numeric.DoubleAsIfIntegral | |
\scala\collection\immutable\Seq.scala | |
37,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, Seq[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\immutable\Set.scala | |
40,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, Set[A]] = setCanBuildFrom[A] | |
\scala\collection\immutable\SortedMap.scala | |
75,3 implicit def canBuildFrom[A, B](implicit ord: Ordering[A]): CanBuildFrom[Coll, (A, B), SortedMap[A, B]] = new SortedMapCanBuildFrom[A, B] | |
76,19 def empty[A, B](implicit ord: Ordering[A]): SortedMap[A, B] = TreeMap.empty[A, B] | |
\scala\collection\immutable\SortedSet.scala | |
38,3 implicit def canBuildFrom[A](implicit ord: Ordering[A]): CanBuildFrom[Coll, A, SortedSet[A]] = new SortedSetCanBuildFrom[A] | |
39,16 def empty[A](implicit ord: Ordering[A]): SortedSet[A] = TreeSet.empty[A] | |
\scala\collection\immutable\Stack.scala | |
23,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, Stack[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\immutable\Stream.scala | |
140,59 override def ++[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Stream[A], B, That]): That = | |
152,63 override final def scanLeft[B, That](z: B)(op: (B, A) => B)(implicit bf: CanBuildFrom[Stream[A], B, That]): That = | |
165,46 override final def map[B, That](f: A => B)(implicit bf: CanBuildFrom[Stream[A], B, That]): That = | |
179,63 override final def flatMap[B, That](f: A => Traversable[B])(implicit bf: CanBuildFrom[Stream[A], B, That]): That = | |
222,42 override def map[B, That](f: A => B)(implicit bf: CanBuildFrom[Stream[A], B, That]): That = { | |
231,59 override def flatMap[B, That](f: A => Traversable[B])(implicit bf: CanBuildFrom[Stream[A], B, That]): That = { | |
292,63 override final def zip[A1 >: A, B, That](that: Iterable[B])(implicit bf: CanBuildFrom[Stream[A], (A1, B), That]): That = | |
302,44 override def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[Stream[A], (A1, Int), That]): That = | |
426,55 override def padTo[B >: A, That](len: Int, elem: B)(implicit bf: CanBuildFrom[Stream[A], B, That]): That = { | |
450,27 override def flatten[B](implicit asTraversable: A => /*<:<!!!*/ Traversable[B]): Stream[B] = { | |
488,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, Stream[A]] = new StreamCanBuildFrom[A] | |
528,3 implicit def consWrapper[A](stream: => Stream[A]): ConsWrapper[A] = | |
\scala\collection\immutable\Traversable.scala | |
34,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, Traversable[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\immutable\TreeMap.scala | |
22,19 def empty[A, B](implicit ord: Ordering[A]) = new TreeMap[A, B]()(ord) | |
24,3 implicit def canBuildFrom[A, B](implicit ord: Ordering[A]): CanBuildFrom[Coll, (A, B), TreeMap[A, B]] = new SortedMapCanBuildFrom[A, B] | |
25,58 private def make[A, B](s: Int, t: RedBlack[A]#Tree[B])(implicit ord: Ordering[A]) = new TreeMap[A, B](s, t)(ord) | |
46,70 class TreeMap[A, +B](override val size: Int, t: RedBlack[A]#Tree[B])(implicit val ordering: Ordering[A]) | |
57,14 def this()(implicit ordering: Ordering[A]) = this(0, null)(ordering) | |
\scala\collection\immutable\TreeSet.scala | |
22,3 implicit def implicitBuilder[A](implicit ordering: Ordering[A]): Builder[A, TreeSet[A]] = newBuilder[A](ordering) | |
23,30 override def newBuilder[A](implicit ordering: Ordering[A]): Builder[A, TreeSet[A]] = | |
28,16 def empty[A](implicit ordering: Ordering[A]) = new TreeSet[A] | |
48,18 (implicit val ordering: Ordering[A]) | |
55,14 def this()(implicit ordering: Ordering[A]) = this(0, null)(ordering) | |
\scala\collection\immutable\Vector.scala | |
24,11 @inline implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, Vector[A]] = | |
86,43 @inline def mapFast[B, That](f: A => B)(implicit bf: CanBuildFrom[Vector[A], B, That]): That = { | |
110,67 @inline override def updated[B >: A, That](index: Int, elem: B)(implicit bf: CanBuildFrom[Vector[A], B, That]): That = { | |
115,50 @inline override def +:[B >: A, That](elem: B)(implicit bf: CanBuildFrom[Vector[A], B, That]): That = { | |
120,50 @inline override def :+[B >: A, That](elem: B)(implicit bf: CanBuildFrom[Vector[A], B, That]): That = { | |
\scala\collection\interfaces\IterableMethods.scala | |
28,39 def sortWith(lt: (A, A) => Boolean)(implicit m: ClassManifest[A @uncheckedVariance]): This | |
30,66 def zipAll[B, A1 >: A, That](that: Iterable[B], e1: A1, e2: B)(implicit bf: CanBuildFrom[This, (A1, B), That]): That | |
31,35 def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[This, (A1, Int), That]): That | |
32,48 def zip[A1 >: A, B, That](that: Iterable[B])(implicit bf: CanBuildFrom[This, (A1, B), That]): That | |
\scala\collection\interfaces\SeqMethods.scala | |
44,46 def padTo[B >: A, That](len: Int, elem: B)(implicit bf: CanBuildFrom[This, B, That]): That | |
45,68 def patch[B >: A, That](from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[This, B, That]): That | |
53,41 def union[B >: A, That](that: Seq[B])(implicit bf: CanBuildFrom[This, B, That]): That | |
\scala\collection\interfaces\TraversableMethods.scala | |
25,48 def flatMap[B, That](f: A => Traversable[B])(implicit bf: CanBuildFrom[This, B, That]): That | |
26,31 def map[B, That](f: A => B)(implicit bf: CanBuildFrom[This, B, That]): That | |
27,51 def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[This, B, That]): That | |
28,48 def scanLeft[B, That](z: B)(op: (B, A) => B)(implicit bf: CanBuildFrom[This, B, That]): That // could be fold or new collection too - where to put it? | |
29,49 def scanRight[B, That](z: B)(op: (A, B) => B)(implicit bf: CanBuildFrom[This, B, That]): That | |
32,48 def ++[B >: A, That](xs: TraversableOnce[B])(implicit bf: CanBuildFrom[This, B, That]): That | |
\scala\collection\interfaces\TraversableOnceMethods.scala | |
42,19 def sum[B >: A](implicit num: Numeric[B]): B | |
43,23 def product[B >: A](implicit num: Numeric[B]): B | |
44,19 def min[B >: A](implicit cmp: Ordering[B]): A | |
45,19 def max[B >: A](implicit cmp: Ordering[B]): A | |
57,19 def toMap[T, U](implicit ev: A <:< (T, U)): immutable.Map[T, U] | |
\scala\collection\mutable\ArrayBuffer.scala | |
184,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, ArrayBuffer[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\mutable\ArrayBuilder.scala | |
38,5 implicitly[ClassManifest[T]].newArrayBuilder() | |
\scala\collection\mutable\ArrayOps.scala | |
50,9 if (implicitly[ClassManifest[U]].erasure eq repr.getClass.getComponentType) | |
62,18 def flatten[U](implicit asArray: T => /*<:<!!!*/ Array[U]): Array[U] = { | |
75,20 def transpose[U](implicit asArray: T => Array[U]): Array[Array[U]] = { | |
\scala\collection\mutable\ArraySeq.scala | |
89,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, ArraySeq[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\mutable\BitSet.scala | |
121,3 implicit def canBuildFrom: CanBuildFrom[BitSet, Int, BitSet] = bitsetCanBuildFrom | |
\scala\collection\mutable\Buffer.scala | |
43,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, Buffer[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\mutable\DoubleLinkedList.scala | |
68,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, DoubleLinkedList[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\mutable\HashMap.scala | |
120,3 implicit def canBuildFrom[A, B]: CanBuildFrom[Coll, (A, B), HashMap[A, B]] = new MapCanBuildFrom[A, B] | |
\scala\collection\mutable\HashSet.scala | |
82,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, HashSet[A]] = setCanBuildFrom[A] | |
\scala\collection\mutable\IndexedSeq.scala | |
34,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, IndexedSeq[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\mutable\IndexedSeqView.scala | |
105,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, SeqView[A, Seq[_]]] = | |
110,3 implicit def arrCanBuildFrom[A]: CanBuildFrom[TraversableView[_, Array[_]], A, SeqView[A, Array[A]]] = | |
\scala\collection\mutable\Iterable.scala | |
29,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, Iterable[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\mutable\LinearSeq.scala | |
36,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, LinearSeq[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\mutable\LinkedHashMap.scala | |
21,3 implicit def canBuildFrom[A, B]: CanBuildFrom[Coll, (A, B), LinkedHashMap[A, B]] = new MapCanBuildFrom[A, B] | |
\scala\collection\mutable\LinkedHashSet.scala | |
90,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, LinkedHashSet[A]] = setCanBuildFrom[A] | |
\scala\collection\mutable\LinkedList.scala | |
65,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, LinkedList[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\mutable\ListBuffer.scala | |
355,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, ListBuffer[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\mutable\ListMap.scala | |
65,3 implicit def canBuildFrom[A, B]: CanBuildFrom[Coll, (A, B), ListMap[A, B]] = new MapCanBuildFrom[A, B] | |
\scala\collection\mutable\Map.scala | |
49,3 implicit def canBuildFrom[A, B]: CanBuildFrom[Coll, (A, B), Map[A, B]] = new MapCanBuildFrom[A, B] | |
\scala\collection\mutable\PriorityQueue.scala | |
36,24 class PriorityQueue[A](implicit ord: Ordering[A]) | |
\scala\collection\mutable\PriorityQueueProxy.scala | |
21,38 abstract class PriorityQueueProxy[A](implicit ord: Ordering[A]) extends PriorityQueue[A] | |
\scala\collection\mutable\ResizableArray.scala | |
119,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, ResizableArray[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\mutable\Seq.scala | |
48,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, Seq[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\mutable\Set.scala | |
35,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, Set[A]] = setCanBuildFrom[A] | |
\scala\collection\mutable\SetLike.scala | |
72,40 override def map[B, That](f: A => B)(implicit bf: CanBuildFrom[This, B, That]): That = super.map(f)(bf) | |
\scala\collection\mutable\SynchronizedPriorityQueue.scala | |
26,36 class SynchronizedPriorityQueue[A](implicit ord: Ordering[A]) extends PriorityQueue[A] { | |
\scala\collection\mutable\Traversable.scala | |
33,3 implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, Traversable[A]] = new GenericCanBuildFrom[A] | |
\scala\collection\mutable\WeakHashMap.scala | |
48,3 implicit def canBuildFrom[A, B]: CanBuildFrom[Coll, (A, B), WeakHashMap[A, B]] = new MapCanBuildFrom[A, B] | |
\scala\collection\mutable\WrappedArray.scala | |
53,9 if (implicitly[ClassManifest[U]].erasure eq array.getClass.getComponentType) | |
85,3 implicit def canBuildFrom[T](implicit m: ClassManifest[T]): CanBuildFrom[WrappedArray[_], T, WrappedArray[T]] = | |
\scala\concurrent\FutureTaskRunner.scala | |
11,3 implicit def futureAsFunction[S](x: Future[S]): () => S | |
\scala\concurrent\JavaConversions.scala | |
21,3 implicit def asTaskRunner(exec: ExecutorService): FutureTaskRunner = | |
30,3 implicit def asTaskRunner(exec: Executor): TaskRunner = | |
34,7 implicit def functionAsTask[T](fun: () => T): Task[T] = new Runnable { | |
\scala\concurrent\ops.scala | |
38,25 def spawn(p: => Unit)(implicit runner: TaskRunner = defaultRunner): Unit = { | |
46,26 def future[A](p: => A)(implicit runner: FutureTaskRunner = defaultRunner): () => A = { | |
\scala\concurrent\TaskRunner.scala | |
21,3 implicit def functionAsTask[S](fun: () => S): Task[S] | |
\scala\concurrent\TaskRunners.scala | |
21,3 implicit val threadRunner: FutureTaskRunner = | |
24,3 implicit val threadPoolRunner: FutureTaskRunner = { | |
\scala\concurrent\ThreadPoolRunner.scala | |
31,3 implicit def functionAsTask[S](fun: () => S): Task[S] = | |
34,3 implicit def futureAsFunction[S](x: Future[S]): () => S = | |
\scala\concurrent\ThreadRunner.scala | |
24,3 implicit def functionAsTask[S](fun: () => S): Task[S] = fun | |
25,3 implicit def futureAsFunction[S](x: Future[S]): () => S = x | |
\scala\io\BufferedSource.scala | |
21,65 class BufferedSource(inputStream: InputStream, bufferSize: Int)(implicit val codec: Codec) extends Source { | |
22,38 def this(inputStream: InputStream)(implicit codec: Codec) = this(inputStream, DefaultBufSize)(codec) | |
\scala\io\Codec.scala | |
76,3 implicit def fallbackSystemCodec: Codec = defaultCharsetCodec | |
117,3 implicit def string2codec(s: String) = apply(s) | |
118,3 implicit def charset2codec(c: Charset) = apply(c) | |
119,3 implicit def decoder2codec(cd: CharsetDecoder) = apply(cd) | |
\scala\io\Source.scala | |
53,30 def fromFile(name: String)(implicit codec: Codec): BufferedSource = | |
64,26 def fromFile(uri: URI)(implicit codec: Codec): BufferedSource = | |
75,29 def fromFile(file: JFile)(implicit codec: Codec): BufferedSource = | |
90,46 def fromFile(file: JFile, bufferSize: Int)(implicit codec: Codec): BufferedSource = { | |
108,37 def fromBytes(bytes: Array[Byte])(implicit codec: Codec): Source = | |
122,25 def fromURI(uri: URI)(implicit codec: Codec): BufferedSource = | |
132,26 def fromURL(s: String)(implicit codec: Codec): BufferedSource = | |
142,25 def fromURL(url: URL)(implicit codec: Codec): BufferedSource = | |
160,5 )(implicit codec: Codec): BufferedSource = { | |
170,40 def fromInputStream(is: InputStream)(implicit codec: Codec): BufferedSource = | |
\scala\math\BigDecimal.scala | |
143,3 implicit def int2bigDecimal(i: Int): BigDecimal = apply(i) | |
146,3 implicit def long2bigDecimal(l: Long): BigDecimal = apply(l) | |
149,3 implicit def double2bigDecimal(d: Double): BigDecimal = valueOf(d, defaultMathContext) | |
166,11 private implicit def bigdec2BigDecimal(x: BigDec): BigDecimal = new BigDecimal(x, mc) | |
\scala\math\BigInt.scala | |
102,3 implicit def int2bigInt(i: Int): BigInt = apply(i) | |
106,3 implicit def long2bigInt(l: Long): BigInt = apply(l) | |
\scala\math\Fractional.scala | |
22,12 override implicit def mkNumericOps(lhs: T): FractionalOps = | |
\scala\math\Integral.scala | |
25,12 override implicit def mkNumericOps(lhs: T): IntegralOps = new IntegralOps(lhs) | |
\scala\math\Numeric.scala | |
30,3 implicit object BigIntIsIntegral extends BigIntIsIntegral with Ordering.BigIntOrdering | |
45,3 implicit object IntIsIntegral extends IntIsIntegral with Ordering.IntOrdering | |
60,3 implicit object ShortIsIntegral extends ShortIsIntegral with Ordering.ShortOrdering | |
75,3 implicit object ByteIsIntegral extends ByteIsIntegral with Ordering.ByteOrdering | |
90,3 implicit object CharIsIntegral extends CharIsIntegral with Ordering.CharOrdering | |
105,3 implicit object LongIsIntegral extends LongIsIntegral with Ordering.LongOrdering | |
119,3 implicit object FloatIsFractional extends FloatIsFractional with Ordering.FloatOrdering | |
162,3 implicit object BigDecimalIsFractional extends BigDecimalIsFractional with Ordering.BigDecimalOrdering | |
165,3 implicit object DoubleIsFractional extends DoubleIsFractional with Ordering.DoubleOrdering | |
201,3 implicit def mkNumericOps(lhs: T): Ops = new Ops(lhs) | |
\scala\math\Ordered.scala | |
54,3 implicit def orderingToOrdered[T](x: T)(implicit ord: Ordering[T]): Ordered[T] = | |
\scala\math\Ordering.scala | |
108,3 implicit def mkOrderingOps(lhs: T): Ops = new Ops(lhs) | |
117,3 implicit def ordered[A <: Ordered[A]]: Ordering[A] = new Ordering[A] { | |
124,16 def apply[T](implicit ord : Ordering[T]) = ord | |
135,75 def by[T, S: Ordering](f: T => S): Ordering[T] = fromLessThan((x, y) => implicitly[Ordering[S]].lt(f(x), f(y))) | |
140,3 implicit object Unit extends UnitOrdering | |
149,3 implicit object Boolean extends BooleanOrdering | |
154,3 implicit object Byte extends ByteOrdering | |
159,3 implicit object Char extends CharOrdering | |
164,3 implicit object Short extends ShortOrdering | |
172,3 implicit object Int extends IntOrdering | |
180,3 implicit object Long extends LongOrdering | |
185,3 implicit object Float extends FloatOrdering | |
190,3 implicit object Double extends DoubleOrdering | |
195,3 implicit object BigInt extends BigIntOrdering | |
200,3 implicit object BigDecimal extends BigDecimalOrdering | |
205,3 implicit object String extends StringOrdering | |
207,3 implicit def Option[T](implicit ord: Ordering[T]) : Ordering[Option[T]] = | |
217,3 implicit def Iterable[T](implicit ord: Ordering[T]): Ordering[Iterable[T]] = | |
232,3 implicit def Tuple2[T1, T2](implicit ord1: Ordering[T1], ord2: Ordering[T2]): Ordering[(T1, T2)] = | |
243,3 implicit def Tuple3[T1, T2, T3](implicit ord1: Ordering[T1], ord2: Ordering[T2], ord3: Ordering[T3]) : Ordering[(T1, T2, T3)] = | |
256,3 implicit def Tuple4[T1, T2, T3, T4](implicit ord1: Ordering[T1], ord2: Ordering[T2], ord3: Ordering[T3], ord4: Ordering[T4]) : Ordering[(T1, T2, T3, T4)] = | |
271,3 implicit def Tuple5[T1, T2, T3, T4, T5](implicit ord1: Ordering[T1], ord2: Ordering[T2], ord3: Ordering[T3], ord4: Ordering[T4], ord5: Ordering[T5]): Ordering[(T1, T2, T3, T4, T5)] = | |
288,3 implicit def Tuple6[T1, T2, T3, T4, T5, T6](implicit ord1: Ordering[T1], ord2: Ordering[T2], ord3: Ordering[T3], ord4: Ordering[T4], ord5: Ordering[T5], ord6: Ordering[T6]): Ordering[(T1, T2, T3, T4, T5, T6)] = | |
307,3 implicit def Tuple7[T1, T2, T3, T4, T5, T6, T7](implicit ord1: Ordering[T1], ord2: Ordering[T2], ord3: Ordering[T3], ord4: Ordering[T4], ord5: Ordering[T5], ord6: Ordering[T6], ord7: Ordering[T7]): Ordering[(T1, T2, T3, T4, T5, T6, T7)] = | |
328,3 implicit def Tuple8[T1, T2, T3, T4, T5, T6, T7, T8](implicit ord1: Ordering[T1], ord2: Ordering[T2], ord3: Ordering[T3], ord4: Ordering[T4], ord5: Ordering[T5], ord6: Ordering[T6], ord7: Ordering[T7], ord8: Ordering[T8]): Ordering[(T1, T2, T3, T4, T5, T6, T7, T8)] = | |
351,3 implicit def Tuple9[T1, T2, T3, T4, T5, T6, T7, T8, T9](implicit ord1: Ordering[T1], ord2: Ordering[T2], ord3: Ordering[T3], ord4: Ordering[T4], ord5: Ordering[T5], ord6: Ordering[T6], ord7: Ordering[T7], ord8 : Ordering[T8], ord9: Ordering[T9]): Ordering[(T1, T2, T3, T4, T5, T6, T7, T8, T9)] = | |
\scala\reflect\generic\AnnotationInfos.scala | |
15,3 implicit def classfileAnnotArgManifest: ClassManifest[ClassfileAnnotArg] // need a precise manifest to pass to UnPickle's toArray call | |
\scala\testing\Show.scala | |
41,3 implicit def symApply(sym: Symbol) = new SymApply(sym) | |
\scala\util\Marshal.scala | |
23,21 def dump[A](o: A)(implicit m: ClassManifest[A]): Array[Byte] = { | |
35,36 def load[A](buffer: Array[Byte])(implicit expected: ClassManifest[A]): A = { | |
\scala\util\Random.scala | |
108,58 def shuffle[T, CC[X] <: TraversableOnce[X]](xs: CC[T])(implicit bf: CanBuildFrom[CC[T], T, CC[T]]): CC[T] = { | |
\scala\util\Sorting.scala | |
39,33 def quickSort[K](a: Array[K])(implicit ord: Ordering[K]) { sort1(a, 0, a.length) } | |
49,34 def stableSort[K](a: Array[K])(implicit m: ClassManifest[K], ord: Ordering[K]) { | |
76,32 def stableSort[K](a: Seq[K])(implicit m: ClassManifest[K], ord: Ordering[K]): Array[K] = | |
86,46 def stableSort[K, M](a: Seq[K], f: K => M)(implicit m: ClassManifest[K], ord: Ordering[M]): Array[K] = | |
89,57 private def sort1[K](x: Array[K], off: Int, len: Int)(implicit ord: Ordering[K]) { | |
540,33 class RichSorting[K](s: Seq[K])(implicit m: ClassManifest[K], ord: Ordering[K]) { | |
\scala\util\control\Exception.scala | |
32,3 implicit def fromExceptionCatcher[T](pf: ExceptionCatcher[T]): Catcher[T] = { | |
\scala\util\parsing\ast\Binders.scala | |
41,31 def everywhere(f: Mapper)(implicit c: T => Mappable[T]): T = | |
45,3 implicit def StringIsMappable(s: String): Mappable[String] = | |
50,3 implicit def ListIsMappable[t <% Mappable[t]](xs: List[t]): Mappable[List[t]] = | |
55,3 implicit def OptionIsMappable[t <% Mappable[t]](xs: Option[t]): Mappable[Option[t]] = | |
267,3 implicit def UnderBinderIsMappable[bt <: NameElement <% Mappable[bt], st <% Mappable[st]](ub: UnderBinder[bt, st]): Mappable[UnderBinder[bt, st]] = | |
272,3 implicit def ScopeIsMappable[bt <: NameElement <% Mappable[bt]](scope: Scope[bt]): Mappable[Scope[bt]] = | |
280,3 implicit def NameElementIsMappable(self: NameElement): Mappable[NameElement] = new Mappable[NameElement] { | |
\scala\util\parsing\combinator\ImplicitConversions.scala | |
27,3 implicit def flatten2[A, B, C] (f: (A, B) => C) = | |
29,3 implicit def flatten3[A, B, C, D] (f: (A, B, C) => D) = | |
31,3 implicit def flatten4[A, B, C, D, E] (f: (A, B, C, D) => E) = | |
33,3 implicit def flatten5[A, B, C, D, E, F](f: (A, B, C, D, E) => F) = | |
35,3 implicit def headOptionTailToFunList[A, T] (f: List[A] => T)= | |
\scala\util\parsing\combinator\syntactical\StandardTokenParsers.scala | |
26,12 override implicit def keyword(chars : String): Parser[String] = | |
\scala\util\parsing\combinator\syntactical\StdTokenParsers.scala | |
34,5 implicit def keyword(chars: String): Parser[String] = | |
\scala\util\parsing\combinator\PackratParsers.scala | |
158,3 implicit def parser2packrat[T](p: => super.Parser[T]): PackratParser[T] = { | |
\scala\util\parsing\combinator\Parsers.scala | |
250,36 def ~~ [U, V](q: => Parser[U])(implicit combine: (T, U) => V): Parser[V] = new Parser[V] { | |
460,3 implicit def accept(e: Elem): Parser[Elem] = acceptIf(_ == e)("`"+e+"' expected but " + _ + " found") | |
\scala\util\parsing\combinator\RegexParsers.scala | |
35,3 implicit def literal(s: String): Parser[String] = new Parser[String] { | |
54,3 implicit def regex(r: Regex): Parser[String] = new Parser[String] { | |
\scala\xml\NodeSeq.scala | |
28,3 implicit def canBuildFrom: CanBuildFrom[Coll, Node, NodeSeq] = | |
34,3 implicit def seqToNodeSeq(s: Seq[Node]): NodeSeq = fromSeq(s) | |
\scala\xml\Utility.scala | |
25,3 implicit def implicitSbToString(sb: StringBuilder) = sb.toString() |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment