itertools

itertools extends Rust’s standard Iterator trait with dozens of additional adaptors, free functions, and macros that the standard library deliberately leaves out — grouping, chunking, Cartesian products, deduplication, multi-way merging, permutations, and more. It’s implemented almost entirely as an extension trait (Itertools) that’s automatically available on any existing iterator once imported, so it composes with std’s own adaptors rather than replacing them.

As one of the most-downloaded crates in the Rust ecosystem (over a billion downloads), it functions as an unofficial-but-standard extension to std::iter, filling gaps that show up constantly in real code — the kind of iterator operations found in Python’s itertools module or functional-language standard libraries but historically absent from Rust’s core.

What You Get

• The Itertools extension trait adding 100+ methods to any existing Iterator implementation
• Grouping and chunking adaptors (.group_by(), .chunks(), .tuples()) for structuring sequential data
• Combinatorial adaptors (.permutations(), .combinations(), .cartesian_product(), .powerset())
• Deduplication and set-like operations (.unique(), .unique_by(), .duplicates())
• Macros like izip! and chain! for ergonomic multi-iterator zipping and chaining

Common Use Cases

• Deduplicating or sorting a stream of values inline within an iterator chain instead of collecting into an intermediate Vec first
• Generating combinations, permutations, or Cartesian products for combinatorial or test-data-generation code
• Grouping consecutive elements by a key (.group_by()) when processing sorted or structured sequential data
• Zipping more than two iterators together ergonomically via the izip! macro instead of nested .zip() calls

Under The Hood

Architecture Roughly 15,600 lines are organized as one implementation file per adaptor or family of related methods (combinations.rs, groupbylazy.rs, intersperse.rs, duplicates_impl.rs, etc.) under src/, with src/adaptors/ holding the lower-level lazy-iterator plumbing each adaptor is built from, and lib.rs assembling everything into the single public Itertools trait — a structure that mirrors the standard library’s own core::iter module organization for familiarity. Tech Stack The crate has effectively zero required dependencies beyond std (with either as an optional lightweight dependency for a couple of adaptors), which matters given how deep in the dependency graph it sits — over a billion downloads means minimizing its own footprint has outsized ecosystem impact. Code Quality tests/ includes a dedicated laziness.rs suite verifying that adaptors don’t eagerly evaluate more of the underlying iterator than necessary (a correctness property specific to iterator libraries), plus specializations.rs testing that performance-optimization overrides (like size_hint) stay behaviorally consistent with the default implementations. API Design Nearly every addition is a method on the Itertools trait rather than a free function, so it chains directly into existing .iter().map().filter() pipelines with one import — deliberately matching std::iter’s own method-chaining idiom rather than introducing a different mental model for the 100+ additional operations it provides.