[INFO] cloning repository https://github.com/ykwmz/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/ykwmz/leetcode-rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fykwmz%2Fleetcode-rust", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fykwmz%2Fleetcode-rust'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] de98e164d8be6fcb41cdf736b8e1b111d0fe7220
[INFO] testing ykwmz/leetcode-rust against try#28f95933dc0727396c07b48d0a8cb5211b7fb472 for pr-154065-2
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fykwmz%2Fleetcode-rust" "/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/ykwmz/leetcode-rust
[INFO] finished tweaking git repo https://github.com/ykwmz/leetcode-rust
[INFO] tweaked toml for git repo https://github.com/ykwmz/leetcode-rust written to /workspace/builds/worker-2-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/ykwmz/leetcode-rust on toolchain 28f95933dc0727396c07b48d0a8cb5211b7fb472
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+28f95933dc0727396c07b48d0a8cb5211b7fb472" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/ykwmz/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" "+28f95933dc0727396c07b48d0a8cb5211b7fb472" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-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:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+28f95933dc0727396c07b48d0a8cb5211b7fb472" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] e896dfa8eb886dff80b18e359f155c9b491f41a7a7a1288bef237c2cbda613ed
[INFO] running `Command { std: "docker" "start" "-a" "e896dfa8eb886dff80b18e359f155c9b491f41a7a7a1288bef237c2cbda613ed", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "e896dfa8eb886dff80b18e359f155c9b491f41a7a7a1288bef237c2cbda613ed", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "e896dfa8eb886dff80b18e359f155c9b491f41a7a7a1288bef237c2cbda613ed", kill_on_drop: false }`
[INFO] [stdout] e896dfa8eb886dff80b18e359f155c9b491f41a7a7a1288bef237c2cbda613ed
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-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:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+28f95933dc0727396c07b48d0a8cb5211b7fb472" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 056bc1458f5fed7ad6987d9bfd04a91e01852b4b20ab0c5d693d6f0945cb8c06
[INFO] running `Command { std: "docker" "start" "-a" "056bc1458f5fed7ad6987d9bfd04a91e01852b4b20ab0c5d693d6f0945cb8c06", kill_on_drop: false }`
[INFO] [stderr]    Compiling leetcode v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/add_two_numbers.rs:11:7
[INFO] [stdout]    |
[INFO] [stdout]  9 |  impl ListNode {
[INFO] [stdout]    |  ------------- associated function in this implementation
[INFO] [stdout] 10 |    #[inline]
[INFO] [stdout] 11 |    fn new(val: i32) -> Self {
[INFO] [stdout]    |       ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `add_two_numbers` is never used
[INFO] [stdout]   --> src/add_two_numbers.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn add_two_numbers(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `length_of_longest_substring` is never used
[INFO] [stdout]  --> src/length_of_longest_substring.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_median_sorted_arrays` is never used
[INFO] [stdout]  --> src/find_median_sorted_arrays.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_palindrome` is never used
[INFO] [stdout]  --> src/longest_palindrome.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn longest_palindrome(s: String) -> String {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `zigzag_convert` is never used
[INFO] [stdout]  --> src/zigzag_convert.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn zigzag_convert(s: String, num_rows: i32) -> String {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse` is never used
[INFO] [stdout]  --> src/reverse_integer.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn reverse(x: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_error_nums` is never used
[INFO] [stdout]  --> src/find_error_nums.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn find_error_nums(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `display_table` is never used
[INFO] [stdout]  --> src/display_table.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn display_table(orders: Vec<Vec<String>>) -> Vec<Vec<String>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `count_pairs` is never used
[INFO] [stdout]  --> src/count_pairs.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn count_pairs(deliciousness: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num_subarrays_with_sum` is never used
[INFO] [stdout]  --> src/num_subarrays_with_sum.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn num_subarrays_with_sum(nums: Vec<i32>, goal: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `majority_element` is never used
[INFO] [stdout]  --> src/majority_element.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TimeMap` is never constructed
[INFO] [stdout]   --> src/time_map.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct TimeMap {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `set`, and `get` are never used
[INFO] [stdout]   --> src/time_map.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl TimeMap {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn set(&mut self, key: String, value: String, timestamp: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |     fn get(&self, key: String, timestamp: i32) -> String {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `maximum_element_after_decrementing_and_rearranging` is never used
[INFO] [stdout]   --> src/maximum_element_after_decrementing_and_rearranging.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn maximum_element_after_decrementing_and_rearranging(arr: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search` is never used
[INFO] [stdout]  --> src/search.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array` is never used
[INFO] [stdout]  --> src/max_sub_array.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `group_anagrams` is never used
[INFO] [stdout]  --> src/group_anagrams.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_frequency` is never used
[INFO] [stdout]   --> src/max_frequency.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn max_frequency(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_pair_sum` is never used
[INFO] [stdout]   --> src/min_pair_sum.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn min_pair_sum(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_covered` is never used
[INFO] [stdout]  --> src/is_covered.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn is_covered(ranges: Vec<Vec<i32>>, left: i32, right: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_operations` is never used
[INFO] [stdout]   --> src/min_operations.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub fn min_operations(target: Vec<i32>, arr: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/find_second_minimum_value.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/find_second_minimum_value.rs:17:10
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 16 |   #[inline]
[INFO] [stdout] 17 |   pub fn new(val: i32) -> Self {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_second_minimum_value` is never used
[INFO] [stdout]   --> src/find_second_minimum_value.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub fn find_second_minimum_value(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `title_to_number` is never used
[INFO] [stdout]   --> src/title_to_number.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub fn title_to_number(column_title: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `k_weakest_rows` is never used
[INFO] [stdout]  --> src/k_weakest_rows.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn k_weakest_rows(mat: Vec<Vec<i32>>, k: i32) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `tribonacci` is never used
[INFO] [stdout]  --> src/tribonacci.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn tribonacci(n: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `number_of_arithmetic_slices` is never used
[INFO] [stdout]  --> src/number_of_arithmetic_slices.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn number_of_arithmetic_slices(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_palindrome_subseq` is never used
[INFO] [stdout]   --> src/longest_palindrome_subseq.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn longest_palindrome_subseq(s: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `check_record` is never used
[INFO] [stdout]   --> src/check_record.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | pub fn check_record(s: String) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_vowels` is never used
[INFO] [stdout]  --> src/reverse_vowels.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn reverse_vowels(mut s: String) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_str` is never used
[INFO] [stdout]  --> src/reverse_str.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn reverse_str(s: String, k: i32) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `compress` is never used
[INFO] [stdout]   --> src/compress.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub fn compress(chars: &mut Vec<char>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `running_sum` is never used
[INFO] [stdout]  --> src/running_sum.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn running_sum(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sum_odd_length_subarrays` is never used
[INFO] [stdout]  --> src/sum_odd_length_subarrays.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn sum_odd_length_subarrays(arr: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search` is never used
[INFO] [stdout]  --> src/search2.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_matrix` is never used
[INFO] [stdout]   --> src/search_matrix.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_min_difference` is never used
[INFO] [stdout]  --> src/find_min_difference.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn find_min_difference(time_points: Vec<String>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `contains_nearby_duplicate` is never used
[INFO] [stdout]   --> src/contains_nearby_duplicate.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub fn contains_nearby_duplicate(nums: Vec<i32>, k: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_lu_slength` is never used
[INFO] [stdout]   --> src/find_lu_slength.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn find_lu_slength(a: String, b: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `convert_to_base7` is never used
[INFO] [stdout]  --> src/convert_to_base7.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn convert_to_base7(num: i32) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `plus_one` is never used
[INFO] [stdout]  --> src/plus_one.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn plus_one(mut digits: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.97s
[INFO] running `Command { std: "docker" "inspect" "056bc1458f5fed7ad6987d9bfd04a91e01852b4b20ab0c5d693d6f0945cb8c06", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "056bc1458f5fed7ad6987d9bfd04a91e01852b4b20ab0c5d693d6f0945cb8c06", kill_on_drop: false }`
[INFO] [stdout] 056bc1458f5fed7ad6987d9bfd04a91e01852b4b20ab0c5d693d6f0945cb8c06
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-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:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+28f95933dc0727396c07b48d0a8cb5211b7fb472" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] b4f1cd8e5091a707d5969525ffbfc456efef06fdb1ebd585c48c04e448511b85
[INFO] running `Command { std: "docker" "start" "-a" "b4f1cd8e5091a707d5969525ffbfc456efef06fdb1ebd585c48c04e448511b85", kill_on_drop: false }`
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/add_two_numbers.rs:11:7
[INFO] [stdout]    |
[INFO] [stdout]  9 |  impl ListNode {
[INFO] [stdout]    |  ------------- associated function in this implementation
[INFO] [stdout] 10 |    #[inline]
[INFO] [stdout] 11 |    fn new(val: i32) -> Self {
[INFO] [stdout]    |       ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling leetcode v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: function `add_two_numbers` is never used
[INFO] [stdout]   --> src/add_two_numbers.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn add_two_numbers(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `length_of_longest_substring` is never used
[INFO] [stdout]  --> src/length_of_longest_substring.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_median_sorted_arrays` is never used
[INFO] [stdout]  --> src/find_median_sorted_arrays.rs:4:4
[INFO] [stdout]   |
[INFO] [stdout] 4 | fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_palindrome` is never used
[INFO] [stdout]  --> src/longest_palindrome.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn longest_palindrome(s: String) -> String {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `zigzag_convert` is never used
[INFO] [stdout]  --> src/zigzag_convert.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn zigzag_convert(s: String, num_rows: i32) -> String {
[INFO] [stdout]   |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse` is never used
[INFO] [stdout]  --> src/reverse_integer.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn reverse(x: i32) -> i32 {
[INFO] [stdout]   |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_error_nums` is never used
[INFO] [stdout]  --> src/find_error_nums.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn find_error_nums(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `display_table` is never used
[INFO] [stdout]  --> src/display_table.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn display_table(orders: Vec<Vec<String>>) -> Vec<Vec<String>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `count_pairs` is never used
[INFO] [stdout]  --> src/count_pairs.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn count_pairs(deliciousness: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `num_subarrays_with_sum` is never used
[INFO] [stdout]  --> src/num_subarrays_with_sum.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn num_subarrays_with_sum(nums: Vec<i32>, goal: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `majority_element` is never used
[INFO] [stdout]  --> src/majority_element.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TimeMap` is never constructed
[INFO] [stdout]   --> src/time_map.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct TimeMap {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `set`, and `get` are never used
[INFO] [stdout]   --> src/time_map.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 29 | impl TimeMap {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn set(&mut self, key: String, value: String, timestamp: i32) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |     fn get(&self, key: String, timestamp: i32) -> String {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `maximum_element_after_decrementing_and_rearranging` is never used
[INFO] [stdout]   --> src/maximum_element_after_decrementing_and_rearranging.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn maximum_element_after_decrementing_and_rearranging(arr: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search` is never used
[INFO] [stdout]  --> src/search.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_sub_array` is never used
[INFO] [stdout]  --> src/max_sub_array.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `group_anagrams` is never used
[INFO] [stdout]  --> src/group_anagrams.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `max_frequency` is never used
[INFO] [stdout]   --> src/max_frequency.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn max_frequency(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_pair_sum` is never used
[INFO] [stdout]   --> src/min_pair_sum.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn min_pair_sum(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `is_covered` is never used
[INFO] [stdout]  --> src/is_covered.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn is_covered(ranges: Vec<Vec<i32>>, left: i32, right: i32) -> bool {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_operations` is never used
[INFO] [stdout]   --> src/min_operations.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub fn min_operations(target: Vec<i32>, arr: Vec<i32>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/find_second_minimum_value.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/find_second_minimum_value.rs:17:10
[INFO] [stdout]    |
[INFO] [stdout] 15 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 16 |   #[inline]
[INFO] [stdout] 17 |   pub fn new(val: i32) -> Self {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_second_minimum_value` is never used
[INFO] [stdout]   --> src/find_second_minimum_value.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub fn find_second_minimum_value(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `title_to_number` is never used
[INFO] [stdout]   --> src/title_to_number.rs:19:8
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub fn title_to_number(column_title: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `k_weakest_rows` is never used
[INFO] [stdout]  --> src/k_weakest_rows.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn k_weakest_rows(mat: Vec<Vec<i32>>, k: i32) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `tribonacci` is never used
[INFO] [stdout]  --> src/tribonacci.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn tribonacci(n: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `number_of_arithmetic_slices` is never used
[INFO] [stdout]  --> src/number_of_arithmetic_slices.rs:8:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | pub fn number_of_arithmetic_slices(nums: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `longest_palindrome_subseq` is never used
[INFO] [stdout]   --> src/longest_palindrome_subseq.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn longest_palindrome_subseq(s: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `check_record` is never used
[INFO] [stdout]   --> src/check_record.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | pub fn check_record(s: String) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_vowels` is never used
[INFO] [stdout]  --> src/reverse_vowels.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn reverse_vowels(mut s: String) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_str` is never used
[INFO] [stdout]  --> src/reverse_str.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn reverse_str(s: String, k: i32) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `compress` is never used
[INFO] [stdout]   --> src/compress.rs:16:8
[INFO] [stdout]    |
[INFO] [stdout] 16 | pub fn compress(chars: &mut Vec<char>) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `running_sum` is never used
[INFO] [stdout]  --> src/running_sum.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn running_sum(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sum_odd_length_subarrays` is never used
[INFO] [stdout]  --> src/sum_odd_length_subarrays.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub fn sum_odd_length_subarrays(arr: Vec<i32>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search` is never used
[INFO] [stdout]  --> src/search2.rs:6:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]   |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `search_matrix` is never used
[INFO] [stdout]   --> src/search_matrix.rs:13:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_min_difference` is never used
[INFO] [stdout]  --> src/find_min_difference.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn find_min_difference(time_points: Vec<String>) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `contains_nearby_duplicate` is never used
[INFO] [stdout]   --> src/contains_nearby_duplicate.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub fn contains_nearby_duplicate(nums: Vec<i32>, k: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_lu_slength` is never used
[INFO] [stdout]   --> src/find_lu_slength.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | pub fn find_lu_slength(a: String, b: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `convert_to_base7` is never used
[INFO] [stdout]  --> src/convert_to_base7.rs:2:8
[INFO] [stdout]   |
[INFO] [stdout] 2 | pub fn convert_to_base7(num: i32) -> String {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `plus_one` is never used
[INFO] [stdout]  --> src/plus_one.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub fn plus_one(mut digits: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 2.98s
[INFO] running `Command { std: "docker" "inspect" "b4f1cd8e5091a707d5969525ffbfc456efef06fdb1ebd585c48c04e448511b85", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "b4f1cd8e5091a707d5969525ffbfc456efef06fdb1ebd585c48c04e448511b85", kill_on_drop: false }`
[INFO] [stdout] b4f1cd8e5091a707d5969525ffbfc456efef06fdb1ebd585c48c04e448511b85
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-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:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+28f95933dc0727396c07b48d0a8cb5211b7fb472" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] e9de8a5937e0b8781479d7f4fd24452eba35f8f4277772fbe635fab198b2d314
[INFO] running `Command { std: "docker" "start" "-a" "e9de8a5937e0b8781479d7f4fd24452eba35f8f4277772fbe635fab198b2d314", kill_on_drop: false }`
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/add_two_numbers.rs:11:7
[INFO] [stderr]    |
[INFO] [stderr]  9 |  impl ListNode {
[INFO] [stderr]    |  ------------- associated function in this implementation
[INFO] [stderr] 10 |    #[inline]
[INFO] [stderr] 11 |    fn new(val: i32) -> Self {
[INFO] [stderr]    |       ^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function `add_two_numbers` is never used
[INFO] [stderr]   --> src/add_two_numbers.rs:22:4
[INFO] [stderr]    |
[INFO] [stderr] 22 | fn add_two_numbers(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stderr]    |    ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `length_of_longest_substring` is never used
[INFO] [stderr]  --> src/length_of_longest_substring.rs:3:4
[INFO] [stderr]   |
[INFO] [stderr] 3 | fn length_of_longest_substring(s: String) -> i32 {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `find_median_sorted_arrays` is never used
[INFO] [stderr]  --> src/find_median_sorted_arrays.rs:4:4
[INFO] [stderr]   |
[INFO] [stderr] 4 | fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `longest_palindrome` is never used
[INFO] [stderr]  --> src/longest_palindrome.rs:2:4
[INFO] [stderr]   |
[INFO] [stderr] 2 | fn longest_palindrome(s: String) -> String {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `zigzag_convert` is never used
[INFO] [stderr]  --> src/zigzag_convert.rs:1:4
[INFO] [stderr]   |
[INFO] [stderr] 1 | fn zigzag_convert(s: String, num_rows: i32) -> String {
[INFO] [stderr]   |    ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `reverse` is never used
[INFO] [stderr]  --> src/reverse_integer.rs:3:4
[INFO] [stderr]   |
[INFO] [stderr] 3 | fn reverse(x: i32) -> i32 {
[INFO] [stderr]   |    ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `find_error_nums` is never used
[INFO] [stderr]  --> src/find_error_nums.rs:6:8
[INFO] [stderr]   |
[INFO] [stderr] 6 | pub fn find_error_nums(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `display_table` is never used
[INFO] [stderr]  --> src/display_table.rs:8:8
[INFO] [stderr]   |
[INFO] [stderr] 8 | pub fn display_table(orders: Vec<Vec<String>>) -> Vec<Vec<String>> {
[INFO] [stderr]   |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `count_pairs` is never used
[INFO] [stderr]  --> src/count_pairs.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub fn count_pairs(deliciousness: Vec<i32>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `num_subarrays_with_sum` is never used
[INFO] [stderr]  --> src/num_subarrays_with_sum.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | pub fn num_subarrays_with_sum(nums: Vec<i32>, goal: i32) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `majority_element` is never used
[INFO] [stderr]  --> src/majority_element.rs:4:8
[INFO] [stderr]   |
[INFO] [stderr] 4 | pub fn majority_element(nums: Vec<i32>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TimeMap` is never constructed
[INFO] [stderr]   --> src/time_map.rs:20:8
[INFO] [stderr]    |
[INFO] [stderr] 20 | struct TimeMap {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `set`, and `get` are never used
[INFO] [stderr]   --> src/time_map.rs:32:8
[INFO] [stderr]    |
[INFO] [stderr] 29 | impl TimeMap {
[INFO] [stderr]    | ------------ associated items in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 32 |     fn new() -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 38 |     fn set(&mut self, key: String, value: String, timestamp: i32) {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 45 |     fn get(&self, key: String, timestamp: i32) -> String {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `maximum_element_after_decrementing_and_rearranging` is never used
[INFO] [stderr]   --> src/maximum_element_after_decrementing_and_rearranging.rs:13:8
[INFO] [stderr]    |
[INFO] [stderr] 13 | pub fn maximum_element_after_decrementing_and_rearranging(arr: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `search` is never used
[INFO] [stderr]  --> src/search.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stderr]   |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `max_sub_array` is never used
[INFO] [stderr]  --> src/max_sub_array.rs:6:8
[INFO] [stderr]   |
[INFO] [stderr] 6 | pub fn max_sub_array(nums: Vec<i32>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `group_anagrams` is never used
[INFO] [stderr]  --> src/group_anagrams.rs:7:8
[INFO] [stderr]   |
[INFO] [stderr] 7 | pub fn group_anagrams(strs: Vec<String>) -> Vec<Vec<String>> {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `max_frequency` is never used
[INFO] [stderr]   --> src/max_frequency.rs:13:8
[INFO] [stderr]    |
[INFO] [stderr] 13 | pub fn max_frequency(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `min_pair_sum` is never used
[INFO] [stderr]   --> src/min_pair_sum.rs:13:8
[INFO] [stderr]    |
[INFO] [stderr] 13 | pub fn min_pair_sum(nums: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `is_covered` is never used
[INFO] [stderr]  --> src/is_covered.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 9 | pub fn is_covered(ranges: Vec<Vec<i32>>, left: i32, right: i32) -> bool {
[INFO] [stderr]   |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `min_operations` is never used
[INFO] [stderr]   --> src/min_operations.rs:16:8
[INFO] [stderr]    |
[INFO] [stderr] 16 | pub fn min_operations(target: Vec<i32>, arr: Vec<i32>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `TreeNode` is never constructed
[INFO] [stderr]  --> src/find_second_minimum_value.rs:9:12
[INFO] [stderr]   |
[INFO] [stderr] 9 | pub struct TreeNode {
[INFO] [stderr]   |            ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/find_second_minimum_value.rs:17:10
[INFO] [stderr]    |
[INFO] [stderr] 15 | impl TreeNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 16 |   #[inline]
[INFO] [stderr] 17 |   pub fn new(val: i32) -> Self {
[INFO] [stderr]    |          ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `find_second_minimum_value` is never used
[INFO] [stderr]   --> src/find_second_minimum_value.rs:30:8
[INFO] [stderr]    |
[INFO] [stderr] 30 | pub fn find_second_minimum_value(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `title_to_number` is never used
[INFO] [stderr]   --> src/title_to_number.rs:19:8
[INFO] [stderr]    |
[INFO] [stderr] 19 | pub fn title_to_number(column_title: String) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `k_weakest_rows` is never used
[INFO] [stderr]  --> src/k_weakest_rows.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 9 | pub fn k_weakest_rows(mat: Vec<Vec<i32>>, k: i32) -> Vec<i32> {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `tribonacci` is never used
[INFO] [stderr]  --> src/tribonacci.rs:7:8
[INFO] [stderr]   |
[INFO] [stderr] 7 | pub fn tribonacci(n: i32) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `number_of_arithmetic_slices` is never used
[INFO] [stderr]  --> src/number_of_arithmetic_slices.rs:8:8
[INFO] [stderr]   |
[INFO] [stderr] 8 | pub fn number_of_arithmetic_slices(nums: Vec<i32>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `longest_palindrome_subseq` is never used
[INFO] [stderr]   --> src/longest_palindrome_subseq.rs:13:8
[INFO] [stderr]    |
[INFO] [stderr] 13 | pub fn longest_palindrome_subseq(s: String) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `check_record` is never used
[INFO] [stderr]   --> src/check_record.rs:15:8
[INFO] [stderr]    |
[INFO] [stderr] 15 | pub fn check_record(s: String) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `reverse_vowels` is never used
[INFO] [stderr]  --> src/reverse_vowels.rs:4:8
[INFO] [stderr]   |
[INFO] [stderr] 4 | pub fn reverse_vowels(mut s: String) -> String {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `reverse_str` is never used
[INFO] [stderr]  --> src/reverse_str.rs:6:8
[INFO] [stderr]   |
[INFO] [stderr] 6 | pub fn reverse_str(s: String, k: i32) -> String {
[INFO] [stderr]   |        ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `compress` is never used
[INFO] [stderr]   --> src/compress.rs:16:8
[INFO] [stderr]    |
[INFO] [stderr] 16 | pub fn compress(chars: &mut Vec<char>) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `running_sum` is never used
[INFO] [stderr]  --> src/running_sum.rs:7:8
[INFO] [stderr]   |
[INFO] [stderr] 7 | pub fn running_sum(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stderr]   |        ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `sum_odd_length_subarrays` is never used
[INFO] [stderr]  --> src/sum_odd_length_subarrays.rs:9:8
[INFO] [stderr]   |
[INFO] [stderr] 9 | pub fn sum_odd_length_subarrays(arr: Vec<i32>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `search` is never used
[INFO] [stderr]  --> src/search2.rs:6:8
[INFO] [stderr]   |
[INFO] [stderr] 6 | pub fn search(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stderr]   |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `search_matrix` is never used
[INFO] [stderr]   --> src/search_matrix.rs:13:8
[INFO] [stderr]    |
[INFO] [stderr] 13 | pub fn search_matrix(matrix: Vec<Vec<i32>>, target: i32) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `find_min_difference` is never used
[INFO] [stderr]  --> src/find_min_difference.rs:7:8
[INFO] [stderr]   |
[INFO] [stderr] 7 | pub fn find_min_difference(time_points: Vec<String>) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `contains_nearby_duplicate` is never used
[INFO] [stderr]   --> src/contains_nearby_duplicate.rs:26:8
[INFO] [stderr]    |
[INFO] [stderr] 26 | pub fn contains_nearby_duplicate(nums: Vec<i32>, k: i32) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `find_lu_slength` is never used
[INFO] [stderr]   --> src/find_lu_slength.rs:10:8
[INFO] [stderr]    |
[INFO] [stderr] 10 | pub fn find_lu_slength(a: String, b: String) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `convert_to_base7` is never used
[INFO] [stderr]  --> src/convert_to_base7.rs:2:8
[INFO] [stderr]   |
[INFO] [stderr] 2 | pub fn convert_to_base7(num: i32) -> String {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `plus_one` is never used
[INFO] [stderr]  --> src/plus_one.rs:7:8
[INFO] [stderr]   |
[INFO] [stderr] 7 | pub fn plus_one(mut digits: Vec<i32>) -> Vec<i32> {
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `leetcode` (lib) generated 43 warnings
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.06s
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/leetcode-1d1c5491a7efd8ae)
[INFO] [stdout] 
[INFO] [stdout] running 130 tests
[INFO] [stdout] test change_ii::change_0 ... ok
[INFO] [stdout] test check_record::check_record_t0 ... ok
[INFO] [stdout] test check_record::check_record_t2 ... ok
[INFO] [stdout] test combination_sum::tests::test_combination_sum0 ... ok
[INFO] [stdout] test combination_sum::tests::test_combination_sum3 ... ok
[INFO] [stdout] test combination_sum::tests::test_combination_sum2 ... ok
[INFO] [stdout] test compress::compress_t1 ... ok
[INFO] [stdout] test compress::compress_t2 ... ok
[INFO] [stdout] test contains_nearby_duplicate::contains_nearby_duplicate_t0 ... ok
[INFO] [stdout] test convert_to_base7::convert_to_base7_t0 ... ok
[INFO] [stdout] test change_ii::change_2 ... ok
[INFO] [stdout] test convert_to_title::convert_to_title_t0 ... ok
[INFO] [stdout] test convert_to_title::convert_to_title_t1 ... ok
[INFO] [stdout] test convert_to_title::convert_to_title_t2 ... ok
[INFO] [stdout] test combination_sum::tests::test_combination_sum4 ... ok
[INFO] [stdout] test compress::compress_t0 ... ok
[INFO] [stdout] test convert_to_title::convert_to_title_t3 ... ok
[INFO] [stdout] test add_two_numbers::test_add_two_numbers ... ok
[INFO] [stdout] test count_pairs::count_pairs_t0 ... ok
[INFO] [stdout] test combination_sum::tests::test_combination_sum1 ... ok
[INFO] [stdout] test count_pairs::count_pairs_t1 ... ok
[INFO] [stdout] test check_record::check_record_t1 ... ok
[INFO] [stdout] test find_error_nums::find_error_nums_t0 ... ok
[INFO] [stdout] test find_error_nums::find_error_nums_t1 ... ok
[INFO] [stdout] test display_table::display_table_t0 ... ok
[INFO] [stdout] test change_ii::change_1 ... ok
[INFO] [stdout] test find_lu_slength::find_lu_slength_0 ... ok
[INFO] [stdout] test find_max_length::find_max_length_test0 ... ok
[INFO] [stdout] test find_max_length::find_max_length_test1 ... ok
[INFO] [stdout] test find_min_difference::find_min_difference_t3 ... ok
[INFO] [stdout] test find_second_minimum_value::find_second_minimum_value_t0 ... ok
[INFO] [stdout] test find_target_sum_ways::find_target_sum_ways_0 ... ok
[INFO] [stdout] test find_median_sorted_arrays::test_find_median_sorted_arrays ... ok
[INFO] [stdout] test frequency_sort::frequency_sort_t2 ... ok
[INFO] [stdout] test group_anagrams::group_anagrams_t0 ... ok
[INFO] [stdout] test find_min_difference::find_min_difference_t0 ... ok
[INFO] [stdout] test is_covered::is_covered_t0 ... ok
[INFO] [stdout] test k_weakest_rows::k_weakest_rows_t0 ... ok
[INFO] [stdout] test last_stone_weight_ii::last_stone_weight_ii_1 ... ok
[INFO] [stdout] test frequency_sort::frequency_sort_t0 ... ok
[INFO] [stdout] test frequency_sort::frequency_sort_t1 ... ok
[INFO] [stdout] test is_covered::is_covered_t1 ... ok
[INFO] [stdout] test last_stone_weight_ii::last_stone_weight_ii_2 ... ok
[INFO] [stdout] test length_of_longest_substring::test_length_of_longest_substring ... ok
[INFO] [stdout] test longest_palindrome_subseq::longest_palindrome_subseq_t0 ... ok
[INFO] [stdout] test longest_palindrome::test_longest_palindrome ... ok
[INFO] [stdout] test majority_element::majority_element_t0 ... ok
[INFO] [stdout] test majority_element::majority_element_t1 ... ok
[INFO] [stdout] test majority_element::majority_element_t2 ... ok
[INFO] [stdout] test majority_element::majority_element_t3 ... ok
[INFO] [stdout] test longest_palindrome_subseq::longest_palindrome_subseq_t1 ... ok
[INFO] [stdout] test last_stone_weight_ii::last_stone_weight_ii_0 ... ok
[INFO] [stdout] test max_frequency::max_frequency_t0 ... ok
[INFO] [stdout] test max_frequency::max_frequency_t1 ... ok
[INFO] [stdout] test max_frequency::max_frequency_t2 ... ok
[INFO] [stdout] test find_min_difference::find_min_difference_t2 ... ok
[INFO] [stdout] test find_error_nums::find_error_nums_t2 ... ok
[INFO] [stdout] test find_min_difference::find_min_difference_t1 ... ok
[INFO] [stdout] test convert_to_base7::convert_to_base7_t1 ... ok
[INFO] [stdout] test max_ice_cream::max_ice_cream_t1 ... ok
[INFO] [stdout] test max_ice_cream::max_ice_cream_t0 ... ok
[INFO] [stdout] test maximum_element_after_decrementing_and_rearranging::maximum_element_after_decrementing_and_rearranging_t0 ... ok
[INFO] [stdout] test max_sub_array::max_sub_array_t0 ... ok
[INFO] [stdout] test maximum_element_after_decrementing_and_rearranging::maximum_element_after_decrementing_and_rearranging_t3 ... ok
[INFO] [stdout] test min_operations::min_operations_t0 ... ok
[INFO] [stdout] test min_operations::min_operations_t2 ... ok
[INFO] [stdout] test maximum_element_after_decrementing_and_rearranging::maximum_element_after_decrementing_and_rearranging_t2 ... ok
[INFO] [stdout] test maximum_element_after_decrementing_and_rearranging::maximum_element_after_decrementing_and_rearranging_t1 ... ok
[INFO] [stdout] test min_operations::min_operations_t1 ... ok
[INFO] [stdout] test num_squares::num_squares_0 ... ok
[INFO] [stdout] test num_subarrays_with_sum::num_subarrays_with_sum_t0 ... ok
[INFO] [stdout] test num_squares::num_squares_1 ... ok
[INFO] [stdout] test num_ways::num_ways_t0 ... ok
[INFO] [stdout] test num_ways::num_ways_t1 ... ok
[INFO] [stdout] test number_of_arithmetic_slices::number_of_arithmetic_slices_t1 ... ok
[INFO] [stdout] test peak_index_in_mountain_array::peak_index_in_mountain_array_t0 ... ok
[INFO] [stdout] test num_squares::num_squares_3 ... ok
[INFO] [stdout] test min_pair_sum::min_pair_sum_t1 ... ok
[INFO] [stdout] test num_subarrays_with_sum::num_subarrays_with_sum_t1 ... ok
[INFO] [stdout] test num_squares::num_squares_2 ... ok
[INFO] [stdout] test number_of_arithmetic_slices::number_of_arithmetic_slices_t0 ... ok
[INFO] [stdout] test peak_index_in_mountain_array::peak_index_in_mountain_array_t2 ... ok
[INFO] [stdout] test peak_index_in_mountain_array::peak_index_in_mountain_array_t1 ... ok
[INFO] [stdout] test num_squares::num_squares_5 ... ok
[INFO] [stdout] test peak_index_in_mountain_array::peak_index_in_mountain_array_t3 ... ok
[INFO] [stdout] test profitable_schemes::profitable_schemes_0 ... ok
[INFO] [stdout] test plus_one::plus_one_t1 ... ok
[INFO] [stdout] test last_stone_weight_ii::last_stone_weight_ii_3 ... ok
[INFO] [stdout] test plus_one::plus_one_t0 ... ok
[INFO] [stdout] test permutation::permutation_t0 ... ok
[INFO] [stdout] test profitable_schemes::profitable_schemes_4 ... ok
[INFO] [stdout] test reverse_str::reverse_str_t1 ... ok
[INFO] [stdout] test profitable_schemes::profitable_schemes_2 ... ok
[INFO] [stdout] test min_pair_sum::min_pair_sum_t0 ... ok
[INFO] [stdout] test reverse_str::reverse_str_t0 ... ok
[INFO] [stdout] test reverse_integer::test_reverse_integer ... ok
[INFO] [stdout] test profitable_schemes::profitable_schemes_1 ... ok
[INFO] [stdout] test running_sum::running_sum_t1 ... ok
[INFO] [stdout] test search2::search_t0 ... ok
[INFO] [stdout] test reverse_vowels::reverse_vowels_t0 ... ok
[INFO] [stdout] test running_sum::running_sum_t2 ... ok
[INFO] [stdout] test search_matrix::search_matrix_t1 ... ok
[INFO] [stdout] test stone_game::stone_game_t0 ... ok
[INFO] [stdout] test sum_odd_length_subarrays::sum_odd_length_subarrays_t0 ... ok
[INFO] [stdout] test sum_odd_length_subarrays::sum_odd_length_subarrays_t1 ... ok
[INFO] [stdout] test running_sum::running_sum_t0 ... ok
[INFO] [stdout] test reverse_vowels::reverse_vowels_t1 ... ok
[INFO] [stdout] test search::search_t0 ... ok
[INFO] [stdout] test longest_palindrome_subseq::longest_palindrome_subseq_t2 ... ok
[INFO] [stdout] test sum_odd_length_subarrays::sum_odd_length_subarrays_t2 ... ok
[INFO] [stdout] test time_map::test_t0 ... ok
[INFO] [stdout] test search2::search_t1 ... ok
[INFO] [stdout] test title_to_number::title_to_number_t1 ... ok
[INFO] [stdout] test title_to_number::title_to_number_t0 ... ok
[INFO] [stdout] test title_to_number::title_to_number_t3 ... ok
[INFO] [stdout] test tribonacci::tribonacci_t0 ... ok
[INFO] [stdout] test two_sum::test_two_sum ... ok
[INFO] [stdout] test title_to_number::title_to_number_t2 ... ok
[INFO] [stdout] test zigzag_convert::test_zigzag_convert ... ok
[INFO] [stdout] test tribonacci::tribonacci_t1 ... ok
[INFO] [stdout] test search::search_t1 ... ok
[INFO] [stdout] test search_matrix::search_matrix_t0 ... ok
[INFO] [stdout] test min_pair_sum::min_pair_sum_t2 ... ok
[INFO] [stdout] test find_max_length::find_max_length_test2 ... ok
[INFO] [stdout] test open_lock::open_lock_t0 ... ok
[INFO] [stdout] test num_squares::num_squares_4 ... ok
[INFO] [stdout] test profitable_schemes::profitable_schemes_3 ... ok
[INFO] [stdout] test count_pairs::count_pairs_t2 ... ok
[INFO] [stdout] test profitable_schemes::profitable_schemes_5 ... ok
[INFO] [stdout] test count_pairs::count_pairs_t3 ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 130 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 1.30s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests leetcode
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] running `Command { std: "docker" "inspect" "e9de8a5937e0b8781479d7f4fd24452eba35f8f4277772fbe635fab198b2d314", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "e9de8a5937e0b8781479d7f4fd24452eba35f8f4277772fbe635fab198b2d314", kill_on_drop: false }`
[INFO] [stdout] e9de8a5937e0b8781479d7f4fd24452eba35f8f4277772fbe635fab198b2d314
