class
DynamicBufferedBatcher[T] extends Iterator[List[T]]
Instance Constructors
-
new
DynamicBufferedBatcher(it: Iterator[T], maxBufferSize: Int = Integer.MAX_VALUE)
Type Members
-
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
-
def
/:[B](z: B)(op: (B, List[T]) ⇒ B): B
-
def
:\[B](z: B)(op: (List[T], B) ⇒ B): B
-
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, List[T]) ⇒ B, combop: (B, B) ⇒ B): B
-
final
def
asInstanceOf[T0]: T0
-
def
buffered: BufferedIterator[List[T]]
-
def
clone(): AnyRef
-
def
close(): Unit
-
-
-
def
contains(elem: Any): Boolean
-
def
copyToArray[B >: List[T]](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: List[T]](xs: Array[B]): Unit
-
def
copyToArray[B >: List[T]](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: List[T]](dest: Buffer[B]): Unit
-
-
def
count(p: (List[T]) ⇒ Boolean): Int
-
def
drop(n: Int): Iterator[List[T]]
-
def
dropWhile(p: (List[T]) ⇒ Boolean): Iterator[List[T]]
-
def
duplicate: (Iterator[List[T]], Iterator[List[T]])
-
-
-
def
exists(p: (List[T]) ⇒ Boolean): Boolean
-
def
filter(p: (List[T]) ⇒ Boolean): Iterator[List[T]]
-
def
filterNot(p: (List[T]) ⇒ Boolean): Iterator[List[T]]
-
def
finalize(): Unit
-
def
find(p: (List[T]) ⇒ Boolean): Option[List[T]]
-
val
finishedLatch: CountDownLatch
-
-
def
fold[A1 >: List[T]](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, List[T]) ⇒ B): B
-
def
foldRight[B](z: B)(op: (List[T], B) ⇒ B): B
-
def
forall(p: (List[T]) ⇒ Boolean): Boolean
-
def
foreach[U](f: (List[T]) ⇒ U): Unit
-
final
def
getClass(): Class[_]
-
def
grouped[B >: List[T]](size: Int): GroupedIterator[B]
-
def
hasDefiniteSize: Boolean
-
-
var
hasStarted: Boolean
-
def
hashCode(): Int
-
def
indexOf[B >: List[T]](elem: B): Int
-
def
indexWhere(p: (List[T]) ⇒ Boolean): Int
-
-
final
def
isInstanceOf[T0]: Boolean
-
def
isTraversableAgain: Boolean
-
val
it: Iterator[T]
-
def
length: Int
-
def
map[B](f: (List[T]) ⇒ B): Iterator[B]
-
def
max[B >: List[T]](implicit cmp: Ordering[B]): List[T]
-
def
maxBy[B](f: (List[T]) ⇒ B)(implicit cmp: Ordering[B]): List[T]
-
def
min[B >: List[T]](implicit cmp: Ordering[B]): List[T]
-
def
minBy[B](f: (List[T]) ⇒ B)(implicit cmp: Ordering[B]): List[T]
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
-
def
next(): List[T]
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
padTo[A1 >: List[T]](len: Int, elem: A1): Iterator[A1]
-
def
partition(p: (List[T]) ⇒ Boolean): (Iterator[List[T]], Iterator[List[T]])
-
def
patch[B >: List[T]](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]
-
def
product[B >: List[T]](implicit num: Numeric[B]): B
-
val
queue: BlockingQueue[T]
-
def
reduce[A1 >: List[T]](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: List[T]](op: (B, List[T]) ⇒ B): B
-
def
reduceLeftOption[B >: List[T]](op: (B, List[T]) ⇒ B): Option[B]
-
def
reduceOption[A1 >: List[T]](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: List[T]](op: (List[T], B) ⇒ B): B
-
def
reduceRightOption[B >: List[T]](op: (List[T], B) ⇒ B): Option[B]
-
def
reversed: List[List[T]]
-
-
def
scanLeft[B](z: B)(op: (B, List[T]) ⇒ B): Iterator[B]
-
def
scanRight[B](z: B)(op: (List[T], B) ⇒ B): Iterator[B]
-
def
seq: Iterator[List[T]]
-
def
size: Int
-
def
slice(from: Int, until: Int): Iterator[List[T]]
-
def
sliding[B >: List[T]](size: Int, step: Int): GroupedIterator[B]
-
def
span(p: (List[T]) ⇒ Boolean): (Iterator[List[T]], Iterator[List[T]])
-
def
start(): Unit
-
def
sum[B >: List[T]](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
take(n: Int): Iterator[List[T]]
-
def
takeWhile(p: (List[T]) ⇒ Boolean): Iterator[List[T]]
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, List[T], Col[List[T]]]): Col[List[T]]
-
def
toArray[B >: List[T]](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[B >: List[T]]: Buffer[B]
-
def
toIndexedSeq: IndexedSeq[List[T]]
-
def
toIterable: Iterable[List[T]]
-
def
toIterator: Iterator[List[T]]
-
def
toList: List[List[T]]
-
def
toMap[T, U](implicit ev: <:<[List[T], (T, U)]): Map[T, U]
-
def
toSeq: Seq[List[T]]
-
def
toSet[B >: List[T]]: Set[B]
-
def
toStream: Stream[List[T]]
-
def
toString(): String
-
def
toTraversable: Traversable[List[T]]
-
def
toVector: Vector[List[T]]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
withFilter(p: (List[T]) ⇒ Boolean): Iterator[List[T]]
-
def
zip[B](that: Iterator[B]): Iterator[(List[T], B)]
-
def
zipAll[B, A1 >: List[T], B1 >: B](that: Iterator[B], thisElem: A1, thatElem: B1): Iterator[(A1, B1)]
-
def
zipWithIndex: Iterator[(List[T], Int)]