- Add new iterator method `.tree_fold1()` which is like `.fold1()` except items are combined in a tree structure (see its docs). By scottmcm - Add more `Debug` impls by phimuemue: KMerge, KMergeBy, MergeJoinBy, ConsTuples, Intersperse, ProcessResults, RcIter, Tee, TupleWindows, Tee, ZipLongest, ZipEq, Zip.
0.7.7
- Add new iterator method `.into_group_map() -> HashMap<K, Vec<V>>` which turns an iterator of `(K, V)` elements into such a hash table, where values are grouped by key. By tobz1000 - Add new free function `flatten` for the `.flatten()` adaptor. **NOTE:** recent Rust nightlies have `Iterator::flatten` and thus a clash with our flatten adaptor. One workaround is to use the itertools `flatten` free function.
0.7.6
- Add new adaptor `.multi_cartesian_product()` which is an n-ary product iterator by tobz1000 - Add new method `.sorted_by_key()` by Xion - Provide simpler and faster `.count()` for `.unique()` and `.unique_by()`
0.7.5
- `.multipeek()` now implements `PeekingNext`, by nicopap.
0.7.4
- Add new adaptor `.update()` by lucasem; this adaptor is used to modify an element before passing it on in an iterator chain.
0.7.3
- Add new method `.collect_tuple()` by matklad; it makes a tuple out of the iterator's elements if the number of them matches **exactly**. - Implement `fold` and `collect` for `.map_results()` which means it reuses the code of the standard `.map()` for these methods.