[INFO] cloning repository https://github.com/Lucian-4a25/rust-collections
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/Lucian-4a25/rust-collections" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FLucian-4a25%2Frust-collections", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FLucian-4a25%2Frust-collections'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 5d4532997a77ab2c458d21131f56d2ebae5625a0
[INFO] checking Lucian-4a25/rust-collections/5d4532997a77ab2c458d21131f56d2ebae5625a0 against try#ccf408f4326a858c00dd845a64a86b16f360a801 for pr-129466-2
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FLucian-4a25%2Frust-collections" "/workspace/builds/worker-2-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-2-tc2/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/Lucian-4a25/rust-collections on toolchain ccf408f4326a858c00dd845a64a86b16f360a801
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ccf408f4326a858c00dd845a64a86b16f360a801" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/Lucian-4a25/rust-collections
[INFO] finished tweaking git repo https://github.com/Lucian-4a25/rust-collections
[INFO] tweaked toml for git repo https://github.com/Lucian-4a25/rust-collections written to /workspace/builds/worker-2-tc2/source/Cargo.toml
[INFO] crate git repo https://github.com/Lucian-4a25/rust-collections already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ccf408f4326a858c00dd845a64a86b16f360a801" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:ceb6ea022f8a89cebbe621bb4987e73a935bd40dfbb726f832cfff4742a5b95a" "/opt/rustwide/cargo-home/bin/cargo" "+ccf408f4326a858c00dd845a64a86b16f360a801" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 061d8094c17d0d49960a62e4dca13107d422d5de6af4b776e602351e0dcdd601
[INFO] running `Command { std: "docker" "start" "-a" "061d8094c17d0d49960a62e4dca13107d422d5de6af4b776e602351e0dcdd601", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "061d8094c17d0d49960a62e4dca13107d422d5de6af4b776e602351e0dcdd601", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "061d8094c17d0d49960a62e4dca13107d422d5de6af4b776e602351e0dcdd601", kill_on_drop: false }`
[INFO] [stdout] 061d8094c17d0d49960a62e4dca13107d422d5de6af4b776e602351e0dcdd601
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:ceb6ea022f8a89cebbe621bb4987e73a935bd40dfbb726f832cfff4742a5b95a" "/opt/rustwide/cargo-home/bin/cargo" "+ccf408f4326a858c00dd845a64a86b16f360a801" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] a8e74b4dea64031567b8f5ff3c472e03a756e10e03311fc31fde0c2612359b66
[INFO] running `Command { std: "docker" "start" "-a" "a8e74b4dea64031567b8f5ff3c472e03a756e10e03311fc31fde0c2612359b66", kill_on_drop: false }`
[INFO] [stderr] Copying to /tmp/fixit
[INFO] [stderr] Running `cargo fix --edition`
[INFO] [stderr]    Migrating Cargo.toml from 2021 edition to 2024
[INFO] [stderr]     Checking equivalent v1.0.1
[INFO] [stderr]     Checking hashbrown v0.14.0
[INFO] [stderr]     Checking either v1.9.0
[INFO] [stderr]     Checking fixedbitset v0.4.2
[INFO] [stderr]     Checking getrandom v0.2.13
[INFO] [stderr]     Checking itertools v0.11.0
[INFO] [stderr]     Checking rand_core v0.6.4
[INFO] [stderr]     Checking rand_chacha v0.3.1
[INFO] [stderr]     Checking rand v0.8.5
[INFO] [stderr]     Checking indexmap v2.0.0
[INFO] [stderr]     Checking petgraph v0.6.4
[INFO] [stderr]     Checking rust-collections v0.1.0 (/tmp/fixit)
[INFO] [stderr]    Migrating src/lib.rs from 2021 edition to 2024
[INFO] [stderr]        Fixed src/btreemap_cus.rs (2 fixes)
[INFO] [stderr]        Fixed src/graph/algo/isomorphism/semantic.rs (2 fixes)
[INFO] [stderr]        Fixed src/raw_vec.rs (1 fix)
[INFO] [stderr]        Fixed src/graph/graph_adjacency_list.rs (3 fixes)
[INFO] [stderr]        Fixed src/graph/algo/simple_paths.rs (1 fix)
[INFO] [stderr]        Fixed src/graph/graph_dense_matrix.rs (2 fixes)
[INFO] [stderr]        Fixed src/graph/algo/mod.rs (2 fixes)
[INFO] [stdout] warning: the feature `exclusive_range_pattern` has been stable since 1.80.0 and no longer requires an attribute to enable
[INFO] [stdout]  --> src/lib.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | #![feature(exclusive_range_pattern)]
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(stable_features)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variant `NonOuter` is never constructed
[INFO] [stdout]    --> src/graph/algo/matching.rs:246:5
[INFO] [stdout]     |
[INFO] [stdout] 241 | enum Label {
[INFO] [stdout]     |      ----- variant in this enum
[INFO] [stdout] ...
[INFO] [stdout] 246 |     NonOuter,
[INFO] [stdout]     |     ^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `Label` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]     --> src/btreemap_cus.rs:1088:15
[INFO] [stdout]      |
[INFO] [stdout] 1088 |         while let Some(_) = self.next() {}
[INFO] [stdout]      |               ^^^^^^^^^^^^^^-----------
[INFO] [stdout]      |                             |
[INFO] [stdout]      |                             this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]      |
[INFO] [stdout]      = warning: this changes meaning in Rust 2024
[INFO] [stdout]      = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]     --> src/btreemap_cus.rs:1088:42
[INFO] [stdout]      |
[INFO] [stdout] 1088 |         while let Some(_) = self.next() {}
[INFO] [stdout]      |                                          ^
[INFO] [stdout]      = note: `--force-warn if-let-rescope` implied by `--force-warn rust-2024-compatibility`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/algo/mod.rs:171:11
[INFO] [stdout]     |
[INFO] [stdout] 171 |     while let Some(_) = topo.next(graph) {
[INFO] [stdout]     |           ^^^^^^^^^^^^^^----^^^^^^^^^^^^
[INFO] [stdout]     |                         |
[INFO] [stdout]     |                         this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/algo/mod.rs:173:5
[INFO] [stdout]     |
[INFO] [stdout] 173 |     }
[INFO] [stdout]     |     ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]   --> src/graph/algo/dijkstra.rs:53:11
[INFO] [stdout]    |
[INFO] [stdout] 53 |     while let Some(MinScore(score, node)) = priority_queue.pop() {
[INFO] [stdout]    |           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^--------------^^^^^^
[INFO] [stdout]    |                                             |
[INFO] [stdout]    |                                             this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]    |
[INFO] [stdout]    = warning: this changes meaning in Rust 2024
[INFO] [stdout]    = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]   --> src/graph/algo/dijkstra.rs:83:5
[INFO] [stdout]    |
[INFO] [stdout] 83 |     }
[INFO] [stdout]    |     ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2.rs:686:11
[INFO] [stdout]     |
[INFO] [stdout] 686 |     while let Some(nodes) = candidate_node_iter.next() {
[INFO] [stdout]     |           ^^^^^^^^^^^^^^^^^^-------------------^^^^^^^
[INFO] [stdout]     |                             |
[INFO] [stdout]     |                             this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2.rs:692:5
[INFO] [stdout]     |
[INFO] [stdout] 692 |     }
[INFO] [stdout]     |     ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/algo/matching.rs:81:27
[INFO] [stdout]     |
[INFO] [stdout] 81  |             'outer: while let Some(outer_idx) = queue.pop_front() {
[INFO] [stdout]     |                           ^^^^^^^^^^^^^^^^^^^^^^-----^^^^^^^^^^^^
[INFO] [stdout]     |                                                 |
[INFO] [stdout]     |                                                 this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/algo/matching.rs:126:13
[INFO] [stdout]     |
[INFO] [stdout] 126 |             }
[INFO] [stdout]     |             ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]   --> src/graph/algo/simple_paths.rs:30:15
[INFO] [stdout]    |
[INFO] [stdout] 30 |         while let Some(children) = stack.last_mut() {
[INFO] [stdout]    |               ^^^^^^^^^^^^^^^^^^^^^-----^^^^^^^^^^^
[INFO] [stdout]    |                                    |
[INFO] [stdout]    |                                    this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]    |
[INFO] [stdout]    = warning: this changes meaning in Rust 2024
[INFO] [stdout]    = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]   --> src/graph/algo/simple_paths.rs:48:9
[INFO] [stdout]    |
[INFO] [stdout] 48 |         }
[INFO] [stdout]    |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:112:15
[INFO] [stdout]     |
[INFO] [stdout] 112 |         while let Some(edge) = iter.next() {
[INFO] [stdout]     |               ^^^^^^^^^^^^^^^^^-----------
[INFO] [stdout]     |                                |
[INFO] [stdout]     |                                this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:120:9
[INFO] [stdout]     |
[INFO] [stdout] 120 |         }
[INFO] [stdout]     |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:184:19
[INFO] [stdout]     |
[INFO] [stdout] 184 |             while let Some(edge) = self.edges.get(edge_pos) {
[INFO] [stdout]     |                   ^^^^^^^^^^^^^^^^^----------^^^^^^^^^^^^^^
[INFO] [stdout]     |                                    |
[INFO] [stdout]     |                                    this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:189:13
[INFO] [stdout]     |
[INFO] [stdout] 189 |             }
[INFO] [stdout]     |             ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:198:23
[INFO] [stdout]     |
[INFO] [stdout] 198 |                 while let Some(edge) = self.edges.get_mut(edge_pos) {
[INFO] [stdout]     |                       ^^^^^^^^^^^^^^^^^----------^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |                                        |
[INFO] [stdout]     |                                        this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:201:17
[INFO] [stdout]     |
[INFO] [stdout] 201 |                 }
[INFO] [stdout]     |                 ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:313:15
[INFO] [stdout]     |
[INFO] [stdout] 313 |         while let Some(edge) = self.edges.get(outcoming_edge) {
[INFO] [stdout]     |               ^^^^^^^^^^^^^^^^^----------^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |                                |
[INFO] [stdout]     |                                this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:318:9
[INFO] [stdout]     |
[INFO] [stdout] 318 |         }
[INFO] [stdout]     |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:321:19
[INFO] [stdout]     |
[INFO] [stdout] 321 |             while let Some(edge) = self.edges.get(incoming_edge) {
[INFO] [stdout]     |                   ^^^^^^^^^^^^^^^^^----------^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |                                    |
[INFO] [stdout]     |                                    this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:326:13
[INFO] [stdout]     |
[INFO] [stdout] 326 |             }
[INFO] [stdout]     |             ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:346:15
[INFO] [stdout]     |
[INFO] [stdout] 346 |         while let Some(edge) = self.edges.get(edge_idx) {
[INFO] [stdout]     |               ^^^^^^^^^^^^^^^^^----------^^^^^^^^^^^^^^
[INFO] [stdout]     |                                |
[INFO] [stdout]     |                                this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:352:9
[INFO] [stdout]     |
[INFO] [stdout] 352 |         }
[INFO] [stdout]     |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_dense_matrix.rs:289:15
[INFO] [stdout]     |
[INFO] [stdout] 289 |         while let Some((row, col)) = self.idxs.pop_front() {
[INFO] [stdout]     |               ^^^^^^^^^^^^^^^^^^^^^^^---------^^^^^^^^^^^^
[INFO] [stdout]     |                                      |
[INFO] [stdout]     |                                      this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_dense_matrix.rs:295:9
[INFO] [stdout]     |
[INFO] [stdout] 295 |         }
[INFO] [stdout]     |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_dense_matrix.rs:312:15
[INFO] [stdout]     |
[INFO] [stdout] 312 |         while let Some((row, col)) = self.idxs.pop_front() {
[INFO] [stdout]     |               ^^^^^^^^^^^^^^^^^^^^^^^---------^^^^^^^^^^^^
[INFO] [stdout]     |                                      |
[INFO] [stdout]     |                                      this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_dense_matrix.rs:317:9
[INFO] [stdout]     |
[INFO] [stdout] 317 |         }
[INFO] [stdout]     |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/linked_list_cus.rs:129:15
[INFO] [stdout]     |
[INFO] [stdout] 129 |         while let Some(node) = self.pop_back_inner() {
[INFO] [stdout]     |               ^^^^^^^^^^^^^^^^^---------------------
[INFO] [stdout]     |                                |
[INFO] [stdout]     |                                this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/linked_list_cus.rs:133:9
[INFO] [stdout]     |
[INFO] [stdout] 133 |         }
[INFO] [stdout]     |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/vec_cus.rs:102:19
[INFO] [stdout]     |
[INFO] [stdout] 102 |             while let Some(_) = self.pop() {}
[INFO] [stdout]     |                   ^^^^^^^^^^^^^^----------
[INFO] [stdout]     |                                 |
[INFO] [stdout]     |                                 this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/vec_cus.rs:102:45
[INFO] [stdout]     |
[INFO] [stdout] 102 |             while let Some(_) = self.pop() {}
[INFO] [stdout]     |                                             ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 18 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Migrating src/main.rs from 2021 edition to 2024
[INFO] [stdout] warning: the feature `exclusive_range_pattern` has been stable since 1.80.0 and no longer requires an attribute to enable
[INFO] [stdout]  --> src/lib.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | #![feature(exclusive_range_pattern)]
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(stable_features)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variant `NonOuter` is never constructed
[INFO] [stdout]    --> src/graph/algo/matching.rs:246:5
[INFO] [stdout]     |
[INFO] [stdout] 241 | enum Label {
[INFO] [stdout]     |      ----- variant in this enum
[INFO] [stdout] ...
[INFO] [stdout] 246 |     NonOuter,
[INFO] [stdout]     |     ^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `Label` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]     --> src/btreemap_cus.rs:1088:15
[INFO] [stdout]      |
[INFO] [stdout] 1088 |         while let Some(_) = self.next() {}
[INFO] [stdout]      |               ^^^^^^^^^^^^^^-----------
[INFO] [stdout]      |                             |
[INFO] [stdout]      |                             this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]      |
[INFO] [stdout]      = warning: this changes meaning in Rust 2024
[INFO] [stdout]      = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]     --> src/btreemap_cus.rs:1088:42
[INFO] [stdout]      |
[INFO] [stdout] 1088 |         while let Some(_) = self.next() {}
[INFO] [stdout]      |                                          ^
[INFO] [stdout]      = note: `--force-warn if-let-rescope` implied by `--force-warn rust-2024-compatibility`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/algo/mod.rs:171:11
[INFO] [stdout]     |
[INFO] [stdout] 171 |     while let Some(_) = topo.next(graph) {
[INFO] [stdout]     |           ^^^^^^^^^^^^^^----^^^^^^^^^^^^
[INFO] [stdout]     |                         |
[INFO] [stdout]     |                         this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/algo/mod.rs:173:5
[INFO] [stdout]     |
[INFO] [stdout] 173 |     }
[INFO] [stdout]     |     ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]   --> src/graph/algo/dijkstra.rs:53:11
[INFO] [stdout]    |
[INFO] [stdout] 53 |     while let Some(MinScore(score, node)) = priority_queue.pop() {
[INFO] [stdout]    |           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^--------------^^^^^^
[INFO] [stdout]    |                                             |
[INFO] [stdout]    |                                             this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]    |
[INFO] [stdout]    = warning: this changes meaning in Rust 2024
[INFO] [stdout]    = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]   --> src/graph/algo/dijkstra.rs:83:5
[INFO] [stdout]    |
[INFO] [stdout] 83 |     }
[INFO] [stdout]    |     ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2.rs:686:11
[INFO] [stdout]     |
[INFO] [stdout] 686 |     while let Some(nodes) = candidate_node_iter.next() {
[INFO] [stdout]     |           ^^^^^^^^^^^^^^^^^^-------------------^^^^^^^
[INFO] [stdout]     |                             |
[INFO] [stdout]     |                             this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2.rs:692:5
[INFO] [stdout]     |
[INFO] [stdout] 692 |     }
[INFO] [stdout]     |     ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/algo/matching.rs:81:27
[INFO] [stdout]     |
[INFO] [stdout] 81  |             'outer: while let Some(outer_idx) = queue.pop_front() {
[INFO] [stdout]     |                           ^^^^^^^^^^^^^^^^^^^^^^-----^^^^^^^^^^^^
[INFO] [stdout]     |                                                 |
[INFO] [stdout]     |                                                 this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/algo/matching.rs:126:13
[INFO] [stdout]     |
[INFO] [stdout] 126 |             }
[INFO] [stdout]     |             ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]   --> src/graph/algo/simple_paths.rs:30:15
[INFO] [stdout]    |
[INFO] [stdout] 30 |         while let Some(children) = stack.last_mut() {
[INFO] [stdout]    |               ^^^^^^^^^^^^^^^^^^^^^-----^^^^^^^^^^^
[INFO] [stdout]    |                                    |
[INFO] [stdout]    |                                    this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]    |
[INFO] [stdout]    = warning: this changes meaning in Rust 2024
[INFO] [stdout]    = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]   --> src/graph/algo/simple_paths.rs:48:9
[INFO] [stdout]    |
[INFO] [stdout] 48 |         }
[INFO] [stdout]    |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:112:15
[INFO] [stdout]     |
[INFO] [stdout] 112 |         while let Some(edge) = iter.next() {
[INFO] [stdout]     |               ^^^^^^^^^^^^^^^^^-----------
[INFO] [stdout]     |                                |
[INFO] [stdout]     |                                this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:120:9
[INFO] [stdout]     |
[INFO] [stdout] 120 |         }
[INFO] [stdout]     |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:184:19
[INFO] [stdout]     |
[INFO] [stdout] 184 |             while let Some(edge) = self.edges.get(edge_pos) {
[INFO] [stdout]     |                   ^^^^^^^^^^^^^^^^^----------^^^^^^^^^^^^^^
[INFO] [stdout]     |                                    |
[INFO] [stdout]     |                                    this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:189:13
[INFO] [stdout]     |
[INFO] [stdout] 189 |             }
[INFO] [stdout]     |             ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:198:23
[INFO] [stdout]     |
[INFO] [stdout] 198 |                 while let Some(edge) = self.edges.get_mut(edge_pos) {
[INFO] [stdout]     |                       ^^^^^^^^^^^^^^^^^----------^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |                                        |
[INFO] [stdout]     |                                        this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:201:17
[INFO] [stdout]     |
[INFO] [stdout] 201 |                 }
[INFO] [stdout]     |                 ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:313:15
[INFO] [stdout]     |
[INFO] [stdout] 313 |         while let Some(edge) = self.edges.get(outcoming_edge) {
[INFO] [stdout]     |               ^^^^^^^^^^^^^^^^^----------^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |                                |
[INFO] [stdout]     |                                this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:318:9
[INFO] [stdout]     |
[INFO] [stdout] 318 |         }
[INFO] [stdout]     |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:321:19
[INFO] [stdout]     |
[INFO] [stdout] 321 |             while let Some(edge) = self.edges.get(incoming_edge) {
[INFO] [stdout]     |                   ^^^^^^^^^^^^^^^^^----------^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |                                    |
[INFO] [stdout]     |                                    this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:326:13
[INFO] [stdout]     |
[INFO] [stdout] 326 |             }
[INFO] [stdout]     |             ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:346:15
[INFO] [stdout]     |
[INFO] [stdout] 346 |         while let Some(edge) = self.edges.get(edge_idx) {
[INFO] [stdout]     |               ^^^^^^^^^^^^^^^^^----------^^^^^^^^^^^^^^
[INFO] [stdout]     |                                |
[INFO] [stdout]     |                                this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:352:9
[INFO] [stdout]     |
[INFO] [stdout] 352 |         }
[INFO] [stdout]     |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_dense_matrix.rs:289:15
[INFO] [stdout]     |
[INFO] [stdout] 289 |         while let Some((row, col)) = self.idxs.pop_front() {
[INFO] [stdout]     |               ^^^^^^^^^^^^^^^^^^^^^^^---------^^^^^^^^^^^^
[INFO] [stdout]     |                                      |
[INFO] [stdout]     |                                      this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_dense_matrix.rs:295:9
[INFO] [stdout]     |
[INFO] [stdout] 295 |         }
[INFO] [stdout]     |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_dense_matrix.rs:312:15
[INFO] [stdout]     |
[INFO] [stdout] 312 |         while let Some((row, col)) = self.idxs.pop_front() {
[INFO] [stdout]     |               ^^^^^^^^^^^^^^^^^^^^^^^---------^^^^^^^^^^^^
[INFO] [stdout]     |                                      |
[INFO] [stdout]     |                                      this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_dense_matrix.rs:317:9
[INFO] [stdout]     |
[INFO] [stdout] 317 |         }
[INFO] [stdout]     |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/linked_list_cus.rs:129:15
[INFO] [stdout]     |
[INFO] [stdout] 129 |         while let Some(node) = self.pop_back_inner() {
[INFO] [stdout]     |               ^^^^^^^^^^^^^^^^^---------------------
[INFO] [stdout]     |                                |
[INFO] [stdout]     |                                this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/linked_list_cus.rs:133:9
[INFO] [stdout]     |
[INFO] [stdout] 133 |         }
[INFO] [stdout]     |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/vec_cus.rs:102:19
[INFO] [stdout]     |
[INFO] [stdout] 102 |             while let Some(_) = self.pop() {}
[INFO] [stdout]     |                   ^^^^^^^^^^^^^^----------
[INFO] [stdout]     |                                 |
[INFO] [stdout]     |                                 this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/vec_cus.rs:102:45
[INFO] [stdout]     |
[INFO] [stdout] 102 |             while let Some(_) = self.pop() {}
[INFO] [stdout]     |                                             ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 18 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]        Fixed src/graph/algo/isomorphism/mod.rs (3 fixes)
[INFO] [stderr]        Fixed src/skip_list.rs (3 fixes)
[INFO] [stderr]        Fixed src/main.rs (5 fixes)
[INFO] [stdout] warning: the feature `exclusive_range_pattern` has been stable since 1.80.0 and no longer requires an attribute to enable
[INFO] [stdout]  --> src/main.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | #![feature(exclusive_range_pattern)]
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(stable_features)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::io::Write`
[INFO] [stdout]   --> src/main.rs:12:5
[INFO] [stdout]    |
[INFO] [stdout] 12 | use std::io::Write;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `FieldStruct` is never constructed
[INFO] [stdout]    --> src/main.rs:376:8
[INFO] [stdout]     |
[INFO] [stdout] 376 | struct FieldStruct {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `vf2pp_is_isomorphism_matching` is never used
[INFO] [stdout]   --> src/graph/algo/isomorphism/vf2pp.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn vf2pp_is_isomorphism_matching<G0, G1>(g0: G0, g1: G1, subgraph: bool) -> bool
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `vf2pp_is_isomorphism_semantic_matching` is never used
[INFO] [stdout]   --> src/graph/algo/isomorphism/vf2pp.rs:42:8
[INFO] [stdout]    |
[INFO] [stdout] 42 | pub fn vf2pp_is_isomorphism_semantic_matching<G0, G1, NM, EM>(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `vf2pp_isomorphism_semantic_matching_iter` is never used
[INFO] [stdout]   --> src/graph/algo/isomorphism/vf2pp.rs:79:8
[INFO] [stdout]    |
[INFO] [stdout] 79 | pub fn vf2pp_isomorphism_semantic_matching_iter<'a, G0, G1, NM, EM>(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new` and `is_match` are never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:151:8
[INFO] [stdout]     |
[INFO] [stdout] 133 | / impl<'a, G0, G1, NM, EM> IsomorphismMatcher<'a, G0, G1, NM, EM>
[INFO] [stdout] 134 | | where
[INFO] [stdout] 135 | |     G0: IntoNeighborsDirected
[INFO] [stdout] 136 | |         + IntoNeighborsUnirected
[INFO] [stdout] ...   |
[INFO] [stdout] 148 | |     NM: NodeMatcher<G0, G1>,
[INFO] [stdout] 149 | |     EM: EdgeMatcher<G0, G1>,
[INFO] [stdout]     | |____________________________- associated items in this implementation
[INFO] [stdout] 150 |   {
[INFO] [stdout] 151 |       fn new(vf2pp: VF2PP<G0, G1>, node_matcher: NM, edge_matcher: EM, subgraph: bool) -> Self {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 171 |       pub fn is_match(&mut self) -> bool {
[INFO] [stdout]     |              ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:270:8
[INFO] [stdout]     |
[INFO] [stdout] 255 | / impl<G0, G1> VF2PP<G0, G1>
[INFO] [stdout] 256 | | where
[INFO] [stdout] 257 | |     G0: IntoNeighborsDirected
[INFO] [stdout] 258 | |         + IntoNeighborsUnirected
[INFO] [stdout] ...   |
[INFO] [stdout] 267 | |         + NodeCount
[INFO] [stdout] 268 | |         + GraphProp,
[INFO] [stdout]     | |____________________- associated function in this implementation
[INFO] [stdout] 269 |   {
[INFO] [stdout] 270 |       fn new<F0, F1>(g0: G0, g1: G1, mut label0: F0, mut label1: F1) -> Self
[INFO] [stdout]     |          ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Vf2ppMatcherBuilder` is never constructed
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:576:12
[INFO] [stdout]     |
[INFO] [stdout] 576 | pub struct Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, EM> {
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:587:12
[INFO] [stdout]     |
[INFO] [stdout] 584 | / impl<G0, G1>
[INFO] [stdout] 585 | |     Vf2ppMatcherBuilder<G0, G1, NoNodeLabel, NoNodeLabel, NoSemanticMatch, NoSemanticMatch>
[INFO] [stdout]     | |___________________________________________________________________________________________- associated function in this implementation
[INFO] [stdout] 586 |   {
[INFO] [stdout] 587 |       pub fn new() -> Self
[INFO] [stdout]     |              ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `set_subgraph` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:611:12
[INFO] [stdout]     |
[INFO] [stdout] 602 | / impl<G0, G1, F0, F1, NM, EM> Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, EM>
[INFO] [stdout] 603 | | where
[INFO] [stdout] 604 | |     G0: GraphBase,
[INFO] [stdout] 605 | |     G1: GraphBase,
[INFO] [stdout] ...   |
[INFO] [stdout] 608 | |     NM: NodeMatcher<G0, G1>,
[INFO] [stdout] 609 | |     EM: EdgeMatcher<G0, G1>,
[INFO] [stdout]     | |____________________________- method in this implementation
[INFO] [stdout] 610 |   {
[INFO] [stdout] 611 |       pub fn set_subgraph(mut self, match_subgraph: bool) -> Self {
[INFO] [stdout]     |              ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `build` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:636:12
[INFO] [stdout]     |
[INFO] [stdout] 617 | / impl<G0, G1, F0, F1, NM, EM> Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, EM>
[INFO] [stdout] 618 | | where
[INFO] [stdout] 619 | |     G0: IntoNeighborsDirected
[INFO] [stdout] 620 | |         + IntoNeighborsUnirected
[INFO] [stdout] ...   |
[INFO] [stdout] 633 | |     NM: NodeMatcher<G0, G1>,
[INFO] [stdout] 634 | |     EM: EdgeMatcher<G0, G1>,
[INFO] [stdout]     | |____________________________- method in this implementation
[INFO] [stdout] 635 |   {
[INFO] [stdout] 636 |       pub fn build<'a>(self, g0: G0, g1: G1) -> IsomorphismMatcher<'a, G0, G1, NM, EM> {
[INFO] [stdout]     |              ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `set_label` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:652:12
[INFO] [stdout]     |
[INFO] [stdout] 643 | / impl<G0, G1, F0, F1, NM, EM> Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, EM>
[INFO] [stdout] 644 | | where
[INFO] [stdout] 645 | |     G0: GraphBase + GraphDataAccess,
[INFO] [stdout] 646 | |     G1: GraphBase + GraphDataAccess,
[INFO] [stdout] ...   |
[INFO] [stdout] 649 | |     NM: NodeMatcher<G0, G1>,
[INFO] [stdout] 650 | |     EM: EdgeMatcher<G0, G1>,
[INFO] [stdout]     | |____________________________- method in this implementation
[INFO] [stdout] 651 |   {
[INFO] [stdout] 652 |       pub fn set_label<LF0, LF1>(
[INFO] [stdout]     |              ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `set_node_matcher` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:679:12
[INFO] [stdout]     |
[INFO] [stdout] 670 | / impl<G0, G1, F0, F1, NM, EM> Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, EM>
[INFO] [stdout] 671 | | where
[INFO] [stdout] 672 | |     G0: GraphDataAccess + IntoEdgeDirected,
[INFO] [stdout] 673 | |     G1: GraphDataAccess + IntoEdgeDirected,
[INFO] [stdout] ...   |
[INFO] [stdout] 676 | |     NM: NodeMatcher<G0, G1>,
[INFO] [stdout] 677 | |     EM: EdgeMatcher<G0, G1>,
[INFO] [stdout]     | |____________________________- method in this implementation
[INFO] [stdout] 678 |   {
[INFO] [stdout] 679 |       pub fn set_node_matcher<N>(self, nm: N) -> Vf2ppMatcherBuilder<G0, G1, F0, F1, N, EM>
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `set_edge_matcher` is never used
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2pp.rs:702:12
[INFO] [stdout]     |
[INFO] [stdout] 693 | / impl<G0, G1, F0, F1, NM, EM> Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, EM>
[INFO] [stdout] 694 | | where
[INFO] [stdout] 695 | |     G0: GraphDataAccess + IntoEdgeDirected + Copy,
[INFO] [stdout] 696 | |     G1: GraphDataAccess + IntoEdgeDirected + Copy,
[INFO] [stdout] ...   |
[INFO] [stdout] 699 | |     NM: NodeMatcher<G0, G1>,
[INFO] [stdout] 700 | |     EM: EdgeMatcher<G0, G1>,
[INFO] [stdout]     | |____________________________- method in this implementation
[INFO] [stdout] 701 |   {
[INFO] [stdout] 702 |       pub fn set_edge_matcher<E>(self, em: E) -> Vf2ppMatcherBuilder<G0, G1, F0, F1, NM, E>
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `k_shortest_path` is never used
[INFO] [stdout]   --> src/graph/algo/k_shortest_path.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | pub fn k_shortest_path<G, F, K>(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `greedy_matching` is never used
[INFO] [stdout]   --> src/graph/algo/matching.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn greedy_matching<G>(g: G) -> Matching<G>
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `dfs_non_backtracing` is never used
[INFO] [stdout]   --> src/graph/algo/matching.rs:38:4
[INFO] [stdout]    |
[INFO] [stdout] 38 | fn dfs_non_backtracing<G, F>(g: G, node: G::NodeId, visited: &mut G::Map, mut add_mate: F)
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `maximum_matching` is never used
[INFO] [stdout]   --> src/graph/algo/matching.rs:55:8
[INFO] [stdout]    |
[INFO] [stdout] 55 | pub fn maximum_matching<G>(g: G) -> Matching<G>
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `assign_edge_lable` is never used
[INFO] [stdout]    --> src/graph/algo/matching.rs:145:4
[INFO] [stdout]     |
[INFO] [stdout] 145 | fn assign_edge_lable<G>(
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `augment_path` is never used
[INFO] [stdout]    --> src/graph/algo/matching.rs:206:4
[INFO] [stdout]     |
[INFO] [stdout] 206 | fn augment_path(outer: usize, target: usize, mate: &mut Vec<Option<usize>>, label: &Vec<Label>) {
[INFO] [stdout]     |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum `Label` is never used
[INFO] [stdout]    --> src/graph/algo/matching.rs:241:6
[INFO] [stdout]     |
[INFO] [stdout] 241 | enum Label {
[INFO] [stdout]     |      ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: methods `is_outer`, `is_nonouter`, `try_next_outer`, and `try_edge_outer` are never used
[INFO] [stdout]    --> src/graph/algo/matching.rs:250:8
[INFO] [stdout]     |
[INFO] [stdout] 249 | impl Label {
[INFO] [stdout]     | ---------- methods in this implementation
[INFO] [stdout] 250 |     fn is_outer(self) -> bool {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 257 |     fn is_nonouter(self) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 261 |     fn try_next_outer(self) -> Option<usize> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 268 |     fn try_edge_outer(self) -> Option<(usize, usize)> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Matching` is never constructed
[INFO] [stdout]    --> src/graph/algo/matching.rs:276:12
[INFO] [stdout]     |
[INFO] [stdout] 276 | pub struct Matching<G>
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `is_perfect` is never used
[INFO] [stdout]    --> src/graph/algo/matching.rs:289:12
[INFO] [stdout]     |
[INFO] [stdout] 285 | / impl<G> Matching<G>
[INFO] [stdout] 286 | | where
[INFO] [stdout] 287 | |     G: NodeCount + GraphBase + Copy,
[INFO] [stdout]     | |____________________________________- method in this implementation
[INFO] [stdout] 288 |   {
[INFO] [stdout] 289 |       pub fn is_perfect(&self) -> bool {
[INFO] [stdout]     |              ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple methods are never used
[INFO] [stdout]    --> src/graph/algo/matching.rs:299:12
[INFO] [stdout]     |
[INFO] [stdout] 295 | / impl<G> Matching<G>
[INFO] [stdout] 296 | | where
[INFO] [stdout] 297 | |     G: NodeIndexable + Copy,
[INFO] [stdout]     | |____________________________- methods in this implementation
[INFO] [stdout] 298 |   {
[INFO] [stdout] 299 |       pub fn mate(&self, node: G::NodeId) -> Option<G::NodeId> {
[INFO] [stdout]     |              ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 306 |       pub fn edges(&self) -> MatchedEdges<'_, G> {
[INFO] [stdout]     |              ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 314 |       pub fn nodes(&self) -> MatchedNodes<'_, G> {
[INFO] [stdout]     |              ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 322 |       pub fn contains_edge(&self, n: G::NodeId, m: G::NodeId) -> bool {
[INFO] [stdout]     |              ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 329 |       pub fn contains_node(&self, n: G::NodeId) -> bool {
[INFO] [stdout]     |              ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 333 |       pub fn len(&self) -> usize {
[INFO] [stdout]     |              ^^^
[INFO] [stdout] ...
[INFO] [stdout] 337 |       pub fn is_empty(&self) -> bool {
[INFO] [stdout]     |              ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `all_simple_paths` is never used
[INFO] [stdout]  --> src/graph/algo/simple_paths.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn all_simple_paths<G, P>(
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `print_all_levels` is never used
[INFO] [stdout]   --> src/skip_list.rs:49:8
[INFO] [stdout]    |
[INFO] [stdout] 44 | / impl<K: Ord + Copy, V> SkipList<K, V>
[INFO] [stdout] 45 | | where
[INFO] [stdout] 46 | |     K: Debug,
[INFO] [stdout] 47 | |     V: Debug,
[INFO] [stdout]    | |_____________- method in this implementation
[INFO] [stdout] 48 |   {
[INFO] [stdout] 49 |       fn print_all_levels(&self) {
[INFO] [stdout]    |          ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused `std::slice::Iter` that must be used
[INFO] [stdout]    --> src/main.rs:341:5
[INFO] [stdout]     |
[INFO] [stdout] 341 |     v.iter();
[INFO] [stdout]     |     ^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: iterators are lazy and do nothing unless consumed
[INFO] [stdout]     = note: `#[warn(unused_must_use)]` on by default
[INFO] [stdout] help: use `let _ = ...` to ignore the resulting value
[INFO] [stdout]     |
[INFO] [stdout] 341 |     let _ = v.iter();
[INFO] [stdout]     |     +++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]     --> src/btreemap_cus.rs:1088:15
[INFO] [stdout]      |
[INFO] [stdout] 1088 |         while let Some(_) = self.next() {}
[INFO] [stdout]      |               ^^^^^^^^^^^^^^-----------
[INFO] [stdout]      |                             |
[INFO] [stdout]      |                             this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]      |
[INFO] [stdout]      = warning: this changes meaning in Rust 2024
[INFO] [stdout]      = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]     --> src/btreemap_cus.rs:1088:42
[INFO] [stdout]      |
[INFO] [stdout] 1088 |         while let Some(_) = self.next() {}
[INFO] [stdout]      |                                          ^
[INFO] [stdout]      = note: `--force-warn if-let-rescope` implied by `--force-warn rust-2024-compatibility`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/algo/mod.rs:171:11
[INFO] [stdout]     |
[INFO] [stdout] 171 |     while let Some(_) = topo.next(graph) {
[INFO] [stdout]     |           ^^^^^^^^^^^^^^----^^^^^^^^^^^^
[INFO] [stdout]     |                         |
[INFO] [stdout]     |                         this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/algo/mod.rs:173:5
[INFO] [stdout]     |
[INFO] [stdout] 173 |     }
[INFO] [stdout]     |     ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]   --> src/graph/algo/dijkstra.rs:53:11
[INFO] [stdout]    |
[INFO] [stdout] 53 |     while let Some(MinScore(score, node)) = priority_queue.pop() {
[INFO] [stdout]    |           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^--------------^^^^^^
[INFO] [stdout]    |                                             |
[INFO] [stdout]    |                                             this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]    |
[INFO] [stdout]    = warning: this changes meaning in Rust 2024
[INFO] [stdout]    = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]   --> src/graph/algo/dijkstra.rs:83:5
[INFO] [stdout]    |
[INFO] [stdout] 83 |     }
[INFO] [stdout]    |     ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2.rs:686:11
[INFO] [stdout]     |
[INFO] [stdout] 686 |     while let Some(nodes) = candidate_node_iter.next() {
[INFO] [stdout]     |           ^^^^^^^^^^^^^^^^^^-------------------^^^^^^^
[INFO] [stdout]     |                             |
[INFO] [stdout]     |                             this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/algo/isomorphism/vf2.rs:692:5
[INFO] [stdout]     |
[INFO] [stdout] 692 |     }
[INFO] [stdout]     |     ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/algo/matching.rs:81:27
[INFO] [stdout]     |
[INFO] [stdout] 81  |             'outer: while let Some(outer_idx) = queue.pop_front() {
[INFO] [stdout]     |                           ^^^^^^^^^^^^^^^^^^^^^^-----^^^^^^^^^^^^
[INFO] [stdout]     |                                                 |
[INFO] [stdout]     |                                                 this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/algo/matching.rs:126:13
[INFO] [stdout]     |
[INFO] [stdout] 126 |             }
[INFO] [stdout]     |             ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]   --> src/graph/algo/simple_paths.rs:30:15
[INFO] [stdout]    |
[INFO] [stdout] 30 |         while let Some(children) = stack.last_mut() {
[INFO] [stdout]    |               ^^^^^^^^^^^^^^^^^^^^^-----^^^^^^^^^^^
[INFO] [stdout]    |                                    |
[INFO] [stdout]    |                                    this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]    |
[INFO] [stdout]    = warning: this changes meaning in Rust 2024
[INFO] [stdout]    = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]   --> src/graph/algo/simple_paths.rs:48:9
[INFO] [stdout]    |
[INFO] [stdout] 48 |         }
[INFO] [stdout]    |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:112:15
[INFO] [stdout]     |
[INFO] [stdout] 112 |         while let Some(edge) = iter.next() {
[INFO] [stdout]     |               ^^^^^^^^^^^^^^^^^-----------
[INFO] [stdout]     |                                |
[INFO] [stdout]     |                                this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:120:9
[INFO] [stdout]     |
[INFO] [stdout] 120 |         }
[INFO] [stdout]     |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:184:19
[INFO] [stdout]     |
[INFO] [stdout] 184 |             while let Some(edge) = self.edges.get(edge_pos) {
[INFO] [stdout]     |                   ^^^^^^^^^^^^^^^^^----------^^^^^^^^^^^^^^
[INFO] [stdout]     |                                    |
[INFO] [stdout]     |                                    this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:189:13
[INFO] [stdout]     |
[INFO] [stdout] 189 |             }
[INFO] [stdout]     |             ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:198:23
[INFO] [stdout]     |
[INFO] [stdout] 198 |                 while let Some(edge) = self.edges.get_mut(edge_pos) {
[INFO] [stdout]     |                       ^^^^^^^^^^^^^^^^^----------^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |                                        |
[INFO] [stdout]     |                                        this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:201:17
[INFO] [stdout]     |
[INFO] [stdout] 201 |                 }
[INFO] [stdout]     |                 ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:313:15
[INFO] [stdout]     |
[INFO] [stdout] 313 |         while let Some(edge) = self.edges.get(outcoming_edge) {
[INFO] [stdout]     |               ^^^^^^^^^^^^^^^^^----------^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |                                |
[INFO] [stdout]     |                                this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:318:9
[INFO] [stdout]     |
[INFO] [stdout] 318 |         }
[INFO] [stdout]     |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:321:19
[INFO] [stdout]     |
[INFO] [stdout] 321 |             while let Some(edge) = self.edges.get(incoming_edge) {
[INFO] [stdout]     |                   ^^^^^^^^^^^^^^^^^----------^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |                                    |
[INFO] [stdout]     |                                    this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:326:13
[INFO] [stdout]     |
[INFO] [stdout] 326 |             }
[INFO] [stdout]     |             ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:346:15
[INFO] [stdout]     |
[INFO] [stdout] 346 |         while let Some(edge) = self.edges.get(edge_idx) {
[INFO] [stdout]     |               ^^^^^^^^^^^^^^^^^----------^^^^^^^^^^^^^^
[INFO] [stdout]     |                                |
[INFO] [stdout]     |                                this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_adjacency_list.rs:352:9
[INFO] [stdout]     |
[INFO] [stdout] 352 |         }
[INFO] [stdout]     |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_dense_matrix.rs:289:15
[INFO] [stdout]     |
[INFO] [stdout] 289 |         while let Some((row, col)) = self.idxs.pop_front() {
[INFO] [stdout]     |               ^^^^^^^^^^^^^^^^^^^^^^^---------^^^^^^^^^^^^
[INFO] [stdout]     |                                      |
[INFO] [stdout]     |                                      this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_dense_matrix.rs:295:9
[INFO] [stdout]     |
[INFO] [stdout] 295 |         }
[INFO] [stdout]     |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/graph/graph_dense_matrix.rs:312:15
[INFO] [stdout]     |
[INFO] [stdout] 312 |         while let Some((row, col)) = self.idxs.pop_front() {
[INFO] [stdout]     |               ^^^^^^^^^^^^^^^^^^^^^^^---------^^^^^^^^^^^^
[INFO] [stdout]     |                                      |
[INFO] [stdout]     |                                      this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/graph/graph_dense_matrix.rs:317:9
[INFO] [stdout]     |
[INFO] [stdout] 317 |         }
[INFO] [stdout]     |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/linked_list_cus.rs:129:15
[INFO] [stdout]     |
[INFO] [stdout] 129 |         while let Some(node) = self.pop_back_inner() {
[INFO] [stdout]     |               ^^^^^^^^^^^^^^^^^---------------------
[INFO] [stdout]     |                                |
[INFO] [stdout]     |                                this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/linked_list_cus.rs:133:9
[INFO] [stdout]     |
[INFO] [stdout] 133 |         }
[INFO] [stdout]     |         ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024
[INFO] [stdout]    --> src/vec_cus.rs:102:19
[INFO] [stdout]     |
[INFO] [stdout] 102 |             while let Some(_) = self.pop() {}
[INFO] [stdout]     |                   ^^^^^^^^^^^^^^----------
[INFO] [stdout]     |                                 |
[INFO] [stdout]     |                                 this value has a significant drop implementation which may observe a major change in drop order and requires your discretion
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2024
[INFO] [stdout]     = note: for more information, see issue #124085 <https://github.com/rust-lang/rust/issues/124085>
[INFO] [stdout] help: the value is now dropped here in Edition 2024
[INFO] [stdout]    --> src/vec_cus.rs:102:45
[INFO] [stdout]     |
[INFO] [stdout] 102 |             while let Some(_) = self.pop() {}
[INFO] [stdout]     |                                             ^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 45 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: cannot find macro `addr_of_mut` in this scope
[INFO] [stdout]    --> src/main.rs:512:13
[INFO] [stdout]     |
[INFO] [stdout] 512 |             addr_of_mut!((*ptr).list).write(vec![0, 1, 2]);
[INFO] [stdout]     |             ^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this macro
[INFO] [stdout]     |
[INFO] [stdout] 12  + use std::ptr::addr_of_mut;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Migrating tests/visit/main.rs from 2021 edition to 2024
[INFO] [stdout] error: cannot find macro `addr_of_mut` in this scope
[INFO] [stdout]    --> src/main.rs:506:13
[INFO] [stdout]     |
[INFO] [stdout] 506 |             addr_of_mut!((*ptr).name).write("Bob".to_string());
[INFO] [stdout]     |             ^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this macro
[INFO] [stdout]     |
[INFO] [stdout] 12  + use std::ptr::addr_of_mut;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0433]: failed to resolve: use of undeclared type `HashSet`
[INFO] [stdout]    --> src/skip_list.rs:343:23
[INFO] [stdout]     |
[INFO] [stdout] 343 |     let mut removed = HashSet::new();
[INFO] [stdout]     |                       ^^^^^^^ use of undeclared type `HashSet`
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this struct
[INFO] [stdout]     |
[INFO] [stdout] 1   + use std::collections::HashSet;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0412]: cannot find type `Directed` in this scope
[INFO] [stdout]   --> src/main.rs:66:28
[INFO] [stdout]    |
[INFO] [stdout] 66 |     let mut csr: Csr<_, _, Directed> = Csr::new();
[INFO] [stdout]    |                            ^^^^^^^^ not found in this scope
[INFO] [stdout]    |
[INFO] [stdout] help: consider importing one of these items
[INFO] [stdout]    |
[INFO] [stdout] 12 + use crate::graph::Directed;
[INFO] [stdout]    |
[INFO] [stdout] 12 + use petgraph::Directed;
[INFO] [stdout]    |
[INFO] [stdout] 12 + use rust_collections::graph::Directed;
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0412]: cannot find type `Error` in this scope
[INFO] [stdout]    --> src/main.rs:427:32
[INFO] [stdout]     |
[INFO] [stdout] 427 | fn test_fs_api() -> Result<(), Error> {
[INFO] [stdout]     |                                ^^^^^ not found in this scope
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing one of these items
[INFO] [stdout]     |
[INFO] [stdout] 12  + use std::error::Error;
[INFO] [stdout]     |
[INFO] [stdout] 12  + use std::fmt::Error;
[INFO] [stdout]     |
[INFO] [stdout] 12  + use std::io::Error;
[INFO] [stdout]     |
[INFO] [stdout] 12  + use core::error::Error;
[INFO] [stdout]     |
[INFO] [stdout]       and 3 other candidates
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0433]: failed to resolve: use of undeclared type `File`
[INFO] [stdout]    --> src/main.rs:428:18
[INFO] [stdout]     |
[INFO] [stdout] 428 |     let mut fs = File::open("file/tmp")?;
[INFO] [stdout]     |                  ^^^^ use of undeclared type `File`
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this struct
[INFO] [stdout]     |
[INFO] [stdout] 12  + use std::fs::File;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: the feature `exclusive_range_pattern` has been stable since 1.80.0 and no longer requires an attribute to enable
[INFO] [stdout]  --> src/main.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | #![feature(exclusive_range_pattern)]
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(stable_features)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `world`
[INFO] [stdout]   --> src/variance.rs:23:17
[INFO] [stdout]    |
[INFO] [stdout] 23 |             let world = String::from("world");
[INFO] [stdout]    |                 ^^^^^ help: if this is intentional, prefix it with an underscore: `_world`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/variance.rs:21:13
[INFO] [stdout]    |
[INFO] [stdout] 21 |         let mut hello: &'static str = "hello";
[INFO] [stdout]    |             ----^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/main.rs:581:9
[INFO] [stdout]     |
[INFO] [stdout] 581 |     let mut a = A { v: Some([8; 10]) };
[INFO] [stdout]     |         ----^
[INFO] [stdout]     |         |
[INFO] [stdout]     |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: aborting due to 6 previous errors; 4 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] Some errors have detailed explanations: E0412, E0433.
[INFO] [stdout] 
[INFO] [stdout] For more information about an error, try `rustc --explain E0412`.
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `rust-collections` (bin "rust-collections" test) due to 7 previous errors; 4 warnings emitted
[INFO] [stderr] warning: build failed, waiting for other jobs to finish...
[INFO] [stderr]    Migrating tests/algo/main.rs from 2021 edition to 2024
[INFO] [stderr]    Migrating benches/isomorphism.rs from 2021 edition to 2024
[INFO] [stderr] warning: failed to automatically apply fixes suggested by rustc to crate `algo`
[INFO] [stderr] 
[INFO] [stderr] after fixes were automatically applied the compiler reported errors within these files:
[INFO] [stderr] 
[INFO] [stderr]   * tests/algo/matching.rs
[INFO] [stderr] 
[INFO] [stderr] This likely indicates a bug in either rustc or cargo itself,
[INFO] [stderr] and we would appreciate a bug report! You're likely to see
[INFO] [stderr] a number of compiler warnings after this message which cargo
[INFO] [stderr] attempted to fix but failed. If you could open an issue at
[INFO] [stderr] https://github.com/rust-lang/rust/issues
[INFO] [stderr] quoting the full output of this command we'd be very appreciative!
[INFO] [stderr] Note that you may be able to make some more progress in the near-term
[INFO] [stderr] fixing code with the `--broken-code` flag
[INFO] [stderr] 
[INFO] [stderr] The following errors were reported:
[INFO] [stderr] error[E0658]: fragment specifier `expr_2021` is unstable
[INFO] [stderr]  --> tests/algo/matching.rs:9:6
[INFO] [stderr]   |
[INFO] [stderr] 9 |     ($actual:expr_2021, [$($expected:expr_2021),+]) => {
[INFO] [stderr]   |      ^^^^^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: see issue #123742 <https://github.com/rust-lang/rust/issues/123742> for more information
[INFO] [stderr]   = help: add `#![feature(expr_fragment_specifier_2024)]` to the crate attributes to enable
[INFO] [stderr]   = note: this compiler was built on 2024-09-17; consider upgrading it if it is out of date
[INFO] [stderr] 
[INFO] [stderr] error[E0658]: fragment specifier `expr_2021` is unstable
[INFO] [stderr]  --> tests/algo/matching.rs:9:28
[INFO] [stderr]   |
[INFO] [stderr] 9 |     ($actual:expr_2021, [$($expected:expr_2021),+]) => {
[INFO] [stderr]   |                            ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: see issue #123742 <https://github.com/rust-lang/rust/issues/123742> for more information
[INFO] [stderr]   = help: add `#![feature(expr_fragment_specifier_2024)]` to the crate attributes to enable
[INFO] [stderr]   = note: this compiler was built on 2024-09-17; consider upgrading it if it is out of date
[INFO] [stderr] 
[INFO] [stderr] error[E0658]: fragment specifier `expr_2021` is unstable
[INFO] [stderr]   --> tests/algo/matching.rs:23:9
[INFO] [stderr]    |
[INFO] [stderr] 23 |     ($(($source:expr_2021, $target:expr_2021)),+) => {
[INFO] [stderr]    |         ^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: see issue #123742 <https://github.com/rust-lang/rust/issues/123742> for more information
[INFO] [stderr]    = help: add `#![feature(expr_fragment_specifier_2024)]` to the crate attributes to enable
[INFO] [stderr]    = note: this compiler was built on 2024-09-17; consider upgrading it if it is out of date
[INFO] [stderr] 
[INFO] [stderr] error[E0658]: fragment specifier `expr_2021` is unstable
[INFO] [stderr]   --> tests/algo/matching.rs:23:28
[INFO] [stderr]    |
[INFO] [stderr] 23 |     ($(($source:expr_2021, $target:expr_2021)),+) => {
[INFO] [stderr]    |                            ^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: see issue #123742 <https://github.com/rust-lang/rust/issues/123742> for more information
[INFO] [stderr]    = help: add `#![feature(expr_fragment_specifier_2024)]` to the crate attributes to enable
[INFO] [stderr]    = note: this compiler was built on 2024-09-17; consider upgrading it if it is out of date
[INFO] [stderr] 
[INFO] [stderr] error[E0658]: fragment specifier `expr_2021` is unstable
[INFO] [stderr]   --> tests/algo/matching.rs:32:8
[INFO] [stderr]    |
[INFO] [stderr] 32 |     ($($elem:expr_2021),+) => {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: see issue #123742 <https://github.com/rust-lang/rust/issues/123742> for more information
[INFO] [stderr]    = help: add `#![feature(expr_fragment_specifier_2024)]` to the crate attributes to enable
[INFO] [stderr]    = note: this compiler was built on 2024-09-17; consider upgrading it if it is out of date
[INFO] [stderr] 
[INFO] [stderr] warning: unexpected `cfg` condition value: `stable_graph`
[INFO] [stderr]    --> tests/algo/matching.rs:107:7
[INFO] [stderr]     |
[INFO] [stderr] 107 | #[cfg(feature = "stable_graph")]
[INFO] [stderr]     |       ^^^^^^^^^^^^^^^^^^^^^^^^ help: remove the condition
[INFO] [stderr]     |
[INFO] [stderr]     = note: no expected values for `feature`
[INFO] [stderr]     = help: consider adding `stable_graph` as a feature in `Cargo.toml`
[INFO] [stderr]     = note: see <https://doc.rust-lang.org/nightly/rustc/check-cfg/cargo-specifics.html> for more information about checking conditional configuration
[INFO] [stderr]     = note: `#[warn(unexpected_cfgs)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unexpected `cfg` condition value: `stable_graph`
[INFO] [stderr]    --> tests/algo/matching.rs:132:7
[INFO] [stdout] warning: unused import: `rust_collections::graph::visit::IntoNeighborsDirected`
[INFO] [stdout]  --> tests/algo/isomorphism.rs:7:5
[INFO] [stdout]   |
[INFO] [stdout] 7 | use rust_collections::graph::visit::IntoNeighborsDirected;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Direction`
[INFO] [stdout]  --> tests/algo/isomorphism.rs:8:41
[INFO] [stdout]   |
[INFO] [stdout] 8 | use rust_collections::graph::{Directed, Direction, GraphType, UnDirected};
[INFO] [stdout]   |                                         ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unexpected `cfg` condition value: `stable_graph`
[INFO] [stdout]    --> tests/algo/matching.rs:107:7
[INFO] [stdout]     |
[INFO] [stdout] 107 | #[cfg(feature = "stable_graph")]
[INFO] [stdout]     |       ^^^^^^^^^^^^^^^^^^^^^^^^ help: remove the condition
[INFO] [stdout]     |
[INFO] [stdout]     = note: no expected values for `feature`
[INFO] [stdout]     = help: consider adding `stable_graph` as a feature in `Cargo.toml`
[INFO] [stdout]     = note: see <https://doc.rust-lang.org/nightly/rustc/check-cfg/cargo-specifics.html> for more information about checking conditional configuration
[INFO] [stdout]     = note: `#[warn(unexpected_cfgs)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unexpected `cfg` condition value: `stable_graph`
[INFO] [stdout]    --> tests/algo/matching.rs:132:7
[INFO] [stdout]     |
[INFO] [stdout] 132 | #[cfg(feature = "stable_graph")]
[INFO] [stdout]     |       ^^^^^^^^^^^^^^^^^^^^^^^^ help: remove the condition
[INFO] [stdout]     |
[INFO] [stdout]     = note: no expected values for `feature`
[INFO] [stdout]     = help: consider adding `stable_graph` as a feature in `Cargo.toml`
[INFO] [stdout]     = note: see <https://doc.rust-lang.org/nightly/rustc/check-cfg/cargo-specifics.html> for more information about checking conditional configuration
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     |
[INFO] [stderr] 132 | #[cfg(feature = "stable_graph")]
[INFO] [stderr]     |       ^^^^^^^^^^^^^^^^^^^^^^^^ help: remove the condition
[INFO] [stderr]     |
[INFO] [stderr]     = note: no expected values for `feature`
[INFO] [stderr]     = help: consider adding `stable_graph` as a feature in `Cargo.toml`
[INFO] [stderr]     = note: see <https://doc.rust-lang.org/nightly/rustc/check-cfg/cargo-specifics.html> for more information about checking conditional configuration
[INFO] [stderr] 
[INFO] [stderr] error: aborting due to 5 previous errors; 2 warnings emitted
[INFO] [stderr] 
[INFO] [stderr] For more information about this error, try `rustc --explain E0658`.
[INFO] [stderr] Original diagnostics will follow.
[INFO] [stderr] 
[INFO] [stdout] warning: the `expr` fragment specifier will accept more expressions in the 2024 edition
[INFO] [stdout]  --> tests/algo/matching.rs:9:14
[INFO] [stdout]   |
[INFO] [stdout] 9 |     ($actual:expr, [$($expected:expr),+]) => {
[INFO] [stdout]   |              ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = warning: this changes meaning in Rust 2024
[INFO] [stdout]   = note: for more information, see Migration Guide <https://doc.rust-lang.org/nightly/edition-guide/rust-2024/macro-fragment-specifiers.html>
[INFO] [stdout]   = note: `--force-warn edition-2024-expr-fragment-specifier` implied by `--force-warn rust-2024-compatibility`
[INFO] [stdout] help: to keep the existing behavior, use the `expr_2021` fragment specifier
[INFO] [stdout]   |
[INFO] [stdout] 9 |     ($actual:expr_2021, [$($expected:expr),+]) => {
[INFO] [stdout]   |              ~~~~~~~~~
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: the `expr` fragment specifier will accept more expressions in the 2024 edition
[INFO] [stdout]  --> tests/algo/matching.rs:9:33
[INFO] [stdout]   |
[INFO] [stdout] 9 |     ($actual:expr, [$($expected:expr),+]) => {
[INFO] [stdout]   |                                 ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = warning: this changes meaning in Rust 2024
[INFO] [stdout]   = note: for more information, see Migration Guide <https://doc.rust-lang.org/nightly/edition-guide/rust-2024/macro-fragment-specifiers.html>
[INFO] [stdout] help: to keep the existing behavior, use the `expr_2021` fragment specifier
[INFO] [stdout]   |
[INFO] [stdout] 9 |     ($actual:expr, [$($expected:expr_2021),+]) => {
[INFO] [stdout]   |                                 ~~~~~~~~~
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: the `expr` fragment specifier will accept more expressions in the 2024 edition
[INFO] [stdout]   --> tests/algo/matching.rs:23:17
[INFO] [stdout]    |
[INFO] [stdout] 23 |     ($(($source:expr, $target:expr)),+) => {
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = warning: this changes meaning in Rust 2024
[INFO] [stdout]    = note: for more information, see Migration Guide <https://doc.rust-lang.org/nightly/edition-guide/rust-2024/macro-fragment-specifiers.html>
[INFO] [stdout] help: to keep the existing behavior, use the `expr_2021` fragment specifier
[INFO] [stdout]    |
[INFO] [stdout] 23 |     ($(($source:expr_2021, $target:expr)),+) => {
[INFO] [stdout]    |                 ~~~~~~~~~
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: the `expr` fragment specifier will accept more expressions in the 2024 edition
[INFO] [stdout]   --> tests/algo/matching.rs:23:31
[INFO] [stdout]    |
[INFO] [stdout] 23 |     ($(($source:expr, $target:expr)),+) => {
[INFO] [stdout]    |                               ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = warning: this changes meaning in Rust 2024
[INFO] [stdout]    = note: for more information, see Migration Guide <https://doc.rust-lang.org/nightly/edition-guide/rust-2024/macro-fragment-specifiers.html>
[INFO] [stdout] help: to keep the existing behavior, use the `expr_2021` fragment specifier
[INFO] [stdout]    |
[INFO] [stdout] 23 |     ($(($source:expr, $target:expr_2021)),+) => {
[INFO] [stdout]    |                               ~~~~~~~~~
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: the `expr` fragment specifier will accept more expressions in the 2024 edition
[INFO] [stdout]   --> tests/algo/matching.rs:32:14
[INFO] [stdout]    |
[INFO] [stdout] 32 |     ($($elem:expr),+) => {
[INFO] [stdout]    |              ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = warning: this changes meaning in Rust 2024
[INFO] [stdout]    = note: for more information, see Migration Guide <https://doc.rust-lang.org/nightly/edition-guide/rust-2024/macro-fragment-specifiers.html>
[INFO] [stdout] help: to keep the existing behavior, use the `expr_2021` fragment specifier
[INFO] [stdout]    |
[INFO] [stdout] 32 |     ($($elem:expr_2021),+) => {
[INFO] [stdout]    |              ~~~~~~~~~
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 9 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]        Fixed benches/common/factory.rs (1 fix)
[INFO] [stderr]    Migrating tests/store/main.rs from 2021 edition to 2024
[INFO] [stderr] error: failed to migrate to next edition
[INFO] [stderr] 
[INFO] [stderr] Caused by:
[INFO] [stderr]   process didn't exit successfully: `cargo fix --edition --allow-no-vcs --allow-dirty --frozen --all --all-targets --message-format=json` (exit status: 101)
[INFO] running `Command { std: "docker" "inspect" "a8e74b4dea64031567b8f5ff3c472e03a756e10e03311fc31fde0c2612359b66", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "a8e74b4dea64031567b8f5ff3c472e03a756e10e03311fc31fde0c2612359b66", kill_on_drop: false }`
[INFO] [stdout] a8e74b4dea64031567b8f5ff3c472e03a756e10e03311fc31fde0c2612359b66