Value Members

1.  final def !=(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

2.  final def ##(): Int

   Definition Classes

   AnyRef → Any

3.  val <:<: Category[<:<]

   Definition Classes

   TypeConstraintInstances

4.  val =:=: Category[=:=]

   Definition Classes

   TypeConstraintInstances

5.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

6.  implicit val BigDecimalMultiplicationNewType: Monoid[@@[BigDecimal, Multiplication]]

   Definition Classes

   BigDecimalInstances

7.  implicit def FirstLeftProjectionEIso2[E]: Isomorphism.<~>[[α]AnyRef { ... /* 2 definitions in type refinement */ }, [α]Either[E, α]]

   scala.Either.LeftProjection is isomorphic to scala.Either, when the type parameter E is partially applied.

   scala.Either.LeftProjection is isomorphic to scala.Either, when the type parameter E is partially applied.

   Definition Classes

   EitherInstances

8.  implicit val FirstLeftProjectionIso2: Isomorphism.<~~>[[α, β]AnyRef { ... /* 2 definitions in type refinement */ }, Either]

   scala.Either.LeftProjection is isomorphic to scala.Either

   scala.Either.LeftProjection is isomorphic to scala.Either

   Definition Classes

   EitherInstances

9.  implicit def FirstRightProjectionAIso2[A]: Isomorphism.<~>[[α]AnyRef { ... /* 2 definitions in type refinement */ }, [α]Either[α, A]]

   scala.Either.RightProjection is isomorphic to scala.Either, when the type parameter A is partially applied.

   scala.Either.RightProjection is isomorphic to scala.Either, when the type parameter A is partially applied.

   Definition Classes

   EitherInstances

10.  implicit val FirstRightProjectionIso2: Isomorphism.<~~>[[α, β]AnyRef { ... /* 2 definitions in type refinement */ }, Either]

    scala.Either.RightProjection is isomorphic to scala.Either

    scala.Either.RightProjection is isomorphic to scala.Either

    Definition Classes

    EitherInstances

11.  implicit def LastLeftProjectionEIso2[E]: Isomorphism.<~>[[α]AnyRef { ... /* 2 definitions in type refinement */ }, [α]Either[E, α]]

    scala.Either.LeftProjection is isomorphic to scala.Either, when the type parameter E is partially applied.

    scala.Either.LeftProjection is isomorphic to scala.Either, when the type parameter E is partially applied.

    Definition Classes

    EitherInstances

12.  implicit val LastLeftProjectionIso2: Isomorphism.<~~>[[α, β]AnyRef { ... /* 2 definitions in type refinement */ }, Either]

    scala.Either.LeftProjection is isomorphic to scala.Either

    scala.Either.LeftProjection is isomorphic to scala.Either

    Definition Classes

    EitherInstances

13.  implicit def LastRightProjectionAIso2[A]: Isomorphism.<~>[[α]AnyRef { ... /* 2 definitions in type refinement */ }, [α]Either[α, A]]

    scala.Either.RightProjection is isomorphic to scala.Either, when the type parameter A is partially applied.

    scala.Either.RightProjection is isomorphic to scala.Either, when the type parameter A is partially applied.

    Definition Classes

    EitherInstances

14.  implicit val LastRightProjectionIso2: Isomorphism.<~~>[[α, β]AnyRef { ... /* 2 definitions in type refinement */ }, Either]

    scala.Either.RightProjection is isomorphic to scala.Either

    scala.Either.RightProjection is isomorphic to scala.Either

    Definition Classes

    EitherInstances

15.  implicit def LeftProjectionEIso2[E]: Isomorphism.<~>[[α]LeftProjection[E, α], [α]Either[E, α]]

    scala.Either.LeftProjection is isomorphic to scala.Either, when the type parameter E is partially applied.

    scala.Either.LeftProjection is isomorphic to scala.Either, when the type parameter E is partially applied.

    Definition Classes

    EitherInstances

16.  implicit val LeftProjectionIso2: Isomorphism.<~~>[LeftProjection, Either]

    scala.Either.LeftProjection is isomorphic to scala.Either

    scala.Either.LeftProjection is isomorphic to scala.Either

    Definition Classes

    EitherInstances

17.  implicit def RightProjectionAIso2[A]: Isomorphism.<~>[[α]RightProjection[α, A], [α]Either[α, A]]

    scala.Either.RightProjection is isomorphic to scala.Either, when the type parameter A is partially applied.

    scala.Either.RightProjection is isomorphic to scala.Either, when the type parameter A is partially applied.

    Definition Classes

    EitherInstances

18.  implicit val RightProjectionIso2: Isomorphism.<~~>[RightProjection, Either]

    scala.Either.RightProjection is isomorphic to scala.Either

    scala.Either.RightProjection is isomorphic to scala.Either

    Definition Classes

    EitherInstances

19.  final def ab_+[K, V](m: XMap[K, V], k: K, v: V)(implicit arg0: BuildKeyConstraint[K]): XMap[K, V]

    How MapLike#updated might be typed in a sane world.

    How MapLike#updated might be typed in a sane world. A world that embraced higher kinds, instead of shunning them.

    Attributes

    protected

    Definition Classes

    MapSubMap → MapSub

20.  final def ab_-[K, V](m: XMap[K, V], k: K)(implicit arg0: BuildKeyConstraint[K]): XMap[K, V]

    As with ab_+, but with MapLike#-.

    As with ab_+, but with MapLike#-.

    Attributes

    protected

    Definition Classes

    MapSubMap → MapSub

21.  final def alter[K, A](m: XMap[K, A], k: K)(f: (Option[A]) ⇒ Option[A])(implicit arg0: BuildKeyConstraint[K]): XMap[K, A]

    Vary the value of m get k.

    Vary the value of m get k.

    Definition Classes

    MapSubFunctions

22.  final def asInstanceOf[T0]: T0

    Definition Classes

    Any

23.  implicit val bigDecimalInstance: Monoid[BigDecimal] with Enum[BigDecimal] with Show[BigDecimal]

    Definition Classes

    BigDecimalInstances

24.  implicit val bigIntInstance: Monoid[BigInt] with Enum[BigInt] with Show[BigInt]

    Definition Classes

    BigInts

25.  implicit val bigIntMultiplication: Monoid[@@[BigInt, Multiplication]] with Order[@@[BigInt, Multiplication]] with Show[@@[BigInt, Multiplication]]

    Definition Classes

    BigInts

26.  implicit val bigIntegerInstance: Monoid[BigInteger] with Enum[BigInteger] with Show[BigInteger]

    Definition Classes

    BigIntegerInstances

27.  implicit val bigIntegerMultiplication: Monoid[@@[BigInteger, Multiplication]] with Order[@@[BigInteger, Multiplication]] with Show[@@[BigInteger, Multiplication]]

    Definition Classes

    BigIntegerInstances

28.  implicit val booleanConjunctionNewTypeInstance: Monoid[@@[Boolean, Conjunction]] with Enum[@@[Boolean, Conjunction]]

    Definition Classes

    AnyValInstances

29.  implicit val booleanDisjunctionNewTypeInstance: Monoid[@@[Boolean, Tags.Disjunction]] with Enum[@@[Boolean, Tags.Disjunction]]

    Definition Classes

    AnyValInstances

30.  final def buildXMap[K, V, K2, V2](implicit arg0: BuildKeyConstraint[K2]): CanBuildFrom[XMap[K, V], (K2, V2), XMap[K2, V2]]

    Attributes

    protected

    Definition Classes

    MapSubMap → MapSub

31.  implicit val byteInstance: Monoid[Byte] with Enum[Byte] with Show[Byte]

    Definition Classes

    AnyValInstances

32.  implicit val byteMultiplicationNewType: Monoid[@@[Byte, Multiplication]] with Enum[@@[Byte, Multiplication]]

    Definition Classes

    AnyValInstances

33.  implicit val callableMonad: Monad[Callable]

    Definition Classes

    CallableInstances

34.  implicit def callableOrder[A](implicit arg0: Order[A]): Order[Callable[A]]

    Definition Classes

    CallableInstances

35.  implicit val char: Monoid[Char] with Enum[Char] with Show[Char]

    Definition Classes

    AnyValInstances

36.  implicit val charMultiplicationNewType: Monoid[@@[Char, Multiplication]] with Enum[@@[Char, Multiplication]]

    Definition Classes

    AnyValInstances

37.  def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

38.  implicit val doubleInstance: Order[Double] with Show[Double]

    Definition Classes

    AnyValInstances

39.  implicit def eitherEqual[A, B](implicit A0: Equal[A], B0: Equal[B]): Equal[Either[A, B]]

    Definition Classes

    EitherInstances0

40.  implicit def eitherFirstLeftEqual[A, X](implicit A0: Equal[A]): Equal[@@[LeftProjection[A, X], First]]

    Definition Classes

    EitherInstances0

41.  implicit val eitherFirstLeftInstance: IsomorphismBifunctor[[a, b]AnyRef { ... /* 2 definitions in type refinement */ }, Either]

    Definition Classes

    EitherInstances

42.  implicit def eitherFirstLeftMonoid[A, X](implicit MonoidX: Monoid[X]): Monoid[@@[LeftProjection[A, X], First]]

    Definition Classes

    EitherInstances

43.  implicit def eitherFirstLeftOrder[A, X](implicit OrderA: Order[A]): Order[@@[LeftProjection[A, X], First]]

    Definition Classes

    EitherInstances

44.  implicit def eitherFirstLeftRInstance[R]: Monad[[α]AnyRef { ... /* 2 definitions in type refinement */ }]

    Definition Classes

    EitherInstances

45.  implicit def eitherFirstLeftSemigroup[A, X](implicit arg0: Semigroup[A]): Semigroup[@@[LeftProjection[A, X], First]]

    Definition Classes

    EitherInstances0

46.  implicit def eitherFirstRightEqual[X, A](implicit A0: Equal[A]): Equal[@@[RightProjection[X, A], First]]

    Definition Classes

    EitherInstances0

47.  implicit def eitherFirstRightLInstance[L]: Monad[[α]AnyRef { ... /* 2 definitions in type refinement */ }]

    Definition Classes

    EitherInstances

48.  implicit def eitherFirstRightMonoid[X, A](implicit MonoidX: Monoid[X]): Monoid[@@[RightProjection[X, A], First]]

    Definition Classes

    EitherInstances

49.  implicit def eitherFirstRightOrder[X, A](implicit OrderA: Order[A]): Order[@@[RightProjection[X, A], First]]

    Definition Classes

    EitherInstances

50.  implicit def eitherFirstRightSemigroup[X, A](implicit arg0: Semigroup[A]): Semigroup[@@[RightProjection[X, A], First]]

    Definition Classes

    EitherInstances0

51.  implicit val eitherInstance: Bitraverse[Either]

    Definition Classes

    EitherInstances

52.  implicit def eitherLastLeftEqual[A, X](implicit A0: Equal[A]): Equal[@@[LeftProjection[A, X], Last]]

    Definition Classes

    EitherInstances0

53.  implicit def eitherLastLeftMonoid[A, X](implicit MonoidX: Monoid[X]): Monoid[@@[LeftProjection[A, X], Last]]

    Definition Classes

    EitherInstances

54.  implicit def eitherLastLeftOrder[A, X](implicit OrderA: Order[A]): Order[@@[LeftProjection[A, X], Last]]

    Definition Classes

    EitherInstances

55.  implicit def eitherLastLeftRInstance[R]: Monad[[α]AnyRef { ... /* 2 definitions in type refinement */ }]

    Definition Classes

    EitherInstances

56.  implicit def eitherLastLeftSemigroup[A, X](implicit arg0: Semigroup[A]): Semigroup[@@[LeftProjection[A, X], Last]]

    Definition Classes

    EitherInstances0

57.  implicit def eitherLastRightEqual[X, A](implicit A0: Equal[A]): Equal[@@[RightProjection[X, A], Last]]

    Definition Classes

    EitherInstances0

58.  implicit def eitherLastRightLInstance[L]: Monad[[α]AnyRef { ... /* 2 definitions in type refinement */ }]

    Definition Classes

    EitherInstances

59.  implicit def eitherLastRightMonoid[X, A](implicit MonoidX: Monoid[X]): Monoid[@@[RightProjection[X, A], Last]]

    Definition Classes

    EitherInstances

60.  implicit def eitherLastRightOrder[X, A](implicit OrderA: Order[A]): Order[@@[RightProjection[X, A], Last]]

    Definition Classes

    EitherInstances

61.  implicit def eitherLastRightSemigroup[X, A](implicit arg0: Semigroup[A]): Semigroup[@@[RightProjection[X, A], Last]]

    Definition Classes

    EitherInstances0

62.  implicit def eitherLeftEqual[A, X](implicit A0: Equal[A]): Equal[LeftProjection[A, X]]

    Definition Classes

    EitherInstances0

63.  implicit val eitherLeftInstance: IsomorphismBifunctor[LeftProjection, Either]

    Definition Classes

    EitherInstances

64.  implicit def eitherLeftMonoid[A, X](implicit MonoidA: Monoid[A], MonoidX: Monoid[X]): Monoid[LeftProjection[A, X]]

    Definition Classes

    EitherInstances

65.  implicit def eitherLeftOrder[A, X](implicit OrderA: Order[A]): Order[LeftProjection[A, X]]

    Definition Classes

    EitherInstances

66.  implicit def eitherLeftRInstance[R]: Monad[[α]LeftProjection[α, R]] { def point[A](a: => A): scala.util.Either.LeftProjection[A,Nothing] }

    Definition Classes

    EitherInstances

67.  implicit def eitherLeftSemigroup[A, X](implicit SemigroupA: Semigroup[A], MonoidX: Monoid[X]): Semigroup[LeftProjection[A, X]]

    Definition Classes

    EitherInstances0

68.  implicit def eitherMonad[L]: Traverse[[a]Either[L, a]] with MonadError[Either, L] with Cozip[[a]Either[L, a]]

    Right biased monad

    Right biased monad

    Definition Classes

    EitherInstances

69.  implicit def eitherOrder[A, B](implicit OrderA: Order[A], OrderB: Order[B]): Order[Either[A, B]]

    Definition Classes

    EitherInstances

70.  implicit def eitherRightEqual[X, A](implicit A0: Equal[A]): Equal[RightProjection[X, A]]

    Definition Classes

    EitherInstances0

71.  implicit val eitherRightInstance: IsomorphismBifunctor[RightProjection, Either]

    Definition Classes

    EitherInstances

72.  implicit def eitherRightLInstance[L]: Monad[[α]RightProjection[L, α]] { def point[A](a: => A): scala.util.Either.RightProjection[Nothing,A] }

    Definition Classes

    EitherInstances

73.  implicit def eitherRightMonoid[X, A](implicit MonoidX: Monoid[X], MonoidA: Monoid[A]): Monoid[RightProjection[X, A]]

    Definition Classes

    EitherInstances

74.  implicit def eitherRightOrder[X, A](implicit OrderA: Order[A]): Order[RightProjection[X, A]]

    Definition Classes

    EitherInstances

75.  implicit def eitherRightSemigroup[X, A](implicit MonoidX: Monoid[X], SemigroupA: Semigroup[A]): Semigroup[RightProjection[X, A]]

    Definition Classes

    EitherInstances0

76.  implicit def enumInstance[E <: java.lang.Enum[E]]: Equal[E]

    Definition Classes

    EnumInstances

77.  final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

78.  def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

79.  def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

80.  implicit val floatInstance: Order[Float] with Show[Float]

    Definition Classes

    AnyValInstances

81.  implicit def function0Equal[R](implicit arg0: Equal[R]): Equal[() ⇒ R]

    Definition Classes

    FunctionInstances

82.  implicit val function0Instance: Traverse[Function0] with Monad[Function0] with Comonad[Function0] with Distributive[Function0]

    Definition Classes

    FunctionInstances

83.  implicit def function1Cobind[A, R](implicit A0: Semigroup[A]): Cobind[[α](A) ⇒ α]

    Definition Classes

    FunctionInstances1

84.  implicit def function1Comonad[A, R](implicit A0: Monoid[A]): Comonad[[α](A) ⇒ α]

    Definition Classes

    FunctionInstances0

85.  implicit def function1Contravariant[R]: Contravariant[[a](a) ⇒ R]

    Definition Classes

    FunctionInstances

86.  implicit def function1Covariant[T]: Monad[[a](T) ⇒ a] with Zip[[a](T) ⇒ a] with Unzip[[a](T) ⇒ a] with Distributive[[a](T) ⇒ a]

    Definition Classes

    FunctionInstances

87.  implicit def function1CovariantByName[T]: Monad[[a](⇒ T) ⇒ a] with Zip[[a](⇒ T) ⇒ a] with Unzip[[a](⇒ T) ⇒ a] with Distributive[[a](⇒ T) ⇒ a]

    Definition Classes

    FunctionInstances0

88.  implicit val function1Instance: Arrow[Function1] with Choice[Function1] with ProChoice[Function1]

    Definition Classes

    FunctionInstances

89.  implicit def function1Monoid[A, R](implicit R0: Monoid[R]): Monoid[(A) ⇒ R]

    Definition Classes

    FunctionInstances0

90.  implicit def function1Semigroup[A, R](implicit R0: Semigroup[R]): Semigroup[(A) ⇒ R]

    Definition Classes

    FunctionInstances1

91.  implicit def function2Instance[T1, T2]: Monad[[a](T1, T2) ⇒ a]

    Definition Classes

    FunctionInstances

92.  implicit def function3Instance[T1, T2, T3]: Monad[[a](T1, T2, T3) ⇒ a]

    Definition Classes

    FunctionInstances

93.  implicit def function4Instance[T1, T2, T3, T4]: Monad[[a](T1, T2, T3, T4) ⇒ a]

    Definition Classes

    FunctionInstances

94.  implicit def function5Instance[T1, T2, T3, T4, T5]: Monad[[a](T1, T2, T3, T4, T5) ⇒ a]

    Definition Classes

    FunctionInstances

95.  implicit def function6Instance[T1, T2, T3, T4, T5, T6]: Monad[[a](T1, T2, T3, T4, T5, T6) ⇒ a]

    Definition Classes

    FunctionInstances

96.  implicit def function7Instance[T1, T2, T3, T4, T5, T6, T7]: Monad[[a](T1, T2, T3, T4, T5, T6, T7) ⇒ a]

    Definition Classes

    FunctionInstances

97.  implicit def function8Instance[T1, T2, T3, T4, T5, T6, T7, T8]: Monad[[a](T1, T2, T3, T4, T5, T6, T7, T8) ⇒ a]

    Definition Classes

    FunctionInstances

98.  def futureComonad(duration: Duration)(implicit executionContext: ExecutionContext): Comonad[Future]

    Requires explicit usage as the use of Await.result.

    Requires explicit usage as the use of Await.result. Can throw an exception, which is inherently bad.

    Definition Classes

    FutureInstances

99.  def futureInstance(implicit ec: ExecutionContext): Monad[Future] with Cobind[Future]

    Definition Classes

    FutureInstances1

100.  implicit def futureMonoid[A](implicit g: Monoid[A], ec: ExecutionContext): Monoid[Future[A]]

     Definition Classes

     FutureInstances

101.  implicit def futureSemigroup[A](implicit m: Semigroup[A], ec: ExecutionContext): Semigroup[Future[A]]

     Definition Classes

     FutureInstances1

102.  final def getClass(): Class[_]

     Definition Classes

     AnyRef → Any

103.  final def getOrAdd[F[_], K, A](m: XMap[K, A], k: K)(fa: ⇒ F[A])(implicit F: Applicative[F], K: BuildKeyConstraint[K]): F[(XMap[K, A], A)]

     Grab a value out of Map if it's present.

     Grab a value out of Map if it's present. Otherwise evaluate a value to be placed at that key in the Map.

     Definition Classes

     MapSubFunctions

104.  def hashCode(): Int

     Definition Classes

     AnyRef → Any

105.  final def insertWith[K, A](m1: XMap[K, A], k: K, v: A)(f: (A, A) ⇒ A)(implicit arg0: BuildKeyConstraint[K]): XMap[K, A]

     As with Map.updated, but resolve a collision with f.

     As with Map.updated, but resolve a collision with f. The first argument is guaranteed to be from m1.

     Definition Classes

     MapSubFunctions

106.  implicit val intInstance: Monoid[Int] with Enum[Int] with Show[Int]

     Definition Classes

     AnyValInstances

107.  implicit val intMultiplicationNewType: Monoid[@@[Int, Multiplication]] with Enum[@@[Int, Multiplication]]

     Definition Classes

     AnyValInstances

108.  final def intersectWith[K, A, B, C](m1: XMap[K, A], m2: XMap[K, B])(f: (A, B) ⇒ C)(implicit arg0: BuildKeyConstraint[K]): XMap[K, C]

     Collect only elements with matching keys, joining their associated values with f.

     Collect only elements with matching keys, joining their associated values with f.

     Definition Classes

     MapSubFunctions

109.  final def intersectWithKey[K, A, B, C](m1: XMap[K, A], m2: XMap[K, B])(f: (K, A, B) ⇒ C)(implicit arg0: BuildKeyConstraint[K]): XMap[K, C]

     Like intersectWith, but tell f about the key.

     Like intersectWith, but tell f about the key.

     Definition Classes

     MapSubFunctions

110.  final def isInstanceOf[T0]: Boolean

     Definition Classes

     Any

111.  implicit def listEqual[A](implicit A0: Equal[A]): Equal[List[A]]

     Definition Classes

     ListInstances0

112.  implicit val listInstance: Traverse[List] with MonadPlus[List] with Each[List] with Index[List] with Length[List] with Zip[List] with Unzip[List] with Align[List] with IsEmpty[List] with Cobind[List] { def empty[A]: scala.collection.immutable.Nil.type }

     Definition Classes

     ListInstances

113.  implicit def listMonoid[A]: Monoid[List[A]]

     Definition Classes

     ListInstances

114.  implicit def listOrder[A](implicit A0: Order[A]): Order[List[A]]

     Definition Classes

     ListInstances

115.  implicit def listShow[A](implicit arg0: Show[A]): Show[List[A]]

     Definition Classes

     ListInstances

116.  implicit val longInstance: Monoid[Long] with Enum[Long] with Show[Long]

     Definition Classes

     AnyValInstances

117.  implicit val longMultiplicationNewType: Monoid[@@[Long, Multiplication]] with Enum[@@[Long, Multiplication]]

     Definition Classes

     AnyValInstances

118.  implicit val mapEntryBitraverse: Bitraverse[Entry]

     Definition Classes

     MapInstances

119.  implicit def mapEqual[K, V](implicit arg0: Order[K], arg1: Equal[V]): Equal[XMap[K, V]]

     Definition Classes

     MapSubInstances0

120.  implicit def mapFoldable[K]: Foldable[[V]XMap[K, V]]

     Definition Classes

     MapSubInstances0

121.  implicit def mapInstance[K](implicit arg0: BuildKeyConstraint[K]): Traverse[[V]XMap[K, V]] with IsEmpty[[V]XMap[K, V]] with Bind[[V]XMap[K, V]] with Align[[V]XMap[K, V]]

     Covariant over the value parameter, where plus applies the Last semigroup to values.

     Covariant over the value parameter, where plus applies the Last semigroup to values.

     Definition Classes

     MapSubInstances

122.  final def mapKeys[K, K2, A](m: XMap[K, A])(f: (K) ⇒ K2)(implicit arg0: BuildKeyConstraint[K2]): XMap[K2, A]

     Exchange keys of m according to f.

     Exchange keys of m according to f. Result may be smaller if f maps two or more Ks to the same K2, in which case the resulting associated value is an arbitrary choice.

     Definition Classes

     MapSubFunctions

123.  implicit def mapMonoid[K, V](implicit arg0: BuildKeyConstraint[K], arg1: Semigroup[V]): Monoid[XMap[K, V]]

     Map union monoid, unifying values with V's append.

     Map union monoid, unifying values with V's append.

     Definition Classes

     MapSubInstances

124.  implicit def mapOrder[K, V](implicit arg0: Order[K], arg1: Order[V]): Order[XMap[K, V]]

     Definition Classes

     MapSubInstances

125.  implicit def mapShow[K, V](implicit K: Show[K], V: Show[V]): Show[XMap[K, V]]

     Definition Classes

     MapSubInstances

126.  final def ne(arg0: AnyRef): Boolean

     Definition Classes

     AnyRef

127.  implicit val nodeSeqInstance: Monoid[NodeSeq] with Show[NodeSeq] with Equal[NodeSeq]

     Definition Classes

     NodeSeqInstances

128.  final def notify(): Unit

     Definition Classes

     AnyRef

129.  final def notifyAll(): Unit

     Definition Classes

     AnyRef

130.  implicit def optionEqual[A](implicit A0: Equal[A]): Equal[Option[A]]

     Definition Classes

     OptionInstances0

131.  implicit def optionFirst[A]: Monoid[FirstOption[A]]

     Definition Classes

     OptionInstances

132.  implicit def optionFirstMonad: Monad[FirstOption]

     Definition Classes

     OptionInstances

133.  implicit def optionFirstOrder[A](implicit arg0: Order[A]): Order[FirstOption[A]]

     Definition Classes

     OptionInstances

134.  implicit def optionFirstShow[A](implicit arg0: Show[A]): Show[FirstOption[A]]

     Definition Classes

     OptionInstances

135.  implicit val optionInstance: Traverse[Option] with MonadPlus[Option] with Each[Option] with Index[Option] with Length[Option] with Cozip[Option] with Zip[Option] with Unzip[Option] with Align[Option] with IsEmpty[Option] with Cobind[Option] with Optional[Option] { ... /* 2 definitions in type refinement */ }

     Definition Classes

     OptionInstances

136.  implicit def optionLast[A]: Monoid[LastOption[A]]

     Definition Classes

     OptionInstances

137.  implicit def optionLastMonad: Monad[LastOption]

     Definition Classes

     OptionInstances

138.  implicit def optionLastOrder[A](implicit arg0: Order[A]): Order[LastOption[A]]

     Definition Classes

     OptionInstances

139.  implicit def optionLastShow[A](implicit arg0: Show[A]): Show[LastOption[A]]

     Definition Classes

     OptionInstances

140.  implicit def optionMax[A](implicit o: Order[A]): Monoid[MaxOption[A]]

     Definition Classes

     OptionInstances

141.  implicit def optionMaxMonad: Monad[MaxOption]

     Definition Classes

     OptionInstances

142.  implicit def optionMaxOrder[A](implicit arg0: Order[A]): Order[MaxOption[A]]

     Definition Classes

     OptionInstances

143.  implicit def optionMaxShow[A](implicit arg0: Show[A]): Show[MaxOption[A]]

     Definition Classes

     OptionInstances

144.  implicit def optionMin[A](implicit o: Order[A]): Monoid[MinOption[A]]

     Definition Classes

     OptionInstances

145.  implicit def optionMinMonad: Monad[MinOption]

     Definition Classes

     OptionInstances

146.  implicit def optionMinOrder[A](implicit arg0: Order[A]): Order[MinOption[A]]

     Definition Classes

     OptionInstances

147.  implicit def optionMinShow[A](implicit arg0: Show[A]): Show[MinOption[A]]

     Definition Classes

     OptionInstances

148.  implicit def optionMonoid[A](implicit arg0: Semigroup[A]): Monoid[Option[A]]

     Definition Classes

     OptionInstances

149.  implicit def optionOrder[A](implicit A0: Order[A]): Order[Option[A]]

     Add None as an element less than all As.

     Add None as an element less than all As.

     Definition Classes

     OptionInstances

150.  implicit def optionShow[A](implicit arg0: Show[A]): Show[Option[A]]

     Definition Classes

     OptionInstances

151.  def orderingMonoid[A]: Monoid[scala.math.Ordering[A]]

     Definition Classes

     OrderingInstances

152.  def parserMonad[P <: Parsers](p: P): Monad[[A]util.parsing.combinator.Parsers.parserMonad.P.Parser[A]] forSome {val _1: ParsersW[P]}

     Definition Classes

     Parsers

153.  implicit val partialFunctionInstance: Arrow[PartialFunction] with Category[PartialFunction] with Choice[PartialFunction]

     Definition Classes

     PartialFunctionInstances

154.  implicit val setInstance: Foldable[Set] with IsEmpty[Set] with Length[Set]

     Definition Classes

     SetInstances

155.  implicit def setMonoid[A]: Monoid[Set[A]]

     Definition Classes

     SetInstances

156.  implicit def setOrder[A](implicit arg0: Order[A]): Order[Set[A]]

     We could derive set equality from Equal[A], but it would be O(n^2). Instead, we require Order[A], reducing the complexity to O(log n)

     We could derive set equality from Equal[A], but it would be O(n^2). Instead, we require Order[A], reducing the complexity to O(log n)

     If Equal[A].equalIsNatural == true, than Any#== is used.

     Definition Classes

     SetInstances

157.  implicit def setShow[A](implicit arg0: Show[A]): Show[Set[A]]

     Definition Classes

     SetInstances

158.  implicit val shortInstance: Monoid[Short] with Enum[Short] with Show[Short]

     Definition Classes

     AnyValInstances

159.  implicit val shortMultiplicationNewType: Monoid[@@[Short, Multiplication]] with Enum[@@[Short, Multiplication]]

     Definition Classes

     AnyValInstances

160.  implicit def streamEqual[A](implicit A0: Equal[A]): Equal[Stream[A]]

     Definition Classes

     StreamInstances

161.  implicit val streamInstance: Traverse[Stream] with MonadPlus[Stream] with Each[Stream] with Index[Stream] with Length[Stream] with Zip[Stream] with Unzip[Stream] with Align[Stream] with IsEmpty[Stream] with Cobind[Stream]

     Definition Classes

     StreamInstances

162.  implicit def streamMonoid[A]: Monoid[Stream[A]]

     Definition Classes

     StreamInstances

163.  implicit def streamShow[A](implicit A0: Show[A]): Show[Stream[A]]

     Definition Classes

     StreamInstances

164.  implicit val streamZipApplicative: Applicative[[α]AnyRef { ... /* 2 definitions in type refinement */ }]

     An alternative scalaz.Applicative instance for Stream, discriminated by the type tag scalaz.Tags.Zip, that zips streams together.

     An alternative scalaz.Applicative instance for Stream, discriminated by the type tag scalaz.Tags.Zip, that zips streams together.

     Example:

     import scalaz.Tags.Zip
     streamZipApplicative.apply2(Zip(Stream(1, 2)), Zip(Stream(3, 4)))(_ * _) // Stream(3, 8)

     Definition Classes

     StreamInstances

165.  final def synchronized[T0](arg0: ⇒ T0): T0

     Definition Classes

     AnyRef

166.  def toString(): String

     Definition Classes

     AnyRef → Any

167.  implicit val tuple1Cozip: Cozip[Tuple1]

     Definition Classes

     TupleInstances1

168.  implicit def tuple1Equal[A1](implicit A1: Equal[A1]): Equal[(A1)]

     Definition Classes

     TupleInstances0

169.  implicit val tuple1Instance: Traverse[Tuple1] with Monad[Tuple1] with Comonad[Tuple1]

     Tuple1[A] is isomorphic to Id[X]

     Tuple1[A] is isomorphic to Id[X]

     Definition Classes

     TupleInstances0

170.  implicit def tuple1Monoid[A1](implicit A1: Monoid[A1]): Monoid[(A1)]

     Definition Classes

     TupleInstances1

171.  implicit def tuple1Order[A1](implicit A1: Order[A1]): Order[(A1)]

     Definition Classes

     TupleInstances1

172.  implicit def tuple1Semigroup[A1](implicit A1: Semigroup[A1]): Semigroup[(A1)]

     Definition Classes

     TupleInstances0

173.  implicit def tuple1Show[A1](implicit A1: Show[A1]): Show[(A1)]

     Definition Classes

     TupleInstances1

174.  implicit val tuple2Bitraverse: Bitraverse[Tuple2]

     Definition Classes

     TupleInstances0

175.  implicit def tuple2Cozip[A1]: Cozip[[x](A1, x)]

     Definition Classes

     TupleInstances1

176.  implicit def tuple2Equal[A1, A2](implicit A1: Equal[A1], A2: Equal[A2]): Equal[(A1, A2)]

     Definition Classes

     TupleInstances0

177.  implicit def tuple2Instance[A1]: Traverse[[x](A1, x)] with Comonad[[x](A1, x)]

     Product functor and comonad

     Product functor and comonad

     Definition Classes

     TupleInstances0

178.  implicit def tuple2Monad[A1](implicit A1: Monoid[A1]): Monad[[x](A1, x)]

     Definition Classes

     TupleInstances1

179.  implicit def tuple2Monoid[A1, A2](implicit A1: Monoid[A1], A2: Monoid[A2]): Monoid[(A1, A2)]

     Definition Classes

     TupleInstances1

180.  implicit def tuple2Order[A1, A2](implicit A1: Order[A1], A2: Order[A2]): Order[(A1, A2)]

     Definition Classes

     TupleInstances1

181.  implicit def tuple2Semigroup[A1, A2](implicit A1: Semigroup[A1], A2: Semigroup[A2]): Semigroup[(A1, A2)]

     Definition Classes

     TupleInstances0

182.  implicit def tuple2Show[A1, A2](implicit A1: Show[A1], A2: Show[A2]): Show[(A1, A2)]

     Definition Classes

     TupleInstances1

183.  implicit def tuple3Cozip[A1, A2]: Cozip[[x](A1, A2, x)]

     Definition Classes

     TupleInstances1

184.  implicit def tuple3Equal[A1, A2, A3](implicit A1: Equal[A1], A2: Equal[A2], A3: Equal[A3]): Equal[(A1, A2, A3)]

     Definition Classes

     TupleInstances0

185.  implicit def tuple3Functor[A1, A2]: Traverse[[x](A1, A2, x)]

     Definition Classes

     TupleInstances0

186.  implicit def tuple3Monad[A1, A2](implicit A1: Monoid[A1], A2: Monoid[A2]): Monad[[x](A1, A2, x)]

     Definition Classes

     TupleInstances1

187.  implicit def tuple3Monoid[A1, A2, A3](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3]): Monoid[(A1, A2, A3)]

     Definition Classes

     TupleInstances1

