KafkaStream

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def ++[B >: MessageAndMetadata[K, V], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[MessageAndMetadata[K, V]], B, That]): That

def ++:[B >: MessageAndMetadata[K, V], That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[MessageAndMetadata[K, V]], B, That]): That

def ++:[B >: MessageAndMetadata[K, V], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[MessageAndMetadata[K, V]], B, That]): That

def /:[B](z: B)(op: (B, MessageAndMetadata[K, V]) ⇒ B): B

def :\[B](z: B)(op: (MessageAndMetadata[K, V], B) ⇒ B): B

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def aggregate[B](z: B)(seqop: (B, MessageAndMetadata[K, V]) ⇒ B, combop: (B, B) ⇒ B): B

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clear(): Unit

This method clears the queue being iterated during the consumer rebalancing.

val clientId: String

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[MessageAndMetadata[K, V], B])(implicit bf: CanBuildFrom[Iterable[MessageAndMetadata[K, V]], B, That]): That

def collectFirst[B](pf: PartialFunction[MessageAndMetadata[K, V], B]): Option[B]

def companion: GenericCompanion[Iterable]

def copyToArray[B >: MessageAndMetadata[K, V]](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: MessageAndMetadata[K, V]](xs: Array[B]): Unit

def copyToArray[B >: MessageAndMetadata[K, V]](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: MessageAndMetadata[K, V]](dest: Buffer[B]): Unit

def count(p: (MessageAndMetadata[K, V]) ⇒ Boolean): Int

def drop(n: Int): Iterable[MessageAndMetadata[K, V]]

def dropRight(n: Int): Iterable[MessageAndMetadata[K, V]]

def dropWhile(p: (MessageAndMetadata[K, V]) ⇒ Boolean): Iterable[MessageAndMetadata[K, V]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(p: (MessageAndMetadata[K, V]) ⇒ Boolean): Boolean

def filter(p: (MessageAndMetadata[K, V]) ⇒ Boolean): Iterable[MessageAndMetadata[K, V]]

def filterNot(p: (MessageAndMetadata[K, V]) ⇒ Boolean): Iterable[MessageAndMetadata[K, V]]

def finalize(): Unit

def find(p: (MessageAndMetadata[K, V]) ⇒ Boolean): Option[MessageAndMetadata[K, V]]

def flatMap[B, That](f: (MessageAndMetadata[K, V]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[MessageAndMetadata[K, V]], B, That]): That

def flatten[B](implicit asTraversable: (MessageAndMetadata[K, V]) ⇒ GenTraversableOnce[B]): Iterable[B]

def fold[A1 >: MessageAndMetadata[K, V]](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, MessageAndMetadata[K, V]) ⇒ B): B

def foldRight[B](z: B)(op: (MessageAndMetadata[K, V], B) ⇒ B): B

def forall(p: (MessageAndMetadata[K, V]) ⇒ Boolean): Boolean

def foreach[U](f: (MessageAndMetadata[K, V]) ⇒ U): Unit

def genericBuilder[B]: Builder[B, Iterable[B]]

final def getClass(): Class[_]

def groupBy[K](f: (MessageAndMetadata[K, V]) ⇒ K): Map[K, Iterable[MessageAndMetadata[K, V]]]

