rust/compiler/rustc_data_structures/src/graph/iterate, branch perf-tmp https://github.com/rust-lang/rust http://git.dreamy.place/mirrors/rust/atom?h=perf-tmp 2025-01-16T11:07:18+00:00 coverage: Completely overhaul counter assignment, using node-flow graphs 2025-01-16T11:07:18+00:00 Zalathar Zalathar@users.noreply.github.com 2025-01-12T10:36:07+00:00 urn:sha1:f1300c860e6ff4e024f0a347b87f94e36785ce49 rename `BitSet` to `DenseBitSet` 2025-01-11T11:34:01+00:00 Rémy Rakic remy.rakic+github@gmail.com 2025-01-07T15:19:05+00:00 urn:sha1:a13354bea05968799a5be5521691322274fa6a9e This should make it clearer that this bitset is dense, with the advantages and disadvantages that it entails. Reformat `use` declarations. 2024-07-28T22:26:52+00:00 Nicholas Nethercote n.nethercote@gmail.com 2024-07-28T22:13:50+00:00 urn:sha1:84ac80f1921afc243d71fd0caaa4f2838c294102 The previous commit updated `rustfmt.toml` appropriately. This commit is the outcome of running `x fmt --all` with the new formatting options. Apply x clippy --fix and x fmt 2024-05-30T01:51:27+00:00 r0cky mu001999@outlook.com 2024-05-30T01:51:27+00:00 urn:sha1:dabd05bbab9df465a580858c3e03dc1797b12deb Make `graph::DepthFirstSearch` accept `G` by value 2024-04-15T23:20:52+00:00 Maybe Waffle waffle.lapkin@gmail.com 2024-04-15T18:17:51+00:00 urn:sha1:7d2cb3dda732028c7f8dfa8de5876da5be4bad9d It's required for the next commit. Note that you can still have `G = &H`, since there are implementations of all the graph traits for references. Rename `WithNumEdges` => `NumEdges` and `WithStartNode` => `StartNode` 2024-04-14T15:51:29+00:00 Maybe Waffle waffle.lapkin@gmail.com 2024-04-14T15:51:29+00:00 urn:sha1:f5144938bd33af48a1b06fc5e11f7f30132be895 Merge `{With,Graph}{Successors,Predecessors}` into `{Successors,Predecessors}` 2024-04-14T15:48:53+00:00 Maybe Waffle waffle.lapkin@gmail.com 2024-04-14T15:40:26+00:00 urn:sha1:0d5fc9bf584f0e8700f0c3d2854bb6c70453f624 Now with GAT! Merge `WithNumNodes` into DirectedGraph 2024-04-14T15:46:40+00:00 Maybe Waffle waffle.lapkin@gmail.com 2024-04-14T15:15:03+00:00 urn:sha1:398da593a53161c1ef9ca7dabbc5e9edf67deac6 Split `{Idx, IndexVec, IndexSlice}` into their own modules 2023-04-24T13:53:35+00:00 Maybe Waffle waffle.lapkin@gmail.com 2023-04-19T10:57:17+00:00 urn:sha1:e496fbec922b22d9b506ba55386c482b4bf06378 Use `&IndexSlice` instead of `&IndexVec` where possible 2023-04-03T00:35:37+00:00 Scott McMurray scottmcm@users.noreply.github.com 2023-03-31T07:32:44+00:00 urn:sha1:a2ee7592d6b7c0daa62b7870ade85e0cc0acca05 All the same reasons as for `[T]`: more general, less pointer chasing, and `&mut IndexSlice` emphasizes that it doesn't change *length*.