188.  implicit def tuple3Order[A1, A2, A3](implicit A1: Order[A1], A2: Order[A2], A3: Order[A3]): Order[(A1, A2, A3)]

     Definition Classes

     TupleInstances1

189.  implicit def tuple3Semigroup[A1, A2, A3](implicit A1: Semigroup[A1], A2: Semigroup[A2], A3: Semigroup[A3]): Semigroup[(A1, A2, A3)]

     Definition Classes

     TupleInstances0

190.  implicit def tuple3Show[A1, A2, A3](implicit A1: Show[A1], A2: Show[A2], A3: Show[A3]): Show[(A1, A2, A3)]

     Definition Classes

     TupleInstances1

191.  implicit def tuple4Cozip[A1, A2, A3]: Cozip[[x](A1, A2, A3, x)]

     Definition Classes

     TupleInstances1

192.  implicit def tuple4Equal[A1, A2, A3, A4](implicit A1: Equal[A1], A2: Equal[A2], A3: Equal[A3], A4: Equal[A4]): Equal[(A1, A2, A3, A4)]

     Definition Classes

     TupleInstances0

193.  implicit def tuple4Functor[A1, A2, A3]: Traverse[[x](A1, A2, A3, x)]

     Definition Classes

     TupleInstances0

194.  implicit def tuple4Monad[A1, A2, A3](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3]): Monad[[x](A1, A2, A3, x)]

     Definition Classes

     TupleInstances1

