# Packages

t

Ordering
1. Alphabetic
2. By Inheritance
Inherited
4. BindLaw
5. ApplicativeLaw
6. ApplyLaw
7. FunctorLaw
8. InvariantFunctorLaw
9. EmptyLaw
10. PlusLaw
11. AnyRef
12. Any
1. Hide All
2. Show All
Visibility
1. Public
2. All

### Value Members

1. final def !=(arg0: Any)
Definition Classes
AnyRef → Any
2. final def ##(): Int
Definition Classes
AnyRef → Any
3. final def ==(arg0: Any)
Definition Classes
AnyRef → Any
4. def apLikeDerived[A, B](fa: F[A], f: F[(A) ⇒ B])(implicit FB: Equal[F[B]])

`ap` is consistent with `bind`.

`ap` is consistent with `bind`.

Definition Classes
BindLaw
5. final def asInstanceOf[T0]: T0
Definition Classes
Any
6. def associative[A](f1: F[A], f2: F[A], f3: F[A])(implicit FA: Equal[F[A]])
Definition Classes
PlusLaw
7. def associativeBind[A, B, C](fa: F[A], f: (A) ⇒ F[B], g: (B) ⇒ F[C])(implicit FC: Equal[F[C]])

As with semigroups, monadic effects only change when their order is changed, not when the order in which they're combined changes.

As with semigroups, monadic effects only change when their order is changed, not when the order in which they're combined changes.

Definition Classes
BindLaw
8. def clone()
Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@native() @throws( ... )
9. def composite[A, B, C](fa: F[A], f1: (A) ⇒ B, f2: (B) ⇒ C)(implicit FC: Equal[F[C]])

A series of maps may be freely rewritten as a single map on a composed function.

A series of maps may be freely rewritten as a single map on a composed function.

Definition Classes
FunctorLaw
10. def composition[A, B, C](fbc: F[(B) ⇒ C], fab: F[(A) ⇒ B], fa: F[A])(implicit FC: Equal[F[C]])

Lifted functions can be fused.

Lifted functions can be fused.

Definition Classes
ApplyLaw
11. def emptyMap[A](f1: (A) ⇒ A)(implicit FA: Equal[F[A]])

`empty[A]` is a polymorphic value over `A`.

`empty[A]` is a polymorphic value over `A`.

Definition Classes
12. final def eq(arg0: AnyRef)
Definition Classes
AnyRef
13. def equals(arg0: Any)
Definition Classes
AnyRef → Any
14. def finalize(): Unit
Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
15. final def getClass(): Class[_]
Definition Classes
AnyRef → Any
Annotations
@native()
16. def hashCode(): Int
Definition Classes
AnyRef → Any
Annotations
@native()
17. def homomorphism[A, B](ab: (A) ⇒ B, a: A)(implicit FB: Equal[F[B]])

`point` distributes over function applications.

`point` distributes over function applications.

Definition Classes
ApplicativeLaw
18. def identity[A](fa: F[A])(implicit FA: Equal[F[A]])

The identity function, lifted, is a no-op.

The identity function, lifted, is a no-op.

Definition Classes
FunctorLaw
19. def identityAp[A](fa: F[A])(implicit FA: Equal[F[A]])

`point(identity)` is a no-op.

`point(identity)` is a no-op.

Definition Classes
ApplicativeLaw
20. def interchange[A, B](f: F[(A) ⇒ B], a: A)(implicit FB: Equal[F[B]])

`point` is a left and right identity, F-wise.

`point` is a left and right identity, F-wise.

Definition Classes
ApplicativeLaw
21. def invariantComposite[A, B, C](fa: F[A], f1: (A) ⇒ B, g1: (B) ⇒ A, f2: (B) ⇒ C, g2: (C) ⇒ B)(implicit FC: Equal[F[C]])
Definition Classes
InvariantFunctorLaw
22. def invariantIdentity[A](fa: F[A])(implicit FA: Equal[F[A]])
Definition Classes
InvariantFunctorLaw
23. final def isInstanceOf[T0]
Definition Classes
Any
24. def leftIdentity[A, B](a: A, f: (A) ⇒ F[B])(implicit FB: Equal[F[B]])

Lifted `f` applied to pure `a` is just `f(a)`.

Lifted `f` applied to pure `a` is just `f(a)`.

Definition Classes
25. def leftPlusIdentity[A](f1: F[A])(implicit FA: Equal[F[A]])
Definition Classes
EmptyLaw
26. def leftZero[A](f: (A) ⇒ F[A])(implicit FA: Equal[F[A]])

`empty` short-circuits its right.

`empty` short-circuits its right.

Definition Classes
27. def mapLikeDerived[A, B](f: (A) ⇒ B, fa: F[A])(implicit FB: Equal[F[B]])

`map` is like the one derived from `point` and `ap`.

`map` is like the one derived from `point` and `ap`.

Definition Classes
ApplicativeLaw
28. final def ne(arg0: AnyRef)
Definition Classes
AnyRef
29. final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native()
30. final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native()
31. def rightIdentity[A](a: F[A])(implicit FA: Equal[F[A]])

Lifted `point` is a no-op.

Lifted `point` is a no-op.

Definition Classes
32. def rightPlusIdentity[A](f1: F[A])(implicit FA: Equal[F[A]])
Definition Classes
EmptyLaw
33. def rightZero[A](f: F[A])(implicit FA: Equal[F[A]])

`empty` short-circuits throughout its `join` tree.

34. final def synchronized[T0](arg0: ⇒ T0): T0
Definition Classes
AnyRef
35. def toString()
Definition Classes
AnyRef → Any
36. final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
37. final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
38. final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@native() @throws( ... )