[INFO] cloning repository https://github.com/tonyyzy/leek
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/tonyyzy/leek" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftonyyzy%2Fleek", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftonyyzy%2Fleek'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 83d8682ed4cd7b98a4eb470eb5a759c1821813ed
[INFO] checking tonyyzy/leek against try#d8be25549d5418405531341b4be6d8538fc3c42e for pr-156160
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Ftonyyzy%2Fleek" "/workspace/builds/worker-2-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-2-tc2/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/tonyyzy/leek
[INFO] finished tweaking git repo https://github.com/tonyyzy/leek
[INFO] tweaked toml for git repo https://github.com/tonyyzy/leek written to /workspace/builds/worker-2-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/tonyyzy/leek on toolchain d8be25549d5418405531341b4be6d8538fc3c42e
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+d8be25549d5418405531341b4be6d8538fc3c42e" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/tonyyzy/leek 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" "+d8be25549d5418405531341b4be6d8538fc3c42e" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,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" "-m" "1610612736" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:3a6becf2bc8dde7f3fa57ede90e4f284e72d296796fc446bbb1e2c7cc0530151" "sleep" "infinity", kill_on_drop: false }`
[INFO] [stdout] bf9068007a80fa1a55fd2abc3c9f1ae8b7a29569aef76d7827fa560e3ce3c7e9
[INFO] running `Command { std: "docker" "start" "bf9068007a80fa1a55fd2abc3c9f1ae8b7a29569aef76d7827fa560e3ce3c7e9", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "exec" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-w" "/opt/rustwide/workdir" "--user" "0:0" "bf9068007a80fa1a55fd2abc3c9f1ae8b7a29569aef76d7827fa560e3ce3c7e9" "/opt/rustwide/cargo-home/bin/cargo" "+d8be25549d5418405531341b4be6d8538fc3c42e" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "bf9068007a80fa1a55fd2abc3c9f1ae8b7a29569aef76d7827fa560e3ce3c7e9", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "exec" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-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" "-w" "/opt/rustwide/workdir" "--user" "0:0" "bf9068007a80fa1a55fd2abc3c9f1ae8b7a29569aef76d7827fa560e3ce3c7e9" "/opt/rustwide/cargo-home/bin/cargo" "+d8be25549d5418405531341b4be6d8538fc3c42e" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stderr]     Checking leek v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused variable: `counter`
[INFO] [stdout]  --> src/L100/L36.rs:5:13
[INFO] [stdout]   |
[INFO] [stdout] 5 |         let mut counter: u16;
[INFO] [stdout]   |             ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_counter`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/lib.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `two_sum` is never used
[INFO] [stdout]  --> src/L100/L1.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_valid_sudoku` and `is_valid` are never used
[INFO] [stdout]   --> src/L100/L36.rs:4:12
[INFO] [stdout]    |
[INFO] [stdout]  3 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  4 |     pub fn is_valid_sudoku(board: Vec<Vec<char>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 19 |     fn is_valid<'a, T: Iterator<Item = &'a char>>(x: T) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum` and `sums` are never used
[INFO] [stdout]   --> src/L100/L39.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn combination_sum(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn sums(
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum2` and `sumz` are never used
[INFO] [stdout]   --> src/L100/L40.rs:4:12
[INFO] [stdout]    |
[INFO] [stdout]  3 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  4 |     pub fn combination_sum2(candidates: Vec<i32>, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     fn sumz(candidates: Vec<i32>, last: i32, target: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `group_anagrams` is never used
[INFO] [stdout]  --> src/L100/L49.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn group_anagrams(mut strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `plus_one` is never used
[INFO] [stdout]  --> src/L100/L66.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | impl crate::Solution {
[INFO] [stdout]   | -------------------- associated function in this implementation
[INFO] [stdout] 2 |     pub fn plus_one(digits: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add_binary` is never used
[INFO] [stdout]  --> src/L100/L67.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn add_binary(a: String, b: String) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `my_sqrt` and `equa` are never used
[INFO] [stdout]   --> src/L100/L69.rs:4:12
[INFO] [stdout]    |
[INFO] [stdout]  3 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  4 |     pub fn my_sqrt(x: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn equa(x: f32, a: f32) -> f32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `climb_stairs` and `ways` are never used
[INFO] [stdout]   --> src/L100/L70.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn climb_stairs(n: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     fn ways(n: i32, cache: &mut HashMap<i32, i32>) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/L100/L83.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/L100/L83.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     #[inline]
[INFO] [stdout] 12 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `delete_duplicates` and `insert` are never used
[INFO] [stdout]   --> src/L100/L83.rs:17:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 17 |     pub fn delete_duplicates(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51 |     fn insert(head: &mut Box<ListNode>, val: i32) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge` is never used
[INFO] [stdout]  --> src/L100/L88.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `inorder_traversal` is never used
[INFO] [stdout]  --> src/L100/L94.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/L100/L100.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/L100/L100.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: associated function `is_same_tree` is never used
[INFO] [stdout]   --> src/L100/L100.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 25 |     pub fn is_same_tree(
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/L200/L108.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/L200/L108.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: associated functions `sorted_array_to_bst` and `slice_bst` are never used
[INFO] [stdout]   --> src/L200/L108.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 24 |     pub fn sorted_array_to_bst(nums: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn slice_bst(s: &[i32]) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/L200/L110.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/L200/L110.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     #[inline]
[INFO] [stdout] 12 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_balanced` and `height` are never used
[INFO] [stdout]   --> src/L200/L110.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 23 |     pub fn is_balanced(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn height(r: &Option<Rc<RefCell<TreeNode>>>) -> isize {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/L200/L112.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/L200/L112.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl TreeNode {
[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: associated functions `has_path_sum` and `dfs` are never used
[INFO] [stdout]   --> src/L200/L112.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 23 |     pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn dfs(root: &Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/L200/L113.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/L200/L113.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: associated functions `path_sum` and `dfs113` are never used
[INFO] [stdout]   --> src/L200/L113.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 24 |     pub fn path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn dfs113(root: &Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `generate` is never used
[INFO] [stdout]  --> src/L200/L118.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn generate(num_rows: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `fac` and `get_row` are never used
[INFO] [stdout]   --> src/L200/L119.rs:3:8
[INFO] [stdout]    |
[INFO] [stdout]  2 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  3 |     fn fac(i: u128) -> u128 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 10 |     pub fn get_row(row_index: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/L200/L121.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_palindrome` is never used
[INFO] [stdout]  --> src/L200/L125.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn is_palindrome(s: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `longest_consecutive` is never used
[INFO] [stdout]  --> src/L200/L128.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     pub fn longest_consecutive(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `single_number` is never used
[INFO] [stdout]  --> src/L200/L136.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn single_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `combination_sum3` and `find` are never used
[INFO] [stdout]   --> src/L300/L216.rs:4:12
[INFO] [stdout]    |
[INFO] [stdout]  3 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  4 |     pub fn combination_sum3(k: i32, n: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 11 |     fn find(k: usize, n: i32, num: i32, selection: Vec<i32>, results: &mut Vec<Vec<i32>>) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `contains_duplicate` is never used
[INFO] [stdout]  --> src/L300/L217.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn contains_duplicate(nums: Vec<i32>) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `product_except_self` is never used
[INFO] [stdout]  --> src/L300/L238.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn product_except_self(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `CharSet` is never constructed
[INFO] [stdout]  --> src/L300/L242.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct CharSet(HashMap<char, u64>);
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/L300/L242.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl CharSet {
[INFO] [stdout]   | ------------ associated function in this implementation
[INFO] [stdout] 7 |     fn new(s: String) -> CharSet {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_anagram` is never used
[INFO] [stdout]   --> src/L300/L242.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn is_anagram(s: String, t: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `top_k_frequent` is never used
[INFO] [stdout]  --> src/L400/L347.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn top_k_frequent(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_subsequence` is never used
[INFO] [stdout]  --> src/L400/L392.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn is_subsequence(s: String, t: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `NULL` is never used
[INFO] [stdout]  --> src/tree.rs:5:7
[INFO] [stdout]   |
[INFO] [stdout] 5 | const NULL: i32 = i32::MIN;
[INFO] [stdout]   |       ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum `Side` is never used
[INFO] [stdout]  --> src/tree.rs:8:6
[INFO] [stdout]   |
[INFO] [stdout] 8 | enum Side {
[INFO] [stdout]   |      ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `next` is never used
[INFO] [stdout]   --> src/tree.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl Side {
[INFO] [stdout]    | --------- method in this implementation
[INFO] [stdout] 14 |     fn next(&mut self) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]   --> src/tree.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 25 | pub struct TreeNode {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `new`, `from_list`, `breadth_frist`, and `inorder` are never used
[INFO] [stdout]    --> src/tree.rs:38:12
[INFO] [stdout]     |
[INFO] [stdout]  37 | impl TreeNode {
[INFO] [stdout]     | ------------- associated functions in this implementation
[INFO] [stdout]  38 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] ...
[INFO] [stdout]  46 |     pub fn from_list(list: &[i32]) -> Option<Rc<RefCell<Self>>> {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout]  89 |     fn breadth_frist(
[INFO] [stdout]     |        ^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 113 |     fn inorder(root: Option<Rc<RefCell<Self>>>) -> Vec<i32> {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `counter`
[INFO] [stdout]  --> src/L100/L36.rs:5:13
[INFO] [stdout]   |
[INFO] [stdout] 5 |         let mut counter: u16;
[INFO] [stdout]   |             ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_counter`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `two_sum` is never used
[INFO] [stdout]  --> src/L100/L1.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `group_anagrams` is never used
[INFO] [stdout]  --> src/L100/L49.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn group_anagrams(mut strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `plus_one` is never used
[INFO] [stdout]  --> src/L100/L66.rs:2:12
[INFO] [stdout]   |
[INFO] [stdout] 1 | impl crate::Solution {
[INFO] [stdout]   | -------------------- associated function in this implementation
[INFO] [stdout] 2 |     pub fn plus_one(digits: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add_binary` is never used
[INFO] [stdout]  --> src/L100/L67.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn add_binary(a: String, b: String) -> String {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `delete_duplicates` is never used
[INFO] [stdout]   --> src/L100/L83.rs:17:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 17 |     pub fn delete_duplicates(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `merge` is never used
[INFO] [stdout]  --> src/L100/L88.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn merge(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32) {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/L100/L100.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/L100/L100.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: associated function `is_same_tree` is never used
[INFO] [stdout]   --> src/L100/L100.rs:25:12
[INFO] [stdout]    |
[INFO] [stdout] 24 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 25 |     pub fn is_same_tree(
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/L200/L108.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/L200/L108.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: associated functions `sorted_array_to_bst` and `slice_bst` are never used
[INFO] [stdout]   --> src/L200/L108.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 24 |     pub fn sorted_array_to_bst(nums: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn slice_bst(s: &[i32]) -> Option<Rc<RefCell<TreeNode>>> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/L200/L110.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/L200/L110.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     #[inline]
[INFO] [stdout] 12 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_balanced` and `height` are never used
[INFO] [stdout]   --> src/L200/L110.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 23 |     pub fn is_balanced(root: Option<Rc<RefCell<TreeNode>>>) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |     fn height(r: &Option<Rc<RefCell<TreeNode>>>) -> isize {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/L200/L112.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/L200/L112.rs:11:12
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl TreeNode {
[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: associated functions `has_path_sum` and `dfs` are never used
[INFO] [stdout]   --> src/L200/L112.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 23 |     pub fn has_path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn dfs(root: &Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> bool {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/L200/L113.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/L200/L113.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: associated functions `path_sum` and `dfs113` are never used
[INFO] [stdout]   --> src/L200/L113.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 24 |     pub fn path_sum(root: Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 28 |     fn dfs113(root: &Option<Rc<RefCell<TreeNode>>>, target_sum: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `generate` is never used
[INFO] [stdout]  --> src/L200/L118.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn generate(num_rows: i32) -> Vec<Vec<i32>> {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `fac` and `get_row` are never used
[INFO] [stdout]   --> src/L200/L119.rs:3:8
[INFO] [stdout]    |
[INFO] [stdout]  2 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  3 |     fn fac(i: u128) -> u128 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 10 |     pub fn get_row(row_index: i32) -> Vec<i32> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `max_profit` is never used
[INFO] [stdout]  --> src/L200/L121.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn max_profit(prices: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_palindrome` is never used
[INFO] [stdout]  --> src/L200/L125.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn is_palindrome(s: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `single_number` is never used
[INFO] [stdout]  --> src/L200/L136.rs:5:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 5 |     pub fn single_number(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `product_except_self` is never used
[INFO] [stdout]  --> src/L300/L238.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 4 |     pub fn product_except_self(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `CharSet` is never constructed
[INFO] [stdout]  --> src/L300/L242.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct CharSet(HashMap<char, u64>);
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/L300/L242.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl CharSet {
[INFO] [stdout]   | ------------ associated function in this implementation
[INFO] [stdout] 7 |     fn new(s: String) -> CharSet {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_anagram` is never used
[INFO] [stdout]   --> src/L300/L242.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 23 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 24 |     pub fn is_anagram(s: String, t: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `top_k_frequent` is never used
[INFO] [stdout]  --> src/L400/L347.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn top_k_frequent(nums: Vec<i32>, k: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `is_subsequence` is never used
[INFO] [stdout]  --> src/L400/L392.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 2 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 3 |     pub fn is_subsequence(s: String, t: String) -> bool {
[INFO] [stdout]   |            ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `inorder` is never used
[INFO] [stdout]    --> src/tree.rs:113:8
[INFO] [stdout]     |
[INFO] [stdout]  37 | impl TreeNode {
[INFO] [stdout]     | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 113 |     fn inorder(root: Option<Rc<RefCell<Self>>>) -> Vec<i32> {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.37s
[INFO] running `Command { std: "docker" "inspect" "bf9068007a80fa1a55fd2abc3c9f1ae8b7a29569aef76d7827fa560e3ce3c7e9", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "bf9068007a80fa1a55fd2abc3c9f1ae8b7a29569aef76d7827fa560e3ce3c7e9", kill_on_drop: false }`
[INFO] [stdout] bf9068007a80fa1a55fd2abc3c9f1ae8b7a29569aef76d7827fa560e3ce3c7e9
