trait AlternativeLaws[F[_]] extends ApplicativeLaws[F] with MonoidKLaws[F]
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- AlternativeLaws
- MonoidKLaws
- SemigroupKLaws
- ApplicativeLaws
- ApplyLaws
- SemigroupalLaws
- FunctorLaws
- InvariantLaws
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Abstract Value Members
-
implicit abstract
def
F: Alternative[F]
- Definition Classes
- AlternativeLaws → MonoidKLaws → SemigroupKLaws → ApplicativeLaws → ApplyLaws → SemigroupalLaws → FunctorLaws → InvariantLaws
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- implicit def algebra[A]: Monoid[F[A]]
- def alternativeLeftDistributivity[A, B](fa: F[A], fa2: F[A], f: (A) ⇒ B): IsEq[F[B]]
- def alternativeRightAbsorption[A, B](ff: F[(A) ⇒ B]): IsEq[F[B]]
- def alternativeRightDistributivity[A, B](fa: F[A], ff: F[(A) ⇒ B], fg: F[(A) ⇒ B]): IsEq[F[B]]
-
def
apProductConsistent[A, B](fa: F[A], f: F[(A) ⇒ B]): IsEq[F[B]]
- Definition Classes
- ApplicativeLaws
-
def
applicativeComposition[A, B, C](fa: F[A], fab: F[(A) ⇒ B], fbc: F[(B) ⇒ C]): IsEq[F[C]]
This law is applyComposition stated in terms of
pure.This law is applyComposition stated in terms of
pure. It is a combination of applyComposition and applicativeMap and hence not strictly necessary.- Definition Classes
- ApplicativeLaws
-
def
applicativeHomomorphism[A, B](a: A, f: (A) ⇒ B): IsEq[F[B]]
- Definition Classes
- ApplicativeLaws
-
def
applicativeIdentity[A](fa: F[A]): IsEq[F[A]]
- Definition Classes
- ApplicativeLaws
-
def
applicativeInterchange[A, B](a: A, ff: F[(A) ⇒ B]): IsEq[F[B]]
- Definition Classes
- ApplicativeLaws
-
def
applicativeMap[A, B](fa: F[A], f: (A) ⇒ B): IsEq[F[B]]
- Definition Classes
- ApplicativeLaws
-
def
applicativeUnit[A](a: A): IsEq[F[A]]
- Definition Classes
- ApplicativeLaws
-
def
applyComposition[A, B, C](fa: F[A], fab: F[(A) ⇒ B], fbc: F[(B) ⇒ C]): IsEq[F[C]]
- Definition Classes
- ApplyLaws
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
covariantComposition[A, B, C](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ C): IsEq[F[C]]
- Definition Classes
- FunctorLaws
-
def
covariantIdentity[A](fa: F[A]): IsEq[F[A]]
- Definition Classes
- FunctorLaws
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
invariantComposition[A, B, C](fa: F[A], f1: (A) ⇒ B, f2: (B) ⇒ A, g1: (B) ⇒ C, g2: (C) ⇒ B): IsEq[F[C]]
- Definition Classes
- InvariantLaws
-
def
invariantIdentity[A](fa: F[A]): IsEq[F[A]]
- Definition Classes
- InvariantLaws
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
map2EvalConsistency[A, B, C](fa: F[A], fb: F[B], f: (A, B) ⇒ C): IsEq[F[C]]
- Definition Classes
- ApplyLaws
-
def
map2ProductConsistency[A, B, C](fa: F[A], fb: F[B], f: (A, B) ⇒ C): IsEq[F[C]]
- Definition Classes
- ApplyLaws
-
def
monoidKLeftIdentity[A](a: F[A]): IsEq[F[A]]
- Definition Classes
- MonoidKLaws
-
def
monoidKRightIdentity[A](a: F[A]): IsEq[F[A]]
- Definition Classes
- MonoidKLaws
-
def
monoidalLeftIdentity[A](fa: F[A]): (F[(Unit, A)], F[A])
- Definition Classes
- ApplicativeLaws
-
def
monoidalRightIdentity[A](fa: F[A]): (F[(A, Unit)], F[A])
- Definition Classes
- ApplicativeLaws
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
productLConsistency[A, B](fa: F[A], fb: F[B]): IsEq[F[A]]
- Definition Classes
- ApplyLaws
-
def
productRConsistency[A, B](fa: F[A], fb: F[B]): IsEq[F[B]]
- Definition Classes
- ApplyLaws
-
def
semigroupKAssociative[A](a: F[A], b: F[A], c: F[A]): IsEq[F[A]]
- Definition Classes
- SemigroupKLaws
-
def
semigroupalAssociativity[A, B, C](fa: F[A], fb: F[B], fc: F[C]): (F[(A, (B, C))], F[((A, B), C)])
- Definition Classes
- SemigroupalLaws
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )