final
class
Schedule[F[+_], -A, +B] extends AnyRef
Type Members
-
type
State = Schedule.State
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
&&[A1 <: A, C](that: Schedule[F, A1, C]): Schedule[F, A1, (B, C)]
-
final
def
***[C, D](that: Schedule[F, C, D]): Schedule[F, (A, C), (B, D)]
-
final
def
*>[A1 <: A, C](that: Schedule[F, A1, C]): Schedule[F, A1, C]
-
final
def
+++[C, D](that: Schedule[F, C, D]): Schedule[F, Either[A, C], Either[B, D]]
-
final
def
<*[A1 <: A, C](that: Schedule[F, A1, C]): Schedule[F, A1, B]
-
final
def
<*>[A1 <: A, C](that: Schedule[F, A1, C]): Schedule[F, A1, (B, C)]
-
final
def
<<<[C](that: Schedule[F, C, A]): Schedule[F, C, B]
-
final
def
==(arg0: Any): Boolean
-
final
def
>>>[C](that: Schedule[F, B, C]): Schedule[F, A, C]
-
final
def
andThen[A1 <: A, B1 >: B](that: Schedule[F, A1, B1]): Schedule[F, A1, B1]
-
final
def
andThenEither[A1 <: A, C](that: Schedule[F, A1, C]): Schedule[F, A1, Either[B, C]]
-
final
def
asInstanceOf[T0]: T0
-
final
def
both[A1 <: A, C](that: Schedule[F, A1, C]): Schedule[F, A1, (B, C)]
-
final
def
bothWith[A1 <: A, C, D](that: Schedule[F, A1, C])(f: (B, C) ⇒ D): Schedule[F, A1, D]
-
final
def
check[A1 <: A](test: (A1, B) ⇒ F[Boolean])(implicit R: Runtime[Any], F: Effect[F]): Schedule[F, A1, B]
-
def
clone(): AnyRef
-
final
def
collectAll: Schedule[F, A, List[B]]
-
final
def
compose[C](that: Schedule[F, C, A]): Schedule[F, C, B]
-
final
def
const[C](c: ⇒ C): Schedule[F, A, C]
-
final
def
contramap[A1](f: (A1) ⇒ A): Schedule[F, A1, B]
-
-
final
def
dimap[A1, C](f: (A1) ⇒ A, g: (B) ⇒ C): Schedule[F, A1, C]
-
final
def
either[A1 <: A, C](that: Schedule[F, A1, C]): Schedule[F, A1, (B, C)]
-
final
def
eitherWith[A1 <: A, C, D](that: Schedule[F, A1, C])(f: (B, C) ⇒ D): Schedule[F, A1, D]
-
final
def
ensuring(finalizer: F[_])(implicit R: Runtime[Any], F: Effect[F]): Schedule[F, A, B]
-
-
-
val
extract: (A, State) ⇒ B
-
def
finalize(): Unit
-
final
def
first[C]: Schedule[F, (A, C), (B, C)]
-
final
def
fold[Z](z: Z)(f: (Z, B) ⇒ Z): Schedule[F, A, Z]
-
final
def
forever: Schedule[F, A, B]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
-
final
def
initialized[A1 <: A](f: (F[State]) ⇒ F[State])(implicit R: Runtime[zio.ZEnv], F: Effect[F]): Schedule[F, A1, B]
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
jittered(min: Double, max: Double): Schedule[F, A, B]
-
final
def
jittered: Schedule[F, A, B]
-
final
def
left[C]: Schedule[F, Either[A, C], Either[B, C]]
-
final
def
map[A1 <: A, C](f: (B) ⇒ C): Schedule[F, A1, C]
-
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
onDecision[A1 <: A](f: (A1, Option[State]) ⇒ F[Any])(implicit R: Runtime[Any], F: Effect[F]): Schedule[F, A1, B]
-
final
def
right[C]: Schedule[F, Either[C, A], Either[C, B]]
-
final
def
second[C]: Schedule[F, (C, A), (C, B)]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
final
def
tapInput[A1 <: A](f: (A1) ⇒ F[Unit])(implicit R: Runtime[zio.ZEnv], F: Effect[F]): Schedule[F, A1, B]
-
final
def
tapOutput(f: (B) ⇒ F[Unit])(implicit R: Runtime[zio.ZEnv], F: Effect[F]): Schedule[F, A, B]
-
def
toString(): String
-
-
final
def
untilInput[A1 <: A](f: (A1) ⇒ Boolean): Schedule[F, A1, B]
-
final
def
untilOutput(f: (B) ⇒ Boolean): Schedule[F, A, B]
-
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
final
def
whileInput[A1 <: A](f: (A1) ⇒ Boolean): Schedule[F, A1, B]
-
final
def
whileOutput(f: (B) ⇒ Boolean): Schedule[F, A, B]
-
final
def
zip[A1 <: A, C](that: Schedule[F, A1, C]): Schedule[F, A1, (B, C)]
-
final
def
zipLeft[A1 <: A, C](that: Schedule[F, A1, C]): Schedule[F, A1, B]
-
final
def
zipRight[A1 <: A, C](that: Schedule[F, A1, C]): Schedule[F, A1, C]
-
final
def
||[A1 <: A, C](that: Schedule[F, A1, C]): Schedule[F, A1, (B, C)]
-
final
def
|||[B1 >: B, C](that: Schedule[F, C, B1]): Schedule[F, Either[A, C], B1]
zio.ZSchedule