[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] 0a357004fee62c49837e3228670e85d50c3b80ba [INFO] testing lavrxxx/leetcode against master#d3515155216e98c23440ea92c3f49c6a0d7101fc for pr-113843 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Flavrxxx%2Fleetcode" "/workspace/builds/worker-5-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-5-tc1/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/lavrxxx/leetcode on toolchain d3515155216e98c23440ea92c3f49c6a0d7101fc [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+d3515155216e98c23440ea92c3f49c6a0d7101fc" "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-5-tc1/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: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+d3515155216e98c23440ea92c3f49c6a0d7101fc" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] warning: some crates are on edition 2021 which defaults to `resolver = "2"`, but virtual workspaces default to `resolver = "1"` [INFO] [stderr] note: to keep the current resolver, specify `workspace.resolver = "1"` in the workspace root's manifest [INFO] [stderr] note: to use the edition 2021 resolver, specify `workspace.resolver = "2"` in the workspace root's manifest [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/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:5c16f4e6c37141f9fef0bc86f7a492d732943053e42aab8461035881e3f53823" "/opt/rustwide/cargo-home/bin/cargo" "+d3515155216e98c23440ea92c3f49c6a0d7101fc" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] dfd99750bc50e642c90a876a25714de8f3dccc937f4b220fdfc872fe5dd57af9 [INFO] running `Command { std: "docker" "start" "-a" "dfd99750bc50e642c90a876a25714de8f3dccc937f4b220fdfc872fe5dd57af9", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "dfd99750bc50e642c90a876a25714de8f3dccc937f4b220fdfc872fe5dd57af9", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "dfd99750bc50e642c90a876a25714de8f3dccc937f4b220fdfc872fe5dd57af9", kill_on_drop: false }` [INFO] [stdout] dfd99750bc50e642c90a876a25714de8f3dccc937f4b220fdfc872fe5dd57af9 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/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:5c16f4e6c37141f9fef0bc86f7a492d732943053e42aab8461035881e3f53823" "/opt/rustwide/cargo-home/bin/cargo" "+d3515155216e98c23440ea92c3f49c6a0d7101fc" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 799cbce643a9ca90afa74bc10a54f4f28485252eed7bed61290e3f3b9a0c548d [INFO] running `Command { std: "docker" "start" "-a" "799cbce643a9ca90afa74bc10a54f4f28485252eed7bed61290e3f3b9a0c548d", kill_on_drop: false }` [INFO] [stderr] warning: some crates are on edition 2021 which defaults to `resolver = "2"`, but virtual workspaces default to `resolver = "1"` [INFO] [stderr] note: to keep the current resolver, specify `workspace.resolver = "1"` in the workspace root's manifest [INFO] [stderr] note: to use the edition 2021 resolver, specify `workspace.resolver = "2"` in the workspace root's manifest [INFO] [stderr] Blocking waiting for file lock on package cache [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 hash_table v0.1.0 (/opt/rustwide/workdir/algorithms/hash_table) [INFO] [stderr] Compiling n_125_valid_palindrome v0.1.0 (/opt/rustwide/workdir/problems/n_125_valid_palindrome) [INFO] [stderr] Compiling n_9_palindrome_number v0.1.0 (/opt/rustwide/workdir/problems/n_9_palindrome_number) [INFO] [stderr] Compiling find_max_size_square_plots v0.1.0 (/opt/rustwide/workdir/algorithms/find_max_size_square_plots) [INFO] [stderr] Compiling binary_search v0.1.0 (/opt/rustwide/workdir/algorithms/binary_search) [INFO] [stderr] Compiling selection_sort v0.1.0 (/opt/rustwide/workdir/algorithms/selection_sort) [INFO] [stderr] Compiling dynamic v0.1.0 (/opt/rustwide/workdir/algorithms/dynamic) [INFO] [stderr] Compiling quicksort v0.1.0 (/opt/rustwide/workdir/algorithms/quicksort) [INFO] [stderr] Compiling sum_array v0.1.0 (/opt/rustwide/workdir/algorithms/sum_array) [INFO] [stdout] warning: function `find` is never used [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: struct `Solution` is never constructed [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_palindrome` is never used [INFO] [stdout] --> problems/n_9_palindrome_number/src/lib.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn is_palindrome(mut x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [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 functions `is_palindrome` and `check_palindrome` are never used [INFO] [stdout] --> problems/n_125_valid_palindrome/src/lib.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn is_palindrome(str: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn check_palindrome(str: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Type` is never used [INFO] [stdout] --> algorithms/selection_sort/src/lib.rs:1:6 [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 `selection_sort` is never used [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 `find_extremum` is never used [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: function `binary_search` is never used [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 `binary_search_recursive` is never used [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 `Type` is never used [INFO] [stdout] --> algorithms/sum_array/src/lib.rs:1:6 [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: 3 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 2 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sum_recursive_dc` is never used [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 `sum` is never used [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: 2 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 3 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 1 warning emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `SIZE` is never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:1:7 [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 `HashFn` is never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:3:6 [INFO] [stdout] | [INFO] [stdout] 3 | type HashFn = Box usize>; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `key` and `data` are never read [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 8 | struct Value { [INFO] [stdout] | ----- fields in this struct [INFO] [stdout] 9 | key: String, [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] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 13 | impl Value { [INFO] [stdout] | ---------- associated function in this implementation [INFO] [stdout] 14 | fn new(key: &str, data: DataType) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `HashTable` is never constructed [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 items `new`, `insert`, `get`, `delete`, and `load_factor` are never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 27 | impl HashTable { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 28 | fn new(hash_fn: HashFn) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | fn insert(&mut self, key: &str, data: DataType) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | fn get(&self, key: &str) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn delete(&mut self, key: &str) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn load_factor(&self) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `hash_fn_mod` is never used [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: fields `weight` and `price` are never read [INFO] [stdout] --> algorithms/dynamic/src/lib.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 7 | struct Item { [INFO] [stdout] | ---- fields in this struct [INFO] [stdout] 8 | weight: Weight, [INFO] [stdout] | ^^^^^^ [INFO] [stdout] 9 | price: Price, [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Item` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `price` and `items` are never read [INFO] [stdout] --> algorithms/dynamic/src/lib.rs:14:5 [INFO] [stdout] | [INFO] [stdout] 13 | struct Cell { [INFO] [stdout] | ---- fields in this struct [INFO] [stdout] 14 | price: Price, [INFO] [stdout] | ^^^^^ [INFO] [stdout] 15 | items: Vec, [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Cell` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run_knapsack_problem` is never used [INFO] [stdout] --> algorithms/dynamic/src/lib.rs:19:4 [INFO] [stdout] | [INFO] [stdout] 19 | fn run_knapsack_problem( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `longest_common_substring` is never used [INFO] [stdout] --> algorithms/dynamic/src/lib.rs:87:4 [INFO] [stdout] | [INFO] [stdout] 87 | fn longest_common_substring(target: String, variants: Vec) -> Vec<(String, i128)> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 4 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 7 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `quicksort` is never used [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 `quicksort_recursive` is never used [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 `choose_sub_array` is never used [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 `swap` is never used [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] [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 chrono v0.4.19 [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 `ActResult` is never used [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 items `new`, `add_edge`, `traverse_depth_first`, and `traverse_breadth_first` are never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 26 | impl Node [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] ... [INFO] [stdout] 30 | fn new(name: NodeName, data: T) -> Link { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn add_edge(&mut self, node: Link, weight: Weight) -> &mut Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn traverse_depth_first(&self, act: &F, seen: &mut HashSet) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [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 `breadth_first_search` is never used [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 `print_node` is never used [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 `print_edge` is never used [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 `depth_first_topological_sort` is never used [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 `visit` is never used [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 `dijkstra` is never used [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 `find_closest_node` is never used [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 `bellman_ford` is never used [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: 10 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> algorithms/greedy/src/lib.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl Class { [INFO] [stdout] | ---------- associated function in this implementation [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 `schedule_problem` is never used [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 `set_covering_problem` is never used [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 `salesperson_problem` is never used [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: using `.clone()` on a double reference, which returns `&str` instead of cloning the inner type [INFO] [stdout] --> algorithms/greedy/src/lib.rs:63:45 [INFO] [stdout] | [INFO] [stdout] 63 | final_stations.insert(best_station.0.clone()); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(suspicious_double_ref_op)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 5 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 3.27s [INFO] running `Command { std: "docker" "inspect" "799cbce643a9ca90afa74bc10a54f4f28485252eed7bed61290e3f3b9a0c548d", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "799cbce643a9ca90afa74bc10a54f4f28485252eed7bed61290e3f3b9a0c548d", kill_on_drop: false }` [INFO] [stdout] 799cbce643a9ca90afa74bc10a54f4f28485252eed7bed61290e3f3b9a0c548d [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/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:5c16f4e6c37141f9fef0bc86f7a492d732943053e42aab8461035881e3f53823" "/opt/rustwide/cargo-home/bin/cargo" "+d3515155216e98c23440ea92c3f49c6a0d7101fc" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] f0056e7a9262cebd259642fffeb4b25a452e241f66e939e6bc70c828c0651abc [INFO] running `Command { std: "docker" "start" "-a" "f0056e7a9262cebd259642fffeb4b25a452e241f66e939e6bc70c828c0651abc", kill_on_drop: false }` [INFO] [stderr] warning: some crates are on edition 2021 which defaults to `resolver = "2"`, but virtual workspaces default to `resolver = "1"` [INFO] [stderr] note: to keep the current resolver, specify `workspace.resolver = "1"` in the workspace root's manifest [INFO] [stderr] note: to use the edition 2021 resolver, specify `workspace.resolver = "2"` in the workspace root's manifest [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stdout] warning: function `binary_search` is never used [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 `binary_search_recursive` is never used [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: struct `Solution` is never constructed [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_palindrome` is never used [INFO] [stdout] --> problems/n_9_palindrome_number/src/lib.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [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: struct `Solution` is never constructed [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 functions `is_palindrome` and `check_palindrome` are never used [INFO] [stdout] --> problems/n_125_valid_palindrome/src/lib.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn is_palindrome(str: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn check_palindrome(str: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 2 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Type` is never used [INFO] [stdout] --> algorithms/sum_array/src/lib.rs:1:6 [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 `sum_recursive_dc` is never used [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 `sum` is never used [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: 3 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `weight` and `price` are never read [INFO] [stdout] --> algorithms/dynamic/src/lib.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 7 | struct Item { [INFO] [stdout] | ---- fields in this struct [INFO] [stdout] 8 | weight: Weight, [INFO] [stdout] | ^^^^^^ [INFO] [stdout] 9 | price: Price, [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Item` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `price` and `items` are never read [INFO] [stdout] --> algorithms/dynamic/src/lib.rs:14:5 [INFO] [stdout] | [INFO] [stdout] 13 | struct Cell { [INFO] [stdout] | ---- fields in this struct [INFO] [stdout] 14 | price: Price, [INFO] [stdout] | ^^^^^ [INFO] [stdout] 15 | items: Vec, [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Cell` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run_knapsack_problem` is never used [INFO] [stdout] --> algorithms/dynamic/src/lib.rs:19:4 [INFO] [stdout] | [INFO] [stdout] 19 | fn run_knapsack_problem( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `longest_common_substring` is never used [INFO] [stdout] --> algorithms/dynamic/src/lib.rs:87:4 [INFO] [stdout] | [INFO] [stdout] 87 | fn longest_common_substring(target: String, variants: Vec) -> Vec<(String, i128)> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 4 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `SIZE` is never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:1:7 [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 `HashFn` is never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:3:6 [INFO] [stdout] | [INFO] [stdout] 3 | type HashFn = Box usize>; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `key` and `data` are never read [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 8 | struct Value { [INFO] [stdout] | ----- fields in this struct [INFO] [stdout] 9 | key: String, [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] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 13 | impl Value { [INFO] [stdout] | ---------- associated function in this implementation [INFO] [stdout] 14 | fn new(key: &str, data: DataType) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `HashTable` is never constructed [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 items `new`, `insert`, `get`, `delete`, and `load_factor` are never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 27 | impl HashTable { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 28 | fn new(hash_fn: HashFn) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | fn insert(&mut self, key: &str, data: DataType) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | fn get(&self, key: &str) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn delete(&mut self, key: &str) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn load_factor(&self) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `hash_fn_mod` is never used [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: 7 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `quicksort` is never used [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 `quicksort_recursive` is never used [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 `choose_sub_array` is never used [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 `swap` is never used [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: type alias `Type` is never used [INFO] [stdout] --> algorithms/selection_sort/src/lib.rs:1:6 [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 `selection_sort` is never used [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 `find_extremum` is never used [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] [stderr] Compiling find_max_size_square_plots v0.1.0 (/opt/rustwide/workdir/algorithms/find_max_size_square_plots) [INFO] [stdout] warning: function `find` is never used [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] [stderr] Compiling sum_array v0.1.0 (/opt/rustwide/workdir/algorithms/sum_array) [INFO] [stderr] Compiling quicksort v0.1.0 (/opt/rustwide/workdir/algorithms/quicksort) [INFO] [stderr] Compiling dynamic v0.1.0 (/opt/rustwide/workdir/algorithms/dynamic) [INFO] [stderr] Compiling n_9_palindrome_number v0.1.0 (/opt/rustwide/workdir/problems/n_9_palindrome_number) [INFO] [stderr] Compiling hash_table v0.1.0 (/opt/rustwide/workdir/algorithms/hash_table) [INFO] [stderr] Compiling n_125_valid_palindrome v0.1.0 (/opt/rustwide/workdir/problems/n_125_valid_palindrome) [INFO] [stderr] Compiling binary_search v0.1.0 (/opt/rustwide/workdir/algorithms/binary_search) [INFO] [stderr] Compiling selection_sort v0.1.0 (/opt/rustwide/workdir/algorithms/selection_sort) [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> algorithms/greedy/src/lib.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl Class { [INFO] [stdout] | ---------- associated function in this implementation [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 `schedule_problem` is never used [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 `set_covering_problem` is never used [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 `salesperson_problem` is never used [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: using `.clone()` on a double reference, which returns `&str` instead of cloning the inner type [INFO] [stdout] --> algorithms/greedy/src/lib.rs:63:45 [INFO] [stdout] | [INFO] [stdout] 63 | final_stations.insert(best_station.0.clone()); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(suspicious_double_ref_op)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 5 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `ActResult` is never used [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 items `new`, `add_edge`, `traverse_depth_first`, and `traverse_breadth_first` are never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 26 | impl Node [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] ... [INFO] [stdout] 30 | fn new(name: NodeName, data: T) -> Link { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn add_edge(&mut self, node: Link, weight: Weight) -> &mut Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn traverse_depth_first(&self, act: &F, seen: &mut HashSet) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [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 `breadth_first_search` is never used [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 `print_node` is never used [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] [stderr] Compiling graph v0.1.0 (/opt/rustwide/workdir/algorithms/graph) [INFO] [stdout] warning: function `print_edge` is never used [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] [stderr] Compiling greedy v0.1.0 (/opt/rustwide/workdir/algorithms/greedy) [INFO] [stdout] warning: function `depth_first_topological_sort` is never used [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 `visit` is never used [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 `dijkstra` is never used [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 `find_closest_node` is never used [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 `bellman_ford` is never used [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: 10 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: using `.clone()` on a double reference, which returns `&str` instead of cloning the inner type [INFO] [stdout] --> algorithms/greedy/src/lib.rs:63:45 [INFO] [stdout] | [INFO] [stdout] 63 | final_stations.insert(best_station.0.clone()); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(suspicious_double_ref_op)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 1 warning emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished test [unoptimized + debuginfo] target(s) in 0.88s [INFO] running `Command { std: "docker" "inspect" "f0056e7a9262cebd259642fffeb4b25a452e241f66e939e6bc70c828c0651abc", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "f0056e7a9262cebd259642fffeb4b25a452e241f66e939e6bc70c828c0651abc", kill_on_drop: false }` [INFO] [stdout] f0056e7a9262cebd259642fffeb4b25a452e241f66e939e6bc70c828c0651abc [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/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:5c16f4e6c37141f9fef0bc86f7a492d732943053e42aab8461035881e3f53823" "/opt/rustwide/cargo-home/bin/cargo" "+d3515155216e98c23440ea92c3f49c6a0d7101fc" "test" "--frozen", kill_on_drop: false }` [INFO] [stdout] e098cc501c6477097ef6004e14e1a280083dcb1c9716d01db0e1ff782029291b [INFO] running `Command { std: "docker" "start" "-a" "e098cc501c6477097ef6004e14e1a280083dcb1c9716d01db0e1ff782029291b", kill_on_drop: false }` [INFO] [stderr] warning: some crates are on edition 2021 which defaults to `resolver = "2"`, but virtual workspaces default to `resolver = "1"` [INFO] [stderr] note: to keep the current resolver, specify `workspace.resolver = "1"` in the workspace root's manifest [INFO] [stderr] note: to use the edition 2021 resolver, specify `workspace.resolver = "2"` in the workspace root's manifest [INFO] [stderr] warning: type alias `Type` is never used [INFO] [stderr] --> algorithms/sum_array/src/lib.rs:1:6 [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 `sum_recursive_dc` is never used [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 `sum` is never used [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: struct `Solution` is never constructed [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_palindrome` is never used [INFO] [stderr] --> problems/n_9_palindrome_number/src/lib.rs:4:12 [INFO] [stderr] | [INFO] [stderr] 3 | impl Solution { [INFO] [stderr] | ------------- associated function in this implementation [INFO] [stderr] 4 | pub fn is_palindrome(mut x: i32) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `binary_search` is never used [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 `binary_search_recursive` is never used [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: function `quicksort` is never used [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 `quicksort_recursive` is never used [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 `choose_sub_array` is never used [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 `swap` is never used [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: function `find` is never used [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: type alias `Type` is never used [INFO] [stderr] --> algorithms/selection_sort/src/lib.rs:1:6 [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 `selection_sort` is never used [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 `find_extremum` is never used [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: constant `SIZE` is never used [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:1:7 [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 `HashFn` is never used [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:3:6 [INFO] [stderr] | [INFO] [stderr] 3 | type HashFn = Box usize>; [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: fields `key` and `data` are never read [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:9:5 [INFO] [stderr] | [INFO] [stderr] 8 | struct Value { [INFO] [stderr] | ----- fields in this struct [INFO] [stderr] 9 | key: String, [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] [INFO] [stderr] warning: associated function `new` is never used [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:14:8 [INFO] [stderr] | [INFO] [stderr] 13 | impl Value { [INFO] [stderr] | ---------- associated function in this implementation [INFO] [stderr] 14 | fn new(key: &str, data: DataType) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `HashTable` is never constructed [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 items `new`, `insert`, `get`, `delete`, and `load_factor` are never used [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:28:8 [INFO] [stderr] | [INFO] [stderr] 27 | impl HashTable { [INFO] [stderr] | -------------- associated items in this implementation [INFO] [stderr] 28 | fn new(hash_fn: HashFn) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 36 | fn insert(&mut self, key: &str, data: DataType) { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 50 | fn get(&self, key: &str) -> Option { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 61 | fn delete(&mut self, key: &str) { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 72 | fn load_factor(&self) -> f64 { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `hash_fn_mod` is never used [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: fields `weight` and `price` are never read [INFO] [stderr] --> algorithms/dynamic/src/lib.rs:8:5 [INFO] [stderr] | [INFO] [stderr] 7 | struct Item { [INFO] [stderr] | ---- fields in this struct [INFO] [stderr] 8 | weight: Weight, [INFO] [stderr] | ^^^^^^ [INFO] [stderr] 9 | price: Price, [INFO] [stderr] | ^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `Item` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: fields `price` and `items` are never read [INFO] [stderr] --> algorithms/dynamic/src/lib.rs:14:5 [INFO] [stderr] | [INFO] [stderr] 13 | struct Cell { [INFO] [stderr] | ---- fields in this struct [INFO] [stderr] 14 | price: Price, [INFO] [stderr] | ^^^^^ [INFO] [stderr] 15 | items: Vec, [INFO] [stderr] | ^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `Cell` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stderr] [INFO] [stderr] warning: function `run_knapsack_problem` is never used [INFO] [stderr] --> algorithms/dynamic/src/lib.rs:19:4 [INFO] [stderr] | [INFO] [stderr] 19 | fn run_knapsack_problem( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `longest_common_substring` is never used [INFO] [stderr] --> algorithms/dynamic/src/lib.rs:87:4 [INFO] [stderr] | [INFO] [stderr] 87 | fn longest_common_substring(target: String, variants: Vec) -> Vec<(String, i128)> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Solution` is never constructed [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 functions `is_palindrome` and `check_palindrome` are never used [INFO] [stderr] --> problems/n_125_valid_palindrome/src/lib.rs:6:12 [INFO] [stderr] | [INFO] [stderr] 5 | impl Solution { [INFO] [stderr] | ------------- associated functions in this implementation [INFO] [stderr] 6 | pub fn is_palindrome(str: String) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 28 | fn check_palindrome(str: &str) -> bool { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: `sum_array` (lib) generated 3 warnings [INFO] [stderr] warning: `n_9_palindrome_number` (lib) generated 2 warnings [INFO] [stderr] warning: `binary_search` (lib) generated 2 warnings [INFO] [stderr] warning: `quicksort` (lib) generated 4 warnings [INFO] [stderr] warning: `find_max_size_square_plots` (lib) generated 1 warning [INFO] [stderr] warning: `selection_sort` (lib) generated 3 warnings [INFO] [stderr] warning: `hash_table` (lib) generated 7 warnings [INFO] [stderr] warning: `dynamic` (lib) generated 4 warnings [INFO] [stderr] warning: `n_125_valid_palindrome` (lib) generated 2 warnings [INFO] [stderr] warning: enum `ActResult` is never used [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 items `new`, `add_edge`, `traverse_depth_first`, and `traverse_breadth_first` are never used [INFO] [stderr] --> algorithms/graph/src/lib.rs:30:8 [INFO] [stderr] | [INFO] [stderr] 26 | impl Node [INFO] [stderr] | --------------- associated items in this implementation [INFO] [stderr] ... [INFO] [stderr] 30 | fn new(name: NodeName, data: T) -> Link { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 38 | fn add_edge(&mut self, node: Link, weight: Weight) -> &mut Self { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 43 | fn traverse_depth_first(&self, act: &F, seen: &mut HashSet) [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 57 | fn traverse_breadth_first(&self, act: &F, seen: &mut HashSet) [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `breadth_first_search` is never used [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 `print_node` is never used [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 `print_edge` is never used [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 `depth_first_topological_sort` is never used [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 `visit` is never used [INFO] [stderr] --> algorithms/graph/src/lib.rs:160:4 [INFO] [stderr] | [INFO] [stderr] 160 | fn visit( [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `dijkstra` is never used [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 `find_closest_node` is never used [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 `bellman_ford` is never used [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 10 warnings [INFO] [stderr] warning: associated function `new` is never used [INFO] [stderr] --> algorithms/greedy/src/lib.rs:13:8 [INFO] [stderr] | [INFO] [stderr] 12 | impl Class { [INFO] [stderr] | ---------- associated function in this implementation [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 `schedule_problem` is never used [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 `set_covering_problem` is never used [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 `salesperson_problem` is never used [INFO] [stderr] --> algorithms/greedy/src/lib.rs:69:4 [INFO] [stderr] | [INFO] [stderr] 69 | fn salesperson_problem( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: using `.clone()` on a double reference, which returns `&str` instead of cloning the inner type [INFO] [stderr] --> algorithms/greedy/src/lib.rs:63:45 [INFO] [stderr] | [INFO] [stderr] 63 | final_stations.insert(best_station.0.clone()); [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(suspicious_double_ref_op)]` on by default [INFO] [stderr] [INFO] [stderr] warning: `greedy` (lib) generated 5 warnings [INFO] [stderr] warning: `greedy` (lib test) generated 1 warning (1 duplicate) [INFO] [stderr] Finished test [unoptimized + debuginfo] target(s) in 0.01s [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/binary_search-623626d2283c225d) [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/dynamic-921880dcfb79f0a2) [INFO] [stdout] [INFO] [stdout] running 2 tests [INFO] [stdout] test tests::test_lcs ... ok [INFO] [stdout] test tests::test_knapsack ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 2 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.59s [INFO] [stdout] [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/find_max_size_square_plots-59aba67a6f5ae816) [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-77f409d376aec321) [INFO] [stdout] [INFO] [stdout] running 7 tests [INFO] [stdout] test tests::test_depth_first_traverse ... ok [INFO] [stdout] test tests::test_dijkstra ... ok [INFO] [stdout] test tests::test_bellman_ford ... ok [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_rand ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 7 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.05s [INFO] [stdout] [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/greedy-783d222ce5ef19bb) [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: 0x55c2ba0113e1 - std::backtrace_rs::backtrace::libunwind::trace::h2703a10e9200794c [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/../../backtrace/src/backtrace/libunwind.rs:93:5 [INFO] [stdout] 1: 0x55c2ba0113e1 - std::backtrace_rs::backtrace::trace_unsynchronized::h4844f7d488b44dc0 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/../../backtrace/src/backtrace/mod.rs:66:5 [INFO] [stdout] 2: 0x55c2ba0113e1 - std::sys_common::backtrace::_print_fmt::hf45311442c372df0 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/sys_common/backtrace.rs:65:5 [INFO] [stdout] 3: 0x55c2ba0113e1 - ::fmt::h51751bf0e7490aba [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/sys_common/backtrace.rs:44:22 [INFO] [stdout] 4: 0x55c2ba03b3fc - core::fmt::rt::Argument::fmt::hd1fd9c2a99deb5d8 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/core/src/fmt/rt.rs:138:9 [INFO] [stdout] 5: 0x55c2ba03b3fc - core::fmt::write::hbfbb2d31c1f0855c [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/core/src/fmt/mod.rs:1094:21 [INFO] [stdout] 6: 0x55c2ba00e5ce - std::io::Write::write_fmt::hbc06e15dd07a341d [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/io/mod.rs:1714:15 [INFO] [stdout] 7: 0x55c2ba0111f5 - std::sys_common::backtrace::_print::hdbe3ddcbbe0168c0 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/sys_common/backtrace.rs:47:5 [INFO] [stdout] 8: 0x55c2ba0111f5 - std::sys_common::backtrace::print::hb26905a5b7786a7c [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/sys_common/backtrace.rs:34:9 [INFO] [stdout] 9: 0x55c2ba012f13 - std::panicking::default_hook::{{closure}}::h8ebb81b0f88d6f0c [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/panicking.rs:269:22 [INFO] [stdout] 10: 0x55c2ba012bb0 - std::panicking::default_hook::h68ef778f73f0172f [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/panicking.rs:285:9 [INFO] [stdout] 11: 0x55c2b9fbdbf7 - as core::ops::function::Fn>::call::hae2e49ca62e027a7 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/alloc/src/boxed.rs:2021:9 [INFO] [stdout] 12: 0x55c2b9fbdbf7 - test::test_main::{{closure}}::hfabcca8fcc567747 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/test/src/lib.rs:135:21 [INFO] [stdout] 13: 0x55c2ba01360e - as core::ops::function::Fn>::call::h24d4a2aeda7029b9 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/alloc/src/boxed.rs:2021:9 [INFO] [stdout] 14: 0x55c2ba01360e - std::panicking::rust_panic_with_hook::h802085966bb64488 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/panicking.rs:709:13 [INFO] [stdout] 15: 0x55c2ba013397 - std::panicking::begin_panic_handler::{{closure}}::h646997c92b8b8ce3 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/panicking.rs:597:13 [INFO] [stdout] 16: 0x55c2ba011846 - std::sys_common::backtrace::__rust_end_short_backtrace::h00c2f9b1ae29e02d [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/sys_common/backtrace.rs:151:18 [INFO] [stdout] 17: 0x55c2ba0130e2 - rust_begin_unwind [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/panicking.rs:593:5 [INFO] [stdout] 18: 0x55c2b9f5e4a3 - core::panicking::panic_fmt::hcb3f95bd29fc9a6f [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/core/src/panicking.rs:67:14 [INFO] [stdout] 19: 0x55c2b9f5e83b - core::panicking::assert_failed_inner::h60f4a1cf6191b42b [INFO] [stdout] 20: 0x55c2b9f765ba - core::panicking::assert_failed::hb12d412dbdd2a0a2 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/core/src/panicking.rs:229:5 [INFO] [stdout] 21: 0x55c2b9f7de03 - greedy::tests::test_covering_problem::h006e83791bb8443d [INFO] [stdout] at /opt/rustwide/workdir/algorithms/greedy/src/lib.rs:170:9 [INFO] [stdout] 22: 0x55c2b9f7d4d7 - greedy::tests::test_covering_problem::{{closure}}::he28d82c33441abfe [INFO] [stdout] at /opt/rustwide/workdir/algorithms/greedy/src/lib.rs:155:32 [INFO] [stdout] 23: 0x55c2b9f74e35 - core::ops::function::FnOnce::call_once::h94ebeadb5255dc8a [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 24: 0x55c2b9fc2e9f - core::ops::function::FnOnce::call_once::h0617ecab077fa701 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 25: 0x55c2b9fc2e9f - test::__rust_begin_short_backtrace::h5a61b0d3b3858a9e [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/test/src/lib.rs:626:18 [INFO] [stdout] 26: 0x55c2b9fc1ed2 - test::run_test_in_process::{{closure}}::h612e19f1fff74c0b [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/test/src/lib.rs:649:60 [INFO] [stdout] 27: 0x55c2b9fc1ed2 - as core::ops::function::FnOnce<()>>::call_once::h9c274bf226b4b405 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/core/src/panic/unwind_safe.rs:271:9 [INFO] [stdout] 28: 0x55c2b9fc1ed2 - std::panicking::try::do_call::h2e1fe1d6dd44ae26 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/panicking.rs:500:40 [INFO] [stdout] 29: 0x55c2b9fc1ed2 - std::panicking::try::hd56cf97b42cd7225 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/panicking.rs:464:19 [INFO] [stdout] 30: 0x55c2b9fc1ed2 - std::panic::catch_unwind::h73b3fd42fc280662 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/panic.rs:142:14 [INFO] [stdout] 31: 0x55c2b9fc1ed2 - test::run_test_in_process::h89bc4bc707762a60 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/test/src/lib.rs:649:27 [INFO] [stdout] 32: 0x55c2b9fc1ed2 - test::run_test::{{closure}}::hbb9d716625919f12 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/test/src/lib.rs:572:43 [INFO] [stdout] 33: 0x55c2b9f88d34 - test::run_test::{{closure}}::h6b8e0276183b66a8 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/test/src/lib.rs:600:41 [INFO] [stdout] 34: 0x55c2b9f88d34 - std::sys_common::backtrace::__rust_begin_short_backtrace::hedd230a3e26fe7ae [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/sys_common/backtrace.rs:135:18 [INFO] [stdout] 35: 0x55c2b9f8ea0b - std::thread::Builder::spawn_unchecked_::{{closure}}::{{closure}}::h4db94156f406f673 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/thread/mod.rs:529:17 [INFO] [stdout] 36: 0x55c2b9f8ea0b - as core::ops::function::FnOnce<()>>::call_once::hbd354b464352c928 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/core/src/panic/unwind_safe.rs:271:9 [INFO] [stdout] 37: 0x55c2b9f8ea0b - std::panicking::try::do_call::ha2cf3b8f2d86484e [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/panicking.rs:500:40 [INFO] [stdout] 38: 0x55c2b9f8ea0b - std::panicking::try::h0f17c2aad7c9cec6 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/panicking.rs:464:19 [INFO] [stdout] 39: 0x55c2b9f8ea0b - std::panic::catch_unwind::hf1265b3f74892fe9 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/panic.rs:142:14 [INFO] [stdout] 40: 0x55c2b9f8ea0b - std::thread::Builder::spawn_unchecked_::{{closure}}::h34c179833b973108 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/thread/mod.rs:528:30 [INFO] [stdout] 41: 0x55c2b9f8ea0b - core::ops::function::FnOnce::call_once{{vtable.shim}}::hfb7aff8ad36f3e68 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 42: 0x55c2ba017c15 - as core::ops::function::FnOnce>::call_once::h97566ec5ca724d12 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/alloc/src/boxed.rs:2007:9 [INFO] [stdout] 43: 0x55c2ba017c15 - as core::ops::function::FnOnce>::call_once::h8965e3547219fbf7 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/alloc/src/boxed.rs:2007:9 [INFO] [stdout] 44: 0x55c2ba017c15 - std::sys::unix::thread::Thread::new::thread_start::hfb921fb13d012ef9 [INFO] [stdout] at /rustc/d3515155216e98c23440ea92c3f49c6a0d7101fc/library/std/src/sys/unix/thread.rs:108:17 [INFO] [stdout] 45: 0x7fddb2f8db43 - [INFO] [stdout] 46: 0x7fddb301ebb4 - __clone [INFO] [stdout] 47: 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.02s [INFO] [stdout] [INFO] [stderr] error: test failed, to rerun pass `-p greedy --lib` [INFO] running `Command { std: "docker" "inspect" "e098cc501c6477097ef6004e14e1a280083dcb1c9716d01db0e1ff782029291b", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "e098cc501c6477097ef6004e14e1a280083dcb1c9716d01db0e1ff782029291b", kill_on_drop: false }` [INFO] [stdout] e098cc501c6477097ef6004e14e1a280083dcb1c9716d01db0e1ff782029291b