ByteBufferMessageSet

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

def /:[B](z: B)(op: (B, MessageAndOffset) ⇒ B): B

def :\[B](z: B)(op: (MessageAndOffset, 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, MessageAndOffset) ⇒ B, combop: (B, B) ⇒ B): B

final def asInstanceOf[T0]: T0

val buffer: ByteBuffer

def canEqual(that: Any): Boolean

def clone(): AnyRef

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

def collectFirst[B](pf: PartialFunction[MessageAndOffset, B]): Option[B]

def companion: GenericCompanion[Iterable]

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

def copyToArray[B >: MessageAndOffset](xs: Array[B]): Unit

def copyToArray[B >: MessageAndOffset](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: MessageAndOffset](dest: Buffer[B]): Unit

def count(p: (MessageAndOffset) ⇒ Boolean): Int

def debug(msg: ⇒ String, e: ⇒ Throwable): Unit

def debug(e: ⇒ Throwable): Any

def debug(msg: ⇒ String): Unit

def drop(n: Int): Iterable[MessageAndOffset]

def dropRight(n: Int): Iterable[MessageAndOffset]

def dropWhile(p: (MessageAndOffset) ⇒ Boolean): Iterable[MessageAndOffset]

final def eq(arg0: AnyRef): Boolean

def equals(other: Any): Boolean

Two message sets are equal if their respective byte buffers are equal

def error(msg: ⇒ String, e: ⇒ Throwable): Unit

def error(e: ⇒ Throwable): Any

def error(msg: ⇒ String): Unit

def exists(p: (MessageAndOffset) ⇒ Boolean): Boolean

def fatal(msg: ⇒ String, e: ⇒ Throwable): Unit

def fatal(e: ⇒ Throwable): Any

def fatal(msg: ⇒ String): Unit

def filter(p: (MessageAndOffset) ⇒ Boolean): Iterable[MessageAndOffset]

def filterNot(p: (MessageAndOffset) ⇒ Boolean): Iterable[MessageAndOffset]

def finalize(): Unit

def find(p: (MessageAndOffset) ⇒ Boolean): Option[MessageAndOffset]

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

def flatten[B](implicit asTraversable: (MessageAndOffset) ⇒ GenTraversableOnce[B]): Iterable[B]

def fold[A1 >: MessageAndOffset](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, MessageAndOffset) ⇒ B): B

def foldRight[B](z: B)(op: (MessageAndOffset, B) ⇒ B): B

def forall(p: (MessageAndOffset) ⇒ Boolean): Boolean

def foreach[U](f: (MessageAndOffset) ⇒ U): Unit

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

def getBuffer: ByteBuffer

final def getClass(): Class[_]

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

