commit | 2e061509ba80a014ed52ec219218cad0eb654a6c | [log] [tgz] |
---|---|---|
author | Lucas Pluvinage <lucas.pluvinage@gmail.com> | Fri Oct 18 19:45:08 2024 +0200 |
committer | GitHub <noreply@github.com> | Fri Oct 18 17:45:08 2024 +0000 |
tree | bce56184261a95a1d6a5476ba1d85b0ce43124bf | |
parent | 5d8d989ed2b6b901ef3166a92f9ffaf767e93005 [diff] |
gen_rust_project: optimize aquery with many targets (#2941) Hi, if I'm not mistaken, in Bazel `deps(a)+deps(b)` is equivalent to `deps(a+b)`. The latter is more efficient because it doesn't have to deduplicate common dependencies between a and b. This performance issue has been triggered in our configuration, as we track roughly 700 targets and 1600 transitive dependencies in our monorepo. Running `aquery` with the original implementation takes 15 seconds on my machine while the implementation proposed in this PR takes 1.5 seconds.
This repository provides rules for building Rust projects with Bazel.
General discussions and announcements take place in the GitHub Discussions, but there are additional places where community members gather to discuss rules_rust
.
Please refer to the full documentation.