[INFO] cloning repository https://github.com/serhat359/rust-codes
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/serhat359/rust-codes" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fserhat359%2Frust-codes", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fserhat359%2Frust-codes'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 09dcc30a9715df8958ce04038f9e72befafab4ad
[INFO] checking serhat359/rust-codes against try#0611f7de057c584b8771102fde7aed6c70c71d3b for pr-146440
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fserhat359%2Frust-codes" "/workspace/builds/worker-5-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-5-tc2/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/serhat359/rust-codes
[INFO] finished tweaking git repo https://github.com/serhat359/rust-codes
[INFO] tweaked toml for git repo https://github.com/serhat359/rust-codes written to /workspace/builds/worker-5-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/serhat359/rust-codes on toolchain 0611f7de057c584b8771102fde7aed6c70c71d3b
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+0611f7de057c584b8771102fde7aed6c70c71d3b" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/serhat359/rust-codes 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" "+0611f7de057c584b8771102fde7aed6c70c71d3b" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr] warning: `package.edition` is unspecified, defaulting to `2015` while the latest is `2024`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+0611f7de057c584b8771102fde7aed6c70c71d3b" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 4d55e43ee3deafb71b9587d500b79fd4831d9594dfaafdde969158851173f27f
[INFO] running `Command { std: "docker" "start" "-a" "4d55e43ee3deafb71b9587d500b79fd4831d9594dfaafdde969158851173f27f", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "4d55e43ee3deafb71b9587d500b79fd4831d9594dfaafdde969158851173f27f", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "4d55e43ee3deafb71b9587d500b79fd4831d9594dfaafdde969158851173f27f", kill_on_drop: false }`
[INFO] [stdout] 4d55e43ee3deafb71b9587d500b79fd4831d9594dfaafdde969158851173f27f
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+0611f7de057c584b8771102fde7aed6c70c71d3b" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 335088943a80c83f99123a69352878f1a441c0ea48b868242472be78ede06f4d
[INFO] running `Command { std: "docker" "start" "-a" "335088943a80c83f99123a69352878f1a441c0ea48b868242472be78ede06f4d", kill_on_drop: false }`
[INFO] [stderr] warning: `package.edition` is unspecified, defaulting to `2015` while the latest is `2024`
[INFO] [stderr]     Checking main v0.0.1 (/opt/rustwide/workdir)
[INFO] [stdout] warning: use of deprecated struct `stack::Stack`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:16:6
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Stack {
[INFO] [stdout]    |      ^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(deprecated)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated struct `stack::Stack`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:53:15
[INFO] [stdout]    |
[INFO] [stdout] 53 |     let mut st = Stack::new();
[INFO] [stdout]    |                  ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated struct `stack::Stack`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:17:21
[INFO] [stdout]    |
[INFO] [stdout] 17 |     pub fn new() -> Stack{
[INFO] [stdout]    |                     ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated struct `stack::Stack`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:18:6
[INFO] [stdout]    |
[INFO] [stdout] 18 |         Stack{
[INFO] [stdout]    |         ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated struct `stack::Stack`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:28:14
[INFO] [stdout]    |
[INFO] [stdout] 28 |         *self = Stack{ top: new_node };
[INFO] [stdout]    |                 ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated struct `stack::Stack`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:46:14
[INFO] [stdout]    |
[INFO] [stdout] 46 |         *self = Stack{ top: new_node };
[INFO] [stdout]    |                 ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated struct `stack::Stack`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:16:6
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl Stack {
[INFO] [stdout]    |      ^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(deprecated)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated struct `stack::Stack`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:53:15
[INFO] [stdout]    |
[INFO] [stdout] 53 |     let mut st = Stack::new();
[INFO] [stdout]    |                  ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated struct `stack::Stack`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:17:21
[INFO] [stdout]    |
[INFO] [stdout] 17 |     pub fn new() -> Stack{
[INFO] [stdout]    |                     ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated struct `stack::Stack`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:18:6
[INFO] [stdout]    |
[INFO] [stdout] 18 |         Stack{
[INFO] [stdout]    |         ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated struct `stack::Stack`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:28:14
[INFO] [stdout]    |
[INFO] [stdout] 28 |         *self = Stack{ top: new_node };
[INFO] [stdout]    |                 ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated struct `stack::Stack`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:46:14
[INFO] [stdout]    |
[INFO] [stdout] 46 |         *self = Stack{ top: new_node };
[INFO] [stdout]    |                 ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated field `stack::Stack::top`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:19:7
[INFO] [stdout]    |
[INFO] [stdout] 19 |             top: Node::Null
[INFO] [stdout]    |             ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated field `stack::Stack::top`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:24:27
[INFO] [stdout]    |
[INFO] [stdout] 24 |         let old_node: Node = self.top.clone();
[INFO] [stdout]    |                              ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated field `stack::Stack::top`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:28:21
[INFO] [stdout]    |
[INFO] [stdout] 28 |         *self = Stack{ top: new_node };
[INFO] [stdout]    |                        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated field `stack::Stack::top`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 32 |         match self.top {
[INFO] [stdout]    |               ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated field `stack::Stack::top`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:41:33
[INFO] [stdout]    |
[INFO] [stdout] 41 |         let new_node: Node = match self.top {
[INFO] [stdout]    |                                    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated field `stack::Stack::top`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:46:21
[INFO] [stdout]    |
[INFO] [stdout] 46 |         *self = Stack{ top: new_node };
[INFO] [stdout]    |                        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated field `stack::Stack::top`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:66:23
[INFO] [stdout]    |
[INFO] [stdout] 66 |     let mut x: Node = st.top;
[INFO] [stdout]    |                       ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `main` (bin "main") due to 1 previous error; 21 warnings emitted
[INFO] [stdout] error: struct `Pair` is never constructed
[INFO] [stdout]  --> src/codes.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Pair (Box<i32>, Box<i32>);
[INFO] [stdout]   |            ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: this `pub` struct has private fields, no public constructor, and is not otherwise reachable through the external API, so consider providing a public constructor or removing it
[INFO] [stdout]   = note: `#[deny(unused_unconstructable_pub_struct)]` (part of `#[deny(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr] warning: build failed, waiting for other jobs to finish...
[INFO] [stdout] warning: fields `0` and `1` are never read
[INFO] [stdout]  --> src/codes.rs:6:18
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Pair (Box<i32>, Box<i32>);
[INFO] [stdout]   |            ----  ^^^^^^^^  ^^^^^^^^
[INFO] [stdout]   |            |
[INFO] [stdout]   |            fields in this struct
[INFO] [stdout]   |
[INFO] [stdout]   = help: consider removing these fields
[INFO] [stdout]   = note: `Pair` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `pointer` is never read
[INFO] [stdout]  --> src/myobject.rs:7:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct MyObject {
[INFO] [stdout]   |            -------- field in this struct
[INFO] [stdout] ...
[INFO] [stdout] 7 |     pointer: usize,
[INFO] [stdout]   |     ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: this method call resolves to `<&[T; N] as IntoIterator>::into_iter` (due to backwards compatibility), but will resolve to `<[T; N] as IntoIterator>::into_iter` in Rust 2021
[INFO] [stdout]    --> src/codes.rs:102:37
[INFO] [stdout]     |
[INFO] [stdout] 102 |     println!("2 in array2: {}", array1.into_iter().any(|&x| x == 2));
[INFO] [stdout]     |                                        ^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2021
[INFO] [stdout]     = note: for more information, see <https://doc.rust-lang.org/edition-guide/rust-2021/IntoIterator-for-arrays.html>
[INFO] [stdout]     = note: `#[warn(array_into_iter)]` (part of `#[warn(rust_2021_compatibility)]`) on by default
[INFO] [stdout] help: use `.iter()` instead of `.into_iter()` to avoid ambiguity
[INFO] [stdout]     |
[INFO] [stdout] 102 -     println!("2 in array2: {}", array1.into_iter().any(|&x| x == 2));
[INFO] [stdout] 102 +     println!("2 in array2: {}", array1.iter().any(|&x| x == 2));
[INFO] [stdout]     |
[INFO] [stdout] help: or use `IntoIterator::into_iter(..)` instead of `.into_iter()` to explicitly iterate by value
[INFO] [stdout]     |
[INFO] [stdout] 102 -     println!("2 in array2: {}", array1.into_iter().any(|&x| x == 2));
[INFO] [stdout] 102 +     println!("2 in array2: {}", IntoIterator::into_iter(array1).any(|&x| x == 2));
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: using `.clone()` on a double reference, which returns `&str` instead of cloning the inner type
[INFO] [stdout]    --> src/codes.rs:232:23
[INFO] [stdout]     |
[INFO] [stdout] 232 |     let strclone = strref.clone();
[INFO] [stdout]     |                          ^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(suspicious_double_ref_op)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/codes.rs:367:34
[INFO] [stdout]     |
[INFO] [stdout] 367 | pub fn arr_as_iter<A: Copy>(arr: &[A]) -> MyIterator<A> {
[INFO] [stdout]     |                                  ^^^^     ^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |                                  |
[INFO] [stdout]     |                                  the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout]     = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 367 | pub fn arr_as_iter<A: Copy>(arr: &[A]) -> MyIterator<'_, A> {
[INFO] [stdout]     |                                                      +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]  --> src/myiterator.rs:9:21
[INFO] [stdout]   |
[INFO] [stdout] 9 |     pub fn new(arr: &[T]) -> MyIterator<T>{
[INFO] [stdout]   |                     ^^^^     ^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]   |                     |
[INFO] [stdout]   |                     the lifetime is elided here
[INFO] [stdout]   |
[INFO] [stdout]   = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]   |
[INFO] [stdout] 9 |     pub fn new(arr: &[T]) -> MyIterator<'_, T>{
[INFO] [stdout]   |                                         +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/linked_list_found_online.rs:71:17
[INFO] [stdout]    |
[INFO] [stdout] 71 |     pub fn iter(&self) -> ListIterator<T> {
[INFO] [stdout]    |                 ^^^^^     ^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 71 |     pub fn iter(&self) -> ListIterator<'_, T> {
[INFO] [stdout]    |                                        +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/stack_found_online.rs:55:17
[INFO] [stdout]    |
[INFO] [stdout] 55 |     pub fn iter(&self) -> ListIterator<T> {
[INFO] [stdout]    |                 ^^^^^     ^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 55 |     pub fn iter(&self) -> ListIterator<'_, T> {
[INFO] [stdout]    |                                        +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated field `stack::Stack::top`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:19:7
[INFO] [stdout]    |
[INFO] [stdout] 19 |             top: Node::Null
[INFO] [stdout]    |             ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated field `stack::Stack::top`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:24:27
[INFO] [stdout]    |
[INFO] [stdout] 24 |         let old_node: Node = self.top.clone();
[INFO] [stdout]    |                              ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated field `stack::Stack::top`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:28:21
[INFO] [stdout]    |
[INFO] [stdout] 28 |         *self = Stack{ top: new_node };
[INFO] [stdout]    |                        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated field `stack::Stack::top`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 32 |         match self.top {
[INFO] [stdout]    |               ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated field `stack::Stack::top`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:41:33
[INFO] [stdout]    |
[INFO] [stdout] 41 |         let new_node: Node = match self.top {
[INFO] [stdout]    |                                    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated field `stack::Stack::top`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:46:21
[INFO] [stdout]    |
[INFO] [stdout] 46 |         *self = Stack{ top: new_node };
[INFO] [stdout]    |                        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated field `stack::Stack::top`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler.
[INFO] [stdout]          The code implemented in rawstack.rs is a lot more faster than this code, please use that. The use of Enum complicates stuff, do not use Enums for data holding
[INFO] [stdout]   --> src/stack.rs:66:23
[INFO] [stdout]    |
[INFO] [stdout] 66 |     let mut x: Node = st.top;
[INFO] [stdout]    |                       ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: struct `Pair` is never constructed
[INFO] [stdout]  --> src/codes.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Pair (Box<i32>, Box<i32>);
[INFO] [stdout]   |            ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: this `pub` struct has private fields, no public constructor, and is not otherwise reachable through the external API, so consider providing a public constructor or removing it
[INFO] [stdout]   = note: `#[deny(unused_unconstructable_pub_struct)]` (part of `#[deny(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: fields `0` and `1` are never read
[INFO] [stdout]  --> src/codes.rs:6:18
[INFO] [stdout]   |
[INFO] [stdout] 6 | pub struct Pair (Box<i32>, Box<i32>);
[INFO] [stdout]   |            ----  ^^^^^^^^  ^^^^^^^^
[INFO] [stdout]   |            |
[INFO] [stdout]   |            fields in this struct
[INFO] [stdout]   |
[INFO] [stdout]   = help: consider removing these fields
[INFO] [stdout]   = note: `Pair` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `pointer` is never read
[INFO] [stdout]  --> src/myobject.rs:7:5
[INFO] [stdout]   |
[INFO] [stdout] 4 | pub struct MyObject {
[INFO] [stdout]   |            -------- field in this struct
[INFO] [stdout] ...
[INFO] [stdout] 7 |     pointer: usize,
[INFO] [stdout]   |     ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: this method call resolves to `<&[T; N] as IntoIterator>::into_iter` (due to backwards compatibility), but will resolve to `<[T; N] as IntoIterator>::into_iter` in Rust 2021
[INFO] [stdout]    --> src/codes.rs:102:37
[INFO] [stdout]     |
[INFO] [stdout] 102 |     println!("2 in array2: {}", array1.into_iter().any(|&x| x == 2));
[INFO] [stdout]     |                                        ^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = warning: this changes meaning in Rust 2021
[INFO] [stdout]     = note: for more information, see <https://doc.rust-lang.org/edition-guide/rust-2021/IntoIterator-for-arrays.html>
[INFO] [stdout]     = note: `#[warn(array_into_iter)]` (part of `#[warn(rust_2021_compatibility)]`) on by default
[INFO] [stdout] help: use `.iter()` instead of `.into_iter()` to avoid ambiguity
[INFO] [stdout]     |
[INFO] [stdout] 102 -     println!("2 in array2: {}", array1.into_iter().any(|&x| x == 2));
[INFO] [stdout] 102 +     println!("2 in array2: {}", array1.iter().any(|&x| x == 2));
[INFO] [stdout]     |
[INFO] [stdout] help: or use `IntoIterator::into_iter(..)` instead of `.into_iter()` to explicitly iterate by value
[INFO] [stdout]     |
[INFO] [stdout] 102 -     println!("2 in array2: {}", array1.into_iter().any(|&x| x == 2));
[INFO] [stdout] 102 +     println!("2 in array2: {}", IntoIterator::into_iter(array1).any(|&x| x == 2));
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: using `.clone()` on a double reference, which returns `&str` instead of cloning the inner type
[INFO] [stdout]    --> src/codes.rs:232:23
[INFO] [stdout]     |
[INFO] [stdout] 232 |     let strclone = strref.clone();
[INFO] [stdout]     |                          ^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(suspicious_double_ref_op)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/codes.rs:367:34
[INFO] [stdout]     |
[INFO] [stdout] 367 | pub fn arr_as_iter<A: Copy>(arr: &[A]) -> MyIterator<A> {
[INFO] [stdout]     |                                  ^^^^     ^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |                                  |
[INFO] [stdout]     |                                  the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout]     = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 367 | pub fn arr_as_iter<A: Copy>(arr: &[A]) -> MyIterator<'_, A> {
[INFO] [stdout]     |                                                      +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]  --> src/myiterator.rs:9:21
[INFO] [stdout]   |
[INFO] [stdout] 9 |     pub fn new(arr: &[T]) -> MyIterator<T>{
[INFO] [stdout]   |                     ^^^^     ^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]   |                     |
[INFO] [stdout]   |                     the lifetime is elided here
[INFO] [stdout]   |
[INFO] [stdout]   = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]   |
[INFO] [stdout] 9 |     pub fn new(arr: &[T]) -> MyIterator<'_, T>{
[INFO] [stdout]   |                                         +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/linked_list_found_online.rs:71:17
[INFO] [stdout]    |
[INFO] [stdout] 71 |     pub fn iter(&self) -> ListIterator<T> {
[INFO] [stdout]    |                 ^^^^^     ^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 71 |     pub fn iter(&self) -> ListIterator<'_, T> {
[INFO] [stdout]    |                                        +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/stack_found_online.rs:55:17
[INFO] [stdout]    |
[INFO] [stdout] 55 |     pub fn iter(&self) -> ListIterator<T> {
[INFO] [stdout]    |                 ^^^^^     ^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |                 |
[INFO] [stdout]    |                 the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 55 |     pub fn iter(&self) -> ListIterator<'_, T> {
[INFO] [stdout]    |                                        +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `main` (bin "main" test) due to 1 previous error; 21 warnings emitted
[INFO] running `Command { std: "docker" "inspect" "335088943a80c83f99123a69352878f1a441c0ea48b868242472be78ede06f4d", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "335088943a80c83f99123a69352878f1a441c0ea48b868242472be78ede06f4d", kill_on_drop: false }`
[INFO] [stdout] 335088943a80c83f99123a69352878f1a441c0ea48b868242472be78ede06f4d