def grouped(size: Int): Iterator[Iterable[MessageAndOffset]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: MessageAndOffset

def headOption: Option[MessageAndOffset]

def info(msg: ⇒ String, e: ⇒ Throwable): Unit

def info(e: ⇒ Throwable): Any

def info(msg: ⇒ String): Unit

def init: Iterable[MessageAndOffset]

def inits: Iterator[Iterable[MessageAndOffset]]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[MessageAndOffset]

default iterator that iterates over decompressed messages

def last: MessageAndOffset

def lastOption: Option[MessageAndOffset]

var logIdent: String

lazy val logger: Logger

val loggerName: String

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

def max[B >: MessageAndOffset](implicit cmp: Ordering[B]): MessageAndOffset

def maxBy[B](f: (MessageAndOffset) ⇒ B)(implicit cmp: Ordering[B]): MessageAndOffset

def min[B >: MessageAndOffset](implicit cmp: Ordering[B]): MessageAndOffset

def minBy[B](f: (MessageAndOffset) ⇒ B)(implicit cmp: Ordering[B]): MessageAndOffset

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[MessageAndOffset, Iterable[MessageAndOffset]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[MessageAndOffset]

def parCombiner: Combiner[MessageAndOffset, ParIterable[MessageAndOffset]]

def partition(p: (MessageAndOffset) ⇒ Boolean): (Iterable[MessageAndOffset], Iterable[MessageAndOffset])

def product[B >: MessageAndOffset](implicit num: Numeric[B]): B

def reduce[A1 >: MessageAndOffset](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: MessageAndOffset](op: (B, MessageAndOffset) ⇒ B): B

def reduceLeftOption[B >: MessageAndOffset](op: (B, MessageAndOffset) ⇒ B): Option[B]

def reduceOption[A1 >: MessageAndOffset](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: MessageAndOffset](op: (MessageAndOffset, B) ⇒ B): B

def reduceRightOption[B >: MessageAndOffset](op: (MessageAndOffset, B) ⇒ B): Option[B]

def repr: Iterable[MessageAndOffset]

def reversed: List[MessageAndOffset]

def sameElements[B >: MessageAndOffset](that: GenIterable[B]): Boolean

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

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

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

def seq: Iterable[MessageAndOffset]

def shallowIterator: Iterator[MessageAndOffset]

iterator over compressed messages without decompressing

def size: Int

def sizeInBytes: Int

The total number of bytes in this message set, including any partial trailing messages

def slice(from: Int, until: Int): Iterable[MessageAndOffset]

def sliding(size: Int, step: Int): Iterator[Iterable[MessageAndOffset]]

def sliding(size: Int): Iterator[Iterable[MessageAndOffset]]

def span(p: (MessageAndOffset) ⇒ Boolean): (Iterable[MessageAndOffset], Iterable[MessageAndOffset])

def splitAt(n: Int): (Iterable[MessageAndOffset], Iterable[MessageAndOffset])

def stringPrefix: String

def sum[B >: MessageAndOffset](implicit num: Numeric[B]): B

def swallow(action: ⇒ Unit): Unit

def swallowDebug(action: ⇒ Unit): Unit

def swallowError(action: ⇒ Unit): Unit

def swallowInfo(action: ⇒ Unit): Unit

def swallowTrace(action: ⇒ Unit): Unit

def swallowWarn(action: ⇒ Unit): Unit

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

def tail: Iterable[MessageAndOffset]

def tails: Iterator[Iterable[MessageAndOffset]]

def take(n: Int): Iterable[MessageAndOffset]

def takeRight(n: Int): Iterable[MessageAndOffset]

def takeWhile(p: (MessageAndOffset) ⇒ Boolean): Iterable[MessageAndOffset]

def thisCollection: Iterable[MessageAndOffset]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, MessageAndOffset, Col[MessageAndOffset]]): Col[MessageAndOffset]

def toArray[B >: MessageAndOffset](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: MessageAndOffset]: Buffer[B]

def toCollection(repr: Iterable[MessageAndOffset]): Iterable[MessageAndOffset]

def toIndexedSeq: IndexedSeq[MessageAndOffset]

def toIterable: Iterable[MessageAndOffset]

def toIterator: Iterator[MessageAndOffset]

def toList: List[MessageAndOffset]

def toMap[T, U](implicit ev: <:<[MessageAndOffset, (T, U)]): Map[T, U]

def toSeq: Seq[MessageAndOffset]

def toSet[B >: MessageAndOffset]: Set[B]

def toStream: Stream[MessageAndOffset]

def toString(): String

Print this message set's contents.

def toTraversable: Traversable[MessageAndOffset]

def toVector: Vector[MessageAndOffset]

def trace(msg: ⇒ String, e: ⇒ Throwable): Unit

def trace(e: ⇒ Throwable): Any

def trace(msg: ⇒ String): Unit

def transpose[B](implicit asTraversable: (MessageAndOffset) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

def unzip[A1, A2](implicit asPair: (MessageAndOffset) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (MessageAndOffset) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def validBytes: Int

The total number of bytes in this message set not including any partial, trailing messages

def view(from: Int, until: Int): IterableView[MessageAndOffset, Iterable[MessageAndOffset]]

def view: IterableView[MessageAndOffset, Iterable[MessageAndOffset]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def warn(msg: ⇒ String, e: ⇒ Throwable): Unit

def warn(e: ⇒ Throwable): Any

def warn(msg: ⇒ String): Unit

def withFilter(p: (MessageAndOffset) ⇒ Boolean): FilterMonadic[MessageAndOffset, Iterable[MessageAndOffset]]

def writeTo(channel: GatheringByteChannel, offset: Long, size: Int): Int

Write the messages in this set to the given channel

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

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

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

def /:\[A1 >: MessageAndOffset](z: A1)(op: (A1, A1) ⇒ A1): A1