fp

Value Members

1. implicit val BooleanRenderTree: RenderTree[Boolean]

   

   Definition Classes

   TreeInstances

2. implicit val DoubleRenderTree: RenderTree[Double]

   

   Definition Classes

   TreeInstances

3. implicit def EitherRenderTree[A, B](implicit RA: RenderTree[A], RB: RenderTree[B]): RenderTree[\/[A, B]]

   

   Definition Classes

   TreeInstances

4. implicit def EqualEqualF[F[_], A, FF[A] <: F[A]](implicit arg0: Equal[A], FE: EqualF[F]): Equal[FF[A]]

   

5. implicit def EqualFNT[F[_]](implicit EF: EqualF[F]): ~>[Equal, [α]Equal[F[α]]]

   

6. implicit val IntRenderTree: RenderTree[Int]

   

   Definition Classes

   TreeInstances

7. implicit def LeftTuple3RenderTree[A, B, C](implicit RA: RenderTree[A], RB: RenderTree[B], RC: RenderTree[C]): RenderTree[((A, B), C)]

   

   Definition Classes

   LowPriorityTreeInstances

8. implicit def LeftTuple4RenderTree[A, B, C, D](implicit RA: RenderTree[A], RB: RenderTree[B], RC: RenderTree[C], RD: RenderTree[D]): RenderTree[(((A, B), C), D)]

   

   Definition Classes

   TreeInstances

9. implicit def ListMapRenderTree[K, V](implicit RV: RenderTree[V]): RenderTree[ListMap[K, V]]

   

   Definition Classes

   TreeInstances

10. implicit def ListRenderTree[A](implicit RA: RenderTree[A]): RenderTree[List[A]]

    

    Definition Classes

    TreeInstances

11. implicit def OptionRenderTree[A](implicit RA: RenderTree[A]): RenderTree[Option[A]]

    

    Definition Classes

    TreeInstances

12. implicit def PathRenderTree[B, T, S]: RenderTree[Path[B, T, S]]

    

    Definition Classes

    TreeInstances

13. implicit def RenderTreeToShow[N](implicit arg0: RenderTree[N]): Show[N]

    

    Definition Classes

    TreeInstances

14. implicit def ShowFNT[F[_]](implicit SF: ShowF[F]): ~>[Show, [α]Show[F[α]]]

    

15. implicit def ShowShowF[F[_], A, FF[A] <: F[A]](implicit arg0: Show[A], FS: ShowF[F]): Show[FF[A]]

    

16. implicit val StringRenderTree: RenderTree[String]

    

    Definition Classes

    TreeInstances

17. implicit val SymbolEqual: Equal[Symbol]

    

    Definition Classes

    TreeInstances

18. implicit def ToCatchableOpsFromCatchable[F[_], A](a: F[A]): CatchableOps[F, A]

    

    Definition Classes

    ToCatchableOps

19. implicit def TraverseListMap[K]: Traverse[[β$0$]ListMap[K, β$0$]] with IsEmpty[[β$1$]ListMap[K, β$1$]]

    

    Definition Classes

    ListMapInstances

20. implicit def Tuple2RenderTree[A, B](implicit RA: RenderTree[A], RB: RenderTree[B]): RenderTree[(A, B)]

    

    Definition Classes

    LowerPriorityTreeInstances

21. implicit def VectorRenderTree[A](implicit RA: RenderTree[A]): RenderTree[Vector[A]]

    

    Definition Classes

    TreeInstances

22. def coEnvHtraverse[G[_], F[_], H[_], A, B](fa: CoEnv[A, F, B])(f: ~>[F, [A]G[H[A]]])(implicit arg0: Applicative[G]): G[CoEnv[A, H, B]]

    

23. implicit def coenvFunctor[F[_], E](implicit arg0: Functor[F]): Functor[[γ$23$]CoEnv[E, F, γ$23$]]

    

    Definition Classes

    CoEnvInstances

24. implicit def coenvTraverse[F[_], E](implicit arg0: Traverse[F]): Traverse[[γ$22$]CoEnv[E, F, γ$22$]]

    

    Definition Classes

    LowPriorityCoEnvImplicits

25. implicit def constEqual[A](implicit arg0: Equal[A]): Delay[Equal, [β$36$]Const[A, β$36$]]

    

26. implicit def constShow[A](implicit arg0: Show[A]): Delay[Show, [β$38$]Const[A, β$38$]]

    

27. implicit def coproductEqual[F[_], G[_]](implicit F: Delay[Equal, F], G: Delay[Equal, G]): Delay[Equal, [γ$32$]Coproduct[F, G, γ$32$]]

    