195.  implicit def tuple4Monoid[A1, A2, A3, A4](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4]): Monoid[(A1, A2, A3, A4)]

     Definition Classes

     TupleInstances1

196.  implicit def tuple4Order[A1, A2, A3, A4](implicit A1: Order[A1], A2: Order[A2], A3: Order[A3], A4: Order[A4]): Order[(A1, A2, A3, A4)]

     Definition Classes

     TupleInstances1

197.  implicit def tuple4Semigroup[A1, A2, A3, A4](implicit A1: Semigroup[A1], A2: Semigroup[A2], A3: Semigroup[A3], A4: Semigroup[A4]): Semigroup[(A1, A2, A3, A4)]

     Definition Classes

     TupleInstances0

198.  implicit def tuple4Show[A1, A2, A3, A4](implicit A1: Show[A1], A2: Show[A2], A3: Show[A3], A4: Show[A4]): Show[(A1, A2, A3, A4)]

     Definition Classes

     TupleInstances1

199.  implicit def tuple5Cozip[A1, A2, A3, A4]: Cozip[[x](A1, A2, A3, A4, x)]

     Definition Classes

     TupleInstances1

200.  implicit def tuple5Equal[A1, A2, A3, A4, A5](implicit A1: Equal[A1], A2: Equal[A2], A3: Equal[A3], A4: Equal[A4], A5: Equal[A5]): Equal[(A1, A2, A3, A4, A5)]

     Definition Classes

     TupleInstances0

