[INFO] cloning repository https://github.com/huaikong2020/algorithm-journey-rs
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/huaikong2020/algorithm-journey-rs" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fhuaikong2020%2Falgorithm-journey-rs", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fhuaikong2020%2Falgorithm-journey-rs'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] b32e40e0aaac228b40e1da8ccd003f41badf30d9
[INFO] checking huaikong2020/algorithm-journey-rs against master#8365fcb2b840c95eeb0bc377af8bd498fad22245 for pr-145604
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fhuaikong2020%2Falgorithm-journey-rs" "/workspace/builds/worker-1-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-1-tc1/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/huaikong2020/algorithm-journey-rs
[INFO] finished tweaking git repo https://github.com/huaikong2020/algorithm-journey-rs
[INFO] tweaked toml for git repo https://github.com/huaikong2020/algorithm-journey-rs written to /workspace/builds/worker-1-tc1/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/huaikong2020/algorithm-journey-rs on toolchain 8365fcb2b840c95eeb0bc377af8bd498fad22245
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+8365fcb2b840c95eeb0bc377af8bd498fad22245" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/huaikong2020/algorithm-journey-rs 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" "+8365fcb2b840c95eeb0bc377af8bd498fad22245" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:7ad1b28ee6f5f7f699f6cf7015098d6ccdd96d6f2d78dd06228f5b4c9faf309c" "/opt/rustwide/cargo-home/bin/cargo" "+8365fcb2b840c95eeb0bc377af8bd498fad22245" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] a6eca53a39742780c4bddb6db8cc15b8350896fd71a7241eddf3e55dd2d21f59
[INFO] running `Command { std: "docker" "start" "-a" "a6eca53a39742780c4bddb6db8cc15b8350896fd71a7241eddf3e55dd2d21f59", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "a6eca53a39742780c4bddb6db8cc15b8350896fd71a7241eddf3e55dd2d21f59", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "a6eca53a39742780c4bddb6db8cc15b8350896fd71a7241eddf3e55dd2d21f59", kill_on_drop: false }`
[INFO] [stdout] a6eca53a39742780c4bddb6db8cc15b8350896fd71a7241eddf3e55dd2d21f59
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:7ad1b28ee6f5f7f699f6cf7015098d6ccdd96d6f2d78dd06228f5b4c9faf309c" "/opt/rustwide/cargo-home/bin/cargo" "+8365fcb2b840c95eeb0bc377af8bd498fad22245" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] df5b11533b461624c6a4f5e5cb03066a72e9507d3fdbfba43a59f22fc48e9621
[INFO] running `Command { std: "docker" "start" "-a" "df5b11533b461624c6a4f5e5cb03066a72e9507d3fdbfba43a59f22fc48e9621", kill_on_drop: false }`
[INFO] [stderr]    Compiling proc-macro2 v1.0.95
[INFO] [stderr]    Compiling unicode-ident v1.0.18
[INFO] [stderr]     Checking stable_deref_trait v1.2.0
[INFO] [stderr]     Checking writeable v0.6.1
[INFO] [stderr]     Checking litemap v0.8.0
[INFO] [stderr]    Compiling icu_properties_data v2.0.1
[INFO] [stderr]    Compiling icu_normalizer_data v2.0.0
[INFO] [stderr]    Compiling libc v0.2.174
[INFO] [stderr]    Compiling zerocopy v0.8.26
[INFO] [stderr]     Checking cfg-if v1.0.1
[INFO] [stderr]     Checking smallvec v1.15.1
[INFO] [stderr]     Checking utf8_iter v1.0.4
[INFO] [stderr]     Checking percent-encoding v2.3.1
[INFO] [stderr]     Checking form_urlencoded v1.2.1
[INFO] [stderr]    Compiling quote v1.0.40
[INFO] [stderr]    Compiling syn v2.0.104
[INFO] [stderr]     Checking getrandom v0.2.16
[INFO] [stderr]     Checking rand_core v0.6.4
[INFO] [stderr]     Checking ppv-lite86 v0.2.21
[INFO] [stderr]     Checking rand_chacha v0.3.1
[INFO] [stderr]     Checking rand v0.8.5
[INFO] [stderr]    Compiling synstructure v0.13.2
[INFO] [stderr]    Compiling zerofrom-derive v0.1.6
[INFO] [stderr]    Compiling yoke-derive v0.8.0
[INFO] [stderr]    Compiling zerovec-derive v0.11.1
[INFO] [stderr]    Compiling displaydoc v0.2.5
[INFO] [stderr]     Checking zerofrom v0.1.6
[INFO] [stderr]     Checking yoke v0.8.0
[INFO] [stderr]     Checking zerovec v0.11.2
[INFO] [stderr]     Checking zerotrie v0.2.2
[INFO] [stderr]     Checking tinystr v0.8.1
[INFO] [stderr]     Checking potential_utf v0.1.2
[INFO] [stderr]     Checking icu_collections v2.0.0
[INFO] [stderr]     Checking icu_locale_core v2.0.0
[INFO] [stderr]     Checking icu_provider v2.0.0
[INFO] [stderr]     Checking icu_normalizer v2.0.0
[INFO] [stderr]     Checking icu_properties v2.0.1
[INFO] [stderr]     Checking idna_adapter v1.2.1
[INFO] [stderr]     Checking idna v1.0.3
[INFO] [stderr]     Checking url v2.5.4
[INFO] [stderr]     Checking algorithm-journey v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused imports: `BTreeSet` and `HashSet`
[INFO] [stdout]  --> src/class025/hashset_hashmap.rs:1:24
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::{BTreeSet, HashMap, HashSet};
[INFO] [stdout]   |                        ^^^^^^^^           ^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `min_idx` is never read
[INFO] [stdout]   --> src/class004/select_bubble_insert.rs:41:13
[INFO] [stdout]    |
[INFO] [stdout] 41 |     let mut min_idx = 0;
[INFO] [stdout]    |             ^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `min_idx` is never read
[INFO] [stdout]   --> src/class004/select_bubble_insert.rs:41:13
[INFO] [stdout]    |
[INFO] [stdout] 41 |     let mut min_idx = 0;
[INFO] [stdout]    |             ^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n5`
[INFO] [stdout]   --> src/class006/test_rc.rs:36:13
[INFO] [stdout]    |
[INFO] [stdout] 36 |         let n5 = Node::new(5);
[INFO] [stdout]    |             ^^ help: if this is intentional, prefix it with an underscore: `_n5`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `nn`
[INFO] [stdout]   --> src/class006/test_rc.rs:37:13
[INFO] [stdout]    |
[INFO] [stdout] 37 |         let nn = n1.get_next().unwrap();
[INFO] [stdout]    |             ^^ help: if this is intentional, prefix it with an underscore: `_nn`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `next` is never read
[INFO] [stdout]   --> src/class009/linked_list.rs:30:13
[INFO] [stdout]    |
[INFO] [stdout] 30 |     let mut next = 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 `next` is never read
[INFO] [stdout]   --> src/class009/linked_list.rs:30:13
[INFO] [stdout]    |
[INFO] [stdout] 30 |     let mut next = 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/class017/binary_tree.rs:98:13
[INFO] [stdout]    |
[INFO] [stdout] 98 |         let mut root = build();
[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: value assigned to `best` is never read
[INFO] [stdout]  --> src/class025/heap_sort.rs:9:13
[INFO] [stdout]   |
[INFO] [stdout] 9 |     let mut best = l;
[INFO] [stdout]   |             ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `best` is never read
[INFO] [stdout]  --> src/class025/heap_sort.rs:9:13
[INFO] [stdout]   |
[INFO] [stdout] 9 |     let mut best = l;
[INFO] [stdout]   |             ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `i`
[INFO] [stdout]    --> src/class025/heap_sort.rs:140:13
[INFO] [stdout]     |
[INFO] [stdout] 140 |         for i in 0..10 {
[INFO] [stdout]     |             ^ help: if this is intentional, prefix it with an underscore: `_i`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `value` is never read
[INFO] [stdout]  --> src/class006/test_rc.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Node {
[INFO] [stdout]   |        ---- field in this struct
[INFO] [stdout] 5 |     value: i32,
[INFO] [stdout]   |     ^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `Node` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `value` is never read
[INFO] [stdout]  --> src/class006/test_refcell.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Node {
[INFO] [stdout]   |        ---- field in this struct
[INFO] [stdout] 5 |     value: i32,
[INFO] [stdout]   |     ^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `Node` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `print_binary` is never used
[INFO] [stdout]  --> src/class003/binary_system.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn print_binary(num: i32) {
[INFO] [stdout]   |    ^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/class009/linked_list.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct ListNode {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/class009/linked_list.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     fn new(val: i32) -> Self {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_list` is never used
[INFO] [stdout]   --> src/class009/linked_list.rs:28:4
[INFO] [stdout]    |
[INFO] [stdout] 28 | fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MinStack` is never constructed
[INFO] [stdout]  --> src/class013/min_stack.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct MinStack {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `get_min` are never used
[INFO] [stdout]   --> src/class013/min_stack.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl MinStack {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout]  9 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn push(&mut self, val: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn pop(&mut self) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn top(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 37 |     fn get_min(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `main` is never used
[INFO] [stdout]   --> src/class013/min_stack.rs:48:4
[INFO] [stdout]    |
[INFO] [stdout] 48 | fn main() {
[INFO] [stdout]    |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `print_pairs` is never used
[INFO] [stdout]   --> src/class013/min_stack.rs:69:4
[INFO] [stdout]    |
[INFO] [stdout] 69 | fn print_pairs(pair: (Cow<str>, Cow<str>)) {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `show_cow` is never used
[INFO] [stdout]   --> src/class013/min_stack.rs:73:4
[INFO] [stdout]    |
[INFO] [stdout] 73 | fn show_cow(cow: Cow<str>) -> String {
[INFO] [stdout]    |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyCircularQueue` is never constructed
[INFO] [stdout]  --> src/class013/queue_stack.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct MyCircularQueue {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]   --> src/class013/queue_stack.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl MyCircularQueue {
[INFO] [stdout]    | -------------------- associated items in this implementation
[INFO] [stdout]  9 |     fn new(k: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn en_queue(&mut self, value: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 24 |     fn de_queue(&mut self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn front(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn rear(&self) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 46 |     fn is_empty(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     fn is_full(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyQueue` is never constructed
[INFO] [stdout]   --> src/class013/queue_stack.rs:55:8
[INFO] [stdout]    |
[INFO] [stdout] 55 | struct MyQueue {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `peek`, and `empty` are never used
[INFO] [stdout]   --> src/class013/queue_stack.rs:60:8
[INFO] [stdout]    |
[INFO] [stdout] 59 | impl MyQueue {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout] 60 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 66 |     fn push(&mut self, x: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 70 |     fn pop(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 78 |     fn peek(&self) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 86 |     fn empty(&self) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyStack` is never constructed
[INFO] [stdout]   --> src/class013/queue_stack.rs:91:8
[INFO] [stdout]    |
[INFO] [stdout] 91 | struct MyStack {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `empty` are never used
[INFO] [stdout]    --> src/class013/queue_stack.rs:96:8
[INFO] [stdout]     |
[INFO] [stdout]  95 | impl MyStack {
[INFO] [stdout]     | ------------ associated items in this implementation
[INFO] [stdout]  96 |     fn new() -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 102 |     fn push(&mut self, x: i32) {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 106 |     fn pop(&mut self) -> i32 {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 114 |     fn top(&self) -> i32 {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 122 |     fn empty(&self) -> bool {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `return_true` is never used
[INFO] [stdout]  --> src/class003/binary_system.rs:8:4
[INFO] [stdout]   |
[INFO] [stdout] 8 | fn return_true() -> bool {
[INFO] [stdout]   |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `return_false` is never used
[INFO] [stdout]   --> src/class003/binary_system.rs:13:4
[INFO] [stdout]    |
[INFO] [stdout] 13 | fn return_false() -> bool {
[INFO] [stdout]    |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `swap` is never used
[INFO] [stdout]  --> src/class004/select_bubble_insert.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn swap(arr: &mut [i32], i: usize, j: usize) {
[INFO] [stdout]   |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bubble_sort` is never used
[INFO] [stdout]  --> src/class004/select_bubble_insert.rs:7:4
[INFO] [stdout]   |
[INFO] [stdout] 7 | fn bubble_sort(arr: &mut [i32]) {
[INFO] [stdout]   |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `insert_sort` is never used
[INFO] [stdout]   --> src/class004/select_bubble_insert.rs:21:4
[INFO] [stdout]    |
[INFO] [stdout] 21 | fn insert_sort(arr: &mut [i32]) {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `select_sort` is never used
[INFO] [stdout]   --> src/class004/select_bubble_insert.rs:36:4
[INFO] [stdout]    |
[INFO] [stdout] 36 | fn select_sort(arr: &mut [i32]) {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `exist` is never used
[INFO] [stdout]  --> src/class006/binary_search.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn exist(arr: &[i32], target: i32) -> bool {
[INFO] [stdout]   |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_left` is never used
[INFO] [stdout]   --> src/class006/binary_search.rs:21:4
[INFO] [stdout]    |
[INFO] [stdout] 21 | fn find_left(arr: &[i32], target: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_peak` is never used
[INFO] [stdout]   --> src/class006/binary_search.rs:40:4
[INFO] [stdout]    |
[INFO] [stdout] 40 | fn find_peak(arr: &[i32]) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `MINI_STRING_MAX_LEN` is never used
[INFO] [stdout]  --> src/class006/mystring.rs:2:7
[INFO] [stdout]   |
[INFO] [stdout] 2 | const MINI_STRING_MAX_LEN: usize = 30;
[INFO] [stdout]   |       ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MiniString` is never constructed
[INFO] [stdout]  --> src/class006/mystring.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct MiniString {
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/class006/mystring.rs:9:8
[INFO] [stdout]   |
[INFO] [stdout] 8 | impl MiniString {
[INFO] [stdout]   | --------------- associated function in this implementation
[INFO] [stdout] 9 |     fn new(v: impl AsRef<str>) -> Self {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: enum `MyString` is never used
[INFO] [stdout]   --> src/class006/mystring.rs:35:6
[INFO] [stdout]    |
[INFO] [stdout] 35 | enum MyString {
[INFO] [stdout]    |      ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> src/class006/test_rc.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Node {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `set_next`, and `get_next` are never used
[INFO] [stdout]   --> src/class006/test_rc.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Node {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 10 |     fn new(value: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     fn set_next(&mut self, next: Option<Rc<Node>>) {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn get_next(&self) -> Option<Rc<Node>> {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> src/class006/test_refcell.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Node {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `set_next`, and `get_next` are never used
[INFO] [stdout]   --> src/class006/test_refcell.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Node {
[INFO] [stdout]    | --------- associated items in this implementation
[INFO] [stdout] 10 |     fn new(value: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     fn set_next(&mut self, next: Option<Rc<RefCell<Node>>>) {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn get_next(&self) -> Option<Rc<RefCell<Node>>> {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/class009/linked_list.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct ListNode {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]  --> src/class009/linked_list.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 6 | impl ListNode {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 7 |     fn new(val: i32) -> Self {
[INFO] [stdout]   |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_list` is never used
[INFO] [stdout]   --> src/class009/linked_list.rs:28:4
[INFO] [stdout]    |
[INFO] [stdout] 28 | fn reverse_list(head: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MinStack` is never constructed
[INFO] [stdout]  --> src/class013/min_stack.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct MinStack {
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `get_min` are never used
[INFO] [stdout]   --> src/class013/min_stack.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl MinStack {
[INFO] [stdout]    | ------------- associated items in this implementation
[INFO] [stdout]  9 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn push(&mut self, val: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn pop(&mut self) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 30 |     fn top(&self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 37 |     fn get_min(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `main` is never used
[INFO] [stdout]   --> src/class013/min_stack.rs:48:4
[INFO] [stdout]    |
[INFO] [stdout] 48 | fn main() {
[INFO] [stdout]    |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `print_pairs` is never used
[INFO] [stdout]   --> src/class013/min_stack.rs:69:4
[INFO] [stdout]    |
[INFO] [stdout] 69 | fn print_pairs(pair: (Cow<str>, Cow<str>)) {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `show_cow` is never used
[INFO] [stdout]   --> src/class013/min_stack.rs:73:4
[INFO] [stdout]    |
[INFO] [stdout] 73 | fn show_cow(cow: Cow<str>) -> String {
[INFO] [stdout]    |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyCircularQueue` is never constructed
[INFO] [stdout]  --> src/class013/queue_stack.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct MyCircularQueue {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]   --> src/class013/queue_stack.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl MyCircularQueue {
[INFO] [stdout]    | -------------------- associated items in this implementation
[INFO] [stdout]  9 |     fn new(k: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 16 |     fn en_queue(&mut self, value: i32) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 24 |     fn de_queue(&mut self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn front(&self) -> i32 {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |     fn rear(&self) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 46 |     fn is_empty(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 50 |     fn is_full(&self) -> bool {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyQueue` is never constructed
[INFO] [stdout]   --> src/class013/queue_stack.rs:55:8
[INFO] [stdout]    |
[INFO] [stdout] 55 | struct MyQueue {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `peek`, and `empty` are never used
[INFO] [stdout]   --> src/class013/queue_stack.rs:60:8
[INFO] [stdout]    |
[INFO] [stdout] 59 | impl MyQueue {
[INFO] [stdout]    | ------------ associated items in this implementation
[INFO] [stdout] 60 |     fn new() -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 66 |     fn push(&mut self, x: i32) {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 70 |     fn pop(&mut self) -> i32 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 78 |     fn peek(&self) -> i32 {
[INFO] [stdout]    |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 86 |     fn empty(&self) -> bool {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyStack` is never constructed
[INFO] [stdout]   --> src/class013/queue_stack.rs:91:8
[INFO] [stdout]    |
[INFO] [stdout] 91 | struct MyStack {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push`, `pop`, `top`, and `empty` are never used
[INFO] [stdout]    --> src/class013/queue_stack.rs:96:8
[INFO] [stdout]     |
[INFO] [stdout]  95 | impl MyStack {
[INFO] [stdout]     | ------------ associated items in this implementation
[INFO] [stdout]  96 |     fn new() -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 102 |     fn push(&mut self, x: i32) {
[INFO] [stdout]     |        ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 106 |     fn pop(&mut self) -> i32 {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 114 |     fn top(&self) -> i32 {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 122 |     fn empty(&self) -> bool {
[INFO] [stdout]     |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyCircularDeque` is never constructed
[INFO] [stdout]    --> src/class013/queue_stack.rs:127:8
[INFO] [stdout]     |
[INFO] [stdout] 127 | struct MyCircularDeque {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/class013/queue_stack.rs:133:8
[INFO] [stdout]     |
[INFO] [stdout] 132 | impl MyCircularDeque {
[INFO] [stdout]     | -------------------- associated items in this implementation
[INFO] [stdout] 133 |     fn new(k: i32) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 140 |     fn insert_front(&mut self, value: i32) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 148 |     fn insert_last(&mut self, value: i32) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 156 |     fn delete_front(&mut self) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 164 |     fn delete_last(&mut self) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 172 |     fn get_front(&self) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 179 |     fn get_rear(&self) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 186 |     fn is_empty(&self) -> bool {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 190 |     fn is_full(&self) -> bool {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `pre_order` is never used
[INFO] [stdout]   --> src/class017/binary_tree.rs:30:4
[INFO] [stdout]    |
[INFO] [stdout] 30 | fn pre_order(root: Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_kth_largest` is never used
[INFO] [stdout]   --> src/class023/quick_sort.rs:47:4
[INFO] [stdout]    |
[INFO] [stdout] 47 | fn find_kth_largest(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `swap` is never used
[INFO] [stdout]  --> src/class025/heap_sort.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn swap(arr: &mut [i32], i: usize, j: usize) {
[INFO] [stdout]   |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heapify` is never used
[INFO] [stdout]  --> src/class025/heap_sort.rs:7:4
[INFO] [stdout]   |
[INFO] [stdout] 7 | fn heapify(arr: &mut [i32], size: usize, i: usize) {
[INFO] [stdout]   |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heap_insert` is never used
[INFO] [stdout]   --> src/class025/heap_sort.rs:26:4
[INFO] [stdout]    |
[INFO] [stdout] 26 | fn heap_insert(arr: &mut [i32], i: usize) {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heap_sort` is never used
[INFO] [stdout]   --> src/class025/heap_sort.rs:34:4
[INFO] [stdout]    |
[INFO] [stdout] 34 | fn heap_sort(arr: &mut [i32]) {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sort_array` is never used
[INFO] [stdout]   --> src/class025/heap_sort.rs:46:4
[INFO] [stdout]    |
[INFO] [stdout] 46 | fn sort_array(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `halve_array` is never used
[INFO] [stdout]   --> src/class025/heap_sort.rs:95:4
[INFO] [stdout]    |
[INFO] [stdout] 95 | fn halve_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/class025/merge_sorted_lists.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/class025/merge_sorted_lists.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout]  9 |     #[inline]
[INFO] [stdout] 10 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_k_lists` is never used
[INFO] [stdout]   --> src/class025/merge_sorted_lists.rs:18:4
[INFO] [stdout]    |
[INFO] [stdout] 18 | fn merge_k_lists(lists: Vec<Option<Box<ListNode>>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `single_number` is never used
[INFO] [stdout]  --> src/class030/xor.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn single_number(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `single_number1` is never used
[INFO] [stdout]   --> src/class030/xor.rs:18:4
[INFO] [stdout]    |
[INFO] [stdout] 18 | fn single_number1(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find` is never used
[INFO] [stdout]   --> src/class030/xor.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn find(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `MyCircularDeque` is never constructed
[INFO] [stdout]    --> src/class013/queue_stack.rs:127:8
[INFO] [stdout]     |
[INFO] [stdout] 127 | struct MyCircularDeque {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> src/class013/queue_stack.rs:133:8
[INFO] [stdout]     |
[INFO] [stdout] 132 | impl MyCircularDeque {
[INFO] [stdout]     | -------------------- associated items in this implementation
[INFO] [stdout] 133 |     fn new(k: i32) -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 140 |     fn insert_front(&mut self, value: i32) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 148 |     fn insert_last(&mut self, value: i32) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 156 |     fn delete_front(&mut self) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 164 |     fn delete_last(&mut self) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 172 |     fn get_front(&self) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 179 |     fn get_rear(&self) -> i32 {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 186 |     fn is_empty(&self) -> bool {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 190 |     fn is_full(&self) -> bool {
[INFO] [stdout]     |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `TreeNode` is never constructed
[INFO] [stdout]  --> src/class017/binary_tree.rs:4:12
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct TreeNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/class017/binary_tree.rs:12:12
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl TreeNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     #[inline]
[INFO] [stdout] 12 |     pub fn new(val: i32) -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `build` is never used
[INFO] [stdout]   --> src/class017/binary_tree.rs:21:4
[INFO] [stdout]    |
[INFO] [stdout] 21 | fn build() -> TreeNode {
[INFO] [stdout]    |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `pre_order` is never used
[INFO] [stdout]   --> src/class017/binary_tree.rs:30:4
[INFO] [stdout]    |
[INFO] [stdout] 30 | fn pre_order(root: Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `pre_order_iterative` is never used
[INFO] [stdout]   --> src/class017/binary_tree.rs:41:4
[INFO] [stdout]    |
[INFO] [stdout] 41 | fn pre_order_iterative(root: Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `in_order_iterative` is never used
[INFO] [stdout]   --> src/class017/binary_tree.rs:55:4
[INFO] [stdout]    |
[INFO] [stdout] 55 | fn in_order_iterative(root: Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `pos_order_two_stacks` is never used
[INFO] [stdout]   --> src/class017/binary_tree.rs:71:4
[INFO] [stdout]    |
[INFO] [stdout] 71 | fn pos_order_two_stacks(root: Option<Rc<RefCell<TreeNode>>>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]  --> src/class021/merge_sort.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn merge(l: usize, m: usize, r: usize, arr: &mut [i32]) {
[INFO] [stdout]   |    ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_sort` is never used
[INFO] [stdout]   --> src/class021/merge_sort.rs:27:4
[INFO] [stdout]    |
[INFO] [stdout] 27 | fn merge_sort(l: usize, r: usize, arr: &mut [i32]) {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge1` is never used
[INFO] [stdout]   --> src/class021/merge_sort.rs:37:4
[INFO] [stdout]    |
[INFO] [stdout] 37 | fn merge1(l: usize, m: usize, r: usize, arr: &mut [i32]) -> i32 {
[INFO] [stdout]    |    ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `small_sum` is never used
[INFO] [stdout]   --> src/class021/merge_sort.rs:52:4
[INFO] [stdout]    |
[INFO] [stdout] 52 | fn small_sum(l: usize, r: usize, arr: &mut [i32]) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge2` is never used
[INFO] [stdout]   --> src/class021/merge_sort.rs:65:4
[INFO] [stdout]    |
[INFO] [stdout] 65 | fn merge2(l: usize, m: usize, r: usize, arr: &mut [i32]) -> i32 {
[INFO] [stdout]    |    ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_pairs1` is never used
[INFO] [stdout]   --> src/class021/merge_sort.rs:78:4
[INFO] [stdout]    |
[INFO] [stdout] 78 | fn reverse_pairs1(l: usize, r: usize, arr: &mut [i32]) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `reverse_pairs` is never used
[INFO] [stdout]   --> src/class021/merge_sort.rs:90:4
[INFO] [stdout]    |
[INFO] [stdout] 90 | fn reverse_pairs(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `swap` is never used
[INFO] [stdout]  --> src/class023/quick_sort.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn swap(arr: &mut [i32], i: usize, j: usize) {
[INFO] [stdout]   |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `partition` is never used
[INFO] [stdout]  --> src/class023/quick_sort.rs:9:4
[INFO] [stdout]   |
[INFO] [stdout] 9 | fn partition(arr: &mut [i32], low: usize, high: usize, x: i32) -> (i32, i32) {
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `quick_sort` is never used
[INFO] [stdout]   --> src/class023/quick_sort.rs:28:4
[INFO] [stdout]    |
[INFO] [stdout] 28 | fn quick_sort(arr: &mut [i32], low: i32, high: i32) {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sort_array` is never used
[INFO] [stdout]   --> src/class023/quick_sort.rs:39:4
[INFO] [stdout]    |
[INFO] [stdout] 39 | fn sort_array(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find_kth_largest` is never used
[INFO] [stdout]   --> src/class023/quick_sort.rs:47:4
[INFO] [stdout]    |
[INFO] [stdout] 47 | fn find_kth_largest(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Person` is never constructed
[INFO] [stdout]  --> src/class025/hashset_hashmap.rs:4:8
[INFO] [stdout]   |
[INFO] [stdout] 4 | struct Person {
[INFO] [stdout]   |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/class025/hashset_hashmap.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout]  9 | impl Person {
[INFO] [stdout]    | ----------- associated function in this implementation
[INFO] [stdout] 10 |     fn new(name: String, age: u8) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `explain` is never used
[INFO] [stdout]    --> src/class025/hashset_hashmap.rs:100:4
[INFO] [stdout]     |
[INFO] [stdout] 100 | fn explain<K, V>(name: &str, map: &HashMap<K, V>) {
[INFO] [stdout]     |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `swap` is never used
[INFO] [stdout]  --> src/class025/heap_sort.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn swap(arr: &mut [i32], i: usize, j: usize) {
[INFO] [stdout]   |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heapify` is never used
[INFO] [stdout]  --> src/class025/heap_sort.rs:7:4
[INFO] [stdout]   |
[INFO] [stdout] 7 | fn heapify(arr: &mut [i32], size: usize, i: usize) {
[INFO] [stdout]   |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heap_insert` is never used
[INFO] [stdout]   --> src/class025/heap_sort.rs:26:4
[INFO] [stdout]    |
[INFO] [stdout] 26 | fn heap_insert(arr: &mut [i32], i: usize) {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heap_sort` is never used
[INFO] [stdout]   --> src/class025/heap_sort.rs:34:4
[INFO] [stdout]    |
[INFO] [stdout] 34 | fn heap_sort(arr: &mut [i32]) {
[INFO] [stdout]    |    ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sort_array` is never used
[INFO] [stdout]   --> src/class025/heap_sort.rs:46:4
[INFO] [stdout]    |
[INFO] [stdout] 46 | fn sort_array(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heap_sort1` is never used
[INFO] [stdout]   --> src/class025/heap_sort.rs:53:4
[INFO] [stdout]    |
[INFO] [stdout] 53 | fn heap_sort1(arr: &mut [i32]) {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heap_sort2` is never used
[INFO] [stdout]   --> src/class025/heap_sort.rs:64:4
[INFO] [stdout]    |
[INFO] [stdout] 64 | fn heap_sort2(arr: &mut [i32]) {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `min_groups` is never used
[INFO] [stdout]   --> src/class025/heap_sort.rs:76:4
[INFO] [stdout]    |
[INFO] [stdout] 76 | fn min_groups(intervals: Vec<Vec<i32>>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `halve_array` is never used
[INFO] [stdout]   --> src/class025/heap_sort.rs:95:4
[INFO] [stdout]    |
[INFO] [stdout] 95 | fn halve_array(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `ListNode` is never constructed
[INFO] [stdout]  --> src/class025/merge_sorted_lists.rs:3:12
[INFO] [stdout]   |
[INFO] [stdout] 3 | pub struct ListNode {
[INFO] [stdout]   |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/class025/merge_sorted_lists.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout]  8 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout]  9 |     #[inline]
[INFO] [stdout] 10 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_k_lists` is never used
[INFO] [stdout]   --> src/class025/merge_sorted_lists.rs:18:4
[INFO] [stdout]    |
[INFO] [stdout] 18 | fn merge_k_lists(lists: Vec<Option<Box<ListNode>>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `single_number` is never used
[INFO] [stdout]  --> src/class030/xor.rs:2:4
[INFO] [stdout]   |
[INFO] [stdout] 2 | fn single_number(nums: Vec<i32>) -> Vec<i32> {
[INFO] [stdout]   |    ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `single_number1` is never used
[INFO] [stdout]   --> src/class030/xor.rs:18:4
[INFO] [stdout]    |
[INFO] [stdout] 18 | fn single_number1(nums: Vec<i32>) -> i32 {
[INFO] [stdout]    |    ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `find` is never used
[INFO] [stdout]   --> src/class030/xor.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn find(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 11.64s
[INFO] running `Command { std: "docker" "inspect" "df5b11533b461624c6a4f5e5cb03066a72e9507d3fdbfba43a59f22fc48e9621", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "df5b11533b461624c6a4f5e5cb03066a72e9507d3fdbfba43a59f22fc48e9621", kill_on_drop: false }`
[INFO] [stdout] df5b11533b461624c6a4f5e5cb03066a72e9507d3fdbfba43a59f22fc48e9621