trait IsomorphismDecidable[F[_], G[_]] extends Decidable[F] with IsomorphismDivisible[F, G] with IsomorphismInvariantAlt[F, G]
- Source
- Decidable.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- IsomorphismDecidable
- IsomorphismInvariantAlt
- IsomorphismDivisible
- IsomorphismInvariantApplicative
- IsomorphismDivide
- IsomorphismContravariant
- IsomorphismInvariantFunctor
- Decidable
- InvariantAlt
- Divisible
- InvariantApplicative
- Divide
- Contravariant
- InvariantFunctor
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Type Members
- trait ContravariantLaw extends InvariantFunctorLaw
- Definition Classes
- Contravariant
- trait DecidableLaw extends DivisibleLaw
- Definition Classes
- Decidable
- trait DivideLaw extends ContravariantLaw
- Definition Classes
- Divide
- trait DivisibleLaw extends DivideLaw
- Definition Classes
- Divisible
- trait InvariantFunctorLaw extends AnyRef
- Definition Classes
- InvariantFunctor
Abstract Value Members
- implicit abstract def G: Decidable[G]
- abstract def iso: Isomorphism.<~>[F, G]
- Definition Classes
- IsomorphismInvariantAlt → IsomorphismInvariantFunctor
Concrete Value Members
- final def choose[Z, A1, A2](a1: => F[A1], a2: => F[A2])(f: (Z) => \/[A1, A2]): F[Z]
- Definition Classes
- Decidable
- def choose1[Z, A1](a1: => F[A1])(f: (Z) => A1): F[Z]
- Definition Classes
- Decidable
- def choose2[Z, A1, A2](a1: => F[A1], a2: => F[A2])(f: (Z) => \/[A1, A2]): F[Z]
- Definition Classes
- IsomorphismDecidable → Decidable
- def choose3[Z, A1, A2, A3](a1: => F[A1], a2: => F[A2], a3: => F[A3])(f: (Z) => \/[A1, \/[A2, A3]]): F[Z]
- Definition Classes
- Decidable
- def choose4[Z, A1, A2, A3, A4](a1: => F[A1], a2: => F[A2], a3: => F[A3], a4: => F[A4])(f: (Z) => \/[A1, \/[A2, \/[A3, A4]]]): F[Z]
- Definition Classes
- Decidable
- final def choosing2[Z, A1, A2](f: (Z) => \/[A1, A2])(implicit fa1: F[A1], fa2: F[A2]): F[Z]
- Definition Classes
- Decidable
- final def choosing3[Z, A1, A2, A3](f: (Z) => \/[A1, \/[A2, A3]])(implicit fa1: F[A1], fa2: F[A2], fa3: F[A3]): F[Z]
- Definition Classes
- Decidable
- final def choosing4[Z, A1, A2, A3, A4](f: (Z) => \/[A1, \/[A2, \/[A3, A4]]])(implicit fa1: F[A1], fa2: F[A2], fa3: F[A3], fa4: F[A4]): F[Z]
- Definition Classes
- Decidable
- def compose[G[_]](implicit G0: Contravariant[G]): Functor[[α]F[G[α]]]
The composition of Contravariant F and G,
[x]F[G[x]], is covariant.The composition of Contravariant F and G,
[x]F[G[x]], is covariant.- Definition Classes
- Contravariant
- def conquer[A]: F[A]
Universally quantified instance of F[_]
Universally quantified instance of F[_]
- Definition Classes
- IsomorphismDivisible → Divisible
- def contramap[A, B](r: F[A])(f: (B) => A): F[B]
Transform
A.Transform
A.- Definition Classes
- IsomorphismContravariant → Contravariant
- Note
contramap(r)(identity)=r
- def contravariantLaw: ContravariantLaw
- Definition Classes
- Contravariant
- val contravariantSyntax: ContravariantSyntax[F]
- Definition Classes
- Contravariant
- def decidableLaw: DecidableLaw
- Definition Classes
- Decidable
- val decidableSyntax: DecidableSyntax[F]
- Definition Classes
- Decidable
- final def divide[A, B, C](fa: => F[A], fb: => F[B])(f: (C) => (A, B)): F[C]
- Definition Classes
- Divide
- final def divide1[A1, Z](a1: F[A1])(f: (Z) => A1): F[Z]
- Definition Classes
- Divide
- def divide2[A, B, C](fa: => F[A], fb: => F[B])(f: (C) => (A, B)): F[C]
- Definition Classes
- IsomorphismDivide → Divide
- def divide3[A1, A2, A3, Z](a1: => F[A1], a2: => F[A2], a3: => F[A3])(f: (Z) => (A1, A2, A3)): F[Z]
- Definition Classes
- Divide
- def divide4[A1, A2, A3, A4, Z](a1: => F[A1], a2: => F[A2], a3: => F[A3], a4: => F[A4])(f: (Z) => (A1, A2, A3, A4)): F[Z]
- Definition Classes
- Divide
- def divideLaw: DivideLaw
- Definition Classes
- Divide
- val divideSyntax: DivideSyntax[F]
- Definition Classes
- Divide
- final def dividing1[A1, Z](f: (Z) => A1)(implicit a1: F[A1]): F[Z]
- Definition Classes
- Divide
- final def dividing2[A1, A2, Z](f: (Z) => (A1, A2))(implicit a1: F[A1], a2: F[A2]): F[Z]
- Definition Classes
- Divide
- final def dividing3[A1, A2, A3, Z](f: (Z) => (A1, A2, A3))(implicit a1: F[A1], a2: F[A2], a3: F[A3]): F[Z]
- Definition Classes
- Divide
- final def dividing4[A1, A2, A3, A4, Z](f: (Z) => (A1, A2, A3, A4))(implicit a1: F[A1], a2: F[A2], a3: F[A3], a4: F[A4]): F[Z]
- Definition Classes
- Divide
- def divisibleLaw: DivisibleLaw
- Definition Classes
- Divisible
- val divisibleSyntax: DivisibleSyntax[F]
- Definition Classes
- Divisible
- def icompose[G[_]](implicit G0: Functor[G]): Contravariant[[α]F[G[α]]]
The composition of Contravariant F and Functor G,
[x]F[G[x]], is contravariant.The composition of Contravariant F and Functor G,
[x]F[G[x]], is contravariant.- Definition Classes
- Contravariant
- val invariantAltSyntax: InvariantAltSyntax[F]
- Definition Classes
- InvariantAlt
- val invariantApplicativeSyntax: InvariantApplicativeSyntax[F]
- Definition Classes
- InvariantApplicative
- def invariantFunctorLaw: InvariantFunctorLaw
- Definition Classes
- InvariantFunctor
- val invariantFunctorSyntax: InvariantFunctorSyntax[F]
- Definition Classes
- InvariantFunctor
- def narrow[A, B](fa: F[A])(implicit ev: <~<[B, A]): F[B]
- Definition Classes
- Contravariant
- def product[G[_]](implicit G0: Contravariant[G]): Contravariant[[α](F[α], G[α])]
The product of Contravariant
FandG,[x](F[x], G[x]]), is contravariant.The product of Contravariant
FandG,[x](F[x], G[x]]), is contravariant.- Definition Classes
- Contravariant
- def tuple2[A1, A2](a1: => F[A1], a2: => F[A2]): F[(A1, A2)]
- Definition Classes
- Divide
- final def xcoderiving1[Z, A1](f: (A1) => Z, g: (Z) => A1)(implicit a1: F[A1]): F[Z]
- Definition Classes
- InvariantAlt
- final def xcoderiving2[Z, A1, A2](f: (\/[A1, A2]) => Z, g: (Z) => \/[A1, A2])(implicit a1: F[A1], a2: F[A2]): F[Z]
- Definition Classes
- InvariantAlt
- final def xcoderiving3[Z, A1, A2, A3](f: (\/[A1, \/[A2, A3]]) => Z, g: (Z) => \/[A1, \/[A2, A3]])(implicit a1: F[A1], a2: F[A2], a3: F[A3]): F[Z]
- Definition Classes
- InvariantAlt
- final def xcoderiving4[Z, A1, A2, A3, A4](f: (\/[A1, \/[A2, \/[A3, A4]]]) => Z, g: (Z) => \/[A1, \/[A2, \/[A3, A4]]])(implicit a1: F[A1], a2: F[A2], a3: F[A3], a4: F[A4]): F[Z]
- Definition Classes
- InvariantAlt
- def xcoproduct1[Z, A1](a1: => F[A1])(f: (A1) => Z, g: (Z) => A1): F[Z]
- Definition Classes
- IsomorphismDecidable → Decidable → InvariantAlt
- def xcoproduct2[Z, A1, A2](a1: => F[A1], a2: => F[A2])(f: (\/[A1, A2]) => Z, g: (Z) => \/[A1, A2]): F[Z]
- Definition Classes
- IsomorphismDecidable → IsomorphismInvariantAlt → Decidable → InvariantAlt
- def xcoproduct3[Z, A1, A2, A3](a1: => F[A1], a2: => F[A2], a3: => F[A3])(f: (\/[A1, \/[A2, A3]]) => Z, g: (Z) => \/[A1, \/[A2, A3]]): F[Z]
- Definition Classes
- IsomorphismDecidable → Decidable → InvariantAlt
- def xcoproduct4[Z, A1, A2, A3, A4](a1: => F[A1], a2: => F[A2], a3: => F[A3], a4: => F[A4])(f: (\/[A1, \/[A2, \/[A3, A4]]]) => Z, g: (Z) => \/[A1, \/[A2, \/[A3, A4]]]): F[Z]
- Definition Classes
- IsomorphismDecidable → Decidable → InvariantAlt
- final def xderiving0[Z](z: => Z): F[Z]
- Definition Classes
- InvariantApplicative
- final def xderiving1[Z, A1](f: (A1) => Z, g: (Z) => A1)(implicit a1: F[A1]): F[Z]
- Definition Classes
- InvariantApplicative
- final def xderiving2[Z, A1, A2](f: (A1, A2) => Z, g: (Z) => (A1, A2))(implicit a1: F[A1], a2: F[A2]): F[Z]
- Definition Classes
- InvariantApplicative
- final def xderiving3[Z, A1, A2, A3](f: (A1, A2, A3) => Z, g: (Z) => (A1, A2, A3))(implicit a1: F[A1], a2: F[A2], a3: F[A3]): F[Z]
- Definition Classes
- InvariantApplicative
- final def xderiving4[Z, A1, A2, A3, A4](f: (A1, A2, A3, A4) => Z, g: (Z) => (A1, A2, A3, A4))(implicit a1: F[A1], a2: F[A2], a3: F[A3], a4: F[A4]): F[Z]
- Definition Classes
- InvariantApplicative
- def xmap[A, B](ma: F[A], f: (A) => B, g: (B) => A): F[B]
Converts
mato a value of typeF[B]using the provided functionsfandg.Converts
mato a value of typeF[B]using the provided functionsfandg.- Definition Classes
- IsomorphismInvariantFunctor → InvariantFunctor
- def xmapb[A, B](ma: F[A])(b: Bijection[A, B]): F[B]
Converts
mato a value of typeF[B]using the provided bijection.Converts
mato a value of typeF[B]using the provided bijection.- Definition Classes
- InvariantFunctor
- def xmapi[A, B](ma: F[A])(iso: Isomorphism.<=>[A, B]): F[B]
Converts
mato a value of typeF[B]using the provided isomorphism.Converts
mato a value of typeF[B]using the provided isomorphism.- Definition Classes
- InvariantFunctor
- def xproduct0[Z](z: => Z): F[Z]
- Definition Classes
- IsomorphismDivisible → IsomorphismInvariantApplicative → Divisible → InvariantApplicative
- def xproduct1[Z, A1](a1: => F[A1])(f: (A1) => Z, g: (Z) => A1): F[Z]
- Definition Classes
- IsomorphismDivisible → Divisible → InvariantApplicative
- def xproduct2[Z, A1, A2](a1: => F[A1], a2: => F[A2])(f: (A1, A2) => Z, g: (Z) => (A1, A2)): F[Z]
- Definition Classes
- IsomorphismDivisible → IsomorphismInvariantApplicative → Divisible → InvariantApplicative
- def xproduct3[Z, A1, A2, A3](a1: => F[A1], a2: => F[A2], a3: => F[A3])(f: (A1, A2, A3) => Z, g: (Z) => (A1, A2, A3)): F[Z]
- Definition Classes
- IsomorphismDivisible → Divisible → InvariantApplicative
- def xproduct4[Z, A1, A2, A3, A4](a1: => F[A1], a2: => F[A2], a3: => F[A3], a4: => F[A4])(f: (A1, A2, A3, A4) => Z, g: (Z) => (A1, A2, A3, A4)): F[Z]
- Definition Classes
- IsomorphismDivisible → Divisible → InvariantApplicative