201.  implicit def tuple5Functor[A1, A2, A3, A4]: Traverse[[x](A1, A2, A3, A4, x)]

     Definition Classes

     TupleInstances0

202.  implicit def tuple5Monad[A1, A2, A3, A4](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4]): Monad[[x](A1, A2, A3, A4, x)]

     Definition Classes

     TupleInstances1

203.  implicit def tuple5Monoid[A1, A2, A3, A4, A5](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5]): Monoid[(A1, A2, A3, A4, A5)]

     Definition Classes

     TupleInstances1

204.  implicit def tuple5Order[A1, A2, A3, A4, A5](implicit A1: Order[A1], A2: Order[A2], A3: Order[A3], A4: Order[A4], A5: Order[A5]): Order[(A1, A2, A3, A4, A5)]

     Definition Classes

     TupleInstances1

205.  implicit def tuple5Semigroup[A1, A2, A3, A4, A5](implicit A1: Semigroup[A1], A2: Semigroup[A2], A3: Semigroup[A3], A4: Semigroup[A4], A5: Semigroup[A5]): Semigroup[(A1, A2, A3, A4, A5)]

     Definition Classes

     TupleInstances0

206.  implicit def tuple5Show[A1, A2, A3, A4, A5](implicit A1: Show[A1], A2: Show[A2], A3: Show[A3], A4: Show[A4], A5: Show[A5]): Show[(A1, A2, A3, A4, A5)]

     Definition Classes

     TupleInstances1

