incremental compile diff

2.11

Adjunction$$anon$1.class
Adjunction$$anon$2.class
Align$$anon$1.class
Align$$anon$3.class
Applicative$$anon$1.class
Applicative$$anon$2.class
Applicative$$anon$3.class
Applicative$$anon$5.class
ApplicativePlus$$anon$1.class
ApplicativePlus$$anon$2.class
Apply$$anon$1.class
Apply$$anon$2.class
Apply$$anon$3.class
Apply$$anon$4.class
Apply$$anon$6.class
Arrow$$anon$2.class
Bifunctor$$anon$1.class
Bifunctor$$anon$2.class
Bifunctor$$anon$3.class
Bind$$anon$1.class
Bind$$anon$3.class
BindRec$$anon$1.class
BindRec$$anon$3.class
Bitraverse$$anon$1.class
Bitraverse$$anon$2.class
Bitraverse$$anon$3.class
CodensityMonad.class
CofreeInstances$$anon$7.class
CofreeInstances0$$anon$3.class
CofreeInstances0$$anon$5.class
CofreeInstances1$$anon$1.class
CofreeInstances1$$anon$6.class
CofreeInstances2$$anon$4.class
CofreeInstances3$$anon$10.class
CofreeInstances3$$anon$2.class
CokleisliInstances$$anon$2.class
ConstInstances$$anon$1.class
ConstInstances0$$anon$2.class
ConstInstances1$$anon$3.class
Contravariant$$anon$2.class
Coproduct$$anon$1.class
CoproductInstances$$anon$3.class
CoproductInstances0$$anon$2.class
CoproductInstances1$$anon$4.class
CoproductInstances3$$anon$5.class
CoyonedaInstances$$anon$5.class
CoyonedaInstances0$$anon$6.class
CoyonedaInstances1$$anon$10.class
CoyonedaInstances10$$anon$20.class
CoyonedaInstances2$$anon$3.class
CoyonedaInstances3$$anon$1.class
CoyonedaInstances4$$anon$2.class
CoyonedaInstances5$$anon$4.class
CoyonedaInstances6$$anon$7.class
CoyonedaInstances7$$anon$8.class
CoyonedaInstances8$$anon$11.class
CoyonedaInstances9$$anon$9.class
DListInstances$$anon$1.class
DequeueInstances$$anon$1.class
DisjunctionInstances1$$anon$1.class
Distributive$$anon$1.class
Distributive$$anon$2.class
EitherT$$anon$1.class
EitherT$$anon$3.class
EitherTInstances$$anon$8.class
EitherTInstances0$$anon$2.class
EitherTInstances1$$anon$5.class
EitherTInstances2$$anon$9.class
EitherTInstances3$$anon$4.class
EitherTInstances4$$anon$6.class
EphemeralStreamInstances$$anon$1.class
FingerTreeInstances$$anon$3.class
FingerTreeInstances$$anon$4.class
FreeAp$$anon$2.class
FreeInstances$$anon$3.class
FreeInstances1$$anon$6.class
FreeTInstances$$anon$1.class
FreeTInstances0$$anon$7.class
FreeTInstances1$$anon$6.class
FreeTInstances2$$anon$8.class
FreeTInstances3$$anon$5.class
FreeTInstances4$$anon$4.class
FreeTInstances5$$anon$3.class
FreeTInstances6$$anon$2.class
FreeTraverse1.class
Functor$$anon$1.class
Functor$$anon$2.class
Functor$$anon$3.class
Functor$$anon$4.class
Functor$$anon$5.class
Functor$$anon$6.class
Functor$.class
Functor$FunctorLaw$class.class
Functor$class.class
Functor.class
IListInstances$$anon$1.class
IdInstances$$anon$1.class
IdTInstances$$anon$3.class
IdTInstances0$$anon$1.class
IdTInstances1$$anon$2.class
IdTInstances2$$anon$4.class
IdTInstances3$$anon$5.class
IdTInstances4$$anon$6.class
IndSeqInstances$$anon$1.class
IndexedContsTInstances$$anon$1.class
IndexedContsTInstances$$anon$5.class
IndexedContsTInstances0$$anon$2.class
IndexedContsTInstances1$$anon$3.class
IndexedContsTInstances2$$anon$4.class
IndexedReaderWriterStateTInstances$$anon$3.class
IndexedReaderWriterStateTInstances0$$anon$4.class
IndexedReaderWriterStateTInstances1$$anon$6.class
IndexedStateTInstances$$anon$6.class
IndexedStateTInstances1$$anon$5.class
IndexedStoreTInstances$$anon$6.class
IndexedStoreTInstances1$$anon$5.class
KleisliInstances10$$anon$7.class
KleisliInstances11$$anon$10.class
KleisliInstances12$$anon$9.class
KleisliInstances13$$anon$14.class
KleisliInstances3$$anon$3.class
KleisliInstances4$$anon$1.class
KleisliInstances5$$anon$2.class
KleisliInstances6$$anon$4.class
KleisliInstances7$$anon$6.class
KleisliInstances8$$anon$8.class
Lan$$anon$1.class
LanInstances$$anon$2.class
LanInstances0$$anon$3.class
LazyEitherInstances$$anon$1.class
LazyEitherT$$anon$1.class
LazyEitherTInstances$$anon$6.class
LazyEitherTInstances$$anon$8.class
LazyEitherTInstances0$$anon$2.class
LazyEitherTInstances0$$anon$5.class
LazyEitherTInstances1$$anon$10.class
LazyEitherTInstances1$$anon$11.class
LazyEitherTInstances1$$anon$3.class
LazyEitherTInstances1$$anon$4.class
LazyOptionInstances$$anon$1.class
LazyOptionTInstances$$anon$1.class
LazyOptionTInstances0$$anon$2.class
LazyOptionTInstances1$$anon$3.class
LazyTuple2Instances$$anon$1.class
LazyTuple2Instances0$$anon$11.class
LazyTuple3Instances$$anon$2.class
LazyTuple3Instances0$$anon$12.class
LazyTuple4Instances$$anon$3.class
LazyTuple4Instances0$$anon$13.class
ListTInstances$$anon$1.class
ListTInstances2$$anon$3.class
MapInstances$$anon$2.class
MapInstances0$$anon$1.class
MaybeInstances$$anon$1.class
MaybeT$$anon$1.class
MaybeT$$anon$3.class
MaybeTInstances$$anon$6.class
MaybeTInstances0$$anon$2.class
MaybeTInstances1$$anon$5.class
MaybeTInstances2$$anon$4.class
MaybeTInstances3$$anon$7.class
Monad$$anon$1.class
Monad$$anon$3.class
MonadPlus$$anon$1.class
MonadPlus$$anon$3.class
MonadPlus$$anon$4.class
Monoid$$anon$1.class
Name$$anon$1.class
Need$$anon$2.class
NonEmptyListInstances$$anon$1.class
Nondeterminism$$anon$2.class
NullArgumentInstances$$anon$1.class
NullResultInstances$$anon$1.class
OneAndInstances$$anon$2.class
OneAndInstances0$$anon$3.class
OneAndInstances1$$anon$1.class
OneAndInstances2$$anon$5.class
OneAndInstances3$$anon$4.class
OneAndInstances4$$anon$6.class
OneAndInstances4$$anon$7.class
OneAndInstances5$$anon$9.class
OneOrInstances$$anon$8.class
OneOrInstances0$$anon$5.class
OneOrInstances1$$anon$2.class
OneOrInstances2$$anon$4.class
OneOrInstances5$$anon$3.class
OneOrInstances6$$anon$1.class
OptionT$$anon$1.class
OptionT$$anon$3.class
OptionTInstances$$anon$6.class
OptionTInstances0$$anon$2.class
OptionTInstances1$$anon$4.class
OptionTInstances2$$anon$5.class
OptionTInstances3$$anon$7.class
Profunctor$$anon$1.class
Profunctor$$anon$3.class
Profunctor$$anon$4.class
Ran$$anon$4.class
ReaderWriterStateTInstances0$$anon$2.class
ReaderWriterStateTMonadPlus.class
Semigroup$$anon$1.class
SinkInstances$$anon$4.class
SourceInstances$$anon$5.class
StateTInstances1$$anon$1.class
StateTInstances2$$anon$2.class
StateTInstances3$$anon$3.class
StoreTInstances0$$anon$1.class
StoreTInstances1$$anon$2.class
StoreTInstances2$$anon$3.class
StreamTInstances$$anon$1.class
StreamTInstances0$$anon$2.class
StrictTreeInstances$$anon$1.class
TheseInstances0$$anon$1.class
TheseInstances1$$anon$2.class
TheseTInstances0$$anon$1.class
TheseTInstances1$$anon$2.class
TracedTInstances$$anon$1.class
TracedTInstances0$$anon$3.class
TracedTInstances1$$anon$6.class
TracedTInstances2$$anon$2.class
TracedTInstances3$$anon$5.class
TracedTInstances4$$anon$4.class
TracedTInstances5$$anon$7.class
TrampolineInstances$$anon$2.class
Traverse$$anon$1.class
Traverse$$anon$2.class
Traverse$$anon$3.class
Traverse$$anon$6.class
Traverse1$$anon$1.class
Traverse1$$anon$2.class
Traverse1$$anon$3.class
Traverse1$$anon$5.class
TreeInstances$$anon$1.class
TreeLocInstances$$anon$1$$anon$2.class
TreeLocInstances$$anon$1.class
UnwriterTInstances$$anon$2.class
UnwriterTInstances$$anon$3.class
UnwriterTInstances0$$anon$1.class
UnwriterTInstances1$$anon$4.class
UnwriterTInstances2$$anon$6.class
ValidationInstances2$$anon$1.class
ValidationInstances3$$anon$2.class
Value$$anon$3.class
WriterTInstance5$$anon$5.class
WriterTInstances$$anon$2.class
WriterTInstances0$$anon$12.class
WriterTInstances1$$anon$11.class
WriterTInstances10$$anon$14.class
WriterTInstances11$$anon$6.class
WriterTInstances12$$anon$8.class
WriterTInstances13$$anon$19.class
WriterTInstances14$$anon$18.class
WriterTInstances2$$anon$13.class
WriterTInstances3$$anon$1.class
WriterTInstances4$$anon$3.class
WriterTInstances6$$anon$4.class
WriterTInstances7$$anon$7.class
WriterTInstances8$$anon$10.class
WriterTInstances9$$anon$9.class
Yoneda$$anon$1.class
Zip$$anon$1.class
ZipperInstances$$anon$1.class
std/EitherInstances$$anon$1.class
std/EitherInstances$$anon$2.class
std/EitherInstances$$anon$3.class
std/FunctionInstances$$anon$1.class
std/FunctionInstances$$anon$10.class
std/FunctionInstances$$anon$11.class
std/FunctionInstances$$anon$3.class
std/FunctionInstances$$anon$5.class
std/FunctionInstances$$anon$6.class
std/FunctionInstances$$anon$7.class
std/FunctionInstances$$anon$8.class
std/FunctionInstances$$anon$9.class
std/FunctionInstances0$$anon$12.class
std/FunctionInstances0$$anon$2.class
std/FunctionInstances1$$anon$13.class
std/FutureInstance.class
std/ListInstances$$anon$1.class
std/MapSubInstances$$anon$1.class
std/OptionInstances$$anon$1.class
std/StreamInstances$$anon$1.class
std/StreamInstances$$anon$2.class
std/Tuple2Monad.class
std/Tuple3Monad.class
std/Tuple4Monad.class
std/Tuple5Monad.class
std/Tuple6Monad.class
std/Tuple7Monad.class
std/Tuple8Monad.class
std/TupleInstances0$$anon$16.class
std/TupleInstances0$$anon$17.class
std/TupleInstances0$$anon$18.class
std/TupleInstances0$$anon$19.class
std/TupleInstances0$$anon$20.class
std/TupleInstances0$$anon$21.class
std/TupleInstances0$$anon$22.class
std/TupleInstances1$$anon$1.class
std/TupleInstances1$$anon$10.class
std/TupleInstances1$$anon$11.class
std/TupleInstances1$$anon$12.class
std/TupleInstances1$$anon$13.class
std/TupleInstances1$$anon$14.class
std/TupleInstances1$$anon$15.class
std/TupleInstances1$$anon$9.class
std/VectorInstances$$anon$1.class
std/java/util/concurrent/CallableInstances$$anon$1.class

