[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 1.59.0 for beta-1.60-1 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fserhat359%2Frust-codes" "/workspace/builds/worker-12/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-12/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/serhat359/rust-codes on toolchain 1.59.0 [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+1.59.0" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [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-12/source/Cargo.toml [INFO] crate git repo https://github.com/serhat359/rust-codes already has a lockfile, it will not be regenerated [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+1.59.0" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-12/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-12/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:0cd99ca24d8e8c98e67c542213511d985b8778b5bdcbb160e038429496686047" "/opt/rustwide/cargo-home/bin/cargo" "+1.59.0" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 91f660a2358e77fd06f64be3f41c3f9efd5f552d499e5540acb12ea39e4a31ee [INFO] running `Command { std: "docker" "start" "-a" "91f660a2358e77fd06f64be3f41c3f9efd5f552d499e5540acb12ea39e4a31ee", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "91f660a2358e77fd06f64be3f41c3f9efd5f552d499e5540acb12ea39e4a31ee", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "91f660a2358e77fd06f64be3f41c3f9efd5f552d499e5540acb12ea39e4a31ee", kill_on_drop: false }` [INFO] [stdout] 91f660a2358e77fd06f64be3f41c3f9efd5f552d499e5540acb12ea39e4a31ee [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-12/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-12/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:0cd99ca24d8e8c98e67c542213511d985b8778b5bdcbb160e038429496686047" "/opt/rustwide/cargo-home/bin/cargo" "+1.59.0" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 1a579b88718a28b5f05f5328fefee7160834f68a6cbc59667ea0e3a554c1ebe2 [INFO] running `Command { std: "docker" "start" "-a" "1a579b88718a28b5f05f5328fefee7160834f68a6cbc59667ea0e3a554c1ebe2", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [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: field is never read: `pointer` [INFO] [stdout] --> src/myobject.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | pointer: usize, [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [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] = note: `#[warn(array_into_iter)]` on by default [INFO] [stdout] = warning: this changes meaning in Rust 2021 [INFO] [stdout] = note: for more information, see [INFO] [stdout] help: use `.iter()` instead of `.into_iter()` to avoid ambiguity [INFO] [stdout] | [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: {}", IntoIterator::into_iter(array1).any(|&x| x == 2)); [INFO] [stdout] | ++++++++++++++++++++++++ ~ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 15 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 0.39s [INFO] running `Command { std: "docker" "inspect" "1a579b88718a28b5f05f5328fefee7160834f68a6cbc59667ea0e3a554c1ebe2", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "1a579b88718a28b5f05f5328fefee7160834f68a6cbc59667ea0e3a554c1ebe2", kill_on_drop: false }` [INFO] [stdout] 1a579b88718a28b5f05f5328fefee7160834f68a6cbc59667ea0e3a554c1ebe2 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-12/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-12/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:0cd99ca24d8e8c98e67c542213511d985b8778b5bdcbb160e038429496686047" "/opt/rustwide/cargo-home/bin/cargo" "+1.59.0" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 67b94e3a4aab2cfa3761c71aa093416756b82a175163eb834c876b42f7b09d64 [INFO] running `Command { std: "docker" "start" "-a" "67b94e3a4aab2cfa3761c71aa093416756b82a175163eb834c876b42f7b09d64", kill_on_drop: false }` [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: field is never read: `pointer` [INFO] [stdout] --> src/myobject.rs:7:5 [INFO] [stdout] | [INFO] [stdout] 7 | pointer: usize, [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [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] = note: `#[warn(array_into_iter)]` on by default [INFO] [stdout] = warning: this changes meaning in Rust 2021 [INFO] [stdout] = note: for more information, see [INFO] [stdout] help: use `.iter()` instead of `.into_iter()` to avoid ambiguity [INFO] [stdout] | [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: {}", IntoIterator::into_iter(array1).any(|&x| x == 2)); [INFO] [stdout] | ++++++++++++++++++++++++ ~ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 15 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished test [unoptimized + debuginfo] target(s) in 0.41s [INFO] running `Command { std: "docker" "inspect" "67b94e3a4aab2cfa3761c71aa093416756b82a175163eb834c876b42f7b09d64", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "67b94e3a4aab2cfa3761c71aa093416756b82a175163eb834c876b42f7b09d64", kill_on_drop: false }` [INFO] [stdout] 67b94e3a4aab2cfa3761c71aa093416756b82a175163eb834c876b42f7b09d64 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-12/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-12/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:0cd99ca24d8e8c98e67c542213511d985b8778b5bdcbb160e038429496686047" "/opt/rustwide/cargo-home/bin/cargo" "+1.59.0" "test" "--frozen", kill_on_drop: false }` [INFO] [stdout] 8f8c4d87f597cd31ba28018946b53028aeede011f14faefab973d6417b8774de [INFO] running `Command { std: "docker" "start" "-a" "8f8c4d87f597cd31ba28018946b53028aeede011f14faefab973d6417b8774de", kill_on_drop: false }` [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: field is never read: `pointer` [INFO] [stderr] --> src/myobject.rs:7:5 [INFO] [stderr] | [INFO] [stderr] 7 | pointer: usize, [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [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] = note: `#[warn(array_into_iter)]` on by default [INFO] [stderr] = warning: this changes meaning in Rust 2021 [INFO] [stderr] = note: for more information, see [INFO] [stderr] help: use `.iter()` instead of `.into_iter()` to avoid ambiguity [INFO] [stderr] | [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: {}", IntoIterator::into_iter(array1).any(|&x| x == 2)); [INFO] [stderr] | ++++++++++++++++++++++++ ~ [INFO] [stderr] [INFO] [stderr] warning: `main` (bin "main" test) generated 15 warnings [INFO] [stderr] Finished test [unoptimized + debuginfo] target(s) in 0.00s [INFO] [stderr] Running unittests (/opt/rustwide/target/debug/deps/main-a4db81e67c287ff6) [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" "8f8c4d87f597cd31ba28018946b53028aeede011f14faefab973d6417b8774de", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "8f8c4d87f597cd31ba28018946b53028aeede011f14faefab973d6417b8774de", kill_on_drop: false }` [INFO] [stdout] 8f8c4d87f597cd31ba28018946b53028aeede011f14faefab973d6417b8774de