[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 1.75.0 for beta-1.76-1
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Flavrxxx%2Fleetcode" "/workspace/builds/worker-1-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-1-tc1/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/lavrxxx/leetcode on toolchain 1.75.0
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1.75.0" "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-1-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" "+1.75.0" "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] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+1.75.0" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 65b72e3054eb0a4426f5d01abff4d47aab7ca408b058fda2fc53d6f5bf9db26c
[INFO] running `Command { std: "docker" "start" "-a" "65b72e3054eb0a4426f5d01abff4d47aab7ca408b058fda2fc53d6f5bf9db26c", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "65b72e3054eb0a4426f5d01abff4d47aab7ca408b058fda2fc53d6f5bf9db26c", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "65b72e3054eb0a4426f5d01abff4d47aab7ca408b058fda2fc53d6f5bf9db26c", kill_on_drop: false }`
[INFO] [stdout] 65b72e3054eb0a4426f5d01abff4d47aab7ca408b058fda2fc53d6f5bf9db26c
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-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:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+1.75.0" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] b0230228c8b105dc60b79dbbd9729bd9061076217c3d795abe3c4e7b3d51071c
[INFO] running `Command { std: "docker" "start" "-a" "b0230228c8b105dc60b79dbbd9729bd9061076217c3d795abe3c4e7b3d51071c", 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 ppv-lite86 v0.2.16
[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] [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 quicksort v0.1.0 (/opt/rustwide/workdir/algorithms/quicksort)
[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: 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<u128>, target: u128) -> Option<usize> {
[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: 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<Type>, asc: bool) -> Vec<Type> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 1 warning emitted
[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<Type>, asc: bool) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[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<u128>, target: u128, start: usize, stop: usize) -> Option<usize> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling sum_array v0.1.0 (/opt/rustwide/workdir/algorithms/sum_array)
[INFO] [stdout] warning: 3 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[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] [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<String>,
[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<String>) -> Vec<(String, i128)> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^
[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<u128>, asc: bool, partition: Box<dyn Partition>) -> Vec<u128> {
[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<u128>, asc: bool) -> Vec<u128> {
[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<u128>, 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 hash_table v0.1.0 (/opt/rustwide/workdir/algorithms/hash_table)
[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>) -> 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>) -> Type {
[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] [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: 2 warnings emitted
[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: 3 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 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<dyn Fn(&str) -> 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<DataType> {
[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: 4 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 7 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] [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<T> Node<T>
[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<T> {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |       fn add_edge(&mut self, node: Link<T>, weight: Weight) -> &mut Self {
[INFO] [stdout]    |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |       fn traverse_depth_first<F>(&self, act: &F, seen: &mut HashSet<NodeName>)
[INFO] [stdout]    |          ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57 |       fn traverse_breadth_first<F>(&self, act: &F, seen: &mut HashSet<NodeName>)
[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<T>(root: Link<T>, target: &str) -> Option<T>
[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<T>(node: &Node<T>) {
[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<T>(edge: &Edge<T>) -> 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<T>(root: Link<T>) -> VecDeque<Link<T>> {
[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<T>(
[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<T>(root: Link<T>) -> (HashMap<NodeName, Weight>, HashMap<NodeName, Option<Link<T>>>)
[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<T>(
[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<T>(root: Link<T>) -> (HashMap<NodeName, Weight>, HashMap<NodeName, Option<Link<T>>>)
[INFO] [stdout]     |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 10 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling greedy v0.1.0 (/opt/rustwide/workdir/algorithms/greedy)
[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<Class>) -> Vec<Class> {
[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 1.41s
[INFO] running `Command { std: "docker" "inspect" "b0230228c8b105dc60b79dbbd9729bd9061076217c3d795abe3c4e7b3d51071c", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "b0230228c8b105dc60b79dbbd9729bd9061076217c3d795abe3c4e7b3d51071c", kill_on_drop: false }`
[INFO] [stdout] b0230228c8b105dc60b79dbbd9729bd9061076217c3d795abe3c4e7b3d51071c
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-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:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+1.75.0" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 931cfd998e20c8b3130c73f8579f6376984c6cee49f3d7ed457fd5fd87ed8505
[INFO] running `Command { std: "docker" "start" "-a" "931cfd998e20c8b3130c73f8579f6376984c6cee49f3d7ed457fd5fd87ed8505", 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: 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] [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<Type>, asc: bool) -> Vec<Type> {
[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<Type>, asc: bool) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 3 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<dyn Fn(&str) -> 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<DataType> {
[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<u128>, asc: bool, partition: Box<dyn Partition>) -> Vec<u128> {
[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<u128>, asc: bool) -> Vec<u128> {
[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<u128>, 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: 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<String>,
[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<String>) -> Vec<(String, i128)> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 4 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: 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<u128>, target: u128) -> Option<usize> {
[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<u128>, target: u128, start: usize, stop: usize) -> Option<usize> {
[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: 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>) -> 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>) -> Type {
[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] [stderr]    Compiling binary_search v0.1.0 (/opt/rustwide/workdir/algorithms/binary_search)
[INFO] [stderr]    Compiling n_9_palindrome_number v0.1.0 (/opt/rustwide/workdir/problems/n_9_palindrome_number)
[INFO] [stderr]    Compiling dynamic v0.1.0 (/opt/rustwide/workdir/algorithms/dynamic)
[INFO] [stderr]    Compiling selection_sort v0.1.0 (/opt/rustwide/workdir/algorithms/selection_sort)
[INFO] [stderr]    Compiling n_125_valid_palindrome v0.1.0 (/opt/rustwide/workdir/problems/n_125_valid_palindrome)
[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<Class>) -> Vec<Class> {
[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<T> Node<T>
[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<T> {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |       fn add_edge(&mut self, node: Link<T>, weight: Weight) -> &mut Self {
[INFO] [stdout]    |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |       fn traverse_depth_first<F>(&self, act: &F, seen: &mut HashSet<NodeName>)
[INFO] [stdout]    |          ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57 |       fn traverse_breadth_first<F>(&self, act: &F, seen: &mut HashSet<NodeName>)
[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<T>(root: Link<T>, target: &str) -> Option<T>
[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<T>(node: &Node<T>) {
[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<T>(edge: &Edge<T>) -> 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<T>(root: Link<T>) -> VecDeque<Link<T>> {
[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<T>(
[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<T>(root: Link<T>) -> (HashMap<NodeName, Weight>, HashMap<NodeName, Option<Link<T>>>)
[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<T>(
[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<T>(root: Link<T>) -> (HashMap<NodeName, Weight>, HashMap<NodeName, Option<Link<T>>>)
[INFO] [stdout]     |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 10 warnings emitted
[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: 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]    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] [stderr]    Compiling hash_table v0.1.0 (/opt/rustwide/workdir/algorithms/hash_table)
[INFO] [stdout] warning: 1 warning emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished test [unoptimized + debuginfo] target(s) in 0.81s
[INFO] running `Command { std: "docker" "inspect" "931cfd998e20c8b3130c73f8579f6376984c6cee49f3d7ed457fd5fd87ed8505", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "931cfd998e20c8b3130c73f8579f6376984c6cee49f3d7ed457fd5fd87ed8505", kill_on_drop: false }`
[INFO] [stdout] 931cfd998e20c8b3130c73f8579f6376984c6cee49f3d7ed457fd5fd87ed8505
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-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:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+1.75.0" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] 8b69e98a4ae6f66b01d0b67c4d3811631b907f960a048e9e01feaef985772ca1
[INFO] running `Command { std: "docker" "start" "-a" "8b69e98a4ae6f66b01d0b67c4d3811631b907f960a048e9e01feaef985772ca1", 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: 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<u128>, target: u128) -> Option<usize> {
[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<u128>, target: u128, start: usize, stop: usize) -> Option<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<String>,
[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<String>) -> Vec<(String, i128)> {
[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: `n_9_palindrome_number` (lib) generated 2 warnings
[INFO] [stderr] warning: `binary_search` (lib) generated 2 warnings
[INFO] [stderr] warning: `dynamic` (lib) generated 4 warnings
[INFO] [stderr] warning: `find_max_size_square_plots` (lib) generated 1 warning
[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>) -> 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>) -> Type {
[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<dyn Fn(&str) -> 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<DataType> {
[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: 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: 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<Type>, asc: bool) -> Vec<Type> {
[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<Type>, asc: bool) -> usize {
[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<u128>, asc: bool, partition: Box<dyn Partition>) -> Vec<u128> {
[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<u128>, asc: bool) -> Vec<u128> {
[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<u128>, i1: usize, i2: usize, asc: bool) {
[INFO] [stderr]     |    ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `sum_array` (lib) generated 3 warnings
[INFO] [stderr] warning: `hash_table` (lib) generated 7 warnings
[INFO] [stderr] warning: `n_125_valid_palindrome` (lib) generated 2 warnings
[INFO] [stderr] warning: `selection_sort` (lib) generated 3 warnings
[INFO] [stderr] warning: `quicksort` (lib) generated 4 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<T> Node<T>
[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<T> {
[INFO] [stderr]    |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 38 |       fn add_edge(&mut self, node: Link<T>, weight: Weight) -> &mut Self {
[INFO] [stderr]    |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 43 |       fn traverse_depth_first<F>(&self, act: &F, seen: &mut HashSet<NodeName>)
[INFO] [stderr]    |          ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 57 |       fn traverse_breadth_first<F>(&self, act: &F, seen: &mut HashSet<NodeName>)
[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<T>(root: Link<T>, target: &str) -> Option<T>
[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<T>(node: &Node<T>) {
[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<T>(edge: &Edge<T>) -> 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<T>(root: Link<T>) -> VecDeque<Link<T>> {
[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<T>(
[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<T>(root: Link<T>) -> (HashMap<NodeName, Weight>, HashMap<NodeName, Option<Link<T>>>)
[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<T>(
[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<T>(root: Link<T>) -> (HashMap<NodeName, Weight>, HashMap<NodeName, Option<Link<T>>>)
[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<Class>) -> Vec<Class> {
[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-51ab1dc9ca0fd8fb)
[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-ab183bc0cf388800)
[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.34s
[INFO] [stdout] 
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/find_max_size_square_plots-5e8c181b4097683b)
[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-9946b530a9388059)
[INFO] [stdout] 
[INFO] [stdout] running 7 tests
[INFO] [stdout] test tests::test_breadth_first_search ... ok
[INFO] [stdout] test tests::test_breadth_first_traverse ... ok
[INFO] [stdout] test tests::test_bellman_ford ... ok
[INFO] [stdout] test tests::test_depth_first_traverse ... ok
[INFO] [stdout] test tests::test_breadth_first_topology_sort ... ok
[INFO] [stdout] test tests::test_dijkstra ... ok
[INFO] [stdout] test tests::test_rand ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 7 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.01s
[INFO] [stdout] 
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/greedy-2d4f74bd5df71bb6)
[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 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:     0x5578312f6fdc - std::backtrace_rs::backtrace::libunwind::trace::ha637c64ce894333a
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/../../backtrace/src/backtrace/libunwind.rs:104:5
[INFO] [stdout]    1:     0x5578312f6fdc - std::backtrace_rs::backtrace::trace_unsynchronized::h47f62dea28e0c88d
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/../../backtrace/src/backtrace/mod.rs:66:5
[INFO] [stdout]    2:     0x5578312f6fdc - std::sys_common::backtrace::_print_fmt::h9eef0abe20ede486
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/sys_common/backtrace.rs:67:5
[INFO] [stdout]    3:     0x5578312f6fdc - <std::sys_common::backtrace::_print::DisplayBacktrace as core::fmt::Display>::fmt::hed7f999df88cc644
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/sys_common/backtrace.rs:44:22
[INFO] [stdout]    4:     0x557831320bd0 - core::fmt::rt::Argument::fmt::h1539a9308b8d058d
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/core/src/fmt/rt.rs:142:9
[INFO] [stdout]    5:     0x557831320bd0 - core::fmt::write::h3a39390d8560d9c9
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/core/src/fmt/mod.rs:1120:17
[INFO] [stdout]    6:     0x5578312f498f - std::io::Write::write_fmt::h040b369f3a0f9cbc
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/io/mod.rs:1762:15
[INFO] [stdout]    7:     0x5578312f6dc4 - std::sys_common::backtrace::_print::h894006fb5c6f3d45
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/sys_common/backtrace.rs:47:5
[INFO] [stdout]    8:     0x5578312f6dc4 - std::sys_common::backtrace::print::h23a2d212c6fff936
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/sys_common/backtrace.rs:34:9
[INFO] [stdout]    9:     0x5578312f8a87 - std::panicking::default_hook::{{closure}}::h8a1d2ee00185001a
[INFO] [stdout]   10:     0x5578312f8773 - std::panicking::default_hook::h6038f2eba384e475
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/panicking.rs:289:9
[INFO] [stdout]   11:     0x5578312a5cd7 - <alloc::boxed::Box<F,A> as core::ops::function::Fn<Args>>::call::h0ad024c9bdc6d768
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/alloc/src/boxed.rs:2021:9
[INFO] [stdout]   12:     0x5578312a5cd7 - test::test_main::{{closure}}::h7500b54257359db6
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/test/src/lib.rs:138:21
[INFO] [stdout]   13:     0x5578312f9098 - <alloc::boxed::Box<F,A> as core::ops::function::Fn<Args>>::call::h1f8f335eaa9cfaee
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/alloc/src/boxed.rs:2021:9
[INFO] [stdout]   14:     0x5578312f9098 - std::panicking::rust_panic_with_hook::h2b5517d590cab22e
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/panicking.rs:783:13
[INFO] [stdout]   15:     0x5578312f8dee - std::panicking::begin_panic_handler::{{closure}}::h233112c06e0ef43e
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/panicking.rs:657:13
[INFO] [stdout]   16:     0x5578312f74a6 - std::sys_common::backtrace::__rust_end_short_backtrace::h6e893f24d7ebbff8
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/sys_common/backtrace.rs:170:18
[INFO] [stdout]   17:     0x5578312f8b52 - rust_begin_unwind
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/panicking.rs:645:5
[INFO] [stdout]   18:     0x557831247cf5 - core::panicking::panic_fmt::hbf0e066aabfa482c
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/core/src/panicking.rs:72:14
[INFO] [stdout]   19:     0x55783124810b - core::panicking::assert_failed_inner::h0bba8b7c26ee4492
[INFO] [stdout]   20:     0x55783125f6fe - core::panicking::assert_failed::h174de1f64784c03e
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/core/src/panicking.rs:279:5
[INFO] [stdout]   21:     0x557831264af4 - greedy::tests::test_covering_problem::hb2d0b1ee335d6680
[INFO] [stdout]                                at /opt/rustwide/workdir/algorithms/greedy/src/lib.rs:170:9
[INFO] [stdout]   22:     0x557831264207 - greedy::tests::test_covering_problem::{{closure}}::hfa206d2becfa3643
[INFO] [stdout]                                at /opt/rustwide/workdir/algorithms/greedy/src/lib.rs:155:31
[INFO] [stdout]   23:     0x5578312614e6 - core::ops::function::FnOnce::call_once::hdcc033d0b76023d2
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/core/src/ops/function.rs:250:5
[INFO] [stdout]   24:     0x5578312ab32f - core::ops::function::FnOnce::call_once::h2b5d431d5046312d
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/core/src/ops/function.rs:250:5
[INFO] [stdout]   25:     0x5578312ab32f - test::__rust_begin_short_backtrace::h7714669af176e207
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/test/src/lib.rs:628:18
[INFO] [stdout]   26:     0x5578312aa345 - test::run_test_in_process::{{closure}}::h85218797dcbcec12
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/test/src/lib.rs:651:60
[INFO] [stdout]   27:     0x5578312aa345 - <core::panic::unwind_safe::AssertUnwindSafe<F> as core::ops::function::FnOnce<()>>::call_once::h76c106ea31c14d7b
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/core/src/panic/unwind_safe.rs:272:9
[INFO] [stdout]   28:     0x5578312aa345 - std::panicking::try::do_call::h3bd5d0f6620ee946
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/panicking.rs:552:40
[INFO] [stdout]   29:     0x5578312aa345 - std::panicking::try::h232e535e4744fe31
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/panicking.rs:516:19
[INFO] [stdout]   30:     0x5578312aa345 - std::panic::catch_unwind::h3ce3bd6ca8dbac68
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/panic.rs:142:14
[INFO] [stdout]   31:     0x5578312aa345 - test::run_test_in_process::hc97b257c9621286a
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/test/src/lib.rs:651:27
[INFO] [stdout]   32:     0x5578312aa345 - test::run_test::{{closure}}::h2aa798823a438d38
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/test/src/lib.rs:574:43
[INFO] [stdout]   33:     0x557831272606 - test::run_test::{{closure}}::h87d231c78fb59832
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/test/src/lib.rs:602:41
[INFO] [stdout]   34:     0x557831272606 - std::sys_common::backtrace::__rust_begin_short_backtrace::he6df152596625789
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/sys_common/backtrace.rs:154:18
[INFO] [stdout]   35:     0x5578312776b7 - std::thread::Builder::spawn_unchecked_::{{closure}}::{{closure}}::ha94be15d1e0acf36
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/thread/mod.rs:529:17
[INFO] [stdout]   36:     0x5578312776b7 - <core::panic::unwind_safe::AssertUnwindSafe<F> as core::ops::function::FnOnce<()>>::call_once::h9dc6bd6372f16606
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/core/src/panic/unwind_safe.rs:272:9
[INFO] [stdout]   37:     0x5578312776b7 - std::panicking::try::do_call::h9057517f80303cd4
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/panicking.rs:552:40
[INFO] [stdout]   38:     0x5578312776b7 - std::panicking::try::he3a30b11ee45340c
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/panicking.rs:516:19
[INFO] [stdout]   39:     0x5578312776b7 - std::panic::catch_unwind::h410458cfd3528b8b
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/panic.rs:142:14
[INFO] [stdout]   40:     0x5578312776b7 - std::thread::Builder::spawn_unchecked_::{{closure}}::h72ac3bdb567b737b
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/thread/mod.rs:528:30
[INFO] [stdout]   41:     0x5578312776b7 - core::ops::function::FnOnce::call_once{{vtable.shim}}::h38f34da3654a8344
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/core/src/ops/function.rs:250:5
[INFO] [stdout]   42:     0x5578312fdb25 - <alloc::boxed::Box<F,A> as core::ops::function::FnOnce<Args>>::call_once::hc7eafaff61e32df9
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/alloc/src/boxed.rs:2007:9
[INFO] [stdout]   43:     0x5578312fdb25 - <alloc::boxed::Box<F,A> as core::ops::function::FnOnce<Args>>::call_once::h6ba4a5de48dd2304
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/alloc/src/boxed.rs:2007:9
[INFO] [stdout]   44:     0x5578312fdb25 - std::sys::unix::thread::Thread::new::thread_start::he469335aef763e45
[INFO] [stdout]                                at /rustc/82e1608dfa6e0b5569232559e3d385fea5a93112/library/std/src/sys/unix/thread.rs:108:17
[INFO] [stdout]   45:     0x7fe7bc0afac3 - <unknown>
[INFO] [stdout]   46:     0x7fe7bc140bf4 - __clone
[INFO] [stdout]   47:                0x0 - <unknown>
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] failures:
[INFO] [stdout]     tests::test_covering_problem
[INFO] [stdout] 
[INFO] [stdout] test result: FAILED. 2 passed; 1 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.01s
[INFO] [stdout] 
[INFO] [stderr] error: test failed, to rerun pass `-p greedy --lib`
[INFO] running `Command { std: "docker" "inspect" "8b69e98a4ae6f66b01d0b67c4d3811631b907f960a048e9e01feaef985772ca1", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "8b69e98a4ae6f66b01d0b67c4d3811631b907f960a048e9e01feaef985772ca1", kill_on_drop: false }`
[INFO] [stdout] 8b69e98a4ae6f66b01d0b67c4d3811631b907f960a048e9e01feaef985772ca1
[INFO] testing lavrxxx/leetcode against beta-2023-12-22 for beta-1.76-1
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Flavrxxx%2Fleetcode" "/workspace/builds/worker-1-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-1-tc2/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/lavrxxx/leetcode on toolchain beta-2023-12-22
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+beta-2023-12-22" "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-1-tc2/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" "+beta-2023-12-22" "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] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2023-12-22" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 4af931c61ee0e4f73df51f07d53b8364067b62329f37c782b8e2078ee751f152
[INFO] running `Command { std: "docker" "start" "-a" "4af931c61ee0e4f73df51f07d53b8364067b62329f37c782b8e2078ee751f152", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "4af931c61ee0e4f73df51f07d53b8364067b62329f37c782b8e2078ee751f152", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "4af931c61ee0e4f73df51f07d53b8364067b62329f37c782b8e2078ee751f152", kill_on_drop: false }`
[INFO] [stdout] 4af931c61ee0e4f73df51f07d53b8364067b62329f37c782b8e2078ee751f152
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-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:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2023-12-22" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] cc907a833a5a9d9cac2e33b2f34a5d401425db0a6d8174ca0c8b9282d53c2dfc
[INFO] running `Command { std: "docker" "start" "-a" "cc907a833a5a9d9cac2e33b2f34a5d401425db0a6d8174ca0c8b9282d53c2dfc", 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 ppv-lite86 v0.2.16
[INFO] [stderr]    Compiling binary_search v0.1.0 (/opt/rustwide/workdir/algorithms/binary_search)
[INFO] [stderr]    Compiling quicksort v0.1.0 (/opt/rustwide/workdir/algorithms/quicksort)
[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] [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 `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<u128>, target: u128) -> Option<usize> {
[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<u128>, target: u128, start: usize, stop: usize) -> Option<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: 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>) -> 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>) -> Type {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[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: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling dynamic v0.1.0 (/opt/rustwide/workdir/algorithms/dynamic)
[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] [stderr]    Compiling hash_table v0.1.0 (/opt/rustwide/workdir/algorithms/hash_table)
[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<u128>, asc: bool, partition: Box<dyn Partition>) -> Vec<u128> {
[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<u128>, asc: bool) -> Vec<u128> {
[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<u128>, i1: usize, i2: usize, asc: 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: 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<Type>, asc: bool) -> Vec<Type> {
[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<Type>, asc: bool) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 1 warning emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 3 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<dyn Fn(&str) -> 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<DataType> {
[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<String>,
[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<String>) -> Vec<(String, i128)> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 7 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 4 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 4 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling num-traits v0.2.14
[INFO] [stderr]    Compiling num-integer v0.1.45
[INFO] [stderr]    Compiling getrandom v0.2.6
[INFO] [stderr]    Compiling time v0.1.43
[INFO] [stderr]    Compiling rand_core v0.6.3
[INFO] [stderr]    Compiling rand_chacha v0.3.1
[INFO] [stderr]    Compiling rand v0.8.5
[INFO] [stderr]    Compiling chrono v0.4.19
[INFO] [stderr]    Compiling graph v0.1.0 (/opt/rustwide/workdir/algorithms/graph)
[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<T> Node<T>
[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<T> {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |       fn add_edge(&mut self, node: Link<T>, weight: Weight) -> &mut Self {
[INFO] [stdout]    |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |       fn traverse_depth_first<F>(&self, act: &F, seen: &mut HashSet<NodeName>)
[INFO] [stdout]    |          ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57 |       fn traverse_breadth_first<F>(&self, act: &F, seen: &mut HashSet<NodeName>)
[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<T>(root: Link<T>, target: &str) -> Option<T>
[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<T>(node: &Node<T>) {
[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<T>(edge: &Edge<T>) -> 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<T>(root: Link<T>) -> VecDeque<Link<T>> {
[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<T>(
[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<T>(root: Link<T>) -> (HashMap<NodeName, Weight>, HashMap<NodeName, Option<Link<T>>>)
[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<T>(
[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<T>(root: Link<T>) -> (HashMap<NodeName, Weight>, HashMap<NodeName, Option<Link<T>>>)
[INFO] [stdout]     |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 10 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling greedy v0.1.0 (/opt/rustwide/workdir/algorithms/greedy)
[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<Class>) -> Vec<Class> {
[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 1.41s
[INFO] running `Command { std: "docker" "inspect" "cc907a833a5a9d9cac2e33b2f34a5d401425db0a6d8174ca0c8b9282d53c2dfc", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "cc907a833a5a9d9cac2e33b2f34a5d401425db0a6d8174ca0c8b9282d53c2dfc", kill_on_drop: false }`
[INFO] [stdout] cc907a833a5a9d9cac2e33b2f34a5d401425db0a6d8174ca0c8b9282d53c2dfc
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-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:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2023-12-22" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 9c21959433cc41bd0082cfcf8b314e8942cea840e1c45960984c8f82849c73a2
[INFO] running `Command { std: "docker" "start" "-a" "9c21959433cc41bd0082cfcf8b314e8942cea840e1c45960984c8f82849c73a2", 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: 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<u128>, target: u128) -> Option<usize> {
[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<u128>, target: u128, start: usize, stop: usize) -> Option<usize> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 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<dyn Fn(&str) -> 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<DataType> {
[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 `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] [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<Type>, asc: bool) -> Vec<Type> {
[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<Type>, asc: bool) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 3 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: 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<String>,
[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<String>) -> Vec<(String, i128)> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 4 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<u128>, asc: bool, partition: Box<dyn Partition>) -> Vec<u128> {
[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<u128>, asc: bool) -> Vec<u128> {
[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<u128>, 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/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>) -> 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>) -> Type {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 3 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] [stderr]    Compiling selection_sort v0.1.0 (/opt/rustwide/workdir/algorithms/selection_sort)
[INFO] [stderr]    Compiling find_max_size_square_plots v0.1.0 (/opt/rustwide/workdir/algorithms/find_max_size_square_plots)
[INFO] [stderr]    Compiling 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 sum_array v0.1.0 (/opt/rustwide/workdir/algorithms/sum_array)
[INFO] [stderr]    Compiling quicksort v0.1.0 (/opt/rustwide/workdir/algorithms/quicksort)
[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<T> Node<T>
[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<T> {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |       fn add_edge(&mut self, node: Link<T>, weight: Weight) -> &mut Self {
[INFO] [stdout]    |          ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 43 |       fn traverse_depth_first<F>(&self, act: &F, seen: &mut HashSet<NodeName>)
[INFO] [stdout]    |          ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 57 |       fn traverse_breadth_first<F>(&self, act: &F, seen: &mut HashSet<NodeName>)
[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<T>(root: Link<T>, target: &str) -> Option<T>
[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<T>(node: &Node<T>) {
[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<T>(edge: &Edge<T>) -> 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<T>(root: Link<T>) -> VecDeque<Link<T>> {
[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<T>(
[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<T>(root: Link<T>) -> (HashMap<NodeName, Weight>, HashMap<NodeName, Option<Link<T>>>)
[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<T>(
[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<T>(root: Link<T>) -> (HashMap<NodeName, Weight>, HashMap<NodeName, Option<Link<T>>>)
[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<Class>) -> Vec<Class> {
[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]    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: 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]    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] [stdout] warning: 1 warning emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished test [unoptimized + debuginfo] target(s) in 0.81s
[INFO] running `Command { std: "docker" "inspect" "9c21959433cc41bd0082cfcf8b314e8942cea840e1c45960984c8f82849c73a2", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "9c21959433cc41bd0082cfcf8b314e8942cea840e1c45960984c8f82849c73a2", kill_on_drop: false }`
[INFO] [stdout] 9c21959433cc41bd0082cfcf8b314e8942cea840e1c45960984c8f82849c73a2
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-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:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2023-12-22" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] a7072023e4d840454a4b5b953495d1668963385cefa46650ed31f69b9d11d75c
[INFO] running `Command { std: "docker" "start" "-a" "a7072023e4d840454a4b5b953495d1668963385cefa46650ed31f69b9d11d75c", 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: 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>) -> 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>) -> Type {
[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<u128>, target: u128) -> Option<usize> {
[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<u128>, target: u128, start: usize, stop: usize) -> Option<usize> {
[INFO] [stderr]    |    ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `n_9_palindrome_number` (lib) generated 2 warnings
[INFO] [stderr] warning: `sum_array` (lib) generated 3 warnings
[INFO] [stderr] warning: `binary_search` (lib) generated 2 warnings
[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: 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<Type>, asc: bool) -> Vec<Type> {
[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<Type>, asc: bool) -> usize {
[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<u128>, asc: bool, partition: Box<dyn Partition>) -> Vec<u128> {
[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<u128>, asc: bool) -> Vec<u128> {
[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<u128>, i1: usize, i2: usize, asc: bool) {
[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<String>,
[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<String>) -> Vec<(String, i128)> {
[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: `n_125_valid_palindrome` (lib) generated 2 warnings
[INFO] [stderr] warning: `selection_sort` (lib) generated 3 warnings
[INFO] [stderr] warning: `quicksort` (lib) generated 4 warnings
[INFO] [stderr] warning: `dynamic` (lib) generated 4 warnings
[INFO] [stderr] warning: `find_max_size_square_plots` (lib) generated 1 warning
[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<dyn Fn(&str) -> 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<DataType> {
[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: `hash_table` (lib) generated 7 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<Class>) -> Vec<Class> {
[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: 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<T> Node<T>
[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<T> {
[INFO] [stderr]    |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 38 |       fn add_edge(&mut self, node: Link<T>, weight: Weight) -> &mut Self {
[INFO] [stderr]    |          ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 43 |       fn traverse_depth_first<F>(&self, act: &F, seen: &mut HashSet<NodeName>)
[INFO] [stderr]    |          ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 57 |       fn traverse_breadth_first<F>(&self, act: &F, seen: &mut HashSet<NodeName>)
[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<T>(root: Link<T>, target: &str) -> Option<T>
[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<T>(node: &Node<T>) {
[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<T>(edge: &Edge<T>) -> 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<T>(root: Link<T>) -> VecDeque<Link<T>> {
[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<T>(
[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<T>(root: Link<T>) -> (HashMap<NodeName, Weight>, HashMap<NodeName, Option<Link<T>>>)
[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<T>(
[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<T>(root: Link<T>) -> (HashMap<NodeName, Weight>, HashMap<NodeName, Option<Link<T>>>)
[INFO] [stderr]     |    ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `greedy` (lib) generated 5 warnings
[INFO] [stderr] warning: `graph` (lib) generated 10 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-1e7316c46dacad8f)
[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-0ffb4666954c4ca1)
[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.35s
[INFO] [stdout] 
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/find_max_size_square_plots-d0bd424a025638b4)
[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-09e0057fa3d8dd0a)
[INFO] [stdout] 
[INFO] [stdout] running 7 tests
[INFO] [stdout] test tests::test_breadth_first_search ... ok
[INFO] [stdout] test tests::test_depth_first_traverse ... 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_topology_sort ... ok
[INFO] [stdout] test tests::test_dijkstra ... ok
[INFO] [stdout] test tests::test_rand ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 7 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.02s
[INFO] [stdout] 
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/greedy-226e88cdffcaf539)
[INFO] [stdout] 
[INFO] [stdout] running 3 tests
[INFO] [stdout] test tests::test_covering_problem ... ok
[INFO] [stdout] test tests::test_schedule_problem ... ok
[INFO] [stdout] test tests::test_salesperson_problem ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 3 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/hash_table-b9fb36f67d6a19ca)
[INFO] [stdout] 
[INFO] [stdout] running 1 test
[INFO] [stdout] test tests::test_mod_ver1 ... 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/n_125_valid_palindrome-e3cbfc437fc817ab)
[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/n_9_palindrome_number-e87a07712aa8b249)
[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/quicksort-d08833f1a992e8e3)
[INFO] [stdout] 
[INFO] [stdout] running 3 tests
[INFO] [stdout] test tests::test_quicksort_hoare ... ok
[INFO] [stdout] test tests::test_quicksort_lomuto ... ok
[INFO] [stdout] test tests::test_quicksort_recursive ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 3 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/selection_sort-487c2b3bf3498bde)
[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/sum_array-66a23df707442828)
[INFO] [stdout] 
[INFO] [stdout] running 2 tests
[INFO] [stdout] test tests::test_sum ... ok
[INFO] [stdout] test tests::test_sum_recursive_dc ... 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]    Doc-tests binary_search
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests dynamic
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests find_max_size_square_plots
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests graph
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests greedy
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests hash_table
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests n_125_valid_palindrome
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests n_9_palindrome_number
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests quicksort
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests selection_sort
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests sum_array
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] running `Command { std: "docker" "inspect" "a7072023e4d840454a4b5b953495d1668963385cefa46650ed31f69b9d11d75c", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "a7072023e4d840454a4b5b953495d1668963385cefa46650ed31f69b9d11d75c", kill_on_drop: false }`
[INFO] [stdout] a7072023e4d840454a4b5b953495d1668963385cefa46650ed31f69b9d11d75c
