booleanInstance

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. def apply(x: Boolean, y: Boolean): Ordering

   

   Definition Classes

   Order

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

7. val conjunction: Monoid[Boolean]

   

8. def contramap[B](f: (B) ⇒ Boolean): Order[B]

   

   Definition Classes

   Order → Equal

9. val disjunction: Monoid[Boolean]

   

10. def enumLaw: EnumLaw

    

    Definition Classes

    Enum

11. val enumSyntax: EnumSyntax[Boolean]

    

    Definition Classes

    Enum

12. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

13. def equal(x: Boolean, y: Boolean): Boolean

    

    Definition Classes

    Order → Equal

14. def equalIsNatural: Boolean

    
    returns

    true, if equal(f1, f2) is known to be equivalent to f1 == f2

    Definition Classes

    booleanInstance → Equal

15. def equalLaw: EqualLaw

    

    Definition Classes

    Equal

16. val equalSyntax: EqualSyntax[Boolean]

    

    Definition Classes

    Equal

17. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

18. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

19. def from(a: Boolean): EphemeralStream[Boolean]

    

    Definition Classes

    Enum

20. def fromStep(n: Int, a: Boolean): EphemeralStream[Boolean]

    

    Definition Classes

    Enum

21. def fromStepTo(n: Int, a: Boolean, z: Boolean): EphemeralStream[Boolean]

    

    Definition Classes

    Enum

22. def fromStepToL(n: Int, a: Boolean, z: Boolean): IList[Boolean]

    

    Definition Classes

    Enum

23. def fromTo(a: Boolean, z: Boolean): EphemeralStream[Boolean]

    

    Definition Classes

    Enum

24. def fromToL(a: Boolean, z: Boolean): IList[Boolean]

    

    Definition Classes

    Enum

25. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

26. def greaterThan(x: Boolean, y: Boolean): Boolean

    

    Definition Classes

    Order

27. def greaterThanOrEqual(x: Boolean, y: Boolean): Boolean

    

    Definition Classes

    Order

28. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

29. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

30. def lessThan(x: Boolean, y: Boolean): Boolean

    

    Definition Classes

    Order

31. def lessThanOrEqual(x: Boolean, y: Boolean): Boolean

    

    Definition Classes

    Order

32. def max: Some[Boolean]

    

    Definition Classes

    booleanInstance → Enum

33. def max(x: Boolean, y: Boolean): Boolean

    

    Definition Classes

    Order

34. def min: Some[Boolean]

    

    Definition Classes

    booleanInstance → Enum

35. def min(x: Boolean, y: Boolean): Boolean

    

    Definition Classes

    Order

36. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

37. final def notify(): Unit

    

    Definition Classes

    AnyRef

38. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

39. def order(x: Boolean, y: Boolean): Ordering

    

    Definition Classes

    booleanInstance → Order

40. def orderLaw: OrderLaw

    

    Definition Classes

    Order

41. val orderSyntax: OrderSyntax[Boolean]

    

    Definition Classes

    Order

42. def pred(b: Boolean): Boolean

    

    Definition Classes

    booleanInstance → Enum

43. 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

44. 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

45. 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

46. 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

47. 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

48. def predn(n: Int, b: Boolean): Boolean

    

    Definition Classes

    booleanInstance → Enum

49. 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

50. def reverseOrder: Order[Boolean]

    

    Definition Classes

    Order

51. def show(f: Boolean): Cord

    

    Definition Classes

    booleanInstance → Show

52. val showSyntax: ShowSyntax[Boolean]

    

    Definition Classes

    Show

53. def shows(f: Boolean): String

    

    Definition Classes

    booleanInstance → Show

54. def sort(x: Boolean, y: Boolean): (Boolean, Boolean)

    

    Definition Classes

    Order

55. def succ(b: Boolean): Boolean

    

    Definition Classes

    booleanInstance → Enum

56. 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

57. 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

58. 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

59. 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

60. 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

61. def succn(n: Int, b: Boolean): Boolean

    

    Definition Classes

    booleanInstance → Enum

62. 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

63. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

64. def toScalaOrdering: scala.math.Ordering[Boolean]

    
    Definition Classes

    Order

    Note

    Order.fromScalaOrdering(toScalaOrdering).order(x, y)

    this.order(x, y)

65. def toString(): String

    

    Definition Classes

    AnyRef → Any

66. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

67. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

68. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )