fp

Value Members

1. implicit def ListMapEqual[A, B](implicit arg0: Equal[A], arg1: Equal[B]): Equal[slamdata.Predef.ListMap[A, B]]

   

   Definition Classes

   ListMapInstances

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

   

   Definition Classes

   ListMapInstances

3. def applyCoEnvFrom[T[_[_]], F[_], A](modify: (T[[γ$26$]CoEnv[A, F, γ$26$]]) ⇒ T[[γ$27$]CoEnv[A, F, γ$27$]])(implicit arg0: BirecursiveT[T], arg1: Functor[F]): (Free[F, A]) ⇒ Free[F, A]

   

4. def applyFrom[A, B](bij: Bijection[A, B])(modify: (B) ⇒ B): (A) ⇒ A

   

5. def coenvBijection[T[_[_]], F[_], A](implicit arg0: BirecursiveT[T], arg1: Functor[F]): Bijection[Free[F, A], T[[γ$23$]CoEnv[A, F, γ$23$]]]

   

6. def coenvPrism[F[_], A]: PrismNT[[γ$18$]CoEnv[A, F, γ$18$], F]

   

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

   

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

   

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

   

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

    

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

    

    Definition Classes

    JsonOps

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

    

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

    

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

    

15. def idPrism[F[_]]: PrismNT[F, F]

    

16. def ignore[A](a: A): slamdata.Predef.Unit

    

17. def injR[T[_[_]], F[_], G[_]](orig: T[F])(implicit arg0: BirecursiveT[T], arg1: Functor[F], arg2: Functor[G], F: :<:[F, G]): T[G]

    

18. def liftCo[T[_[_]], F[_], A, B](f: (F[B]) ⇒ CoEnv[A, F, B]): (CoEnv[A, F, B]) ⇒ CoEnv[A, F, B]

    

19. def liftCoM[T[_[_]], M[_], F[_], A, B](f: (F[B]) ⇒ M[CoEnv[A, F, B]])(implicit arg0: Applicative[M]): (CoEnv[A, F, B]) ⇒ M[CoEnv[A, F, B]]

    

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

    

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

    

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

    

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

    

24. def liftR[T[_[_]], F[_], G[_]](orig: (T[F]) ⇒ T[F])(implicit arg0: BirecursiveT[T], arg1: Traverse[F], arg2: Traverse[G], F: :<:[F, G]): (T[G]) ⇒ T[G]

    

25. val minspace: PrettyParams

    

    Definition Classes

    JsonOps

26. val multiline: PrettyParams

    

    Definition Classes

    JsonOps

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

    

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

    

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

    

    Definition Classes

    JsonOps

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

    

    Definition Classes

    JsonOps

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

    

32. def prjR[T[_[_]], F[_], G[_]](orig: T[G])(implicit arg0: BirecursiveT[T], arg1: Traverse[F], arg2: Traverse[G], F: :<:[F, G]): slamdata.Predef.Option[T[F]]

    

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

    

34. implicit def seqW[A](xs: slamdata.Predef.Seq[A]): SeqW[A]

    

    Definition Classes

    ListMapInstances

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

    

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

    

37. implicit val symbolEqual: Equal[slamdata.Predef.Symbol]

    

38. implicit val symbolShow: Show[slamdata.Predef.Symbol]