207.  implicit def tuple6Cozip[A1, A2, A3, A4, A5]: Cozip[[x](A1, A2, A3, A4, A5, x)]

     Definition Classes

     TupleInstances1

208.  implicit def tuple6Equal[A1, A2, A3, A4, A5, A6](implicit A1: Equal[A1], A2: Equal[A2], A3: Equal[A3], A4: Equal[A4], A5: Equal[A5], A6: Equal[A6]): Equal[(A1, A2, A3, A4, A5, A6)]

     Definition Classes

     TupleInstances0

209.  implicit def tuple6Functor[A1, A2, A3, A4, A5]: Traverse[[x](A1, A2, A3, A4, A5, x)]

     Definition Classes

     TupleInstances0

210.  implicit def tuple6Monad[A1, A2, A3, A4, A5](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5]): Monad[[x](A1, A2, A3, A4, A5, x)]

     Definition Classes

     TupleInstances1

211.  implicit def tuple6Monoid[A1, A2, A3, A4, A5, A6](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5], A6: Monoid[A6]): Monoid[(A1, A2, A3, A4, A5, A6)]

     Definition Classes

     TupleInstances1

212.  implicit def tuple6Order[A1, A2, A3, A4, A5, A6](implicit A1: Order[A1], A2: Order[A2], A3: Order[A3], A4: Order[A4], A5: Order[A5], A6: Order[A6]): Order[(A1, A2, A3, A4, A5, A6)]

     Definition Classes

     TupleInstances1