def grouped(size: Int): Iterator[Iterable[MessageAndMetadata[K, V]]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: MessageAndMetadata[K, V]

def headOption: Option[MessageAndMetadata[K, V]]

def init: Iterable[MessageAndMetadata[K, V]]

def inits: Iterator[Iterable[MessageAndMetadata[K, V]]]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator(): ConsumerIterator[K, V]

Create an iterator over messages in the stream.

def last: MessageAndMetadata[K, V]

def lastOption: Option[MessageAndMetadata[K, V]]

def map[B, That](f: (MessageAndMetadata[K, V]) ⇒ B)(implicit bf: CanBuildFrom[Iterable[MessageAndMetadata[K, V]], B, That]): That

def max[B >: MessageAndMetadata[K, V]](implicit cmp: Ordering[B]): MessageAndMetadata[K, V]

def maxBy[B](f: (MessageAndMetadata[K, V]) ⇒ B)(implicit cmp: Ordering[B]): MessageAndMetadata[K, V]

def min[B >: MessageAndMetadata[K, V]](implicit cmp: Ordering[B]): MessageAndMetadata[K, V]

def minBy[B](f: (MessageAndMetadata[K, V]) ⇒ B)(implicit cmp: Ordering[B]): MessageAndMetadata[K, V]

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[MessageAndMetadata[K, V], Iterable[MessageAndMetadata[K, V]]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[MessageAndMetadata[K, V]]

def parCombiner: Combiner[MessageAndMetadata[K, V], ParIterable[MessageAndMetadata[K, V]]]

def partition(p: (MessageAndMetadata[K, V]) ⇒ Boolean): (Iterable[MessageAndMetadata[K, V]], Iterable[MessageAndMetadata[K, V]])

def product[B >: MessageAndMetadata[K, V]](implicit num: Numeric[B]): B

def reduce[A1 >: MessageAndMetadata[K, V]](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: MessageAndMetadata[K, V]](op: (B, MessageAndMetadata[K, V]) ⇒ B): B

def reduceLeftOption[B >: MessageAndMetadata[K, V]](op: (B, MessageAndMetadata[K, V]) ⇒ B): Option[B]

def reduceOption[A1 >: MessageAndMetadata[K, V]](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: MessageAndMetadata[K, V]](op: (MessageAndMetadata[K, V], B) ⇒ B): B

def reduceRightOption[B >: MessageAndMetadata[K, V]](op: (MessageAndMetadata[K, V], B) ⇒ B): Option[B]

def repr: Iterable[MessageAndMetadata[K, V]]

def reversed: List[MessageAndMetadata[K, V]]

def sameElements[B >: MessageAndMetadata[K, V]](that: GenIterable[B]): Boolean

def scan[B >: MessageAndMetadata[K, V], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[MessageAndMetadata[K, V]], B, That]): That

def scanLeft[B, That](z: B)(op: (B, MessageAndMetadata[K, V]) ⇒ B)(implicit bf: CanBuildFrom[Iterable[MessageAndMetadata[K, V]], B, That]): That

def scanRight[B, That](z: B)(op: (MessageAndMetadata[K, V], B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[MessageAndMetadata[K, V]], B, That]): That

def seq: Iterable[MessageAndMetadata[K, V]]

def size: Int

def slice(from: Int, until: Int): Iterable[MessageAndMetadata[K, V]]

def sliding(size: Int, step: Int): Iterator[Iterable[MessageAndMetadata[K, V]]]

def sliding(size: Int): Iterator[Iterable[MessageAndMetadata[K, V]]]

def span(p: (MessageAndMetadata[K, V]) ⇒ Boolean): (Iterable[MessageAndMetadata[K, V]], Iterable[MessageAndMetadata[K, V]])

def splitAt(n: Int): (Iterable[MessageAndMetadata[K, V]], Iterable[MessageAndMetadata[K, V]])

def stringPrefix: String

def sum[B >: MessageAndMetadata[K, V]](implicit num: Numeric[B]): B

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

def tail: Iterable[MessageAndMetadata[K, V]]

def tails: Iterator[Iterable[MessageAndMetadata[K, V]]]

def take(n: Int): Iterable[MessageAndMetadata[K, V]]

def takeRight(n: Int): Iterable[MessageAndMetadata[K, V]]

def takeWhile(p: (MessageAndMetadata[K, V]) ⇒ Boolean): Iterable[MessageAndMetadata[K, V]]

def thisCollection: Iterable[MessageAndMetadata[K, V]]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, MessageAndMetadata[K, V], Col[MessageAndMetadata[K, V]]]): Col[MessageAndMetadata[K, V]]

def toArray[B >: MessageAndMetadata[K, V]](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: MessageAndMetadata[K, V]]: Buffer[B]

def toCollection(repr: Iterable[MessageAndMetadata[K, V]]): Iterable[MessageAndMetadata[K, V]]

def toIndexedSeq: IndexedSeq[MessageAndMetadata[K, V]]

def toIterable: Iterable[MessageAndMetadata[K, V]]

def toIterator: Iterator[MessageAndMetadata[K, V]]

def toList: List[MessageAndMetadata[K, V]]

def toMap[T, U](implicit ev: <:<[MessageAndMetadata[K, V], (T, U)]): Map[T, U]

def toSeq: Seq[MessageAndMetadata[K, V]]

def toSet[B >: MessageAndMetadata[K, V]]: Set[B]

def toStream: Stream[MessageAndMetadata[K, V]]

def toString(): String

def toTraversable: Traversable[MessageAndMetadata[K, V]]

def toVector: Vector[MessageAndMetadata[K, V]]

def transpose[B](implicit asTraversable: (MessageAndMetadata[K, V]) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

def unzip[A1, A2](implicit asPair: (MessageAndMetadata[K, V]) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (MessageAndMetadata[K, V]) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def view(from: Int, until: Int): IterableView[MessageAndMetadata[K, V], Iterable[MessageAndMetadata[K, V]]]

def view: IterableView[MessageAndMetadata[K, V], Iterable[MessageAndMetadata[K, V]]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (MessageAndMetadata[K, V]) ⇒ Boolean): FilterMonadic[MessageAndMetadata[K, V], Iterable[MessageAndMetadata[K, V]]]

def zip[A1 >: MessageAndMetadata[K, V], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[MessageAndMetadata[K, V]], (A1, B), That]): That

def zipAll[B, A1 >: MessageAndMetadata[K, V], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[MessageAndMetadata[K, V]], (A1, B), That]): That

def zipWithIndex[A1 >: MessageAndMetadata[K, V], That](implicit bf: CanBuildFrom[Iterable[MessageAndMetadata[K, V]], (A1, Int), That]): That

def /:\[A1 >: MessageAndMetadata[K, V]](z: A1)(op: (A1, A1) ⇒ A1): A1