class
ZippedInput[A, B] extends Input[(A, B)]
Type Members
-
type
<~ = (A, B)
-
type
read = (A, B)
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
macro
def
?: (A, B)
-
macro
def
aforeach(f: ((A, B)) ⇒ Unit): Future[Unit]
-
-
def
aread: Future[(A, B)]
-
final
def
asInstanceOf[T0]: T0
-
def
async: AnyRef { ... /* 3 definitions in type refinement */ }
-
def
atake(n: Int): Future[IndexedSeq[(A, B)]]
-
def
cbread[C](f: (ContRead[(A, B), C]) ⇒ Option[(() ⇒ (A, B)) ⇒ Future[Continuated[C]]], flwt: FlowTermination[C]): Unit
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
filter(p: ((A, B)) ⇒ Boolean): Input[(A, B)]
-
def
finalize(): Unit
-
macro
def
foreach(f: ((A, B)) ⇒ Unit): Unit
-
def
foreachAsync(f: ((A, B)) ⇒ Future[Unit])(implicit ec: ExecutionContext): Future[Unit]
-
def
foreachSync(f: ((A, B)) ⇒ Unit): Future[Unit]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
map[B](g: ((A, B)) ⇒ B): Input[B]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
val
pairs: ConcurrentLinkedQueue[(A, B)]
-
macro
def
read: (A, B)
-
val
readers: ConcurrentLinkedQueue[ContRead[(A, B), _]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
withFilter(p: ((A, B)) ⇒ Boolean): Input[(A, B)]
-
def
zip[B](x: Input[B]): Input[((A, B), B)]
-
def
zip[B](x: Iterable[B]): Input[((A, B), B)]
Inherited from Input[(A, B)]
Inherited from AnyRef
Inherited from Any