[INFO] cloning repository https://github.com/wenLiangcan/leetcode.rs
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/wenLiangcan/leetcode.rs" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FwenLiangcan%2Fleetcode.rs", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FwenLiangcan%2Fleetcode.rs'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 69b1e9ece93c1c4cd856601cb56862929f4a32b0
[INFO] testing wenLiangcan/leetcode.rs against 1.60.0 for beta-1.61-1
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FwenLiangcan%2Fleetcode.rs" "/workspace/builds/worker-6/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-6/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/wenLiangcan/leetcode.rs on toolchain 1.60.0
[INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+1.60.0" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/wenLiangcan/leetcode.rs
[INFO] finished tweaking git repo https://github.com/wenLiangcan/leetcode.rs
[INFO] tweaked toml for git repo https://github.com/wenLiangcan/leetcode.rs written to /workspace/builds/worker-6/source/Cargo.toml
[INFO] crate git repo https://github.com/wenLiangcan/leetcode.rs already has a lockfile, it will not be regenerated
[INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+1.60.0" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]  Downloading crates ...
[INFO] [stderr]   Downloaded proc-macro2 v1.0.32
[INFO] [stderr]   Downloaded syn v1.0.81
[INFO] [stderr]   Downloaded serde_json v1.0.70
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:b0c94ce3c1162fcb8e57cac5b65ec2f72eabb1eebea4fcc35e269e823f681646" "/opt/rustwide/cargo-home/bin/cargo" "+1.60.0" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 1deed4e585f006e6b2771ca0a60b35e2c25112652ce2c8a70a2b7991f04a3cc6
[INFO] running `Command { std: "docker" "start" "-a" "1deed4e585f006e6b2771ca0a60b35e2c25112652ce2c8a70a2b7991f04a3cc6", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "1deed4e585f006e6b2771ca0a60b35e2c25112652ce2c8a70a2b7991f04a3cc6", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "1deed4e585f006e6b2771ca0a60b35e2c25112652ce2c8a70a2b7991f04a3cc6", kill_on_drop: false }`
[INFO] [stdout] 1deed4e585f006e6b2771ca0a60b35e2c25112652ce2c8a70a2b7991f04a3cc6
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:b0c94ce3c1162fcb8e57cac5b65ec2f72eabb1eebea4fcc35e269e823f681646" "/opt/rustwide/cargo-home/bin/cargo" "+1.60.0" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] c65134e2a78435f33cc95019f03adf838438a665c4d7293d6a597fc5a51c5b07
[INFO] running `Command { std: "docker" "start" "-a" "c65134e2a78435f33cc95019f03adf838438a665c4d7293d6a597fc5a51c5b07", kill_on_drop: false }`
[INFO] [stderr]    Compiling leetcode v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `ll`
[INFO] [stdout]   --> src/e_21_merge_two_sorted_lists.rs:36:26
[INFO] [stdout]    |
[INFO] [stdout] 36 | use leetcode::{ListNode, ll};
[INFO] [stdout]    |                          ^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `ll`
[INFO] [stdout]   --> src/e_83_remove_duplicates_from_sorted_list.rs:29:26
[INFO] [stdout]    |
[INFO] [stdout] 29 | use leetcode::{ListNode, ll};
[INFO] [stdout]    |                          ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `ll`
[INFO] [stdout]   --> src/e_203_remove_linked_list_elements.rs:37:26
[INFO] [stdout]    |
[INFO] [stdout] 37 | use leetcode::{ListNode, ll};
[INFO] [stdout]    |                          ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `ll`
[INFO] [stdout]   --> src/e_206_reverse_linked_list.rs:39:26
[INFO] [stdout]    |
[INFO] [stdout] 39 | use leetcode::{ListNode, ll};
[INFO] [stdout]    |                          ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `ll`
[INFO] [stdout]   --> src/m_24_swap_nodes_in_pairs.rs:36:26
[INFO] [stdout]    |
[INFO] [stdout] 36 | use leetcode::{ListNode, ll};
[INFO] [stdout]    |                          ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `ll`
[INFO] [stdout]   --> src/m_61_rotate_list.rs:28:26
[INFO] [stdout]    |
[INFO] [stdout] 28 | use leetcode::{ListNode, ll};
[INFO] [stdout]    |                          ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `ll`
[INFO] [stdout]   --> src/m_147_insertion_sort_list.rs:43:26
[INFO] [stdout]    |
[INFO] [stdout] 43 | use leetcode::{ListNode, ll};
[INFO] [stdout]    |                          ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `ll`
[INFO] [stdout]   --> src/m_148_sort_list.rs:40:26
[INFO] [stdout]    |
[INFO] [stdout] 40 | use leetcode::{ListNode, ll};
[INFO] [stdout]    |                          ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]   --> src/e_88_merge_sorted_array.rs:90:66
[INFO] [stdout]    |
[INFO] [stdout] 90 | pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
[INFO] [stdout]    |                                                                  ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `two_sum`
[INFO] [stdout]   --> src/e_1_two_sum.rs:75:8
[INFO] [stdout]    |
[INFO] [stdout] 75 | pub fn two_sum(nums: Vec<i32>, target: 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: `is_valid`
[INFO] [stdout]   --> src/e_20_valid_parentheses.rs:88:8
[INFO] [stdout]    |
[INFO] [stdout] 88 | pub fn is_valid(s: String) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `merge_two_lists`
[INFO] [stdout]   --> src/e_21_merge_two_sorted_lists.rs:61:8
[INFO] [stdout]    |
[INFO] [stdout] 61 | pub fn merge_two_lists(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `get_ending`
[INFO] [stdout]    --> src/e_21_merge_two_sorted_lists.rs:115:4
[INFO] [stdout]     |
[INFO] [stdout] 115 | fn get_ending(head: &mut ListNode) -> &mut ListNode {
[INFO] [stdout]     |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_sub_array`
[INFO] [stdout]   --> src/e_53_maximum_subarray.rs:86:8
[INFO] [stdout]    |
[INFO] [stdout] 86 | pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `delete_duplicates`
[INFO] [stdout]   --> src/e_83_remove_duplicates_from_sorted_list.rs:53:8
[INFO] [stdout]    |
[INFO] [stdout] 53 | pub fn delete_duplicates(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `merge`
[INFO] [stdout]   --> src/e_88_merge_sorted_array.rs:90:8
[INFO] [stdout]    |
[INFO] [stdout] 90 | 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: `merge_cheat`
[INFO] [stdout]    --> src/e_88_merge_sorted_array.rs:111:4
[INFO] [stdout]     |
[INFO] [stdout] 111 | fn merge_cheat(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: `inorder_traversal`
[INFO] [stdout]   --> src/e_94_binary_tree_inorder_traversal.rs:84:8
[INFO] [stdout]    |
[INFO] [stdout] 84 | pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_symmetric`
[INFO] [stdout]   --> src/e_101_symmetric_tree.rs:80:8
[INFO] [stdout]    |
[INFO] [stdout] 80 | pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_symmetric_rec`
[INFO] [stdout]    --> src/e_101_symmetric_tree.rs:139:8
[INFO] [stdout]     |
[INFO] [stdout] 139 | pub fn is_symmetric_rec(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_symmetric_rec_inner`
[INFO] [stdout]    --> src/e_101_symmetric_tree.rs:149:4
[INFO] [stdout]     |
[INFO] [stdout] 149 | fn is_symmetric_rec_inner(left: Option<Rc<RefCell<TreeNode>>>, right: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_depth`
[INFO] [stdout]   --> src/e_104_maximum_depth_of_binary_tree.rs:72:8
[INFO] [stdout]    |
[INFO] [stdout] 72 | pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_depth_rec`
[INFO] [stdout]   --> src/e_104_maximum_depth_of_binary_tree.rs:76:4
[INFO] [stdout]    |
[INFO] [stdout] 76 | fn max_depth_rec(root: Option<Rc<RefCell<TreeNode>>>, acc: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `has_path_sum`
[INFO] [stdout]    --> src/e_112_path_sum.rs:125:8
[INFO] [stdout]     |
[INFO] [stdout] 125 | pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `generate`
[INFO] [stdout]   --> src/e_118_pascals_triangle.rs:40:8
[INFO] [stdout]    |
[INFO] [stdout] 40 | pub fn generate(num_rows: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `get_row`
[INFO] [stdout]   --> src/e_119_pascals_triangle_ii.rs:53:8
[INFO] [stdout]    |
[INFO] [stdout] 53 | pub fn get_row(row_index: i32) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_profit`
[INFO] [stdout]   --> src/e_121_best_time_to_buy_and_sell_stock.rs:72:8
[INFO] [stdout]    |
[INFO] [stdout] 72 | pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `single_number`
[INFO] [stdout]   --> src/e_136_single_number.rs:52:8
[INFO] [stdout]    |
[INFO] [stdout] 52 | pub fn single_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `preorder_traversal`
[INFO] [stdout]   --> src/e_144_binary_tree_preorder_traversal.rs:74:8
[INFO] [stdout]    |
[INFO] [stdout] 74 | pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum is never used: `Pos`
[INFO] [stdout]   --> src/e_145_binary_tree_postorder_traversal.rs:84:6
[INFO] [stdout]    |
[INFO] [stdout] 84 | enum Pos {
[INFO] [stdout]    |      ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `postorder_traversal`
[INFO] [stdout]   --> src/e_145_binary_tree_postorder_traversal.rs:89:8
[INFO] [stdout]    |
[INFO] [stdout] 89 | pub fn postorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `majority_element`
[INFO] [stdout]   --> src/e_169_majority_element.rs:49:8
[INFO] [stdout]    |
[INFO] [stdout] 49 | pub fn majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `remove_elements`
[INFO] [stdout]   --> src/e_203_remove_linked_list_elements.rs:60:8
[INFO] [stdout]    |
[INFO] [stdout] 60 | pub fn remove_elements(head: Option<Box<ListNode>>, val: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `reverse_list`
[INFO] [stdout]   --> src/e_206_reverse_linked_list.rs:62:8
[INFO] [stdout]    |
[INFO] [stdout] 62 | pub fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `contains_duplicate`
[INFO] [stdout]   --> src/e_217_contains_duplicate.rs:47:8
[INFO] [stdout]    |
[INFO] [stdout] 47 | pub fn contains_duplicate(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `invert_tree`
[INFO] [stdout]   --> src/e_226_invert_binary_tree.rs:93:8
[INFO] [stdout]    |
[INFO] [stdout] 93 | pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `MyQueue`
[INFO] [stdout]   --> src/e_232_implement_queue_using_stacks.rs:77:8
[INFO] [stdout]    |
[INFO] [stdout] 77 | struct MyQueue {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> src/e_232_implement_queue_using_stacks.rs:95:8
[INFO] [stdout]    |
[INFO] [stdout] 95 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `push`
[INFO] [stdout]    --> src/e_232_implement_queue_using_stacks.rs:102:8
[INFO] [stdout]     |
[INFO] [stdout] 102 |     fn push(&mut self, x: i32) {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `pop`
[INFO] [stdout]    --> src/e_232_implement_queue_using_stacks.rs:106:8
[INFO] [stdout]     |
[INFO] [stdout] 106 |     fn pop(&mut self) -> i32 {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `peek`
[INFO] [stdout]    --> src/e_232_implement_queue_using_stacks.rs:117:8
[INFO] [stdout]     |
[INFO] [stdout] 117 |     fn peek(&mut self) -> i32 {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `empty`
[INFO] [stdout]    --> src/e_232_implement_queue_using_stacks.rs:128:8
[INFO] [stdout]     |
[INFO] [stdout] 128 |     fn empty(&self) -> bool {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `lowest_common_ancestor`
[INFO] [stdout]   --> src/e_235_lowest_common_ancestor_of_a_binary_search_tree.rs:82:8
[INFO] [stdout]    |
[INFO] [stdout] 82 | pub fn lowest_common_ancestor(root: Option<Rc<RefCell<TreeNode>>>, p: Option<Rc<RefCell<TreeNode>>>, q: Option<Rc<RefCell<TreeNode>>>) ->...
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_anagram`
[INFO] [stdout]   --> src/e_242_valid_anagram.rs:42:8
[INFO] [stdout]    |
[INFO] [stdout] 42 | pub fn is_anagram(s: String, t: String) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `intersect`
[INFO] [stdout]   --> src/e_350_intersection_of_two_arrays.rs:66:8
[INFO] [stdout]    |
[INFO] [stdout] 66 | pub fn intersect(nums1: Vec<i32>, nums2: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `can_construct`
[INFO] [stdout]   --> src/e_383_ransom_note.rs:52:8
[INFO] [stdout]    |
[INFO] [stdout] 52 | pub fn can_construct(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `count_intersect`
[INFO] [stdout]   --> src/e_383_ransom_note.rs:60:4
[INFO] [stdout]    |
[INFO] [stdout] 60 | fn count_intersect(nums1: String, nums2: String) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `first_uniq_char`
[INFO] [stdout]   --> src/e_387_first_unique_character_in_a_string.rs:49:8
[INFO] [stdout]    |
[INFO] [stdout] 49 | pub fn first_uniq_char(s: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `matrix_reshape`
[INFO] [stdout]   --> src/e_566_reshape_the_matrix.rs:58:8
[INFO] [stdout]    |
[INFO] [stdout] 58 | pub fn matrix_reshape(mat: Vec<Vec<i32>>, r: i32, c: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `find_target`
[INFO] [stdout]   --> src/e_653_two_sum_iv_input_is_a_bst.rs:84:8
[INFO] [stdout]    |
[INFO] [stdout] 84 | pub fn find_target(root: Option<Rc<RefCell<TreeNode>>>, k: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `search_bst`
[INFO] [stdout]   --> src/e_700_search_in_a_binary_search_tree.rs:75:8
[INFO] [stdout]    |
[INFO] [stdout] 75 | pub fn search_bst(root: Option<Rc<RefCell<TreeNode>>>, val: i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Entry`
[INFO] [stdout]   --> src/e_706_design_hashmap.rs:87:8
[INFO] [stdout]    |
[INFO] [stdout] 87 | struct Entry {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> src/e_706_design_hashmap.rs:94:8
[INFO] [stdout]    |
[INFO] [stdout] 94 |     fn new(key: i32, value: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `MyHashMap`
[INFO] [stdout]    --> src/e_706_design_hashmap.rs:103:8
[INFO] [stdout]     |
[INFO] [stdout] 103 | struct MyHashMap {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `init_buckets`
[INFO] [stdout]    --> src/e_706_design_hashmap.rs:120:8
[INFO] [stdout]     |
[INFO] [stdout] 120 |     fn init_buckets(size: usize) -> Vec<Option<Box<Entry>>> {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]    --> src/e_706_design_hashmap.rs:128:8
[INFO] [stdout]     |
[INFO] [stdout] 128 |     fn new() -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `hash`
[INFO] [stdout]    --> src/e_706_design_hashmap.rs:139:8
[INFO] [stdout]     |
[INFO] [stdout] 139 |     fn hash(&self, key: i32) -> usize {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `rehash`
[INFO] [stdout]    --> src/e_706_design_hashmap.rs:143:8
[INFO] [stdout]     |
[INFO] [stdout] 143 |     fn rehash(&mut self) {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `put_entry`
[INFO] [stdout]    --> src/e_706_design_hashmap.rs:156:8
[INFO] [stdout]     |
[INFO] [stdout] 156 |     fn put_entry(buckets: &mut Vec<Option<Box<Entry>>>, key: i32, value: i32) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `put`
[INFO] [stdout]    --> src/e_706_design_hashmap.rs:178:8
[INFO] [stdout]     |
[INFO] [stdout] 178 |     fn put(&mut self, key: i32, value: i32) {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `get`
[INFO] [stdout]    --> src/e_706_design_hashmap.rs:185:8
[INFO] [stdout]     |
[INFO] [stdout] 185 |     fn get(&self, key: i32) -> i32 {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `remove`
[INFO] [stdout]    --> src/e_706_design_hashmap.rs:198:8
[INFO] [stdout]     |
[INFO] [stdout] 198 |     fn remove(&mut self, key: i32) {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `id`
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:245:4
[INFO] [stdout]     |
[INFO] [stdout] 245 | fn id<T>(v: T) -> Parser<T>
[INFO] [stdout]     |    ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `map`
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:254:4
[INFO] [stdout]     |
[INFO] [stdout] 254 | fn map<T1, T2>(f: impl Fn(T1) -> T2 + 'static, p: Parser<T1>) -> Parser<T2>
[INFO] [stdout]     |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `sequence`
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:267:4
[INFO] [stdout]     |
[INFO] [stdout] 267 | fn sequence<T>(ps: Vec<Parser<T>>) -> ParserOnce<Vec<T>>
[INFO] [stdout]     |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias is never used: `ErrMsg`
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:288:1
[INFO] [stdout]     |
[INFO] [stdout] 288 | type ErrMsg = String;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias is never used: `ParseResult`
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:289:1
[INFO] [stdout]     |
[INFO] [stdout] 289 | type ParseResult<T> = Result<(T, String), (ErrMsg, String)>;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias is never used: `Parser`
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:290:1
[INFO] [stdout]     |
[INFO] [stdout] 290 | type Parser<T> = Box<dyn Fn(String) -> ParseResult<T>>;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias is never used: `ParserOnce`
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:291:1
[INFO] [stdout]     |
[INFO] [stdout] 291 | type ParserOnce<T> = Box<dyn FnOnce(String) -> ParseResult<T>>;
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `p_char`
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:293:4
[INFO] [stdout]     |
[INFO] [stdout] 293 | fn p_char(c: char) -> Parser<char> {
[INFO] [stdout]     |    ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `and_then`
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:304:4
[INFO] [stdout]     |
[INFO] [stdout] 304 | fn and_then<T1, T2>(p1: ParserOnce<T1>, p2: ParserOnce<T2>) -> ParserOnce<(T1, T2)>
[INFO] [stdout]     |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `or_else`
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:320:4
[INFO] [stdout]     |
[INFO] [stdout] 320 | fn or_else<T>(p1: Parser<T>, p2: Parser<T>) -> Parser<T>
[INFO] [stdout]     |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `any`
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:332:4
[INFO] [stdout]     |
[INFO] [stdout] 332 | fn any<T>(ps: Vec<Parser<T>>) -> Parser<T>
[INFO] [stdout]     |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `any_of_chars`
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:344:4
[INFO] [stdout]     |
[INFO] [stdout] 344 | fn any_of_chars(chars: impl Iterator<Item=char>) -> Parser<char> {
[INFO] [stdout]     |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `maybe`
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:348:4
[INFO] [stdout]     |
[INFO] [stdout] 348 | fn maybe<T>(p: Parser<T>) -> Parser<Option<T>>
[INFO] [stdout]     |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `many`
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:360:4
[INFO] [stdout]     |
[INFO] [stdout] 360 | fn many<T>(p: Parser<T>) -> ParserOnce<Vec<T>>
[INFO] [stdout]     |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `once`
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:376:4
[INFO] [stdout]     |
[INFO] [stdout] 376 | fn once<T>(p: Parser<T>) -> ParserOnce<T>
[INFO] [stdout]     |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `my_atoi`
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:384:8
[INFO] [stdout]     |
[INFO] [stdout] 384 | pub fn my_atoi(s: String) -> i32 {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `three_sum`
[INFO] [stdout]   --> src/m_15_three_sum.rs:64:8
[INFO] [stdout]    |
[INFO] [stdout] 64 | pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `swap_pairs`
[INFO] [stdout]   --> src/m_24_swap_nodes_in_pairs.rs:61:8
[INFO] [stdout]    |
[INFO] [stdout] 61 | pub fn swap_pairs(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_valid_sudoku`
[INFO] [stdout]    --> src/m_36_valid_sudoku.rs:104:8
[INFO] [stdout]     |
[INFO] [stdout] 104 | pub fn is_valid_sudoku(board: Vec<Vec<char>>) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `merge`
[INFO] [stdout]   --> src/m_56_merge_intervals.rs:49:8
[INFO] [stdout]    |
[INFO] [stdout] 49 | pub fn merge(intervals: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `len`
[INFO] [stdout]   --> src/m_61_rotate_list.rs:88:4
[INFO] [stdout]    |
[INFO] [stdout] 88 | fn len(head: &ListNode) -> usize {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `split_at`
[INFO] [stdout]    --> src/m_61_rotate_list.rs:101:4
[INFO] [stdout]     |
[INFO] [stdout] 101 | fn split_at(head: &mut ListNode, index: usize) -> ListNode {
[INFO] [stdout]     |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `append`
[INFO] [stdout]    --> src/m_61_rotate_list.rs:109:4
[INFO] [stdout]     |
[INFO] [stdout] 109 | fn append(head: &mut ListNode, node: ListNode) {
[INFO] [stdout]     |    ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `rotate_right`
[INFO] [stdout]    --> src/m_61_rotate_list.rs:122:8
[INFO] [stdout]     |
[INFO] [stdout] 122 | pub fn rotate_right(head: Option<Box<ListNode>>, k: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `plus_one`
[INFO] [stdout]    --> src/m_66_plus_one.rs:102:8
[INFO] [stdout]     |
[INFO] [stdout] 102 | pub fn plus_one(digits: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `plus_one_version_1`
[INFO] [stdout]    --> src/m_66_plus_one.rs:106:4
[INFO] [stdout]     |
[INFO] [stdout] 106 | fn plus_one_version_1(digits: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `plus_one_optimized`
[INFO] [stdout]    --> src/m_66_plus_one.rs:126:4
[INFO] [stdout]     |
[INFO] [stdout] 126 | fn plus_one_optimized(digits: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `search_matrix`
[INFO] [stdout]   --> src/m_74_search_a_2d_matrix.rs:66:8
[INFO] [stdout]    |
[INFO] [stdout] 66 | pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `sort_colors`
[INFO] [stdout]    --> src/m_75_sort_colors.rs:101:8
[INFO] [stdout]     |
[INFO] [stdout] 101 | pub fn sort_colors(nums: &mut Vec<i32>) {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `quick_sort`
[INFO] [stdout]    --> src/m_75_sort_colors.rs:105:4
[INFO] [stdout]     |
[INFO] [stdout] 105 | fn quick_sort(nums: &mut Vec<i32>, lo: usize, hi: usize) {
[INFO] [stdout]     |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_valid_bst`
[INFO] [stdout]   --> src/m_98_validate_binary_search_tree.rs:75:8
[INFO] [stdout]    |
[INFO] [stdout] 75 | pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_valid_bst_inner`
[INFO] [stdout]   --> src/m_98_validate_binary_search_tree.rs:79:4
[INFO] [stdout]    |
[INFO] [stdout] 79 | fn is_valid_bst_inner(root: Option<Rc<RefCell<TreeNode>>>, lower: Option<i32>, upper: Option<i32>) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum is never used: `Pos`
[INFO] [stdout]   --> src/m_102_binary_tree_level_order_traversal.rs:62:6
[INFO] [stdout]    |
[INFO] [stdout] 62 | enum Pos {
[INFO] [stdout]    |      ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `level_order`
[INFO] [stdout]   --> src/m_102_binary_tree_level_order_traversal.rs:67:8
[INFO] [stdout]    |
[INFO] [stdout] 67 | pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `insertion_sort_list`
[INFO] [stdout]   --> src/m_147_insertion_sort_list.rs:69:8
[INFO] [stdout]    |
[INFO] [stdout] 69 | pub fn insertion_sort_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `insert_sorted`
[INFO] [stdout]   --> src/m_147_insertion_sort_list.rs:90:4
[INFO] [stdout]    |
[INFO] [stdout] 90 | fn insert_sorted(head: Option<Box<ListNode>>, mut node: ListNode) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `sort_list`
[INFO] [stdout]   --> src/m_148_sort_list.rs:79:8
[INFO] [stdout]    |
[INFO] [stdout] 79 | pub fn sort_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `merge_sort`
[INFO] [stdout]   --> src/m_148_sort_list.rs:83:4
[INFO] [stdout]    |
[INFO] [stdout] 83 | fn merge_sort(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `fold_sorted`
[INFO] [stdout]    --> src/m_148_sort_list.rs:109:4
[INFO] [stdout]     |
[INFO] [stdout] 109 | fn fold_sorted(mut v: Vec<Option<Box<ListNode>>>) -> Vec<Option<Box<ListNode>>> {
[INFO] [stdout]     |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `merge_sorted`
[INFO] [stdout]    --> src/m_148_sort_list.rs:125:4
[INFO] [stdout]     |
[INFO] [stdout] 125 | fn merge_sorted(left: Option<Box<ListNode>>,
[INFO] [stdout]     |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `get_ending`
[INFO] [stdout]    --> src/m_148_sort_list.rs:180:4
[INFO] [stdout]     |
[INFO] [stdout] 180 | fn get_ending(head: &mut ListNode) -> &mut ListNode {
[INFO] [stdout]     |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `insert_into_bst`
[INFO] [stdout]    --> src/m_701_insert_into_a_binary_search_tree.rs:115:8
[INFO] [stdout]     |
[INFO] [stdout] 115 | pub fn insert_into_bst(root: Option<Rc<RefCell<TreeNode>>>, val: i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 104 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished dev [unoptimized + debuginfo] target(s) in 0.93s
[INFO] running `Command { std: "docker" "inspect" "c65134e2a78435f33cc95019f03adf838438a665c4d7293d6a597fc5a51c5b07", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "c65134e2a78435f33cc95019f03adf838438a665c4d7293d6a597fc5a51c5b07", kill_on_drop: false }`
[INFO] [stdout] c65134e2a78435f33cc95019f03adf838438a665c4d7293d6a597fc5a51c5b07
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:b0c94ce3c1162fcb8e57cac5b65ec2f72eabb1eebea4fcc35e269e823f681646" "/opt/rustwide/cargo-home/bin/cargo" "+1.60.0" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 195453d9c8e1dc31b3777ce52b9bc9671eb2f3ada5539a3a6e7835efa25d6a00
[INFO] running `Command { std: "docker" "start" "-a" "195453d9c8e1dc31b3777ce52b9bc9671eb2f3ada5539a3a6e7835efa25d6a00", kill_on_drop: false }`
[INFO] [stderr]    Compiling syn v1.0.81
[INFO] [stderr]    Compiling serde_json v1.0.70
[INFO] [stderr]    Compiling serde_derive v1.0.130
[INFO] [stderr]    Compiling serde v1.0.130
[INFO] [stderr]    Compiling leetcode v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]   --> src/e_88_merge_sorted_array.rs:90:66
[INFO] [stdout]    |
[INFO] [stdout] 90 | pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
[INFO] [stdout]    |                                                                  ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `merge_cheat`
[INFO] [stdout]    --> src/e_88_merge_sorted_array.rs:111:4
[INFO] [stdout]     |
[INFO] [stdout] 111 | fn merge_cheat(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: 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: `id`
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:245:4
[INFO] [stdout]     |
[INFO] [stdout] 245 | fn id<T>(v: T) -> Parser<T>
[INFO] [stdout]     |    ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `plus_one_version_1`
[INFO] [stdout]    --> src/m_66_plus_one.rs:106:4
[INFO] [stdout]     |
[INFO] [stdout] 106 | fn plus_one_version_1(digits: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 4 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished test [unoptimized + debuginfo] target(s) in 14.86s
[INFO] running `Command { std: "docker" "inspect" "195453d9c8e1dc31b3777ce52b9bc9671eb2f3ada5539a3a6e7835efa25d6a00", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "195453d9c8e1dc31b3777ce52b9bc9671eb2f3ada5539a3a6e7835efa25d6a00", kill_on_drop: false }`
[INFO] [stdout] 195453d9c8e1dc31b3777ce52b9bc9671eb2f3ada5539a3a6e7835efa25d6a00
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-6/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-6/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:b0c94ce3c1162fcb8e57cac5b65ec2f72eabb1eebea4fcc35e269e823f681646" "/opt/rustwide/cargo-home/bin/cargo" "+1.60.0" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] 085fb16074e1a33c02c972becd0867978224ae9a2f5e5803b69f72c66559e3fd
[INFO] running `Command { std: "docker" "start" "-a" "085fb16074e1a33c02c972becd0867978224ae9a2f5e5803b69f72c66559e3fd", kill_on_drop: false }`
[INFO] [stderr] warning: unused variable: `n`
[INFO] [stderr]   --> src/e_88_merge_sorted_array.rs:90:66
[INFO] [stderr]    |
[INFO] [stderr] 90 | pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
[INFO] [stderr]    |                                                                  ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `merge_cheat`
[INFO] [stderr]    --> src/e_88_merge_sorted_array.rs:111:4
[INFO] [stderr]     |
[INFO] [stderr] 111 | fn merge_cheat(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
[INFO] [stderr]     |    ^^^^^^^^^^^
[INFO] [stderr]     |
[INFO] [stderr]     = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `id`
[INFO] [stderr]    --> src/m_8_string_to_integer.rs:245:4
[INFO] [stderr]     |
[INFO] [stderr] 245 | fn id<T>(v: T) -> Parser<T>
[INFO] [stderr]     |    ^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `plus_one_version_1`
[INFO] [stderr]    --> src/m_66_plus_one.rs:106:4
[INFO] [stderr]     |
[INFO] [stderr] 106 | fn plus_one_version_1(digits: Vec<i32>) -> Vec<i32> {
[INFO] [stderr]     |    ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `leetcode` (bin "leetcode" test) generated 4 warnings
[INFO] [stderr]     Finished test [unoptimized + debuginfo] target(s) in 0.02s
[INFO] [stderr]      Running unittests (/opt/rustwide/target/debug/deps/leetcode-a57d0a6ab822c252)
[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 (/opt/rustwide/target/debug/deps/leetcode-99c2d0a07f172fec)
[INFO] [stdout] 
[INFO] [stdout] running 145 tests
[INFO] [stdout] test e_101_symmetric_tree::tests::test ... ok
[INFO] [stdout] test e_101_symmetric_tree::tests::test_2 ... ok
[INFO] [stdout] test e_104_maximum_depth_of_binary_tree::tests::test ... ok
[INFO] [stdout] test e_112_path_sum::tests::test ... ok
[INFO] [stdout] test e_112_path_sum::tests::test_2 ... ok
[INFO] [stdout] test e_112_path_sum::tests::test_3 ... ok
[INFO] [stdout] test e_112_path_sum::tests::test_4 ... ok
[INFO] [stdout] test e_118_pascals_triangle::tests::test ... ok
[INFO] [stdout] test e_118_pascals_triangle::tests::test_2 ... ok
[INFO] [stdout] test e_119_pascals_triangle_ii::tests::test_1 ... ok
[INFO] [stdout] test e_119_pascals_triangle_ii::tests::test_2 ... ok
[INFO] [stdout] test e_119_pascals_triangle_ii::tests::test_3 ... ok
[INFO] [stdout] test e_121_best_time_to_buy_and_sell_stock::tests::test ... ok
[INFO] [stdout] test e_121_best_time_to_buy_and_sell_stock::tests::test_2 ... ok
[INFO] [stdout] test e_121_best_time_to_buy_and_sell_stock::tests::test_3 ... ok
[INFO] [stdout] test e_121_best_time_to_buy_and_sell_stock::tests::test_4 ... ok
[INFO] [stdout] test e_121_best_time_to_buy_and_sell_stock::tests::test_5 ... ok
[INFO] [stdout] test e_136_single_number::tests::test ... ok
[INFO] [stdout] test e_136_single_number::tests::test_2 ... ok
[INFO] [stdout] test e_136_single_number::tests::test_3 ... ok
[INFO] [stdout] test e_144_binary_tree_preorder_traversal::tests::test ... ok
[INFO] [stdout] test e_145_binary_tree_postorder_traversal::tests::test ... ok
[INFO] [stdout] test e_145_binary_tree_postorder_traversal::tests::test_2 ... ok
[INFO] [stdout] test e_169_majority_element::tests::test ... ok
[INFO] [stdout] test e_169_majority_element::tests::test_3 ... ok
[INFO] [stdout] test e_169_majority_element::tests::test_2 ... ok
[INFO] [stdout] test e_1_two_sum::tests::test ... ok
[INFO] [stdout] test e_1_two_sum::tests::test_2 ... ok
[INFO] [stdout] test e_1_two_sum::tests::test_3 ... ok
[INFO] [stdout] test e_203_remove_linked_list_elements::tests::test ... ok
[INFO] [stdout] test e_203_remove_linked_list_elements::tests::test_2 ... ok
[INFO] [stdout] test e_203_remove_linked_list_elements::tests::test_3 ... ok
[INFO] [stdout] test e_206_reverse_linked_list::tests::test ... ok
[INFO] [stdout] test e_206_reverse_linked_list::tests::test_2 ... ok
[INFO] [stdout] test e_206_reverse_linked_list::tests::test_3 ... ok
[INFO] [stdout] test e_20_valid_parentheses::tests::test ... ok
[INFO] [stdout] test e_20_valid_parentheses::tests::test_2 ... ok
[INFO] [stdout] test e_20_valid_parentheses::tests::test_3 ... ok
[INFO] [stdout] test e_20_valid_parentheses::tests::test_5 ... ok
[INFO] [stdout] test e_20_valid_parentheses::tests::test_4 ... ok
[INFO] [stdout] test e_217_contains_duplicate::tests::test ... ok
[INFO] [stdout] test e_217_contains_duplicate::tests::test_2 ... ok
[INFO] [stdout] test e_217_contains_duplicate::tests::test_3 ... ok
[INFO] [stdout] test e_21_merge_two_sorted_lists::tests::test_2 ... ok
[INFO] [stdout] test e_21_merge_two_sorted_lists::tests::test ... ok
[INFO] [stdout] test e_21_merge_two_sorted_lists::tests::test_3 ... ok
[INFO] [stdout] test e_226_invert_binary_tree::tests::test ... ok
[INFO] [stdout] test e_226_invert_binary_tree::tests::test_2 ... ok
[INFO] [stdout] test e_232_implement_queue_using_stacks::tests::test ... ok
[INFO] [stdout] test e_235_lowest_common_ancestor_of_a_binary_search_tree::tests::test ... ok
[INFO] [stdout] test e_242_valid_anagram::tests::test_false ... ok
[INFO] [stdout] test e_242_valid_anagram::tests::test ... ok
[INFO] [stdout] test e_350_intersection_of_two_arrays::tests::test ... ok
[INFO] [stdout] test e_350_intersection_of_two_arrays::tests::test_2 ... ok
[INFO] [stdout] test e_383_ransom_note::tests::test ... ok
[INFO] [stdout] test e_383_ransom_note::tests::test_2 ... ok
[INFO] [stdout] test e_383_ransom_note::tests::test_3 ... ok
[INFO] [stdout] test e_387_first_unique_character_in_a_string::tests::test ... ok
[INFO] [stdout] test e_387_first_unique_character_in_a_string::tests::test_3 ... ok
[INFO] [stdout] test e_387_first_unique_character_in_a_string::tests::test_2 ... ok
[INFO] [stdout] test e_53_maximum_subarray::tests::test ... ok
[INFO] [stdout] test e_53_maximum_subarray::tests::test_3 ... ok
[INFO] [stdout] test e_53_maximum_subarray::tests::test_2 ... ok
[INFO] [stdout] test e_566_reshape_the_matrix::tests::test ... ok
[INFO] [stdout] test e_566_reshape_the_matrix::tests::test_not_fit ... ok
[INFO] [stdout] test e_653_two_sum_iv_input_is_a_bst::tests::test ... ok
[INFO] [stdout] test e_700_search_in_a_binary_search_tree::tests::test ... ok
[INFO] [stdout] test e_83_remove_duplicates_from_sorted_list::tests::test_2 ... ok
[INFO] [stdout] test e_88_merge_sorted_array::tests::test ... ok
[INFO] [stdout] test e_706_design_hashmap::tests::test ... ok
[INFO] [stdout] test e_94_binary_tree_inorder_traversal::tests::test_2 ... ok
[INFO] [stdout] test m_147_insertion_sort_list::tests::test ... ok
[INFO] [stdout] test m_147_insertion_sort_list::tests::test_2 ... ok
[INFO] [stdout] test m_148_sort_list::tests::test ... ok
[INFO] [stdout] test m_148_sort_list::tests::test_2 ... ok
[INFO] [stdout] test e_83_remove_duplicates_from_sorted_list::tests::test ... ok
[INFO] [stdout] test e_83_remove_duplicates_from_sorted_list::tests::test_3 ... ok
[INFO] [stdout] test m_147_insertion_sort_list::tests::test_empty_list ... ok
[INFO] [stdout] test m_148_sort_list::tests::test_merge_sorted_2 ... ok
[INFO] [stdout] test e_88_merge_sorted_array::tests::test_2 ... ok
[INFO] [stdout] test m_15_three_sum::tests::test_one_element ... ok
[INFO] [stdout] test m_24_swap_nodes_in_pairs::tests::test_empty_list ... ok
[INFO] [stdout] test m_148_sort_list::tests::test_empty_list ... ok
[INFO] [stdout] test m_24_swap_nodes_in_pairs::tests::test_swap_pairs ... ok
[INFO] [stdout] test m_56_merge_intervals::tests::test ... ok
[INFO] [stdout] test e_88_merge_sorted_array::tests::test_3 ... ok
[INFO] [stdout] test m_36_valid_sudoku::tests::test_invalid ... ok
[INFO] [stdout] test m_56_merge_intervals::tests::test_2 ... ok
[INFO] [stdout] test m_102_binary_tree_level_order_traversal::tests::test ... ok
[INFO] [stdout] test m_148_sort_list::tests::test_merge_sorted ... ok
[INFO] [stdout] test m_36_valid_sudoku::tests::test ... ok
[INFO] [stdout] test m_66_plus_one::tests::test_case_123 ... ok
[INFO] [stdout] test m_15_three_sum::tests::test_empty ... ok
[INFO] [stdout] test m_66_plus_one::tests::test_case_789 ... ok
[INFO] [stdout] test e_94_binary_tree_inorder_traversal::tests::test ... ok
[INFO] [stdout] test m_66_plus_one::tests::test_case_9876543210 ... ok
[INFO] [stdout] test m_66_plus_one::tests::test_case_999 ... ok
[INFO] [stdout] test m_701_insert_into_a_binary_search_tree::tests::test ... ok
[INFO] [stdout] test m_701_insert_into_a_binary_search_tree::tests::test_2 ... ok
[INFO] [stdout] test m_74_search_a_2d_matrix::tests::test ... ok
[INFO] [stdout] test m_701_insert_into_a_binary_search_tree::tests::test_3 ... ok
[INFO] [stdout] test m_74_search_a_2d_matrix::tests::test_2 ... ok
[INFO] [stdout] test m_74_search_a_2d_matrix::tests::test_3 ... ok
[INFO] [stdout] test m_74_search_a_2d_matrix::tests::test_4 ... ok
[INFO] [stdout] test m_24_swap_nodes_in_pairs::tests::test_one_item ... ok
[INFO] [stdout] test m_61_rotate_list::tests::test_append ... ok
[INFO] [stdout] test m_61_rotate_list::tests::test_equality ... ok
[INFO] [stdout] test m_66_plus_one::tests::test_case_9 ... ok
[INFO] [stdout] test m_66_plus_one::tests::test_case_4321 ... ok
[INFO] [stdout] test m_61_rotate_list::tests::test_len_1 ... ok
[INFO] [stdout] test m_61_rotate_list::tests::test_len_3 ... ok
[INFO] [stdout] test e_700_search_in_a_binary_search_tree::tests::test_2 ... ok
[INFO] [stdout] test m_15_three_sum::tests::test ... ok
[INFO] [stdout] test m_61_rotate_list::tests::test_rotate_right ... ok
[INFO] [stdout] test m_61_rotate_list::tests::test_rotate_right_3 ... ok
[INFO] [stdout] test m_61_rotate_list::tests::test_split_at ... ok
[INFO] [stdout] test m_66_plus_one::tests::test_case_0 ... ok
[INFO] [stdout] test m_75_sort_colors::tests::test ... ok
[INFO] [stdout] test m_75_sort_colors::tests::test_2 ... ok
[INFO] [stdout] test m_75_sort_colors::tests::test_5 ... ok
[INFO] [stdout] test m_75_sort_colors::tests::test_4 ... ok
[INFO] [stdout] test m_75_sort_colors::tests::test_3 ... ok
[INFO] [stdout] test m_75_sort_colors::tests::test_6 ... ok
[INFO] [stdout] test m_75_sort_colors::tests::test_7 ... ok
[INFO] [stdout] test m_75_sort_colors::tests::test_8 ... ok
[INFO] [stdout] test m_8_string_to_integer::tests::test_any ... ok
[INFO] [stdout] test m_8_string_to_integer::tests::test_and_then ... ok
[INFO] [stdout] test m_8_string_to_integer::tests::test_any_of_chars ... ok
[INFO] [stdout] test m_8_string_to_integer::tests::test_atoi ... ok
[INFO] [stdout] test m_8_string_to_integer::tests::test_atoi_leading_spaces_negative_number ... ok
[INFO] [stdout] test m_8_string_to_integer::tests::test_many ... ok
[INFO] [stdout] test m_8_string_to_integer::tests::test_atoi_out_of_i32_upper_bound ... ok
[INFO] [stdout] test m_8_string_to_integer::tests::test_parse_char_c ... ok
[INFO] [stdout] test m_8_string_to_integer::tests::test_map ... ok
[INFO] [stdout] test m_98_validate_binary_search_tree::tests::test ... ok
[INFO] [stdout] test m_8_string_to_integer::tests::test_atoi_non_numeric_trialing ... ok
[INFO] [stdout] test m_8_string_to_integer::tests::test_sequence ... ok
[INFO] [stdout] test m_8_string_to_integer::tests::test_atoi_non_numeric_leading ... ok
[INFO] [stdout] test m_8_string_to_integer::tests::test_atoi_out_of_i32_lower_bound ... ok
[INFO] [stdout] test m_8_string_to_integer::tests::test_many_empty ... ok
[INFO] [stdout] test m_98_validate_binary_search_tree::tests::test_2 ... ok
[INFO] [stdout] test m_8_string_to_integer::tests::test_or_else ... ok
[INFO] [stdout] test e_706_design_hashmap::tests::test_2 ... ok
[INFO] [stdout] test e_53_maximum_subarray::tests::test_4 ... ok
[INFO] [stdout] test m_15_three_sum::tests::test_long_list ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 145 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 1.43s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests leetcode
[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" "085fb16074e1a33c02c972becd0867978224ae9a2f5e5803b69f72c66559e3fd", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "085fb16074e1a33c02c972becd0867978224ae9a2f5e5803b69f72c66559e3fd", kill_on_drop: false }`
[INFO] [stdout] 085fb16074e1a33c02c972becd0867978224ae9a2f5e5803b69f72c66559e3fd