[INFO] cloning repository https://github.com/dev-chee/learn-leetcode
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/dev-chee/learn-leetcode" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fdev-chee%2Flearn-leetcode", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fdev-chee%2Flearn-leetcode'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 40d075e9e1fffc2c08041238ba472ab1dd0ec205
[INFO] testing dev-chee/learn-leetcode against 1.47.0 for beta-1.48-1
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fdev-chee%2Flearn-leetcode" "/workspace/builds/worker-14/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-14/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/dev-chee/learn-leetcode on toolchain 1.47.0
[INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+1.47.0" "read-manifest" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/dev-chee/learn-leetcode
[INFO] finished tweaking git repo https://github.com/dev-chee/learn-leetcode
[INFO] tweaked toml for git repo https://github.com/dev-chee/learn-leetcode written to /workspace/builds/worker-14/source/Cargo.toml
[INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+1.47.0" "generate-lockfile" "--manifest-path" "Cargo.toml" "-Zno-index-update", kill_on_drop: false }`
[INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+1.47.0" "fetch" "--locked" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-14/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-14/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" "rustops/crates-build-env@sha256:d92eaeed33fa75130ca1ee6c8a01d1ffb62bac859dfdfb3450e3e5d1c0146529" "/opt/rustwide/cargo-home/bin/cargo" "+1.47.0" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] db1dc892c4eb5929b1be6f3729cd40ad5e0aa6178f638c46dc7ae9531ecd792d
[INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap.
[INFO] running `Command { std: "docker" "start" "-a" "db1dc892c4eb5929b1be6f3729cd40ad5e0aa6178f638c46dc7ae9531ecd792d", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "db1dc892c4eb5929b1be6f3729cd40ad5e0aa6178f638c46dc7ae9531ecd792d", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "db1dc892c4eb5929b1be6f3729cd40ad5e0aa6178f638c46dc7ae9531ecd792d", kill_on_drop: false }`
[INFO] [stdout] db1dc892c4eb5929b1be6f3729cd40ad5e0aa6178f638c46dc7ae9531ecd792d
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-14/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-14/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "rustops/crates-build-env@sha256:d92eaeed33fa75130ca1ee6c8a01d1ffb62bac859dfdfb3450e3e5d1c0146529" "/opt/rustwide/cargo-home/bin/cargo" "+1.47.0" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 837f74d68c59faf43c349c0ab79e90b5ac0cea3ba0171bb65e3d457b5ceb3f80
[INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap.
[INFO] running `Command { std: "docker" "start" "-a" "837f74d68c59faf43c349c0ab79e90b5ac0cea3ba0171bb65e3d457b5ceb3f80", kill_on_drop: false }`
[INFO] [stderr]    Compiling libc v0.2.79
[INFO] [stderr]    Compiling getrandom v0.1.15
[INFO] [stderr]    Compiling rand_core v0.5.1
[INFO] [stderr]    Compiling rand_chacha v0.2.2
[INFO] [stderr]    Compiling rand v0.7.3
[INFO] [stderr]    Compiling learn-leetcode v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `std::iter::Take`
[INFO] [stdout]   --> src/example_3.rs:28:5
[INFO] [stdout]    |
[INFO] [stdout] 28 | use std::iter::Take;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::cmp`
[INFO] [stdout]   --> src/example_6.rs:35:5
[INFO] [stdout]    |
[INFO] [stdout] 35 | use std::cmp;
[INFO] [stdout]    |     ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `result_next` is never read
[INFO] [stdout]   --> src/example_2.rs:71:17
[INFO] [stdout]    |
[INFO] [stdout] 71 |                 result_next = append_node(result_next, 1);
[INFO] [stdout]    |                 ^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `result` is never read
[INFO] [stdout]   --> src/example_2.rs:89:9
[INFO] [stdout]    |
[INFO] [stdout] 89 |     let mut result = None;
[INFO] [stdout]    |         ^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/algorithms/heap_sort.rs:30:9
[INFO] [stdout]    |
[INFO] [stdout] 30 |     let mut len = heap.len();
[INFO] [stdout]    |         ----^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `binary_search`
[INFO] [stdout]  --> src/algorithms/binary_search.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn binary_search<T>(values: &[T], target: &T) -> Option<usize>
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `find_min`
[INFO] [stdout]  --> src/algorithms/selection_sort.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn find_min<T>(values: &[T]) -> Option<usize> where T: PartialOrd {
[INFO] [stdout]   |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `selection_sort`
[INFO] [stdout]   --> src/algorithms/selection_sort.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn selection_sort<T>(values: &mut [T]) -> bool where T: PartialOrd
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `insertion_sort`
[INFO] [stdout]  --> src/algorithms/insertion_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn insertion_sort<T>(values: &mut [T]) where T: PartialOrd
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_heapify`
[INFO] [stdout]  --> src/algorithms/heap_sort.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn max_heapify(heap: &mut [i32], i: usize) {
[INFO] [stdout]   |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `build_max_heap`
[INFO] [stdout]   --> src/algorithms/heap_sort.rs:21:4
[INFO] [stdout]    |
[INFO] [stdout] 21 | fn build_max_heap(heap: &mut [i32]) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `heap_sort`
[INFO] [stdout]   --> src/algorithms/heap_sort.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | pub fn heap_sort(heap: &mut [i32]) {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `quick_sort`
[INFO] [stdout]  --> src/algorithms/quick_sort.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn quick_sort(values: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `rshift`
[INFO] [stdout]   --> src/algorithms/quick_sort.rs:27:4
[INFO] [stdout]    |
[INFO] [stdout] 27 | fn rshift(values: &mut [i32], idx: usize) {
[INFO] [stdout]    |    ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `gcd`
[INFO] [stdout]  --> src/algorithms/gcd.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn gcd(x: i32, y: i32) -> i32 {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `find_max_crossing_sub_array`
[INFO] [stdout]  --> src/algorithms/max_sub_array.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn find_max_crossing_sub_array(values: &[i32], low: usize, mid: usize, high: usize)
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `find_max_sub_array`
[INFO] [stdout]   --> src/algorithms/max_sub_array.rs:33:8
[INFO] [stdout]    |
[INFO] [stdout] 33 | pub fn find_max_sub_array(values: &[i32], low: usize, high: usize)
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `heap_max`
[INFO] [stdout]  --> src/algorithms/priority_heap.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn heap_max(heap: &[i32]) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `heap_extract_max`
[INFO] [stdout]  --> src/algorithms/priority_heap.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn heap_extract_max(heap: &mut [i32]) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `heap_increase_key`
[INFO] [stdout]   --> src/algorithms/priority_heap.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | pub fn heap_increase_key(heap: &mut [i32], idx: usize, key: i32) -> Result<(), &'static str> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_heap_insert`
[INFO] [stdout]   --> src/algorithms/priority_heap.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | pub fn max_heap_insert(heap: &mut Vec<i32>, key: i32) -> Result<(), &'static str> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_heapify`
[INFO] [stdout]   --> src/algorithms/priority_heap.rs:40:4
[INFO] [stdout]    |
[INFO] [stdout] 40 | fn max_heapify(heap: &mut [i32], idx: usize) {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `cut_rod`
[INFO] [stdout]  --> src/algorithms/cut_rod.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn cut_rod(p: &[i32], n: usize) -> i32 {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `memorized_cut_rod`
[INFO] [stdout]   --> src/algorithms/cut_rod.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn memorized_cut_rod(p: &[i32], n: usize) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `memorized_cut_rod_aux`
[INFO] [stdout]   --> src/algorithms/cut_rod.rs:34:4
[INFO] [stdout]    |
[INFO] [stdout] 34 | fn memorized_cut_rod_aux(p: &[i32], n: usize, r: &mut [i32]) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `bottom_up_cut_rod`
[INFO] [stdout]   --> src/algorithms/cut_rod.rs:50:8
[INFO] [stdout]    |
[INFO] [stdout] 50 | pub fn bottom_up_cut_rod(p: &[i32], n: usize) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `extended_bottom_up_cut_rod`
[INFO] [stdout]   --> src/algorithms/cut_rod.rs:79:8
[INFO] [stdout]    |
[INFO] [stdout] 79 | pub fn extended_bottom_up_cut_rod(p: &[i32], n: usize) -> (Vec<i32>, Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `lcs_length`
[INFO] [stdout]  --> src/algorithms/lcs.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn lcs_length(x: &[char], y: &[char]) -> (Vec<char>, Vec<i32>) {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `two_sum`
[INFO] [stdout]   --> src/example_1.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub fn two_sum(nums: &[i32], target: i32) -> Option<(usize, usize)> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> src/example_2.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `add_two_numbers`
[INFO] [stdout]   --> src/example_2.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | pub 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 is never used: `next_node`
[INFO] [stdout]   --> src/example_2.rs:88:4
[INFO] [stdout]    |
[INFO] [stdout] 88 | fn next_node(list: &mut &Option<Box<ListNode>>) -> Option<i32> {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `append_node`
[INFO] [stdout]    --> src/example_2.rs:104:4
[INFO] [stdout]     |
[INFO] [stdout] 104 | fn append_node(list: &mut Option<Box<ListNode>>, val: i32) -> &mut Option<Box<ListNode>> {
[INFO] [stdout]     |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `length_of_longest_substring_1`
[INFO] [stdout]   --> src/example_3.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub fn length_of_longest_substring_1(s: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `all_unique`
[INFO] [stdout]   --> src/example_3.rs:46:4
[INFO] [stdout]    |
[INFO] [stdout] 46 | fn all_unique(string: &[char]) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `length_of_longest_substring_2`
[INFO] [stdout]   --> src/example_3.rs:62:8
[INFO] [stdout]    |
[INFO] [stdout] 62 | pub fn length_of_longest_substring_2(s: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `length_of_longest_substring_3`
[INFO] [stdout]   --> src/example_3.rs:84:8
[INFO] [stdout]    |
[INFO] [stdout] 84 | pub fn length_of_longest_substring_3(s: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `find_median_sorted_arrays`
[INFO] [stdout]   --> src/example_4.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `swap_if_greater`
[INFO] [stdout]   --> src/example_4.rs:71:4
[INFO] [stdout]    |
[INFO] [stdout] 71 | fn swap_if_greater(x: Vec<i32>, y: Vec<i32>) -> (Vec<i32>, Vec<i32>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `longest_palindrome`
[INFO] [stdout]   --> src/example_5.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn longest_palindrome(s: String) -> String {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `expand_around`
[INFO] [stdout]   --> src/example_5.rs:45:4
[INFO] [stdout]    |
[INFO] [stdout] 45 | fn expand_around(chars: &[char], range: (usize, usize)) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `convert`
[INFO] [stdout]   --> src/example_6.rs:38:8
[INFO] [stdout]    |
[INFO] [stdout] 38 | pub fn convert(s: String, num_rows: i32) -> String {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `convert_2`
[INFO] [stdout]   --> src/example_6.rs:81:8
[INFO] [stdout]    |
[INFO] [stdout] 81 | pub fn convert_2(s: String, num_rows: i32) -> String {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `reverse`
[INFO] [stdout]   --> src/example_7.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub fn reverse(x: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `my_atoi`
[INFO] [stdout]   --> src/example_8.rs:55:8
[INFO] [stdout]    |
[INFO] [stdout] 55 | pub fn my_atoi(str: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_palindrome`
[INFO] [stdout]   --> src/example_9.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | pub fn is_palindrome(x: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 46 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished dev [unoptimized + debuginfo] target(s) in 5.52s
[INFO] running `Command { std: "docker" "inspect" "837f74d68c59faf43c349c0ab79e90b5ac0cea3ba0171bb65e3d457b5ceb3f80", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "837f74d68c59faf43c349c0ab79e90b5ac0cea3ba0171bb65e3d457b5ceb3f80", kill_on_drop: false }`
[INFO] [stdout] 837f74d68c59faf43c349c0ab79e90b5ac0cea3ba0171bb65e3d457b5ceb3f80
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-14/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-14/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "rustops/crates-build-env@sha256:d92eaeed33fa75130ca1ee6c8a01d1ffb62bac859dfdfb3450e3e5d1c0146529" "/opt/rustwide/cargo-home/bin/cargo" "+1.47.0" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 38a187a8cd44fab4f1850053378e03f7b36ad0093968e14df3a1f0e0fcba2d73
[INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap.
[INFO] running `Command { std: "docker" "start" "-a" "38a187a8cd44fab4f1850053378e03f7b36ad0093968e14df3a1f0e0fcba2d73", kill_on_drop: false }`
[INFO] [stderr]    Compiling learn-leetcode v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `std::iter::Take`
[INFO] [stdout]   --> src/example_3.rs:28:5
[INFO] [stdout]    |
[INFO] [stdout] 28 | use std::iter::Take;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::cmp`
[INFO] [stdout]   --> src/example_6.rs:35:5
[INFO] [stdout]    |
[INFO] [stdout] 35 | use std::cmp;
[INFO] [stdout]    |     ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `result_next` is never read
[INFO] [stdout]   --> src/example_2.rs:71:17
[INFO] [stdout]    |
[INFO] [stdout] 71 |                 result_next = append_node(result_next, 1);
[INFO] [stdout]    |                 ^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `result` is never read
[INFO] [stdout]   --> src/example_2.rs:89:9
[INFO] [stdout]    |
[INFO] [stdout] 89 |     let mut result = None;
[INFO] [stdout]    |         ^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/algorithms/heap_sort.rs:30:9
[INFO] [stdout]    |
[INFO] [stdout] 30 |     let mut len = heap.len();
[INFO] [stdout]    |         ----^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `binary_search`
[INFO] [stdout]  --> src/algorithms/binary_search.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn binary_search<T>(values: &[T], target: &T) -> Option<usize>
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `find_min`
[INFO] [stdout]  --> src/algorithms/selection_sort.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn find_min<T>(values: &[T]) -> Option<usize> where T: PartialOrd {
[INFO] [stdout]   |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `selection_sort`
[INFO] [stdout]   --> src/algorithms/selection_sort.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn selection_sort<T>(values: &mut [T]) -> bool where T: PartialOrd
[INFO] [stdout]    |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `insertion_sort`
[INFO] [stdout]  --> src/algorithms/insertion_sort.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn insertion_sort<T>(values: &mut [T]) where T: PartialOrd
[INFO] [stdout]   |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_heapify`
[INFO] [stdout]  --> src/algorithms/heap_sort.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn max_heapify(heap: &mut [i32], i: usize) {
[INFO] [stdout]   |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `build_max_heap`
[INFO] [stdout]   --> src/algorithms/heap_sort.rs:21:4
[INFO] [stdout]    |
[INFO] [stdout] 21 | fn build_max_heap(heap: &mut [i32]) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `heap_sort`
[INFO] [stdout]   --> src/algorithms/heap_sort.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | pub fn heap_sort(heap: &mut [i32]) {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `quick_sort`
[INFO] [stdout]  --> src/algorithms/quick_sort.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn quick_sort(values: &mut [i32]) {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `rshift`
[INFO] [stdout]   --> src/algorithms/quick_sort.rs:27:4
[INFO] [stdout]    |
[INFO] [stdout] 27 | fn rshift(values: &mut [i32], idx: usize) {
[INFO] [stdout]    |    ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `gcd`
[INFO] [stdout]  --> src/algorithms/gcd.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub fn gcd(x: i32, y: i32) -> i32 {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `find_max_crossing_sub_array`
[INFO] [stdout]  --> src/algorithms/max_sub_array.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn find_max_crossing_sub_array(values: &[i32], low: usize, mid: usize, high: usize)
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `find_max_sub_array`
[INFO] [stdout]   --> src/algorithms/max_sub_array.rs:33:8
[INFO] [stdout]    |
[INFO] [stdout] 33 | pub fn find_max_sub_array(values: &[i32], low: usize, high: usize)
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `heap_max`
[INFO] [stdout]  --> src/algorithms/priority_heap.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | pub fn heap_max(heap: &[i32]) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `heap_extract_max`
[INFO] [stdout]  --> src/algorithms/priority_heap.rs:5:8
[INFO] [stdout]   |
[INFO] [stdout] 5 | pub fn heap_extract_max(heap: &mut [i32]) -> i32 {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `heap_increase_key`
[INFO] [stdout]   --> src/algorithms/priority_heap.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 15 | pub fn heap_increase_key(heap: &mut [i32], idx: usize, key: i32) -> Result<(), &'static str> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_heap_insert`
[INFO] [stdout]   --> src/algorithms/priority_heap.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | pub fn max_heap_insert(heap: &mut Vec<i32>, key: i32) -> Result<(), &'static str> {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `max_heapify`
[INFO] [stdout]   --> src/algorithms/priority_heap.rs:40:4
[INFO] [stdout]    |
[INFO] [stdout] 40 | fn max_heapify(heap: &mut [i32], idx: usize) {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `cut_rod`
[INFO] [stdout]  --> src/algorithms/cut_rod.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub fn cut_rod(p: &[i32], n: usize) -> i32 {
[INFO] [stdout]   |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `memorized_cut_rod`
[INFO] [stdout]   --> src/algorithms/cut_rod.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn memorized_cut_rod(p: &[i32], n: usize) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `memorized_cut_rod_aux`
[INFO] [stdout]   --> src/algorithms/cut_rod.rs:34:4
[INFO] [stdout]    |
[INFO] [stdout] 34 | fn memorized_cut_rod_aux(p: &[i32], n: usize, r: &mut [i32]) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `bottom_up_cut_rod`
[INFO] [stdout]   --> src/algorithms/cut_rod.rs:50:8
[INFO] [stdout]    |
[INFO] [stdout] 50 | pub fn bottom_up_cut_rod(p: &[i32], n: usize) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `extended_bottom_up_cut_rod`
[INFO] [stdout]   --> src/algorithms/cut_rod.rs:79:8
[INFO] [stdout]    |
[INFO] [stdout] 79 | pub fn extended_bottom_up_cut_rod(p: &[i32], n: usize) -> (Vec<i32>, Vec<i32>) {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `lcs_length`
[INFO] [stdout]  --> src/algorithms/lcs.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn lcs_length(x: &[char], y: &[char]) -> (Vec<char>, Vec<i32>) {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `two_sum`
[INFO] [stdout]   --> src/example_1.rs:18:8
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub fn two_sum(nums: &[i32], target: i32) -> Option<(usize, usize)> {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> src/example_2.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `add_two_numbers`
[INFO] [stdout]   --> src/example_2.rs:34:8
[INFO] [stdout]    |
[INFO] [stdout] 34 | pub 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 is never used: `next_node`
[INFO] [stdout]   --> src/example_2.rs:88:4
[INFO] [stdout]    |
[INFO] [stdout] 88 | fn next_node(list: &mut &Option<Box<ListNode>>) -> Option<i32> {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `append_node`
[INFO] [stdout]    --> src/example_2.rs:104:4
[INFO] [stdout]     |
[INFO] [stdout] 104 | fn append_node(list: &mut Option<Box<ListNode>>, val: i32) -> &mut Option<Box<ListNode>> {
[INFO] [stdout]     |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `length_of_longest_substring_1`
[INFO] [stdout]   --> src/example_3.rs:30:8
[INFO] [stdout]    |
[INFO] [stdout] 30 | pub fn length_of_longest_substring_1(s: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `all_unique`
[INFO] [stdout]   --> src/example_3.rs:46:4
[INFO] [stdout]    |
[INFO] [stdout] 46 | fn all_unique(string: &[char]) -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `length_of_longest_substring_2`
[INFO] [stdout]   --> src/example_3.rs:62:8
[INFO] [stdout]    |
[INFO] [stdout] 62 | pub fn length_of_longest_substring_2(s: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `length_of_longest_substring_3`
[INFO] [stdout]   --> src/example_3.rs:84:8
[INFO] [stdout]    |
[INFO] [stdout] 84 | pub fn length_of_longest_substring_3(s: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `find_median_sorted_arrays`
[INFO] [stdout]   --> src/example_4.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `swap_if_greater`
[INFO] [stdout]   --> src/example_4.rs:71:4
[INFO] [stdout]    |
[INFO] [stdout] 71 | fn swap_if_greater(x: Vec<i32>, y: Vec<i32>) -> (Vec<i32>, Vec<i32>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `longest_palindrome`
[INFO] [stdout]   --> src/example_5.rs:21:8
[INFO] [stdout]    |
[INFO] [stdout] 21 | pub fn longest_palindrome(s: String) -> String {
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `expand_around`
[INFO] [stdout]   --> src/example_5.rs:45:4
[INFO] [stdout]    |
[INFO] [stdout] 45 | fn expand_around(chars: &[char], range: (usize, usize)) -> usize {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `convert`
[INFO] [stdout]   --> src/example_6.rs:38:8
[INFO] [stdout]    |
[INFO] [stdout] 38 | pub fn convert(s: String, num_rows: i32) -> String {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `convert_2`
[INFO] [stdout]   --> src/example_6.rs:81:8
[INFO] [stdout]    |
[INFO] [stdout] 81 | pub fn convert_2(s: String, num_rows: i32) -> String {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `reverse`
[INFO] [stdout]   --> src/example_7.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 | pub fn reverse(x: i32) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `my_atoi`
[INFO] [stdout]   --> src/example_8.rs:55:8
[INFO] [stdout]    |
[INFO] [stdout] 55 | pub fn my_atoi(str: String) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `is_palindrome`
[INFO] [stdout]   --> src/example_9.rs:27:8
[INFO] [stdout]    |
[INFO] [stdout] 27 | pub fn is_palindrome(x: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 46 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::iter::Take`
[INFO] [stdout]   --> src/example_3.rs:28:5
[INFO] [stdout]    |
[INFO] [stdout] 28 | use std::iter::Take;
[INFO] [stdout]    |     ^^^^^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::cmp`
[INFO] [stdout]   --> src/example_6.rs:35:5
[INFO] [stdout]    |
[INFO] [stdout] 35 | use std::cmp;
[INFO] [stdout]    |     ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `result_next` is never read
[INFO] [stdout]   --> src/example_2.rs:71:17
[INFO] [stdout]    |
[INFO] [stdout] 71 |                 result_next = append_node(result_next, 1);
[INFO] [stdout]    |                 ^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `result` is never read
[INFO] [stdout]   --> src/example_2.rs:89:9
[INFO] [stdout]    |
[INFO] [stdout] 89 |     let mut result = None;
[INFO] [stdout]    |         ^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `rlist` is never read
[INFO] [stdout]    --> src/example_2.rs:150:9
[INFO] [stdout]     |
[INFO] [stdout] 150 |         rlist = append_node(rlist, 3);
[INFO] [stdout]     |         ^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/algorithms/heap_sort.rs:30:9
[INFO] [stdout]    |
[INFO] [stdout] 30 |     let mut len = heap.len();
[INFO] [stdout]    |         ----^^^
[INFO] [stdout]    |         |
[INFO] [stdout]    |         help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> src/example_2.rs:26:8
[INFO] [stdout]    |
[INFO] [stdout] 26 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 7 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished test [unoptimized + debuginfo] target(s) in 1.71s
[INFO] running `Command { std: "docker" "inspect" "38a187a8cd44fab4f1850053378e03f7b36ad0093968e14df3a1f0e0fcba2d73", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "38a187a8cd44fab4f1850053378e03f7b36ad0093968e14df3a1f0e0fcba2d73", kill_on_drop: false }`
[INFO] [stdout] 38a187a8cd44fab4f1850053378e03f7b36ad0093968e14df3a1f0e0fcba2d73
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-14/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-14/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "rustops/crates-build-env@sha256:d92eaeed33fa75130ca1ee6c8a01d1ffb62bac859dfdfb3450e3e5d1c0146529" "/opt/rustwide/cargo-home/bin/cargo" "+1.47.0" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] efaccd61aa30a017faf9c7f5d435c19bf2602de16ec95bc3aa64add456033817
[INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap.
[INFO] running `Command { std: "docker" "start" "-a" "efaccd61aa30a017faf9c7f5d435c19bf2602de16ec95bc3aa64add456033817", kill_on_drop: false }`
[INFO] [stderr] warning: unused import: `std::iter::Take`
[INFO] [stderr]   --> src/example_3.rs:28:5
[INFO] [stderr]    |
[INFO] [stderr] 28 | use std::iter::Take;
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_imports)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::iter::Take`
[INFO] [stderr]   --> src/example_3.rs:28:5
[INFO] [stderr]    |
[INFO] [stderr] 28 | use std::iter::Take;
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_imports)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::cmp`
[INFO] [stderr]   --> src/example_6.rs:35:5
[INFO] [stderr]    |
[INFO] [stderr] 35 | use std::cmp;
[INFO] [stderr]    |     ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `result_next` is never read
[INFO] [stderr]   --> src/example_2.rs:71:17
[INFO] [stderr]    |
[INFO] [stderr] 71 |                 result_next = append_node(result_next, 1);
[INFO] [stderr]    |                 ^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_assignments)]` on by default
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `result` is never read
[INFO] [stderr]   --> src/example_2.rs:89:9
[INFO] [stderr]    |
[INFO] [stderr] 89 |     let mut result = None;
[INFO] [stderr]    |         ^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `rlist` is never read
[INFO] [stderr]    --> src/example_2.rs:150:9
[INFO] [stderr]     |
[INFO] [stderr] 150 |         rlist = append_node(rlist, 3);
[INFO] [stderr]     |         ^^^^^
[INFO] [stderr]     |
[INFO] [stderr]     = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/algorithms/heap_sort.rs:30:9
[INFO] [stderr]    |
[INFO] [stderr] 30 |     let mut len = heap.len();
[INFO] [stderr]    |         ----^^^
[INFO] [stderr]    |         |
[INFO] [stderr]    |         help: remove this `mut`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: associated function is never used: `new`
[INFO] [stderr]   --> src/example_2.rs:26:8
[INFO] [stderr]    |
[INFO] [stderr] 26 |     fn new(val: i32) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: 7 warnings emitted
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::cmp`
[INFO] [stderr]   --> src/example_6.rs:35:5
[INFO] [stderr]    |
[INFO] [stderr] 35 | use std::cmp;
[INFO] [stderr]    |     ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `result_next` is never read
[INFO] [stderr]   --> src/example_2.rs:71:17
[INFO] [stderr]    |
[INFO] [stderr] 71 |                 result_next = append_node(result_next, 1);
[INFO] [stderr]    |                 ^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_assignments)]` on by default
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `result` is never read
[INFO] [stderr]   --> src/example_2.rs:89:9
[INFO] [stderr]    |
[INFO] [stderr] 89 |     let mut result = None;
[INFO] [stderr]    |         ^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/algorithms/heap_sort.rs:30:9
[INFO] [stderr]    |
[INFO] [stderr] 30 |     let mut len = heap.len();
[INFO] [stderr]    |         ----^^^
[INFO] [stderr]    |         |
[INFO] [stderr]    |         help: remove this `mut`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `binary_search`
[INFO] [stderr]  --> src/algorithms/binary_search.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn binary_search<T>(values: &[T], target: &T) -> Option<usize>
[INFO] [stderr]   |        ^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `find_min`
[INFO] [stderr]  --> src/algorithms/selection_sort.rs:1:4
[INFO] [stderr]   |
[INFO] [stderr] 1 | fn find_min<T>(values: &[T]) -> Option<usize> where T: PartialOrd {
[INFO] [stderr]   |    ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `selection_sort`
[INFO] [stderr]   --> src/algorithms/selection_sort.rs:21:8
[INFO] [stderr]    |
[INFO] [stderr] 21 | pub fn selection_sort<T>(values: &mut [T]) -> bool where T: PartialOrd
[INFO] [stderr]    |        ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `insertion_sort`
[INFO] [stderr]  --> src/algorithms/insertion_sort.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn insertion_sort<T>(values: &mut [T]) where T: PartialOrd
[INFO] [stderr]   |        ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `max_heapify`
[INFO] [stderr]  --> src/algorithms/heap_sort.rs:1:4
[INFO] [stderr]   |
[INFO] [stderr] 1 | fn max_heapify(heap: &mut [i32], i: usize) {
[INFO] [stderr]   |    ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `build_max_heap`
[INFO] [stderr]   --> src/algorithms/heap_sort.rs:21:4
[INFO] [stderr]    |
[INFO] [stderr] 21 | fn build_max_heap(heap: &mut [i32]) {
[INFO] [stderr]    |    ^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `heap_sort`
[INFO] [stderr]   --> src/algorithms/heap_sort.rs:27:8
[INFO] [stderr]    |
[INFO] [stderr] 27 | pub fn heap_sort(heap: &mut [i32]) {
[INFO] [stderr]    |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `quick_sort`
[INFO] [stderr]  --> src/algorithms/quick_sort.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | pub fn quick_sort(values: &mut [i32]) {
[INFO] [stderr]   |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `rshift`
[INFO] [stderr]   --> src/algorithms/quick_sort.rs:27:4
[INFO] [stderr]    |
[INFO] [stderr] 27 | fn rshift(values: &mut [i32], idx: usize) {
[INFO] [stderr]    |    ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `gcd`
[INFO] [stderr]  --> src/algorithms/gcd.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | pub fn gcd(x: i32, y: i32) -> i32 {
[INFO] [stderr]   |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `find_max_crossing_sub_array`
[INFO] [stderr]  --> src/algorithms/max_sub_array.rs:1:4
[INFO] [stderr]   |
[INFO] [stderr] 1 | fn find_max_crossing_sub_array(values: &[i32], low: usize, mid: usize, high: usize)
[INFO] [stderr]   |    ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `find_max_sub_array`
[INFO] [stderr]   --> src/algorithms/max_sub_array.rs:33:8
[INFO] [stderr]    |
[INFO] [stderr] 33 | pub fn find_max_sub_array(values: &[i32], low: usize, high: usize)
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `heap_max`
[INFO] [stderr]  --> src/algorithms/priority_heap.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | pub fn heap_max(heap: &[i32]) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `heap_extract_max`
[INFO] [stderr]  --> src/algorithms/priority_heap.rs:5:8
[INFO] [stderr]   |
[INFO] [stderr] 5 | pub fn heap_extract_max(heap: &mut [i32]) -> i32 {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `heap_increase_key`
[INFO] [stderr]   --> src/algorithms/priority_heap.rs:15:8
[INFO] [stderr]    |
[INFO] [stderr] 15 | pub fn heap_increase_key(heap: &mut [i32], idx: usize, key: i32) -> Result<(), &'static str> {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `max_heap_insert`
[INFO] [stderr]   --> src/algorithms/priority_heap.rs:34:8
[INFO] [stderr]    |
[INFO] [stderr] 34 | pub fn max_heap_insert(heap: &mut Vec<i32>, key: i32) -> Result<(), &'static str> {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `max_heapify`
[INFO] [stderr]   --> src/algorithms/priority_heap.rs:40:4
[INFO] [stderr]    |
[INFO] [stderr] 40 | fn max_heapify(heap: &mut [i32], idx: usize) {
[INFO] [stderr]    |    ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `cut_rod`
[INFO] [stderr]  --> src/algorithms/cut_rod.rs:4:8
[INFO] [stderr]   |
[INFO] [stderr] 4 | pub fn cut_rod(p: &[i32], n: usize) -> i32 {
[INFO] [stderr]   |        ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `memorized_cut_rod`
[INFO] [stderr]   --> src/algorithms/cut_rod.rs:21:8
[INFO] [stderr]    |
[INFO] [stderr] 21 | pub fn memorized_cut_rod(p: &[i32], n: usize) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `memorized_cut_rod_aux`
[INFO] [stderr]   --> src/algorithms/cut_rod.rs:34:4
[INFO] [stderr]    |
[INFO] [stderr] 34 | fn memorized_cut_rod_aux(p: &[i32], n: usize, r: &mut [i32]) -> i32 {
[INFO] [stderr]    |    ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `bottom_up_cut_rod`
[INFO] [stderr]   --> src/algorithms/cut_rod.rs:50:8
[INFO] [stderr]    |
[INFO] [stderr] 50 | pub fn bottom_up_cut_rod(p: &[i32], n: usize) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `extended_bottom_up_cut_rod`
[INFO] [stderr]   --> src/algorithms/cut_rod.rs:79:8
[INFO] [stderr]    |
[INFO] [stderr] 79 | pub fn extended_bottom_up_cut_rod(p: &[i32], n: usize) -> (Vec<i32>, Vec<i32>) {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `lcs_length`
[INFO] [stderr]  --> src/algorithms/lcs.rs:3:4
[INFO] [stderr]   |
[INFO] [stderr] 3 | fn lcs_length(x: &[char], y: &[char]) -> (Vec<char>, Vec<i32>) {
[INFO] [stderr]   |    ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `two_sum`
[INFO] [stderr]   --> src/example_1.rs:18:8
[INFO] [stderr]    |
[INFO] [stderr] 18 | pub fn two_sum(nums: &[i32], target: i32) -> Option<(usize, usize)> {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function is never used: `new`
[INFO] [stderr]   --> src/example_2.rs:26:8
[INFO] [stderr]    |
[INFO] [stderr] 26 |     fn new(val: i32) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `add_two_numbers`
[INFO] [stderr]   --> src/example_2.rs:34:8
[INFO] [stderr]    |
[INFO] [stderr] 34 | pub fn add_two_numbers(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `next_node`
[INFO] [stderr]   --> src/example_2.rs:88:4
[INFO] [stderr]    |
[INFO] [stderr] 88 | fn next_node(list: &mut &Option<Box<ListNode>>) -> Option<i32> {
[INFO] [stderr]    |    ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `append_node`
[INFO] [stderr]    --> src/example_2.rs:104:4
[INFO] [stderr]     |
[INFO] [stderr] 104 | fn append_node(list: &mut Option<Box<ListNode>>, val: i32) -> &mut Option<Box<ListNode>> {
[INFO] [stderr]     |    ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `length_of_longest_substring_1`
[INFO] [stderr]   --> src/example_3.rs:30:8
[INFO] [stderr]    |
[INFO] [stderr] 30 | pub fn length_of_longest_substring_1(s: String) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `all_unique`
[INFO] [stderr]   --> src/example_3.rs:46:4
[INFO] [stderr]    |
[INFO] [stderr] 46 | fn all_unique(string: &[char]) -> bool {
[INFO] [stderr]    |    ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `length_of_longest_substring_2`
[INFO] [stderr]   --> src/example_3.rs:62:8
[INFO] [stderr]    |
[INFO] [stderr] 62 | pub fn length_of_longest_substring_2(s: String) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `length_of_longest_substring_3`
[INFO] [stderr]   --> src/example_3.rs:84:8
[INFO] [stderr]    |
[INFO] [stderr] 84 | pub fn length_of_longest_substring_3(s: String) -> i32 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `find_median_sorted_arrays`
[INFO] [stderr]   --> src/example_4.rs:27:8
[INFO] [stderr]    |
[INFO] [stderr] 27 | pub fn find_median_sorted_arrays(nums1: Vec<i32>, nums2: Vec<i32>) -> f64 {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `swap_if_greater`
[INFO] [stderr]   --> src/example_4.rs:71:4
[INFO] [stderr]    |
[INFO] [stderr] 71 | fn swap_if_greater(x: Vec<i32>, y: Vec<i32>) -> (Vec<i32>, Vec<i32>) {
[INFO] [stderr]    |    ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `longest_palindrome`
[INFO] [stderr]   --> src/example_5.rs:21:8
[INFO] [stderr]    |
[INFO] [stderr] 21 | pub fn longest_palindrome(s: String) -> String {
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `expand_around`
[INFO] [stderr]   --> src/example_5.rs:45:4
[INFO] [stderr]    |
[INFO] [stderr] 45 | fn expand_around(chars: &[char], range: (usize, usize)) -> usize {
[INFO] [stderr]    |    ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `convert`
[INFO] [stderr]   --> src/example_6.rs:38:8
[INFO] [stderr]    |
[INFO] [stderr] 38 | pub fn convert(s: String, num_rows: i32) -> String {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `convert_2`
[INFO] [stderr]   --> src/example_6.rs:81:8
[INFO] [stderr]    |
[INFO] [stderr] 81 | pub fn convert_2(s: String, num_rows: i32) -> String {
[INFO] [stderr]    |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `reverse`
[INFO] [stderr]   --> src/example_7.rs:26:8
[INFO] [stderr]    |
[INFO] [stderr] 26 | pub fn reverse(x: i32) -> i32 {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `my_atoi`
[INFO] [stderr]   --> src/example_8.rs:55:8
[INFO] [stderr]    |
[INFO] [stderr] 55 | pub fn my_atoi(str: String) -> i32 {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `is_palindrome`
[INFO] [stderr]   --> src/example_9.rs:27:8
[INFO] [stderr]    |
[INFO] [stderr] 27 | pub fn is_palindrome(x: i32) -> bool {
[INFO] [stderr]    |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: 46 warnings emitted
[INFO] [stderr] 
[INFO] [stderr]     Finished test [unoptimized + debuginfo] target(s) in 0.07s
[INFO] [stderr]      Running /opt/rustwide/target/debug/deps/learn_leetcode-75418169745f2d80
[INFO] [stdout] 
[INFO] [stdout] running 58 tests
[INFO] [stdout] test algorithms::gcd::tests::test ... ok
[INFO] [stdout] test algorithms::binary_search::tests::test ... ok
[INFO] [stdout] test algorithms::max_sub_array::tests::test ... ok
[INFO] [stderr]    Doc-tests learn-leetcode
[INFO] [stdout] test algorithms::cut_rod::tests::test ... ok
[INFO] [stdout] test algorithms::lcs::tests::test ... ok
[INFO] [stdout] test example_3::tests::test_1 ... ok
[INFO] [stdout] test example_3::tests::test_10 ... ok
[INFO] [stdout] test example_2::tests::test_next_node ... ok
[INFO] [stdout] test example_3::tests::test_11 ... ok
[INFO] [stdout] test example_3::tests::test_12 ... ok
[INFO] [stdout] test example_3::tests::test_2 ... ok
[INFO] [stdout] test example_3::tests::test_3 ... ok
[INFO] [stdout] test algorithms::selection_sort::tests::test ... ok
[INFO] [stdout] test algorithms::max_sub_array::tests::test_neg ... ok
[INFO] [stdout] test algorithms::heap_sort::tests::test_1 ... ok
[INFO] [stdout] test example_2::tests::test_1 ... ok
[INFO] [stdout] test example_2::tests::test_append_node ... ok
[INFO] [stdout] test algorithms::priority_heap::tests::test ... ok
[INFO] [stdout] test algorithms::heap_sort::tests::test ... ok
[INFO] [stdout] test algorithms::heap_sort::tests::test_3 ... ok
[INFO] [stdout] test algorithms::heap_sort::tests::test_2 ... ok
[INFO] [stdout] test example_4::tests::test_1 ... ok
[INFO] [stdout] test example_4::tests::test_3 ... ok
[INFO] [stdout] test example_4::tests::test_4 ... ok
[INFO] [stdout] test example_5::tests::test_1 ... ok
[INFO] [stdout] test example_5::tests::test_2 ... ok
[INFO] [stdout] test example_5::tests::test_6 ... ok
[INFO] [stdout] test example_3::tests::test_4 ... ok
[INFO] [stdout] test example_3::tests::test_5 ... ok
[INFO] [stdout] test example_5::tests::test_7 ... ok
[INFO] [stdout] test example_3::tests::test_6 ... ok
[INFO] [stdout] test example_6::tests::test_3 ... ok
[INFO] [stdout] test example_7::tests::test_2 ... ok
[INFO] [stdout] test example_7::tests::test_3 ... ok
[INFO] [stdout] test example_7::tests::test_4 ... ok
[INFO] [stdout] test example_8::tests::test_1 ... ok
[INFO] [stdout] test example_5::tests::test_3 ... ok
[INFO] [stdout] test example_8::tests::test_2 ... ok
[INFO] [stdout] test example_8::tests::test_3 ... ok
[INFO] [stdout] test example_3::tests::test_7 ... ok
[INFO] [stdout] test example_3::tests::test_8 ... ok
[INFO] [stdout] test example_8::tests::test_4 ... ok
[INFO] [stdout] test example_8::tests::test_5 ... ok
[INFO] [stdout] test example_3::tests::test_9 ... ok
[INFO] [stdout] test example_9::tests::test_1 ... ok
[INFO] [stdout] test example_9::tests::test_2 ... ok
[INFO] [stdout] test example_4::tests::test_2 ... ok
[INFO] [stdout] test example_5::tests::test_4 ... ok
[INFO] [stdout] test example_6::tests::test_1 ... ok
[INFO] [stdout] test example_9::tests::test_3 ... ok
[INFO] [stdout] test example_5::tests::test_5 ... ok
[INFO] [stdout] test example_6::tests::test_4 ... ok
[INFO] [stdout] test example_7::tests::test_1 ... ok
[INFO] [stdout] test example_6::tests::test_2 ... ok
[INFO] [stdout] test algorithms::insertion_sort::tests::test ... ok
[INFO] [stdout] test algorithms::priority_heap::tests::test2 ... ok
[INFO] [stdout] test algorithms::quick_sort::tests::test ... ok
[INFO] [stdout] test example_1::tests::test ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 58 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out
[INFO] [stdout] 
[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
[INFO] [stdout] 
[INFO] running `Command { std: "docker" "inspect" "efaccd61aa30a017faf9c7f5d435c19bf2602de16ec95bc3aa64add456033817", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "efaccd61aa30a017faf9c7f5d435c19bf2602de16ec95bc3aa64add456033817", kill_on_drop: false }`
[INFO] [stdout] efaccd61aa30a017faf9c7f5d435c19bf2602de16ec95bc3aa64add456033817
