trait IsomorphismSemiLattice[F, G] extends SemiLattice[F] with IsomorphismBand[F, G]
- Source
- Isomorphism.scala
- Alphabetic
- By Inheritance
- IsomorphismSemiLattice
- IsomorphismBand
- IsomorphismSemigroup
- SemiLattice
- Band
- Semigroup
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
-
trait
BandLaw extends SemigroupLaw
Band instances must satisfy scalaz.Semigroup.SemigroupLaw and 1 additional law:
Band instances must satisfy scalaz.Semigroup.SemigroupLaw and 1 additional law:
- idempotency:
forall a. append(a, a) == a
- Definition Classes
- Band
- idempotency:
-
trait
SemiLatticeLaw extends BandLaw
- Definition Classes
- SemiLattice
-
trait
SemigroupApply extends Apply[[α]F]
- Attributes
- protected[this]
- Definition Classes
- Semigroup
-
trait
SemigroupCompose extends Compose[[α, β]F]
- Attributes
- protected[this]
- Definition Classes
- Semigroup
-
trait
SemigroupLaw extends AnyRef
A semigroup in type F must satisfy two laws:
A semigroup in type F must satisfy two laws:
- closure:
∀ a, b in F, append(a, b)is also inF. This is enforced by the type system. - associativity:
∀ a, b, cinF, the equationappend(append(a, b), c) = append(a, append(b , c))holds.
- Definition Classes
- Semigroup
- closure:
Abstract Value Members
-
implicit abstract
def
G: SemiLattice[G]
- Definition Classes
- IsomorphismSemiLattice → IsomorphismBand → IsomorphismSemigroup
-
abstract
def
iso: Isomorphism.<=>[F, G]
- Definition Classes
- IsomorphismSemigroup
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
-
def
append(f1: F, f2: ⇒ F): F
The binary operation to combine
f1andf2.The binary operation to combine
f1andf2.Implementations should not evaluate the by-name parameter
f2if result can be determined byf1.- Definition Classes
- IsomorphismSemigroup → Semigroup
-
final
def
apply: Apply[[α]F]
An scalaz.Apply, that implements
apwithappend.An scalaz.Apply, that implements
apwithappend. Note that the type parameterαinApply[λ[α => F]]is discarded; it is a phantom type. As such, the functor cannot support scalaz.Bind.- Definition Classes
- Semigroup
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
bandLaw: BandLaw
- Definition Classes
- Band
-
val
bandSyntax: BandSyntax[F]
- Definition Classes
- Band
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
compose: Compose[[α, β]F]
Every
Semigroupgives rise to a scalaz.Compose, for which the type parameters are phantoms.Every
Semigroupgives rise to a scalaz.Compose, for which the type parameters are phantoms.- Definition Classes
- Semigroup
- Note
compose.semigroup=this
-
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()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
multiply1(value: F, n: Int): F
The default definition exploits idempotency to optimise to
O(1) -
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
semiLatticeLaw: SemiLatticeLaw
- Definition Classes
- SemiLattice
-
val
semiLatticeSyntax: SemiLatticeSyntax[F]
- Definition Classes
- SemiLattice
-
def
semigroupLaw: SemigroupLaw
- Definition Classes
- Semigroup
-
val
semigroupSyntax: SemigroupSyntax[F]
- Definition Classes
- Semigroup
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
def
unfoldlSumOpt[S](seed: S)(f: (S) ⇒ Maybe[(S, F)]): Maybe[F]
Unfold
seedto the left and sum using #append. -
def
unfoldrSumOpt[S](seed: S)(f: (S) ⇒ Maybe[(F, S)]): Maybe[F]
Unfold
seedto the right and sum using #append. -
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( ... )