213.  implicit def tuple6Semigroup[A1, A2, A3, A4, A5, A6](implicit A1: Semigroup[A1], A2: Semigroup[A2], A3: Semigroup[A3], A4: Semigroup[A4], A5: Semigroup[A5], A6: Semigroup[A6]): Semigroup[(A1, A2, A3, A4, A5, A6)]

     Definition Classes

     TupleInstances0

214.  implicit def tuple6Show[A1, A2, A3, A4, A5, A6](implicit A1: Show[A1], A2: Show[A2], A3: Show[A3], A4: Show[A4], A5: Show[A5], A6: Show[A6]): Show[(A1, A2, A3, A4, A5, A6)]

     Definition Classes

     TupleInstances1

215.  implicit def tuple7Cozip[A1, A2, A3, A4, A5, A6]: Cozip[[x](A1, A2, A3, A4, A5, A6, x)]

     Definition Classes

     TupleInstances1

216.  implicit def tuple7Equal[A1, A2, A3, A4, A5, A6, A7](implicit A1: Equal[A1], A2: Equal[A2], A3: Equal[A3], A4: Equal[A4], A5: Equal[A5], A6: Equal[A6], A7: Equal[A7]): Equal[(A1, A2, A3, A4, A5, A6, A7)]

     Definition Classes

     TupleInstances0

