[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] 86b826c23acd5eb7c7211e33a55c392795a256f5
[INFO] testing lavrxxx/leetcode against 1.60.0 for beta-1.61-1
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Flavrxxx%2Fleetcode" "/workspace/builds/worker-8/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-8/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/lavrxxx/leetcode on toolchain 1.60.0
[INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+1.60.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-8/source/Cargo.toml
[INFO] crate git repo https://github.com/lavrxxx/leetcode already has a lockfile, it will not be regenerated
[INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+1.60.0" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-8/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-8/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:b0c94ce3c1162fcb8e57cac5b65ec2f72eabb1eebea4fcc35e269e823f681646" "/opt/rustwide/cargo-home/bin/cargo" "+1.60.0" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] b2c070c37215b71344133a41d78e26613d85d95b239d1bb13a144c7250c42b1f
[INFO] running `Command { std: "docker" "start" "-a" "b2c070c37215b71344133a41d78e26613d85d95b239d1bb13a144c7250c42b1f", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "b2c070c37215b71344133a41d78e26613d85d95b239d1bb13a144c7250c42b1f", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "b2c070c37215b71344133a41d78e26613d85d95b239d1bb13a144c7250c42b1f", kill_on_drop: false }`
[INFO] [stdout] b2c070c37215b71344133a41d78e26613d85d95b239d1bb13a144c7250c42b1f
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-8/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-8/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" "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:b0c94ce3c1162fcb8e57cac5b65ec2f72eabb1eebea4fcc35e269e823f681646" "/opt/rustwide/cargo-home/bin/cargo" "+1.60.0" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] f95475ccf9c295ecb5f2124379150306726223e1afe2a6be26abc1e88ac18b6a
[INFO] running `Command { std: "docker" "start" "-a" "f95475ccf9c295ecb5f2124379150306726223e1afe2a6be26abc1e88ac18b6a", kill_on_drop: false }`
[INFO] [stderr]    Compiling find_max_size_square_plots v0.1.0 (/opt/rustwide/workdir/algorithms/find_max_size_square_plots)
[INFO] [stderr]    Compiling sum_array v0.1.0 (/opt/rustwide/workdir/algorithms/sum_array)
[INFO] [stderr]    Compiling graph v0.1.0 (/opt/rustwide/workdir/algorithms/graph)
[INFO] [stderr]    Compiling n_9_palindrome_number v0.1.0 (/opt/rustwide/workdir/problems/n_9_palindrome_number)
[INFO] [stderr]    Compiling binary_search v0.1.0 (/opt/rustwide/workdir/algorithms/binary_search)
[INFO] [stderr]    Compiling 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 quicksort v0.1.0 (/opt/rustwide/workdir/algorithms/quicksort)
[INFO] [stderr]    Compiling hash_table v0.1.0 (/opt/rustwide/workdir/algorithms/hash_table)
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]  --> problems/n_9_palindrome_number/src/lib.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `is_palindrome`
[INFO] [stdout]  --> problems/n_9_palindrome_number/src/lib.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn is_palindrome(mut x: i32) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]  --> problems/n_125_valid_palindrome/src/lib.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `is_palindrome`
[INFO] [stdout]  --> problems/n_125_valid_palindrome/src/lib.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 |     pub fn is_palindrome(str: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `check_palindrome`
[INFO] [stdout]   --> problems/n_125_valid_palindrome/src/lib.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 |     fn check_palindrome(str: &str) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `binary_search`
[INFO] [stdout]  --> algorithms/binary_search/src/lib.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn binary_search(v: Vec<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 is never used: `binary_search_recursive`
[INFO] [stdout]   --> algorithms/binary_search/src/lib.rs:24:4
[INFO] [stdout]    |
[INFO] [stdout] 24 | fn binary_search_recursive(v: Vec<u128>, target: u128, start: usize, stop: usize) -> Option<usize> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant is never used: `SIZE`
[INFO] [stdout]  --> algorithms/hash_table/src/lib.rs:1:1
[INFO] [stdout]   |
[INFO] [stdout] 1 | const SIZE: usize = 10;
[INFO] [stdout]   | ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias is never used: `HashFn`
[INFO] [stdout]  --> algorithms/hash_table/src/lib.rs:3:1
[INFO] [stdout]   |
[INFO] [stdout] 3 | type HashFn = Box<dyn Fn(&str) -> usize>;
[INFO] [stdout]   | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field is never read: `key`
[INFO] [stdout]  --> algorithms/hash_table/src/lib.rs:9:5
[INFO] [stdout]   |
[INFO] [stdout] 9 |     key: String,
[INFO] [stdout]   |     ^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout] note: `Value` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout]  --> algorithms/hash_table/src/lib.rs:7:10
[INFO] [stdout]   |
[INFO] [stdout] 7 | #[derive(Debug)]
[INFO] [stdout]   |          ^^^^^
[INFO] [stdout]   = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info)
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field is never read: `data`
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:10:5
[INFO] [stdout]    |
[INFO] [stdout] 10 |     data: DataType,
[INFO] [stdout]    |     ^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout] note: `Value` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:7:10
[INFO] [stdout]    |
[INFO] [stdout] 7  | #[derive(Debug)]
[INFO] [stdout]    |          ^^^^^
[INFO] [stdout]    = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info)
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 |     fn new(key: &str, data: DataType) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `HashTable`
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct HashTable {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 |     fn new(hash_fn: HashFn) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `insert`
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:36:8
[INFO] [stdout]    |
[INFO] [stdout] 36 |     fn insert(&mut self, key: &str, data: DataType) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `get`
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:50:8
[INFO] [stdout]    |
[INFO] [stdout] 50 |     fn get(&self, key: &str) -> Option<DataType> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `delete`
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:61:8
[INFO] [stdout]    |
[INFO] [stdout] 61 |     fn delete(&mut self, key: &str) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `load_factor`
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:72:8
[INFO] [stdout]    |
[INFO] [stdout] 72 |     fn load_factor(&self) -> f64 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `hash_fn_mod`
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:84:4
[INFO] [stdout]    |
[INFO] [stdout] 84 | fn hash_fn_mod(data: &str) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 3 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias is never used: `Type`
[INFO] [stdout]  --> algorithms/selection_sort/src/lib.rs:1:1
[INFO] [stdout]   |
[INFO] [stdout] 1 | type Type = u128;
[INFO] [stdout]   | ^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `selection_sort`
[INFO] [stdout]  --> algorithms/selection_sort/src/lib.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn selection_sort(mut v: Vec<Type>, asc: bool) -> Vec<Type> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `find_extremum`
[INFO] [stdout]   --> algorithms/selection_sort/src/lib.rs:16:4
[INFO] [stdout]    |
[INFO] [stdout] 16 | fn find_extremum(v: Vec<Type>, asc: bool) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias is never used: `Type`
[INFO] [stdout]  --> algorithms/sum_array/src/lib.rs:1:1
[INFO] [stdout]   |
[INFO] [stdout] 1 | type Type = i128;
[INFO] [stdout]   | ^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `sum_recursive_dc`
[INFO] [stdout]  --> algorithms/sum_array/src/lib.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | fn sum_recursive_dc(v: Vec<Type>) -> Type {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `sum`
[INFO] [stdout]   --> algorithms/sum_array/src/lib.rs:11:4
[INFO] [stdout]    |
[INFO] [stdout] 11 | fn sum(v: Vec<Type>) -> Type {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `quicksort`
[INFO] [stdout]   --> algorithms/quicksort/src/lib.rs:11:4
[INFO] [stdout]    |
[INFO] [stdout] 11 | fn quicksort(mut v: Vec<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 is never used: `quicksort_recursive`
[INFO] [stdout]    --> algorithms/quicksort/src/lib.rs:135:4
[INFO] [stdout]     |
[INFO] [stdout] 135 | fn quicksort_recursive(mut v: Vec<u128>, asc: bool) -> Vec<u128> {
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `choose_sub_array`
[INFO] [stdout]    --> algorithms/quicksort/src/lib.rs:165:4
[INFO] [stdout]     |
[INFO] [stdout] 165 | fn choose_sub_array(
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `swap`
[INFO] [stdout]    --> algorithms/quicksort/src/lib.rs:193:4
[INFO] [stdout]     |
[INFO] [stdout] 193 | fn swap(v: &mut Vec<u128>, i1: usize, i2: usize, asc: bool) {
[INFO] [stdout]     |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 3 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum is never used: `ActResult`
[INFO] [stdout]   --> algorithms/graph/src/lib.rs:11:6
[INFO] [stdout]    |
[INFO] [stdout] 11 | enum ActResult {
[INFO] [stdout]    |      ^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> algorithms/graph/src/lib.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 |     fn new(name: NodeName, data: T) -> Link<T> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `add_edge`
[INFO] [stdout]   --> algorithms/graph/src/lib.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 |     fn add_edge(&mut self, node: Link<T>, distance: Distance) -> &mut Self {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `traverse_depth_first`
[INFO] [stdout]   --> algorithms/graph/src/lib.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 39 |     fn traverse_depth_first<F>(&self, act: &F, seen: &mut HashSet<NodeName>)
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `traverse_breadth_first`
[INFO] [stdout]   --> algorithms/graph/src/lib.rs:53:8
[INFO] [stdout]    |
[INFO] [stdout] 53 |     fn traverse_breadth_first<F>(&self, act: &F, seen: &mut HashSet<NodeName>)
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `breadth_first_search`
[INFO] [stdout]   --> algorithms/graph/src/lib.rs:89:4
[INFO] [stdout]    |
[INFO] [stdout] 89 | fn breadth_first_search<T>(root: Link<T>, target: &str) -> Option<T>
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `print_node`
[INFO] [stdout]    --> algorithms/graph/src/lib.rs:107:4
[INFO] [stdout]     |
[INFO] [stdout] 107 | fn print_node<T>(node: &Node<T>) {
[INFO] [stdout]     |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `print_edge`
[INFO] [stdout]    --> algorithms/graph/src/lib.rs:118:4
[INFO] [stdout]     |
[INFO] [stdout] 118 | fn print_edge<T>(edge: &Edge<T>) -> ActResult {
[INFO] [stdout]     |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 12 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `find`
[INFO] [stdout]  --> algorithms/find_max_size_square_plots/src/lib.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn find(height: u128, width: u128) -> u128 {
[INFO] [stdout]   |    ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 3 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 8 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 1 warning emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 4 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished dev [unoptimized + debuginfo] target(s) in 1.08s
[INFO] running `Command { std: "docker" "inspect" "f95475ccf9c295ecb5f2124379150306726223e1afe2a6be26abc1e88ac18b6a", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "f95475ccf9c295ecb5f2124379150306726223e1afe2a6be26abc1e88ac18b6a", kill_on_drop: false }`
[INFO] [stdout] f95475ccf9c295ecb5f2124379150306726223e1afe2a6be26abc1e88ac18b6a
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-8/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-8/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" "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:b0c94ce3c1162fcb8e57cac5b65ec2f72eabb1eebea4fcc35e269e823f681646" "/opt/rustwide/cargo-home/bin/cargo" "+1.60.0" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] edda11f5ae71ce0a89ee61c1f01db7901a37e498c5af3e2d7955e0cd8d015128
[INFO] running `Command { std: "docker" "start" "-a" "edda11f5ae71ce0a89ee61c1f01db7901a37e498c5af3e2d7955e0cd8d015128", kill_on_drop: false }`
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]  --> problems/n_125_valid_palindrome/src/lib.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `is_palindrome`
[INFO] [stdout]  --> problems/n_125_valid_palindrome/src/lib.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 |     pub fn is_palindrome(str: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `check_palindrome`
[INFO] [stdout]   --> problems/n_125_valid_palindrome/src/lib.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 |     fn check_palindrome(str: &str) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 3 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Solution`
[INFO] [stdout]  --> problems/n_9_palindrome_number/src/lib.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution {}
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `is_palindrome`
[INFO] [stdout]  --> problems/n_9_palindrome_number/src/lib.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 |     pub fn is_palindrome(mut x: i32) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias is never used: `Type`
[INFO] [stdout]  --> algorithms/selection_sort/src/lib.rs:1:1
[INFO] [stdout]   |
[INFO] [stdout] 1 | type Type = u128;
[INFO] [stdout]   | ^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `selection_sort`
[INFO] [stdout]  --> algorithms/selection_sort/src/lib.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn selection_sort(mut v: Vec<Type>, asc: bool) -> Vec<Type> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `find_extremum`
[INFO] [stdout]   --> algorithms/selection_sort/src/lib.rs:16:4
[INFO] [stdout]    |
[INFO] [stdout] 16 | fn find_extremum(v: Vec<Type>, asc: bool) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 3 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `find`
[INFO] [stdout]  --> algorithms/find_max_size_square_plots/src/lib.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn find(height: u128, width: u128) -> u128 {
[INFO] [stdout]   |    ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 1 warning emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `binary_search`
[INFO] [stdout]  --> algorithms/binary_search/src/lib.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn binary_search(v: Vec<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 is never used: `binary_search_recursive`
[INFO] [stdout]   --> algorithms/binary_search/src/lib.rs:24:4
[INFO] [stdout]    |
[INFO] [stdout] 24 | fn binary_search_recursive(v: Vec<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: function is never used: `quicksort`
[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 is never used: `quicksort_recursive`
[INFO] [stdout]    --> algorithms/quicksort/src/lib.rs:135:4
[INFO] [stdout]     |
[INFO] [stdout] 135 | fn quicksort_recursive(mut v: Vec<u128>, asc: bool) -> Vec<u128> {
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `choose_sub_array`
[INFO] [stdout]    --> algorithms/quicksort/src/lib.rs:165:4
[INFO] [stdout]     |
[INFO] [stdout] 165 | fn choose_sub_array(
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `swap`
[INFO] [stdout]    --> algorithms/quicksort/src/lib.rs:193:4
[INFO] [stdout]     |
[INFO] [stdout] 193 | 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: enum is never used: `ActResult`
[INFO] [stdout]   --> algorithms/graph/src/lib.rs:11:6
[INFO] [stdout]    |
[INFO] [stdout] 11 | enum ActResult {
[INFO] [stdout]    |      ^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> algorithms/graph/src/lib.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 |     fn new(name: NodeName, data: T) -> Link<T> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `add_edge`
[INFO] [stdout]   --> algorithms/graph/src/lib.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 |     fn add_edge(&mut self, node: Link<T>, distance: Distance) -> &mut Self {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `traverse_depth_first`
[INFO] [stdout]   --> algorithms/graph/src/lib.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 39 |     fn traverse_depth_first<F>(&self, act: &F, seen: &mut HashSet<NodeName>)
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `traverse_breadth_first`
[INFO] [stdout]   --> algorithms/graph/src/lib.rs:53:8
[INFO] [stdout]    |
[INFO] [stdout] 53 |     fn traverse_breadth_first<F>(&self, act: &F, seen: &mut HashSet<NodeName>)
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `breadth_first_search`
[INFO] [stdout]   --> algorithms/graph/src/lib.rs:89:4
[INFO] [stdout]    |
[INFO] [stdout] 89 | fn breadth_first_search<T>(root: Link<T>, target: &str) -> Option<T>
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `print_node`
[INFO] [stdout]    --> algorithms/graph/src/lib.rs:107:4
[INFO] [stdout]     |
[INFO] [stdout] 107 | fn print_node<T>(node: &Node<T>) {
[INFO] [stdout]     |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `print_edge`
[INFO] [stdout]    --> algorithms/graph/src/lib.rs:118:4
[INFO] [stdout]     |
[INFO] [stdout] 118 | fn print_edge<T>(edge: &Edge<T>) -> ActResult {
[INFO] [stdout]     |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 8 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias is never used: `Type`
[INFO] [stdout]  --> algorithms/sum_array/src/lib.rs:1:1
[INFO] [stdout]   |
[INFO] [stdout] 1 | type Type = i128;
[INFO] [stdout]   | ^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `sum_recursive_dc`
[INFO] [stdout]  --> algorithms/sum_array/src/lib.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | fn sum_recursive_dc(v: Vec<Type>) -> Type {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `sum`
[INFO] [stdout]   --> algorithms/sum_array/src/lib.rs:11:4
[INFO] [stdout]    |
[INFO] [stdout] 11 | fn sum(v: Vec<Type>) -> Type {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 3 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant is never used: `SIZE`
[INFO] [stdout]  --> algorithms/hash_table/src/lib.rs:1:1
[INFO] [stdout]   |
[INFO] [stdout] 1 | const SIZE: usize = 10;
[INFO] [stdout]   | ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias is never used: `HashFn`
[INFO] [stdout]  --> algorithms/hash_table/src/lib.rs:3:1
[INFO] [stdout]   |
[INFO] [stdout] 3 | type HashFn = Box<dyn Fn(&str) -> usize>;
[INFO] [stdout]   | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field is never read: `key`
[INFO] [stdout]  --> algorithms/hash_table/src/lib.rs:9:5
[INFO] [stdout]   |
[INFO] [stdout] 9 |     key: String,
[INFO] [stdout]   |     ^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout] note: `Value` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout]  --> algorithms/hash_table/src/lib.rs:7:10
[INFO] [stdout]   |
[INFO] [stdout] 7 | #[derive(Debug)]
[INFO] [stdout]   |          ^^^^^
[INFO] [stdout]   = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info)
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling n_125_valid_palindrome v0.1.0 (/opt/rustwide/workdir/problems/n_125_valid_palindrome)
[INFO] [stdout] warning: field is never read: `data`
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:10:5
[INFO] [stdout]    |
[INFO] [stdout] 10 |     data: DataType,
[INFO] [stdout]    |     ^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout] note: `Value` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:7:10
[INFO] [stdout]    |
[INFO] [stdout] 7  | #[derive(Debug)]
[INFO] [stdout]    |          ^^^^^
[INFO] [stdout]    = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info)
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 |     fn new(key: &str, data: DataType) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `HashTable`
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | struct HashTable {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 |     fn new(hash_fn: HashFn) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `insert`
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:36:8
[INFO] [stdout]    |
[INFO] [stdout] 36 |     fn insert(&mut self, key: &str, data: DataType) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling sum_array v0.1.0 (/opt/rustwide/workdir/algorithms/sum_array)
[INFO] [stdout] warning: associated function is never used: `get`
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:50:8
[INFO] [stdout]    |
[INFO] [stdout] 50 |     fn get(&self, key: &str) -> Option<DataType> {
[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: associated function is never used: `delete`
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:61:8
[INFO] [stdout]    |
[INFO] [stdout] 61 |     fn delete(&mut self, key: &str) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling binary_search v0.1.0 (/opt/rustwide/workdir/algorithms/binary_search)
[INFO] [stdout] warning: associated function is never used: `load_factor`
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:72:8
[INFO] [stdout]    |
[INFO] [stdout] 72 |     fn load_factor(&self) -> f64 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `hash_fn_mod`
[INFO] [stdout]   --> algorithms/hash_table/src/lib.rs:84:4
[INFO] [stdout]    |
[INFO] [stdout] 84 | fn hash_fn_mod(data: &str) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 12 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling hash_table v0.1.0 (/opt/rustwide/workdir/algorithms/hash_table)
[INFO] [stderr]    Compiling selection_sort v0.1.0 (/opt/rustwide/workdir/algorithms/selection_sort)
[INFO] [stderr]    Compiling 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 graph v0.1.0 (/opt/rustwide/workdir/algorithms/graph)
[INFO] [stderr]     Finished test [unoptimized + debuginfo] target(s) in 0.49s
[INFO] running `Command { std: "docker" "inspect" "edda11f5ae71ce0a89ee61c1f01db7901a37e498c5af3e2d7955e0cd8d015128", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "edda11f5ae71ce0a89ee61c1f01db7901a37e498c5af3e2d7955e0cd8d015128", kill_on_drop: false }`
[INFO] [stdout] edda11f5ae71ce0a89ee61c1f01db7901a37e498c5af3e2d7955e0cd8d015128
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-8/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-8/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" "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:b0c94ce3c1162fcb8e57cac5b65ec2f72eabb1eebea4fcc35e269e823f681646" "/opt/rustwide/cargo-home/bin/cargo" "+1.60.0" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] 48b1cc2ec372379b89e21af9832a6d5292b97fd8c89e64de298fb6f7f94d017f
[INFO] running `Command { std: "docker" "start" "-a" "48b1cc2ec372379b89e21af9832a6d5292b97fd8c89e64de298fb6f7f94d017f", kill_on_drop: false }`
[INFO] [stderr] warning: function is never used: `binary_search`
[INFO] [stderr]  --> algorithms/binary_search/src/lib.rs:1:4
[INFO] [stdout] 
[INFO] [stderr]   |
[INFO] [stdout] running 2 tests
[INFO] [stderr] 1 | fn binary_search(v: Vec<u128>, target: u128) -> Option<usize> {
[INFO] [stdout] test tests::test_binary_search ... ok
[INFO] [stderr]   |    ^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `binary_search_recursive`
[INFO] [stderr]   --> algorithms/binary_search/src/lib.rs:24:4
[INFO] [stderr]    |
[INFO] [stderr] 24 | fn binary_search_recursive(v: Vec<u128>, target: u128, start: usize, stop: usize) -> Option<usize> {
[INFO] [stderr]    |    ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `binary_search` (lib) generated 2 warnings
[INFO] [stderr] warning: struct is never constructed: `Solution`
[INFO] [stderr]  --> problems/n_9_palindrome_number/src/lib.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution {}
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: associated function is never used: `is_palindrome`
[INFO] [stderr]  --> problems/n_9_palindrome_number/src/lib.rs:4:12
[INFO] [stderr]   |
[INFO] [stderr] 4 |     pub fn is_palindrome(mut x: i32) -> bool {
[INFO] [stderr]   |            ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `Solution`
[INFO] [stderr]  --> problems/n_125_valid_palindrome/src/lib.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | struct Solution {}
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: associated function is never used: `is_palindrome`
[INFO] [stderr]  --> problems/n_125_valid_palindrome/src/lib.rs:6:12
[INFO] [stderr]   |
[INFO] [stderr] 6 |     pub fn is_palindrome(str: String) -> bool {
[INFO] [stderr]   |            ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function is never used: `check_palindrome`
[INFO] [stderr]   --> problems/n_125_valid_palindrome/src/lib.rs:28:8
[INFO] [stderr]    |
[INFO] [stderr] 28 |     fn check_palindrome(str: &str) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias is never used: `Type`
[INFO] [stderr]  --> algorithms/selection_sort/src/lib.rs:1:1
[INFO] [stderr]   |
[INFO] [stderr] 1 | type Type = u128;
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `selection_sort`
[INFO] [stderr]  --> algorithms/selection_sort/src/lib.rs:3:4
[INFO] [stderr]   |
[INFO] [stderr] 3 | fn selection_sort(mut v: Vec<Type>, asc: bool) -> Vec<Type> {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `find_extremum`
[INFO] [stderr]   --> algorithms/selection_sort/src/lib.rs:16:4
[INFO] [stderr]    |
[INFO] [stderr] 16 | fn find_extremum(v: Vec<Type>, asc: bool) -> usize {
[INFO] [stderr]    |    ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `find`
[INFO] [stderr]  --> algorithms/find_max_size_square_plots/src/lib.rs:1:4
[INFO] [stderr]   |
[INFO] [stderr] 1 | fn find(height: u128, width: u128) -> u128 {
[INFO] [stderr]   |    ^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: constant is never used: `SIZE`
[INFO] [stderr]  --> algorithms/hash_table/src/lib.rs:1:1
[INFO] [stderr]   |
[INFO] [stderr] 1 | const SIZE: usize = 10;
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stdout] test tests::test_binary_search_recursive ... ok
[INFO] [stderr] warning: type alias is never used: `HashFn`
[INFO] [stdout] 
[INFO] [stderr]  --> algorithms/hash_table/src/lib.rs:3:1
[INFO] [stdout] test result: ok. 2 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stderr]   |
[INFO] [stdout] 
[INFO] [stderr] 3 | type HashFn = Box<dyn Fn(&str) -> usize>;
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: field is never read: `key`
[INFO] [stderr]  --> algorithms/hash_table/src/lib.rs:9:5
[INFO] [stderr]   |
[INFO] [stderr] 9 |     key: String,
[INFO] [stderr]   |     ^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr] note: `Value` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stderr]  --> algorithms/hash_table/src/lib.rs:7:10
[INFO] [stderr]   |
[INFO] [stderr] 7 | #[derive(Debug)]
[INFO] [stderr]   |          ^^^^^
[INFO] [stderr]   = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info)
[INFO] [stderr] 
[INFO] [stderr] warning: field is never read: `data`
[INFO] [stderr]   --> algorithms/hash_table/src/lib.rs:10:5
[INFO] [stderr]    |
[INFO] [stderr] 10 |     data: DataType,
[INFO] [stderr]    |     ^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr] note: `Value` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stderr]   --> algorithms/hash_table/src/lib.rs:7:10
[INFO] [stderr]    |
[INFO] [stderr] 7  | #[derive(Debug)]
[INFO] [stderr]    |          ^^^^^
[INFO] [stderr]    = note: this warning originates in the derive macro `Debug` (in Nightly builds, run with -Z macro-backtrace for more info)
[INFO] [stderr] 
[INFO] [stderr] warning: associated function is never used: `new`
[INFO] [stderr]   --> algorithms/hash_table/src/lib.rs:14:8
[INFO] [stderr]    |
[INFO] [stderr] 14 |     fn new(key: &str, data: DataType) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `HashTable`
[INFO] [stderr]   --> algorithms/hash_table/src/lib.rs:22:8
[INFO] [stderr]    |
[INFO] [stderr] 22 | struct HashTable {
[INFO] [stderr]    |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function is never used: `new`
[INFO] [stderr]   --> algorithms/hash_table/src/lib.rs:28:8
[INFO] [stderr]    |
[INFO] [stderr] 28 |     fn new(hash_fn: HashFn) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function is never used: `insert`
[INFO] [stderr]   --> algorithms/hash_table/src/lib.rs:36:8
[INFO] [stderr]    |
[INFO] [stderr] 36 |     fn insert(&mut self, key: &str, data: DataType) {
[INFO] [stderr]    |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function is never used: `get`
[INFO] [stderr]   --> algorithms/hash_table/src/lib.rs:50:8
[INFO] [stderr]    |
[INFO] [stderr] 50 |     fn get(&self, key: &str) -> Option<DataType> {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function is never used: `delete`
[INFO] [stderr]   --> algorithms/hash_table/src/lib.rs:61:8
[INFO] [stderr]    |
[INFO] [stderr] 61 |     fn delete(&mut self, key: &str) {
[INFO] [stderr]    |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function is never used: `load_factor`
[INFO] [stderr]   --> algorithms/hash_table/src/lib.rs:72:8
[INFO] [stderr]    |
[INFO] [stderr] 72 |     fn load_factor(&self) -> f64 {
[INFO] [stderr]    |        ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `hash_fn_mod`
[INFO] [stderr]   --> algorithms/hash_table/src/lib.rs:84:4
[INFO] [stderr]    |
[INFO] [stderr] 84 | fn hash_fn_mod(data: &str) -> usize {
[INFO] [stderr]    |    ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: enum is never used: `ActResult`
[INFO] [stderr]   --> algorithms/graph/src/lib.rs:11:6
[INFO] [stderr]    |
[INFO] [stderr] 11 | enum ActResult {
[INFO] [stderr]    |      ^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: associated function is never used: `new`
[INFO] [stderr]   --> algorithms/graph/src/lib.rs:26:8
[INFO] [stderr]    |
[INFO] [stderr] 26 |     fn new(name: NodeName, data: T) -> Link<T> {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function is never used: `add_edge`
[INFO] [stderr]   --> algorithms/graph/src/lib.rs:34:8
[INFO] [stderr]    |
[INFO] [stderr] 34 |     fn add_edge(&mut self, node: Link<T>, distance: Distance) -> &mut Self {
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function is never used: `traverse_depth_first`
[INFO] [stderr]   --> algorithms/graph/src/lib.rs:39:8
[INFO] [stderr]    |
[INFO] [stderr] 39 |     fn traverse_depth_first<F>(&self, act: &F, seen: &mut HashSet<NodeName>)
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function is never used: `traverse_breadth_first`
[INFO] [stderr]   --> algorithms/graph/src/lib.rs:53:8
[INFO] [stderr]    |
[INFO] [stderr] 53 |     fn traverse_breadth_first<F>(&self, act: &F, seen: &mut HashSet<NodeName>)
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `breadth_first_search`
[INFO] [stderr]   --> algorithms/graph/src/lib.rs:89:4
[INFO] [stderr]    |
[INFO] [stderr] 89 | fn breadth_first_search<T>(root: Link<T>, target: &str) -> Option<T>
[INFO] [stderr]    |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `print_node`
[INFO] [stderr]    --> algorithms/graph/src/lib.rs:107:4
[INFO] [stderr]     |
[INFO] [stderr] 107 | fn print_node<T>(node: &Node<T>) {
[INFO] [stderr]     |    ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `print_edge`
[INFO] [stderr]    --> algorithms/graph/src/lib.rs:118:4
[INFO] [stderr]     |
[INFO] [stderr] 118 | fn print_edge<T>(edge: &Edge<T>) -> ActResult {
[INFO] [stderr]     |    ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias is never used: `Type`
[INFO] [stderr]  --> algorithms/sum_array/src/lib.rs:1:1
[INFO] [stderr]   |
[INFO] [stderr] 1 | type Type = i128;
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `sum_recursive_dc`
[INFO] [stderr]  --> algorithms/sum_array/src/lib.rs:4:4
[INFO] [stderr]   |
[INFO] [stderr] 4 | fn sum_recursive_dc(v: Vec<Type>) -> Type {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `sum`
[INFO] [stderr]   --> algorithms/sum_array/src/lib.rs:11:4
[INFO] [stderr]    |
[INFO] [stderr] 11 | fn sum(v: Vec<Type>) -> Type {
[INFO] [stderr]    |    ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `quicksort`
[INFO] [stderr]   --> algorithms/quicksort/src/lib.rs:11:4
[INFO] [stderr]    |
[INFO] [stderr] 11 | fn quicksort(mut v: Vec<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 is never used: `quicksort_recursive`
[INFO] [stderr]    --> algorithms/quicksort/src/lib.rs:135:4
[INFO] [stderr]     |
[INFO] [stderr] 135 | fn quicksort_recursive(mut v: Vec<u128>, asc: bool) -> Vec<u128> {
[INFO] [stderr]     |    ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `choose_sub_array`
[INFO] [stderr]    --> algorithms/quicksort/src/lib.rs:165:4
[INFO] [stderr]     |
[INFO] [stderr] 165 | fn choose_sub_array(
[INFO] [stderr]     |    ^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `swap`
[INFO] [stderr]    --> algorithms/quicksort/src/lib.rs:193:4
[INFO] [stderr]     |
[INFO] [stderr] 193 | fn swap(v: &mut Vec<u128>, i1: usize, i2: usize, asc: bool) {
[INFO] [stderr]     |    ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `n_9_palindrome_number` (lib) generated 2 warnings
[INFO] [stderr] warning: `n_125_valid_palindrome` (lib) generated 3 warnings
[INFO] [stderr] warning: `selection_sort` (lib) generated 3 warnings
[INFO] [stderr] warning: `find_max_size_square_plots` (lib) generated 1 warning
[INFO] [stderr] warning: `hash_table` (lib) generated 12 warnings
[INFO] [stderr] warning: `graph` (lib) generated 8 warnings
[INFO] [stderr] warning: `sum_array` (lib) generated 3 warnings
[INFO] [stderr] warning: `quicksort` (lib) generated 4 warnings
[INFO] [stderr]     Finished test [unoptimized + debuginfo] target(s) in 0.01s
[INFO] [stderr]      Running unittests (/opt/rustwide/target/debug/deps/binary_search-1a7db3539f5d6383)
[INFO] [stderr]      Running unittests (/opt/rustwide/target/debug/deps/find_max_size_square_plots-107cb72c99dbb1f9)
[INFO] [stdout] 
[INFO] [stdout] running 1 test
[INFO] [stdout] test tests::it_works ... ok
[INFO] [stderr]      Running unittests (/opt/rustwide/target/debug/deps/graph-0f9ccef17a28d1d3)
[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_breadth_first_search ... ok
[INFO] [stdout] test tests::test_depth_first_traverse ... ok
[INFO] [stdout] test tests::test_breadth_first_traverse ... 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 (/opt/rustwide/target/debug/deps/hash_table-154b5791db9a1c88)
[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 (/opt/rustwide/target/debug/deps/n_125_valid_palindrome-551c7431330b3558)
[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 (/opt/rustwide/target/debug/deps/n_9_palindrome_number-6bb20c1684d05619)
[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 (/opt/rustwide/target/debug/deps/quicksort-f53b21a86f215c42)
[INFO] [stdout] 
[INFO] [stdout] running 3 tests
[INFO] [stdout] test tests::test_quicksort_lomuto ... ok
[INFO] [stdout] test tests::test_quicksort_hoare ... 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 (/opt/rustwide/target/debug/deps/selection_sort-17267d269643e73c)
[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 (/opt/rustwide/target/debug/deps/sum_array-afc9ea407ba0c198)
[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 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 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] [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] [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" "48b1cc2ec372379b89e21af9832a6d5292b97fd8c89e64de298fb6f7f94d017f", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "48b1cc2ec372379b89e21af9832a6d5292b97fd8c89e64de298fb6f7f94d017f", kill_on_drop: false }`
[INFO] [stdout] 48b1cc2ec372379b89e21af9832a6d5292b97fd8c89e64de298fb6f7f94d017f