org.hammerlab.guacamole.windowing
Split an iterator of key value pairs into separate iterators, one for each key, without buffering more data into memory than necessary.
Split an iterator of key value pairs into separate iterators, one for each key, without buffering more data into memory than necessary. The keys must be integers between 0 and the provided upper bound.
Given an iterator of (k, v) where 0 <= k < num and v is of arbitrary type, returns a sequence of length num. The i'th element in the sequence is an iterator over the values v where k = i.
number of keys. Each key k must be 0 <= k < num.
source iterator of (key, value) pairs. It will be consumed as the result iterators are read.
a buffered iterator for each key in 0 .. num.