cargo tally
is a Cargo subcommand for drawing graphs of the number of crates
that depend directly or indirectly on a crate over time.
Usage: cargo tally [options] queries...
Options:
--db <PATH> Path to crates.io's database dump [default: ./db-dump.tar.gz]
--jobs, -j <N> Number of threads to run differential dataflow
--relative Display as a fraction of total crates, not absolute number
--transitive Count transitive dependencies, not just direct dependencies
$ wget https://static.crates.io/db-dump.tar.gz
$ cargo install cargo-tally
-
Data is drawn from crates.io database dumps, which are published nightly by automation running on crates.io. You can download a new dump whenever you feel like having fresh data.
-
The tally command accepts a list of which crates to tally. This can either be the name of a crate like
serde
or a name with arbitrary semver version specification likeserde:1.0
. If a version is not specified, dependencies on all versions of the crate are tallied together. -
The generated graphs use D3; the cargo tally command should pop open a browser showing your graph. It uses the same mechanism that
cargo doc --open
uses so hopefully it works well on various systems.
-
Number of crates that depend directly on each major version of the regex crate.
$ cargo tally regex:0.1 regex:0.2 regex:1.0
-
Fraction of crates.io that depends directly on each major version of the regex crate. This is the same graph as the previous, but scaled to the exponentially growing total number of crates on crates.io.
$ cargo tally regex:0.1 regex:0.2 regex:1.0 --relative
-
Fraction of crates.io that depends directly on various error handling libraries. Note that crates are not double-counted; a crate that depends on both
anyhow
andthiserror
counts as only one for the purpose of theanyhow+thiserror
curve.$ cargo tally --relative failure anyhow thiserror anyhow+thiserror
-
Fraction of crates.io that depends transitively on libc.
$ cargo tally --relative --transitive libc
The implementation is powered by differential-dataflow.
Licensed under either of Apache License, Version 2.0 or MIT license at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in this project by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.