[INFO] cloning repository https://github.com/lavrxxx/leetcode [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/lavrxxx/leetcode" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Flavrxxx%2Fleetcode", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Flavrxxx%2Fleetcode'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 7c9614453b2ccc8f91a1c5bf02f6f9ed44a8c6f3 [INFO] testing lavrxxx/leetcode against try#c3758fdc4730d7700b25a13cccff296a08f42c00 for pr-91743 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Flavrxxx%2Fleetcode" "/workspace/builds/worker-2/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-2/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/lavrxxx/leetcode on toolchain c3758fdc4730d7700b25a13cccff296a08f42c00 [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+c3758fdc4730d7700b25a13cccff296a08f42c00" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/lavrxxx/leetcode [INFO] finished tweaking git repo https://github.com/lavrxxx/leetcode [INFO] tweaked toml for git repo https://github.com/lavrxxx/leetcode written to /workspace/builds/worker-2/source/Cargo.toml [INFO] crate git repo https://github.com/lavrxxx/leetcode already has a lockfile, it will not be regenerated [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+c3758fdc4730d7700b25a13cccff296a08f42c00" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/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:d190cb871061d98bc6d0581d85cb2ecb09a0f8a142ba5463de30be9999fc3251" "/opt/rustwide/cargo-home/bin/cargo" "+c3758fdc4730d7700b25a13cccff296a08f42c00" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 29de9018c89b2d2ccfd18f8b3ea286e92ecc5b87078011f04ec230bcccc3f655 [INFO] running `Command { std: "docker" "start" "-a" "29de9018c89b2d2ccfd18f8b3ea286e92ecc5b87078011f04ec230bcccc3f655", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "29de9018c89b2d2ccfd18f8b3ea286e92ecc5b87078011f04ec230bcccc3f655", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "29de9018c89b2d2ccfd18f8b3ea286e92ecc5b87078011f04ec230bcccc3f655", kill_on_drop: false }` [INFO] [stdout] 29de9018c89b2d2ccfd18f8b3ea286e92ecc5b87078011f04ec230bcccc3f655 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/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" "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:d190cb871061d98bc6d0581d85cb2ecb09a0f8a142ba5463de30be9999fc3251" "/opt/rustwide/cargo-home/bin/cargo" "+c3758fdc4730d7700b25a13cccff296a08f42c00" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] dae5f29d216dd0d6c459a09189fbdecc50348031625cbca9195648d0ab0f26b9 [INFO] running `Command { std: "docker" "start" "-a" "dae5f29d216dd0d6c459a09189fbdecc50348031625cbca9195648d0ab0f26b9", kill_on_drop: false }` [INFO] [stderr] Compiling libc v0.2.124 [INFO] [stderr] Compiling autocfg v1.1.0 [INFO] [stderr] Compiling cfg-if v1.0.0 [INFO] [stderr] Compiling ppv-lite86 v0.2.16 [INFO] [stderr] Compiling quicksort v0.1.0 (/opt/rustwide/workdir/algorithms/quicksort) [INFO] [stderr] Compiling n_125_valid_palindrome v0.1.0 (/opt/rustwide/workdir/problems/n_125_valid_palindrome) [INFO] [stderr] Compiling sum_array v0.1.0 (/opt/rustwide/workdir/algorithms/sum_array) [INFO] [stderr] Compiling n_9_palindrome_number v0.1.0 (/opt/rustwide/workdir/problems/n_9_palindrome_number) [INFO] [stderr] Compiling binary_search v0.1.0 (/opt/rustwide/workdir/algorithms/binary_search) [INFO] [stderr] Compiling hash_table v0.1.0 (/opt/rustwide/workdir/algorithms/hash_table) [INFO] [stderr] Compiling selection_sort v0.1.0 (/opt/rustwide/workdir/algorithms/selection_sort) [INFO] [stderr] Compiling find_max_size_square_plots v0.1.0 (/opt/rustwide/workdir/algorithms/find_max_size_square_plots) [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> problems/n_9_palindrome_number/src/lib.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome` [INFO] [stdout] --> problems/n_9_palindrome_number/src/lib.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn is_palindrome(mut x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 2 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `find` [INFO] [stdout] --> algorithms/find_max_size_square_plots/src/lib.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn find(height: u128, width: u128) -> u128 { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `Type` [INFO] [stdout] --> algorithms/sum_array/src/lib.rs:1:1 [INFO] [stdout] | [INFO] [stdout] 1 | type Type = i128; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `sum_recursive_dc` [INFO] [stdout] --> algorithms/sum_array/src/lib.rs:4:4 [INFO] [stdout] | [INFO] [stdout] 4 | fn sum_recursive_dc(v: Vec) -> Type { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `sum` [INFO] [stdout] --> algorithms/sum_array/src/lib.rs:11:4 [INFO] [stdout] | [INFO] [stdout] 11 | fn sum(v: Vec) -> Type { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `Type` [INFO] [stdout] --> algorithms/selection_sort/src/lib.rs:1:1 [INFO] [stdout] | [INFO] [stdout] 1 | type Type = u128; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `selection_sort` [INFO] [stdout] --> algorithms/selection_sort/src/lib.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn selection_sort(mut v: Vec, asc: bool) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `find_extremum` [INFO] [stdout] --> algorithms/selection_sort/src/lib.rs:16:4 [INFO] [stdout] | [INFO] [stdout] 16 | fn find_extremum(v: Vec, asc: bool) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 1 warning emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `binary_search` [INFO] [stdout] --> algorithms/binary_search/src/lib.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn binary_search(v: Vec, target: u128) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 3 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `binary_search_recursive` [INFO] [stdout] --> algorithms/binary_search/src/lib.rs:24:4 [INFO] [stdout] | [INFO] [stdout] 24 | fn binary_search_recursive(v: Vec, target: u128, start: usize, stop: usize) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 3 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 2 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant is never used: `SIZE` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:1:1 [INFO] [stdout] | [INFO] [stdout] 1 | const SIZE: usize = 10; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `HashFn` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:3:1 [INFO] [stdout] | [INFO] [stdout] 3 | type HashFn = Box usize>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `key` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | key: String, [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `Value` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:7:10 [INFO] [stdout] | [INFO] [stdout] 7 | #[derive(Debug)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `data` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 10 | data: DataType, [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `Value` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:7:10 [INFO] [stdout] | [INFO] [stdout] 7 | #[derive(Debug)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | fn new(key: &str, data: DataType) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `HashTable` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct HashTable { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | fn new(hash_fn: HashFn) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `insert` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:36:8 [INFO] [stdout] | [INFO] [stdout] 36 | fn insert(&mut self, key: &str, data: DataType) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | fn get(&self, key: &str) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `delete` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 61 | fn delete(&mut self, key: &str) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `load_factor` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:72:8 [INFO] [stdout] | [INFO] [stdout] 72 | fn load_factor(&self) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `hash_fn_mod` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:84:4 [INFO] [stdout] | [INFO] [stdout] 84 | fn hash_fn_mod(data: &str) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `quicksort` [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:11:4 [INFO] [stdout] | [INFO] [stdout] 11 | fn quicksort(mut v: Vec, asc: bool, partition: Box) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `quicksort_recursive` [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:129:4 [INFO] [stdout] | [INFO] [stdout] 129 | fn quicksort_recursive(mut v: Vec, asc: bool) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `choose_sub_array` [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:159:4 [INFO] [stdout] | [INFO] [stdout] 159 | fn choose_sub_array( [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `swap` [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:187:4 [INFO] [stdout] | [INFO] [stdout] 187 | fn swap(v: &mut Vec, i1: usize, i2: usize, asc: bool) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> problems/n_125_valid_palindrome/src/lib.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome` [INFO] [stdout] --> problems/n_125_valid_palindrome/src/lib.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn is_palindrome(str: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `check_palindrome` [INFO] [stdout] --> problems/n_125_valid_palindrome/src/lib.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | fn check_palindrome(str: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 3 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 12 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 4 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling num-traits v0.2.14 [INFO] [stderr] Compiling num-integer v0.1.45 [INFO] [stderr] Compiling getrandom v0.2.6 [INFO] [stderr] Compiling time v0.1.43 [INFO] [stderr] Compiling rand_core v0.6.3 [INFO] [stderr] Compiling rand_chacha v0.3.1 [INFO] [stderr] Compiling rand v0.8.5 [INFO] [stderr] Compiling graph v0.1.0 (/opt/rustwide/workdir/algorithms/graph) [INFO] [stderr] Compiling chrono v0.4.19 [INFO] [stdout] warning: enum is never used: `ActResult` [INFO] [stdout] --> algorithms/graph/src/lib.rs:11:6 [INFO] [stdout] | [INFO] [stdout] 11 | enum ActResult { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> algorithms/graph/src/lib.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | fn new(name: NodeName, data: T) -> Link { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_edge` [INFO] [stdout] --> algorithms/graph/src/lib.rs:38:8 [INFO] [stdout] | [INFO] [stdout] 38 | fn add_edge(&mut self, node: Link, weight: Weight) -> &mut Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `traverse_depth_first` [INFO] [stdout] --> algorithms/graph/src/lib.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | fn traverse_depth_first(&self, act: &F, seen: &mut HashSet) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `traverse_breadth_first` [INFO] [stdout] --> algorithms/graph/src/lib.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 57 | fn traverse_breadth_first(&self, act: &F, seen: &mut HashSet) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `breadth_first_search` [INFO] [stdout] --> algorithms/graph/src/lib.rs:92:4 [INFO] [stdout] | [INFO] [stdout] 92 | fn breadth_first_search(root: Link, target: &str) -> Option [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `print_node` [INFO] [stdout] --> algorithms/graph/src/lib.rs:110:4 [INFO] [stdout] | [INFO] [stdout] 110 | fn print_node(node: &Node) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `print_edge` [INFO] [stdout] --> algorithms/graph/src/lib.rs:121:4 [INFO] [stdout] | [INFO] [stdout] 121 | fn print_edge(edge: &Edge) -> ActResult { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `depth_first_topological_sort` [INFO] [stdout] --> algorithms/graph/src/lib.rs:135:4 [INFO] [stdout] | [INFO] [stdout] 135 | fn depth_first_topological_sort(root: Link) -> VecDeque> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `visit` [INFO] [stdout] --> algorithms/graph/src/lib.rs:160:4 [INFO] [stdout] | [INFO] [stdout] 160 | fn visit( [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `dijkstra` [INFO] [stdout] --> algorithms/graph/src/lib.rs:188:4 [INFO] [stdout] | [INFO] [stdout] 188 | fn dijkstra(root: Link) -> (HashMap, HashMap>>) [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `find_closest_node` [INFO] [stdout] --> algorithms/graph/src/lib.rs:231:4 [INFO] [stdout] | [INFO] [stdout] 231 | fn find_closest_node( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bellman_ford` [INFO] [stdout] --> algorithms/graph/src/lib.rs:249:4 [INFO] [stdout] | [INFO] [stdout] 249 | fn bellman_ford(root: Link) -> (HashMap, HashMap>>) [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 13 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling greedy v0.1.0 (/opt/rustwide/workdir/algorithms/greedy) [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> algorithms/greedy/src/lib.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | fn new(name: &str, start: &str, stop: &str) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `schedule_problem` [INFO] [stdout] --> algorithms/greedy/src/lib.rs:26:4 [INFO] [stdout] | [INFO] [stdout] 26 | fn schedule_problem(classes: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `set_covering_problem` [INFO] [stdout] --> algorithms/greedy/src/lib.rs:46:4 [INFO] [stdout] | [INFO] [stdout] 46 | fn set_covering_problem<'a>( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `salesperson_problem` [INFO] [stdout] --> algorithms/greedy/src/lib.rs:69:4 [INFO] [stdout] | [INFO] [stdout] 69 | fn salesperson_problem( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 4 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 3.65s [INFO] running `Command { std: "docker" "inspect" "dae5f29d216dd0d6c459a09189fbdecc50348031625cbca9195648d0ab0f26b9", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "dae5f29d216dd0d6c459a09189fbdecc50348031625cbca9195648d0ab0f26b9", kill_on_drop: false }` [INFO] [stdout] dae5f29d216dd0d6c459a09189fbdecc50348031625cbca9195648d0ab0f26b9 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/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" "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:d190cb871061d98bc6d0581d85cb2ecb09a0f8a142ba5463de30be9999fc3251" "/opt/rustwide/cargo-home/bin/cargo" "+c3758fdc4730d7700b25a13cccff296a08f42c00" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 913168cbe16c19b300b0e2d33b8e28c7812b153844cc395a958751c75bcc7700 [INFO] running `Command { std: "docker" "start" "-a" "913168cbe16c19b300b0e2d33b8e28c7812b153844cc395a958751c75bcc7700", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> problems/n_9_palindrome_number/src/lib.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome` [INFO] [stdout] --> problems/n_9_palindrome_number/src/lib.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn is_palindrome(mut x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 2 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `Type` [INFO] [stdout] --> algorithms/sum_array/src/lib.rs:1:1 [INFO] [stdout] | [INFO] [stdout] 1 | type Type = i128; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `sum_recursive_dc` [INFO] [stdout] --> algorithms/sum_array/src/lib.rs:4:4 [INFO] [stdout] | [INFO] [stdout] 4 | fn sum_recursive_dc(v: Vec) -> Type { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling quicksort v0.1.0 (/opt/rustwide/workdir/algorithms/quicksort) [INFO] [stdout] warning: function is never used: `sum` [INFO] [stdout] --> algorithms/sum_array/src/lib.rs:11:4 [INFO] [stdout] | [INFO] [stdout] 11 | fn sum(v: Vec) -> Type { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling hash_table v0.1.0 (/opt/rustwide/workdir/algorithms/hash_table) [INFO] [stdout] warning: 3 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling binary_search v0.1.0 (/opt/rustwide/workdir/algorithms/binary_search) [INFO] [stdout] warning: function is never used: `quicksort` [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:11:4 [INFO] [stdout] | [INFO] [stdout] 11 | fn quicksort(mut v: Vec, asc: bool, partition: Box) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `quicksort_recursive` [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:129:4 [INFO] [stdout] | [INFO] [stdout] 129 | fn quicksort_recursive(mut v: Vec, asc: bool) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `choose_sub_array` [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:159:4 [INFO] [stdout] | [INFO] [stdout] 159 | fn choose_sub_array( [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `swap` [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:187:4 [INFO] [stdout] | [INFO] [stdout] 187 | fn swap(v: &mut Vec, i1: usize, i2: usize, asc: bool) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 4 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `binary_search` [INFO] [stdout] --> algorithms/binary_search/src/lib.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn binary_search(v: Vec, target: u128) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `binary_search_recursive` [INFO] [stdout] --> algorithms/binary_search/src/lib.rs:24:4 [INFO] [stdout] | [INFO] [stdout] 24 | fn binary_search_recursive(v: Vec, target: u128, start: usize, stop: usize) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 2 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `Type` [INFO] [stdout] --> algorithms/selection_sort/src/lib.rs:1:1 [INFO] [stdout] | [INFO] [stdout] 1 | type Type = u128; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `selection_sort` [INFO] [stdout] --> algorithms/selection_sort/src/lib.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn selection_sort(mut v: Vec, asc: bool) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `find_extremum` [INFO] [stdout] --> algorithms/selection_sort/src/lib.rs:16:4 [INFO] [stdout] | [INFO] [stdout] 16 | fn find_extremum(v: Vec, asc: bool) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 3 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Solution` [INFO] [stdout] --> problems/n_125_valid_palindrome/src/lib.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_palindrome` [INFO] [stdout] --> problems/n_125_valid_palindrome/src/lib.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn is_palindrome(str: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `check_palindrome` [INFO] [stdout] --> problems/n_125_valid_palindrome/src/lib.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | fn check_palindrome(str: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 3 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `find` [INFO] [stdout] --> algorithms/find_max_size_square_plots/src/lib.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn find(height: u128, width: u128) -> u128 { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 1 warning emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant is never used: `SIZE` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:1:1 [INFO] [stdout] | [INFO] [stdout] 1 | const SIZE: usize = 10; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias is never used: `HashFn` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:3:1 [INFO] [stdout] | [INFO] [stdout] 3 | type HashFn = Box usize>; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `key` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | key: String, [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `Value` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:7:10 [INFO] [stdout] | [INFO] [stdout] 7 | #[derive(Debug)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `data` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 10 | data: DataType, [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `Value` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:7:10 [INFO] [stdout] | [INFO] [stdout] 7 | #[derive(Debug)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 14 | fn new(key: &str, data: DataType) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling n_9_palindrome_number v0.1.0 (/opt/rustwide/workdir/problems/n_9_palindrome_number) [INFO] [stdout] warning: struct is never constructed: `HashTable` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct HashTable { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | fn new(hash_fn: HashFn) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `insert` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:36:8 [INFO] [stdout] | [INFO] [stdout] 36 | fn insert(&mut self, key: &str, data: DataType) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:50:8 [INFO] [stdout] | [INFO] [stdout] 50 | fn get(&self, key: &str) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `delete` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:61:8 [INFO] [stdout] | [INFO] [stdout] 61 | fn delete(&mut self, key: &str) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `load_factor` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:72:8 [INFO] [stdout] | [INFO] [stdout] 72 | fn load_factor(&self) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `hash_fn_mod` [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:84:4 [INFO] [stdout] | [INFO] [stdout] 84 | fn hash_fn_mod(data: &str) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 12 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling sum_array v0.1.0 (/opt/rustwide/workdir/algorithms/sum_array) [INFO] [stderr] Compiling n_125_valid_palindrome v0.1.0 (/opt/rustwide/workdir/problems/n_125_valid_palindrome) [INFO] [stderr] Compiling selection_sort v0.1.0 (/opt/rustwide/workdir/algorithms/selection_sort) [INFO] [stderr] Compiling find_max_size_square_plots v0.1.0 (/opt/rustwide/workdir/algorithms/find_max_size_square_plots) [INFO] [stderr] Compiling graph v0.1.0 (/opt/rustwide/workdir/algorithms/graph) [INFO] [stderr] Compiling greedy v0.1.0 (/opt/rustwide/workdir/algorithms/greedy) [INFO] [stdout] warning: enum is never used: `ActResult` [INFO] [stdout] --> algorithms/graph/src/lib.rs:11:6 [INFO] [stdout] | [INFO] [stdout] 11 | enum ActResult { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> algorithms/graph/src/lib.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | fn new(name: NodeName, data: T) -> Link { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `add_edge` [INFO] [stdout] --> algorithms/graph/src/lib.rs:38:8 [INFO] [stdout] | [INFO] [stdout] 38 | fn add_edge(&mut self, node: Link, weight: Weight) -> &mut Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `traverse_depth_first` [INFO] [stdout] --> algorithms/graph/src/lib.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | fn traverse_depth_first(&self, act: &F, seen: &mut HashSet) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `traverse_breadth_first` [INFO] [stdout] --> algorithms/graph/src/lib.rs:57:8 [INFO] [stdout] | [INFO] [stdout] 57 | fn traverse_breadth_first(&self, act: &F, seen: &mut HashSet) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `breadth_first_search` [INFO] [stdout] --> algorithms/graph/src/lib.rs:92:4 [INFO] [stdout] | [INFO] [stdout] 92 | fn breadth_first_search(root: Link, target: &str) -> Option [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `print_node` [INFO] [stdout] --> algorithms/graph/src/lib.rs:110:4 [INFO] [stdout] | [INFO] [stdout] 110 | fn print_node(node: &Node) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `print_edge` [INFO] [stdout] --> algorithms/graph/src/lib.rs:121:4 [INFO] [stdout] | [INFO] [stdout] 121 | fn print_edge(edge: &Edge) -> ActResult { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `depth_first_topological_sort` [INFO] [stdout] --> algorithms/graph/src/lib.rs:135:4 [INFO] [stdout] | [INFO] [stdout] 135 | fn depth_first_topological_sort(root: Link) -> VecDeque> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `visit` [INFO] [stdout] --> algorithms/graph/src/lib.rs:160:4 [INFO] [stdout] | [INFO] [stdout] 160 | fn visit( [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `dijkstra` [INFO] [stdout] --> algorithms/graph/src/lib.rs:188:4 [INFO] [stdout] | [INFO] [stdout] 188 | fn dijkstra(root: Link) -> (HashMap, HashMap>>) [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `find_closest_node` [INFO] [stdout] --> algorithms/graph/src/lib.rs:231:4 [INFO] [stdout] | [INFO] [stdout] 231 | fn find_closest_node( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bellman_ford` [INFO] [stdout] --> algorithms/graph/src/lib.rs:249:4 [INFO] [stdout] | [INFO] [stdout] 249 | fn bellman_ford(root: Link) -> (HashMap, HashMap>>) [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 13 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> algorithms/greedy/src/lib.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | fn new(name: &str, start: &str, stop: &str) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `schedule_problem` [INFO] [stdout] --> algorithms/greedy/src/lib.rs:26:4 [INFO] [stdout] | [INFO] [stdout] 26 | fn schedule_problem(classes: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `set_covering_problem` [INFO] [stdout] --> algorithms/greedy/src/lib.rs:46:4 [INFO] [stdout] | [INFO] [stdout] 46 | fn set_covering_problem<'a>( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `salesperson_problem` [INFO] [stdout] --> algorithms/greedy/src/lib.rs:69:4 [INFO] [stdout] | [INFO] [stdout] 69 | fn salesperson_problem( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 4 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished test [unoptimized + debuginfo] target(s) in 1.10s [INFO] [stderr] Executable unittests src/lib.rs (/opt/rustwide/target/debug/deps/binary_search-8d940976bed97aab) [INFO] [stderr] Executable unittests src/lib.rs (/opt/rustwide/target/debug/deps/find_max_size_square_plots-fb18dc71861a2c36) [INFO] [stderr] Executable unittests src/lib.rs (/opt/rustwide/target/debug/deps/graph-5baf075123db2544) [INFO] [stderr] Executable unittests src/lib.rs (/opt/rustwide/target/debug/deps/greedy-e8df638b83d8a066) [INFO] [stderr] Executable unittests src/lib.rs (/opt/rustwide/target/debug/deps/hash_table-292fd1dde8992dc5) [INFO] [stderr] Executable unittests src/lib.rs (/opt/rustwide/target/debug/deps/n_125_valid_palindrome-57be7ce7c4b55d0f) [INFO] [stderr] Executable unittests src/lib.rs (/opt/rustwide/target/debug/deps/n_9_palindrome_number-cc0a86aca998e3d4) [INFO] [stderr] Executable unittests src/lib.rs (/opt/rustwide/target/debug/deps/quicksort-e72744b2c8c6eeb6) [INFO] [stderr] Executable unittests src/lib.rs (/opt/rustwide/target/debug/deps/selection_sort-db7fa65864b17df4) [INFO] [stderr] Executable unittests src/lib.rs (/opt/rustwide/target/debug/deps/sum_array-0139478c05bc4c07) [INFO] running `Command { std: "docker" "inspect" "913168cbe16c19b300b0e2d33b8e28c7812b153844cc395a958751c75bcc7700", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "913168cbe16c19b300b0e2d33b8e28c7812b153844cc395a958751c75bcc7700", kill_on_drop: false }` [INFO] [stdout] 913168cbe16c19b300b0e2d33b8e28c7812b153844cc395a958751c75bcc7700 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/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" "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:d190cb871061d98bc6d0581d85cb2ecb09a0f8a142ba5463de30be9999fc3251" "/opt/rustwide/cargo-home/bin/cargo" "+c3758fdc4730d7700b25a13cccff296a08f42c00" "test" "--frozen", kill_on_drop: false }` [INFO] [stdout] bb0642b427d871e8c2620b5d98e3cc8909c01cb0cf54a42fc798e34950c36488 [INFO] running `Command { std: "docker" "start" "-a" "bb0642b427d871e8c2620b5d98e3cc8909c01cb0cf54a42fc798e34950c36488", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> problems/n_125_valid_palindrome/src/lib.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `is_palindrome` [INFO] [stderr] --> problems/n_125_valid_palindrome/src/lib.rs:6:12 [INFO] [stderr] | [INFO] [stderr] 6 | pub fn is_palindrome(str: String) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `check_palindrome` [INFO] [stderr] --> problems/n_125_valid_palindrome/src/lib.rs:28:8 [INFO] [stderr] | [INFO] [stderr] 28 | fn check_palindrome(str: &str) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: `n_125_valid_palindrome` (lib) generated 3 warnings [INFO] [stderr] warning: type alias is never used: `Type` [INFO] [stderr] --> algorithms/selection_sort/src/lib.rs:1:1 [INFO] [stderr] | [INFO] [stderr] 1 | type Type = u128; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function is never used: `selection_sort` [INFO] [stderr] --> algorithms/selection_sort/src/lib.rs:3:4 [INFO] [stderr] | [INFO] [stderr] 3 | fn selection_sort(mut v: Vec, asc: bool) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `find_extremum` [INFO] [stderr] --> algorithms/selection_sort/src/lib.rs:16:4 [INFO] [stderr] | [INFO] [stderr] 16 | fn find_extremum(v: Vec, asc: bool) -> usize { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: type alias is never used: `Type` [INFO] [stderr] --> algorithms/sum_array/src/lib.rs:1:1 [INFO] [stderr] | [INFO] [stderr] 1 | type Type = i128; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function is never used: `sum_recursive_dc` [INFO] [stderr] --> algorithms/sum_array/src/lib.rs:4:4 [INFO] [stderr] | [INFO] [stderr] 4 | fn sum_recursive_dc(v: Vec) -> Type { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `sum` [INFO] [stderr] --> algorithms/sum_array/src/lib.rs:11:4 [INFO] [stderr] | [INFO] [stderr] 11 | fn sum(v: Vec) -> Type { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `find` [INFO] [stderr] --> algorithms/find_max_size_square_plots/src/lib.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn find(height: u128, width: u128) -> u128 { [INFO] [stderr] | ^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function is never used: `quicksort` [INFO] [stderr] --> algorithms/quicksort/src/lib.rs:11:4 [INFO] [stderr] | [INFO] [stderr] 11 | fn quicksort(mut v: Vec, asc: bool, partition: Box) -> Vec { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function is never used: `quicksort_recursive` [INFO] [stderr] --> algorithms/quicksort/src/lib.rs:129:4 [INFO] [stderr] | [INFO] [stderr] 129 | fn quicksort_recursive(mut v: Vec, asc: bool) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `choose_sub_array` [INFO] [stderr] --> algorithms/quicksort/src/lib.rs:159:4 [INFO] [stderr] | [INFO] [stderr] 159 | fn choose_sub_array( [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `swap` [INFO] [stderr] --> algorithms/quicksort/src/lib.rs:187:4 [INFO] [stderr] | [INFO] [stderr] 187 | fn swap(v: &mut Vec, i1: usize, i2: usize, asc: bool) { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Solution` [INFO] [stderr] --> problems/n_9_palindrome_number/src/lib.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | struct Solution {} [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `is_palindrome` [INFO] [stderr] --> problems/n_9_palindrome_number/src/lib.rs:4:12 [INFO] [stderr] | [INFO] [stderr] 4 | pub fn is_palindrome(mut x: i32) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: constant is never used: `SIZE` [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:1:1 [INFO] [stderr] | [INFO] [stderr] 1 | const SIZE: usize = 10; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: type alias is never used: `HashFn` [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:3:1 [INFO] [stderr] | [INFO] [stderr] 3 | type HashFn = Box usize>; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: field is never read: `key` [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:9:5 [INFO] [stderr] | [INFO] [stderr] 9 | key: String, [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] note: `Value` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:7:10 [INFO] [stderr] | [INFO] [stderr] 7 | #[derive(Debug)] [INFO] [stderr] | ^^^^^ [INFO] [stderr] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stderr] [INFO] [stderr] warning: field is never read: `data` [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:10:5 [INFO] [stderr] | [INFO] [stderr] 10 | data: DataType, [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] note: `Value` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:7:10 [INFO] [stderr] | [INFO] [stderr] 7 | #[derive(Debug)] [INFO] [stderr] | ^^^^^ [INFO] [stderr] = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:14:8 [INFO] [stderr] | [INFO] [stderr] 14 | fn new(key: &str, data: DataType) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `HashTable` [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:22:8 [INFO] [stderr] | [INFO] [stderr] 22 | struct HashTable { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:28:8 [INFO] [stderr] | [INFO] [stderr] 28 | fn new(hash_fn: HashFn) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `insert` [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:36:8 [INFO] [stderr] | [INFO] [stderr] 36 | fn insert(&mut self, key: &str, data: DataType) { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get` [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:50:8 [INFO] [stderr] | [INFO] [stderr] 50 | fn get(&self, key: &str) -> Option { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `delete` [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:61:8 [INFO] [stderr] | [INFO] [stderr] 61 | fn delete(&mut self, key: &str) { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `load_factor` [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:72:8 [INFO] [stderr] | [INFO] [stderr] 72 | fn load_factor(&self) -> f64 { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `hash_fn_mod` [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:84:4 [INFO] [stderr] | [INFO] [stderr] 84 | fn hash_fn_mod(data: &str) -> usize { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `binary_search` [INFO] [stderr] --> algorithms/binary_search/src/lib.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn binary_search(v: Vec, target: u128) -> Option { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function is never used: `binary_search_recursive` [INFO] [stderr] --> algorithms/binary_search/src/lib.rs:24:4 [INFO] [stderr] | [INFO] [stderr] 24 | fn binary_search_recursive(v: Vec, target: u128, start: usize, stop: usize) -> Option { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: `selection_sort` (lib) generated 3 warnings [INFO] [stderr] warning: `sum_array` (lib) generated 3 warnings [INFO] [stderr] warning: `find_max_size_square_plots` (lib) generated 1 warning [INFO] [stderr] warning: `quicksort` (lib) generated 4 warnings [INFO] [stderr] warning: `n_9_palindrome_number` (lib) generated 2 warnings [INFO] [stderr] warning: `hash_table` (lib) generated 12 warnings [INFO] [stderr] warning: `binary_search` (lib) generated 2 warnings [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> algorithms/greedy/src/lib.rs:13:8 [INFO] [stderr] | [INFO] [stderr] 13 | fn new(name: &str, start: &str, stop: &str) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function is never used: `schedule_problem` [INFO] [stderr] --> algorithms/greedy/src/lib.rs:26:4 [INFO] [stderr] | [INFO] [stderr] 26 | fn schedule_problem(classes: Vec) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `set_covering_problem` [INFO] [stderr] --> algorithms/greedy/src/lib.rs:46:4 [INFO] [stderr] | [INFO] [stderr] 46 | fn set_covering_problem<'a>( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `salesperson_problem` [INFO] [stderr] --> algorithms/greedy/src/lib.rs:69:4 [INFO] [stderr] | [INFO] [stderr] 69 | fn salesperson_problem( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: `greedy` (lib) generated 4 warnings [INFO] [stderr] warning: enum is never used: `ActResult` [INFO] [stderr] --> algorithms/graph/src/lib.rs:11:6 [INFO] [stderr] | [INFO] [stderr] 11 | enum ActResult { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> algorithms/graph/src/lib.rs:30:8 [INFO] [stderr] | [INFO] [stderr] 30 | fn new(name: NodeName, data: T) -> Link { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `add_edge` [INFO] [stderr] --> algorithms/graph/src/lib.rs:38:8 [INFO] [stderr] | [INFO] [stderr] 38 | fn add_edge(&mut self, node: Link, weight: Weight) -> &mut Self { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `traverse_depth_first` [INFO] [stderr] --> algorithms/graph/src/lib.rs:43:8 [INFO] [stderr] | [INFO] [stderr] 43 | fn traverse_depth_first(&self, act: &F, seen: &mut HashSet) [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `traverse_breadth_first` [INFO] [stderr] --> algorithms/graph/src/lib.rs:57:8 [INFO] [stderr] | [INFO] [stderr] 57 | fn traverse_breadth_first(&self, act: &F, seen: &mut HashSet) [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `breadth_first_search` [INFO] [stderr] --> algorithms/graph/src/lib.rs:92:4 [INFO] [stderr] | [INFO] [stderr] 92 | fn breadth_first_search(root: Link, target: &str) -> Option [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `print_node` [INFO] [stderr] --> algorithms/graph/src/lib.rs:110:4 [INFO] [stderr] | [INFO] [stderr] 110 | fn print_node(node: &Node) { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `print_edge` [INFO] [stderr] --> algorithms/graph/src/lib.rs:121:4 [INFO] [stderr] | [INFO] [stderr] 121 | fn print_edge(edge: &Edge) -> ActResult { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `depth_first_topological_sort` [INFO] [stderr] --> algorithms/graph/src/lib.rs:135:4 [INFO] [stderr] | [INFO] [stderr] 135 | fn depth_first_topological_sort(root: Link) -> VecDeque> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `visit` [INFO] [stderr] --> algorithms/graph/src/lib.rs:160:4 [INFO] [stderr] | [INFO] [stderr] 160 | fn visit( [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `dijkstra` [INFO] [stderr] --> algorithms/graph/src/lib.rs:188:4 [INFO] [stderr] | [INFO] [stderr] 188 | fn dijkstra(root: Link) -> (HashMap, HashMap>>) [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `find_closest_node` [INFO] [stderr] --> algorithms/graph/src/lib.rs:231:4 [INFO] [stderr] | [INFO] [stderr] 231 | fn find_closest_node( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `bellman_ford` [INFO] [stderr] --> algorithms/graph/src/lib.rs:249:4 [INFO] [stderr] | [INFO] [stderr] 249 | fn bellman_ford(root: Link) -> (HashMap, HashMap>>) [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: `graph` (lib) generated 13 warnings [INFO] [stderr] Finished test [unoptimized + debuginfo] target(s) in 0.84s [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/binary_search-8d940976bed97aab) [INFO] [stdout] [INFO] [stdout] running 2 tests [INFO] [stdout] test tests::test_binary_search ... ok [INFO] [stdout] test tests::test_binary_search_recursive ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 2 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s [INFO] [stdout] [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/find_max_size_square_plots-fb18dc71861a2c36) [INFO] [stdout] [INFO] [stdout] running 1 test [INFO] [stdout] test tests::it_works ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 1 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s [INFO] [stdout] [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/graph-5baf075123db2544) [INFO] [stdout] [INFO] [stdout] running 7 tests [INFO] [stdout] test tests::test_breadth_first_traverse ... ok [INFO] [stdout] test tests::test_breadth_first_search ... ok [INFO] [stdout] test tests::test_breadth_first_topology_sort ... ok [INFO] [stdout] test tests::test_depth_first_traverse ... ok [INFO] [stdout] test tests::test_bellman_ford ... ok [INFO] [stdout] test tests::test_dijkstra ... ok [INFO] [stdout] test tests::test_rand ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 7 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.03s [INFO] [stdout] [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/greedy-e8df638b83d8a066) [INFO] [stdout] [INFO] [stdout] running 3 tests [INFO] [stdout] test tests::test_schedule_problem ... ok [INFO] [stdout] test tests::test_salesperson_problem ... ok [INFO] [stdout] test tests::test_covering_problem ... FAILED [INFO] [stdout] [INFO] [stdout] failures: [INFO] [stdout] [INFO] [stdout] ---- tests::test_covering_problem stdout ---- [INFO] [stdout] thread 'tests::test_covering_problem' panicked at 'assertion failed: `(left == right)` [INFO] [stdout] left: `{"kfour"}`, [INFO] [stdout] right: `{}`', algorithms/greedy/src/lib.rs:170:9 [INFO] [stdout] stack backtrace: [INFO] [stdout] 0: 0x5603016f91f0 - std::backtrace_rs::backtrace::libunwind::trace::h2c3bc9c840656a34 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/../../backtrace/src/backtrace/mod.rs:66:5 [INFO] [stdout] 1: 0x5603016f91f0 - std::backtrace_rs::backtrace::trace_unsynchronized::h0a70f522b5a3463e [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/../../backtrace/src/backtrace/mod.rs:66:5 [INFO] [stdout] 2: 0x5603016f91f0 - std::sys_common::backtrace::_print_fmt::he249a79bec407477 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/sys_common/backtrace.rs:66:5 [INFO] [stdout] 3: 0x5603016f91f0 - ::fmt::ha9d1970820f5c713 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/sys_common/backtrace.rs:45:22 [INFO] [stdout] 4: 0x56030171c09c - core::fmt::write::hc4fc655621d59c6c [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/core/src/fmt/mod.rs:1194:17 [INFO] [stdout] 5: 0x5603016f5c15 - std::io::Write::write_fmt::h766156bfd5935712 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/io/mod.rs:1655:15 [INFO] [stdout] 6: 0x5603016fac61 - std::sys_common::backtrace::_print::hfbedb7d14540afb9 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/sys_common/backtrace.rs:48:5 [INFO] [stdout] 7: 0x5603016fac61 - std::sys_common::backtrace::print::h1d12b345ae925adb [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/sys_common/backtrace.rs:35:9 [INFO] [stdout] 8: 0x5603016fac61 - std::panicking::default_hook::{{closure}}::hbfa91b7f831744dd [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/panicking.rs:295:22 [INFO] [stdout] 9: 0x5603016fa8b8 - std::panicking::default_hook::h5186cc1a78166015 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/panicking.rs:311:9 [INFO] [stdout] 10: 0x5603016fb32d - std::panicking::rust_panic_with_hook::h1b346e6d62a347dd [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/panicking.rs:698:17 [INFO] [stdout] 11: 0x5603016fb1f7 - std::panicking::begin_panic_handler::{{closure}}::hc131d07490c3ebd7 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/panicking.rs:588:13 [INFO] [stdout] 12: 0x5603016f96c4 - std::sys_common::backtrace::__rust_end_short_backtrace::hd18b4525708c825e [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/sys_common/backtrace.rs:138:18 [INFO] [stdout] 13: 0x5603016faf22 - rust_begin_unwind [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/panicking.rs:584:5 [INFO] [stdout] 14: 0x56030164bd63 - core::panicking::panic_fmt::h2bdc1e1473e094d6 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/core/src/panicking.rs:142:14 [INFO] [stdout] 15: 0x56030171ab98 - core::panicking::assert_failed_inner::h141b6b1fd67e8cea [INFO] [stdout] 16: 0x56030166084a - core::panicking::assert_failed::h82df45e0fc3c0f89 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/core/src/panicking.rs:181:5 [INFO] [stdout] 17: 0x560301668bfb - greedy::tests::test_covering_problem::h150ffe769fd438ef [INFO] [stdout] at /opt/rustwide/workdir/algorithms/greedy/src/lib.rs:170:9 [INFO] [stdout] 18: 0x5603016682da - greedy::tests::test_covering_problem::{{closure}}::h8908f6e111f589e3 [INFO] [stdout] at /opt/rustwide/workdir/algorithms/greedy/src/lib.rs:155:5 [INFO] [stdout] 19: 0x560301665cce - core::ops::function::FnOnce::call_once::h766ac1980818c392 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/core/src/ops/function.rs:248:5 [INFO] [stdout] 20: 0x5603016aeb83 - core::ops::function::FnOnce::call_once::hfa464e74fccacfdb [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/core/src/ops/function.rs:248:5 [INFO] [stdout] 21: 0x5603016aeb83 - test::__rust_begin_short_backtrace::h2b9d08a5d60802a7 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/test/src/lib.rs:573:5 [INFO] [stdout] 22: 0x5603016ad8dd - as core::ops::function::FnOnce>::call_once::h11665ca350597984 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/alloc/src/boxed.rs:1866:9 [INFO] [stdout] 23: 0x5603016ad8dd - as core::ops::function::FnOnce<()>>::call_once::h1dd74fd619996a6d [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/core/src/panic/unwind_safe.rs:271:9 [INFO] [stdout] 24: 0x5603016ad8dd - std::panicking::try::do_call::h545949b41f3cafdf [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/panicking.rs:492:40 [INFO] [stdout] 25: 0x5603016ad8dd - std::panicking::try::h8a4eee9e99747cca [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/panicking.rs:456:19 [INFO] [stdout] 26: 0x5603016ad8dd - std::panic::catch_unwind::h7a2d4c4bb98e2a33 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/panic.rs:137:14 [INFO] [stdout] 27: 0x5603016ad8dd - test::run_test_in_process::h43cdbd88d3031d2d [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/test/src/lib.rs:596:18 [INFO] [stdout] 28: 0x5603016ad8dd - test::run_test::run_test_inner::{{closure}}::h7a35ff2a2ef1be40 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/test/src/lib.rs:490:39 [INFO] [stdout] 29: 0x56030167973c - test::run_test::run_test_inner::{{closure}}::h99fa578161f25342 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/test/src/lib.rs:517:37 [INFO] [stdout] 30: 0x56030167973c - std::sys_common::backtrace::__rust_begin_short_backtrace::h51d96e3583c91997 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/sys_common/backtrace.rs:122:18 [INFO] [stdout] 31: 0x56030167f8ef - std::thread::Builder::spawn_unchecked_::{{closure}}::{{closure}}::h901e06481c3928e8 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/thread/mod.rs:500:17 [INFO] [stdout] 32: 0x56030167f8ef - as core::ops::function::FnOnce<()>>::call_once::h2ab169c9508acc57 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/core/src/panic/unwind_safe.rs:271:9 [INFO] [stdout] 33: 0x56030167f8ef - std::panicking::try::do_call::hf0f60551a514f390 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/panicking.rs:492:40 [INFO] [stdout] 34: 0x56030167f8ef - std::panicking::try::h50e945932a8cf417 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/panicking.rs:456:19 [INFO] [stdout] 35: 0x56030167f8ef - std::panic::catch_unwind::hfd1bd35215287444 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/panic.rs:137:14 [INFO] [stdout] 36: 0x56030167f8ef - std::thread::Builder::spawn_unchecked_::{{closure}}::h79c8bb59e9e6d53e [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/thread/mod.rs:499:30 [INFO] [stdout] 37: 0x56030167f8ef - core::ops::function::FnOnce::call_once{{vtable.shim}}::hc427cbf183995ee4 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/core/src/ops/function.rs:248:5 [INFO] [stdout] 38: 0x5603016ff843 - as core::ops::function::FnOnce>::call_once::h03e1f93a163dfab7 [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/alloc/src/boxed.rs:1866:9 [INFO] [stdout] 39: 0x5603016ff843 - as core::ops::function::FnOnce>::call_once::h498bd6c4b6ddeafc [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/alloc/src/boxed.rs:1866:9 [INFO] [stdout] 40: 0x5603016ff843 - std::sys::unix::thread::Thread::new::thread_start::h36a191afeb7eed3f [INFO] [stdout] at /rustc/c3758fdc4730d7700b25a13cccff296a08f42c00/library/std/src/sys/unix/thread.rs:108:17 [INFO] [stdout] 41: 0x7fae60813609 - start_thread [INFO] [stdout] 42: 0x7fae605e3163 - clone [INFO] [stdout] 43: 0x0 - [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] failures: [INFO] [stdout] tests::test_covering_problem [INFO] [stdout] [INFO] [stdout] test result: FAILED. 2 passed; 1 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.01s [INFO] [stdout] [INFO] [stderr] error: test failed, to rerun pass '-p greedy --lib' [INFO] running `Command { std: "docker" "inspect" "bb0642b427d871e8c2620b5d98e3cc8909c01cb0cf54a42fc798e34950c36488", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "bb0642b427d871e8c2620b5d98e3cc8909c01cb0cf54a42fc798e34950c36488", kill_on_drop: false }` [INFO] [stdout] bb0642b427d871e8c2620b5d98e3cc8909c01cb0cf54a42fc798e34950c36488