final
class
Function1Ops[T, R] extends AnyVal
Instance Constructors
-
new
Function1Ops(self: (T) ⇒ R)
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
arrow[A[_, _]](implicit a: Arrow[A]): A[T, R]
-
final
def
asInstanceOf[T0]: T0
-
def
byName: (⇒ T) ⇒ R
-
def
comparing(implicit o: Order[R]): (T, T) ⇒ Ordering
-
def
endo(implicit ev: ===[R, T]): Endo[T]
-
def
equaling(implicit e: Equal[R]): (T, T) ⇒ Boolean
-
def
getClass(): Class[_ <: AnyVal]
-
final
def
isInstanceOf[T0]: Boolean
-
def
kleisli[Z[_]](implicit z: Applicative[Z]): Kleisli[Z, T, R]
-
def
on[X](f: (R, R) ⇒ X, t1: T, t2: T): X
-
def
predState(implicit e: Enum[T]): State[T, R]
-
def
predStateMax[Y](k: (R) ⇒ Y)(implicit e: Enum[T]): Option[Y]
-
def
predStateMaxM[Y](k: (R) ⇒ State[T, Y])(implicit e: Enum[T]): Option[Y]
-
def
predStateZero[Y](k: (R) ⇒ Y)(implicit e: Enum[T], m: Monoid[T]): Y
-
def
predStateZeroM[Y](k: (R) ⇒ State[T, Y])(implicit e: Enum[T], m: Monoid[T]): Y
-
def
succState(implicit e: Enum[T]): State[T, R]
-
def
succStateMin[Y](k: (R) ⇒ Y)(implicit e: Enum[T]): Option[Y]
-
def
succStateMinM[Y](k: (R) ⇒ State[T, Y])(implicit e: Enum[T]): Option[Y]
-
def
succStateZero[Y](k: (R) ⇒ Y)(implicit e: Enum[T], m: Monoid[T]): Y
-
def
succStateZeroM[Y](k: (R) ⇒ State[T, Y])(implicit e: Enum[T], m: Monoid[T]): Y
-
def
toString(): String
-
-
def
unary_!(implicit m: Memo[T, R]): (T) ⇒ R