217.  implicit def tuple7Functor[A1, A2, A3, A4, A5, A6]: Traverse[[x](A1, A2, A3, A4, A5, A6, x)]

     Definition Classes

     TupleInstances0

218.  implicit def tuple7Monad[A1, A2, A3, A4, A5, A6](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5], A6: Monoid[A6]): Monad[[x](A1, A2, A3, A4, A5, A6, x)]

     Definition Classes

     TupleInstances1

219.  implicit def tuple7Monoid[A1, A2, A3, A4, A5, A6, A7](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5], A6: Monoid[A6], A7: Monoid[A7]): Monoid[(A1, A2, A3, A4, A5, A6, A7)]

     Definition Classes

     TupleInstances1

220.  implicit def tuple7Order[A1, A2, A3, A4, A5, A6, A7](implicit A1: Order[A1], A2: Order[A2], A3: Order[A3], A4: Order[A4], A5: Order[A5], A6: Order[A6], A7: Order[A7]): Order[(A1, A2, A3, A4, A5, A6, A7)]

     Definition Classes

     TupleInstances1

221.  implicit def tuple7Semigroup[A1, A2, A3, A4, A5, A6, A7](implicit A1: Semigroup[A1], A2: Semigroup[A2], A3: Semigroup[A3], A4: Semigroup[A4], A5: Semigroup[A5], A6: Semigroup[A6], A7: Semigroup[A7]): Semigroup[(A1, A2, A3, A4, A5, A6, A7)]

     Definition Classes

     TupleInstances0

