[INFO] cloning repository https://github.com/fraggdiller/mp_lab_ii [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/fraggdiller/mp_lab_ii" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ffraggdiller%2Fmp_lab_ii", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ffraggdiller%2Fmp_lab_ii'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 5d630f0cd51c5f59ce9d1d4abffc404d481a8fab [INFO] checking fraggdiller/mp_lab_ii/5d630f0cd51c5f59ce9d1d4abffc404d481a8fab against try#ccf408f4326a858c00dd845a64a86b16f360a801 for pr-129466-2 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ffraggdiller%2Fmp_lab_ii" "/workspace/builds/worker-6-tc2/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-6-tc2/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/fraggdiller/mp_lab_ii 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/fraggdiller/mp_lab_ii [INFO] finished tweaking git repo https://github.com/fraggdiller/mp_lab_ii [INFO] tweaked toml for git repo https://github.com/fraggdiller/mp_lab_ii written to /workspace/builds/worker-6-tc2/source/Cargo.toml [INFO] crate git repo https://github.com/fraggdiller/mp_lab_ii 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-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-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:6252d7ea7fb8caaf7af6d800c5fb250a9cd862b9a7f9508afb3c54fa7fe1102e" "/opt/rustwide/cargo-home/bin/cargo" "+ccf408f4326a858c00dd845a64a86b16f360a801" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] ade79d70a547b1c16adaa2692b0edb70432510db801b1fb3fa55fa9418a3bf30 [INFO] running `Command { std: "docker" "start" "-a" "ade79d70a547b1c16adaa2692b0edb70432510db801b1fb3fa55fa9418a3bf30", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "ade79d70a547b1c16adaa2692b0edb70432510db801b1fb3fa55fa9418a3bf30", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "ade79d70a547b1c16adaa2692b0edb70432510db801b1fb3fa55fa9418a3bf30", kill_on_drop: false }` [INFO] [stdout] ade79d70a547b1c16adaa2692b0edb70432510db801b1fb3fa55fa9418a3bf30 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6-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:6252d7ea7fb8caaf7af6d800c5fb250a9cd862b9a7f9508afb3c54fa7fe1102e" "/opt/rustwide/cargo-home/bin/cargo" "+ccf408f4326a858c00dd845a64a86b16f360a801" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 6a2acebb1fb9d2135ea59cbefbeabd1b3b726c550b8a952142ea1705bb0a0163 [INFO] running `Command { std: "docker" "start" "-a" "6a2acebb1fb9d2135ea59cbefbeabd1b3b726c550b8a952142ea1705bb0a0163", 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 mp_lab_ii v0.1.0 (/tmp/fixit) [INFO] [stderr] Migrating src/main.rs from 2021 edition to 2024 [INFO] [stderr] Fixed src/lr_1/test_queue.rs (1 fix) [INFO] [stderr] Fixed src/lr_5/mod.rs (2 fixes) [INFO] [stderr] Fixed src/lr_4/test_hash_map.rs (1 fix) [INFO] [stdout] warning: unused import: `priority_queue::PriorityQueue` [INFO] [stdout] --> src/lr_1/mod.rs:4:9 [INFO] [stdout] | [INFO] [stdout] 4 | pub use priority_queue::PriorityQueue; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `hash_map::HashMap` [INFO] [stdout] --> src/lr_4/mod.rs:4:9 [INFO] [stdout] | [INFO] [stdout] 4 | pub use hash_map::HashMap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `PriorityQueue` is never constructed [INFO] [stdout] --> src/lr_1/priority_queue.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct PriorityQueue [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `is_empty`, `size`, `push`, `pop`, and `peek` are never used [INFO] [stdout] --> src/lr_1/priority_queue.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 13 | / impl PriorityQueue [INFO] [stdout] 14 | | where [INFO] [stdout] 15 | | T: Ord, [INFO] [stdout] | |_______________- associated items in this implementation [INFO] [stdout] ... [INFO] [stdout] 25 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | pub fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | pub fn push(&mut self, item: T) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 87 | pub fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 103 | pub fn peek(&self) -> Option<&T> { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple methods are never used [INFO] [stdout] --> src/lr_2/base.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 6 | pub trait TreeNode { [INFO] [stdout] | -------- methods in this trait [INFO] [stdout] ... [INFO] [stdout] 11 | fn get_data(&self) -> T; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] 12 | [INFO] [stdout] 13 | fn get_height(&self) -> u32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | fn get_min(&self) -> T { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 31 | fn get_max(&self) -> T { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn count_leaves(&self) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | fn count_nodes(&self) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | fn traverse_inorder(&self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | fn traverse_preorder(&self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn traverse_postorder(&self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 90 | fn contain(&self, value: T) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple methods are never used [INFO] [stdout] --> src/lr_2/base.rs:112:8 [INFO] [stdout] | [INFO] [stdout] 109 | pub trait Tree> { [INFO] [stdout] | ---- methods in this trait [INFO] [stdout] ... [INFO] [stdout] 112 | fn insert(&mut self, data: T); [INFO] [stdout] | ^^^^^^ [INFO] [stdout] 113 | [INFO] [stdout] 114 | fn delete(&mut self, data: T); [INFO] [stdout] | ^^^^^^ [INFO] [stdout] 115 | [INFO] [stdout] 116 | fn print_tree(&self); [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 138 | fn get_height(&self) -> u32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 165 | fn get_min(&self) -> Option { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 192 | fn get_max(&self) -> Option { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 215 | fn count_leaves(&self) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 237 | fn count_nodes(&self) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 269 | fn traverse_inorder(&self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 302 | fn traverse_preorder(&self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 335 | fn traverse_postorder(&self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 365 | fn contain(&self, value: T) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `clear` are never used [INFO] [stdout] --> src/lr_2/rbtree.rs:113:12 [INFO] [stdout] | [INFO] [stdout] 109 | impl RBTree { [INFO] [stdout] | ------------------------------------- associated items in this implementation [INFO] [stdout] ... [INFO] [stdout] 113 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 508 | pub fn clear(&mut self) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new` and `clear` are never used [INFO] [stdout] --> src/lr_3/btree.rs:209:12 [INFO] [stdout] | [INFO] [stdout] 208 | impl BSTree { [INFO] [stdout] | ----------------------------------- associated items in this implementation [INFO] [stdout] 209 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 215 | pub fn clear(&mut self) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple methods are never used [INFO] [stdout] --> src/lr_3/base.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 6 | pub trait TreeNode { [INFO] [stdout] | -------- methods in this trait [INFO] [stdout] ... [INFO] [stdout] 13 | fn get_height(&self) -> u32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 31 | fn get_max(&self) -> T { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn count_leaves(&self) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | fn count_nodes(&self) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | fn traverse_inorder(&self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 70 | fn traverse_preorder(&self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn traverse_postorder(&self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple methods are never used [INFO] [stdout] --> src/lr_3/base.rs:112:8 [INFO] [stdout] | [INFO] [stdout] 109 | pub trait Tree> { [INFO] [stdout] | ---- methods in this trait [INFO] [stdout] ... [INFO] [stdout] 112 | fn insert(&mut self, data: T); [INFO] [stdout] | ^^^^^^ [INFO] [stdout] 113 | [INFO] [stdout] 114 | fn delete(&mut self, data: T); [INFO] [stdout] | ^^^^^^ [INFO] [stdout] 115 | [INFO] [stdout] 116 | fn print_tree(&self); [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 138 | fn get_height(&self) -> u32 { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 165 | fn get_min(&self) -> Option { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 192 | fn get_max(&self) -> Option { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 215 | fn count_leaves(&self) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 237 | fn count_nodes(&self) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 269 | fn traverse_inorder(&self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 302 | fn traverse_preorder(&self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 335 | fn traverse_postorder(&self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 388 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `HashMap` is never constructed [INFO] [stdout] --> src/lr_4/hash_map.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct HashMap { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/lr_4/hash_map.rs:21:12 [INFO] [stdout] | [INFO] [stdout] 12 | impl HashMap { [INFO] [stdout] | ----------------------------------- associated items in this implementation [INFO] [stdout] ... [INFO] [stdout] 21 | pub fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 31 | fn initialize_buckets(mut self, capacity: usize) -> Self { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 47 | pub fn insert(&mut self, key: K, value: V) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | pub fn remove(&mut self, key: &K) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 95 | pub fn get(&self, key: &K) -> Option<&V> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 104 | fn current_load_factor(&self) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 110 | fn rehash(&mut self, new_size: usize) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 136 | fn resize(&mut self) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 148 | fn get_index(&self, key: &K) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 156 | fn get_index_for_key(&self, key: &K, size: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Edge` is never constructed [INFO] [stdout] --> src/lr_5/graph_a.rs:5:12 [INFO] [stdout] | [INFO] [stdout] 5 | pub struct Edge { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Edge` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `DisjointSet` is never constructed [INFO] [stdout] --> src/lr_5/graph_a.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | struct DisjointSet { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `find`, and `union` are never used [INFO] [stdout] --> src/lr_5/graph_a.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 15 | impl DisjointSet { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 16 | pub fn new(size: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 23 | pub fn find(&mut self, node: usize) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn union(&mut self, node1: usize, node2: usize) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Graph` is never constructed [INFO] [stdout] --> src/lr_5/graph_a.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 47 | pub struct Graph { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/lr_5/graph_a.rs:52:12 [INFO] [stdout] | [INFO] [stdout] 51 | impl Graph { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 52 | pub fn new(adj_list: Vec>) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 56 | pub fn dfs(&self, start: usize, visited: &mut Vec) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | pub fn bfs(&self, start: usize) -> Vec { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 86 | pub fn dijkstra(&self, start: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 112 | pub fn kruskal(&self) -> Vec { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 134 | pub fn prim(&self, start: usize) -> Vec { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 169 | pub fn floyd_warshall(&self) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Edge` is never constructed [INFO] [stdout] --> src/lr_5/graph_b.rs:2:12 [INFO] [stdout] | [INFO] [stdout] 2 | pub struct Edge { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Edge` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Graph` is never constructed [INFO] [stdout] --> src/lr_5/graph_b.rs:8:12 [INFO] [stdout] | [INFO] [stdout] 8 | pub struct Graph { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Graph` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `KosarajuGraph` is never constructed [INFO] [stdout] --> src/lr_5/graph_b.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 15 | pub struct KosarajuGraph { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_edge`, `dfs`, `dfs_scc`, and `kosaraju` are never used [INFO] [stdout] --> src/lr_5/graph_b.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 21 | impl KosarajuGraph { [INFO] [stdout] | ------------------ associated items in this implementation [INFO] [stdout] 22 | pub fn new(vertices: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn add_edge(&mut self, u: usize, v: usize) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 35 | pub fn dfs(&self, node: usize, visited: &mut Vec, stack: &mut Vec) { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn dfs_scc(&self, node: usize, visited: &mut Vec, scc: &mut Vec) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | pub fn kosaraju(&self) -> Vec> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/lr_5/graph_b.rs:82:12 [INFO] [stdout] | [INFO] [stdout] 81 | impl Graph { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] 82 | pub fn new(vertices: usize, adj_list: Vec>, is_directed: bool) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 98 | fn dfs_topological(&self, node: usize, visited: &mut Vec, stack: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 108 | pub fn tarjan_topological_sort(&self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 126 | fn is_eulerian(&self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 137 | fn remove_edge(&mut self, u: usize, v: usize) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 144 | pub fn fleury_algorithm(&mut self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 162 | pub fn find_eulerian_cycle(&mut self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `MODULUS` is never used [INFO] [stdout] --> src/lr_6/substring.rs:3:7 [INFO] [stdout] | [INFO] [stdout] 3 | const MODULUS: u16 = 101; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `BASE` is never used [INFO] [stdout] --> src/lr_6/substring.rs:4:7 [INFO] [stdout] | [INFO] [stdout] 4 | const BASE: u16 = 256; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `boyer_moore_search` is never used [INFO] [stdout] --> src/lr_6/substring.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | pub fn boyer_moore_search(text: &str, pattern: &str) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `hash` is never used [INFO] [stdout] --> src/lr_6/substring.rs:49:4 [INFO] [stdout] | [INFO] [stdout] 49 | fn hash(s: &str) -> u16 { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `recalculate_hash` is never used [INFO] [stdout] --> src/lr_6/substring.rs:57:4 [INFO] [stdout] | [INFO] [stdout] 57 | fn recalculate_hash( [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `rabin_karp_search` is never used [INFO] [stdout] --> src/lr_6/substring.rs:74:8 [INFO] [stdout] | [INFO] [stdout] 74 | pub fn rabin_karp_search(target: &str, pattern: &str) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `compute_lps` is never used [INFO] [stdout] --> src/lr_6/substring.rs:104:4 [INFO] [stdout] | [INFO] [stdout] 104 | fn compute_lps(pattern: &str) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `knuth_morris_pratt_search` is never used [INFO] [stdout] --> src/lr_6/substring.rs:120:8 [INFO] [stdout] | [INFO] [stdout] 120 | pub fn knuth_morris_pratt_search(text: &str, pattern: &str) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: `if let` assigns a shorter lifetime since Edition 2024 [INFO] [stdout] --> src/lr_4/hash_map.rs:75:15 [INFO] [stdout] | [INFO] [stdout] 75 | while let Some((node_key, node_value)) = bucket.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 [INFO] [stdout] help: the value is now dropped here in Edition 2024 [INFO] [stdout] --> src/lr_4/hash_map.rs:81:9 [INFO] [stdout] | [INFO] [stdout] 81 | } [INFO] [stdout] | ^ [INFO] [stdout] = note: `--force-warn if-let-rescope` implied by `--force-warn rust-2024-compatibility` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 31 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0432]: unresolved imports `crate::lr_5::Edge`, `crate::lr_5::Graph` [INFO] [stdout] --> src/lr_5/test_graph_a.rs:3:23 [INFO] [stdout] | [INFO] [stdout] 3 | use crate::lr_5::{Edge, Graph}; [INFO] [stdout] | ^^^^ ^^^^^ no `Graph` in `lr_5` [INFO] [stdout] | | [INFO] [stdout] | no `Edge` in `lr_5` [INFO] [stdout] | [INFO] [stdout] = help: consider importing one of these structs instead: [INFO] [stdout] crate::lr_5::graph_a::Edge [INFO] [stdout] crate::lr_5::graph_b::Edge [INFO] [stdout] = help: consider importing one of these structs instead: [INFO] [stdout] crate::lr_5::graph_a::Graph [INFO] [stdout] crate::lr_5::graph_b::Graph [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0432]: unresolved imports `crate::lr_5::EdgeB`, `crate::lr_5::GraphB`, `crate::lr_5::KosarajuGraph` [INFO] [stdout] --> src/lr_5/test_graph_b.rs:3:23 [INFO] [stdout] | [INFO] [stdout] 3 | use crate::lr_5::{EdgeB as Edge, GraphB as Graph, KosarajuGraph}; [INFO] [stdout] | ^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^ no `KosarajuGraph` in `lr_5` [INFO] [stdout] | | | [INFO] [stdout] | | no `GraphB` in `lr_5` [INFO] [stdout] | no `EdgeB` in `lr_5` [INFO] [stdout] | [INFO] [stdout] = help: consider importing this struct instead: [INFO] [stdout] crate::lr_5::graph_b::KosarajuGraph [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0412]: cannot find type `PriorityQueue` in this scope [INFO] [stdout] --> src/lr_1/test_queue.rs:9:21 [INFO] [stdout] | [INFO] [stdout] 9 | let mut pq: PriorityQueue = PriorityQueue::new(); [INFO] [stdout] | ^^^^^^^^^^^^^ not found in this scope [INFO] [stdout] | [INFO] [stdout] help: consider importing this struct through its public re-export [INFO] [stdout] | [INFO] [stdout] 5 + use crate::lr_1::PriorityQueue; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0433]: failed to resolve: use of undeclared type `PriorityQueue` [INFO] [stdout] --> src/lr_1/test_queue.rs:9:42 [INFO] [stdout] | [INFO] [stdout] 9 | let mut pq: PriorityQueue = PriorityQueue::new(); [INFO] [stdout] | ^^^^^^^^^^^^^ use of undeclared type `PriorityQueue` [INFO] [stdout] | [INFO] [stdout] help: consider importing this struct through its public re-export [INFO] [stdout] | [INFO] [stdout] 5 + use crate::lr_1::PriorityQueue; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0412]: cannot find type `HashMap` in this scope [INFO] [stdout] --> src/lr_4/test_hash_map.rs:8:22 [INFO] [stdout] | [INFO] [stdout] 8 | let mut map: HashMap<&str, &str> = HashMap::new(); [INFO] [stdout] | ^^^^^^^ not found in this scope [INFO] [stdout] | [INFO] [stdout] help: consider importing one of these structs [INFO] [stdout] | [INFO] [stdout] 4 + use crate::lr_4::HashMap; [INFO] [stdout] | [INFO] [stdout] 4 + use std::collections::HashMap; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0433]: failed to resolve: use of undeclared type `HashMap` [INFO] [stdout] --> src/lr_4/test_hash_map.rs:8:44 [INFO] [stdout] | [INFO] [stdout] 8 | let mut map: HashMap<&str, &str> = HashMap::new(); [INFO] [stdout] | ^^^^^^^ use of undeclared type `HashMap` [INFO] [stdout] | [INFO] [stdout] help: consider importing one of these structs [INFO] [stdout] | [INFO] [stdout] 4 + use crate::lr_4::HashMap; [INFO] [stdout] | [INFO] [stdout] 4 + use std::collections::HashMap; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/lr_1/test_queue.rs:5:9 [INFO] [stdout] | [INFO] [stdout] 5 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `priority_queue::PriorityQueue` [INFO] [stdout] --> src/lr_1/mod.rs:4:9 [INFO] [stdout] | [INFO] [stdout] 4 | pub use priority_queue::PriorityQueue; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/lr_4/test_hash_map.rs:4:9 [INFO] [stdout] | [INFO] [stdout] 4 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `hash_map::HashMap` [INFO] [stdout] --> src/lr_4/mod.rs:4:9 [INFO] [stdout] | [INFO] [stdout] 4 | pub use hash_map::HashMap; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [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, E0432, E0433. [INFO] [stdout] [INFO] [stdout] For more information about an error, try `rustc --explain E0412`. [INFO] [stdout] [INFO] [stderr] error: could not compile `mp_lab_ii` (bin "mp_lab_ii" test) due to 7 previous errors; 4 warnings emitted [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" "6a2acebb1fb9d2135ea59cbefbeabd1b3b726c550b8a952142ea1705bb0a0163", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "6a2acebb1fb9d2135ea59cbefbeabd1b3b726c550b8a952142ea1705bb0a0163", kill_on_drop: false }` [INFO] [stdout] 6a2acebb1fb9d2135ea59cbefbeabd1b3b726c550b8a952142ea1705bb0a0163