[INFO] cloning repository https://github.com/lavrxxx/leetcode [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/lavrxxx/leetcode" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Flavrxxx%2Fleetcode", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Flavrxxx%2Fleetcode'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 0a357004fee62c49837e3228670e85d50c3b80ba [INFO] testing lavrxxx/leetcode against master#61223975d46f794466efa832bc7562b9707ecc46+rustflags=-Copt-level=3 for pr-121282 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Flavrxxx%2Fleetcode" "/workspace/builds/worker-1-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-1-tc1/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/lavrxxx/leetcode on toolchain 61223975d46f794466efa832bc7562b9707ecc46 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+61223975d46f794466efa832bc7562b9707ecc46" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/lavrxxx/leetcode [INFO] finished tweaking git repo https://github.com/lavrxxx/leetcode [INFO] tweaked toml for git repo https://github.com/lavrxxx/leetcode written to /workspace/builds/worker-1-tc1/source/Cargo.toml [INFO] crate git repo https://github.com/lavrxxx/leetcode already has a lockfile, it will not be regenerated [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+61223975d46f794466efa832bc7562b9707ecc46" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] warning: virtual workspace defaulting to `resolver = "1"` despite one or more workspace members being on edition 2021 which implies `resolver = "2"` [INFO] [stderr] note: to keep the current resolver, specify `workspace.resolver = "1"` in the workspace root's manifest [INFO] [stderr] note: to use the edition 2021 resolver, specify `workspace.resolver = "2"` in the workspace root's manifest [INFO] [stderr] note: for more details see https://doc.rust-lang.org/cargo/reference/resolver.html#resolver-versions [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+61223975d46f794466efa832bc7562b9707ecc46" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 5d074f54c2749cb960225558b711cf8a4edf6417395bf32b621d51b0d38ccf93 [INFO] running `Command { std: "docker" "start" "-a" "5d074f54c2749cb960225558b711cf8a4edf6417395bf32b621d51b0d38ccf93", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "5d074f54c2749cb960225558b711cf8a4edf6417395bf32b621d51b0d38ccf93", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "5d074f54c2749cb960225558b711cf8a4edf6417395bf32b621d51b0d38ccf93", kill_on_drop: false }` [INFO] [stdout] 5d074f54c2749cb960225558b711cf8a4edf6417395bf32b621d51b0d38ccf93 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid -Copt-level=3" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+61223975d46f794466efa832bc7562b9707ecc46" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] eb57c14b4eea23e183629be2061656f0a1bb74d07c214001c0101fd5e99acf35 [INFO] running `Command { std: "docker" "start" "-a" "eb57c14b4eea23e183629be2061656f0a1bb74d07c214001c0101fd5e99acf35", 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 ppv-lite86 v0.2.16 [INFO] [stderr] Compiling n_9_palindrome_number v0.1.0 (/opt/rustwide/workdir/problems/n_9_palindrome_number) [INFO] [stderr] Compiling dynamic v0.1.0 (/opt/rustwide/workdir/algorithms/dynamic) [INFO] [stderr] Compiling n_125_valid_palindrome v0.1.0 (/opt/rustwide/workdir/problems/n_125_valid_palindrome) [INFO] [stderr] Compiling find_max_size_square_plots v0.1.0 (/opt/rustwide/workdir/algorithms/find_max_size_square_plots) [INFO] [stderr] Compiling num-traits v0.2.14 [INFO] [stderr] Compiling num-integer v0.1.45 [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: 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: associated functions `is_palindrome` and `check_palindrome` are never used [INFO] [stdout] --> problems/n_125_valid_palindrome/src/lib.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn is_palindrome(str: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn check_palindrome(str: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 2 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling hash_table v0.1.0 (/opt/rustwide/workdir/algorithms/hash_table) [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: 2 warnings emitted [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] = note: `Item` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [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] = note: `Cell` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run_knapsack_problem` is never used [INFO] [stdout] --> algorithms/dynamic/src/lib.rs:19:4 [INFO] [stdout] | [INFO] [stdout] 19 | fn run_knapsack_problem( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `longest_common_substring` is never used [INFO] [stdout] --> algorithms/dynamic/src/lib.rs:87:4 [INFO] [stdout] | [INFO] [stdout] 87 | fn longest_common_substring(target: String, variants: Vec) -> Vec<(String, i128)> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling binary_search v0.1.0 (/opt/rustwide/workdir/algorithms/binary_search) [INFO] [stdout] warning: 1 warning emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling sum_array v0.1.0 (/opt/rustwide/workdir/algorithms/sum_array) [INFO] [stdout] warning: function `binary_search` is never used [INFO] [stdout] --> algorithms/binary_search/src/lib.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn binary_search(v: Vec, target: u128) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `binary_search_recursive` is never used [INFO] [stdout] --> algorithms/binary_search/src/lib.rs:24:4 [INFO] [stdout] | [INFO] [stdout] 24 | fn binary_search_recursive(v: Vec, target: u128, start: usize, stop: usize) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 6 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling selection_sort v0.1.0 (/opt/rustwide/workdir/algorithms/selection_sort) [INFO] [stdout] warning: 2 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `SIZE` is never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:1:7 [INFO] [stdout] | [INFO] [stdout] 1 | const SIZE: usize = 10; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling quicksort v0.1.0 (/opt/rustwide/workdir/algorithms/quicksort) [INFO] [stdout] warning: type alias `HashFn` is never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:3:6 [INFO] [stdout] | [INFO] [stdout] 3 | type HashFn = Box usize>; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `DataType` is never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:5:6 [INFO] [stdout] | [INFO] [stdout] 5 | type DataType = &'static str; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Value` is never constructed [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | struct Value { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Value` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 13 | impl Value { [INFO] [stdout] | ---------- associated function in this implementation [INFO] [stdout] 14 | fn new(key: &str, data: DataType) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `HashTable` is never constructed [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct HashTable { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, `get`, `delete`, and `load_factor` are never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 27 | impl HashTable { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 28 | fn new(hash_fn: HashFn) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | fn insert(&mut self, key: &str, data: DataType) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | fn get(&self, key: &str) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn delete(&mut self, key: &str) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn load_factor(&self) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `hash_fn_mod` is never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:84:4 [INFO] [stdout] | [INFO] [stdout] 84 | fn hash_fn_mod(data: &str) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Type` is never used [INFO] [stdout] --> algorithms/selection_sort/src/lib.rs:1:6 [INFO] [stdout] | [INFO] [stdout] 1 | type Type = u128; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `selection_sort` is never used [INFO] [stdout] --> algorithms/selection_sort/src/lib.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn selection_sort(mut v: Vec, asc: bool) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_extremum` is never used [INFO] [stdout] --> algorithms/selection_sort/src/lib.rs:16:4 [INFO] [stdout] | [INFO] [stdout] 16 | fn find_extremum(v: Vec, asc: bool) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 8 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Type` is never used [INFO] [stdout] --> algorithms/sum_array/src/lib.rs:1:6 [INFO] [stdout] | [INFO] [stdout] 1 | type Type = i128; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sum_recursive_dc` is never used [INFO] [stdout] --> algorithms/sum_array/src/lib.rs:4:4 [INFO] [stdout] | [INFO] [stdout] 4 | fn sum_recursive_dc(v: Vec) -> Type { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sum` is never used [INFO] [stdout] --> algorithms/sum_array/src/lib.rs:11:4 [INFO] [stdout] | [INFO] [stdout] 11 | fn sum(v: Vec) -> Type { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 3 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `Partition` is never used [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:1:7 [INFO] [stdout] | [INFO] [stdout] 1 | trait Partition { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `quicksort` is never used [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:11:4 [INFO] [stdout] | [INFO] [stdout] 11 | fn quicksort(mut v: Vec, asc: bool, partition: Box) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Hoare` is never constructed [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Hoare {} [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Lomuto` is never constructed [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:89:8 [INFO] [stdout] | [INFO] [stdout] 89 | struct Lomuto {} [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `quicksort_recursive` is never used [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:129:4 [INFO] [stdout] | [INFO] [stdout] 129 | fn quicksort_recursive(mut v: Vec, asc: bool) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `choose_sub_array` is never used [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:159:4 [INFO] [stdout] | [INFO] [stdout] 159 | fn choose_sub_array( [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `swap_force` is never used [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:181:4 [INFO] [stdout] | [INFO] [stdout] 181 | fn swap_force(v: &mut Vec, i1: usize, i2: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `swap` is never used [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:187:4 [INFO] [stdout] | [INFO] [stdout] 187 | fn swap(v: &mut Vec, i1: usize, i2: usize, asc: bool) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 3 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 8 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling getrandom v0.2.6 [INFO] [stderr] Compiling time v0.1.43 [INFO] [stderr] Compiling rand_core v0.6.3 [INFO] [stderr] Compiling rand_chacha v0.3.1 [INFO] [stderr] Compiling rand v0.8.5 [INFO] [stderr] Compiling chrono v0.4.19 [INFO] [stderr] Compiling graph v0.1.0 (/opt/rustwide/workdir/algorithms/graph) [INFO] [stdout] warning: enum `ActResult` is never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:11:6 [INFO] [stdout] | [INFO] [stdout] 11 | enum ActResult { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_edge`, `traverse_depth_first`, and `traverse_breadth_first` are never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 26 | / impl Node [INFO] [stdout] 27 | | where [INFO] [stdout] 28 | | T: Clone, [INFO] [stdout] | |_____________- associated items in this implementation [INFO] [stdout] 29 | { [INFO] [stdout] 30 | fn new(name: NodeName, data: T) -> Link { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn add_edge(&mut self, node: Link, weight: Weight) -> &mut Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn traverse_depth_first(&self, act: &F, seen: &mut HashSet) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | fn traverse_breadth_first(&self, act: &F, seen: &mut HashSet) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `breadth_first_search` is never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:92:4 [INFO] [stdout] | [INFO] [stdout] 92 | fn breadth_first_search(root: Link, target: &str) -> Option [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_node` is never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:110:4 [INFO] [stdout] | [INFO] [stdout] 110 | fn print_node(node: &Node) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_edge` is never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:121:4 [INFO] [stdout] | [INFO] [stdout] 121 | fn print_edge(edge: &Edge) -> ActResult { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `depth_first_topological_sort` is never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:135:4 [INFO] [stdout] | [INFO] [stdout] 135 | fn depth_first_topological_sort(root: Link) -> VecDeque> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `visit` is never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:160:4 [INFO] [stdout] | [INFO] [stdout] 160 | fn visit( [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dijkstra` is never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:188:4 [INFO] [stdout] | [INFO] [stdout] 188 | fn dijkstra(root: Link) -> (HashMap, HashMap>>) [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_closest_node` is never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:231:4 [INFO] [stdout] | [INFO] [stdout] 231 | fn find_closest_node( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bellman_ford` is never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:249:4 [INFO] [stdout] | [INFO] [stdout] 249 | fn bellman_ford(root: Link) -> (HashMap, HashMap>>) [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 10 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling greedy v0.1.0 (/opt/rustwide/workdir/algorithms/greedy) [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> algorithms/greedy/src/lib.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl Class { [INFO] [stdout] | ---------- associated function in this implementation [INFO] [stdout] 13 | fn new(name: &str, start: &str, stop: &str) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `schedule_problem` is never used [INFO] [stdout] --> algorithms/greedy/src/lib.rs:26:4 [INFO] [stdout] | [INFO] [stdout] 26 | fn schedule_problem(classes: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `set_covering_problem` is never used [INFO] [stdout] --> algorithms/greedy/src/lib.rs:46:4 [INFO] [stdout] | [INFO] [stdout] 46 | fn set_covering_problem<'a>( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `salesperson_problem` is never used [INFO] [stdout] --> algorithms/greedy/src/lib.rs:69:4 [INFO] [stdout] | [INFO] [stdout] 69 | fn salesperson_problem( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: using `.clone()` on a double reference, which returns `&str` instead of cloning the inner type [INFO] [stdout] --> algorithms/greedy/src/lib.rs:63:45 [INFO] [stdout] | [INFO] [stdout] 63 | final_stations.insert(best_station.0.clone()); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(suspicious_double_ref_op)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 5 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 6.43s [INFO] running `Command { std: "docker" "inspect" "eb57c14b4eea23e183629be2061656f0a1bb74d07c214001c0101fd5e99acf35", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "eb57c14b4eea23e183629be2061656f0a1bb74d07c214001c0101fd5e99acf35", kill_on_drop: false }` [INFO] [stdout] eb57c14b4eea23e183629be2061656f0a1bb74d07c214001c0101fd5e99acf35 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid -Copt-level=3" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+61223975d46f794466efa832bc7562b9707ecc46" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] dee3ea8d28b116cc64c760b4db70a70aa6ddee6b7f5474721eda5f749ae2b03f [INFO] running `Command { std: "docker" "start" "-a" "dee3ea8d28b116cc64c760b4db70a70aa6ddee6b7f5474721eda5f749ae2b03f", kill_on_drop: false }` [INFO] [stderr] warning: virtual workspace defaulting to `resolver = "1"` despite one or more workspace members being on edition 2021 which implies `resolver = "2"` [INFO] [stderr] note: to keep the current resolver, specify `workspace.resolver = "1"` in the workspace root's manifest [INFO] [stderr] note: to use the edition 2021 resolver, specify `workspace.resolver = "2"` in the workspace root's manifest [INFO] [stderr] note: for more details see https://doc.rust-lang.org/cargo/reference/resolver.html#resolver-versions [INFO] [stdout] warning: function `find` is never used [INFO] [stdout] --> algorithms/find_max_size_square_plots/src/lib.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn find(height: u128, width: u128) -> u128 { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 1 warning emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Type` is never used [INFO] [stdout] --> algorithms/selection_sort/src/lib.rs:1:6 [INFO] [stdout] | [INFO] [stdout] 1 | type Type = u128; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `selection_sort` is never used [INFO] [stdout] --> algorithms/selection_sort/src/lib.rs:3:4 [INFO] [stdout] | [INFO] [stdout] 3 | fn selection_sort(mut v: Vec, asc: bool) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_extremum` is never used [INFO] [stdout] --> algorithms/selection_sort/src/lib.rs:16:4 [INFO] [stdout] | [INFO] [stdout] 16 | fn find_extremum(v: Vec, asc: bool) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 3 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Type` is never used [INFO] [stdout] --> algorithms/sum_array/src/lib.rs:1:6 [INFO] [stdout] | [INFO] [stdout] 1 | type Type = i128; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sum_recursive_dc` is never used [INFO] [stdout] --> algorithms/sum_array/src/lib.rs:4:4 [INFO] [stdout] | [INFO] [stdout] 4 | fn sum_recursive_dc(v: Vec) -> Type { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `sum` is never used [INFO] [stdout] --> algorithms/sum_array/src/lib.rs:11:4 [INFO] [stdout] | [INFO] [stdout] 11 | fn sum(v: Vec) -> Type { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 3 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> problems/n_125_valid_palindrome/src/lib.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated functions `is_palindrome` and `check_palindrome` are never used [INFO] [stdout] --> problems/n_125_valid_palindrome/src/lib.rs:6:12 [INFO] [stdout] | [INFO] [stdout] 5 | impl Solution { [INFO] [stdout] | ------------- associated functions in this implementation [INFO] [stdout] 6 | pub fn is_palindrome(str: String) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | fn check_palindrome(str: &str) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 2 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `binary_search` is never used [INFO] [stdout] --> algorithms/binary_search/src/lib.rs:1:4 [INFO] [stdout] | [INFO] [stdout] 1 | fn binary_search(v: Vec, target: u128) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `binary_search_recursive` is never used [INFO] [stdout] --> algorithms/binary_search/src/lib.rs:24:4 [INFO] [stdout] | [INFO] [stdout] 24 | fn binary_search_recursive(v: Vec, target: u128, start: usize, stop: usize) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 2 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `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] = note: `Item` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [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] = note: `Cell` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `run_knapsack_problem` is never used [INFO] [stdout] --> algorithms/dynamic/src/lib.rs:19:4 [INFO] [stdout] | [INFO] [stdout] 19 | fn run_knapsack_problem( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `longest_common_substring` is never used [INFO] [stdout] --> algorithms/dynamic/src/lib.rs:87:4 [INFO] [stdout] | [INFO] [stdout] 87 | fn longest_common_substring(target: String, variants: Vec) -> Vec<(String, i128)> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 6 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait `Partition` is never used [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:1:7 [INFO] [stdout] | [INFO] [stdout] 1 | trait Partition { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `quicksort` is never used [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:11:4 [INFO] [stdout] | [INFO] [stdout] 11 | fn quicksort(mut v: Vec, asc: bool, partition: Box) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Hoare` is never constructed [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | struct Hoare {} [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Lomuto` is never constructed [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:89:8 [INFO] [stdout] | [INFO] [stdout] 89 | struct Lomuto {} [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `quicksort_recursive` is never used [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:129:4 [INFO] [stdout] | [INFO] [stdout] 129 | fn quicksort_recursive(mut v: Vec, asc: bool) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `choose_sub_array` is never used [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:159:4 [INFO] [stdout] | [INFO] [stdout] 159 | fn choose_sub_array( [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `swap_force` is never used [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:181:4 [INFO] [stdout] | [INFO] [stdout] 181 | fn swap_force(v: &mut Vec, i1: usize, i2: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `swap` is never used [INFO] [stdout] --> algorithms/quicksort/src/lib.rs:187:4 [INFO] [stdout] | [INFO] [stdout] 187 | fn swap(v: &mut Vec, i1: usize, i2: usize, asc: bool) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 8 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Solution` is never constructed [INFO] [stdout] --> problems/n_9_palindrome_number/src/lib.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | struct Solution {} [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `is_palindrome` is never used [INFO] [stdout] --> problems/n_9_palindrome_number/src/lib.rs:4:12 [INFO] [stdout] | [INFO] [stdout] 3 | impl Solution { [INFO] [stdout] | ------------- associated function in this implementation [INFO] [stdout] 4 | pub fn is_palindrome(mut x: i32) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 2 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `SIZE` is never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:1:7 [INFO] [stdout] | [INFO] [stdout] 1 | const SIZE: usize = 10; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `HashFn` is never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:3:6 [INFO] [stdout] | [INFO] [stdout] 3 | type HashFn = Box usize>; [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `DataType` is never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:5:6 [INFO] [stdout] | [INFO] [stdout] 5 | type DataType = &'static str; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `Value` is never constructed [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | struct Value { [INFO] [stdout] | ^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Value` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function `new` is never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:14:8 [INFO] [stdout] | [INFO] [stdout] 13 | impl Value { [INFO] [stdout] | ---------- associated function in this implementation [INFO] [stdout] 14 | fn new(key: &str, data: DataType) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `HashTable` is never constructed [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | struct HashTable { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `insert`, `get`, `delete`, and `load_factor` are never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 27 | impl HashTable { [INFO] [stdout] | -------------- associated items in this implementation [INFO] [stdout] 28 | fn new(hash_fn: HashFn) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | fn insert(&mut self, key: &str, data: DataType) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 50 | fn get(&self, key: &str) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | fn delete(&mut self, key: &str) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn load_factor(&self) -> f64 { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `hash_fn_mod` is never used [INFO] [stdout] --> algorithms/hash_table/src/lib.rs:84:4 [INFO] [stdout] | [INFO] [stdout] 84 | fn hash_fn_mod(data: &str) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 8 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling sum_array v0.1.0 (/opt/rustwide/workdir/algorithms/sum_array) [INFO] [stderr] Compiling hash_table v0.1.0 (/opt/rustwide/workdir/algorithms/hash_table) [INFO] [stderr] Compiling quicksort v0.1.0 (/opt/rustwide/workdir/algorithms/quicksort) [INFO] [stderr] Compiling n_9_palindrome_number v0.1.0 (/opt/rustwide/workdir/problems/n_9_palindrome_number) [INFO] [stderr] Compiling find_max_size_square_plots v0.1.0 (/opt/rustwide/workdir/algorithms/find_max_size_square_plots) [INFO] [stderr] Compiling dynamic v0.1.0 (/opt/rustwide/workdir/algorithms/dynamic) [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: associated function `new` is never used [INFO] [stdout] --> algorithms/greedy/src/lib.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl Class { [INFO] [stdout] | ---------- associated function in this implementation [INFO] [stdout] 13 | fn new(name: &str, start: &str, stop: &str) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `schedule_problem` is never used [INFO] [stdout] --> algorithms/greedy/src/lib.rs:26:4 [INFO] [stdout] | [INFO] [stdout] 26 | fn schedule_problem(classes: Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `set_covering_problem` is never used [INFO] [stdout] --> algorithms/greedy/src/lib.rs:46:4 [INFO] [stdout] | [INFO] [stdout] 46 | fn set_covering_problem<'a>( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `salesperson_problem` is never used [INFO] [stdout] --> algorithms/greedy/src/lib.rs:69:4 [INFO] [stdout] | [INFO] [stdout] 69 | fn salesperson_problem( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: using `.clone()` on a double reference, which returns `&str` instead of cloning the inner type [INFO] [stdout] --> algorithms/greedy/src/lib.rs:63:45 [INFO] [stdout] | [INFO] [stdout] 63 | final_stations.insert(best_station.0.clone()); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(suspicious_double_ref_op)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 5 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `ActResult` is never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:11:6 [INFO] [stdout] | [INFO] [stdout] 11 | enum ActResult { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_edge`, `traverse_depth_first`, and `traverse_breadth_first` are never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 26 | / impl Node [INFO] [stdout] 27 | | where [INFO] [stdout] 28 | | T: Clone, [INFO] [stdout] | |_____________- associated items in this implementation [INFO] [stdout] 29 | { [INFO] [stdout] 30 | fn new(name: NodeName, data: T) -> Link { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | fn add_edge(&mut self, node: Link, weight: Weight) -> &mut Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn traverse_depth_first(&self, act: &F, seen: &mut HashSet) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | fn traverse_breadth_first(&self, act: &F, seen: &mut HashSet) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `breadth_first_search` is never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:92:4 [INFO] [stdout] | [INFO] [stdout] 92 | fn breadth_first_search(root: Link, target: &str) -> Option [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_node` is never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:110:4 [INFO] [stdout] | [INFO] [stdout] 110 | fn print_node(node: &Node) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `print_edge` is never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:121:4 [INFO] [stdout] | [INFO] [stdout] 121 | fn print_edge(edge: &Edge) -> ActResult { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `depth_first_topological_sort` is never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:135:4 [INFO] [stdout] | [INFO] [stdout] 135 | fn depth_first_topological_sort(root: Link) -> VecDeque> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `visit` is never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:160:4 [INFO] [stdout] | [INFO] [stdout] 160 | fn visit( [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `dijkstra` is never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:188:4 [INFO] [stdout] | [INFO] [stdout] 188 | fn dijkstra(root: Link) -> (HashMap, HashMap>>) [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `find_closest_node` is never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:231:4 [INFO] [stdout] | [INFO] [stdout] 231 | fn find_closest_node( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `bellman_ford` is never used [INFO] [stdout] --> algorithms/graph/src/lib.rs:249:4 [INFO] [stdout] | [INFO] [stdout] 249 | fn bellman_ford(root: Link) -> (HashMap, HashMap>>) [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 10 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: using `.clone()` on a double reference, which returns `&str` instead of cloning the inner type [INFO] [stdout] --> algorithms/greedy/src/lib.rs:63:45 [INFO] [stdout] | [INFO] [stdout] 63 | final_stations.insert(best_station.0.clone()); [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(suspicious_double_ref_op)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling selection_sort v0.1.0 (/opt/rustwide/workdir/algorithms/selection_sort) [INFO] [stderr] Compiling binary_search v0.1.0 (/opt/rustwide/workdir/algorithms/binary_search) [INFO] [stderr] Compiling n_125_valid_palindrome v0.1.0 (/opt/rustwide/workdir/problems/n_125_valid_palindrome) [INFO] [stdout] warning: 1 warning emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 7.21s [INFO] running `Command { std: "docker" "inspect" "dee3ea8d28b116cc64c760b4db70a70aa6ddee6b7f5474721eda5f749ae2b03f", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "dee3ea8d28b116cc64c760b4db70a70aa6ddee6b7f5474721eda5f749ae2b03f", kill_on_drop: false }` [INFO] [stdout] dee3ea8d28b116cc64c760b4db70a70aa6ddee6b7f5474721eda5f749ae2b03f [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid -Copt-level=3" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:2788e3201cd34a07e3172128adcd8b3090168a8e3bcc40d7c032b9dda1df7d1c" "/opt/rustwide/cargo-home/bin/cargo" "+61223975d46f794466efa832bc7562b9707ecc46" "test" "--frozen", kill_on_drop: false }` [INFO] [stdout] 64e39ae92fbda04aaeb89231e54b3fa0ea146a6c4e728529043306ac5590d585 [INFO] running `Command { std: "docker" "start" "-a" "64e39ae92fbda04aaeb89231e54b3fa0ea146a6c4e728529043306ac5590d585", kill_on_drop: false }` [INFO] [stderr] warning: virtual workspace defaulting to `resolver = "1"` despite one or more workspace members being on edition 2021 which implies `resolver = "2"` [INFO] [stderr] note: to keep the current resolver, specify `workspace.resolver = "1"` in the workspace root's manifest [INFO] [stderr] note: to use the edition 2021 resolver, specify `workspace.resolver = "2"` in the workspace root's manifest [INFO] [stderr] note: for more details see https://doc.rust-lang.org/cargo/reference/resolver.html#resolver-versions [INFO] [stderr] warning: struct `Solution` is never constructed [INFO] [stderr] --> problems/n_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: trait `Partition` is never used [INFO] [stderr] --> algorithms/quicksort/src/lib.rs:1:7 [INFO] [stderr] | [INFO] [stderr] 1 | trait Partition { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function `quicksort` is never used [INFO] [stderr] --> algorithms/quicksort/src/lib.rs:11:4 [INFO] [stderr] | [INFO] [stderr] 11 | fn quicksort(mut v: Vec, asc: bool, partition: Box) -> Vec { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Hoare` is never constructed [INFO] [stderr] --> algorithms/quicksort/src/lib.rs:24:8 [INFO] [stderr] | [INFO] [stderr] 24 | struct Hoare {} [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Lomuto` is never constructed [INFO] [stderr] --> algorithms/quicksort/src/lib.rs:89:8 [INFO] [stderr] | [INFO] [stderr] 89 | struct Lomuto {} [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `quicksort_recursive` is never used [INFO] [stderr] --> algorithms/quicksort/src/lib.rs:129:4 [INFO] [stderr] | [INFO] [stderr] 129 | fn quicksort_recursive(mut v: Vec, asc: bool) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `choose_sub_array` is never used [INFO] [stderr] --> algorithms/quicksort/src/lib.rs:159:4 [INFO] [stderr] | [INFO] [stderr] 159 | fn choose_sub_array( [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `swap_force` is never used [INFO] [stderr] --> algorithms/quicksort/src/lib.rs:181:4 [INFO] [stderr] | [INFO] [stderr] 181 | fn swap_force(v: &mut Vec, i1: usize, i2: usize) { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `swap` is never used [INFO] [stderr] --> algorithms/quicksort/src/lib.rs:187:4 [INFO] [stderr] | [INFO] [stderr] 187 | fn swap(v: &mut Vec, i1: usize, i2: usize, asc: bool) { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: 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: `n_125_valid_palindrome` (lib) generated 2 warnings [INFO] [stderr] warning: `quicksort` (lib) generated 8 warnings [INFO] [stderr] warning: `n_9_palindrome_number` (lib) generated 2 warnings [INFO] [stderr] warning: type alias `Type` is never used [INFO] [stderr] --> algorithms/sum_array/src/lib.rs:1:6 [INFO] [stderr] | [INFO] [stderr] 1 | type Type = i128; [INFO] [stderr] | ^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function `sum_recursive_dc` is never used [INFO] [stderr] --> algorithms/sum_array/src/lib.rs:4:4 [INFO] [stderr] | [INFO] [stderr] 4 | fn sum_recursive_dc(v: Vec) -> Type { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `sum` is never used [INFO] [stderr] --> algorithms/sum_array/src/lib.rs:11:4 [INFO] [stderr] | [INFO] [stderr] 11 | fn sum(v: Vec) -> Type { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: type alias `Type` is never used [INFO] [stderr] --> algorithms/selection_sort/src/lib.rs:1:6 [INFO] [stderr] | [INFO] [stderr] 1 | type Type = u128; [INFO] [stderr] | ^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function `selection_sort` is never used [INFO] [stderr] --> algorithms/selection_sort/src/lib.rs:3:4 [INFO] [stderr] | [INFO] [stderr] 3 | fn selection_sort(mut v: Vec, asc: bool) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `find_extremum` is never used [INFO] [stderr] --> algorithms/selection_sort/src/lib.rs:16:4 [INFO] [stderr] | [INFO] [stderr] 16 | fn find_extremum(v: Vec, asc: bool) -> usize { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `find` is never used [INFO] [stderr] --> algorithms/find_max_size_square_plots/src/lib.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn find(height: u128, width: u128) -> u128 { [INFO] [stderr] | ^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: type alias `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] = note: `Item` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [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] = note: `Cell` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stderr] [INFO] [stderr] warning: function `run_knapsack_problem` is never used [INFO] [stderr] --> algorithms/dynamic/src/lib.rs:19:4 [INFO] [stderr] | [INFO] [stderr] 19 | fn run_knapsack_problem( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `longest_common_substring` is never used [INFO] [stderr] --> algorithms/dynamic/src/lib.rs:87:4 [INFO] [stderr] | [INFO] [stderr] 87 | fn longest_common_substring(target: String, variants: Vec) -> Vec<(String, i128)> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `binary_search` is never used [INFO] [stderr] --> algorithms/binary_search/src/lib.rs:1:4 [INFO] [stderr] | [INFO] [stderr] 1 | fn binary_search(v: Vec, target: u128) -> Option { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function `binary_search_recursive` is never used [INFO] [stderr] --> algorithms/binary_search/src/lib.rs:24:4 [INFO] [stderr] | [INFO] [stderr] 24 | fn binary_search_recursive(v: Vec, target: u128, start: usize, stop: usize) -> Option { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: `sum_array` (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: `dynamic` (lib) generated 6 warnings [INFO] [stderr] warning: `binary_search` (lib) generated 2 warnings [INFO] [stderr] warning: constant `SIZE` is never used [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:1:7 [INFO] [stderr] | [INFO] [stderr] 1 | const SIZE: usize = 10; [INFO] [stderr] | ^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: type alias `HashFn` is never used [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:3:6 [INFO] [stderr] | [INFO] [stderr] 3 | type HashFn = Box usize>; [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: type alias `DataType` is never used [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:5:6 [INFO] [stderr] | [INFO] [stderr] 5 | type DataType = &'static str; [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `Value` is never constructed [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:8:8 [INFO] [stderr] | [INFO] [stderr] 8 | struct Value { [INFO] [stderr] | ^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `Value` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stderr] [INFO] [stderr] warning: associated function `new` is never used [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:14:8 [INFO] [stderr] | [INFO] [stderr] 13 | impl Value { [INFO] [stderr] | ---------- associated function in this implementation [INFO] [stderr] 14 | fn new(key: &str, data: DataType) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: struct `HashTable` is never constructed [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:22:8 [INFO] [stderr] | [INFO] [stderr] 22 | struct HashTable { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated items `new`, `insert`, `get`, `delete`, and `load_factor` are never used [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:28:8 [INFO] [stderr] | [INFO] [stderr] 27 | impl HashTable { [INFO] [stderr] | -------------- associated items in this implementation [INFO] [stderr] 28 | fn new(hash_fn: HashFn) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 36 | fn insert(&mut self, key: &str, data: DataType) { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 50 | fn get(&self, key: &str) -> Option { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 61 | fn delete(&mut self, key: &str) { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 72 | fn load_factor(&self) -> f64 { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `hash_fn_mod` is never used [INFO] [stderr] --> algorithms/hash_table/src/lib.rs:84:4 [INFO] [stderr] | [INFO] [stderr] 84 | fn hash_fn_mod(data: &str) -> usize { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: `hash_table` (lib) generated 8 warnings [INFO] [stderr] warning: associated function `new` is never used [INFO] [stderr] --> algorithms/greedy/src/lib.rs:13:8 [INFO] [stderr] | [INFO] [stderr] 12 | impl Class { [INFO] [stderr] | ---------- associated function in this implementation [INFO] [stderr] 13 | fn new(name: &str, start: &str, stop: &str) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function `schedule_problem` is never used [INFO] [stderr] --> algorithms/greedy/src/lib.rs:26:4 [INFO] [stderr] | [INFO] [stderr] 26 | fn schedule_problem(classes: Vec) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `set_covering_problem` is never used [INFO] [stderr] --> algorithms/greedy/src/lib.rs:46:4 [INFO] [stderr] | [INFO] [stderr] 46 | fn set_covering_problem<'a>( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `salesperson_problem` is never used [INFO] [stderr] --> algorithms/greedy/src/lib.rs:69:4 [INFO] [stderr] | [INFO] [stderr] 69 | fn salesperson_problem( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: using `.clone()` on a double reference, which returns `&str` instead of cloning the inner type [INFO] [stderr] --> algorithms/greedy/src/lib.rs:63:45 [INFO] [stderr] | [INFO] [stderr] 63 | final_stations.insert(best_station.0.clone()); [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(suspicious_double_ref_op)]` on by default [INFO] [stderr] [INFO] [stderr] warning: enum `ActResult` is never used [INFO] [stderr] --> algorithms/graph/src/lib.rs:11:6 [INFO] [stderr] | [INFO] [stderr] 11 | enum ActResult { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: associated items `new`, `add_edge`, `traverse_depth_first`, and `traverse_breadth_first` are never used [INFO] [stderr] --> algorithms/graph/src/lib.rs:30:8 [INFO] [stderr] | [INFO] [stderr] 26 | / impl Node [INFO] [stderr] 27 | | where [INFO] [stderr] 28 | | T: Clone, [INFO] [stderr] | |_____________- associated items in this implementation [INFO] [stderr] 29 | { [INFO] [stderr] 30 | fn new(name: NodeName, data: T) -> Link { [INFO] [stderr] | ^^^ [INFO] [stderr] ... [INFO] [stderr] 38 | fn add_edge(&mut self, node: Link, weight: Weight) -> &mut Self { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 43 | fn traverse_depth_first(&self, act: &F, seen: &mut HashSet) [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 57 | fn traverse_breadth_first(&self, act: &F, seen: &mut HashSet) [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `breadth_first_search` is never used [INFO] [stderr] --> algorithms/graph/src/lib.rs:92:4 [INFO] [stderr] | [INFO] [stderr] 92 | fn breadth_first_search(root: Link, target: &str) -> Option [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `print_node` is never used [INFO] [stderr] --> algorithms/graph/src/lib.rs:110:4 [INFO] [stderr] | [INFO] [stderr] 110 | fn print_node(node: &Node) { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `print_edge` is never used [INFO] [stderr] --> algorithms/graph/src/lib.rs:121:4 [INFO] [stderr] | [INFO] [stderr] 121 | fn print_edge(edge: &Edge) -> ActResult { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `depth_first_topological_sort` is never used [INFO] [stderr] --> algorithms/graph/src/lib.rs:135:4 [INFO] [stderr] | [INFO] [stderr] 135 | fn depth_first_topological_sort(root: Link) -> VecDeque> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `visit` is never used [INFO] [stderr] --> algorithms/graph/src/lib.rs:160:4 [INFO] [stderr] | [INFO] [stderr] 160 | fn visit( [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `dijkstra` is never used [INFO] [stderr] --> algorithms/graph/src/lib.rs:188:4 [INFO] [stderr] | [INFO] [stderr] 188 | fn dijkstra(root: Link) -> (HashMap, HashMap>>) [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `find_closest_node` is never used [INFO] [stderr] --> algorithms/graph/src/lib.rs:231:4 [INFO] [stderr] | [INFO] [stderr] 231 | fn find_closest_node( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `bellman_ford` is never used [INFO] [stderr] --> algorithms/graph/src/lib.rs:249:4 [INFO] [stderr] | [INFO] [stderr] 249 | fn bellman_ford(root: Link) -> (HashMap, HashMap>>) [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: `greedy` (lib) generated 5 warnings [INFO] [stderr] warning: `graph` (lib) generated 10 warnings [INFO] [stderr] warning: `greedy` (lib test) generated 1 warning (1 duplicate) [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.03s [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/binary_search-7cca32936c746b59) [INFO] [stdout] [INFO] [stdout] running 2 tests [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/dynamic-0772ac97b087ec97) [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] [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.08s [INFO] [stdout] [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/find_max_size_square_plots-512a14ae97dd4c61) [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-be66353c08147602) [INFO] [stdout] [INFO] [stdout] running 7 tests [INFO] [stdout] test tests::test_bellman_ford ... ok [INFO] [stdout] test tests::test_dijkstra ... ok [INFO] [stdout] test tests::test_breadth_first_topology_sort ... ok [INFO] [stdout] test tests::test_depth_first_traverse ... ok [INFO] [stdout] test tests::test_breadth_first_search ... ok [INFO] [stdout] test tests::test_breadth_first_traverse ... ok [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/greedy-3f8d951193bcee4b) [INFO] [stdout] test tests::test_rand ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 7 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.01s [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] running 3 tests [INFO] [stdout] test tests::test_salesperson_problem ... ok [INFO] [stdout] test tests::test_schedule_problem ... ok [INFO] [stdout] test tests::test_covering_problem ... FAILED [INFO] [stderr] error: test failed, to rerun pass `-p greedy --lib` [INFO] [stdout] [INFO] [stdout] failures: [INFO] [stdout] [INFO] [stdout] ---- tests::test_covering_problem stdout ---- [INFO] [stdout] thread 'tests::test_covering_problem' panicked at algorithms/greedy/src/lib.rs:170:9: [INFO] [stdout] assertion `left == right` failed [INFO] [stdout] left: {"kfour"} [INFO] [stdout] right: {} [INFO] [stdout] stack backtrace: [INFO] [stdout] 0: 0x562f0a085b86 - std::backtrace_rs::backtrace::libunwind::trace::h68e08e31a5edd928 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/../../backtrace/src/backtrace/libunwind.rs:104:5 [INFO] [stdout] 1: 0x562f0a085b86 - std::backtrace_rs::backtrace::trace_unsynchronized::hc8e4d3186f828cab [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/../../backtrace/src/backtrace/mod.rs:66:5 [INFO] [stdout] 2: 0x562f0a085b86 - std::sys_common::backtrace::_print_fmt::hdcdca1c0665ccefc [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/sys_common/backtrace.rs:68:5 [INFO] [stdout] 3: 0x562f0a085b86 - ::fmt::h752651e67cc277a4 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/sys_common/backtrace.rs:44:22 [INFO] [stdout] 4: 0x562f0a0ad51c - core::fmt::rt::Argument::fmt::h4e7c3e22f7386287 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/core/src/fmt/rt.rs:142:9 [INFO] [stdout] 5: 0x562f0a0ad51c - core::fmt::write::hd44b1d45ba162e21 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/core/src/fmt/mod.rs:1120:17 [INFO] [stdout] 6: 0x562f0a08343f - std::io::Write::write_fmt::hdb67a49a0754f939 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/io/mod.rs:1846:15 [INFO] [stdout] 7: 0x562f0a085934 - std::sys_common::backtrace::_print::hbca331de1381491f [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/sys_common/backtrace.rs:47:5 [INFO] [stdout] 8: 0x562f0a085934 - std::sys_common::backtrace::print::hade58077d78c625d [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/sys_common/backtrace.rs:34:9 [INFO] [stdout] 9: 0x562f0a08762b - std::panicking::default_hook::{{closure}}::hc9f80a2cdc6be4c4 [INFO] [stdout] 10: 0x562f0a0872fd - std::panicking::default_hook::h1fc68886dc215416 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/panicking.rs:289:9 [INFO] [stdout] 11: 0x562f0a0513f7 - as core::ops::function::Fn>::call::ha16821620acc0367 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/alloc/src/boxed.rs:2030:9 [INFO] [stdout] 12: 0x562f0a0513f7 - test::test_main::{{closure}}::h1a3ed7cd910c2945 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/test/src/lib.rs:137:21 [INFO] [stdout] 13: 0x562f0a087c60 - as core::ops::function::Fn>::call::he260753ff79c0e70 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/alloc/src/boxed.rs:2030:9 [INFO] [stdout] 14: 0x562f0a087c60 - std::panicking::rust_panic_with_hook::heff73da0ddd67492 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/panicking.rs:786:13 [INFO] [stdout] 15: 0x562f0a0879a2 - std::panicking::begin_panic_handler::{{closure}}::h141137f9c7de1e02 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/panicking.rs:660:13 [INFO] [stdout] 16: 0x562f0a086066 - std::sys_common::backtrace::__rust_end_short_backtrace::hbde4e66d30db627d [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/sys_common/backtrace.rs:171:18 [INFO] [stdout] 17: 0x562f0a0876d4 - rust_begin_unwind [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/panicking.rs:648:5 [INFO] [stdout] 18: 0x562f0a011c05 - core::panicking::panic_fmt::h92fcc83e4972ca9b [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/core/src/panicking.rs:72:14 [INFO] [stdout] 19: 0x562f0a011f4b - core::panicking::assert_failed_inner::h25ff1575da1dfede [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/core/src/panicking.rs:342:17 [INFO] [stdout] 20: 0x562f0a00e3df - core::panicking::assert_failed::h7ae3476cf7d5e2a0 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/core/src/panicking.rs:297:5 [INFO] [stdout] 21: 0x562f0a019df6 - greedy::tests::test_covering_problem::heeeb00d8e351e4e2 [INFO] [stdout] at /opt/rustwide/workdir/algorithms/greedy/src/lib.rs:170:9 [INFO] [stdout] 22: 0x562f0a015e99 - greedy::tests::test_covering_problem::{{closure}}::h2d2ae569f31ed975 [INFO] [stdout] at /opt/rustwide/workdir/algorithms/greedy/src/lib.rs:155:31 [INFO] [stdout] 23: 0x562f0a015e99 - core::ops::function::FnOnce::call_once::hfd255be882ef084e [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 24: 0x562f0a056b5f - core::ops::function::FnOnce::call_once::hb5d425830acba2e8 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 25: 0x562f0a056b5f - test::__rust_begin_short_backtrace::h8054e86d0f5ccc86 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/test/src/lib.rs:620:18 [INFO] [stdout] 26: 0x562f0a055770 - test::run_test_in_process::{{closure}}::h85d13cb166c10721 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/test/src/lib.rs:643:60 [INFO] [stdout] 27: 0x562f0a055770 - as core::ops::function::FnOnce<()>>::call_once::hc3dc86b8d5205a04 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/core/src/panic/unwind_safe.rs:272:9 [INFO] [stdout] 28: 0x562f0a055770 - std::panicking::try::do_call::hc17666b06748adad [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/panicking.rs:555:40 [INFO] [stdout] 29: 0x562f0a055770 - std::panicking::try::h1e9fba0c97684d1d [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/panicking.rs:519:19 [INFO] [stdout] 30: 0x562f0a055770 - std::panic::catch_unwind::h8328c2da9899627c [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/panic.rs:142:14 [INFO] [stdout] 31: 0x562f0a055770 - test::run_test_in_process::hf19a99f254958c9c [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/test/src/lib.rs:643:27 [INFO] [stdout] 32: 0x562f0a055770 - test::run_test::{{closure}}::hba6ab6b94e515411 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/test/src/lib.rs:566:43 [INFO] [stdout] 33: 0x562f0a01dab3 - test::run_test::{{closure}}::h6ac7c2253cb9cc0f [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/test/src/lib.rs:594:41 [INFO] [stdout] 34: 0x562f0a01dab3 - std::sys_common::backtrace::__rust_begin_short_backtrace::hb4fbc53b7e758a6f [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/sys_common/backtrace.rs:155:18 [INFO] [stdout] 35: 0x562f0a0227df - std::thread::Builder::spawn_unchecked_::{{closure}}::{{closure}}::ha24970823708ac98 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/thread/mod.rs:528:17 [INFO] [stdout] 36: 0x562f0a0227df - as core::ops::function::FnOnce<()>>::call_once::h16db0733eff2a03c [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/core/src/panic/unwind_safe.rs:272:9 [INFO] [stdout] 37: 0x562f0a0227df - std::panicking::try::do_call::hc2890dbc9a490eee [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/panicking.rs:555:40 [INFO] [stdout] 38: 0x562f0a0227df - std::panicking::try::ha67ad75b01f98422 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/panicking.rs:519:19 [INFO] [stdout] 39: 0x562f0a0227df - std::panic::catch_unwind::h26725df9ddb3fcd2 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/panic.rs:142:14 [INFO] [stdout] 40: 0x562f0a0227df - std::thread::Builder::spawn_unchecked_::{{closure}}::hf0e59407b0ff3ed8 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/thread/mod.rs:527:30 [INFO] [stdout] 41: 0x562f0a0227df - core::ops::function::FnOnce::call_once{{vtable.shim}}::hd4eb105f82d3bb8e [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/core/src/ops/function.rs:250:5 [INFO] [stdout] 42: 0x562f0a08bec5 - as core::ops::function::FnOnce>::call_once::h28564f61ef15890d [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/alloc/src/boxed.rs:2016:9 [INFO] [stdout] 43: 0x562f0a08bec5 - as core::ops::function::FnOnce>::call_once::h03728738d990d027 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/alloc/src/boxed.rs:2016:9 [INFO] [stdout] 44: 0x562f0a08bec5 - std::sys::pal::unix::thread::Thread::new::thread_start::heb455c9485795637 [INFO] [stdout] at /rustc/61223975d46f794466efa832bc7562b9707ecc46/library/std/src/sys/pal/unix/thread.rs:108:17 [INFO] [stdout] 45: 0x7f94c02cbac3 - [INFO] [stdout] 46: 0x7f94c035cbf4 - __clone [INFO] [stdout] 47: 0x0 - [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] failures: [INFO] [stdout] tests::test_covering_problem [INFO] [stdout] [INFO] [stdout] test result: FAILED. 2 passed; 1 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.05s [INFO] [stdout] [INFO] running `Command { std: "docker" "inspect" "64e39ae92fbda04aaeb89231e54b3fa0ea146a6c4e728529043306ac5590d585", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "64e39ae92fbda04aaeb89231e54b3fa0ea146a6c4e728529043306ac5590d585", kill_on_drop: false }` [INFO] [stdout] 64e39ae92fbda04aaeb89231e54b3fa0ea146a6c4e728529043306ac5590d585