[INFO] cloning repository https://github.com/boycgit/leetcode-rust
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/boycgit/leetcode-rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fboycgit%2Fleetcode-rust", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fboycgit%2Fleetcode-rust'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 2ab8f4fd69ce9906113011b23fcf73e438abe4a3
[INFO] checking boycgit/leetcode-rust/2ab8f4fd69ce9906113011b23fcf73e438abe4a3 against master#32cd9114712a24010b0583624dc52ac302194128 for pr-143717
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fboycgit%2Fleetcode-rust" "/workspace/builds/worker-3-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-3-tc1/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/boycgit/leetcode-rust
[INFO] finished tweaking git repo https://github.com/boycgit/leetcode-rust
[INFO] tweaked toml for git repo https://github.com/boycgit/leetcode-rust written to /workspace/builds/worker-3-tc1/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/boycgit/leetcode-rust on toolchain 32cd9114712a24010b0583624dc52ac302194128
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+32cd9114712a24010b0583624dc52ac302194128" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/boycgit/leetcode-rust 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" "+32cd9114712a24010b0583624dc52ac302194128" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+32cd9114712a24010b0583624dc52ac302194128" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 6e68de31475f6e5b2be801ba04832d94a511a56ae9cc77ac8712e61ce889408f
[INFO] running `Command { std: "docker" "start" "-a" "6e68de31475f6e5b2be801ba04832d94a511a56ae9cc77ac8712e61ce889408f", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "6e68de31475f6e5b2be801ba04832d94a511a56ae9cc77ac8712e61ce889408f", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "6e68de31475f6e5b2be801ba04832d94a511a56ae9cc77ac8712e61ce889408f", kill_on_drop: false }`
[INFO] [stdout] 6e68de31475f6e5b2be801ba04832d94a511a56ae9cc77ac8712e61ce889408f
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-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:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+32cd9114712a24010b0583624dc52ac302194128" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 0af542f7613cf874be43330cf69dd718edb2bf69eedf262cf93792b84850e76a
[INFO] running `Command { std: "docker" "start" "-a" "0af542f7613cf874be43330cf69dd718edb2bf69eedf262cf93792b84850e76a", kill_on_drop: false }`
[INFO] [stderr]     Checking leetcode v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/utils/linked_list.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Link` is never used
[INFO] [stdout]  --> src/utils/linked_list.rs:7:10
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub type Link = Option<Box<ListNode>>;
[INFO] [stdout]   |          ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/utils/linked_list.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout] 9  | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 10 |     #[inline]
[INFO] [stdout] 11 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `to_list` is never used
[INFO] [stdout]   --> src/utils/linked_list.rs:17:8
[INFO] [stdout]    |
[INFO] [stdout] 17 | pub fn to_list(vec: Vec<i32>) -> Link {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/utils/tree.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/utils/tree.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     #[inline]
[INFO] [stdout] 13 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `to_tree` is never used
[INFO] [stdout]   --> src/utils/tree.rs:22:8
[INFO] [stdout]    |
[INFO] [stdout] 22 | pub fn to_tree(vec: Vec<Option<i32>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Array` is never constructed
[INFO] [stdout]  --> src/utils/set.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Array<T, const N: usize>([T; N]);
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `array_to_hashset` is never used
[INFO] [stdout]   --> src/utils/set.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 28 | pub fn array_to_hashset<T: Eq + Hash + Copy, const N: usize>(arr: impl IntoIterator<Item = impl IntoIterator<Item = T>>) -> HashSet<Array...
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `search` is never used
[INFO] [stdout]   --> src/./二分查找_704.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `sorted_squares` is never used
[INFO] [stdout]   --> src/./有序数组的平方_977.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn sorted_squares(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_element` is never used
[INFO] [stdout]   --> src/./移除元素_27.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn remove_element(nums: &mut Vec<i32>, val: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_sub_array_len` is never used
[INFO] [stdout]   --> src/./长度最小的子数组_209.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     pub fn min_sub_array_len(target: i32, nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `generate_matrix` is never used
[INFO] [stdout]   --> src/./螺旋矩阵_ii_59.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn generate_matrix(n: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_elements` is never used
[INFO] [stdout]   --> src/./移除链表元素_203.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 30 |     pub fn remove_elements(head: Link, val: i32) -> Link {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `reverse_list` is never used
[INFO] [stdout]   --> src/./反转链表_206.rs:31:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 30 |     // 遍历法
[INFO] [stdout] 31 |     pub fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `swap_pairs` is never used
[INFO] [stdout]   --> src/./两两交换链表中的节点_24.rs:30:12
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 30 |     pub fn swap_pairs(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `remove_nth_from_end` is never used
[INFO] [stdout]   --> src/./删除链表的倒数第_n_个结点_19.rs:29:12
[INFO] [stdout]    |
[INFO] [stdout] 28 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 29 |     pub fn remove_nth_from_end(head: Option<Box<ListNode>>, n: i32) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_anagram` is never used
[INFO] [stdout]   --> src/./有效的字母异位词_242.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     pub fn is_anagram(s: String, t: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `intersection` is never used
[INFO] [stdout]   --> src/./两个数组的交集_349.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn intersection(nums1: Vec<i32>, nums2: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_happy` is never used
[INFO] [stdout]   --> src/./快乐数_202.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     pub fn is_happy(n: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `two_sum` is never used
[INFO] [stdout]   --> src/./两数之和_1.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `four_sum_count` is never used
[INFO] [stdout]   --> src/./四数相加_ii_454.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     pub fn four_sum_count(nums1: Vec<i32>, nums2: Vec<i32>, nums3: Vec<i32>, nums4: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_construct` is never used
[INFO] [stdout]   --> src/./赎金信_383.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn can_construct(ransom_note: String, magazine: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `three_sum` is never used
[INFO] [stdout]   --> src/./三数之和_15.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `four_sum` is never used
[INFO] [stdout]   --> src/./四数之和_18.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn four_sum(nums: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `reverse`, `remove_extra_spaces`, and `reverse_words` are never used
[INFO] [stdout]   --> src/./反转字符串中的单词_151.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 12 |     pub fn reverse(s: &mut Vec<char>, mut begin: usize, mut end: usize){
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     pub fn remove_extra_spaces(s: &mut Vec<char>) {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     pub fn reverse_words(s: String) -> String {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `get_next` and `str_str` are never used
[INFO] [stdout]   --> src/./找出字符串中第一个匹配项的下标_28.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 12 |     pub fn get_next(needle: &Vec<char>) -> Vec<usize> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 33 |     pub fn str_str(haystack: String, needle: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `traversal` and `preorder_traversal` are never used
[INFO] [stdout]   --> src/./二叉树的前序遍历_144.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 33 |     pub fn traversal(node: Option<Rc<RefCell<TreeNode>>>, result:&mut Vec<i32> ) {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |     pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `postorder_traversal` is never used
[INFO] [stdout]   --> src/./二叉树的后序遍历_145.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 33 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 34 |     pub fn postorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `level_order` is never used
[INFO] [stdout]   --> src/./二叉树的层序遍历_102.rs:36:12
[INFO] [stdout]    |
[INFO] [stdout] 35 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 36 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `traversal` and `invert_tree` are never used
[INFO] [stdout]   --> src/./翻转二叉树_226.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 33 |     // 后续遍历: 左右中
[INFO] [stdout] 34 |     pub fn traversal(node: Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 54 |     pub fn invert_tree(root: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `traversal_cmp` and `is_symmetric` are never used
[INFO] [stdout]   --> src/./对称二叉树_101.rs:36:12
[INFO] [stdout]    |
[INFO] [stdout] 33 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn traversal_cmp(tree1: Option<Rc<RefCell<TreeNode>>>, tree2: Option<Rc<RefCell<TreeNode>>>) -> bool{
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     pub fn is_symmetric(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `count_nodes` is never used
[INFO] [stdout]   --> src/./完全二叉树的节点个数_222.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 33 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 34 |
[INFO] [stdout] 35 |     pub fn count_nodes(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `has_path_sum` is never used
[INFO] [stdout]   --> src/./路径总和_112.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 33 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 34 |
[INFO] [stdout] 35 |     pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `build_tree` is never used
[INFO] [stdout]   --> src/./从中序与后序遍历序列构造二叉树_106.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 33 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 34 |     pub fn build_tree(inorder: Vec<i32>, postorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `build_tree` is never used
[INFO] [stdout]   --> src/./从前序与中序遍历序列构造二叉树_105.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 33 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 34 |     pub fn build_tree(preorder: Vec<i32>, inorder: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge_trees` is never used
[INFO] [stdout]   --> src/./合并二叉树_617.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 33 |     pub fn merge_trees(root1: Option<Rc<RefCell<TreeNode>>>, root2: Option<Rc<RefCell<TreeNode>>>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_valid_bst` is never used
[INFO] [stdout]   --> src/./验证二叉搜索树_98.rs:35:12
[INFO] [stdout]    |
[INFO] [stdout] 33 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 34 |
[INFO] [stdout] 35 |     pub fn is_valid_bst(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `lowest_common_ancestor` is never used
[INFO] [stdout]   --> src/./二叉树的最近公共祖先_236.rs:33:12
[INFO] [stdout]    |
[INFO] [stdout] 32 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 33 |     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: associated function `delete_node` is never used
[INFO] [stdout]   --> src/./删除二叉搜索树中的节点_450.rs:36:12
[INFO] [stdout]    |
[INFO] [stdout] 33 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn delete_node(root: Option<Rc<RefCell<TreeNode>>>, key: i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `trim_bst` is never used
[INFO] [stdout]   --> src/./修剪二叉搜索树_669.rs:34:12
[INFO] [stdout]    |
[INFO] [stdout] 33 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 34 |     pub fn trim_bst(root: Option<Rc<RefCell<TreeNode>>>, low: i32, high: i32) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `backtracking` and `combine` are never used
[INFO] [stdout]   --> src/./组合_77.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 13 |     // 回溯算法
[INFO] [stdout] 14 |     pub fn backtracking(result: &mut Vec<Vec<i32>>, path: &mut Vec<i32>, n:i32, k: i32, start_idx: i32) {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 36 |     pub fn combine(n: i32, k: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `backtracking` and `combination_sum3` are never used
[INFO] [stdout]   --> src/./组合总和_iii_216.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 13 |     pub fn backtracking(result: &mut Vec<Vec<i32>>, path: &mut Vec<i32>, target_sum: i32, k: i32, start_index: i32) {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |     pub fn combination_sum3(k: i32, n: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `backtracking` and `letter_combinations` are never used
[INFO] [stdout]   --> src/./电话号码的字母组合_17.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 12 |
[INFO] [stdout] 13 |     pub fn backtracking(result: &mut Vec<String>, path: &mut Vec<char>, digits: &String,letter_map: &Vec<&str>, cur_index: i32) {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 48 |     pub fn letter_combinations(digits: String) -> Vec<String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_sym`, `backtracking`, and `partition` are never used
[INFO] [stdout]   --> src/./分割回文串_131.rs:14:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 14 |     pub fn is_sym(s: &Vec<char>, start: usize, end: usize) -> bool {
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 29 |     pub fn backtracking(result: &mut Vec<Vec<String>>, path: &mut Vec<String>, origin_str: &Vec<char>, start_idx: usize) {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 55 |     pub fn partition(s: String) -> Vec<Vec<String>> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_jump` is never used
[INFO] [stdout]   --> src/./跳跃游戏_55.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     pub fn can_jump(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `fib` is never used
[INFO] [stdout]   --> src/./斐波那契数_509.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn fib(n: i32) -> i32 {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `climb_stairs` is never used
[INFO] [stdout]   --> src/./爬楼梯_70.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `min_cost_climbing_stairs` is never used
[INFO] [stdout]   --> src/./使用最小花费爬楼梯_746.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     pub fn min_cost_climbing_stairs(cost: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `unique_paths` is never used
[INFO] [stdout]   --> src/./不同路径_62.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn unique_paths(m: i32, n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `integer_break` is never used
[INFO] [stdout]   --> src/./整数拆分_343.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     pub fn integer_break(n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `can_partition` is never used
[INFO] [stdout]   --> src/./分割等和子集_416.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn can_partition(nums: Vec<i32>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `rob` is never used
[INFO] [stdout]   --> src/./打家劫舍_198.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     pub fn rob(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `daily_temperatures` is never used
[INFO] [stdout]   --> src/./每日温度_739.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn daily_temperatures(temperatures: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `next_greater_element` is never used
[INFO] [stdout]   --> src/./下一个更大元素_i_496.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     pub fn next_greater_element(nums1: Vec<i32>, nums2: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `next_greater_elements` is never used
[INFO] [stdout]   --> src/./下一个更大元素_ii_503.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     pub fn next_greater_elements(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `trap` is never used
[INFO] [stdout]   --> src/./接雨水_42.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     pub fn trap(height: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `largest_rectangle_area` is never used
[INFO] [stdout]   --> src/./柱状图中最大的矩形_84.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 12 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 13 |     pub fn largest_rectangle_area(heights: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `length_of_lis` is never used
[INFO] [stdout]   --> src/./最长递增子序列_300.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn length_of_lis(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_length_of_lcis` is never used
[INFO] [stdout]   --> src/./最长连续递增序列_674.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn find_length_of_lcis(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `find_length` is never used
[INFO] [stdout]   --> src/./最长重复子数组_718.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn find_length(nums1: Vec<i32>, nums2: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_common_subsequence` is never used
[INFO] [stdout]   --> src/./最长公共子序列_1143.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn longest_common_subsequence(text1: String, text2: String) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_sub_array` is never used
[INFO] [stdout]   --> src/./最大子数组和_53.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_subsequence` is never used
[INFO] [stdout]   --> src/./判断子序列_392.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 11 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 12 |     pub fn is_subsequence(s: String, t: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.99s
[INFO] running `Command { std: "docker" "inspect" "0af542f7613cf874be43330cf69dd718edb2bf69eedf262cf93792b84850e76a", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "0af542f7613cf874be43330cf69dd718edb2bf69eedf262cf93792b84850e76a", kill_on_drop: false }`
[INFO] [stdout] 0af542f7613cf874be43330cf69dd718edb2bf69eedf262cf93792b84850e76a
