t

# Laws 

#### trait Laws[F[_], E] extends Monad.Laws[F] with Type[F, E]

Source
Linear Supertypes
Ordering
1. Alphabetic
2. By Inheritance
Inherited
1. Laws
2. Type
3. Laws
4. Type
5. Laws
6. Type
7. Laws
8. Type
9. AnyRef
10. Any
1. Hide All
2. Show All
Visibility
1. Public
2. All

### Abstract Value Members

1. implicit abstract def applicative: Applicative[F]
Definition Classes
Type
2. implicit abstract def functor: Functor[F]
Definition Classes
Type
Definition Classes
Type
Definition Classes
Type

### Concrete 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 applicativeComposition[A, B, C](fa: F[A], fab: F[(A) ⇒ B], fbc: F[(B) ⇒ C]): IsEquiv[F[C]]
Definition Classes
Laws
5. def applicativeErrorHandle[A](e: E, f: (E) ⇒ A): IsEquiv[F[A]]
6. def applicativeErrorHandleWith[A](e: E, f: (E) ⇒ F[A]): IsEquiv[F[A]]
7. def applicativeHomomorphism[A, B](a: A, f: (A) ⇒ B): IsEquiv[F[B]]
Definition Classes
Laws
8. def applicativeIdentity[A](fa: F[A]): IsEquiv[F[A]]
Definition Classes
Laws
9. def applicativeInterchange[A, B](a: A, ff: F[(A) ⇒ B]): IsEquiv[F[B]]
Definition Classes
Laws
10. def applicativeMap[A, B](fa: F[A], f: (A) ⇒ B): IsEquiv[F[B]]
Definition Classes
Laws
11. def applyComposition[A, B, C](fa: F[A], fab: F[(A) ⇒ B], fbc: F[(B) ⇒ C]): IsEquiv[F[C]]
Definition Classes
Laws
12. final def asInstanceOf[T0]: T0
Definition Classes
Any
13. def clone()
Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@native() @throws( ... )
14. def covariantComposition[A, B, C](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ C): IsEquiv[F[C]]
Definition Classes
Laws
15. def covariantIdentity[A](fa: F[A]): IsEquiv[F[A]]
Definition Classes
Laws
16. final def eq(arg0: AnyRef)
Definition Classes
AnyRef
17. def equals(arg0: Any)
Definition Classes
AnyRef → Any
18. def finalize(): Unit
Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
19. def flatMapAssociativity[A, B, C](fa: F[A], f: (A) ⇒ F[B], g: (B) ⇒ F[C]): IsEquiv[F[C]]
Definition Classes
Laws
20. def flatMapConsistentApply[A, B](fa: F[A], fab: F[(A) ⇒ B]): IsEquiv[F[B]]
Definition Classes
Laws
21. def flatMapConsistentMap2[A, B, C](fa: F[A], fb: F[B], f: (A, B) ⇒ C): IsEquiv[F[C]]
Definition Classes
Laws
22. final def getClass(): Class[_]
Definition Classes
AnyRef → Any
Annotations
@native()
23. def hashCode(): Int
Definition Classes
AnyRef → Any
Annotations
@native()
24. final def isInstanceOf[T0]
Definition Classes
Any
25. def monadErrorLeftZero[A, B](e: E, f: (A) ⇒ F[B]): IsEquiv[F[B]]
26. final def ne(arg0: AnyRef)
Definition Classes
AnyRef
27. final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native()
28. final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native()
29. def onErrorHandleConsistentWithRecover[A](fa: F[A], f: (E) ⇒ A): IsEquiv[F[A]]
30. def onErrorHandlePure[A](a: A, f: (E) ⇒ A): IsEquiv[F[A]]
31. def onErrorHandleWithConsistentWithRecoverWith[A](fa: F[A], f: (E) ⇒ F[A]): IsEquiv[F[A]]
32. def onErrorHandleWithPure[A](a: A, f: (E) ⇒ F[A]): IsEquiv[F[A]]
33. def pureAttempt[A](a: A): IsEquiv[F[Either[E, A]]]
34. def raiseErrorAttempt[A](e: E): IsEquiv[F[Either[E, A]]]
35. def recoverConsistentWithRecoverWith[A](fa: F[A], pf: PartialFunction[E, A]): IsEquiv[F[A]]
36. final def synchronized[T0](arg0: ⇒ T0): T0
Definition Classes
AnyRef
37. def toString(): String
Definition Classes
AnyRef → Any
38. final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
39. final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
40. final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@native() @throws( ... )