rust/compiler/rustc_data_structures/src/graph, branch 1.87.0

Add `unreachable_pub` to `RUSTC_LINT_FLAGS` for `compiler/` crates.

2025-03-11T02:14:21+00:00

And fix the new errors in the handful of crates that didn't have a `#![warn(unreachable_pub)]`.

Revert "Use workspace lints for crates in `compiler/` #138084"

2025-03-10T10:12:47+00:00

Revert to buy time to consider options that avoids breaking downstream usages of cargo on distributed `rustc-src` artifacts, where such cargo invocations fail due to inability to inherit `lints` from workspace root manifest's `workspace.lints` (this is only valid for the source rust-lang/rust workspace, but not really the distributed `rustc-src` artifacts). This breakage was reported in . This reverts commit 48caf81484b50dca5a5cebb614899a3df81ca898, reversing changes made to c6662879b27f5161e95f39395e3c9513a7b97028.

Add `unreachable_pub` to the default lints for `compiler/` crates.

2025-03-07T21:41:43+00:00

And fix the new errors in the handful of crates that didn't have a `#![warn(unreachable_pub)]`.

Greatly simplify lifetime captures in edition 2024

2025-02-22T22:24:52+00:00

Fix overcapturing, unsafe extern blocks, and new unsafe ops

2025-02-22T00:01:48+00:00

Rustfmt

2025-02-08T22:12:13+00:00

Incorporate `iter_nodes` into `graph::DirectedGraph`

2025-01-26T03:08:42+00:00

This assumes that the set of valid node IDs is exactly `0..num_nodes`. In practice, we have a lot of graph-algorithm code that already assumes that nodes are densely numbered, by using `num_nodes` to allocate per-node indexed data structures.

coverage: Completely overhaul counter assignment, using node-flow graphs

2025-01-16T11:07:18+00:00

Add wrapper type `ReversedGraph` for swapping successors/predecessors

2025-01-14T12:49:10+00:00

rename `BitSet` to `DenseBitSet`

2025-01-11T11:34:01+00:00

This should make it clearer that this bitset is dense, with the advantages and disadvantages that it entails.