trait RxnLaws extends AnyRef
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- RxnLaws
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
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 andAlsoIsAndThen[A, B, C, D](x: =#>[A, B], y: =#>[C, D]): IsEq[Rxn[(A, C), (B, D)]]
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def asIsMap[A, B, C](rxn: =#>[A, B], c: C): IsEq[=#>[A, C]]
- def associativeAndAlso[A, B, C, D, E, F](x: =#>[A, B], y: =#>[C, D], z: =#>[E, F]): IsEq[Rxn[((A, C), E), ((B, D), F)]]
- def choiceRetryNeutralLeft[A, B](x: =#>[A, B]): IsEq[core.Rxn[A, B]]
- def choiceRetryNeutralRight[A, B](x: =#>[A, B]): IsEq[core.Rxn[A, B]]
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def contramapIsLiftAndThen[A, B, C](f: (A) => B, rxn: =#>[B, C]): IsEq[Rxn[A, C]]
- def distributiveAndAlsoChoice1[A, B, C, D](x: =#>[A, B], y: =#>[C, D], z: =#>[C, D]): IsEq[Rxn[(A, C), (B, D)]]
- def distributiveAndAlsoChoice2[A, B, C, D](x: =#>[A, B], y: =#>[A, B], z: =#>[C, D]): IsEq[Rxn[(A, C), (B, D)]]
- def distributiveAndThenChoice1[A, B, C](x: =#>[A, B], y: =#>[B, C], z: =#>[B, C]): IsEq[Rxn[A, C]]
- def distributiveAndThenChoice2[A, B, C](x: =#>[A, B], y: =#>[A, B], z: =#>[B, C]): IsEq[Rxn[A, C]]
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def equalsItself[A, B](rxn: Rxn[A, B]): IsEq[Rxn[A, B]]
- def flatMapFIsAndThenComputed[A, B, C](x: =#>[A, B], f: (B) => Axn[C]): IsEq[Rxn[A, C]]
- def flatMapIsSecondAndThenComputed[A, B, C](x: =#>[A, B], f: (B) => Rxn[A, C]): IsEq[Rxn[A, C]]
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def mapIsAndThenLift[A, B, C](rxn: =#>[A, B], f: (B) => C): IsEq[Rxn[A, C]]
- 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 provideIsContramap[A, B](a: A, rxn: =#>[A, B]): IsEq[Axn[B]]
- def pureIsRet[A](a: A): IsEq[Axn[A]]
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def timesIsAndAlso[A, B, C](x: =#>[A, B], y: =#>[A, C]): IsEq[=#>[A, (B, C)]]
- def toFunctionIsProvide[A, B](rxn: =#>[A, B], a: A): IsEq[Axn[B]]
- def toString(): String
- Definition Classes
- AnyRef → Any
- def voidIsMap[A, B](rxn: =#>[A, B]): IsEq[=#>[A, Unit]]
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()