[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] testing serhat359/rust-codes against try#8de4c7234dd9b97c9d76b58671343fdbbc9a433e+target=x86_64-unknown-linux-musl for musl_upgrade_1_2_5_with_libc_patch_0 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fserhat359%2Frust-codes" "/workspace/builds/worker-3-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-3-tc1/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-3-tc1/source/Cargo.toml [INFO] validating manifest of git repo https://github.com/serhat359/rust-codes on toolchain 8de4c7234dd9b97c9d76b58671343fdbbc9a433e [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "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" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] warning: no edition set: defaulting to the 2015 edition while the latest is 2024 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-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:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 80598751c8131c721906ad64482ba5a523a0ea69b82131c45c4e45191a4bc1ae [INFO] running `Command { std: "docker" "start" "-a" "80598751c8131c721906ad64482ba5a523a0ea69b82131c45c4e45191a4bc1ae", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "80598751c8131c721906ad64482ba5a523a0ea69b82131c45c4e45191a4bc1ae", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "80598751c8131c721906ad64482ba5a523a0ea69b82131c45c4e45191a4bc1ae", kill_on_drop: false }` [INFO] [stdout] 80598751c8131c721906ad64482ba5a523a0ea69b82131c45c4e45191a4bc1ae [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-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:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "build" "--frozen" "--message-format=json" "--target" "x86_64-unknown-linux-musl", kill_on_drop: false }` [INFO] [stdout] 356f277425138279932af1f8929b1aab2a445d906518a3dcf3c8b97a72593bb4 [INFO] running `Command { std: "docker" "start" "-a" "356f277425138279932af1f8929b1aab2a445d906518a3dcf3c8b97a72593bb4", kill_on_drop: false }` [INFO] [stderr] warning: no edition set: defaulting to the 2015 edition while the latest is 2024 [INFO] [stderr] Compiling 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 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] warning: fields `0` and `1` are never read [INFO] [stdout] --> src/codes.rs:6:18 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct Pair (Box, Box); [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)]` 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 [INFO] [stdout] = note: `#[warn(array_into_iter)]` 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: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/codes.rs:367:34 [INFO] [stdout] | [INFO] [stdout] 367 | pub fn arr_as_iter(arr: &[A]) -> MyIterator { [INFO] [stdout] | ^^^^ ------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 367 | pub fn arr_as_iter(arr: &[A]) -> MyIterator<'_, A> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/myiterator.rs:9:21 [INFO] [stdout] | [INFO] [stdout] 9 | pub fn new(arr: &[T]) -> MyIterator{ [INFO] [stdout] | ^^^^ ------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 9 | pub fn new(arr: &[T]) -> MyIterator<'_, T>{ [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/linked_list_found_online.rs:71:17 [INFO] [stdout] | [INFO] [stdout] 71 | pub fn iter(&self) -> ListIterator { [INFO] [stdout] | ^^^^^ --------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 71 | pub fn iter(&self) -> ListIterator<'_, T> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/stack_found_online.rs:55:17 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn iter(&self) -> ListIterator { [INFO] [stdout] | ^^^^^ --------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 55 | pub fn iter(&self) -> ListIterator<'_, T> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.57s [INFO] running `Command { std: "docker" "inspect" "356f277425138279932af1f8929b1aab2a445d906518a3dcf3c8b97a72593bb4", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "356f277425138279932af1f8929b1aab2a445d906518a3dcf3c8b97a72593bb4", kill_on_drop: false }` [INFO] [stdout] 356f277425138279932af1f8929b1aab2a445d906518a3dcf3c8b97a72593bb4 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-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:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "test" "--frozen" "--no-run" "--message-format=json" "--target" "x86_64-unknown-linux-musl", kill_on_drop: false }` [INFO] [stdout] f06faf964dfc258c1214d43d0b3900ebd82c1e1d8c18302373df66a9368f70e8 [INFO] running `Command { std: "docker" "start" "-a" "f06faf964dfc258c1214d43d0b3900ebd82c1e1d8c18302373df66a9368f70e8", kill_on_drop: false }` [INFO] [stderr] warning: no edition set: defaulting to the 2015 edition while the latest is 2024 [INFO] [stderr] Compiling 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 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] warning: fields `0` and `1` are never read [INFO] [stdout] --> src/codes.rs:6:18 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct Pair (Box, Box); [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)]` 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 [INFO] [stdout] = note: `#[warn(array_into_iter)]` 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: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/codes.rs:367:34 [INFO] [stdout] | [INFO] [stdout] 367 | pub fn arr_as_iter(arr: &[A]) -> MyIterator { [INFO] [stdout] | ^^^^ ------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 367 | pub fn arr_as_iter(arr: &[A]) -> MyIterator<'_, A> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/myiterator.rs:9:21 [INFO] [stdout] | [INFO] [stdout] 9 | pub fn new(arr: &[T]) -> MyIterator{ [INFO] [stdout] | ^^^^ ------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 9 | pub fn new(arr: &[T]) -> MyIterator<'_, T>{ [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/linked_list_found_online.rs:71:17 [INFO] [stdout] | [INFO] [stdout] 71 | pub fn iter(&self) -> ListIterator { [INFO] [stdout] | ^^^^^ --------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 71 | pub fn iter(&self) -> ListIterator<'_, T> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/stack_found_online.rs:55:17 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn iter(&self) -> ListIterator { [INFO] [stdout] | ^^^^^ --------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 55 | pub fn iter(&self) -> ListIterator<'_, T> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.59s [INFO] running `Command { std: "docker" "inspect" "f06faf964dfc258c1214d43d0b3900ebd82c1e1d8c18302373df66a9368f70e8", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "f06faf964dfc258c1214d43d0b3900ebd82c1e1d8c18302373df66a9368f70e8", kill_on_drop: false }` [INFO] [stdout] f06faf964dfc258c1214d43d0b3900ebd82c1e1d8c18302373df66a9368f70e8 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-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:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "test" "--frozen" "--target" "x86_64-unknown-linux-musl", kill_on_drop: false }` [INFO] [stdout] 16e37071e6b170357ba8c8b5c0029312389188e085f92a1a0f9626e6d985fc73 [INFO] running `Command { std: "docker" "start" "-a" "16e37071e6b170357ba8c8b5c0029312389188e085f92a1a0f9626e6d985fc73", kill_on_drop: false }` [INFO] [stderr] warning: no edition set: defaulting to the 2015 edition while the latest is 2024 [INFO] [stderr] warning: use of deprecated struct `stack::Stack`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler. [INFO] [stderr] 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] [stderr] --> src/stack.rs:16:6 [INFO] [stderr] | [INFO] [stderr] 16 | impl Stack { [INFO] [stderr] | ^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(deprecated)]` on by default [INFO] [stderr] [INFO] [stderr] warning: use of deprecated struct `stack::Stack`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler. [INFO] [stderr] 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] [stderr] --> src/stack.rs:53:15 [INFO] [stderr] | [INFO] [stderr] 53 | let mut st = Stack::new(); [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: use of deprecated struct `stack::Stack`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler. [INFO] [stderr] 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] [stderr] --> src/stack.rs:17:21 [INFO] [stderr] | [INFO] [stderr] 17 | pub fn new() -> Stack{ [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: use of deprecated struct `stack::Stack`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler. [INFO] [stderr] 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] [stderr] --> src/stack.rs:18:6 [INFO] [stderr] | [INFO] [stderr] 18 | Stack{ [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: use of deprecated struct `stack::Stack`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler. [INFO] [stderr] 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] [stderr] --> src/stack.rs:28:14 [INFO] [stderr] | [INFO] [stderr] 28 | *self = Stack{ top: new_node }; [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: use of deprecated struct `stack::Stack`: The stack implemented here uses self defined enum Node, which is not optimized by the compiler. [INFO] [stderr] 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] [stderr] --> src/stack.rs:46:14 [INFO] [stderr] | [INFO] [stderr] 46 | *self = Stack{ top: new_node }; [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] 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] [stderr] 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] [stderr] --> src/stack.rs:19:7 [INFO] [stderr] | [INFO] [stderr] 19 | top: Node::Null [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] 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] [stderr] 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] [stderr] --> src/stack.rs:24:27 [INFO] [stderr] | [INFO] [stderr] 24 | let old_node: Node = self.top.clone(); [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] 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] [stderr] 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] [stderr] --> src/stack.rs:28:21 [INFO] [stderr] | [INFO] [stderr] 28 | *self = Stack{ top: new_node }; [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] 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] [stderr] 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] [stderr] --> src/stack.rs:32:12 [INFO] [stderr] | [INFO] [stderr] 32 | match self.top { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] 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] [stderr] 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] [stderr] --> src/stack.rs:41:33 [INFO] [stderr] | [INFO] [stderr] 41 | let new_node: Node = match self.top { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] 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] [stderr] 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] [stderr] --> src/stack.rs:46:21 [INFO] [stderr] | [INFO] [stderr] 46 | *self = Stack{ top: new_node }; [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] 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] [stderr] 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] [stderr] --> src/stack.rs:66:23 [INFO] [stderr] | [INFO] [stderr] 66 | let mut x: Node = st.top; [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: fields `0` and `1` are never read [INFO] [stderr] --> src/codes.rs:6:18 [INFO] [stderr] | [INFO] [stderr] 6 | pub struct Pair (Box, Box); [INFO] [stderr] | ---- ^^^^^^^^ ^^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | fields in this struct [INFO] [stderr] | [INFO] [stderr] = help: consider removing these fields [INFO] [stderr] = note: `Pair` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: field `pointer` is never read [INFO] [stderr] --> src/myobject.rs:7:5 [INFO] [stderr] | [INFO] [stderr] 4 | pub struct MyObject { [INFO] [stderr] | -------- field in this struct [INFO] [stderr] ... [INFO] [stderr] 7 | pointer: usize, [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] 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] [stderr] --> src/codes.rs:102:37 [INFO] [stderr] | [INFO] [stderr] 102 | println!("2 in array2: {}", array1.into_iter().any(|&x| x == 2)); [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = warning: this changes meaning in Rust 2021 [INFO] [stderr] = note: for more information, see [INFO] [stderr] = note: `#[warn(array_into_iter)]` on by default [INFO] [stderr] help: use `.iter()` instead of `.into_iter()` to avoid ambiguity [INFO] [stderr] | [INFO] [stderr] 102 - println!("2 in array2: {}", array1.into_iter().any(|&x| x == 2)); [INFO] [stderr] 102 + println!("2 in array2: {}", array1.iter().any(|&x| x == 2)); [INFO] [stderr] | [INFO] [stderr] help: or use `IntoIterator::into_iter(..)` instead of `.into_iter()` to explicitly iterate by value [INFO] [stderr] | [INFO] [stderr] 102 - println!("2 in array2: {}", array1.into_iter().any(|&x| x == 2)); [INFO] [stderr] 102 + println!("2 in array2: {}", IntoIterator::into_iter(array1).any(|&x| x == 2)); [INFO] [stderr] | [INFO] [stderr] [INFO] [stderr] warning: using `.clone()` on a double reference, which returns `&str` instead of cloning the inner type [INFO] [stderr] --> src/codes.rs:232:23 [INFO] [stderr] | [INFO] [stderr] 232 | let strclone = strref.clone(); [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(suspicious_double_ref_op)]` on by default [INFO] [stderr] [INFO] [stderr] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stderr] --> src/codes.rs:367:34 [INFO] [stderr] | [INFO] [stderr] 367 | pub fn arr_as_iter(arr: &[A]) -> MyIterator { [INFO] [stderr] | ^^^^ ------------- the lifetime gets resolved as `'_` [INFO] [stderr] | | [INFO] [stderr] | this lifetime flows to the output [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stderr] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stderr] | [INFO] [stderr] 367 | pub fn arr_as_iter(arr: &[A]) -> MyIterator<'_, A> { [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stderr] --> src/myiterator.rs:9:21 [INFO] [stderr] | [INFO] [stderr] 9 | pub fn new(arr: &[T]) -> MyIterator{ [INFO] [stderr] | ^^^^ ------------- the lifetime gets resolved as `'_` [INFO] [stderr] | | [INFO] [stderr] | this lifetime flows to the output [INFO] [stderr] | [INFO] [stderr] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stderr] | [INFO] [stderr] 9 | pub fn new(arr: &[T]) -> MyIterator<'_, T>{ [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stderr] --> src/linked_list_found_online.rs:71:17 [INFO] [stderr] | [INFO] [stderr] 71 | pub fn iter(&self) -> ListIterator { [INFO] [stderr] | ^^^^^ --------------- the lifetime gets resolved as `'_` [INFO] [stderr] | | [INFO] [stderr] | this lifetime flows to the output [INFO] [stderr] | [INFO] [stderr] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stderr] | [INFO] [stderr] 71 | pub fn iter(&self) -> ListIterator<'_, T> { [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stderr] --> src/stack_found_online.rs:55:17 [INFO] [stderr] | [INFO] [stderr] 55 | pub fn iter(&self) -> ListIterator { [INFO] [stderr] | ^^^^^ --------------- the lifetime gets resolved as `'_` [INFO] [stderr] | | [INFO] [stderr] | this lifetime flows to the output [INFO] [stderr] | [INFO] [stderr] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stderr] | [INFO] [stderr] 55 | pub fn iter(&self) -> ListIterator<'_, T> { [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: `main` (bin "main" test) generated 21 warnings (run `cargo fix --bin "main" --tests` to apply 5 suggestions) [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.03s [INFO] [stderr] Running unittests src/main.rs (/opt/rustwide/target/x86_64-unknown-linux-musl/debug/deps/main-2ce912ff9fb57c15) [INFO] [stdout] [INFO] [stdout] running 0 tests [INFO] [stdout] [INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s [INFO] [stdout] [INFO] running `Command { std: "docker" "inspect" "16e37071e6b170357ba8c8b5c0029312389188e085f92a1a0f9626e6d985fc73", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "16e37071e6b170357ba8c8b5c0029312389188e085f92a1a0f9626e6d985fc73", kill_on_drop: false }` [INFO] [stdout] 16e37071e6b170357ba8c8b5c0029312389188e085f92a1a0f9626e6d985fc73