[INFO] updating cached repository https://github.com/dev-chee/learn-leetcode [INFO] running `"git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "-c" "remote.origin.fetch=refs/heads/*:refs/heads/*" "fetch" "origin" "--force" "--prune"` [INFO] running `"git" "rev-parse" "HEAD"` [INFO] [stdout] 40d075e9e1fffc2c08041238ba472ab1dd0ec205 [INFO] checking dev-chee/learn-leetcode against master#45d050cde277b22a755847338f2acc2c7b834141 for pr-71393 [INFO] running `"git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fdev-chee%2Flearn-leetcode" "/workspace/builds/worker-13/source"` [INFO] [stderr] Cloning into '/workspace/builds/worker-13/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/dev-chee/learn-leetcode on toolchain 45d050cde277b22a755847338f2acc2c7b834141 [INFO] running `"/workspace/cargo-home/bin/cargo" "+45d050cde277b22a755847338f2acc2c7b834141" "read-manifest" "--manifest-path" "Cargo.toml"` [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-13/source/Cargo.toml [INFO] running `"/workspace/cargo-home/bin/cargo" "+45d050cde277b22a755847338f2acc2c7b834141" "generate-lockfile" "--manifest-path" "Cargo.toml" "-Zno-index-update"` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] running `"/workspace/cargo-home/bin/cargo" "+45d050cde277b22a755847338f2acc2c7b834141" "fetch" "--locked" "--manifest-path" "Cargo.toml"` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] running `"docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-13/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-13/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" "MAP_USER_ID=0" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--network" "none" "rustops/crates-build-env" "/opt/rustwide/cargo-home/bin/cargo" "+45d050cde277b22a755847338f2acc2c7b834141" "check" "--frozen" "--all" "--all-targets"` [INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap. [INFO] [stdout] d745ee0735fad4a176080d38d83713badecb538046b57a28f1d7aa9d0c9164e0 [INFO] running `"docker" "start" "-a" "d745ee0735fad4a176080d38d83713badecb538046b57a28f1d7aa9d0c9164e0"` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Checking getrandom v0.1.14 [INFO] [stderr] Checking rand_core v0.5.1 [INFO] [stderr] Checking rand_chacha v0.2.2 [INFO] [stderr] Checking rand v0.7.3 [INFO] [stderr] Checking learn-leetcode v0.1.0 (/opt/rustwide/workdir) [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: 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: 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(values: &[T], target: &T) -> Option [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(values: &[T]) -> Option 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(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(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, 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, Vec) { [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, Vec) { [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: method is never used: `new` [INFO] [stderr] --> src/example_2.rs:26:5 [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>, l2: Option>) -> Option> { [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>) -> Option { [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>, val: i32) -> &mut Option> { [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, nums2: Vec) -> 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, y: Vec) -> (Vec, Vec) { [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] 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: method is never used: `new` [INFO] [stderr] --> src/example_2.rs:26:5 [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] Finished dev [unoptimized + debuginfo] target(s) in 4.05s [INFO] running `"docker" "inspect" "d745ee0735fad4a176080d38d83713badecb538046b57a28f1d7aa9d0c9164e0"` [INFO] running `"docker" "rm" "-f" "d745ee0735fad4a176080d38d83713badecb538046b57a28f1d7aa9d0c9164e0"` [INFO] [stdout] d745ee0735fad4a176080d38d83713badecb538046b57a28f1d7aa9d0c9164e0