222.  implicit def tuple7Show[A1, A2, A3, A4, A5, A6, A7](implicit A1: Show[A1], A2: Show[A2], A3: Show[A3], A4: Show[A4], A5: Show[A5], A6: Show[A6], A7: Show[A7]): Show[(A1, A2, A3, A4, A5, A6, A7)]

     Definition Classes

     TupleInstances1

223.  implicit def tuple8Cozip[A1, A2, A3, A4, A5, A6, A7]: Cozip[[x](A1, A2, A3, A4, A5, A6, A7, x)]

     Definition Classes

     TupleInstances1

224.  implicit def tuple8Equal[A1, A2, A3, A4, A5, A6, A7, A8](implicit A1: Equal[A1], A2: Equal[A2], A3: Equal[A3], A4: Equal[A4], A5: Equal[A5], A6: Equal[A6], A7: Equal[A7], A8: Equal[A8]): Equal[(A1, A2, A3, A4, A5, A6, A7, A8)]

     Definition Classes

     TupleInstances0

225.  implicit def tuple8Functor[A1, A2, A3, A4, A5, A6, A7]: Traverse[[x](A1, A2, A3, A4, A5, A6, A7, x)]

     Definition Classes

     TupleInstances0

226.  implicit def tuple8Monad[A1, A2, A3, A4, A5, A6, A7](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5], A6: Monoid[A6], A7: Monoid[A7]): Monad[[x](A1, A2, A3, A4, A5, A6, A7, x)]

     Definition Classes

     TupleInstances1

227.  implicit def tuple8Monoid[A1, A2, A3, A4, A5, A6, A7, A8](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5], A6: Monoid[A6], A7: Monoid[A7], A8: Monoid[A8]): Monoid[(A1, A2, A3, A4, A5, A6, A7, A8)]

     Definition Classes

     TupleInstances1

228.  implicit def tuple8Order[A1, A2, A3, A4, A5, A6, A7, A8](implicit A1: Order[A1], A2: Order[A2], A3: Order[A3], A4: Order[A4], A5: Order[A5], A6: Order[A6], A7: Order[A7], A8: Order[A8]): Order[(A1, A2, A3, A4, A5, A6, A7, A8)]

     Definition Classes

     TupleInstances1

229.  implicit def tuple8Semigroup[A1, A2, A3, A4, A5, A6, A7, A8](implicit A1: Semigroup[A1], A2: Semigroup[A2], A3: Semigroup[A3], A4: Semigroup[A4], A5: Semigroup[A5], A6: Semigroup[A6], A7: Semigroup[A7], A8: Semigroup[A8]): Semigroup[(A1, A2, A3, A4, A5, A6, A7, A8)]

     Definition Classes

     TupleInstances0

230.  implicit def tuple8Show[A1, A2, A3, A4, A5, A6, A7, A8](implicit A1: Show[A1], A2: Show[A2], A3: Show[A3], A4: Show[A4], A5: Show[A5], A6: Show[A6], A7: Show[A7], A8: Show[A8]): Show[(A1, A2, A3, A4, A5, A6, A7, A8)]

     Definition Classes

     TupleInstances1

231.  final def unionWith[K, A](m1: XMap[K, A], m2: XMap[K, A])(f: (A, A) ⇒ A)(implicit arg0: BuildKeyConstraint[K]): XMap[K, A]

     Union, resolving collisions with f, where the first arg is guaranteed to be from m1, the second from m2.

     Union, resolving collisions with f, where the first arg is guaranteed to be from m1, the second from m2.

     Definition Classes

     MapSubFunctions

     Note

     iff f gives rise to a scalaz.Semigroup, so does unionWith(_, _)(f).

232.  final def unionWithKey[K, A](m1: XMap[K, A], m2: XMap[K, A])(f: (K, A, A) ⇒ A)(implicit arg0: BuildKeyConstraint[K]): XMap[K, A]

     Like unionWith, but telling f about the key.

     Like unionWith, but telling f about the key.

     Definition Classes

     MapSubFunctions

233.  implicit val unitInstance: Monoid[Unit] with Enum[Unit] with Show[Unit]

     Definition Classes

     AnyValInstances

234.  implicit def vectorEqual[A](implicit A0: Equal[A]): Equal[Vector[A]]

     Definition Classes

     VectorInstances0

235.  implicit val vectorInstance: Traverse[VectorInstances.generic.IxSq] with MonadPlus[VectorInstances.generic.IxSq] with Each[VectorInstances.generic.IxSq] with Index[VectorInstances.generic.IxSq] with Length[VectorInstances.generic.IxSq] with Zip[VectorInstances.generic.IxSq] with Unzip[VectorInstances.generic.IxSq] with IsEmpty[VectorInstances.generic.IxSq] with Align[VectorInstances.generic.IxSq] { def toIndexedSeq[A](fa: AllInstances.this.generic.IxSq[A]): AllInstances.this.generic.IxSq[A] }

     Definition Classes

     VectorInstances

236.  implicit def vectorMonoid[A]: Monoid[Vector[A]]

     Definition Classes

     VectorInstances

237.  implicit def vectorOrder[A](implicit A0: Order[A]): Order[Vector[A]]

     Definition Classes

     VectorInstances

238.  implicit def vectorShow[A](implicit arg0: Show[A]): Show[Vector[A]]

     Definition Classes

     VectorInstances

239.  final def wait(): Unit

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

240.  final def wait(arg0: Long, arg1: Int): Unit

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

241.  final def wait(arg0: Long): Unit

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

242.  implicit object booleanInstance extends Enum[Boolean] with Show[Boolean]

     Definition Classes

     AnyValInstances

243.  implicit object stringInstance extends Monoid[String] with Show[String] with Equal[String] with Order[String] with IsEmpty[[α]String]

     Definition Classes

     StringInstances

244.  object generic extends IndexedSeqSubVector with IndexedSeqSubInstances

     Definition Classes

     VectorInstances