[INFO] cloning repository https://github.com/LgnMs/my-leetcode-rust
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/LgnMs/my-leetcode-rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FLgnMs%2Fmy-leetcode-rust", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FLgnMs%2Fmy-leetcode-rust'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 1510c4a229239e22d30000124dd90f19b5a44a60
[INFO] testing LgnMs/my-leetcode-rust against beta-2022-04-10 for beta-1.61-1
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FLgnMs%2Fmy-leetcode-rust" "/workspace/builds/worker-71/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-71/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/LgnMs/my-leetcode-rust on toolchain beta-2022-04-10
[INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+beta-2022-04-10" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/LgnMs/my-leetcode-rust
[INFO] finished tweaking git repo https://github.com/LgnMs/my-leetcode-rust
[INFO] tweaked toml for git repo https://github.com/LgnMs/my-leetcode-rust written to /workspace/builds/worker-71/source/Cargo.toml
[INFO] crate git repo https://github.com/LgnMs/my-leetcode-rust already has a lockfile, it will not be regenerated
[INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+beta-2022-04-10" "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-71/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-71/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" "+beta-2022-04-10" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 9d92719a63f2e406ab14b59981a619a440b802476538b975a64200c070c94525
[INFO] running `Command { std: "docker" "start" "-a" "9d92719a63f2e406ab14b59981a619a440b802476538b975a64200c070c94525", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "9d92719a63f2e406ab14b59981a619a440b802476538b975a64200c070c94525", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "9d92719a63f2e406ab14b59981a619a440b802476538b975a64200c070c94525", kill_on_drop: false }`
[INFO] [stdout] 9d92719a63f2e406ab14b59981a619a440b802476538b975a64200c070c94525
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-71/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-71/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" "+beta-2022-04-10" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 10e24e80c3fe50039cbc8e9a0b87211bd9f745c47e80724846d5d5f9c04fa91c
[INFO] running `Command { std: "docker" "start" "-a" "10e24e80c3fe50039cbc8e9a0b87211bd9f745c47e80724846d5d5f9c04fa91c", kill_on_drop: false }`
[INFO] [stdout] warning: unused import: `core::num`
[INFO] [stdout]  --> dynamic_programming/count_bits.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use core::num;
[INFO] [stdout]   |     ^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling tree v0.1.0 (/opt/rustwide/workdir/tree)
[INFO] [stderr]    Compiling sort v0.1.0 (/opt/rustwide/workdir/sort)
[INFO] [stderr]    Compiling two_pointers v0.1.0 (/opt/rustwide/workdir/two_pointers)
[INFO] [stderr]    Compiling string v0.1.0 (/opt/rustwide/workdir/string)
[INFO] [stderr]    Compiling math v0.1.0 (/opt/rustwide/workdir/math)
[INFO] [stderr]    Compiling greedy v0.1.0 (/opt/rustwide/workdir/greedy)
[INFO] [stderr]    Compiling dynamic_programming v0.1.0 (/opt/rustwide/workdir/dynamic_programming)
[INFO] [stderr]    Compiling bit_manipulation v0.1.0 (/opt/rustwide/workdir/bit_manipulation)
[INFO] [stderr]    Compiling linked_list v0.1.0 (/opt/rustwide/workdir/linked_list)
[INFO] [stderr]    Compiling binary_search v0.1.0 (/opt/rustwide/workdir/binary_search)
[INFO] [stderr]    Compiling hash_table v0.1.0 (/opt/rustwide/workdir/hash_table)
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> dynamic_programming/count_bits.rs:27:18
[INFO] [stdout]    |
[INFO] [stdout] 27 |     fn count_one(mut x: i32) -> i32 {
[INFO] [stdout]    |                  ----^
[INFO] [stdout]    |                  |
[INFO] [stdout]    |                  help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `climb_stairs`
[INFO] [stdout]  --> dynamic_programming/climb_stairs.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_palindrome`
[INFO] [stdout]  --> dynamic_programming/longest_palindrome.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn is_palindrome(s: &[char]) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `longest_palindrome`
[INFO] [stdout]   --> dynamic_programming/longest_palindrome.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub fn longest_palindrome(s: String) -> String {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_profit`
[INFO] [stdout]  --> dynamic_programming/max_profit.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_sub_array`
[INFO] [stdout]   --> dynamic_programming/max_sub_array.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `rob`
[INFO] [stdout]   --> dynamic_programming/rob.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn rob(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `can_jump`
[INFO] [stdout]   --> dynamic_programming/can_jump.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn can_jump(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `NumArray`
[INFO] [stdout]  --> dynamic_programming/num_array.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub struct NumArray {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> dynamic_programming/num_array.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 |     fn new(nums: Vec<i32>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `sum_range`
[INFO] [stdout]   --> dynamic_programming/num_array.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 |     fn sum_range(&self, left: i32, right: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `count_bits_1`
[INFO] [stdout]  --> dynamic_programming/count_bits.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn count_bits_1(n: i32) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `count_bits`
[INFO] [stdout]   --> dynamic_programming/count_bits.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub fn count_bits(n: i32) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 14 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `longest_common_prefix`
[INFO] [stdout]  --> binary_search/longest_common_prefix.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn longest_common_prefix(strs: Vec<String>) -> String {
[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: `single_number`
[INFO] [stdout]  --> bit_manipulation/single_number.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn single_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `xor_operation`
[INFO] [stdout]  --> bit_manipulation/xor_operation.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn xor_operation(n: i32, start: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `intersect`
[INFO] [stdout]   --> hash_table/intersect.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn intersect(nums1: Vec<i32>, nums2: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `length_of_longest_substring`
[INFO] [stdout]   --> hash_table/length_of_longest_substring.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `two_sum`
[INFO] [stdout]   --> hash_table/two_sum.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 3 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `first_uniq_char`
[INFO] [stdout]   --> string/first_uniq_char.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn first_uniq_char(s: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_anagram`
[INFO] [stdout]  --> string/is_anagram.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn is_anagram(s: String, t: String) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_palindrome`
[INFO] [stdout]  --> math/is_palindrome.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn is_palindrome(x: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_palindrome`
[INFO] [stdout]  --> string/is_palindrome.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn is_palindrome(s: String) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `reverse`
[INFO] [stdout]  --> string/reverse.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn reverse(x: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `reverse_string`
[INFO] [stdout]  --> string/reverse_string.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn reverse_string(s: &mut Vec<char>) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_valid_bst`
[INFO] [stdout]   --> tree/is_valid_bst.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `plus_one`
[INFO] [stdout]  --> math/plus_one.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn plus_one(mut digits: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `roman_to_int`
[INFO] [stdout]  --> math/roman_to_int.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn roman_to_int(s: String) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `rotate`
[INFO] [stdout]  --> math/rotate.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn rotate(nums: &mut Vec<i32>, k: i32) {
[INFO] [stdout]   |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_valid_bst2`
[INFO] [stdout]   --> tree/is_valid_bst.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub fn is_valid_bst2(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias is never used: `Rt`
[INFO] [stdout]   --> tree/max_depth.rs:12:1
[INFO] [stdout]    |
[INFO] [stdout] 12 | type Rt = Rc<RefCell<TreeNode>>;
[INFO] [stdout]    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_depth`
[INFO] [stdout]   --> tree/max_depth.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn max_depth(root: Option<Rt>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `preorder_traversal`
[INFO] [stdout]   --> tree/preorder_traversal.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias is never used: `Node`
[INFO] [stdout]   --> tree/is_symmetric.rs:12:1
[INFO] [stdout]    |
[INFO] [stdout] 12 | pub type Node = Rc<RefCell<TreeNode>>;
[INFO] [stdout]    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_symmetric`
[INFO] [stdout]   --> tree/is_symmetric.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn is_symmetric(root: Option<Node>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `add_two_numbers`
[INFO] [stdout]   --> linked_list/add_two_numbers.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn add_two_numbers(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_palindrome`
[INFO] [stdout]   --> linked_list/is_palindrome.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn is_palindrome(head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> linked_list/linked_list_utils.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout] 10 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `generate_list_node`
[INFO] [stdout]   --> linked_list/linked_list_utils.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub fn generate_list_node(vecs: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `merge_two_lists`
[INFO] [stdout]  --> linked_list/merge_two_lists.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn merge_two_lists(
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `reverse_list`
[INFO] [stdout]   --> linked_list/reverse_list.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_area`
[INFO] [stdout]   --> two_pointers/max_area.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub fn max_area(height: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `merge`
[INFO] [stdout]  --> two_pointers/merge.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `move_zeroes`
[INFO] [stdout]  --> two_pointers/move_zeroes.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn move_zeroes(nums: &mut Vec<i32>) {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `three_sum`
[INFO] [stdout]  --> two_pointers/three_sum.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `three_sum_closest`
[INFO] [stdout]  --> two_pointers/three_sum_closest.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn three_sum_closest(mut nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 5 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 5 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 4 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_profit2`
[INFO] [stdout]   --> greedy/max_profit2.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn max_profit2(prices: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `contains_duplicate`
[INFO] [stdout]  --> sort/contains_duplicate.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn contains_duplicate(mut nums: Vec<i32>) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `build_max_heap`
[INFO] [stdout]  --> sort/heap_sort.rs:8:4
[INFO] [stdout]   |
[INFO] [stdout] 8 | fn build_max_heap(array: &mut Vec<i32>) {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_heap`
[INFO] [stdout]   --> sort/heap_sort.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn max_heap(array: &mut Vec<i32>, i: usize, heap_size: usize) {
[INFO] [stdout]    |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `heap_sort`
[INFO] [stdout]   --> sort/heap_sort.rs:40:8
[INFO] [stdout]    |
[INFO] [stdout] 40 | pub fn heap_sort(mut array: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 6 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] [stdout] warning: 7 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling playground v0.1.0 (/opt/rustwide/workdir/playground)
[INFO] [stderr]     Finished dev [unoptimized + debuginfo] target(s) in 3.99s
[INFO] running `Command { std: "docker" "inspect" "10e24e80c3fe50039cbc8e9a0b87211bd9f745c47e80724846d5d5f9c04fa91c", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "10e24e80c3fe50039cbc8e9a0b87211bd9f745c47e80724846d5d5f9c04fa91c", kill_on_drop: false }`
[INFO] [stdout] 10e24e80c3fe50039cbc8e9a0b87211bd9f745c47e80724846d5d5f9c04fa91c
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-71/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-71/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" "+beta-2022-04-10" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 89cec1d73610bcc3c1775785653c9b47585301d2533dd996ce73ac70e7e30e12
[INFO] running `Command { std: "docker" "start" "-a" "89cec1d73610bcc3c1775785653c9b47585301d2533dd996ce73ac70e7e30e12", kill_on_drop: false }`
[INFO] [stdout] warning: function is never used: `is_valid_bst`
[INFO] [stdout]   --> tree/is_valid_bst.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_valid_bst2`
[INFO] [stdout]   --> tree/is_valid_bst.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub fn is_valid_bst2(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias is never used: `Rt`
[INFO] [stdout]   --> tree/max_depth.rs:12:1
[INFO] [stdout]    |
[INFO] [stdout] 12 | type Rt = Rc<RefCell<TreeNode>>;
[INFO] [stdout]    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_depth`
[INFO] [stdout]   --> tree/max_depth.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn max_depth(root: Option<Rt>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `preorder_traversal`
[INFO] [stdout]   --> tree/preorder_traversal.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 12 | pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias is never used: `Node`
[INFO] [stdout]   --> tree/is_symmetric.rs:12:1
[INFO] [stdout]    |
[INFO] [stdout] 12 | pub type Node = Rc<RefCell<TreeNode>>;
[INFO] [stdout]    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_symmetric`
[INFO] [stdout]   --> tree/is_symmetric.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 14 | pub fn is_symmetric(root: Option<Node>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 7 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `single_number`
[INFO] [stdout]  --> bit_manipulation/single_number.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn single_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `xor_operation`
[INFO] [stdout]  --> bit_manipulation/xor_operation.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn xor_operation(n: i32, start: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `add_two_numbers`
[INFO] [stdout]   --> linked_list/add_two_numbers.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn add_two_numbers(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_palindrome`
[INFO] [stdout]   --> linked_list/is_palindrome.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn is_palindrome(head: Option<Box<ListNode>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> linked_list/linked_list_utils.rs:10:12
[INFO] [stdout]    |
[INFO] [stdout] 10 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `generate_list_node`
[INFO] [stdout]   --> linked_list/linked_list_utils.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub fn generate_list_node(vecs: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `merge_two_lists`
[INFO] [stdout]  --> linked_list/merge_two_lists.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn merge_two_lists(
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `reverse_list`
[INFO] [stdout]   --> linked_list/reverse_list.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 6 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `contains_duplicate`
[INFO] [stdout]  --> sort/contains_duplicate.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn contains_duplicate(mut nums: Vec<i32>) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `build_max_heap`
[INFO] [stdout]  --> sort/heap_sort.rs:8:4
[INFO] [stdout]   |
[INFO] [stdout] 8 | fn build_max_heap(array: &mut Vec<i32>) {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_heap`
[INFO] [stdout]   --> sort/heap_sort.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn max_heap(array: &mut Vec<i32>, i: usize, heap_size: usize) {
[INFO] [stdout]    |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `heap_sort`
[INFO] [stdout]   --> sort/heap_sort.rs:40:8
[INFO] [stdout]    |
[INFO] [stdout] 40 | pub fn heap_sort(mut array: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 4 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `first_uniq_char`
[INFO] [stdout]   --> string/first_uniq_char.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn first_uniq_char(s: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_anagram`
[INFO] [stdout]  --> string/is_anagram.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn is_anagram(s: String, t: String) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_palindrome`
[INFO] [stdout]  --> string/is_palindrome.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn is_palindrome(s: String) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `reverse`
[INFO] [stdout]  --> string/reverse.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn reverse(x: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `reverse_string`
[INFO] [stdout]  --> string/reverse_string.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn reverse_string(s: &mut Vec<char>) {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 5 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_profit2`
[INFO] [stdout]   --> greedy/max_profit2.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn max_profit2(prices: Vec<i32>) -> i32 {
[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: unused import: `core::num`
[INFO] [stdout]  --> dynamic_programming/count_bits.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use core::num;
[INFO] [stdout]   |     ^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> dynamic_programming/count_bits.rs:27:18
[INFO] [stdout]    |
[INFO] [stdout] 27 |     fn count_one(mut x: i32) -> i32 {
[INFO] [stdout]    |                  ----^
[INFO] [stdout]    |                  |
[INFO] [stdout]    |                  help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `climb_stairs`
[INFO] [stdout]  --> dynamic_programming/climb_stairs.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_palindrome`
[INFO] [stdout]  --> dynamic_programming/longest_palindrome.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn is_palindrome(s: &[char]) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `longest_palindrome`
[INFO] [stdout]   --> dynamic_programming/longest_palindrome.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub fn longest_palindrome(s: String) -> String {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_profit`
[INFO] [stdout]  --> dynamic_programming/max_profit.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_sub_array`
[INFO] [stdout]   --> dynamic_programming/max_sub_array.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `rob`
[INFO] [stdout]   --> dynamic_programming/rob.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn rob(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `can_jump`
[INFO] [stdout]   --> dynamic_programming/can_jump.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn can_jump(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `NumArray`
[INFO] [stdout]  --> dynamic_programming/num_array.rs:8:12
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub struct NumArray {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> dynamic_programming/num_array.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 |     fn new(nums: Vec<i32>) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `sum_range`
[INFO] [stdout]   --> dynamic_programming/num_array.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 |     fn sum_range(&self, left: i32, right: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `count_bits_1`
[INFO] [stdout]  --> dynamic_programming/count_bits.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn count_bits_1(n: i32) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `count_bits`
[INFO] [stdout]   --> dynamic_programming/count_bits.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub fn count_bits(n: i32) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 14 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_area`
[INFO] [stdout]   --> two_pointers/max_area.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub fn max_area(height: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `merge`
[INFO] [stdout]  --> two_pointers/merge.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
[INFO] [stdout]   |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `move_zeroes`
[INFO] [stdout]  --> two_pointers/move_zeroes.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn move_zeroes(nums: &mut Vec<i32>) {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `three_sum`
[INFO] [stdout]  --> two_pointers/three_sum.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]   |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `three_sum_closest`
[INFO] [stdout]  --> two_pointers/three_sum_closest.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn three_sum_closest(mut nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 5 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling math v0.1.0 (/opt/rustwide/workdir/math)
[INFO] [stdout] warning: function is never used: `intersect`
[INFO] [stdout]   --> hash_table/intersect.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn intersect(nums1: Vec<i32>, nums2: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling binary_search v0.1.0 (/opt/rustwide/workdir/binary_search)
[INFO] [stdout] warning: function is never used: `length_of_longest_substring`
[INFO] [stdout]   --> hash_table/length_of_longest_substring.rs:11:8
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling sort v0.1.0 (/opt/rustwide/workdir/sort)
[INFO] [stdout] warning: function is never used: `two_sum`
[INFO] [stdout]   --> hash_table/two_sum.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling linked_list v0.1.0 (/opt/rustwide/workdir/linked_list)
[INFO] [stdout] warning: 3 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling bit_manipulation v0.1.0 (/opt/rustwide/workdir/bit_manipulation)
[INFO] [stderr]    Compiling dynamic_programming v0.1.0 (/opt/rustwide/workdir/dynamic_programming)
[INFO] [stdout] warning: function is never used: `is_palindrome`
[INFO] [stdout]  --> math/is_palindrome.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn is_palindrome(x: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `plus_one`
[INFO] [stdout]  --> math/plus_one.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn plus_one(mut digits: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `roman_to_int`
[INFO] [stdout]  --> math/roman_to_int.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn roman_to_int(s: String) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `rotate`
[INFO] [stdout]  --> math/rotate.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn rotate(nums: &mut Vec<i32>, k: i32) {
[INFO] [stdout]   |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 4 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `longest_common_prefix`
[INFO] [stdout]  --> binary_search/longest_common_prefix.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn longest_common_prefix(strs: Vec<String>) -> String {
[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] [stderr]    Compiling hash_table v0.1.0 (/opt/rustwide/workdir/hash_table)
[INFO] [stderr]    Compiling tree v0.1.0 (/opt/rustwide/workdir/tree)
[INFO] [stderr]    Compiling two_pointers v0.1.0 (/opt/rustwide/workdir/two_pointers)
[INFO] [stderr]    Compiling greedy v0.1.0 (/opt/rustwide/workdir/greedy)
[INFO] [stderr]    Compiling string v0.1.0 (/opt/rustwide/workdir/string)
[INFO] [stderr]    Compiling playground v0.1.0 (/opt/rustwide/workdir/playground)
[INFO] [stdout] warning: unused import: `core::num`
[INFO] [stdout]  --> dynamic_programming/count_bits.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use core::num;
[INFO] [stdout]   |     ^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> dynamic_programming/count_bits.rs:27:18
[INFO] [stdout]    |
[INFO] [stdout] 27 |     fn count_one(mut x: i32) -> i32 {
[INFO] [stdout]    |                  ----^
[INFO] [stdout]    |                  |
[INFO] [stdout]    |                  help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `count_bits_1`
[INFO] [stdout]  --> dynamic_programming/count_bits.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn count_bits_1(n: i32) -> Vec<i32> {
[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] [stderr]     Finished test [unoptimized + debuginfo] target(s) in 0.92s
[INFO] [stderr]   Executable unittests lib.rs (/opt/rustwide/target/debug/deps/binary_search-4330aab8d7061a9a)
[INFO] [stderr]   Executable unittests lib.rs (/opt/rustwide/target/debug/deps/bit_manipulation-465cb6539e1e9b9e)
[INFO] [stderr]   Executable unittests lib.rs (/opt/rustwide/target/debug/deps/dynamic_programming-a5d0f16b5a6d9075)
[INFO] [stderr]   Executable unittests lib.rs (/opt/rustwide/target/debug/deps/greedy-49d9cc2eb784e1a7)
[INFO] [stderr]   Executable unittests lib.rs (/opt/rustwide/target/debug/deps/hash_table-034ce6b95d4d3268)
[INFO] [stderr]   Executable unittests lib.rs (/opt/rustwide/target/debug/deps/linked_list-05bcf8d10d13b1c7)
[INFO] [stderr]   Executable unittests lib.rs (/opt/rustwide/target/debug/deps/math-cb800ce073e1b8d2)
[INFO] [stderr]   Executable unittests main.rs (/opt/rustwide/target/debug/deps/playground-6050f2c413271f67)
[INFO] [stderr]   Executable unittests lib.rs (/opt/rustwide/target/debug/deps/sort-4e91ae68746631e8)
[INFO] [stderr]   Executable unittests lib.rs (/opt/rustwide/target/debug/deps/string-c4d89c7dbce18711)
[INFO] [stderr]   Executable unittests lib.rs (/opt/rustwide/target/debug/deps/tree-f20d4210415de0cb)
[INFO] [stderr]   Executable unittests lib.rs (/opt/rustwide/target/debug/deps/two_pointers-4fbf242766738332)
[INFO] running `Command { std: "docker" "inspect" "89cec1d73610bcc3c1775785653c9b47585301d2533dd996ce73ac70e7e30e12", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "89cec1d73610bcc3c1775785653c9b47585301d2533dd996ce73ac70e7e30e12", kill_on_drop: false }`
[INFO] [stdout] 89cec1d73610bcc3c1775785653c9b47585301d2533dd996ce73ac70e7e30e12
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-71/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-71/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" "+beta-2022-04-10" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] 4bb327a7c712006261ee6a0986861c7ad5bbe9a7a153fa16949aa0e4c08a2070
[INFO] running `Command { std: "docker" "start" "-a" "4bb327a7c712006261ee6a0986861c7ad5bbe9a7a153fa16949aa0e4c08a2070", kill_on_drop: false }`
[INFO] [stderr] warning: function is never used: `is_valid_bst`
[INFO] [stderr]   --> tree/is_valid_bst.rs:13:8
[INFO] [stderr]    |
[INFO] [stderr] 13 | pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `is_valid_bst2`
[INFO] [stderr]   --> tree/is_valid_bst.rs:30:8
[INFO] [stderr]    |
[INFO] [stderr] 30 | pub fn is_valid_bst2(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias is never used: `Rt`
[INFO] [stderr]   --> tree/max_depth.rs:12:1
[INFO] [stderr]    |
[INFO] [stderr] 12 | type Rt = Rc<RefCell<TreeNode>>;
[INFO] [stderr]    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `max_depth`
[INFO] [stderr]   --> tree/max_depth.rs:14:8
[INFO] [stderr]    |
[INFO] [stderr] 14 | pub fn max_depth(root: Option<Rt>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `preorder_traversal`
[INFO] [stderr]   --> tree/preorder_traversal.rs:12:8
[INFO] [stderr]    |
[INFO] [stderr] 12 | pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: type alias is never used: `Node`
[INFO] [stderr]   --> tree/is_symmetric.rs:12:1
[INFO] [stderr]    |
[INFO] [stderr] 12 | pub type Node = Rc<RefCell<TreeNode>>;
[INFO] [stderr]    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `is_symmetric`
[INFO] [stderr]   --> tree/is_symmetric.rs:14:8
[INFO] [stderr]    |
[INFO] [stderr] 14 | pub fn is_symmetric(root: Option<Node>) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `tree` (lib) generated 7 warnings
[INFO] [stderr] warning: function is never used: `single_number`
[INFO] [stderr]  --> bit_manipulation/single_number.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 9 | pub fn single_number(nums: Vec<i32>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `xor_operation`
[INFO] [stderr]  --> bit_manipulation/xor_operation.rs:8:8
[INFO] [stderr]   |
[INFO] [stderr] 8 | pub fn xor_operation(n: i32, start: i32) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `core::num`
[INFO] [stderr]  --> dynamic_programming/count_bits.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use core::num;
[INFO] [stderr]   |     ^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> dynamic_programming/count_bits.rs:27:18
[INFO] [stderr]    |
[INFO] [stderr] 27 |     fn count_one(mut x: i32) -> i32 {
[INFO] [stderr]    |                  ----^
[INFO] [stderr]    |                  |
[INFO] [stderr]    |                  help: remove this `mut`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `climb_stairs`
[INFO] [stderr]  --> dynamic_programming/climb_stairs.rs:8:8
[INFO] [stderr]   |
[INFO] [stderr] 8 | pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `is_palindrome`
[INFO] [stderr]  --> dynamic_programming/longest_palindrome.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 9 | pub fn is_palindrome(s: &[char]) -> bool {
[INFO] [stderr]   |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `longest_palindrome`
[INFO] [stderr]   --> dynamic_programming/longest_palindrome.rs:17:8
[INFO] [stderr]    |
[INFO] [stderr] 17 | pub fn longest_palindrome(s: String) -> String {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `max_profit`
[INFO] [stderr]  --> dynamic_programming/max_profit.rs:8:8
[INFO] [stderr]   |
[INFO] [stderr] 8 | pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `max_sub_array`
[INFO] [stderr]   --> dynamic_programming/max_sub_array.rs:10:8
[INFO] [stderr]    |
[INFO] [stderr] 10 | pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `rob`
[INFO] [stderr]   --> dynamic_programming/rob.rs:10:8
[INFO] [stderr]    |
[INFO] [stderr] 10 | pub fn rob(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `can_jump`
[INFO] [stderr]   --> dynamic_programming/can_jump.rs:10:8
[INFO] [stderr]    |
[INFO] [stderr] 10 | pub fn can_jump(nums: Vec<i32>) -> bool {
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `NumArray`
[INFO] [stderr]  --> dynamic_programming/num_array.rs:8:12
[INFO] [stderr]   |
[INFO] [stderr] 8 | pub struct NumArray {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function is never used: `new`
[INFO] [stderr]   --> dynamic_programming/num_array.rs:18:8
[INFO] [stderr]    |
[INFO] [stderr] 18 |     fn new(nums: Vec<i32>) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function is never used: `sum_range`
[INFO] [stderr]   --> dynamic_programming/num_array.rs:30:8
[INFO] [stderr]    |
[INFO] [stderr] 30 |     fn sum_range(&self, left: i32, right: i32) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `count_bits_1`
[INFO] [stderr]  --> dynamic_programming/count_bits.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 9 | pub fn count_bits_1(n: i32) -> Vec<i32> {
[INFO] [stderr]   |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `count_bits`
[INFO] [stderr]   --> dynamic_programming/count_bits.rs:26:8
[INFO] [stderr]    |
[INFO] [stderr] 26 | pub fn count_bits(n: i32) -> Vec<i32> {
[INFO] [stderr]    |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `is_palindrome`
[INFO] [stderr]  --> math/is_palindrome.rs:8:8
[INFO] [stderr]   |
[INFO] [stderr] 8 | pub fn is_palindrome(x: i32) -> bool {
[INFO] [stderr]   |        ^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `plus_one`
[INFO] [stderr]  --> math/plus_one.rs:8:8
[INFO] [stderr]   |
[INFO] [stderr] 8 | pub fn plus_one(mut digits: Vec<i32>) -> Vec<i32> {
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `roman_to_int`
[INFO] [stderr]  --> math/roman_to_int.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 9 | pub fn roman_to_int(s: String) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `rotate`
[INFO] [stderr]  --> math/rotate.rs:7:8
[INFO] [stderr]   |
[INFO] [stderr] 7 | pub fn rotate(nums: &mut Vec<i32>, k: i32) {
[INFO] [stderr]   |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `longest_common_prefix`
[INFO] [stderr]  --> binary_search/longest_common_prefix.rs:8:8
[INFO] [stderr]   |
[INFO] [stderr] 8 | pub fn longest_common_prefix(strs: Vec<String>) -> String {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `contains_duplicate`
[INFO] [stderr]  --> sort/contains_duplicate.rs:7:8
[INFO] [stderr]   |
[INFO] [stderr] 7 | pub fn contains_duplicate(mut nums: Vec<i32>) -> bool {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `build_max_heap`
[INFO] [stderr]  --> sort/heap_sort.rs:8:4
[INFO] [stderr]   |
[INFO] [stderr] 8 | fn build_max_heap(array: &mut Vec<i32>) {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `max_heap`
[INFO] [stderr]   --> sort/heap_sort.rs:22:4
[INFO] [stderr]    |
[INFO] [stderr] 22 | fn max_heap(array: &mut Vec<i32>, i: usize, heap_size: usize) {
[INFO] [stderr]    |    ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `heap_sort`
[INFO] [stderr]   --> sort/heap_sort.rs:40:8
[INFO] [stderr]    |
[INFO] [stderr] 40 | pub fn heap_sort(mut array: Vec<i32>) -> Vec<i32> {
[INFO] [stderr]    |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `first_uniq_char`
[INFO] [stderr]   --> string/first_uniq_char.rs:10:8
[INFO] [stderr]    |
[INFO] [stderr] 10 | pub fn first_uniq_char(s: String) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `is_anagram`
[INFO] [stderr]  --> string/is_anagram.rs:7:8
[INFO] [stderr]   |
[INFO] [stderr] 7 | pub fn is_anagram(s: String, t: String) -> bool {
[INFO] [stderr]   |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `is_palindrome`
[INFO] [stderr]  --> string/is_palindrome.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 9 | pub fn is_palindrome(s: String) -> bool {
[INFO] [stderr]   |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `reverse`
[INFO] [stderr]  --> string/reverse.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 9 | pub fn reverse(x: i32) -> i32 {
[INFO] [stderr]   |        ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `reverse_string`
[INFO] [stderr]  --> string/reverse_string.rs:7:8
[INFO] [stderr]   |
[INFO] [stderr] 7 | pub fn reverse_string(s: &mut Vec<char>) {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `max_area`
[INFO] [stderr]   --> two_pointers/max_area.rs:11:8
[INFO] [stderr]    |
[INFO] [stderr] 11 | pub fn max_area(height: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `merge`
[INFO] [stderr]  --> two_pointers/merge.rs:7:8
[INFO] [stderr]   |
[INFO] [stderr] 7 | pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
[INFO] [stderr]   |        ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `move_zeroes`
[INFO] [stderr]  --> two_pointers/move_zeroes.rs:8:8
[INFO] [stderr]   |
[INFO] [stderr] 8 | pub fn move_zeroes(nums: &mut Vec<i32>) {
[INFO] [stderr]   |        ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `three_sum`
[INFO] [stderr]  --> two_pointers/three_sum.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 9 | pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stderr]   |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `three_sum_closest`
[INFO] [stderr]  --> two_pointers/three_sum_closest.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 9 | pub fn three_sum_closest(mut nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `add_two_numbers`
[INFO] [stderr]   --> linked_list/add_two_numbers.rs:10:8
[INFO] [stderr]    |
[INFO] [stderr] 10 | pub fn add_two_numbers(
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `is_palindrome`
[INFO] [stderr]   --> linked_list/is_palindrome.rs:10:8
[INFO] [stderr]    |
[INFO] [stderr] 10 | pub fn is_palindrome(head: Option<Box<ListNode>>) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function is never used: `new`
[INFO] [stderr]   --> linked_list/linked_list_utils.rs:10:12
[INFO] [stderr]    |
[INFO] [stderr] 10 |     pub fn new(val: i32) -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `generate_list_node`
[INFO] [stderr]   --> linked_list/linked_list_utils.rs:16:8
[INFO] [stderr]    |
[INFO] [stderr] 16 | pub fn generate_list_node(vecs: Vec<i32>) -> Option<Box<ListNode>> {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `merge_two_lists`
[INFO] [stderr]  --> linked_list/merge_two_lists.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 9 | pub fn merge_two_lists(
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `reverse_list`
[INFO] [stderr]   --> linked_list/reverse_list.rs:10:8
[INFO] [stderr]    |
[INFO] [stderr] 10 | pub fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stderr]    |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `intersect`
[INFO] [stderr]   --> hash_table/intersect.rs:10:8
[INFO] [stderr]    |
[INFO] [stderr] 10 | pub fn intersect(nums1: Vec<i32>, nums2: Vec<i32>) -> Vec<i32> {
[INFO] [stderr]    |        ^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `length_of_longest_substring`
[INFO] [stderr]   --> hash_table/length_of_longest_substring.rs:11:8
[INFO] [stderr]    |
[INFO] [stderr] 11 | pub fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `two_sum`
[INFO] [stderr]   --> hash_table/two_sum.rs:10:8
[INFO] [stderr]    |
[INFO] [stderr] 10 | pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `max_profit2`
[INFO] [stderr]   --> greedy/max_profit2.rs:10:8
[INFO] [stderr]    |
[INFO] [stderr] 10 | pub fn max_profit2(prices: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `count_bits_1`
[INFO] [stderr]  --> dynamic_programming/count_bits.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 9 | pub fn count_bits_1(n: i32) -> Vec<i32> {
[INFO] [stderr]   |        ^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: `bit_manipulation` (lib) generated 2 warnings
[INFO] [stderr] warning: `dynamic_programming` (lib) generated 14 warnings
[INFO] [stderr] warning: `math` (lib) generated 4 warnings
[INFO] [stderr] warning: `binary_search` (lib) generated 1 warning
[INFO] [stderr] warning: `sort` (lib) generated 4 warnings
[INFO] [stderr] warning: `string` (lib) generated 5 warnings
[INFO] [stderr] warning: `two_pointers` (lib) generated 5 warnings
[INFO] [stderr] warning: `linked_list` (lib) generated 6 warnings
[INFO] [stderr] warning: `hash_table` (lib) generated 3 warnings
[INFO] [stderr] warning: `greedy` (lib) generated 1 warning
[INFO] [stderr] warning: `dynamic_programming` (lib test) generated 3 warnings (2 duplicates)
[INFO] [stderr]     Finished test [unoptimized + debuginfo] target(s) in 1.47s
[INFO] [stderr]      Running unittests lib.rs (/opt/rustwide/target/debug/deps/binary_search-4330aab8d7061a9a)
[INFO] [stdout] 
[INFO] [stdout] running 2 tests
[INFO] [stdout] test longest_common_prefix::tests::it_work_1 ... ok
[INFO] [stdout] test longest_common_prefix::tests::it_work_2 ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 2 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]      Running unittests lib.rs (/opt/rustwide/target/debug/deps/bit_manipulation-465cb6539e1e9b9e)
[INFO] [stdout] 
[INFO] [stdout] running 2 tests
[INFO] [stdout] test single_number::tests::it_work_1 ... ok
[INFO] [stdout] test xor_operation::tests::it_works_1 ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 2 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]      Running unittests lib.rs (/opt/rustwide/target/debug/deps/dynamic_programming-a5d0f16b5a6d9075)
[INFO] [stdout] 
[INFO] [stdout] running 16 tests
[INFO] [stdout] test can_jump::test::it_work_5 ... ok
[INFO] [stdout] test count_bits::test::it_work_1 ... ok
[INFO] [stdout] test can_jump::test::it_work_2 ... ok
[INFO] [stdout] test longest_palindrome::tests::it_works_2 ... ok
[INFO] [stdout] test rob::test::it_work_1 ... ok
[INFO] [stdout] test max_profit::tests::it_work_1 ... ok
[INFO] [stdout] test rob::test::it_work_2 ... ok
[INFO] [stdout] test can_jump::test::it_work_3 ... ok
[INFO] [stdout] test longest_palindrome::tests::it_works_3 ... ok
[INFO] [stdout] test can_jump::test::it_work_4 ... ok
[INFO] [stdout] test climb_stairs::tests::it_work_1 ... ok
[INFO] [stdout] test longest_palindrome::tests::it_works_4 ... ok
[INFO] [stdout] test can_jump::test::it_work_1 ... ok
[INFO] [stdout] test num_array::test::it_work_1 ... ok
[INFO] [stdout] test max_sub_array::tests::it_work_1 ... ok
[INFO] [stdout] test longest_palindrome::tests::it_works_1 ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 16 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.02s
[INFO] [stdout] 
[INFO] [stderr]      Running unittests lib.rs (/opt/rustwide/target/debug/deps/greedy-49d9cc2eb784e1a7)
[INFO] [stdout] 
[INFO] [stdout] running 1 test
[INFO] [stderr]      Running unittests lib.rs (/opt/rustwide/target/debug/deps/hash_table-034ce6b95d4d3268)
[INFO] [stdout] test max_profit2::tests::it_work_1 ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 1 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.01s
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] running 9 tests
[INFO] [stdout] test length_of_longest_substring::tests::it_works_5 ... ok
[INFO] [stdout] test length_of_longest_substring::tests::it_works_3 ... ok
[INFO] [stdout] test length_of_longest_substring::tests::it_works_1 ... ok
[INFO] [stdout] test two_sum::tests::it_works_3 ... ok
[INFO] [stdout] test two_sum::tests::it_works_1 ... ok
[INFO] [stdout] test length_of_longest_substring::tests::it_works_2 ... ok
[INFO] [stdout] test two_sum::tests::it_works_2 ... ok
[INFO] [stdout] test intersect::tests::it_work_1 ... ok
[INFO] [stdout] test length_of_longest_substring::tests::it_works_4 ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 9 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.02s
[INFO] [stdout] 
[INFO] [stderr]      Running unittests lib.rs (/opt/rustwide/target/debug/deps/linked_list-05bcf8d10d13b1c7)
[INFO] [stdout] 
[INFO] [stdout] running 7 tests
[INFO] [stdout] test add_two_numbers::tests::it_works_1 ... ok
[INFO] [stdout] test add_two_numbers::tests::it_works_2 ... ok
[INFO] [stdout] test add_two_numbers::tests::it_works_3 ... ok
[INFO] [stdout] test is_palindrome::tests::it_work_2 ... ok
[INFO] [stdout] test merge_two_lists::tests::it_work_1 ... ok
[INFO] [stdout] test reverse_list::tests::it_works_1 ... ok
[INFO] [stdout] test is_palindrome::tests::it_work_1 ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 7 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]      Running unittests lib.rs (/opt/rustwide/target/debug/deps/math-cb800ce073e1b8d2)
[INFO] [stdout] 
[INFO] [stdout] running 4 tests
[INFO] [stdout] test rotate::tests::it_work_1 ... ok
[INFO] [stderr]      Running unittests main.rs (/opt/rustwide/target/debug/deps/playground-6050f2c413271f67)
[INFO] [stdout] test roman_to_int::tests::it_works_1 ... ok
[INFO] [stdout] test plus_one::tests::it_work_1 ... ok
[INFO] [stdout] test is_palindrome::tests::it_work_1 ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 4 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.01s
[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]      Running unittests lib.rs (/opt/rustwide/target/debug/deps/sort-4e91ae68746631e8)
[INFO] [stdout] 
[INFO] [stdout] running 3 tests
[INFO] [stdout] test contains_duplicate::tests::it_work_1 ... ok
[INFO] [stdout] test heap_sort::tests::it_work_2 ... ok
[INFO] [stdout] test heap_sort::tests::it_work_1 ... 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 lib.rs (/opt/rustwide/target/debug/deps/string-c4d89c7dbce18711)
[INFO] [stdout] 
[INFO] [stdout] running 7 tests
[INFO] [stdout] test is_palindrome::test::it_work_1 ... ok
[INFO] [stdout] test first_uniq_char::test::it_work_1 ... ok
[INFO] [stdout] test is_anagram::test::it_work_1 ... ok
[INFO] [stdout] test is_palindrome::test::it_work_2 ... ok
[INFO] [stdout] test is_palindrome::test::it_work_3 ... ok
[INFO] [stdout] test reverse::test::it_work_1 ... ok
[INFO] [stderr]      Running unittests lib.rs (/opt/rustwide/target/debug/deps/tree-f20d4210415de0cb)
[INFO] [stdout] test reverse_string::tests::it_work_1 ... 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 6 tests
[INFO] [stdout] test is_symmetric::test::it_work_1 ... ok
[INFO] [stdout] test is_valid_bst::test::it_work_1 ... ok
[INFO] [stdout] test is_valid_bst::test::it_work_3 ... ok
[INFO] [stdout] test max_depth::test::it_work_1 ... ok
[INFO] [stdout] test preorder_traversal::test::it_work_1 ... ok
[INFO] [stdout] test is_valid_bst::test::it_work_2 ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 6 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] running 12 tests
[INFO] [stdout] test max_area::tests::it_work_1 ... ok
[INFO] [stdout] test max_area::tests::it_work_2 ... ok
[INFO] [stdout] test merge::test::it_work_1 ... ok
[INFO] [stderr]      Running unittests lib.rs (/opt/rustwide/target/debug/deps/two_pointers-4fbf242766738332)
[INFO] [stdout] test move_zeroes::tests::it_work_1 ... ok
[INFO] [stderr]    Doc-tests binary_search
[INFO] [stdout] test three_sum::tests::it_work_1 ... ok
[INFO] [stdout] test three_sum::tests::it_work_2 ... ok
[INFO] [stdout] test three_sum::tests::it_work_3 ... ok
[INFO] [stdout] test three_sum::tests::it_work_4 ... ok
[INFO] [stdout] test three_sum_closest::tests::it_work_2 ... ok
[INFO] [stdout] test three_sum_closest::tests::it_work_4 ... ok
[INFO] [stdout] test three_sum_closest::tests::it_work_3 ... ok
[INFO] [stdout] test three_sum_closest::tests::it_work_1 ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 12 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests bit_manipulation
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests dynamic_programming
[INFO] [stdout] running 0 tests
[INFO] [stderr]    Doc-tests greedy
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests hash_table
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stderr]    Doc-tests linked_list
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests math
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests sort
[INFO] [stdout] running 0 tests
[INFO] [stderr]    Doc-tests string
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests tree
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stderr]    Doc-tests two_pointers
[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] [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] [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] [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] [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] running `Command { std: "docker" "inspect" "4bb327a7c712006261ee6a0986861c7ad5bbe9a7a153fa16949aa0e4c08a2070", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "4bb327a7c712006261ee6a0986861c7ad5bbe9a7a153fa16949aa0e4c08a2070", kill_on_drop: false }`
[INFO] [stdout] 4bb327a7c712006261ee6a0986861c7ad5bbe9a7a153fa16949aa0e4c08a2070