[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] 5f36412cf370a3cf0562125181c3a557739e507c
[INFO] checking wenLiangcan/leetcode.rs against try#1f308f12738d8cc40bb23bf0c8114b37c164bb49 for pr-137268
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FwenLiangcan%2Fleetcode.rs" "/workspace/builds/worker-7-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-7-tc2/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/wenLiangcan/leetcode.rs on toolchain 1f308f12738d8cc40bb23bf0c8114b37c164bb49
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1f308f12738d8cc40bb23bf0c8114b37c164bb49" "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-7-tc2/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: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1f308f12738d8cc40bb23bf0c8114b37c164bb49" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/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:b0b074c097205a61b89e8ad263052f976b2b332c4dc5f02aef1fe52501660d6e" "/opt/rustwide/cargo-home/bin/cargo" "+1f308f12738d8cc40bb23bf0c8114b37c164bb49" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 0770421fbabce89d79b5d0d022d5578c44cd457aa475a68110e472f157359ce3
[INFO] running `Command { std: "docker" "start" "-a" "0770421fbabce89d79b5d0d022d5578c44cd457aa475a68110e472f157359ce3", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "0770421fbabce89d79b5d0d022d5578c44cd457aa475a68110e472f157359ce3", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "0770421fbabce89d79b5d0d022d5578c44cd457aa475a68110e472f157359ce3", kill_on_drop: false }`
[INFO] [stdout] 0770421fbabce89d79b5d0d022d5578c44cd457aa475a68110e472f157359ce3
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:b0b074c097205a61b89e8ad263052f976b2b332c4dc5f02aef1fe52501660d6e" "/opt/rustwide/cargo-home/bin/cargo" "+1f308f12738d8cc40bb23bf0c8114b37c164bb49" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] af48902f42d6b7c6c1c1cd325d916961fcafbbe16a6452a30b2808d00c4ded33
[INFO] running `Command { std: "docker" "start" "-a" "af48902f42d6b7c6c1c1cd325d916961fcafbbe16a6452a30b2808d00c4ded33", kill_on_drop: false }`
[INFO] [stderr]    Compiling proc-macro2 v1.0.32
[INFO] [stderr]    Compiling unicode-xid v0.2.2
[INFO] [stderr]    Compiling syn v1.0.81
[INFO] [stderr]    Compiling serde_derive v1.0.130
[INFO] [stderr]    Compiling serde v1.0.130
[INFO] [stderr]    Compiling ryu v1.0.5
[INFO] [stderr]    Compiling serde_json v1.0.70
[INFO] [stderr]     Checking itoa v0.4.8
[INFO] [stderr]     Checking 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: variable does not need to be mutable
[INFO] [stdout]   --> src/e_83_remove_duplicates_from_sorted_list.rs:61:17
[INFO] [stdout]    |
[INFO] [stdout] 61 |             let mut next = current.next.as_mut().unwrap();
[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: 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: variable does not need to be mutable
[INFO] [stdout]    --> src/m_48_rotate_image.rs:102:22
[INFO] [stdout]     |
[INFO] [stdout] 102 |                 let (mut r_n, mut c_n) = rotate_n(rank, level, r, c, n);
[INFO] [stdout]     |                      ----^^^
[INFO] [stdout]     |                      |
[INFO] [stdout]     |                      help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/m_48_rotate_image.rs:102:31
[INFO] [stdout]     |
[INFO] [stdout] 102 |                 let (mut r_n, mut c_n) = rotate_n(rank, level, r, c, n);
[INFO] [stdout]     |                               ----^^^
[INFO] [stdout]     |                               |
[INFO] [stdout]     |                               help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/m_240_search_a_2d_matrix_ii.rs:78:9
[INFO] [stdout]    |
[INFO] [stdout] 78 |     let mut start = 0;
[INFO] [stdout]    |         ----^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `two_sum` is never used
[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_valid` is never used
[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 `merge_two_lists` is never used
[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 `get_ending` is never used
[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 `max_sub_array` is never used
[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 `delete_duplicates` is never used
[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 `merge` is never used
[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 `merge_cheat` is never used
[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 `inorder_traversal` is never used
[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_symmetric` is never used
[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_symmetric_rec` is never used
[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_symmetric_rec_inner` is never used
[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 `max_depth` is never used
[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 `max_depth_rec` is never used
[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 `has_path_sum` is never used
[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 `generate` is never used
[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 `get_row` is never used
[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 `max_profit` is never used
[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 `single_number` is never used
[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 `preorder_traversal` is never used
[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 `Pos` is never used
[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 `postorder_traversal` is never used
[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 `majority_element` is never used
[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 `remove_elements` is never used
[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 `reverse_list` is never used
[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 `contains_duplicate` is never used
[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 `invert_tree` is never used
[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 `MyQueue` is never constructed
[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 items `new`, `push`, `pop`, `peek`, and `empty` are never used
[INFO] [stdout]    --> src/e_232_implement_queue_using_stacks.rs:95:8
[INFO] [stdout]     |
[INFO] [stdout] 93  | impl MyQueue {
[INFO] [stdout]     | ------------ associated items in this implementation
[INFO] [stdout] 94  |
[INFO] [stdout] 95  |     fn new() -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 102 |     fn push(&mut self, x: i32) {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 106 |     fn pop(&mut self) -> i32 {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 117 |     fn peek(&mut self) -> i32 {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 128 |     fn empty(&self) -> bool {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lowest_common_ancestor` is never used
[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_anagram` is never used
[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 `intersect` is never used
[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 `can_construct` is never used
[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 `count_intersect` is never used
[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 `first_uniq_char` is never used
[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 `matrix_reshape` is never used
[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 `find_target` is never used
[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 `search_bst` is never used
[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 `Entry` is never constructed
[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 `new` is never used
[INFO] [stdout]   --> src/e_706_design_hashmap.rs:94:8
[INFO] [stdout]    |
[INFO] [stdout] 93 | impl Entry {
[INFO] [stdout]    | ---------- associated function in this implementation
[INFO] [stdout] 94 |     fn new(key: i32, value: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyHashMap` is never constructed
[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: multiple associated items are never used
[INFO] [stdout]    --> src/e_706_design_hashmap.rs:120:8
[INFO] [stdout]     |
[INFO] [stdout] 118 | impl MyHashMap {
[INFO] [stdout]     | -------------- associated items in this implementation
[INFO] [stdout] 119 |
[INFO] [stdout] 120 |     fn init_buckets(size: usize) -> Vec<Option<Box<Entry>>> {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 128 |     fn new() -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 139 |     fn hash(&self, key: i32) -> usize {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 143 |     fn rehash(&mut self) {
[INFO] [stdout]     |        ^^^^^^
[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] 178 |     fn put(&mut self, key: i32, value: i32) {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 185 |     fn get(&self, key: i32) -> i32 {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 198 |     fn remove(&mut self, key: i32) {
[INFO] [stdout]     |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `id` is never used
[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 `map` is never used
[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 `sequence` is never used
[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 `ErrMsg` is never used
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:288:6
[INFO] [stdout]     |
[INFO] [stdout] 288 | type ErrMsg = String;
[INFO] [stdout]     |      ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `ParseResult` is never used
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:289:6
[INFO] [stdout]     |
[INFO] [stdout] 289 | type ParseResult<T> = Result<(T, String), (ErrMsg, String)>;
[INFO] [stdout]     |      ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Parser` is never used
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:290:6
[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 `ParserOnce` is never used
[INFO] [stdout]    --> src/m_8_string_to_integer.rs:291:6
[INFO] [stdout]     |
[INFO] [stdout] 291 | type ParserOnce<T> = Box<dyn FnOnce(String) -> ParseResult<T>>;
[INFO] [stdout]     |      ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `p_char` is never used
[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 `and_then` is never used
[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 `or_else` is never used
[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 `any` is never used
[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 `any_of_chars` is never used
[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 `maybe` is never used
[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 `many` is never used
[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 `once` is never used
[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 `my_atoi` is never used
[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 `three_sum` is never used
[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 `swap_pairs` is never used
[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_valid_sudoku` is never used
[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 `rotate` is never used
[INFO] [stdout]   --> src/m_48_rotate_image.rs:93:8
[INFO] [stdout]    |
[INFO] [stdout] 93 | pub fn rotate(matrix: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rotate_n` is never used
[INFO] [stdout]    --> src/m_48_rotate_image.rs:112:4
[INFO] [stdout]     |
[INFO] [stdout] 112 | fn rotate_n(rank: usize, level: usize, r: usize, c: usize, n: usize) -> (usize, usize) {
[INFO] [stdout]     |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[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 `generate_matrix` is never used
[INFO] [stdout]   --> src/m_59_spiral_matrix_ii.rs:46:8
[INFO] [stdout]    |
[INFO] [stdout] 46 | pub fn generate_matrix(n: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `rotate_n` is never used
[INFO] [stdout]   --> src/m_59_spiral_matrix_ii.rs:77:4
[INFO] [stdout]    |
[INFO] [stdout] 77 | fn rotate_n(lower_bound: usize, upper_bound: usize, r: usize, c: usize, n: usize) -> (usize, usize) {
[INFO] [stdout]    |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `len` is never used
[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 `split_at` is never used
[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 `append` is never used
[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 `rotate_right` is never used
[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 `plus_one` is never used
[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 `plus_one_version_1` is never used
[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 `plus_one_optimized` is never used
[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 `search_matrix` is never used
[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 `sort_colors` is never used
[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 `quick_sort` is never used
[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_valid_bst` is never used
[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_valid_bst_inner` is never used
[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 `Pos` is never used
[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 `level_order` is never used
[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 `insertion_sort_list` is never used
[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 `insert_sorted` is never used
[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 `sort_list` is never used
[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 `merge_sort` is never used
[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 `fold_sorted` is never used
[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 `merge_sorted` is never used
[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 `get_ending` is never used
[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 `search_matrix` is never used
[INFO] [stdout]   --> src/m_240_search_a_2d_matrix_ii.rs:77:8
[INFO] [stdout]    |
[INFO] [stdout] 77 | pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_vec` is never used
[INFO] [stdout]   --> src/m_240_search_a_2d_matrix_ii.rs:99:4
[INFO] [stdout]    |
[INFO] [stdout] 99 | fn search_vec(v: &Vec<i32>, mut start: usize, mut end: usize, target: i32) -> (usize, Ordering) {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `insert_into_bst` is never used
[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] [stderr]    Compiling quote v1.0.10
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/e_83_remove_duplicates_from_sorted_list.rs:61:17
[INFO] [stdout]    |
[INFO] [stdout] 61 |             let mut next = current.next.as_mut().unwrap();
[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: 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: variable does not need to be mutable
[INFO] [stdout]    --> src/m_48_rotate_image.rs:102:22
[INFO] [stdout]     |
[INFO] [stdout] 102 |                 let (mut r_n, mut c_n) = rotate_n(rank, level, r, c, n);
[INFO] [stdout]     |                      ----^^^
[INFO] [stdout]     |                      |
[INFO] [stdout]     |                      help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]    --> src/m_48_rotate_image.rs:102:31
[INFO] [stdout]     |
[INFO] [stdout] 102 |                 let (mut r_n, mut c_n) = rotate_n(rank, level, r, c, n);
[INFO] [stdout]     |                               ----^^^
[INFO] [stdout]     |                               |
[INFO] [stdout]     |                               help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/m_240_search_a_2d_matrix_ii.rs:78:9
[INFO] [stdout]    |
[INFO] [stdout] 78 |     let mut start = 0;
[INFO] [stdout]    |         ----^^^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_cheat` is never used
[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 `id` is never used
[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 `plus_one_version_1` is never used
[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] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 8.71s
[INFO] running `Command { std: "docker" "inspect" "af48902f42d6b7c6c1c1cd325d916961fcafbbe16a6452a30b2808d00c4ded33", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "af48902f42d6b7c6c1c1cd325d916961fcafbbe16a6452a30b2808d00c4ded33", kill_on_drop: false }`
[INFO] [stdout] af48902f42d6b7c6c1c1cd325d916961fcafbbe16a6452a30b2808d00c4ded33