implicit object booleanInstance extends Enum[Boolean] with Show[Boolean]
- Source
- AnyVal.scala
- Alphabetic
- By Inheritance
- booleanInstance
- Show
- Enum
- Order
- Equal
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
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
apply(x: Boolean, y: Boolean): Ordering
- Definition Classes
- Order
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
- val conjunction: Monoid[Boolean]
- def contramap[B](f: (B) ⇒ Boolean): Order[B]
- val disjunction: Monoid[Boolean]
-
def
enumLaw: EnumLaw
- Definition Classes
- Enum
-
val
enumSyntax: EnumSyntax[Boolean]
- Definition Classes
- Enum
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equal(x: Boolean, y: Boolean): Boolean
-
def
equalIsNatural: Boolean
- returns
true, if
equal(f1, f2)
is known to be equivalent tof1 == f2
- Definition Classes
- booleanInstance → Equal
-
def
equalLaw: EqualLaw
- Definition Classes
- Equal
-
val
equalSyntax: EqualSyntax[Boolean]
- Definition Classes
- Equal
-
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] )
-
def
from(a: Boolean): EphemeralStream[Boolean]
- Definition Classes
- Enum
-
def
fromStep(n: Int, a: Boolean): EphemeralStream[Boolean]
- Definition Classes
- Enum
-
def
fromStepTo(n: Int, a: Boolean, z: Boolean): EphemeralStream[Boolean]
- Definition Classes
- Enum
-
def
fromStepToL(n: Int, a: Boolean, z: Boolean): IList[Boolean]
- Definition Classes
- Enum
-
def
fromTo(a: Boolean, z: Boolean): EphemeralStream[Boolean]
- Definition Classes
- Enum
-
def
fromToL(a: Boolean, z: Boolean): IList[Boolean]
- Definition Classes
- Enum
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
greaterThan(x: Boolean, y: Boolean): Boolean
- Definition Classes
- Order
-
def
greaterThanOrEqual(x: Boolean, y: Boolean): Boolean
- Definition Classes
- Order
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
lessThan(x: Boolean, y: Boolean): Boolean
- Definition Classes
- Order
-
def
lessThanOrEqual(x: Boolean, y: Boolean): Boolean
- Definition Classes
- Order
-
def
max: Some[Boolean]
- Definition Classes
- booleanInstance → Enum
-
def
max(x: Boolean, y: Boolean): Boolean
- Definition Classes
- Order
-
def
min: Some[Boolean]
- Definition Classes
- booleanInstance → Enum
-
def
min(x: Boolean, y: Boolean): Boolean
- Definition Classes
- Order
-
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
order(x: Boolean, y: Boolean): Ordering
- Definition Classes
- booleanInstance → Order
-
def
orderLaw: OrderLaw
- Definition Classes
- Order
-
val
orderSyntax: OrderSyntax[Boolean]
- Definition Classes
- Order
-
def
pred(b: Boolean): Boolean
- Definition Classes
- booleanInstance → Enum
-
def
predState[X](f: (Boolean) ⇒ X): State[Boolean, X]
Produce a state value that executes the predecessor (
pred
) on each spin and executing the given function on the current value.Produce a state value that executes the predecessor (
pred
) on each spin and executing the given function on the current value. This is useful to implement decremental looping. Evaluating the state value requires a beginning to decrement from.- f
The function to execute on each spin of the state value.
- Definition Classes
- Enum
-
def
predStateMax[X, Y](f: (Boolean) ⇒ X, k: (X) ⇒ Y): Option[Y]
Produce a value that starts at the maximum (if it exists) and decrements through a state value with the given mapping function.
Produce a value that starts at the maximum (if it exists) and decrements through a state value with the given mapping function. This is useful to implement decremental looping.
- f
The function to execute on each spin of the state value.
- k
The mapping function.
- Definition Classes
- Enum
-
def
predStateMaxM[X, Y](f: (Boolean) ⇒ X, k: (X) ⇒ State[Boolean, Y]): Option[Y]
Produce a value that starts at the maximum (if it exists) and decrements through a state value with the given binding function.
Produce a value that starts at the maximum (if it exists) and decrements through a state value with the given binding function. This is useful to implement decremental looping.
- f
The function to execute on each spin of the state value.
- k
The binding function.
- Definition Classes
- Enum
-
def
predStateZero[X, Y](f: (Boolean) ⇒ X, k: (X) ⇒ Y)(implicit m: Monoid[Boolean]): Y
Produce a value that starts at zero (
Monoid.zero
) and decrements through a state value with the given mapping function.Produce a value that starts at zero (
Monoid.zero
) and decrements through a state value with the given mapping function. This is useful to implement decremental looping.- f
The function to execute on each spin of the state value.
- k
The mapping function.
- m
The implementation of the zero function from which to start.
- Definition Classes
- Enum
-
def
predStateZeroM[X, Y](f: (Boolean) ⇒ X, k: (X) ⇒ State[Boolean, Y])(implicit m: Monoid[Boolean]): Y
Produce a value that starts at zero (
Monoid.zero
) and decrements through a state value with the given binding function.Produce a value that starts at zero (
Monoid.zero
) and decrements through a state value with the given binding function. This is useful to implement decremental looping.- f
The function to execute on each spin of the state value.
- k
The binding function.
- m
The implementation of the zero function from which to start.
- Definition Classes
- Enum
-
def
predn(n: Int, b: Boolean): Boolean
- Definition Classes
- booleanInstance → Enum
-
def
predx: Kleisli[Option, Boolean, Boolean]
Moves to the predecessor, unless at the minimum.
Moves to the predecessor, unless at the minimum.
- Definition Classes
- Enum
-
def
reverseOrder: Order[Boolean]
- Definition Classes
- Order
-
def
show(f: Boolean): Cord
- Definition Classes
- Show
-
val
showSyntax: ShowSyntax[Boolean]
- Definition Classes
- Show
-
def
shows(f: Boolean): String
- Definition Classes
- booleanInstance → Show
-
def
sort(x: Boolean, y: Boolean): (Boolean, Boolean)
- Definition Classes
- Order
-
def
succ(b: Boolean): Boolean
- Definition Classes
- booleanInstance → Enum
-
def
succState[X](f: (Boolean) ⇒ X): State[Boolean, X]
Produce a state value that executes the successor (
succ
) on each spin and executing the given function on the current value.Produce a state value that executes the successor (
succ
) on each spin and executing the given function on the current value. This is useful to implement incremental looping. Evaluating the state value requires a beginning to increment from.- f
The function to execute on each spin of the state value.
- Definition Classes
- Enum
-
def
succStateMin[X, Y](f: (Boolean) ⇒ X, k: (X) ⇒ Y): Option[Y]
Produce a value that starts at the minimum (if it exists) and increments through a state value with the given mapping function.
Produce a value that starts at the minimum (if it exists) and increments through a state value with the given mapping function. This is useful to implement incremental looping.
- f
The function to execute on each spin of the state value.
- k
The mapping function.
- Definition Classes
- Enum
-
def
succStateMinM[X, Y](f: (Boolean) ⇒ X, k: (X) ⇒ State[Boolean, Y]): Option[Y]
Produce a value that starts at the minimum (if it exists) and increments through a state value with the given binding function.
Produce a value that starts at the minimum (if it exists) and increments through a state value with the given binding function. This is useful to implement incremental looping.
- f
The function to execute on each spin of the state value.
- k
The binding function.
- Definition Classes
- Enum
-
def
succStateZero[X, Y](f: (Boolean) ⇒ X, k: (X) ⇒ Y)(implicit m: Monoid[Boolean]): Y
Produce a value that starts at zero (
Monoid.zero
) and increments through a state value with the given mapping function.Produce a value that starts at zero (
Monoid.zero
) and increments through a state value with the given mapping function. This is useful to implement incremental looping.- f
The function to execute on each spin of the state value.
- k
The mapping function.
- m
The implementation of the zero function from which to start.
- Definition Classes
- Enum
-
def
succStateZeroM[X, Y](f: (Boolean) ⇒ X, k: (X) ⇒ State[Boolean, Y])(implicit m: Monoid[Boolean]): Y
Produce a value that starts at zero (
Monoid.zero
) and increments through a state value with the given binding function.Produce a value that starts at zero (
Monoid.zero
) and increments through a state value with the given binding function. This is useful to implement incremental looping.- f
The function to execute on each spin of the state value.
- k
The binding function.
- m
The implementation of the zero function from which to start.
- Definition Classes
- Enum
-
def
succn(n: Int, b: Boolean): Boolean
- Definition Classes
- booleanInstance → Enum
-
def
succx: Kleisli[Option, Boolean, Boolean]
Moves to the successor, unless at the maximum.
Moves to the successor, unless at the maximum.
- Definition Classes
- Enum
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toScalaOrdering: scala.math.Ordering[Boolean]
- Definition Classes
- Order
- Note
Order.fromScalaOrdering(toScalaOrdering).order(x, y)
this.order(x, y)
-
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( ... )