[INFO] cloning repository https://github.com/Kasyima/rs-trees [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/Kasyima/rs-trees" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FKasyima%2Frs-trees", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FKasyima%2Frs-trees'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] f3fbcf445dea6a1ef87ae32f221889f7f6f7ba7c [INFO] checking Kasyima/rs-trees against master#1f12b9b0fdbe735968ac002792a720f0ba4faca6 for crater-rollup-uwu [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FKasyima%2Frs-trees" "/workspace/builds/worker-3-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-3-tc1/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/Kasyima/rs-trees on toolchain 1f12b9b0fdbe735968ac002792a720f0ba4faca6 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/Kasyima/rs-trees [INFO] finished tweaking git repo https://github.com/Kasyima/rs-trees [INFO] tweaked toml for git repo https://github.com/Kasyima/rs-trees written to /workspace/builds/worker-3-tc1/source/Cargo.toml [INFO] crate git repo https://github.com/Kasyima/rs-trees 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" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-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:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 1cfe3c2e1077331a8ee8d93ab65ff94bcd94b5a97f4a73f1e43e1173eefb282c [INFO] running `Command { std: "docker" "start" "-a" "1cfe3c2e1077331a8ee8d93ab65ff94bcd94b5a97f4a73f1e43e1173eefb282c", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "1cfe3c2e1077331a8ee8d93ab65ff94bcd94b5a97f4a73f1e43e1173eefb282c", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "1cfe3c2e1077331a8ee8d93ab65ff94bcd94b5a97f4a73f1e43e1173eefb282c", kill_on_drop: false }` [INFO] [stdout] 1cfe3c2e1077331a8ee8d93ab65ff94bcd94b5a97f4a73f1e43e1173eefb282c [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:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+1f12b9b0fdbe735968ac002792a720f0ba4faca6" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 5dfd83f4ef76596e6a176b2c7343d9c72534c20dfbd1785570dd4c3fabe18eab [INFO] running `Command { std: "docker" "start" "-a" "5dfd83f4ef76596e6a176b2c7343d9c72534c20dfbd1785570dd4c3fabe18eab", kill_on_drop: false }` [INFO] [stderr] Checking trees v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `Display` [INFO] [stdout] --> src/lib.rs:13:23 [INFO] [stdout] | [INFO] [stdout] 13 | use std::fmt::{Debug, Display}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Display` [INFO] [stdout] --> src/lib.rs:13:23 [INFO] [stdout] | [INFO] [stdout] 13 | use std::fmt::{Debug, Display}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/lib.rs:180:9 [INFO] [stdout] | [INFO] [stdout] 180 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `size` [INFO] [stdout] --> src/level_order_traversal.rs:10:13 [INFO] [stdout] | [INFO] [stdout] 10 | let size = self.size(); [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_size` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `size` [INFO] [stdout] --> src/level_order_traversal.rs:10:13 [INFO] [stdout] | [INFO] [stdout] 10 | let size = self.size(); [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_size` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/lib.rs:16:6 [INFO] [stdout] | [INFO] [stdout] 16 | type Link = Option>>; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BinaryTree` is never constructed [INFO] [stdout] --> src/lib.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct BinaryTree { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/lib.rs:16:6 [INFO] [stdout] | [INFO] [stdout] 16 | type Link = Option>>; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BinaryTree` is never constructed [INFO] [stdout] --> src/lib.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct BinaryTree { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/lib.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 28 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- associated items in this implementation [INFO] [stdout] 29 | fn new(key: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn insert_left_node(&mut self, key: T) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | fn insert_right_node(&mut self, key: T) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn calc_size(&self, mut size: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 85 | fn leaf_size(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 106 | fn none_leaf_size(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 111 | fn depth(&self) -> usize { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 127 | fn get_left(&self) -> Link { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 131 | fn get_right(&self) -> Link { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 136 | fn get_key(&self) -> T { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 141 | fn set_key(&mut self, key: T) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 146 | fn min(&self) -> Option<&T> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 154 | fn max(&self) -> Option<&T> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 163 | fn contains(&self, key: &T) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `preorder` is never used [INFO] [stdout] --> src/pre_order_traversal.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- method in this implementation [INFO] [stdout] 13 | fn preorder(&self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `preorder` is never used [INFO] [stdout] --> src/pre_order_traversal.rs:27:4 [INFO] [stdout] | [INFO] [stdout] 27 | fn preorder (bt: Link) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/lib.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 28 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- associated items in this implementation [INFO] [stdout] 29 | fn new(key: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn insert_left_node(&mut self, key: T) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | fn insert_right_node(&mut self, key: T) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn calc_size(&self, mut size: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 85 | fn leaf_size(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 106 | fn none_leaf_size(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 111 | fn depth(&self) -> usize { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 127 | fn get_left(&self) -> Link { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 131 | fn get_right(&self) -> Link { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 136 | fn get_key(&self) -> T { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 141 | fn set_key(&mut self, key: T) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 146 | fn min(&self) -> Option<&T> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 154 | fn max(&self) -> Option<&T> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 163 | fn contains(&self, key: &T) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `postorder` is never used [INFO] [stdout] --> src/post_order_traversal.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- method in this implementation [INFO] [stdout] 8 | fn postorder(&self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `postorder` is never used [INFO] [stdout] --> src/post_order_traversal.rs:22:4 [INFO] [stdout] | [INFO] [stdout] 22 | fn postorder(bt: Link) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `inorder` is never used [INFO] [stdout] --> src/in_order_traversal.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- method in this implementation [INFO] [stdout] 8 | fn inorder(&self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder` is never used [INFO] [stdout] --> src/in_order_traversal.rs:20:4 [INFO] [stdout] | [INFO] [stdout] 20 | fn inorder(bt: Link) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `levelorder` is never used [INFO] [stdout] --> src/level_order_traversal.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- method in this implementation [INFO] [stdout] 9 | fn levelorder(&self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BinaryHeap` is never constructed [INFO] [stdout] --> src/binary_heap.rs:58:8 [INFO] [stdout] | [INFO] [stdout] 58 | struct BinaryHeap{ [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `preorder` is never used [INFO] [stdout] --> src/pre_order_traversal.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- method in this implementation [INFO] [stdout] 13 | fn preorder(&self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `preorder` is never used [INFO] [stdout] --> src/pre_order_traversal.rs:27:4 [INFO] [stdout] | [INFO] [stdout] 27 | fn preorder (bt: Link) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `postorder` is never used [INFO] [stdout] --> src/post_order_traversal.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- method in this implementation [INFO] [stdout] 8 | fn postorder(&self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/binary_heap.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 64 | impl BinaryHeap { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 65 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn min(&self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 94 | fn push(&mut self, val: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 102 | fn move_up(&mut self, mut c: usize) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 116 | fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 158 | fn move_down(&mut self, mut c: usize) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 175 | fn min_child(&self, c: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 192 | fn build_new(&mut self, arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `postorder` is never used [INFO] [stdout] --> src/post_order_traversal.rs:22:4 [INFO] [stdout] | [INFO] [stdout] 22 | fn postorder(bt: Link) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `inorder` is never used [INFO] [stdout] --> src/in_order_traversal.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- method in this implementation [INFO] [stdout] 8 | fn inorder(&self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder` is never used [INFO] [stdout] --> src/in_order_traversal.rs:20:4 [INFO] [stdout] | [INFO] [stdout] 20 | fn inorder(bt: Link) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `levelorder` is never used [INFO] [stdout] --> src/level_order_traversal.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- method in this implementation [INFO] [stdout] 9 | fn levelorder(&self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BinaryHeap` is never constructed [INFO] [stdout] --> src/binary_heap.rs:58:8 [INFO] [stdout] | [INFO] [stdout] 58 | struct BinaryHeap{ [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/binary_heap.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 64 | impl BinaryHeap { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 65 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn min(&self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 94 | fn push(&mut self, val: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 102 | fn move_up(&mut self, mut c: usize) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 116 | fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 158 | fn move_down(&mut self, mut c: usize) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 175 | fn min_child(&self, c: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 192 | fn build_new(&mut self, arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 15 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 14 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.07s [INFO] running `Command { std: "docker" "inspect" "5dfd83f4ef76596e6a176b2c7343d9c72534c20dfbd1785570dd4c3fabe18eab", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "5dfd83f4ef76596e6a176b2c7343d9c72534c20dfbd1785570dd4c3fabe18eab", kill_on_drop: false }` [INFO] [stdout] 5dfd83f4ef76596e6a176b2c7343d9c72534c20dfbd1785570dd4c3fabe18eab [INFO] checking Kasyima/rs-trees against try#f9935d29d867449445ee008640ccca1bf1ae0889+rustflags=-Dtail_expr_drop_order for crater-rollup-uwu [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FKasyima%2Frs-trees" "/workspace/builds/worker-3-tc2/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-3-tc2/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/Kasyima/rs-trees on toolchain f9935d29d867449445ee008640ccca1bf1ae0889 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+f9935d29d867449445ee008640ccca1bf1ae0889" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/Kasyima/rs-trees [INFO] finished tweaking git repo https://github.com/Kasyima/rs-trees [INFO] tweaked toml for git repo https://github.com/Kasyima/rs-trees written to /workspace/builds/worker-3-tc2/source/Cargo.toml [INFO] crate git repo https://github.com/Kasyima/rs-trees 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" "+f9935d29d867449445ee008640ccca1bf1ae0889" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-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:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+f9935d29d867449445ee008640ccca1bf1ae0889" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 282bff760a06861a882c3b11ccc330736a07d54f5fef98f763ed2e73b710e808 [INFO] running `Command { std: "docker" "start" "-a" "282bff760a06861a882c3b11ccc330736a07d54f5fef98f763ed2e73b710e808", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "282bff760a06861a882c3b11ccc330736a07d54f5fef98f763ed2e73b710e808", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "282bff760a06861a882c3b11ccc330736a07d54f5fef98f763ed2e73b710e808", kill_on_drop: false }` [INFO] [stdout] 282bff760a06861a882c3b11ccc330736a07d54f5fef98f763ed2e73b710e808 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-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 -Dtail_expr_drop_order" "-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:923055f121b5182466d55868a8b05e67af8ba4a3a3f6bad814e953ca3cd3ac2a" "/opt/rustwide/cargo-home/bin/cargo" "+f9935d29d867449445ee008640ccca1bf1ae0889" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 16962b3500bd5c43268d67dd0b708222b4eb67cf4d998e55558247ab1f451986 [INFO] running `Command { std: "docker" "start" "-a" "16962b3500bd5c43268d67dd0b708222b4eb67cf4d998e55558247ab1f451986", kill_on_drop: false }` [INFO] [stderr] Checking trees v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `Display` [INFO] [stdout] --> src/lib.rs:13:23 [INFO] [stdout] | [INFO] [stdout] 13 | use std::fmt::{Debug, Display}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Display` [INFO] [stdout] --> src/lib.rs:13:23 [INFO] [stdout] | [INFO] [stdout] 13 | use std::fmt::{Debug, Display}; [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `super::*` [INFO] [stdout] --> src/lib.rs:180:9 [INFO] [stdout] | [INFO] [stdout] 180 | use super::*; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `size` [INFO] [stdout] --> src/level_order_traversal.rs:10:13 [INFO] [stdout] | [INFO] [stdout] 10 | let size = self.size(); [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_size` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/lib.rs:16:6 [INFO] [stdout] | [INFO] [stdout] 16 | type Link = Option>>; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BinaryTree` is never constructed [INFO] [stdout] --> src/lib.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct BinaryTree { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/lib.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 28 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- associated items in this implementation [INFO] [stdout] 29 | fn new(key: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn insert_left_node(&mut self, key: T) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | fn insert_right_node(&mut self, key: T) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn calc_size(&self, mut size: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 85 | fn leaf_size(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 106 | fn none_leaf_size(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 111 | fn depth(&self) -> usize { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 127 | fn get_left(&self) -> Link { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 131 | fn get_right(&self) -> Link { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 136 | fn get_key(&self) -> T { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 141 | fn set_key(&mut self, key: T) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 146 | fn min(&self) -> Option<&T> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 154 | fn max(&self) -> Option<&T> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 163 | fn contains(&self, key: &T) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `preorder` is never used [INFO] [stdout] --> src/pre_order_traversal.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- method in this implementation [INFO] [stdout] 13 | fn preorder(&self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `preorder` is never used [INFO] [stdout] --> src/pre_order_traversal.rs:27:4 [INFO] [stdout] | [INFO] [stdout] 27 | fn preorder (bt: Link) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `postorder` is never used [INFO] [stdout] --> src/post_order_traversal.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- method in this implementation [INFO] [stdout] 8 | fn postorder(&self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `postorder` is never used [INFO] [stdout] --> src/post_order_traversal.rs:22:4 [INFO] [stdout] | [INFO] [stdout] 22 | fn postorder(bt: Link) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `inorder` is never used [INFO] [stdout] --> src/in_order_traversal.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- method in this implementation [INFO] [stdout] 8 | fn inorder(&self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder` is never used [INFO] [stdout] --> src/in_order_traversal.rs:20:4 [INFO] [stdout] | [INFO] [stdout] 20 | fn inorder(bt: Link) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `levelorder` is never used [INFO] [stdout] --> src/level_order_traversal.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- method in this implementation [INFO] [stdout] 9 | fn levelorder(&self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BinaryHeap` is never constructed [INFO] [stdout] --> src/binary_heap.rs:58:8 [INFO] [stdout] | [INFO] [stdout] 58 | struct BinaryHeap{ [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `size` [INFO] [stdout] --> src/level_order_traversal.rs:10:13 [INFO] [stdout] | [INFO] [stdout] 10 | let size = self.size(); [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_size` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/binary_heap.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 64 | impl BinaryHeap { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 65 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn min(&self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 94 | fn push(&mut self, val: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 102 | fn move_up(&mut self, mut c: usize) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 116 | fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 158 | fn move_down(&mut self, mut c: usize) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 175 | fn min_child(&self, c: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 192 | fn build_new(&mut self, arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: these values and local bindings have significant drop implementation that will have a different drop order from that of Edition 2021 [INFO] [stdout] --> src/lib.rs:32:19 [INFO] [stdout] | [INFO] [stdout] 29 | fn new(key: T) -> Self { [INFO] [stdout] | ------ these values have significant drop implementation and will observe changes in drop order under Edition 2024 [INFO] [stdout] ... [INFO] [stdout] 32 | left: None, [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = warning: this changes meaning in Rust 2024 [INFO] [stdout] = note: for more information, see issue #123739 [INFO] [stdout] = note: requested on the command line with `-D tail-expr-drop-order` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: these values and local bindings have significant drop implementation that will have a different drop order from that of Edition 2021 [INFO] [stdout] --> src/lib.rs:33:20 [INFO] [stdout] | [INFO] [stdout] 29 | fn new(key: T) -> Self { [INFO] [stdout] | ------ these values have significant drop implementation and will observe changes in drop order under Edition 2024 [INFO] [stdout] ... [INFO] [stdout] 33 | right: None, [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = warning: this changes meaning in Rust 2024 [INFO] [stdout] = note: for more information, see issue #123739 [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: aborting due to 2 previous errors; 14 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `Link` is never used [INFO] [stdout] --> src/lib.rs:16:6 [INFO] [stdout] | [INFO] [stdout] 16 | type Link = Option>>; [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BinaryTree` is never constructed [INFO] [stdout] --> src/lib.rs:20:8 [INFO] [stdout] | [INFO] [stdout] 20 | struct BinaryTree { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/lib.rs:29:8 [INFO] [stdout] | [INFO] [stdout] 28 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- associated items in this implementation [INFO] [stdout] 29 | fn new(key: T) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 43 | fn insert_left_node(&mut self, key: T) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | fn insert_right_node(&mut self, key: T) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 67 | fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 71 | fn calc_size(&self, mut size: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 85 | fn leaf_size(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 106 | fn none_leaf_size(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 111 | fn depth(&self) -> usize { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 127 | fn get_left(&self) -> Link { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 131 | fn get_right(&self) -> Link { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 136 | fn get_key(&self) -> T { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 141 | fn set_key(&mut self, key: T) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 146 | fn min(&self) -> Option<&T> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 154 | fn max(&self) -> Option<&T> { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 163 | fn contains(&self, key: &T) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `preorder` is never used [INFO] [stdout] --> src/pre_order_traversal.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 12 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- method in this implementation [INFO] [stdout] 13 | fn preorder(&self) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `preorder` is never used [INFO] [stdout] --> src/pre_order_traversal.rs:27:4 [INFO] [stdout] | [INFO] [stdout] 27 | fn preorder (bt: Link) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `postorder` is never used [INFO] [stdout] --> src/post_order_traversal.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- method in this implementation [INFO] [stdout] 8 | fn postorder(&self) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `postorder` is never used [INFO] [stdout] --> src/post_order_traversal.rs:22:4 [INFO] [stdout] | [INFO] [stdout] 22 | fn postorder(bt: Link) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `inorder` is never used [INFO] [stdout] --> src/in_order_traversal.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 7 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- method in this implementation [INFO] [stdout] 8 | fn inorder(&self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `inorder` is never used [INFO] [stdout] --> src/in_order_traversal.rs:20:4 [INFO] [stdout] | [INFO] [stdout] 20 | fn inorder(bt: Link) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `levelorder` is never used [INFO] [stdout] --> src/level_order_traversal.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 8 | impl BinaryTree { [INFO] [stdout] | ----------------------------------------------------- method in this implementation [INFO] [stdout] 9 | fn levelorder(&self) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `BinaryHeap` is never constructed [INFO] [stdout] --> src/binary_heap.rs:58:8 [INFO] [stdout] | [INFO] [stdout] 58 | struct BinaryHeap{ [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/binary_heap.rs:65:8 [INFO] [stdout] | [INFO] [stdout] 64 | impl BinaryHeap { [INFO] [stdout] | --------------- associated items in this implementation [INFO] [stdout] 65 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 80 | fn min(&self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 94 | fn push(&mut self, val: i32) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 102 | fn move_up(&mut self, mut c: usize) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 116 | fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 158 | fn move_down(&mut self, mut c: usize) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 175 | fn min_child(&self, c: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 192 | fn build_new(&mut self, arr: &[i32]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: these values and local bindings have significant drop implementation that will have a different drop order from that of Edition 2021 [INFO] [stdout] --> src/lib.rs:32:19 [INFO] [stdout] | [INFO] [stdout] 29 | fn new(key: T) -> Self { [INFO] [stdout] | ------ these values have significant drop implementation and will observe changes in drop order under Edition 2024 [INFO] [stdout] ... [INFO] [stdout] 32 | left: None, [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = warning: this changes meaning in Rust 2024 [INFO] [stdout] = note: for more information, see issue #123739 [INFO] [stdout] = note: requested on the command line with `-D tail-expr-drop-order` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: these values and local bindings have significant drop implementation that will have a different drop order from that of Edition 2021 [INFO] [stdout] --> src/lib.rs:33:20 [INFO] [stdout] | [INFO] [stdout] 29 | fn new(key: T) -> Self { [INFO] [stdout] | ------ these values have significant drop implementation and will observe changes in drop order under Edition 2024 [INFO] [stdout] ... [INFO] [stdout] 33 | right: None, [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = warning: this changes meaning in Rust 2024 [INFO] [stdout] = note: for more information, see issue #123739 [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: aborting due to 2 previous errors; 15 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] error: could not compile `trees` (lib) due to 3 previous errors; 14 warnings emitted [INFO] [stderr] warning: build failed, waiting for other jobs to finish... [INFO] [stderr] error: could not compile `trees` (lib test) due to 3 previous errors; 15 warnings emitted [INFO] running `Command { std: "docker" "inspect" "16962b3500bd5c43268d67dd0b708222b4eb67cf4d998e55558247ab1f451986", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "16962b3500bd5c43268d67dd0b708222b4eb67cf4d998e55558247ab1f451986", kill_on_drop: false }` [INFO] [stdout] 16962b3500bd5c43268d67dd0b708222b4eb67cf4d998e55558247ab1f451986