28. implicit def coproductShow[F[_], G[_]](implicit F: Delay[Show, F], G: Delay[Show, G]): Delay[Show, [γ$34$]Coproduct[F, G, γ$34$]]

    

29. def decodeJson[A](text: String)(implicit DA: DecodeJson[A]): \/[String, A]

    

    Definition Classes

    JsonOps

30. def distTraverse[F[_], G[_]](implicit arg0: Traverse[F], arg1: Applicative[G]): DistributiveLaw[F, G]

    

31. implicit def eitherTCatchable[F[_], E](implicit arg0: Catchable[F], arg1: Functor[F]): Catchable[[γ$4$]EitherT[F, E, γ$4$]]

    

    Definition Classes

    EitherTInstances

32. implicit def eitherTMonadState[F[_], S, E](implicit F: MonadState[F, S]): MonadState[[γ$6$]EitherT[F, E, γ$6$], S]

    

    Definition Classes

    EitherTInstances

33. def elgotM[M[_], F[_], A, B](a: A)(φ: (F[B]) ⇒ M[B], ψ: (A) ⇒ M[\/[B, F[A]]])(implicit arg0: Monad[M], arg1: Traverse[F]): M[B]

    

34. implicit def equalTEqual[T[_[_]], F[_]](implicit T: EqualT[T], F: Delay[Equal, F]): Equal[T[F]]

    

35. implicit val equalTFix: EqualT[Fix]

    

36. def evalNT[F[_], S](initial: S)(implicit arg0: Monad[F]): ~>[[γ$26$]IndexedStateT[F, S, S, γ$26$], F]

    

37. implicit def finEqual[N <: Succ[_]]: Equal[Fin[N]]

    

38. implicit def finShow[N <: Succ[_]]: Show[Fin[N]]

    

39. def freeCata[F[_], E, A](free: Free[F, E])(φ: Algebra[[γ$44$]CoEnv[E, F, γ$44$], A])(implicit arg0: Traverse[F]): A

    

40. def freeCataM[M[_], F[_], E, A](free: Free[F, E])(φ: AlgebraM[M, [γ$45$]CoEnv[E, F, γ$45$], A])(implicit arg0: Monad[M], arg1: Traverse[F]): M[A]

    

41. def freeGcataM[W[_], M[_], F[_], E, A](free: Free[F, E])(k: DistributiveLaw[[γ$46$]CoEnv[E, F, γ$46$], W], φ: GAlgebraM[W, M, [γ$47$]CoEnv[E, F, γ$47$], A])(implicit arg0: Comonad[W], arg1: Traverse[W], arg2: Monad[M], arg3: Traverse[F]): M[A]

    

42. def freeTransCata[T[_[_]], F[_], G[_], A, B](free: Free[F, A])(f: (CoEnv[A, F, T[[γ$52$]CoEnv[B, G, γ$52$]]]) ⇒ CoEnv[B, G, T[[γ$53$]CoEnv[B, G, γ$53$]]])(implicit arg0: Recursive[T], arg1: Corecursive[T], arg2: Functor[F], arg3: Functor[G]): Free[G, B]

    

43. def freeTransCataM[T[_[_]], M[_], F[_], G[_], A, B](free: Free[F, A])(f: (CoEnv[A, F, T[[γ$55$]CoEnv[B, G, γ$55$]]]) ⇒ M[CoEnv[B, G, T[[γ$56$]CoEnv[B, G, γ$56$]]]])(implicit arg0: Recursive[T], arg1: Corecursive[T], arg2: Monad[M], arg3: Traverse[F], arg4: Functor[G]): M[Free[G, B]]

    

44. def ginterpretM[W[_], M[_], F[_], A, B](f: (A) ⇒ M[B], φ: GAlgebraM[W, M, F, B]): GAlgebraM[W, M, [γ$42$]CoEnv[A, F, γ$42$], B]

    

45. def ignore[A](a: A): Unit

    

46. def interpret[F[_], A, B](f: (A) ⇒ B, φ: Algebra[F, B]): Algebra[[γ$40$]CoEnv[A, F, γ$40$], B]

    

47. def interpretM[M[_], F[_], A, B](f: (A) ⇒ M[B], φ: AlgebraM[M, F, B]): AlgebraM[M, [γ$41$]CoEnv[A, F, γ$41$], B]

    

