(Changed in version 2.8.0) collect
has changed. The previous behavior can be reproduced with toSeq
.
We need to determine which iterator is behind since we are assuming sorted order.
We need to determine which iterator is behind since we are assuming sorted order. We got smallest key from it and then pull all elements with that smallest key from all other iterators.
An iterator that preforms a mergeJoin among ordered iterators joining on a given key. The input iterators are assumed to be ordered so we can do a greedy merge join. Since our iterators are lazy we cannot check that they are ordered before starting.
Example: