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.  def FirstLeftProjectionEIso2[E]: Isomorphism.<~>[[α]AnyRef { ... /* 2 definitions in type refinement */ }, [β$10$]Either[E, β$10$]]

   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.  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.  def FirstRightProjectionAIso2[A]: Isomorphism.<~>[[α]AnyRef { ... /* 2 definitions in type refinement */ }, [α$14$]Either[α$14$, 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.  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.  def LastLeftProjectionEIso2[E]: Isomorphism.<~>[[α]AnyRef { ... /* 2 definitions in type refinement */ }, [β$11$]Either[E, β$11$]]

    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.  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.  def LastRightProjectionAIso2[A]: Isomorphism.<~>[[α]AnyRef { ... /* 2 definitions in type refinement */ }, [α$15$]Either[α$15$, 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.  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.  def LeftProjectionEIso2[E]: Isomorphism.<~>[[β$8$]LeftProjection[E, β$8$], [β$9$]Either[E, β$9$]]

    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.  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.  def RightProjectionAIso2[A]: Isomorphism.<~>[[α$12$]RightProjection[α$12$, A], [α$13$]Either[α$13$, 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.  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 alter[K, A](m: Map[K, A], k: K)(f: (Option[A]) => Option[A]): Map[K, A]

    Vary the value of m get k.

    Vary the value of m get k.

    Definition Classes

    MapFunctions

20.  final def asInstanceOf[T0]: T0

    Definition Classes

    Any

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

    Definition Classes

    BigDecimalInstances

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

    Definition Classes

    BigInts

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

    Definition Classes

    BigInts

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

    Definition Classes

    BigIntegerInstances

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

    Definition Classes

    BigIntegerInstances

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

    Definition Classes

    AnyValInstances

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

    Definition Classes

    AnyValInstances

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

    Definition Classes

    AnyValInstances

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

    Definition Classes

    AnyValInstances

30.  implicit val callableMonad: Monad[Callable]

    Definition Classes

    CallableInstances

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

    Definition Classes

    CallableInstances

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

    Definition Classes

    AnyValInstances

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

    Definition Classes

    AnyValInstances

34.  def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.CloneNotSupportedException]) @native()

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

    Definition Classes

    AnyValInstances

36.  implicit def eitherAssociative: Associative[Either]

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances0

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

    Definition Classes

    EitherInstances0

39.  val eitherFirstLeftInstance: IsomorphismBifunctor[[α, β]AnyRef { ... /* 2 definitions in type refinement */ }, Either]

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances0

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

    Definition Classes

    EitherInstances0

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

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances0

49.  implicit val eitherInstance: Bitraverse[Either]

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances0

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

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances0

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

    Definition Classes

    EitherInstances0

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

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances0

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

    Definition Classes

    EitherInstances0

61.  val eitherLeftInstance: IsomorphismBifunctor[LeftProjection, Either]

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances0

66.  implicit def eitherMonad[L]: Traverse[[β$0$]Either[L, β$0$]] with MonadError[[β$1$]Either[L, β$1$], L] with BindRec[[β$2$]Either[L, β$2$]] with Cozip[[β$3$]Either[L, β$3$]]

    Right biased monad

    Right biased monad

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances0

69.  val eitherRightInstance: IsomorphismBifunctor[RightProjection, Either]

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances

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

    Definition Classes

    EitherInstances0

74.  implicit def eitherShow[A, B](implicit SA: Show[A], SB: Show[B]): Show[Either[A, B]]

    Definition Classes

    EitherInstances

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

    Definition Classes

    EnumInstances

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

    Definition Classes

    AnyRef

77.  def equals(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef → Any

78.  def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    Definition Classes

    AnyValInstances

80.  implicit def function0Equal[R](implicit arg0: Equal[R]): Equal[() => R]

    Definition Classes

    FunctionInstances

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

    Definition Classes

    FunctionInstances

82.  implicit def function1Cobind[A, R](implicit A0: Semigroup[A]): Cobind[[β$0$](A) => β$0$]

    Definition Classes

    FunctionInstances1

83.  implicit def function1Comonad[A, R](implicit A0: Monoid[A]): Comonad[[β$1$](A) => β$1$]

    Definition Classes

    FunctionInstances0

84.  implicit def function1Contravariant[R]: Contravariant[[α$22$](α$22$) => R]

    Definition Classes

    FunctionInstances

85.  implicit def function1Covariant[T]: Monad[[β$12$](T) => β$12$] with BindRec[[β$13$](T) => β$13$] with Zip[[β$14$](T) => β$14$] with Unzip[[β$15$](T) => β$15$] with Distributive[[β$16$](T) => β$16$]

    Definition Classes

    FunctionInstances

86.  implicit def function1CovariantByName[T]: Monad[[β$2$](=> T) => β$2$] with BindRec[[β$3$](=> T) => β$3$] with Zip[[β$4$](=> T) => β$4$] with Unzip[[β$5$](=> T) => β$5$] with Distributive[[β$6$](=> T) => β$6$]

    Definition Classes

    FunctionInstances0

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

    Definition Classes

    FunctionInstances

88.  implicit def function1Monoid[A, R](implicit R0: Monoid[R]): Monoid[(A) => R]

    Definition Classes

    FunctionInstances0

89.  implicit def function1Semigroup[A, R](implicit R0: Semigroup[R]): Semigroup[(A) => R]

    Definition Classes

    FunctionInstances1

90.  implicit def function2Instance[T1, T2]: Monad[[γ$24$](T1, T2) => γ$24$] with BindRec[[γ$25$](T1, T2) => γ$25$]

    Definition Classes

    FunctionInstances

91.  implicit def function3Instance[T1, T2, T3]: Monad[[δ$28$](T1, T2, T3) => δ$28$] with BindRec[[δ$29$](T1, T2, T3) => δ$29$]

    Definition Classes

    FunctionInstances

92.  implicit def function4Instance[T1, T2, T3, T4]: Monad[[ε$32$](T1, T2, T3, T4) => ε$32$] with BindRec[[ε$33$](T1, T2, T3, T4) => ε$33$]

    Definition Classes

    FunctionInstances

93.  implicit def function5Instance[T1, T2, T3, T4, T5]: Monad[[ζ$36$](T1, T2, T3, T4, T5) => ζ$36$] with BindRec[[ζ$37$](T1, T2, T3, T4, T5) => ζ$37$]

    Definition Classes

    FunctionInstances

94.  implicit def function6Instance[T1, T2, T3, T4, T5, T6]: Monad[[η$40$](T1, T2, T3, T4, T5, T6) => η$40$] with BindRec[[η$41$](T1, T2, T3, T4, T5, T6) => η$41$]

    Definition Classes

    FunctionInstances

95.  implicit def function7Instance[T1, T2, T3, T4, T5, T6, T7]: Monad[[θ$44$](T1, T2, T3, T4, T5, T6, T7) => θ$44$] with BindRec[[θ$45$](T1, T2, T3, T4, T5, T6, T7) => θ$45$]

    Definition Classes

    FunctionInstances

96.  implicit def function8Instance[T1, T2, T3, T4, T5, T6, T7, T8]: Monad[[ι$48$](T1, T2, T3, T4, T5, T6, T7, T8) => ι$48$] with BindRec[[ι$49$](T1, T2, T3, T4, T5, T6, T7, T8) => ι$49$]

    Definition Classes

    FunctionInstances

97.  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

98.  implicit def futureInstance(implicit ec: ExecutionContext): Nondeterminism[Future] with Cobind[Future] with MonadError[Future, Throwable] with Catchable[Future]

    Definition Classes

    FutureInstances1

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

    Definition Classes

    FutureInstances

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

     Definition Classes

     FutureInstances1

101.  final def getClass(): Class[_ <: AnyRef]

     Definition Classes

     AnyRef → Any

     Annotations

     @native()

102.  final def getOrAdd[F[_], K, A](m: Map[K, A], k: K)(fa: => F[A])(implicit F: Applicative[F]): F[(Map[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

     MapFunctions

103.  def hashCode(): Int

     Definition Classes

     AnyRef → Any

     Annotations

     @native()

104.  final def insertWith[K, A](m1: Map[K, A], k: K, v: A)(f: (A, A) => A): Map[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

     MapFunctions

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

     Definition Classes

     AnyValInstances

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

     Definition Classes

     AnyValInstances

107.  final def intersectWith[K, A, B, C](m1: Map[K, A], m2: Map[K, B])(f: (A, B) => C): Map[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

     MapFunctions

108.  final def intersectWithKey[K, A, B, C](m1: Map[K, A], m2: Map[K, B])(f: (K, A, B) => C): Map[K, C]

     Like intersectWith, but tell f about the key.

     Like intersectWith, but tell f about the key.

     Definition Classes

     MapFunctions

109.  final def isInstanceOf[T0]: Boolean

     Definition Classes

     Any

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

     Definition Classes

     ListInstances0

111.  implicit val listInstance: Traverse[List] with MonadPlus[List] with BindRec[List] with Zip[List] with Unzip[List] with Align[List] with IsEmpty[List] with Cobind[List]

     Definition Classes

     ListInstances

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

     Definition Classes

     ListInstances

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

     Definition Classes

     ListInstances

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

     Definition Classes

     ListInstances

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

     Definition Classes

     AnyValInstances

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

     Definition Classes

     AnyValInstances

117.  implicit def mapBand[K, V](implicit S: Band[V]): Band[Map[K, V]]

     Definition Classes

     MapInstances0

118.  implicit val mapEntryBitraverse: Bitraverse[Entry]

     Definition Classes

     MapInstances

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

     Definition Classes

     MapInstances0

120.  implicit def mapFoldable[K]: Foldable[[β$1$]Map[K, β$1$]]

     Definition Classes

     MapInstances0

121.  implicit def mapInstance[K]: Traverse[[β$2$]Map[K, β$2$]] with IsEmpty[[β$3$]Map[K, β$3$]] with Bind[[β$4$]Map[K, β$4$]] with Align[[β$5$]Map[K, β$5$]]

     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

     MapInstances

122.  final def mapKeys[K, K2, A](m: Map[K, A])(f: (K) => K2): Map[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

     MapFunctions

123.  implicit def mapMonoid[K, V](implicit S: Semigroup[V]): Monoid[Map[K, V]]

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

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

     Definition Classes

     MapInstances

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

     Definition Classes

     MapInstances

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

     Definition Classes

     MapInstances

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

     Definition Classes

     AnyRef

127.  final def notify(): Unit

     Definition Classes

     AnyRef

     Annotations

     @native()

128.  final def notifyAll(): Unit

     Definition Classes

     AnyRef

     Annotations

     @native()

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

     Definition Classes

     OptionInstances0

130.  implicit def optionFirst[A]: Monoid[FirstOption[A]] with Band[FirstOption[A]]

     Definition Classes

     OptionInstances

131.  implicit def optionFirstMonad: Monad[FirstOption]

     Definition Classes

     OptionInstances

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

     Definition Classes

     OptionInstances

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

     Definition Classes

     OptionInstances

134.  implicit val optionInstance: Traverse[Option] with MonadPlus[Option] with BindRec[Option] with Cozip[Option] with Zip[Option] with Unzip[Option] with Align[Option] with IsEmpty[Option] with Cobind[Option] with Optional[Option]

     Definition Classes

     OptionInstances

135.  implicit def optionLast[A]: Monoid[LastOption[A]] with Band[LastOption[A]]

     Definition Classes

     OptionInstances

136.  implicit def optionLastMonad: Monad[LastOption]

     Definition Classes

     OptionInstances

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

     Definition Classes

     OptionInstances

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

     Definition Classes

     OptionInstances

139.  implicit def optionMax[A](implicit o: Order[A]): Monoid[MaxOption[A]] with Band[MaxOption[A]]

     Definition Classes

     OptionInstances

140.  implicit def optionMaxMonad: Monad[MaxOption]

     Definition Classes

     OptionInstances

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

     Definition Classes

     OptionInstances

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

     Definition Classes

     OptionInstances

143.  implicit def optionMin[A](implicit o: Order[A]): Monoid[MinOption[A]] with Band[MinOption[A]]

     Definition Classes

     OptionInstances

144.  implicit def optionMinMonad: Monad[MinOption]

     Definition Classes

     OptionInstances

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

     Definition Classes

     OptionInstances

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

     Definition Classes

     OptionInstances

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

     Definition Classes

     OptionInstances

148.  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

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

     Definition Classes

     OptionInstances

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

     Definition Classes

     OrderingInstances

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

     Definition Classes

     PartialFunctionInstances

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

     Definition Classes

     SetInstances

153.  implicit def setMonoid[A]: Monoid[Set[A]] with SemiLattice[Set[A]]

     Definition Classes

     SetInstances

154.  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

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

     Definition Classes

     SetInstances

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

     Definition Classes

     AnyValInstances

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

     Definition Classes

     AnyValInstances

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

     Definition Classes

     StreamInstances

159.  implicit val streamInstance: Traverse[Stream] with MonadPlus[Stream] with BindRec[Stream] with Zip[Stream] with Unzip[Stream] with Align[Stream] with IsEmpty[Stream] with Cobind[Stream]

     Definition Classes

     StreamInstances

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

     Definition Classes

     StreamInstances

161.  implicit def streamOrder[A](implicit A0: Order[A]): Order[Stream[A]]

     Definition Classes

     StreamInstances

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

     Definition Classes

     StreamInstances

163.  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

164.  final def synchronized[T0](arg0: => T0): T0

     Definition Classes

     AnyRef

165.  def toString(): String

     Definition Classes

     AnyRef → Any

166.  implicit val tuple1Cozip: Cozip[Tuple1]

     Definition Classes

     TupleInstances2

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

     Definition Classes

     TupleInstances1

168.  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

     TupleInstances1

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

     Definition Classes

     TupleInstances2

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

     Definition Classes

     TupleInstances2

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

     Definition Classes

     TupleInstances1

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

     Definition Classes

     TupleInstances2

173.  implicit val tuple2Associative: Associative[Tuple2]

     Definition Classes

     TupleInstances1

174.  implicit def tuple2BindRec[A1](implicit arg0: Semigroup[A1]): BindRec[[β$9$](A1, β$9$)]

     Product BindRec

     Product BindRec

     Definition Classes

     TupleInstances1

175.  implicit val tuple2Bitraverse: Bitraverse[Tuple2]

     Definition Classes

     TupleInstances1

176.  implicit def tuple2Cozip[A1]: Cozip[[β$16$](A1, β$16$)]

     Definition Classes

     TupleInstances2

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

     Definition Classes

     TupleInstances1

178.  implicit def tuple2Instance[A1]: Traverse[[β$0$](A1, β$0$)] with Comonad[[β$1$](A1, β$1$)]

     Product functor and comonad

     Product functor and comonad

     Definition Classes

     TupleInstances0

179.  implicit def tuple2Monad[A1](implicit A1: Monoid[A1]): Monad[[β$23$](A1, β$23$)]

     Definition Classes

     TupleInstances2

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

     Definition Classes

     TupleInstances2

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

     Definition Classes

     TupleInstances2

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

     Definition Classes

     TupleInstances1

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

     Definition Classes

     TupleInstances2

184.  implicit def tuple3BindRec[A1, A2](implicit arg0: Semigroup[A1], arg1: Semigroup[A2]): BindRec[[γ$10$](A1, A2, γ$10$)]

     Definition Classes

     TupleInstances1

185.  implicit def tuple3Cozip[A1, A2]: Cozip[[γ$17$](A1, A2, γ$17$)]

     Definition Classes

     TupleInstances2

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

     Definition Classes

     TupleInstances1

187.  implicit def tuple3Functor[A1, A2]: Traverse[[γ$3$](A1, A2, γ$3$)]

     Definition Classes

     TupleInstances0

188.  implicit def tuple3Monad[A1, A2](implicit A1: Monoid[A1], A2: Monoid[A2]): Monad[[γ$24$](A1, A2, γ$24$)]

     Definition Classes

     TupleInstances2

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

     Definition Classes

     TupleInstances2

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

     Definition Classes

     TupleInstances2

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

     Definition Classes

     TupleInstances1

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

     Definition Classes

     TupleInstances2

193.  implicit def tuple4BindRec[A1, A2, A3](implicit arg0: Semigroup[A1], arg1: Semigroup[A2], arg2: Semigroup[A3]): BindRec[[δ$11$](A1, A2, A3, δ$11$)]

     Definition Classes

     TupleInstances1

194.  implicit def tuple4Cozip[A1, A2, A3]: Cozip[[δ$18$](A1, A2, A3, δ$18$)]

     Definition Classes

     TupleInstances2

195.  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

     TupleInstances1

196.  implicit def tuple4Functor[A1, A2, A3]: Traverse[[δ$4$](A1, A2, A3, δ$4$)]

     Definition Classes

     TupleInstances0

197.  implicit def tuple4Monad[A1, A2, A3](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3]): Monad[[δ$25$](A1, A2, A3, δ$25$)]

     Definition Classes

     TupleInstances2

198.  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

     TupleInstances2

199.  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

     TupleInstances2

200.  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

     TupleInstances1

201.  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

     TupleInstances2

202.  implicit def tuple5BindRec[A1, A2, A3, A4](implicit arg0: Semigroup[A1], arg1: Semigroup[A2], arg2: Semigroup[A3], arg3: Semigroup[A4]): BindRec[[ε$12$](A1, A2, A3, A4, ε$12$)]

     Definition Classes

     TupleInstances1

203.  implicit def tuple5Cozip[A1, A2, A3, A4]: Cozip[[ε$19$](A1, A2, A3, A4, ε$19$)]

     Definition Classes

     TupleInstances2

204.  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

     TupleInstances1

205.  implicit def tuple5Functor[A1, A2, A3, A4]: Traverse[[ε$5$](A1, A2, A3, A4, ε$5$)]

     Definition Classes

     TupleInstances0

206.  implicit def tuple5Monad[A1, A2, A3, A4](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4]): Monad[[ε$26$](A1, A2, A3, A4, ε$26$)]

     Definition Classes

     TupleInstances2

207.  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

     TupleInstances2

208.  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

     TupleInstances2

209.  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

     TupleInstances1

210.  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

     TupleInstances2

211.  implicit def tuple6BindRec[A1, A2, A3, A4, A5](implicit arg0: Semigroup[A1], arg1: Semigroup[A2], arg2: Semigroup[A3], arg3: Semigroup[A4], arg4: Semigroup[A5]): BindRec[[ζ$13$](A1, A2, A3, A4, A5, ζ$13$)]

     Definition Classes

     TupleInstances1

212.  implicit def tuple6Cozip[A1, A2, A3, A4, A5]: Cozip[[ζ$20$](A1, A2, A3, A4, A5, ζ$20$)]

     Definition Classes

     TupleInstances2

213.  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

     TupleInstances1

214.  implicit def tuple6Functor[A1, A2, A3, A4, A5]: Traverse[[ζ$6$](A1, A2, A3, A4, A5, ζ$6$)]

     Definition Classes

     TupleInstances0

215.  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[[ζ$27$](A1, A2, A3, A4, A5, ζ$27$)]

     Definition Classes

     TupleInstances2

216.  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

     TupleInstances2

217.  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

     TupleInstances2

218.  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

     TupleInstances1

219.  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

     TupleInstances2

220.  implicit def tuple7BindRec[A1, A2, A3, A4, A5, A6](implicit arg0: Semigroup[A1], arg1: Semigroup[A2], arg2: Semigroup[A3], arg3: Semigroup[A4], arg4: Semigroup[A5], arg5: Semigroup[A6]): BindRec[[η$14$](A1, A2, A3, A4, A5, A6, η$14$)]

     Definition Classes

     TupleInstances1

221.  implicit def tuple7Cozip[A1, A2, A3, A4, A5, A6]: Cozip[[η$21$](A1, A2, A3, A4, A5, A6, η$21$)]

     Definition Classes

     TupleInstances2

222.  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

     TupleInstances1

223.  implicit def tuple7Functor[A1, A2, A3, A4, A5, A6]: Traverse[[η$7$](A1, A2, A3, A4, A5, A6, η$7$)]

     Definition Classes

     TupleInstances0

224.  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[[η$28$](A1, A2, A3, A4, A5, A6, η$28$)]

     Definition Classes

     TupleInstances2

225.  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

     TupleInstances2

226.  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

     TupleInstances2

227.  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

     TupleInstances1

228.  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

     TupleInstances2

229.  implicit def tuple8BindRec[A1, A2, A3, A4, A5, A6, A7](implicit arg0: Semigroup[A1], arg1: Semigroup[A2], arg2: Semigroup[A3], arg3: Semigroup[A4], arg4: Semigroup[A5], arg5: Semigroup[A6], arg6: Semigroup[A7]): BindRec[[θ$15$](A1, A2, A3, A4, A5, A6, A7, θ$15$)]

     Definition Classes

     TupleInstances1

230.  implicit def tuple8Cozip[A1, A2, A3, A4, A5, A6, A7]: Cozip[[θ$22$](A1, A2, A3, A4, A5, A6, A7, θ$22$)]

     Definition Classes

     TupleInstances2

231.  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

     TupleInstances1

232.  implicit def tuple8Functor[A1, A2, A3, A4, A5, A6, A7]: Traverse[[θ$8$](A1, A2, A3, A4, A5, A6, A7, θ$8$)]

     Definition Classes

     TupleInstances0

233.  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[[θ$29$](A1, A2, A3, A4, A5, A6, A7, θ$29$)]

     Definition Classes

     TupleInstances2

234.  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

     TupleInstances2

235.  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

     TupleInstances2

236.  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

     TupleInstances1

237.  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

     TupleInstances2

238.  final def unionWith[K, A](m1: Map[K, A], m2: Map[K, A])(f: (A, A) => A): Map[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

     MapFunctions

     Note

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

239.  final def unionWithKey[K, A](m1: Map[K, A], m2: Map[K, A])(f: (K, A, A) => A): Map[K, A]

     Like unionWith, but telling f about the key.

     Like unionWith, but telling f about the key.

     Definition Classes

     MapFunctions

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

     Definition Classes

     AnyValInstances

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

     Definition Classes

     VectorInstances0

242.  implicit val vectorInstance: Traverse[Vector] with MonadPlus[Vector] with BindRec[Vector] with Zip[Vector] with Unzip[Vector] with IsEmpty[Vector] with Align[Vector]

     Definition Classes

     VectorInstances

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

     Definition Classes

     VectorInstances

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

     Definition Classes

     VectorInstances

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

     Definition Classes

     VectorInstances

246.  final def wait(): Unit

     Definition Classes

     AnyRef

     Annotations

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

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

     Definition Classes

     AnyRef

     Annotations

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

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

     Definition Classes

     AnyRef

     Annotations

     @throws(classOf[java.lang.InterruptedException]) @native()

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

     Definition Classes

     AnyValInstances

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

     Definition Classes

     StringInstances