2.12.0-M5

Align$$anon$3.class
Applicative$$anon$5.class
Apply$$anon$6.class
Bind$$anon$3.class
BindRec$$anon$3.class
Functor$$anon$1.class
Functor$$anon$2.class
Functor$$anon$3.class
Functor$$anon$4.class
Functor$$anon$5.class
Functor$$anon$6.class
Functor$.class
Functor$FunctorLaw.class
Functor.class
Monad$$anon$3.class
MonadPlus$$anon$3.class
MonadPlus$$anon$4.class
Traverse$$anon$6.class
Traverse1$$anon$5.class

2.12.0-M5-javap

Compiled from "Align.scala"
public final class scalaz.Align$$anon$3 implements scalaz.Align<F>.AlignLaw {
  public <A> boolean collapse(F, scalaz.Equal<F>);
  public <A> boolean identity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean composite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, C>, scalaz.Equal<java.lang.Object>);
  public <A> boolean invariantIdentity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean invariantComposite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, A>, scala.Function1<B, C>, scala.Function1<C, B>, scalaz.Equal<java.lang.Object>);
  public scalaz.Align scalaz$Align$AlignLaw$$$outer();
  public scalaz.Functor scalaz$Functor$FunctorLaw$$$outer();
  public scalaz.InvariantFunctor scalaz$InvariantFunctor$InvariantFunctorLaw$$$outer();
  public scalaz.Align$$anon$3(scalaz.Align<F>);
}
Compiled from "Applicative.scala"
public final class scalaz.Applicative$$anon$5 implements scalaz.Applicative<F>.ApplicativeLaw {
  public <A> boolean identityAp(F, scalaz.Equal<F>);
  public <A, B> boolean homomorphism(scala.Function1<A, B>, A, scalaz.Equal<F>);
  public <A, B> boolean interchange(F, A, scalaz.Equal<F>);
  public <A, B> boolean mapLikeDerived(scala.Function1<A, B>, F, scalaz.Equal<F>);
  public <A, B, C> boolean composition(java.lang.Object, java.lang.Object, java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A> boolean identity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean composite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, C>, scalaz.Equal<java.lang.Object>);
  public <A> boolean invariantIdentity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean invariantComposite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, A>, scala.Function1<B, C>, scala.Function1<C, B>, scalaz.Equal<java.lang.Object>);
  public scalaz.Applicative scalaz$Applicative$ApplicativeLaw$$$outer();
  public scalaz.Apply scalaz$Apply$ApplyLaw$$$outer();
  public scalaz.Functor scalaz$Functor$FunctorLaw$$$outer();
  public scalaz.InvariantFunctor scalaz$InvariantFunctor$InvariantFunctorLaw$$$outer();
  public scalaz.Applicative$$anon$5(scalaz.Applicative<F>);
}
Compiled from "Apply.scala"
public final class scalaz.Apply$$anon$6 implements scalaz.Apply<F>.ApplyLaw {
  public <A, B, C> boolean composition(F, F, F, scalaz.Equal<F>);
  public <A> boolean identity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean composite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, C>, scalaz.Equal<java.lang.Object>);
  public <A> boolean invariantIdentity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean invariantComposite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, A>, scala.Function1<B, C>, scala.Function1<C, B>, scalaz.Equal<java.lang.Object>);
  public scalaz.Apply scalaz$Apply$ApplyLaw$$$outer();
  public scalaz.Functor scalaz$Functor$FunctorLaw$$$outer();
  public scalaz.InvariantFunctor scalaz$InvariantFunctor$InvariantFunctorLaw$$$outer();
  public scalaz.Apply$$anon$6(scalaz.Apply<F>);
}
Compiled from "Bind.scala"
public final class scalaz.Bind$$anon$3 implements scalaz.Bind<F>.BindLaw {
  public <A, B, C> boolean associativeBind(F, scala.Function1<A, F>, scala.Function1<B, F>, scalaz.Equal<F>);
  public <A, B> boolean apLikeDerived(F, F, scalaz.Equal<F>);
  public <A, B, C> boolean composition(java.lang.Object, java.lang.Object, java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A> boolean identity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean composite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, C>, scalaz.Equal<java.lang.Object>);
  public <A> boolean invariantIdentity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean invariantComposite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, A>, scala.Function1<B, C>, scala.Function1<C, B>, scalaz.Equal<java.lang.Object>);
  public scalaz.Bind scalaz$Bind$BindLaw$$$outer();
  public scalaz.Apply scalaz$Apply$ApplyLaw$$$outer();
  public scalaz.Functor scalaz$Functor$FunctorLaw$$$outer();
  public scalaz.InvariantFunctor scalaz$InvariantFunctor$InvariantFunctorLaw$$$outer();
  public scalaz.Bind$$anon$3(scalaz.Bind<F>);
}
Compiled from "BindRec.scala"
public final class scalaz.BindRec$$anon$3 implements scalaz.BindRec<F>.BindRecLaw {
  public <A> boolean tailrecBindConsistency(A, scala.Function1<A, F>, scalaz.Equal<F>);
  public <A, B, C> boolean associativeBind(java.lang.Object, scala.Function1<A, java.lang.Object>, scala.Function1<B, java.lang.Object>, scalaz.Equal<java.lang.Object>);
  public <A, B> boolean apLikeDerived(java.lang.Object, java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean composition(java.lang.Object, java.lang.Object, java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A> boolean identity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean composite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, C>, scalaz.Equal<java.lang.Object>);
  public <A> boolean invariantIdentity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean invariantComposite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, A>, scala.Function1<B, C>, scala.Function1<C, B>, scalaz.Equal<java.lang.Object>);
  public scalaz.BindRec scalaz$BindRec$BindRecLaw$$$outer();
  public scalaz.Bind scalaz$Bind$BindLaw$$$outer();
  public scalaz.Apply scalaz$Apply$ApplyLaw$$$outer();
  public scalaz.Functor scalaz$Functor$FunctorLaw$$$outer();
  public scalaz.InvariantFunctor scalaz$InvariantFunctor$InvariantFunctorLaw$$$outer();
  public scalaz.BindRec$$anon$3(scalaz.BindRec<F>);
}
Compiled from "Functor.scala"
public final class scalaz.Functor$$anon$1 implements scalaz.CompositionFunctor<F, G> {
  public <A, B> F map(F, scala.Function1<A, B>);
  public java.lang.Object functorSyntax();
  public void scalaz$Functor$_setter_$functorSyntax_$eq(scalaz.syntax.FunctorSyntax);
  public int foo();
  public <A, B> F xmap(F, scala.Function1<A, B>, scala.Function1<B, A>);
  public <A, B> F apply(F, scala.Function1<A, B>);
  public <A, B> scala.Function1<F, F> lift(scala.Function1<A, B>);
  public <A, B> F strengthL(A, F);
  public <A, B> F strengthR(F, B);
  public <A, B> F mapply(A, F);
  public <A> F fpair(F);
  public <A, B> F fproduct(F, scala.Function1<A, B>);
  public <A> F void(F);
  public <A, B> F counzip(scalaz.$bslash$div<F, F>);
  public <G> scalaz.Functor<?> compose(scalaz.Functor<G>);
  public <G> scalaz.Contravariant<?> icompose(scalaz.Contravariant<G>);
  public <G> scalaz.Bifunctor<?> bicompose(scalaz.Bifunctor<G>);
  public <G> scalaz.Functor<?> product(scalaz.Functor<G>);
  public <A, B> F widen(F, scalaz.Liskov<A, B>);
  public java.lang.Object functorLaw();
  public java.lang.Object invariantFunctorSyntax();
  public void scalaz$InvariantFunctor$_setter_$invariantFunctorSyntax_$eq(scalaz.syntax.InvariantFunctorSyntax);
  public <A, B> F xmapb(F, scalaz.BijectionT<?, ?, A, B>);
  public <A, B> F xmapi(F, scalaz.Isomorphisms$Iso<scala.Function1, A, B>);
  public java.lang.Object invariantFunctorLaw();
  public scalaz.Functor<F> F();
  public scalaz.Functor<G> G();
  public scalaz.Functor$$anon$1(scalaz.Functor<F>);
}
Compiled from "Functor.scala"
public final class scalaz.Functor$$anon$2 implements scalaz.ProductFunctor<F, G> {
  public <A, B> scala.Tuple2<F, G> map(scala.Tuple2<F, G>, scala.Function1<A, B>);
  public java.lang.Object functorSyntax();
  public void scalaz$Functor$_setter_$functorSyntax_$eq(scalaz.syntax.FunctorSyntax);
  public int foo();
  public java.lang.Object xmap(java.lang.Object, scala.Function1, scala.Function1);
  public java.lang.Object apply(java.lang.Object, scala.Function1);
  public <A, B> scala.Function1<scala.Tuple2<F, G>, scala.Tuple2<F, G>> lift(scala.Function1<A, B>);
  public java.lang.Object strengthL(java.lang.Object, java.lang.Object);
  public java.lang.Object strengthR(java.lang.Object, java.lang.Object);
  public java.lang.Object mapply(java.lang.Object, java.lang.Object);
  public java.lang.Object fpair(java.lang.Object);
  public java.lang.Object fproduct(java.lang.Object, scala.Function1);
  public java.lang.Object void(java.lang.Object);
  public java.lang.Object counzip(scalaz.$bslash$div);
  public <G> scalaz.Functor<?> compose(scalaz.Functor<G>);
  public <G> scalaz.Contravariant<?> icompose(scalaz.Contravariant<G>);
  public <G> scalaz.Bifunctor<?> bicompose(scalaz.Bifunctor<G>);
  public <G> scalaz.Functor<?> product(scalaz.Functor<G>);
  public java.lang.Object widen(java.lang.Object, scalaz.Liskov);
  public java.lang.Object functorLaw();
  public java.lang.Object invariantFunctorSyntax();
  public void scalaz$InvariantFunctor$_setter_$invariantFunctorSyntax_$eq(scalaz.syntax.InvariantFunctorSyntax);
  public java.lang.Object xmapb(java.lang.Object, scalaz.BijectionT);
  public java.lang.Object xmapi(java.lang.Object, scalaz.Isomorphisms$Iso);
  public java.lang.Object invariantFunctorLaw();
  public scalaz.Functor<F> F();
  public scalaz.Functor<G> G();
  public java.lang.Object map(java.lang.Object, scala.Function1);
  public scalaz.Functor$$anon$2(scalaz.Functor<F>);
}
Compiled from "Functor.scala"
public final class scalaz.Functor$$anon$3 implements scalaz.syntax.FunctorSyntax<F> {
  public <A> scalaz.syntax.FunctorOps<F, A> ToFunctorOps(F);
  public <A, B> scalaz.syntax.FunctorSyntax<F>.LiftV<A, B> ToLiftV(scala.Function1<A, B>);
  public <A> scalaz.syntax.InvariantFunctorOps<F, A> ToInvariantFunctorOps(F);
  public scalaz.Functor<F> F();
  public scalaz.InvariantFunctor F();
  public scalaz.Functor$$anon$3(scalaz.Functor);
}
Compiled from "Functor.scala"
public final class scalaz.Functor$$anon$4 implements scalaz.Contravariant<?> {
  public java.lang.Object contravariantSyntax();
  public void scalaz$Contravariant$_setter_$contravariantSyntax_$eq(scalaz.syntax.ContravariantSyntax);
  public <A, B> F xmap(F, scala.Function1<A, B>, scala.Function1<B, A>);
  public <G> scalaz.Functor<?> compose(scalaz.Contravariant<G>);
  public <G> scalaz.Contravariant<?> icompose(scalaz.Functor<G>);
  public <G> scalaz.Contravariant<?> product(scalaz.Contravariant<G>);
  public java.lang.Object contravariantLaw();
  public java.lang.Object invariantFunctorSyntax();
  public void scalaz$InvariantFunctor$_setter_$invariantFunctorSyntax_$eq(scalaz.syntax.InvariantFunctorSyntax);
  public <A, B> F xmapb(F, scalaz.BijectionT<?, ?, A, B>);
  public <A, B> F xmapi(F, scalaz.Isomorphisms$Iso<scala.Function1, A, B>);
  public java.lang.Object invariantFunctorLaw();
  public <A, B> F contramap(F, scala.Function1<B, A>);
  public final java.lang.Object scalaz$Functor$$anon$4$$$anonfun$8(scala.Function1, java.lang.Object);
  public scalaz.Functor$$anon$4(scalaz.Functor<F>);
}
Compiled from "Functor.scala"
public final class scalaz.Functor$$anon$5 implements scalaz.CompositionFunctorBifunctor<F, G> {
  public <A, B, C, D> F bimap(F, scala.Function1<A, C>, scala.Function1<B, D>);
  public java.lang.Object bifunctorSyntax();
  public void scalaz$Bifunctor$_setter_$bifunctorSyntax_$eq(scalaz.syntax.BifunctorSyntax);
  public <G> scalaz.Bifunctor<?> compose(scalaz.Bifunctor<G>);
  public <G> scalaz.Bifunctor<?> product(scalaz.Bifunctor<G>);
  public <X> scalaz.Functor<?> leftFunctor();
  public <A, B, C> F leftMap(F, scala.Function1<A, C>);
  public <X> scalaz.Functor<?> rightFunctor();
  public scalaz.Functor<?> uFunctor();
  public <A, B, D> F rightMap(F, scala.Function1<B, D>);
  public <A, B> F umap(F, scala.Function1<A, B>);
  public <G, H> scalaz.Bifunctor<?> embed(scalaz.Functor<G>, scalaz.Functor<H>);
  public <G> scalaz.Bifunctor<?> embedLeft(scalaz.Functor<G>);
  public <H> scalaz.Bifunctor<?> embedRight(scalaz.Functor<H>);
  public <A, B, C, D> F widen(F);
  public scalaz.Functor<F> F();
  public scalaz.Bifunctor<G> G();
  public scalaz.Functor$$anon$5(scalaz.Functor<F>);
}
Compiled from "Functor.scala"
public final class scalaz.Functor$$anon$6 implements scalaz.Functor<F>.FunctorLaw {
  public <A> boolean identity(F, scalaz.Equal<F>);
  public <A, B, C> boolean composite(F, scala.Function1<A, B>, scala.Function1<B, C>, scalaz.Equal<F>);
  public <A> boolean invariantIdentity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean invariantComposite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, A>, scala.Function1<B, C>, scala.Function1<C, B>, scalaz.Equal<java.lang.Object>);
  public scalaz.Functor scalaz$Functor$FunctorLaw$$$outer();
  public scalaz.InvariantFunctor scalaz$InvariantFunctor$InvariantFunctorLaw$$$outer();
  public scalaz.Functor$$anon$6(scalaz.Functor<F>);
}
Compiled from "Functor.scala"
public final class scalaz.Functor$ {
  public static final scalaz.Functor$ MODULE$;
  public static {};
  public <F> scalaz.Functor<F> apply(scalaz.Functor<F>);
}
Compiled from "Functor.scala"
public abstract class scalaz.Functor$FunctorLaw$class {
  public static boolean identity(scalaz.Functor$FunctorLaw, java.lang.Object, scalaz.Equal);
  public static boolean composite(scalaz.Functor$FunctorLaw, java.lang.Object, scala.Function1, scala.Function1, scalaz.Equal);
  public static final java.lang.Object scalaz$Functor$FunctorLaw$class$$$anonfun$10(scalaz.Functor$FunctorLaw, java.lang.Object);
  public static void $init$(scalaz.Functor$FunctorLaw);
}
Compiled from "Functor.scala"
public abstract class scalaz.Functor$class {
  public static int foo(scalaz.Functor);
  public static java.lang.Object xmap(scalaz.Functor, java.lang.Object, scala.Function1, scala.Function1);
  public static java.lang.Object apply(scalaz.Functor, java.lang.Object, scala.Function1);
  public static scala.Function1 lift(scalaz.Functor, scala.Function1);
  public static java.lang.Object strengthL(scalaz.Functor, java.lang.Object, java.lang.Object);
  public static java.lang.Object strengthR(scalaz.Functor, java.lang.Object, java.lang.Object);
  public static java.lang.Object mapply(scalaz.Functor, java.lang.Object, java.lang.Object);
  public static java.lang.Object fpair(scalaz.Functor, java.lang.Object);
  public static java.lang.Object fproduct(scalaz.Functor, java.lang.Object, scala.Function1);
  public static java.lang.Object void(scalaz.Functor, java.lang.Object);
  public static java.lang.Object counzip(scalaz.Functor, scalaz.$bslash$div);
  public static scalaz.Functor compose(scalaz.Functor, scalaz.Functor);
  public static scalaz.Contravariant icompose(scalaz.Functor, scalaz.Contravariant);
  public static scalaz.Bifunctor bicompose(scalaz.Functor, scalaz.Bifunctor);
  public static scalaz.Functor product(scalaz.Functor, scalaz.Functor);
  public static java.lang.Object widen(scalaz.Functor, java.lang.Object, scalaz.Liskov);
  public static scalaz.Functor$FunctorLaw functorLaw(scalaz.Functor);
  public static final java.lang.Object scalaz$Functor$class$$$anonfun$1(scalaz.Functor, scala.Function1, java.lang.Object);
  public static final scala.Tuple2 scalaz$Functor$class$$$anonfun$2(scalaz.Functor, java.lang.Object, java.lang.Object);
  public static final scala.Tuple2 scalaz$Functor$class$$$anonfun$3(scalaz.Functor, java.lang.Object, java.lang.Object);
  public static final java.lang.Object scalaz$Functor$class$$$anonfun$4(scalaz.Functor, java.lang.Object, scala.Function1);
  public static final scala.Tuple2 scalaz$Functor$class$$$anonfun$5(scalaz.Functor, java.lang.Object);
  public static final scala.Tuple2 scalaz$Functor$class$$$anonfun$6(scalaz.Functor, scala.Function1, java.lang.Object);
  public static final void scalaz$Functor$class$$$anonfun$7(scalaz.Functor, java.lang.Object);
  public static final java.lang.Object scalaz$Functor$class$$$anonfun$9(scalaz.Functor, scalaz.Liskov, java.lang.Object);
  public static void $init$(scalaz.Functor);
  public static final java.lang.Object scalaz$Functor$class$$$anonfun$7$adapted(scalaz.Functor, java.lang.Object);
}
Compiled from "Monad.scala"
public final class scalaz.Monad$$anon$3 implements scalaz.Monad<F>.MonadLaw {
  public <A> boolean rightIdentity(F, scalaz.Equal<F>);
  public <A, B> boolean leftIdentity(A, scala.Function1<A, F>, scalaz.Equal<F>);
  public <A, B, C> boolean associativeBind(java.lang.Object, scala.Function1<A, java.lang.Object>, scala.Function1<B, java.lang.Object>, scalaz.Equal<java.lang.Object>);
  public <A, B> boolean apLikeDerived(java.lang.Object, java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A> boolean identityAp(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B> boolean homomorphism(scala.Function1<A, B>, A, scalaz.Equal<java.lang.Object>);
  public <A, B> boolean interchange(java.lang.Object, A, scalaz.Equal<java.lang.Object>);
  public <A, B> boolean mapLikeDerived(scala.Function1<A, B>, java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean composition(java.lang.Object, java.lang.Object, java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A> boolean identity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean composite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, C>, scalaz.Equal<java.lang.Object>);
  public <A> boolean invariantIdentity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean invariantComposite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, A>, scala.Function1<B, C>, scala.Function1<C, B>, scalaz.Equal<java.lang.Object>);
  public scalaz.Monad scalaz$Monad$MonadLaw$$$outer();
  public scalaz.Bind scalaz$Bind$BindLaw$$$outer();
  public scalaz.Applicative scalaz$Applicative$ApplicativeLaw$$$outer();
  public scalaz.Apply scalaz$Apply$ApplyLaw$$$outer();
  public scalaz.Functor scalaz$Functor$FunctorLaw$$$outer();
  public scalaz.InvariantFunctor scalaz$InvariantFunctor$InvariantFunctorLaw$$$outer();
  public scalaz.Monad$$anon$3(scalaz.Monad<F>);
}
Compiled from "MonadPlus.scala"
public final class scalaz.MonadPlus$$anon$3 implements scalaz.MonadPlus<F>.StrongMonadPlusLaw {
  public <A> boolean rightZero(F, scalaz.Equal<F>);
  public <A> boolean emptyMap(scala.Function1<A, A>, scalaz.Equal<F>);
  public <A> boolean leftZero(scala.Function1<A, F>, scalaz.Equal<F>);
  public <A> boolean rightIdentity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B> boolean leftIdentity(A, scala.Function1<A, java.lang.Object>, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean associativeBind(java.lang.Object, scala.Function1<A, java.lang.Object>, scala.Function1<B, java.lang.Object>, scalaz.Equal<java.lang.Object>);
  public <A, B> boolean apLikeDerived(java.lang.Object, java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A> boolean identityAp(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B> boolean homomorphism(scala.Function1<A, B>, A, scalaz.Equal<java.lang.Object>);
  public <A, B> boolean interchange(java.lang.Object, A, scalaz.Equal<java.lang.Object>);
  public <A, B> boolean mapLikeDerived(scala.Function1<A, B>, java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean composition(java.lang.Object, java.lang.Object, java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A> boolean identity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean composite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, C>, scalaz.Equal<java.lang.Object>);
  public <A> boolean invariantIdentity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean invariantComposite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, A>, scala.Function1<B, C>, scala.Function1<C, B>, scalaz.Equal<java.lang.Object>);
  public <A> boolean rightPlusIdentity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A> boolean leftPlusIdentity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A> boolean associative(java.lang.Object, java.lang.Object, java.lang.Object, scalaz.Equal<java.lang.Object>);
  public scalaz.MonadPlus scalaz$MonadPlus$StrongMonadPlusLaw$$$outer();
  public scalaz.MonadPlus scalaz$MonadPlus$MonadPlusLaw$$$outer();
  public scalaz.Monad scalaz$Monad$MonadLaw$$$outer();
  public scalaz.Bind scalaz$Bind$BindLaw$$$outer();
  public scalaz.Applicative scalaz$Applicative$ApplicativeLaw$$$outer();
  public scalaz.Apply scalaz$Apply$ApplyLaw$$$outer();
  public scalaz.Functor scalaz$Functor$FunctorLaw$$$outer();
  public scalaz.InvariantFunctor scalaz$InvariantFunctor$InvariantFunctorLaw$$$outer();
  public scalaz.PlusEmpty scalaz$PlusEmpty$EmptyLaw$$$outer();
  public scalaz.Plus scalaz$Plus$PlusLaw$$$outer();
  public scalaz.MonadPlus$$anon$3(scalaz.MonadPlus<F>);
}
Compiled from "MonadPlus.scala"
public final class scalaz.MonadPlus$$anon$4 implements scalaz.MonadPlus<F>.MonadPlusLaw {
  public <A> boolean emptyMap(scala.Function1<A, A>, scalaz.Equal<F>);
  public <A> boolean leftZero(scala.Function1<A, F>, scalaz.Equal<F>);
  public <A> boolean rightIdentity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B> boolean leftIdentity(A, scala.Function1<A, java.lang.Object>, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean associativeBind(java.lang.Object, scala.Function1<A, java.lang.Object>, scala.Function1<B, java.lang.Object>, scalaz.Equal<java.lang.Object>);
  public <A, B> boolean apLikeDerived(java.lang.Object, java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A> boolean identityAp(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B> boolean homomorphism(scala.Function1<A, B>, A, scalaz.Equal<java.lang.Object>);
  public <A, B> boolean interchange(java.lang.Object, A, scalaz.Equal<java.lang.Object>);
  public <A, B> boolean mapLikeDerived(scala.Function1<A, B>, java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean composition(java.lang.Object, java.lang.Object, java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A> boolean identity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean composite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, C>, scalaz.Equal<java.lang.Object>);
  public <A> boolean invariantIdentity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean invariantComposite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, A>, scala.Function1<B, C>, scala.Function1<C, B>, scalaz.Equal<java.lang.Object>);
  public <A> boolean rightPlusIdentity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A> boolean leftPlusIdentity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A> boolean associative(java.lang.Object, java.lang.Object, java.lang.Object, scalaz.Equal<java.lang.Object>);
  public scalaz.MonadPlus scalaz$MonadPlus$MonadPlusLaw$$$outer();
  public scalaz.Monad scalaz$Monad$MonadLaw$$$outer();
  public scalaz.Bind scalaz$Bind$BindLaw$$$outer();
  public scalaz.Applicative scalaz$Applicative$ApplicativeLaw$$$outer();
  public scalaz.Apply scalaz$Apply$ApplyLaw$$$outer();
  public scalaz.Functor scalaz$Functor$FunctorLaw$$$outer();
  public scalaz.InvariantFunctor scalaz$InvariantFunctor$InvariantFunctorLaw$$$outer();
  public scalaz.PlusEmpty scalaz$PlusEmpty$EmptyLaw$$$outer();
  public scalaz.Plus scalaz$Plus$PlusLaw$$$outer();
  public scalaz.MonadPlus$$anon$4(scalaz.MonadPlus<F>);
}
Compiled from "Traverse.scala"
public final class scalaz.Traverse$$anon$6 implements scalaz.Traverse<F>.TraverseLaw {
  public <A, B> boolean identityTraverse(F, scala.Function1<A, B>, scalaz.Equal<F>);
  public <N, M, A, B, C> boolean sequentialFusion(F, scala.Function1<A, M>, scala.Function1<B, N>, scalaz.Applicative<N>, scalaz.Applicative<M>, scalaz.Equal<M>);
  public <G, A> boolean purity(F, scalaz.Applicative<G>, scalaz.Equal<G>);
  public <N, M, A> boolean naturality(scalaz.NaturalTransformation<M, N>, F, scalaz.Applicative<N>, scalaz.Applicative<M>, scalaz.Equal<N>);
  public <N, M, A, B> boolean parallelFusion(F, scala.Function1<A, M>, scala.Function1<A, N>, scalaz.Applicative<N>, scalaz.Applicative<M>, scalaz.Equal<scala.Tuple2<M, N>>);
  public <A> boolean identity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean composite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, C>, scalaz.Equal<java.lang.Object>);
  public <A> boolean invariantIdentity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean invariantComposite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, A>, scala.Function1<B, C>, scala.Function1<C, B>, scalaz.Equal<java.lang.Object>);
  public scalaz.Traverse scalaz$Traverse$TraverseLaw$$$outer();
  public scalaz.Functor scalaz$Functor$FunctorLaw$$$outer();
  public scalaz.InvariantFunctor scalaz$InvariantFunctor$InvariantFunctorLaw$$$outer();
  public scalaz.Traverse$$anon$6(scalaz.Traverse<F>);
}
Compiled from "Traverse1.scala"
public final class scalaz.Traverse1$$anon$5 implements scalaz.Traverse1<F>.Traverse1Law {
  public <A, B> boolean identityTraverse1(F, scala.Function1<A, B>, scalaz.Equal<F>);
  public <N, M, A, B, C> boolean sequentialFusion1(F, scala.Function1<A, M>, scala.Function1<B, N>, scalaz.Apply<N>, scalaz.Apply<M>, scalaz.Equal<M>);
  public <N, M, A> boolean naturality1(scalaz.NaturalTransformation<M, N>, F, scalaz.Apply<N>, scalaz.Apply<M>, scalaz.Equal<N>);
  public <N, M, A, B> boolean parallelFusion1(F, scala.Function1<A, M>, scala.Function1<A, N>, scalaz.Apply<N>, scalaz.Apply<M>, scalaz.Equal<scala.Tuple2<M, N>>);
  public <A, B> boolean identityTraverse(java.lang.Object, scala.Function1<A, B>, scalaz.Equal<java.lang.Object>);
  public <N, M, A, B, C> boolean sequentialFusion(java.lang.Object, scala.Function1<A, M>, scala.Function1<B, N>, scalaz.Applicative<N>, scalaz.Applicative<M>, scalaz.Equal<M>);
  public <G, A> boolean purity(java.lang.Object, scalaz.Applicative<G>, scalaz.Equal<G>);
  public <N, M, A> boolean naturality(scalaz.NaturalTransformation<M, N>, java.lang.Object, scalaz.Applicative<N>, scalaz.Applicative<M>, scalaz.Equal<N>);
  public <N, M, A, B> boolean parallelFusion(java.lang.Object, scala.Function1<A, M>, scala.Function1<A, N>, scalaz.Applicative<N>, scalaz.Applicative<M>, scalaz.Equal<scala.Tuple2<M, N>>);
  public <A> boolean identity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean composite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, C>, scalaz.Equal<java.lang.Object>);
  public <A> boolean invariantIdentity(java.lang.Object, scalaz.Equal<java.lang.Object>);
  public <A, B, C> boolean invariantComposite(java.lang.Object, scala.Function1<A, B>, scala.Function1<B, A>, scala.Function1<B, C>, scala.Function1<C, B>, scalaz.Equal<java.lang.Object>);
  public scalaz.Traverse1 scalaz$Traverse1$Traverse1Law$$$outer();
  public scalaz.Traverse scalaz$Traverse$TraverseLaw$$$outer();
  public scalaz.Functor scalaz$Functor$FunctorLaw$$$outer();
  public scalaz.InvariantFunctor scalaz$InvariantFunctor$InvariantFunctorLaw$$$outer();
  public scalaz.Traverse1$$anon$5(scalaz.Traverse1<F>);
}