final
class
CQueue[F[+_], -A, +B] extends AnyRef
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
&&[A0 <: A, C](that: CQueue[F, A0, C]): CQueue[F, A0, (B, C)]
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
awaitShutdown(implicit R: Runtime[Any], F: LiftIO[F]): F[Unit]
-
def
both[A0 <: A, C](that: CQueue[F, A0, C]): CQueue[F, A0, (B, C)]
-
def
bothWith[A0 <: A, C, D](that: CQueue[F, A0, C])(f: (B, C) ⇒ D): CQueue[F, A0, D]
-
def
bothWithM[A0 <: A, C, D](that: CQueue[F, A0, C])(f: (B, C) ⇒ F[D])(implicit R: Runtime[Any], E: Effect[F]): CQueue[F, A0, D]
-
def
capacity: Int
-
def
clone(): AnyRef
-
def
contramap[C](f: (C) ⇒ A): CQueue[F, C, B]
-
def
contramapM[C](f: (C) ⇒ F[A])(implicit R: Runtime[Any], E: Effect[F]): CQueue[F, C, B]
-
-
-
def
filterInput[A0 <: A](f: (A0) ⇒ Boolean): CQueue[F, A0, B]
-
def
filterInputM[A0 <: A](f: (A0) ⇒ F[Boolean])(implicit R: Runtime[Any], E: Effect[F]): CQueue[F, A0, B]
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
-
def
map[C](f: (B) ⇒ C): CQueue[F, A, C]
-
def
mapM[C](f: (B) ⇒ F[C])(implicit R: Runtime[Any], E: Effect[F]): CQueue[F, A, C]
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
def
offerAll(as: Iterable[A])(implicit R: Runtime[Any], F: LiftIO[F]): F[Boolean]
-
-
def
shutdown(implicit R: Runtime[Any], F: LiftIO[F]): F[Unit]
-
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
take(implicit R: Runtime[Any], F: LiftIO[F]): F[B]
-
def
takeAll(implicit R: Runtime[Any], F: LiftIO[F]): F[List[B]]
-
def
takeUpTo(max: Int)(implicit R: Runtime[Any], F: LiftIO[F]): F[List[B]]
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
zio.ZQueue