[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#ebf0cf75d368c035f4c7e7246d203bd469ee4a51 for pr-137940-2 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Flavrxxx%2Fleetcode" "/workspace/builds/worker-7-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-7-tc1/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/lavrxxx/leetcode on toolchain ebf0cf75d368c035f4c7e7246d203bd469ee4a51 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ebf0cf75d368c035f4c7e7246d203bd469ee4a51" "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-7-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" "+ebf0cf75d368c035f4c7e7246d203bd469ee4a51" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] warning: virtual workspace defaulting to `resolver = "1"` despite one or more workspace members being on edition 2021 which implies `resolver = "2"` [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] note: for more details see https://doc.rust-lang.org/cargo/reference/resolver.html#resolver-versions [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Downloading crates ... [INFO] [stderr] Downloaded time v0.1.43 [INFO] [stderr] Downloaded num-traits v0.2.14 [INFO] [stderr] Downloaded rand_core v0.6.3 [INFO] [stderr] Downloaded ppv-lite86 v0.2.16 [INFO] [stderr] Downloaded wasi v0.10.2+wasi-snapshot-preview1 [INFO] [stderr] Downloaded getrandom v0.2.6 [INFO] [stderr] Downloaded chrono v0.4.19 [INFO] [stderr] Downloaded libc v0.2.124 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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:1680c8fbd8dfb46fcd6d22e546df16ab0e007457dc29fcd9e987cdd5077fd1af" "/opt/rustwide/cargo-home/bin/cargo" "+ebf0cf75d368c035f4c7e7246d203bd469ee4a51" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 9fc16d34541edbe94cbccca0a0465cb4d168ab69e5993841c6a86a3c2ab96f4e [INFO] running `Command { std: "docker" "start" "-a" "9fc16d34541edbe94cbccca0a0465cb4d168ab69e5993841c6a86a3c2ab96f4e", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "9fc16d34541edbe94cbccca0a0465cb4d168ab69e5993841c6a86a3c2ab96f4e", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "9fc16d34541edbe94cbccca0a0465cb4d168ab69e5993841c6a86a3c2ab96f4e", kill_on_drop: false }` [INFO] [stdout] 9fc16d34541edbe94cbccca0a0465cb4d168ab69e5993841c6a86a3c2ab96f4e [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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:1680c8fbd8dfb46fcd6d22e546df16ab0e007457dc29fcd9e987cdd5077fd1af" "/opt/rustwide/cargo-home/bin/cargo" "+ebf0cf75d368c035f4c7e7246d203bd469ee4a51" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] fb27d9d80d0a8a03a14348d99a705a115721e8784a91655db9d03e71ca71f668 [INFO] running `Command { std: "docker" "start" "-a" "fb27d9d80d0a8a03a14348d99a705a115721e8784a91655db9d03e71ca71f668", kill_on_drop: false }` [INFO] [stderr] warning: virtual workspace defaulting to `resolver = "1"` despite one or more workspace members being on edition 2021 which implies `resolver = "2"` [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] note: for more details see https://doc.rust-lang.org/cargo/reference/resolver.html#resolver-versions [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 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 n_9_palindrome_number v0.1.0 (/opt/rustwide/workdir/problems/n_9_palindrome_number) [INFO] [stderr] Compiling quicksort v0.1.0 (/opt/rustwide/workdir/algorithms/quicksort) [INFO] [stderr] Compiling binary_search v0.1.0 (/opt/rustwide/workdir/algorithms/binary_search) [INFO] [stderr] Compiling dynamic v0.1.0 (/opt/rustwide/workdir/algorithms/dynamic) [INFO] [stderr] Compiling hash_table v0.1.0 (/opt/rustwide/workdir/algorithms/hash_table) [INFO] [stderr] Compiling find_max_size_square_plots v0.1.0 (/opt/rustwide/workdir/algorithms/find_max_size_square_plots) [INFO] [stderr] Compiling selection_sort v0.1.0 (/opt/rustwide/workdir/algorithms/selection_sort) [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: 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: 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 `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: type alias `Weight` is never used [INFO] [stdout] --> algorithms/dynamic/src/lib.rs:3:6 [INFO] [stdout] | [INFO] [stdout] 3 | type Weight = i128; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [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: type alias `Price` is never used [INFO] [stdout] --> algorithms/dynamic/src/lib.rs:4:6 [INFO] [stdout] | [INFO] [stdout] 4 | type Price = i128; [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Item` is never constructed [INFO] [stdout] --> algorithms/dynamic/src/lib.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct Item { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Cell` is never constructed [INFO] [stdout] --> algorithms/dynamic/src/lib.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | struct Cell { [INFO] [stdout] | ^^^^ [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: 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: 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: type alias `DataType` is never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:5:6 [INFO] [stdout] | [INFO] [stdout] 5 | type DataType = &'static str; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Value` is never constructed [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | struct Value { [INFO] [stdout] | ^^^^^ [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: 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: 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: 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: trait `Partition` is never used [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:1:7 [INFO] [stdout] | [INFO] [stdout] 1 | trait Partition { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [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] [INFO] [stdout] warning: struct `Hoare` is never constructed [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Hoare {} [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Lomuto` is never constructed [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:89:8 [INFO] [stdout] | [INFO] [stdout] 89 | struct Lomuto {} [INFO] [stdout] | ^^^^^^ [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_force` is never used [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:181:4 [INFO] [stdout] | [INFO] [stdout] 181 | fn swap_force(v: &mut Vec, i1: usize, i2: usize) { [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] [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] 27 | | where [INFO] [stdout] 28 | | T: Clone, [INFO] [stdout] | |_____________- associated items in this implementation [INFO] [stdout] 29 | { [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: struct `Class` is never constructed [INFO] [stdout] --> algorithms/greedy/src/lib.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | struct Class { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [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] [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] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 2.90s [INFO] running `Command { std: "docker" "inspect" "fb27d9d80d0a8a03a14348d99a705a115721e8784a91655db9d03e71ca71f668", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "fb27d9d80d0a8a03a14348d99a705a115721e8784a91655db9d03e71ca71f668", kill_on_drop: false }` [INFO] [stdout] fb27d9d80d0a8a03a14348d99a705a115721e8784a91655db9d03e71ca71f668 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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:1680c8fbd8dfb46fcd6d22e546df16ab0e007457dc29fcd9e987cdd5077fd1af" "/opt/rustwide/cargo-home/bin/cargo" "+ebf0cf75d368c035f4c7e7246d203bd469ee4a51" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 9afcae9039b27cb45e17d8fe9afc7dbd20f6207bcc06a4e4141daf3ff07236be [INFO] running `Command { std: "docker" "start" "-a" "9afcae9039b27cb45e17d8fe9afc7dbd20f6207bcc06a4e4141daf3ff07236be", kill_on_drop: false }` [INFO] [stderr] warning: virtual workspace defaulting to `resolver = "1"` despite one or more workspace members being on edition 2021 which implies `resolver = "2"` [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] note: for more details see https://doc.rust-lang.org/cargo/reference/resolver.html#resolver-versions [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] 27 | | where [INFO] [stdout] 28 | | T: Clone, [INFO] [stdout] | |_____________- associated items in this implementation [INFO] [stdout] 29 | { [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: struct `Class` is never constructed [INFO] [stdout] --> algorithms/greedy/src/lib.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | struct Class { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [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] [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: 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: 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: type alias `Weight` is never used [INFO] [stdout] --> algorithms/dynamic/src/lib.rs:3:6 [INFO] [stdout] | [INFO] [stdout] 3 | type Weight = i128; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Price` is never used [INFO] [stdout] --> algorithms/dynamic/src/lib.rs:4:6 [INFO] [stdout] | [INFO] [stdout] 4 | type Price = i128; [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Item` is never constructed [INFO] [stdout] --> algorithms/dynamic/src/lib.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | struct Item { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Cell` is never constructed [INFO] [stdout] --> algorithms/dynamic/src/lib.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | struct Cell { [INFO] [stdout] | ^^^^ [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: 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: trait `Partition` is never used [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:1:7 [INFO] [stdout] | [INFO] [stdout] 1 | trait Partition { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [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] [INFO] [stdout] warning: struct `Hoare` is never constructed [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Hoare {} [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Lomuto` is never constructed [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:89:8 [INFO] [stdout] | [INFO] [stdout] 89 | struct Lomuto {} [INFO] [stdout] | ^^^^^^ [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_force` is never used [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:181:4 [INFO] [stdout] | [INFO] [stdout] 181 | fn swap_force(v: &mut Vec, i1: usize, i2: usize) { [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: 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: type alias `DataType` is never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:5:6 [INFO] [stdout] | [INFO] [stdout] 5 | type DataType = &'static str; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Value` is never constructed [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | struct Value { [INFO] [stdout] | ^^^^^ [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: 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: 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] [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: 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] [stderr] Compiling n_9_palindrome_number v0.1.0 (/opt/rustwide/workdir/problems/n_9_palindrome_number) [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 hash_table v0.1.0 (/opt/rustwide/workdir/algorithms/hash_table) [INFO] [stderr] Compiling quicksort v0.1.0 (/opt/rustwide/workdir/algorithms/quicksort) [INFO] [stderr] Compiling selection_sort v0.1.0 (/opt/rustwide/workdir/algorithms/selection_sort) [INFO] [stderr] Compiling binary_search v0.1.0 (/opt/rustwide/workdir/algorithms/binary_search) [INFO] [stderr] Compiling find_max_size_square_plots v0.1.0 (/opt/rustwide/workdir/algorithms/find_max_size_square_plots) [INFO] [stderr] Compiling dynamic v0.1.0 (/opt/rustwide/workdir/algorithms/dynamic) [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] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 1.70s [INFO] running `Command { std: "docker" "inspect" "9afcae9039b27cb45e17d8fe9afc7dbd20f6207bcc06a4e4141daf3ff07236be", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "9afcae9039b27cb45e17d8fe9afc7dbd20f6207bcc06a4e4141daf3ff07236be", kill_on_drop: false }` [INFO] [stdout] 9afcae9039b27cb45e17d8fe9afc7dbd20f6207bcc06a4e4141daf3ff07236be [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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:1680c8fbd8dfb46fcd6d22e546df16ab0e007457dc29fcd9e987cdd5077fd1af" "/opt/rustwide/cargo-home/bin/cargo" "+ebf0cf75d368c035f4c7e7246d203bd469ee4a51" "test" "--frozen", kill_on_drop: false }` [INFO] [stdout] 7809d959c4500f6422ec1c44b17c7fd0966df9cd94394a1b448c6c96cf1c014d [INFO] running `Command { std: "docker" "start" "-a" "7809d959c4500f6422ec1c44b17c7fd0966df9cd94394a1b448c6c96cf1c014d", kill_on_drop: false }` [INFO] [stderr] warning: virtual workspace defaulting to `resolver = "1"` despite one or more workspace members being on edition 2021 which implies `resolver = "2"` [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] note: for more details see https://doc.rust-lang.org/cargo/reference/resolver.html#resolver-versions [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: 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: type alias `DataType` is never used [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:5:6 [INFO] [stderr] | [INFO] [stderr] 5 | type DataType = &'static str; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Value` is never constructed [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:8:8 [INFO] [stderr] | [INFO] [stderr] 8 | struct Value { [INFO] [stderr] | ^^^^^ [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: type alias `Weight` is never used [INFO] [stderr] --> algorithms/dynamic/src/lib.rs:3:6 [INFO] [stderr] | [INFO] [stderr] 3 | type Weight = i128; [INFO] [stderr] | ^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: type alias `Price` is never used [INFO] [stderr] --> algorithms/dynamic/src/lib.rs:4:6 [INFO] [stderr] | [INFO] [stderr] 4 | type Price = i128; [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Item` is never constructed [INFO] [stderr] --> algorithms/dynamic/src/lib.rs:7:8 [INFO] [stderr] | [INFO] [stderr] 7 | struct Item { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Cell` is never constructed [INFO] [stderr] --> algorithms/dynamic/src/lib.rs:13:8 [INFO] [stderr] | [INFO] [stderr] 13 | struct Cell { [INFO] [stderr] | ^^^^ [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: `n_9_palindrome_number` (lib) generated 2 warnings [INFO] [stderr] warning: `hash_table` (lib) generated 8 warnings [INFO] [stderr] warning: `dynamic` (lib) generated 6 warnings [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: trait `Partition` is never used [INFO] [stderr] --> algorithms/quicksort/src/lib.rs:1:7 [INFO] [stderr] | [INFO] [stderr] 1 | trait Partition { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [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] warning: struct `Hoare` is never constructed [INFO] [stderr] --> algorithms/quicksort/src/lib.rs:24:8 [INFO] [stderr] | [INFO] [stderr] 24 | struct Hoare {} [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Lomuto` is never constructed [INFO] [stderr] --> algorithms/quicksort/src/lib.rs:89:8 [INFO] [stderr] | [INFO] [stderr] 89 | struct Lomuto {} [INFO] [stderr] | ^^^^^^ [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_force` is never used [INFO] [stderr] --> algorithms/quicksort/src/lib.rs:181:4 [INFO] [stderr] | [INFO] [stderr] 181 | fn swap_force(v: &mut Vec, i1: usize, i2: usize) { [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: 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: 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_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: 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: `binary_search` (lib) generated 2 warnings [INFO] [stderr] warning: `quicksort` (lib) generated 8 warnings [INFO] [stderr] warning: `selection_sort` (lib) generated 3 warnings [INFO] [stderr] warning: `sum_array` (lib) generated 3 warnings [INFO] [stderr] warning: `n_125_valid_palindrome` (lib) generated 2 warnings [INFO] [stderr] warning: `find_max_size_square_plots` (lib) generated 1 warning [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] 27 | | where [INFO] [stderr] 28 | | T: Clone, [INFO] [stderr] | |_____________- associated items in this implementation [INFO] [stderr] 29 | { [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: struct `Class` is never constructed [INFO] [stderr] --> algorithms/greedy/src/lib.rs:6:8 [INFO] [stderr] | [INFO] [stderr] 6 | struct Class { [INFO] [stderr] | ^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [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] 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: `graph` (lib) generated 10 warnings [INFO] [stderr] warning: `greedy` (lib) generated 6 warnings [INFO] [stderr] warning: `greedy` (lib test) generated 1 warning (1 duplicate) [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.06s [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/binary_search-6948f35c562ad4ad) [INFO] [stdout] [INFO] [stdout] running 2 tests [INFO] [stdout] test tests::test_binary_search ... ok [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/dynamic-e175771c059100b6) [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] [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.62s [INFO] [stdout] [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/find_max_size_square_plots-5ac690724d710659) [INFO] [stdout] [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/graph-e63b4ee8d70b327f) [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] [stdout] [INFO] [stdout] running 7 tests [INFO] [stdout] test tests::test_breadth_first_topology_sort ... ok [INFO] [stdout] test tests::test_depth_first_traverse ... ok [INFO] [stdout] test tests::test_dijkstra ... ok [INFO] [stdout] test tests::test_breadth_first_traverse ... ok [INFO] [stdout] test tests::test_bellman_ford ... ok [INFO] [stdout] test tests::test_rand ... ok [INFO] [stdout] test tests::test_breadth_first_search ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 7 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.01s [INFO] [stdout] [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/greedy-9854a1f444b6b0ff) [INFO] [stdout] [INFO] [stdout] running 3 tests [INFO] [stdout] test tests::test_schedule_problem ... ok [INFO] [stdout] test tests::test_salesperson_problem ... ok [INFO] [stderr] error: test failed, to rerun pass `-p greedy --lib` [INFO] [stdout] test tests::test_covering_problem ... FAILED [INFO] [stdout] [INFO] [stdout] failures: [INFO] [stdout] [INFO] [stdout] ---- tests::test_covering_problem stdout ---- [INFO] [stdout] [INFO] [stdout] thread 'tests::test_covering_problem' panicked at algorithms/greedy/src/lib.rs:170:9: [INFO] [stdout] assertion `left == right` failed [INFO] [stdout] left: {"kfour"} [INFO] [stdout] right: {} [INFO] [stdout] stack backtrace: [INFO] [stdout] 0: 0x5d44d2a3f4e2 - std::backtrace_rs::backtrace::libunwind::trace::hf010e1dbae51cb72 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/../../backtrace/src/backtrace/libunwind.rs:117:9 [INFO] [stdout] 1: 0x5d44d2a3f4e2 - std::backtrace_rs::backtrace::trace_unsynchronized::hfea1b1ce70c8ef04 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/../../backtrace/src/backtrace/mod.rs:66:14 [INFO] [stdout] 2: 0x5d44d2a3f4e2 - std::sys::backtrace::_print_fmt::h2997a50d2484a6a6 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/sys/backtrace.rs:66:9 [INFO] [stdout] 3: 0x5d44d2a3f4e2 - ::fmt::h7fb80f6afbe41a33 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/sys/backtrace.rs:39:26 [INFO] [stdout] 4: 0x5d44d2a666a3 - core::fmt::rt::Argument::fmt::hd3a68c3e7e846625 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/core/src/fmt/rt.rs:185:76 [INFO] [stdout] 5: 0x5d44d2a666a3 - core::fmt::write::h000527be0eea6fe8 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/core/src/fmt/mod.rs:1449:21 [INFO] [stdout] 6: 0x5d44d2a3c273 - std::io::Write::write_fmt::h5402e677befea770 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/io/mod.rs:1890:15 [INFO] [stdout] 7: 0x5d44d2a3f332 - std::sys::backtrace::BacktraceLock::print::hffad87dde00cbe3e [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/sys/backtrace.rs:42:9 [INFO] [stdout] 8: 0x5d44d2a4098a - std::panicking::default_hook::{{closure}}::ha46397973bec1239 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/panicking.rs:298:22 [INFO] [stdout] 9: 0x5d44d2a40779 - std::panicking::default_hook::h706de72a1550eed4 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/panicking.rs:322:9 [INFO] [stdout] 10: 0x5d44d29eb557 - as core::ops::function::Fn>::call::hde091e5c6e92bb68 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/alloc/src/boxed.rs:1984:9 [INFO] [stdout] 11: 0x5d44d29eb557 - test::test_main::{{closure}}::h769424ff54c41197 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/test/src/lib.rs:136:21 [INFO] [stdout] 12: 0x5d44d2a41473 - as core::ops::function::Fn>::call::hbd7480c9dddf3315 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/alloc/src/boxed.rs:1984:9 [INFO] [stdout] 13: 0x5d44d2a41473 - std::panicking::rust_panic_with_hook::h6666776865bd21f5 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/panicking.rs:839:13 [INFO] [stdout] 14: 0x5d44d2a4112a - std::panicking::begin_panic_handler::{{closure}}::hb8595612365d24db [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/panicking.rs:704:13 [INFO] [stdout] 15: 0x5d44d2a3f9d9 - std::sys::backtrace::__rust_end_short_backtrace::h7037f177c7ae4ed3 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/sys/backtrace.rs:168:18 [INFO] [stdout] 16: 0x5d44d2a40dbd - rust_begin_unwind [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/panicking.rs:695:5 [INFO] [stdout] 17: 0x5d44d2a65090 - core::panicking::panic_fmt::hd26142fa9828e2a3 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/core/src/panicking.rs:75:14 [INFO] [stdout] 18: 0x5d44d2a653f7 - core::panicking::assert_failed_inner::h3773d684712d3877 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/core/src/panicking.rs:425:17 [INFO] [stdout] 19: 0x5d44d29a3bf2 - core::panicking::assert_failed::h1c4386ff1502f86a [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/core/src/panicking.rs:380:5 [INFO] [stdout] 20: 0x5d44d29a9419 - greedy::tests::test_covering_problem::h602e1612610c15d8 [INFO] [stdout] at /opt/rustwide/workdir/algorithms/greedy/src/lib.rs:170:9 [INFO] [stdout] 21: 0x5d44d29a8b57 - greedy::tests::test_covering_problem::{{closure}}::h586f922a19e80813 [INFO] [stdout] at /opt/rustwide/workdir/algorithms/greedy/src/lib.rs:155:31 [INFO] [stdout] 22: 0x5d44d29a1196 - core::ops::function::FnOnce::call_once::h0a6eef51425812c5 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 23: 0x5d44d29f0e5b - core::ops::function::FnOnce::call_once::h537cb3ba0681a85d [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 24: 0x5d44d29f0e5b - test::__rust_begin_short_backtrace::ha34590b284b8a909 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/test/src/lib.rs:638:18 [INFO] [stdout] 25: 0x5d44d29efef5 - test::run_test_in_process::{{closure}}::h7e5cb0195a5ea6a6 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/test/src/lib.rs:661:60 [INFO] [stdout] 26: 0x5d44d29efef5 - as core::ops::function::FnOnce<()>>::call_once::h4fd7826f39023efe [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/core/src/panic/unwind_safe.rs:272:9 [INFO] [stdout] 27: 0x5d44d29efef5 - std::panicking::try::do_call::h840562177f324507 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/panicking.rs:587:40 [INFO] [stdout] 28: 0x5d44d29efef5 - std::panicking::try::h2360ed2f8f8e7bd8 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/panicking.rs:550:19 [INFO] [stdout] 29: 0x5d44d29efef5 - std::panic::catch_unwind::h98cd8da2f8eb8f7b [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/panic.rs:359:14 [INFO] [stdout] 30: 0x5d44d29efef5 - test::run_test_in_process::hcd6b1143eaf140ef [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/test/src/lib.rs:661:27 [INFO] [stdout] 31: 0x5d44d29efef5 - test::run_test::{{closure}}::h12da0337272887dc [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/test/src/lib.rs:582:43 [INFO] [stdout] 32: 0x5d44d29b2ee4 - test::run_test::{{closure}}::h11d537cad5364bdc [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/test/src/lib.rs:612:41 [INFO] [stdout] 33: 0x5d44d29b2ee4 - std::sys::backtrace::__rust_begin_short_backtrace::h5f533949825eb644 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/sys/backtrace.rs:152:18 [INFO] [stdout] 34: 0x5d44d29b694a - std::thread::Builder::spawn_unchecked_::{{closure}}::{{closure}}::hf8cffede9b676267 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/thread/mod.rs:559:17 [INFO] [stdout] 35: 0x5d44d29b694a - as core::ops::function::FnOnce<()>>::call_once::h3160424131f9b05b [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/core/src/panic/unwind_safe.rs:272:9 [INFO] [stdout] 36: 0x5d44d29b694a - std::panicking::try::do_call::h4821f856f783960c [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/panicking.rs:587:40 [INFO] [stdout] 37: 0x5d44d29b694a - std::panicking::try::hd6726363e8162e27 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/panicking.rs:550:19 [INFO] [stdout] 38: 0x5d44d29b694a - std::panic::catch_unwind::hb75a27d7bd2912cb [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/panic.rs:359:14 [INFO] [stdout] 39: 0x5d44d29b694a - std::thread::Builder::spawn_unchecked_::{{closure}}::h36d5666a81748b85 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/thread/mod.rs:557:30 [INFO] [stdout] 40: 0x5d44d29b694a - core::ops::function::FnOnce::call_once{{vtable.shim}}::ha3d6556f1deabcaf [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 41: 0x5d44d2a44a9b - as core::ops::function::FnOnce>::call_once::h454485597884df01 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/alloc/src/boxed.rs:1970:9 [INFO] [stdout] 42: 0x5d44d2a44a9b - as core::ops::function::FnOnce>::call_once::h421b8b5dc09cf3b4 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/alloc/src/boxed.rs:1970:9 [INFO] [stdout] 43: 0x5d44d2a44a9b - std::sys::pal::unix::thread::Thread::new::thread_start::ha1530b93ff336c49 [INFO] [stdout] at /rustc/ebf0cf75d368c035f4c7e7246d203bd469ee4a51/library/std/src/sys/pal/unix/thread.rs:109:17 [INFO] [stdout] 44: 0x77cd47337ac3 - [INFO] [stdout] 45: 0x77cd473c8a04 - clone [INFO] [stdout] 46: 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.04s [INFO] [stdout] [INFO] running `Command { std: "docker" "inspect" "7809d959c4500f6422ec1c44b17c7fd0966df9cd94394a1b448c6c96cf1c014d", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "7809d959c4500f6422ec1c44b17c7fd0966df9cd94394a1b448c6c96cf1c014d", kill_on_drop: false }` [INFO] [stdout] 7809d959c4500f6422ec1c44b17c7fd0966df9cd94394a1b448c6c96cf1c014d