[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.84.0 for beta-1.85-1
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Flavrxxx%2Fleetcode" "/workspace/builds/worker-2-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-2-tc1/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/lavrxxx/leetcode on toolchain 1.84.0
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1.84.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-2-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.84.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-2-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-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:86ea7c7af713d31e8cfdb68a6d0db50b5cf7cbeecde3d112f9f257f747318d36" "/opt/rustwide/cargo-home/bin/cargo" "+1.84.0" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] ff5283663e9af187f3f50dce36816ac8394b5922356697c7444a9871a5bc20da
[INFO] running `Command { std: "docker" "start" "-a" "ff5283663e9af187f3f50dce36816ac8394b5922356697c7444a9871a5bc20da", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "ff5283663e9af187f3f50dce36816ac8394b5922356697c7444a9871a5bc20da", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "ff5283663e9af187f3f50dce36816ac8394b5922356697c7444a9871a5bc20da", kill_on_drop: false }`
[INFO] [stdout] ff5283663e9af187f3f50dce36816ac8394b5922356697c7444a9871a5bc20da
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-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:86ea7c7af713d31e8cfdb68a6d0db50b5cf7cbeecde3d112f9f257f747318d36" "/opt/rustwide/cargo-home/bin/cargo" "+1.84.0" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 570d044211b77b718e38c117fcbf4dea638b6ecba34e04fc33042a8564d1d334
[INFO] running `Command { std: "docker" "start" "-a" "570d044211b77b718e38c117fcbf4dea638b6ecba34e04fc33042a8564d1d334", kill_on_drop: false }`
[INFO] [stderr] warning: virtual workspace defaulting to `resolver = "1"` despite one or more workspace members being on edition 2021 which implies `resolver = "2"`
[INFO] [stderr] note: to keep the current resolver, specify `workspace.resolver = "1"` in the workspace root's manifest
[INFO] [stderr] note: to use the edition 2021 resolver, specify `workspace.resolver = "2"` in the workspace root's manifest
[INFO] [stderr] note: for more details see https://doc.rust-lang.org/cargo/reference/resolver.html#resolver-versions
[INFO] [stderr]    Compiling libc v0.2.124
[INFO] [stderr]    Compiling autocfg v1.1.0
[INFO] [stderr]    Compiling cfg-if v1.0.0
[INFO] [stderr]    Compiling ppv-lite86 v0.2.16
[INFO] [stderr]    Compiling 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 n_125_valid_palindrome v0.1.0 (/opt/rustwide/workdir/problems/n_125_valid_palindrome)
[INFO] [stderr]    Compiling sum_array v0.1.0 (/opt/rustwide/workdir/algorithms/sum_array)
[INFO] [stderr]    Compiling dynamic v0.1.0 (/opt/rustwide/workdir/algorithms/dynamic)
[INFO] [stderr]    Compiling n_9_palindrome_number v0.1.0 (/opt/rustwide/workdir/problems/n_9_palindrome_number)
[INFO] [stderr]    Compiling quicksort v0.1.0 (/opt/rustwide/workdir/algorithms/quicksort)
[INFO] [stderr]    Compiling find_max_size_square_plots v0.1.0 (/opt/rustwide/workdir/algorithms/find_max_size_square_plots)
[INFO] [stderr]    Compiling hash_table v0.1.0 (/opt/rustwide/workdir/algorithms/hash_table)
[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: function `find` is never used
[INFO] [stdout]  --> algorithms/find_max_size_square_plots/src/lib.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn find(height: u128, width: u128) -> u128 {
[INFO] [stdout]   |    ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> problems/n_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: 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: 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: trait `Partition` is never used
[INFO] [stdout]  --> algorithms/quicksort/src/lib.rs:1:7
[INFO] [stdout]   |
[INFO] [stdout] 1 | trait Partition {
[INFO] [stdout]   |       ^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `quicksort` is never used
[INFO] [stdout]   --> algorithms/quicksort/src/lib.rs:11:4
[INFO] [stdout]    |
[INFO] [stdout] 11 | fn quicksort(mut v: Vec<u128>, asc: bool, partition: Box<dyn Partition>) -> Vec<u128> {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Hoare` is never constructed
[INFO] [stdout]   --> algorithms/quicksort/src/lib.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Hoare {}
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Lomuto` is never constructed
[INFO] [stdout]   --> algorithms/quicksort/src/lib.rs:89:8
[INFO] [stdout]    |
[INFO] [stdout] 89 | struct Lomuto {}
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `quicksort_recursive` is never used
[INFO] [stdout]    --> algorithms/quicksort/src/lib.rs:129:4
[INFO] [stdout]     |
[INFO] [stdout] 129 | fn quicksort_recursive(mut v: Vec<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_force` is never used
[INFO] [stdout]    --> algorithms/quicksort/src/lib.rs:181:4
[INFO] [stdout]     |
[INFO] [stdout] 181 | fn swap_force(v: &mut Vec<u128>, i1: usize, i2: usize) {
[INFO] [stdout]     |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `swap` is never used
[INFO] [stdout]    --> algorithms/quicksort/src/lib.rs:187:4
[INFO] [stdout]     |
[INFO] [stdout] 187 | fn swap(v: &mut Vec<u128>, i1: usize, i2: usize, asc: bool) {
[INFO] [stdout]     |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `SIZE` is never used
[INFO] [stdout]  --> algorithms/hash_table/src/lib.rs:1:7
[INFO] [stdout]   |
[INFO] [stdout] 1 | const SIZE: usize = 10;
[INFO] [stdout]   |       ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `HashFn` is never used
[INFO] [stdout]  --> algorithms/hash_table/src/lib.rs:3:6
[INFO] [stdout]   |
[INFO] [stdout] 3 | type HashFn = Box<dyn Fn(&str) -> usize>;
[INFO] [stdout]   |      ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `DataType` is never used
[INFO] [stdout]  --> algorithms/hash_table/src/lib.rs:5:6
[INFO] [stdout]   |
[INFO] [stdout] 5 | type DataType = &'static str;
[INFO] [stdout]   |      ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Value` is never constructed
[INFO] [stdout]  --> algorithms/hash_table/src/lib.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct Value {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Value {
[INFO] [stdout]    | ---------- associated function in this implementation
[INFO] [stdout] 14 |     fn new(key: &str, data: DataType) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `HashTable` is never constructed
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct HashTable {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `get`, `delete`, and `load_factor` are never used
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | impl HashTable {
[INFO] [stdout]    | -------------- associated items in this implementation
[INFO] [stdout] 28 |     fn new(hash_fn: HashFn) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     fn insert(&mut self, key: &str, data: DataType) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     fn get(&self, key: &str) -> Option<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: type alias `Weight` is never used
[INFO] [stdout]  --> algorithms/dynamic/src/lib.rs:3:6
[INFO] [stdout]   |
[INFO] [stdout] 3 | type Weight = i128;
[INFO] [stdout]   |      ^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Price` is never used
[INFO] [stdout]  --> algorithms/dynamic/src/lib.rs:4:6
[INFO] [stdout]   |
[INFO] [stdout] 4 | type Price = i128;
[INFO] [stdout]   |      ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Item` is never constructed
[INFO] [stdout]  --> algorithms/dynamic/src/lib.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct Item {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Cell` is never constructed
[INFO] [stdout]   --> algorithms/dynamic/src/lib.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Cell {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `run_knapsack_problem` is never used
[INFO] [stdout]   --> algorithms/dynamic/src/lib.rs:19:4
[INFO] [stdout]    |
[INFO] [stdout] 19 | fn run_knapsack_problem(
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_common_substring` is never used
[INFO] [stdout]   --> algorithms/dynamic/src/lib.rs:87:4
[INFO] [stdout]    |
[INFO] [stdout] 87 | fn longest_common_substring(target: String, variants: Vec<String>) -> Vec<(String, i128)> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling num-traits v0.2.14
[INFO] [stderr]    Compiling num-integer v0.1.45
[INFO] [stderr]    Compiling getrandom v0.2.6
[INFO] [stderr]    Compiling time v0.1.43
[INFO] [stderr]    Compiling rand_core v0.6.3
[INFO] [stderr]    Compiling rand_chacha v0.3.1
[INFO] [stderr]    Compiling rand v0.8.5
[INFO] [stderr]    Compiling chrono v0.4.19
[INFO] [stderr]    Compiling graph v0.1.0 (/opt/rustwide/workdir/algorithms/graph)
[INFO] [stderr]    Compiling greedy v0.1.0 (/opt/rustwide/workdir/algorithms/greedy)
[INFO] [stdout] warning: enum `ActResult` is never used
[INFO] [stdout]   --> algorithms/graph/src/lib.rs:11:6
[INFO] [stdout]    |
[INFO] [stdout] 11 | enum ActResult {
[INFO] [stdout]    |      ^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `add_edge`, `traverse_depth_first`, and `traverse_breadth_first` are never used
[INFO] [stdout]   --> algorithms/graph/src/lib.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | / impl<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: struct `Class` is never constructed
[INFO] [stdout]  --> algorithms/greedy/src/lib.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Class {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> algorithms/greedy/src/lib.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Class {
[INFO] [stdout]    | ---------- associated function in this implementation
[INFO] [stdout] 13 |     fn new(name: &str, start: &str, stop: &str) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `schedule_problem` is never used
[INFO] [stdout]   --> algorithms/greedy/src/lib.rs:26:4
[INFO] [stdout]    |
[INFO] [stdout] 26 | fn schedule_problem(classes: Vec<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] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 3.44s
[INFO] running `Command { std: "docker" "inspect" "570d044211b77b718e38c117fcbf4dea638b6ecba34e04fc33042a8564d1d334", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "570d044211b77b718e38c117fcbf4dea638b6ecba34e04fc33042a8564d1d334", kill_on_drop: false }`
[INFO] [stdout] 570d044211b77b718e38c117fcbf4dea638b6ecba34e04fc33042a8564d1d334
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-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:86ea7c7af713d31e8cfdb68a6d0db50b5cf7cbeecde3d112f9f257f747318d36" "/opt/rustwide/cargo-home/bin/cargo" "+1.84.0" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 4386ea96af2c91c962dbc153c7aa8220d5aa79f5e3f8dc5444d06cef5ec8dc95
[INFO] running `Command { std: "docker" "start" "-a" "4386ea96af2c91c962dbc153c7aa8220d5aa79f5e3f8dc5444d06cef5ec8dc95", kill_on_drop: false }`
[INFO] [stderr] warning: virtual workspace defaulting to `resolver = "1"` despite one or more workspace members being on edition 2021 which implies `resolver = "2"`
[INFO] [stderr] note: to keep the current resolver, specify `workspace.resolver = "1"` in the workspace root's manifest
[INFO] [stderr] note: to use the edition 2021 resolver, specify `workspace.resolver = "2"` in the workspace root's manifest
[INFO] [stderr] note: for more details see https://doc.rust-lang.org/cargo/reference/resolver.html#resolver-versions
[INFO] [stdout] warning: enum `ActResult` is never used
[INFO] [stdout]   --> algorithms/graph/src/lib.rs:11:6
[INFO] [stdout]    |
[INFO] [stdout] 11 | enum ActResult {
[INFO] [stdout]    |      ^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `add_edge`, `traverse_depth_first`, and `traverse_breadth_first` are never used
[INFO] [stdout]   --> algorithms/graph/src/lib.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | / impl<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: struct `Class` is never constructed
[INFO] [stdout]  --> algorithms/greedy/src/lib.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | struct Class {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> algorithms/greedy/src/lib.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Class {
[INFO] [stdout]    | ---------- associated function in this implementation
[INFO] [stdout] 13 |     fn new(name: &str, start: &str, stop: &str) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `schedule_problem` is never used
[INFO] [stdout]   --> algorithms/greedy/src/lib.rs:26:4
[INFO] [stdout]    |
[INFO] [stdout] 26 | fn schedule_problem(classes: Vec<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: trait `Partition` is never used
[INFO] [stdout]  --> algorithms/quicksort/src/lib.rs:1:7
[INFO] [stdout]   |
[INFO] [stdout] 1 | trait Partition {
[INFO] [stdout]   |       ^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `quicksort` is never used
[INFO] [stdout]   --> algorithms/quicksort/src/lib.rs:11:4
[INFO] [stdout]    |
[INFO] [stdout] 11 | fn quicksort(mut v: Vec<u128>, asc: bool, partition: Box<dyn Partition>) -> Vec<u128> {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Hoare` is never constructed
[INFO] [stdout]   --> algorithms/quicksort/src/lib.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Hoare {}
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Lomuto` is never constructed
[INFO] [stdout]   --> algorithms/quicksort/src/lib.rs:89:8
[INFO] [stdout]    |
[INFO] [stdout] 89 | struct Lomuto {}
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `quicksort_recursive` is never used
[INFO] [stdout]    --> algorithms/quicksort/src/lib.rs:129:4
[INFO] [stdout]     |
[INFO] [stdout] 129 | fn quicksort_recursive(mut v: Vec<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_force` is never used
[INFO] [stdout]    --> algorithms/quicksort/src/lib.rs:181:4
[INFO] [stdout]     |
[INFO] [stdout] 181 | fn swap_force(v: &mut Vec<u128>, i1: usize, i2: usize) {
[INFO] [stdout]     |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `swap` is never used
[INFO] [stdout]    --> algorithms/quicksort/src/lib.rs:187:4
[INFO] [stdout]     |
[INFO] [stdout] 187 | fn swap(v: &mut Vec<u128>, i1: usize, i2: usize, asc: bool) {
[INFO] [stdout]     |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Weight` is never used
[INFO] [stdout]  --> algorithms/dynamic/src/lib.rs:3:6
[INFO] [stdout]   |
[INFO] [stdout] 3 | type Weight = i128;
[INFO] [stdout]   |      ^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Price` is never used
[INFO] [stdout]  --> algorithms/dynamic/src/lib.rs:4:6
[INFO] [stdout]   |
[INFO] [stdout] 4 | type Price = i128;
[INFO] [stdout]   |      ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Item` is never constructed
[INFO] [stdout]  --> algorithms/dynamic/src/lib.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct Item {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Cell` is never constructed
[INFO] [stdout]   --> algorithms/dynamic/src/lib.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | struct Cell {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `run_knapsack_problem` is never used
[INFO] [stdout]   --> algorithms/dynamic/src/lib.rs:19:4
[INFO] [stdout]    |
[INFO] [stdout] 19 | fn run_knapsack_problem(
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_common_substring` is never used
[INFO] [stdout]   --> algorithms/dynamic/src/lib.rs:87:4
[INFO] [stdout]    |
[INFO] [stdout] 87 | fn longest_common_substring(target: String, variants: Vec<String>) -> Vec<(String, i128)> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Type` is never used
[INFO] [stdout]  --> algorithms/selection_sort/src/lib.rs:1:6
[INFO] [stdout]   |
[INFO] [stdout] 1 | type Type = u128;
[INFO] [stdout]   |      ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `selection_sort` is never used
[INFO] [stdout]  --> algorithms/selection_sort/src/lib.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn selection_sort(mut v: Vec<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: 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] [stderr]    Compiling graph v0.1.0 (/opt/rustwide/workdir/algorithms/graph)
[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] [stderr]    Compiling greedy v0.1.0 (/opt/rustwide/workdir/algorithms/greedy)
[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] [stderr]    Compiling find_max_size_square_plots v0.1.0 (/opt/rustwide/workdir/algorithms/find_max_size_square_plots)
[INFO] [stdout] warning: type alias `DataType` is never used
[INFO] [stdout]  --> algorithms/hash_table/src/lib.rs:5:6
[INFO] [stdout]   |
[INFO] [stdout] 5 | type DataType = &'static str;
[INFO] [stdout]   |      ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling quicksort v0.1.0 (/opt/rustwide/workdir/algorithms/quicksort)
[INFO] [stdout] warning: struct `Value` is never constructed
[INFO] [stdout]  --> algorithms/hash_table/src/lib.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct Value {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling dynamic v0.1.0 (/opt/rustwide/workdir/algorithms/dynamic)
[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] [stderr]    Compiling binary_search v0.1.0 (/opt/rustwide/workdir/algorithms/binary_search)
[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: function `find` is never used
[INFO] [stdout]  --> algorithms/find_max_size_square_plots/src/lib.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn find(height: u128, width: u128) -> u128 {
[INFO] [stdout]   |    ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling selection_sort v0.1.0 (/opt/rustwide/workdir/algorithms/selection_sort)
[INFO] [stderr]    Compiling sum_array v0.1.0 (/opt/rustwide/workdir/algorithms/sum_array)
[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] [stderr]    Compiling n_9_palindrome_number v0.1.0 (/opt/rustwide/workdir/problems/n_9_palindrome_number)
[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 hash_table v0.1.0 (/opt/rustwide/workdir/algorithms/hash_table)
[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] [stderr]    Compiling n_125_valid_palindrome v0.1.0 (/opt/rustwide/workdir/problems/n_125_valid_palindrome)
[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: using `.clone()` on a double reference, which returns `&str` instead of cloning the inner type
[INFO] [stdout]   --> algorithms/greedy/src/lib.rs:63:45
[INFO] [stdout]    |
[INFO] [stdout] 63 |         final_stations.insert(best_station.0.clone());
[INFO] [stdout]    |                                             ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(suspicious_double_ref_op)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 1.59s
[INFO] running `Command { std: "docker" "inspect" "4386ea96af2c91c962dbc153c7aa8220d5aa79f5e3f8dc5444d06cef5ec8dc95", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "4386ea96af2c91c962dbc153c7aa8220d5aa79f5e3f8dc5444d06cef5ec8dc95", kill_on_drop: false }`
[INFO] [stdout] 4386ea96af2c91c962dbc153c7aa8220d5aa79f5e3f8dc5444d06cef5ec8dc95
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-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:86ea7c7af713d31e8cfdb68a6d0db50b5cf7cbeecde3d112f9f257f747318d36" "/opt/rustwide/cargo-home/bin/cargo" "+1.84.0" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] 1a0e7a6c2777003679a221ed3f3e6759b8bf14c111e37dcb806a1c5eb2c6c03a
[INFO] running `Command { std: "docker" "start" "-a" "1a0e7a6c2777003679a221ed3f3e6759b8bf14c111e37dcb806a1c5eb2c6c03a", 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: 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: trait `Partition` is never used
[INFO] [stderr]  --> algorithms/quicksort/src/lib.rs:1:7
[INFO] [stderr]   |
[INFO] [stderr] 1 | trait Partition {
[INFO] [stderr]   |       ^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function `quicksort` is never used
[INFO] [stderr]   --> algorithms/quicksort/src/lib.rs:11:4
[INFO] [stderr]    |
[INFO] [stderr] 11 | fn quicksort(mut v: Vec<u128>, asc: bool, partition: Box<dyn Partition>) -> Vec<u128> {
[INFO] [stderr]    |    ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Hoare` is never constructed
[INFO] [stderr]   --> algorithms/quicksort/src/lib.rs:24:8
[INFO] [stderr]    |
[INFO] [stderr] 24 | struct Hoare {}
[INFO] [stderr]    |        ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Lomuto` is never constructed
[INFO] [stderr]   --> algorithms/quicksort/src/lib.rs:89:8
[INFO] [stderr]    |
[INFO] [stderr] 89 | struct Lomuto {}
[INFO] [stderr]    |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `quicksort_recursive` is never used
[INFO] [stderr]    --> algorithms/quicksort/src/lib.rs:129:4
[INFO] [stderr]     |
[INFO] [stderr] 129 | fn quicksort_recursive(mut v: Vec<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_force` is never used
[INFO] [stderr]    --> algorithms/quicksort/src/lib.rs:181:4
[INFO] [stderr]     |
[INFO] [stderr] 181 | fn swap_force(v: &mut Vec<u128>, i1: usize, i2: usize) {
[INFO] [stderr]     |    ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `swap` is never used
[INFO] [stderr]    --> algorithms/quicksort/src/lib.rs:187:4
[INFO] [stderr]     |
[INFO] [stderr] 187 | fn swap(v: &mut Vec<u128>, i1: usize, i2: usize, asc: bool) {
[INFO] [stderr]     |    ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `Type` is never used
[INFO] [stderr]  --> algorithms/selection_sort/src/lib.rs:1:6
[INFO] [stderr]   |
[INFO] [stderr] 1 | type Type = u128;
[INFO] [stderr]   |      ^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function `selection_sort` is never used
[INFO] [stderr]  --> algorithms/selection_sort/src/lib.rs:3:4
[INFO] [stderr]   |
[INFO] [stderr] 3 | fn selection_sort(mut v: Vec<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: 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: type alias `Weight` is never used
[INFO] [stderr]  --> algorithms/dynamic/src/lib.rs:3:6
[INFO] [stderr]   |
[INFO] [stderr] 3 | type Weight = i128;
[INFO] [stderr]   |      ^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: type alias `Price` is never used
[INFO] [stderr]  --> algorithms/dynamic/src/lib.rs:4:6
[INFO] [stderr]   |
[INFO] [stderr] 4 | type Price = i128;
[INFO] [stderr]   |      ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Item` is never constructed
[INFO] [stderr]  --> algorithms/dynamic/src/lib.rs:7:8
[INFO] [stderr]   |
[INFO] [stderr] 7 | struct Item {
[INFO] [stderr]   |        ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Cell` is never constructed
[INFO] [stderr]   --> algorithms/dynamic/src/lib.rs:13:8
[INFO] [stderr]    |
[INFO] [stderr] 13 | struct Cell {
[INFO] [stderr]    |        ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `run_knapsack_problem` is never used
[INFO] [stderr]   --> algorithms/dynamic/src/lib.rs:19:4
[INFO] [stderr]    |
[INFO] [stderr] 19 | fn run_knapsack_problem(
[INFO] [stderr]    |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `longest_common_substring` is never used
[INFO] [stderr]   --> algorithms/dynamic/src/lib.rs:87:4
[INFO] [stderr]    |
[INFO] [stderr] 87 | fn longest_common_substring(target: String, variants: Vec<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: 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: type alias `DataType` is never used
[INFO] [stderr]  --> algorithms/hash_table/src/lib.rs:5:6
[INFO] [stderr]   |
[INFO] [stderr] 5 | type DataType = &'static str;
[INFO] [stderr]   |      ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Value` is never constructed
[INFO] [stderr]  --> algorithms/hash_table/src/lib.rs:8:8
[INFO] [stderr]   |
[INFO] [stderr] 8 | struct Value {
[INFO] [stderr]   |        ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> algorithms/hash_table/src/lib.rs:14:8
[INFO] [stderr]    |
[INFO] [stderr] 13 | impl Value {
[INFO] [stderr]    | ---------- associated function in this implementation
[INFO] [stderr] 14 |     fn new(key: &str, data: DataType) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `HashTable` is never constructed
[INFO] [stderr]   --> algorithms/hash_table/src/lib.rs:22:8
[INFO] [stderr]    |
[INFO] [stderr] 22 | struct HashTable {
[INFO] [stderr]    |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `insert`, `get`, `delete`, and `load_factor` are never used
[INFO] [stderr]   --> algorithms/hash_table/src/lib.rs:28:8
[INFO] [stderr]    |
[INFO] [stderr] 27 | impl HashTable {
[INFO] [stderr]    | -------------- associated items in this implementation
[INFO] [stderr] 28 |     fn new(hash_fn: HashFn) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 36 |     fn insert(&mut self, key: &str, data: DataType) {
[INFO] [stderr]    |        ^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 50 |     fn get(&self, key: &str) -> Option<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: 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: `binary_search` (lib) generated 2 warnings
[INFO] [stderr] warning: `quicksort` (lib) generated 8 warnings
[INFO] [stderr] warning: `selection_sort` (lib) generated 3 warnings
[INFO] [stderr] warning: `sum_array` (lib) generated 3 warnings
[INFO] [stderr] warning: `dynamic` (lib) generated 6 warnings
[INFO] [stderr] warning: `find_max_size_square_plots` (lib) generated 1 warning
[INFO] [stderr] warning: `hash_table` (lib) generated 8 warnings
[INFO] [stderr] warning: `n_125_valid_palindrome` (lib) generated 2 warnings
[INFO] [stderr] warning: `n_9_palindrome_number` (lib) generated 2 warnings
[INFO] [stderr] warning: enum `ActResult` is never used
[INFO] [stderr]   --> algorithms/graph/src/lib.rs:11:6
[INFO] [stderr]    |
[INFO] [stderr] 11 | enum ActResult {
[INFO] [stderr]    |      ^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `add_edge`, `traverse_depth_first`, and `traverse_breadth_first` are never used
[INFO] [stderr]   --> algorithms/graph/src/lib.rs:30:8
[INFO] [stderr]    |
[INFO] [stderr] 26 | / impl<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: struct `Class` is never constructed
[INFO] [stderr]  --> algorithms/greedy/src/lib.rs:6:8
[INFO] [stderr]   |
[INFO] [stderr] 6 | struct Class {
[INFO] [stderr]   |        ^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> algorithms/greedy/src/lib.rs:13:8
[INFO] [stderr]    |
[INFO] [stderr] 12 | impl Class {
[INFO] [stderr]    | ---------- associated function in this implementation
[INFO] [stderr] 13 |     fn new(name: &str, start: &str, stop: &str) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `schedule_problem` is never used
[INFO] [stderr]   --> algorithms/greedy/src/lib.rs:26:4
[INFO] [stderr]    |
[INFO] [stderr] 26 | fn schedule_problem(classes: Vec<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] [stdout] 
[INFO] [stdout] running 2 tests
[INFO] [stderr] warning: `greedy` (lib) generated 6 warnings
[INFO] [stderr] warning: `greedy` (lib test) generated 1 warning (1 duplicate)
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.03s
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/binary_search-6fc82e43dddbb5de)
[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-9a51caeb9c6de062)
[INFO] [stdout] 
[INFO] [stdout] running 2 tests
[INFO] [stdout] test tests::test_lcs ... ok
[INFO] [stdout] test tests::test_knapsack ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 2 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.59s
[INFO] [stdout] 
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/find_max_size_square_plots-60e0fb5824fab5b8)
[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-ebfa3aa42c6ec5e8)
[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_depth_first_traverse ... ok
[INFO] [stdout] test tests::test_dijkstra ... ok
[INFO] [stdout] test tests::test_breadth_first_topology_sort ... ok
[INFO] [stdout] test tests::test_bellman_ford ... ok
[INFO] [stdout] test tests::test_rand ... ok
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/greedy-d6663d1ee7bf944c)
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 7 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.04s
[INFO] [stdout] 
[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-b8b42acab44ce0e5)
[INFO] [stdout] 
[INFO] [stdout] running 1 test
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/n_125_valid_palindrome-f93969e76e9d3509)
[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] [stdout] 
[INFO] [stdout] running 1 test
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/n_9_palindrome_number-3dfe95c6f9a4d1b8)
[INFO] [stdout] test tests::it_works ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 1 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] running 1 test
[INFO] [stdout] test tests::it_works ... ok
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/quicksort-643bf6ec9d858284)
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 1 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] running 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-83a998fb3a51570a)
[INFO] [stdout] 
[INFO] [stdout] running 1 test
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/sum_array-187cc727abb5fb3d)
[INFO] [stdout] test tests::it_works ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 1 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] running 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" "1a0e7a6c2777003679a221ed3f3e6759b8bf14c111e37dcb806a1c5eb2c6c03a", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "1a0e7a6c2777003679a221ed3f3e6759b8bf14c111e37dcb806a1c5eb2c6c03a", kill_on_drop: false }`
[INFO] [stdout] 1a0e7a6c2777003679a221ed3f3e6759b8bf14c111e37dcb806a1c5eb2c6c03a