48. def liftCo[T[_[_]], F[_], A](f: (F[T[[γ$58$]CoEnv[A, F, γ$58$]]]) ⇒ CoEnv[A, F, T[[γ$59$]CoEnv[A, F, γ$59$]]]): (CoEnv[A, F, T[[γ$60$]CoEnv[A, F, γ$60$]]]) ⇒ CoEnv[A, F, T[[γ$61$]CoEnv[A, F, γ$61$]]]

    

49. def liftFF[F[_], G[_], A](orig: (F[A]) ⇒ F[A])(implicit F: :<:[F, G]): (G[A]) ⇒ G[A]

    

50. def liftFG[F[_], G[_], A](orig: (F[A]) ⇒ G[A])(implicit F: :<:[F, G]): (G[A]) ⇒ G[A]

    

51. def liftFGM[M[_], F[_], G[_], A](orig: (F[A]) ⇒ M[G[A]])(implicit arg0: Monad[M], F: :<:[F, G]): (G[A]) ⇒ M[G[A]]

    

52. def liftMT[F[_], G[_[_], _]](implicit arg0: Monad[F], arg1: MonadTrans[G]): ~>[F, [β$24$]G[F, β$24$]]

    

53. val minspace: PrettyParams

    

    Definition Classes

    JsonOps

54. val multiline: PrettyParams

    

    Definition Classes

    JsonOps

55. implicit def natEqual[N <: Nat]: Equal[N]

    

56. implicit def natShow[N <: Nat]: Show[N]

    

57. implicit def optionTCatchable[F[_]](implicit arg0: Catchable[F], arg1: Functor[F]): Catchable[[β$16$]OptionT[F, β$16$]]

    

    Definition Classes

    OptionTInstances

58. def optional[A](cur: ACursor)(implicit arg0: DecodeJson[A]): DecodeResult[Option[A]]

    

    Definition Classes

    JsonOps

59. def orElse[A](cur: ACursor, default: ⇒ A)(implicit arg0: DecodeJson[A]): DecodeResult[A]

    

    Definition Classes

    JsonOps

60. def pointNT[F[_]](implicit arg0: Applicative[F]): ~>[scalaz.Scalaz.Id, F]

    

61. def recover[F[_], A](φ: Algebra[F, A]): Algebra[[γ$43$]CoEnv[A, F, γ$43$], A]

    

62. def reflNT[F[_]]: ~>[F, F]

    

63. implicit def seqW[A](xs: Seq[A]): SeqW[A]

    

    Definition Classes

    ListMapInstances

64. implicit val showTFix: ShowT[Fix]

    

65. implicit def showTShow[T[_[_]], F[_]](implicit T: ShowT[T], F: Delay[Show, F]): Show[T[F]]

    

66. implicit def sizedEqual[A, N <: Nat](implicit arg0: Equal[A]): Equal[Sized[A, N]]

    

67. implicit def sizedShow[A, N <: Nat](implicit arg0: Show[A]): Show[Sized[A, N]]

    

68. implicit def stateTCatchable[F[_], S](implicit arg0: Catchable[F], arg1: Monad[F]): Catchable[[γ$18$]IndexedStateT[F, S, S, γ$18$]]

    

    Definition Classes

    StateTInstances

69. def substitute[T[_[_]], F[_]](original: T[F], replacement: T[F])(implicit T: Equal[T[F]]): (T[F]) ⇒ \/[T[F], T[F]]

    

70. def transApoT[T[_[_]], F[_]](t: T[F])(f: (T[F]) ⇒ \/[T[F], T[F]])(implicit arg0: FunctorT[T], arg1: Functor[F]): T[F]

    

71. def unzipDisj[A, B](ds: List[\/[A, B]]): (List[A], List[B])

    

72. implicit def writerTCatchable[F[_], W](implicit arg0: Catchable[F], arg1: Functor[F], arg2: Monoid[W]): Catchable[[γ$20$]WriterT[F, W, γ$20$]]

    

    Definition Classes

    WriterTInstances

73. def ι[A]: (A) ⇒ A

    

    Definition Classes

    SKI

74. def κ[A, B, C, D, E, F, G](x: G): (A, B, C, D, E, F) ⇒ G

    

    Definition Classes

    SKI

75. def κ[A, B, C, D](x: D): (A, B, C) ⇒ D

    

    Definition Classes

    SKI

76. def κ[A, B, C](x: C): (A, B) ⇒ C

    

    Definition Classes

    SKI

77. def κ[A, B](x: B): (A) ⇒ B

    

    Definition Classes

    SKI

78. def σ[A, B, C](x: (A) ⇒ (B) ⇒ C, y: (A) ⇒ B, z: A): C

    

    Definition Classes

    SKI