[INFO] fetching crate heapz 1.1.4... [INFO] testing heapz-1.1.4 against try#8de4c7234dd9b97c9d76b58671343fdbbc9a433e+target=x86_64-unknown-linux-musl for musl_upgrade_1_2_5_with_libc_patch_0 [INFO] extracting crate heapz 1.1.4 into /workspace/builds/worker-7-tc1/source [INFO] started tweaking crates.io crate heapz 1.1.4 [INFO] finished tweaking crates.io crate heapz 1.1.4 [INFO] tweaked toml for crates.io crate heapz 1.1.4 written to /workspace/builds/worker-7-tc1/source/Cargo.toml [INFO] validating manifest of crates.io crate heapz 1.1.4 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] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+8de4c7234dd9b97c9d76b58671343fdbbc9a433e" "generate-lockfile" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Updating crates.io index [INFO] [stderr] Locking 84 packages to latest compatible versions [INFO] [stderr] Adding criterion v0.4.0 (available: v0.6.0) [INFO] [stderr] Adding rand v0.8.5 (available: v0.9.1) [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] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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] cf2c9e34c196eced09631f6629add9d029e1588de68932327c4fc77aa4eb5e45 [INFO] running `Command { std: "docker" "start" "-a" "cf2c9e34c196eced09631f6629add9d029e1588de68932327c4fc77aa4eb5e45", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "cf2c9e34c196eced09631f6629add9d029e1588de68932327c4fc77aa4eb5e45", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "cf2c9e34c196eced09631f6629add9d029e1588de68932327c4fc77aa4eb5e45", kill_on_drop: false }` [INFO] [stdout] cf2c9e34c196eced09631f6629add9d029e1588de68932327c4fc77aa4eb5e45 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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] a2ec1ef9ae7bbb93bf90873b021b8feb54ddb863fed97599dc548ecd5fd274b9 [INFO] running `Command { std: "docker" "start" "-a" "a2ec1ef9ae7bbb93bf90873b021b8feb54ddb863fed97599dc548ecd5fd274b9", kill_on_drop: false }` [INFO] [stderr] Compiling heapz v1.1.4 (/opt/rustwide/workdir) [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/rank_pairing_heap.rs:374:13 [INFO] [stdout] | [INFO] [stdout] 374 | let mut parent: Position; [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/rank_pairing_heap.rs:375:13 [INFO] [stdout] | [INFO] [stdout] 375 | let mut child: Position; [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/rank_pairing_heap.rs:377:17 [INFO] [stdout] | [INFO] [stdout] 377 | let mut parent_node: *mut Node; [INFO] [stdout] | ----^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/rank_pairing_heap.rs:378:17 [INFO] [stdout] | [INFO] [stdout] 378 | let mut child_node: *mut Node; [INFO] [stdout] | ----^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `heap_rank` is never read [INFO] [stdout] --> src/rank_pairing_heap.rs:71:5 [INFO] [stdout] | [INFO] [stdout] 69 | pub struct RankPairingHeap { [INFO] [stdout] | --------------- field in this struct [INFO] [stdout] 70 | root: Position, [INFO] [stdout] 71 | heap_rank: HeapRank, [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `rank1`, `rank2`, `rank`, and `rank_nodes` are never used [INFO] [stdout] --> src/rank_pairing_heap.rs:186:8 [INFO] [stdout] | [INFO] [stdout] 181 | / impl RankPairingHeap [INFO] [stdout] 182 | | where [INFO] [stdout] 183 | | K: Hash + Eq + Clone, [INFO] [stdout] 184 | | V: PartialOrd, [INFO] [stdout] | |__________________- associated items in this implementation [INFO] [stdout] 185 | { [INFO] [stdout] 186 | fn rank1(left: i32, next: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 194 | fn rank2(left: i32, next: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 203 | fn rank(&self, left: i32, next: i32) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 210 | fn rank_nodes(&self, left: Position, next: Position) -> usize { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `get_index`, `get_left_index`, `get_next_index`, `get_parent_index`, and `get_siblings` are never used [INFO] [stdout] --> src/rank_pairing_heap.rs:296:8 [INFO] [stdout] | [INFO] [stdout] 266 | impl RankPairingHeap { [INFO] [stdout] | --------------------------------------------------------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 296 | fn get_index) -> Position>( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 304 | fn get_left_index(&self, index: Position) -> Position { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 308 | fn get_next_index(&self, index: Position) -> Position { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 312 | fn get_parent_index(&self, index: Position) -> Position { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 321 | fn get_siblings(&self, position: Position) -> Option<(Position, Position)> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.29s [INFO] running `Command { std: "docker" "inspect" "a2ec1ef9ae7bbb93bf90873b021b8feb54ddb863fed97599dc548ecd5fd274b9", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "a2ec1ef9ae7bbb93bf90873b021b8feb54ddb863fed97599dc548ecd5fd274b9", kill_on_drop: false }` [INFO] [stdout] a2ec1ef9ae7bbb93bf90873b021b8feb54ddb863fed97599dc548ecd5fd274b9 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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] 2a958010c8e98ac8bf4d89b419dfc46ccb6210daa8ae9f08c7bdf19da81fe821 [INFO] running `Command { std: "docker" "start" "-a" "2a958010c8e98ac8bf4d89b419dfc46ccb6210daa8ae9f08c7bdf19da81fe821", kill_on_drop: false }` [INFO] [stderr] Compiling proc-macro2 v1.0.95 [INFO] [stderr] Compiling crossbeam-utils v0.8.21 [INFO] [stderr] Compiling rayon-core v1.12.1 [INFO] [stderr] Compiling plotters-backend v0.3.7 [INFO] [stderr] Compiling os_str_bytes v6.6.1 [INFO] [stderr] Compiling num-traits v0.2.19 [INFO] [stderr] Compiling indexmap v1.9.3 [INFO] [stderr] Compiling half v2.6.0 [INFO] [stderr] Compiling regex-syntax v0.8.5 [INFO] [stderr] Compiling ciborium-io v0.2.2 [INFO] [stderr] Compiling itertools v0.10.5 [INFO] [stderr] Compiling cast v0.3.0 [INFO] [stderr] Compiling textwrap v0.16.2 [INFO] [stderr] Compiling same-file v1.0.6 [INFO] [stderr] Compiling atty v0.2.14 [INFO] [stderr] Compiling lazy_static v1.5.0 [INFO] [stderr] Compiling oorandom v11.1.5 [INFO] [stderr] Compiling walkdir v2.5.0 [INFO] [stderr] Compiling anes v0.1.6 [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/rank_pairing_heap.rs:374:13 [INFO] [stdout] | [INFO] [stdout] 374 | let mut parent: Position; [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/rank_pairing_heap.rs:375:13 [INFO] [stdout] | [INFO] [stdout] 375 | let mut child: Position; [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/rank_pairing_heap.rs:377:17 [INFO] [stdout] | [INFO] [stdout] 377 | let mut parent_node: *mut Node; [INFO] [stdout] | ----^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/rank_pairing_heap.rs:378:17 [INFO] [stdout] | [INFO] [stdout] 378 | let mut child_node: *mut Node; [INFO] [stdout] | ----^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `heap_rank` is never read [INFO] [stdout] --> src/rank_pairing_heap.rs:71:5 [INFO] [stdout] | [INFO] [stdout] 69 | pub struct RankPairingHeap { [INFO] [stdout] | --------------- field in this struct [INFO] [stdout] 70 | root: Position, [INFO] [stdout] 71 | heap_rank: HeapRank, [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `rank1`, `rank2`, `rank`, and `rank_nodes` are never used [INFO] [stdout] --> src/rank_pairing_heap.rs:186:8 [INFO] [stdout] | [INFO] [stdout] 181 | / impl RankPairingHeap [INFO] [stdout] 182 | | where [INFO] [stdout] 183 | | K: Hash + Eq + Clone, [INFO] [stdout] 184 | | V: PartialOrd, [INFO] [stdout] | |__________________- associated items in this implementation [INFO] [stdout] 185 | { [INFO] [stdout] 186 | fn rank1(left: i32, next: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 194 | fn rank2(left: i32, next: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 203 | fn rank(&self, left: i32, next: i32) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 210 | fn rank_nodes(&self, left: Position, next: Position) -> usize { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `get_index`, `get_left_index`, `get_next_index`, `get_parent_index`, and `get_siblings` are never used [INFO] [stdout] --> src/rank_pairing_heap.rs:296:8 [INFO] [stdout] | [INFO] [stdout] 266 | impl RankPairingHeap { [INFO] [stdout] | --------------------------------------------------------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 296 | fn get_index) -> Position>( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 304 | fn get_left_index(&self, index: Position) -> Position { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 308 | fn get_next_index(&self, index: Position) -> Position { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 312 | fn get_parent_index(&self, index: Position) -> Position { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 321 | fn get_siblings(&self, position: Position) -> Option<(Position, Position)> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling plotters-svg v0.3.7 [INFO] [stderr] Compiling clap_lex v0.2.4 [INFO] [stderr] Compiling ciborium-ll v0.2.2 [INFO] [stderr] Compiling clap v3.2.25 [INFO] [stderr] Compiling crossbeam-epoch v0.9.18 [INFO] [stderr] Compiling quote v1.0.40 [INFO] [stderr] Compiling syn v2.0.104 [INFO] [stderr] Compiling crossbeam-deque v0.8.6 [INFO] [stderr] Compiling plotters v0.3.7 [INFO] [stderr] Compiling regex-automata v0.4.9 [INFO] [stderr] Compiling criterion-plot v0.5.0 [INFO] [stderr] Compiling rayon v1.10.0 [INFO] [stderr] Compiling regex v1.11.1 [INFO] [stderr] Compiling serde_derive v1.0.219 [INFO] [stderr] Compiling serde v1.0.219 [INFO] [stderr] Compiling serde_json v1.0.140 [INFO] [stderr] Compiling ciborium v0.2.2 [INFO] [stderr] Compiling tinytemplate v1.2.1 [INFO] [stderr] Compiling criterion v0.4.0 [INFO] [stderr] Compiling heapz v1.1.4 (/opt/rustwide/workdir) [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/rank_pairing_heap.rs:374:13 [INFO] [stdout] | [INFO] [stdout] 374 | let mut parent: Position; [INFO] [stdout] | ----^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/rank_pairing_heap.rs:375:13 [INFO] [stdout] | [INFO] [stdout] 375 | let mut child: Position; [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/rank_pairing_heap.rs:377:17 [INFO] [stdout] | [INFO] [stdout] 377 | let mut parent_node: *mut Node; [INFO] [stdout] | ----^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/rank_pairing_heap.rs:378:17 [INFO] [stdout] | [INFO] [stdout] 378 | let mut child_node: *mut Node; [INFO] [stdout] | ----^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `heap_rank` is never read [INFO] [stdout] --> src/rank_pairing_heap.rs:71:5 [INFO] [stdout] | [INFO] [stdout] 69 | pub struct RankPairingHeap { [INFO] [stdout] | --------------- field in this struct [INFO] [stdout] 70 | root: Position, [INFO] [stdout] 71 | heap_rank: HeapRank, [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `rank1`, `rank2`, `rank`, and `rank_nodes` are never used [INFO] [stdout] --> src/rank_pairing_heap.rs:186:8 [INFO] [stdout] | [INFO] [stdout] 181 | / impl RankPairingHeap [INFO] [stdout] 182 | | where [INFO] [stdout] 183 | | K: Hash + Eq + Clone, [INFO] [stdout] 184 | | V: PartialOrd, [INFO] [stdout] | |__________________- associated items in this implementation [INFO] [stdout] 185 | { [INFO] [stdout] 186 | fn rank1(left: i32, next: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 194 | fn rank2(left: i32, next: i32) -> i32 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 203 | fn rank(&self, left: i32, next: i32) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 210 | fn rank_nodes(&self, left: Position, next: Position) -> usize { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `get_index`, `get_left_index`, `get_next_index`, `get_parent_index`, and `get_siblings` are never used [INFO] [stdout] --> src/rank_pairing_heap.rs:296:8 [INFO] [stdout] | [INFO] [stdout] 266 | impl RankPairingHeap { [INFO] [stdout] | --------------------------------------------------------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 296 | fn get_index) -> Position>( [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 304 | fn get_left_index(&self, index: Position) -> Position { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 308 | fn get_next_index(&self, index: Position) -> Position { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 312 | fn get_parent_index(&self, index: Position) -> Position { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 321 | fn get_siblings(&self, position: Position) -> Option<(Position, Position)> { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `will_update_a_specific_element_by_key_in_a_min_heap` is never used [INFO] [stdout] --> tests/common/mod.rs:221:12 [INFO] [stdout] | [INFO] [stdout] 221 | pub fn will_update_a_specific_element_by_key_in_a_min_heap>( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `will_update_a_specific_element_by_key_in_a_min_heap_after_pop` is never used [INFO] [stdout] --> tests/common/mod.rs:241:12 [INFO] [stdout] | [INFO] [stdout] 241 | pub fn will_update_a_specific_element_by_key_in_a_min_heap_after_pop< [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `will_update_a_specific_element_by_key_in_a_max_heap` is never used [INFO] [stdout] --> tests/common/mod.rs:267:12 [INFO] [stdout] | [INFO] [stdout] 267 | pub fn will_update_a_specific_element_by_key_in_a_max_heap>( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `will_update_a_specific_element_by_key_in_a_max_heap_after_pop` is never used [INFO] [stdout] --> tests/common/mod.rs:287:12 [INFO] [stdout] | [INFO] [stdout] 287 | pub fn will_update_a_specific_element_by_key_in_a_max_heap_after_pop< [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `will_delete_a_specific_element_by_key_from_min_heap` is never used [INFO] [stdout] --> tests/common/mod.rs:316:12 [INFO] [stdout] | [INFO] [stdout] 316 | pub fn will_delete_a_specific_element_by_key_from_min_heap>( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `will_delete_a_specific_element_by_key_from_min_heap_after_pop` is never used [INFO] [stdout] --> tests/common/mod.rs:333:12 [INFO] [stdout] | [INFO] [stdout] 333 | pub fn will_delete_a_specific_element_by_key_from_min_heap_after_pop< [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `will_delete_a_specific_element_by_key_from_max_heap` is never used [INFO] [stdout] --> tests/common/mod.rs:353:12 [INFO] [stdout] | [INFO] [stdout] 353 | pub fn will_delete_a_specific_element_by_key_from_max_heap>( [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `will_delete_a_specific_element_by_key_from_max_heap_after_pop` is never used [INFO] [stdout] --> tests/common/mod.rs:370:12 [INFO] [stdout] | [INFO] [stdout] 370 | pub fn will_delete_a_specific_element_by_key_from_max_heap_after_pop< [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 21.02s [INFO] running `Command { std: "docker" "inspect" "2a958010c8e98ac8bf4d89b419dfc46ccb6210daa8ae9f08c7bdf19da81fe821", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "2a958010c8e98ac8bf4d89b419dfc46ccb6210daa8ae9f08c7bdf19da81fe821", kill_on_drop: false }` [INFO] [stdout] 2a958010c8e98ac8bf4d89b419dfc46ccb6210daa8ae9f08c7bdf19da81fe821 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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] 6247036c454b7f497674483a97d8a01bf8796b8eb6e53abbb441dd955e254352 [INFO] running `Command { std: "docker" "start" "-a" "6247036c454b7f497674483a97d8a01bf8796b8eb6e53abbb441dd955e254352", kill_on_drop: false }` [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/rank_pairing_heap.rs:374:13 [INFO] [stderr] | [INFO] [stderr] 374 | let mut parent: Position; [INFO] [stderr] | ----^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_mut)]` on by default [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/rank_pairing_heap.rs:375:13 [INFO] [stderr] | [INFO] [stderr] 375 | let mut child: Position; [INFO] [stderr] | ----^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/rank_pairing_heap.rs:377:17 [INFO] [stderr] | [INFO] [stderr] 377 | let mut parent_node: *mut Node; [INFO] [stderr] | ----^^^^^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/rank_pairing_heap.rs:378:17 [INFO] [stderr] | [INFO] [stderr] 378 | let mut child_node: *mut Node; [INFO] [stderr] | ----^^^^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: field `heap_rank` is never read [INFO] [stderr] --> src/rank_pairing_heap.rs:71:5 [INFO] [stderr] | [INFO] [stderr] 69 | pub struct RankPairingHeap { [INFO] [stderr] | --------------- field in this struct [INFO] [stderr] 70 | root: Position, [INFO] [stderr] 71 | heap_rank: HeapRank, [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: associated items `rank1`, `rank2`, `rank`, and `rank_nodes` are never used [INFO] [stderr] --> src/rank_pairing_heap.rs:186:8 [INFO] [stderr] | [INFO] [stderr] 181 | / impl RankPairingHeap [INFO] [stderr] 182 | | where [INFO] [stderr] 183 | | K: Hash + Eq + Clone, [INFO] [stderr] 184 | | V: PartialOrd, [INFO] [stderr] | |__________________- associated items in this implementation [INFO] [stderr] 185 | { [INFO] [stderr] 186 | fn rank1(left: i32, next: i32) -> i32 { [INFO] [stderr] | ^^^^^ [INFO] [stderr] ... [INFO] [stderr] 194 | fn rank2(left: i32, next: i32) -> i32 { [INFO] [stderr] | ^^^^^ [INFO] [stderr] ... [INFO] [stderr] 203 | fn rank(&self, left: i32, next: i32) -> usize { [INFO] [stderr] | ^^^^ [INFO] [stderr] ... [INFO] [stderr] 210 | fn rank_nodes(&self, left: Position, next: Position) -> usize { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: methods `get_index`, `get_left_index`, `get_next_index`, `get_parent_index`, and `get_siblings` are never used [INFO] [stderr] --> src/rank_pairing_heap.rs:296:8 [INFO] [stderr] | [INFO] [stderr] 266 | impl RankPairingHeap { [INFO] [stderr] | --------------------------------------------------------------- methods in this implementation [INFO] [stderr] ... [INFO] [stderr] 296 | fn get_index) -> Position>( [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 304 | fn get_left_index(&self, index: Position) -> Position { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 308 | fn get_next_index(&self, index: Position) -> Position { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 312 | fn get_parent_index(&self, index: Position) -> Position { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 321 | fn get_siblings(&self, position: Position) -> Option<(Position, Position)> { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: `heapz` (lib) generated 7 warnings (run `cargo fix --lib -p heapz` to apply 4 suggestions) [INFO] [stderr] warning: function `will_update_a_specific_element_by_key_in_a_min_heap` is never used [INFO] [stderr] --> tests/common/mod.rs:221:12 [INFO] [stderr] | [INFO] [stderr] 221 | pub fn will_update_a_specific_element_by_key_in_a_min_heap>( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: function `will_update_a_specific_element_by_key_in_a_min_heap_after_pop` is never used [INFO] [stderr] --> tests/common/mod.rs:241:12 [INFO] [stderr] | [INFO] [stderr] 241 | pub fn will_update_a_specific_element_by_key_in_a_min_heap_after_pop< [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `will_update_a_specific_element_by_key_in_a_max_heap` is never used [INFO] [stderr] --> tests/common/mod.rs:267:12 [INFO] [stderr] | [INFO] [stderr] 267 | pub fn will_update_a_specific_element_by_key_in_a_max_heap>( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `will_update_a_specific_element_by_key_in_a_max_heap_after_pop` is never used [INFO] [stderr] --> tests/common/mod.rs:287:12 [INFO] [stderr] | [INFO] [stderr] 287 | pub fn will_update_a_specific_element_by_key_in_a_max_heap_after_pop< [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `will_delete_a_specific_element_by_key_from_min_heap` is never used [INFO] [stderr] --> tests/common/mod.rs:316:12 [INFO] [stderr] | [INFO] [stderr] 316 | pub fn will_delete_a_specific_element_by_key_from_min_heap>( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `will_delete_a_specific_element_by_key_from_min_heap_after_pop` is never used [INFO] [stderr] --> tests/common/mod.rs:333:12 [INFO] [stderr] | [INFO] [stderr] 333 | pub fn will_delete_a_specific_element_by_key_from_min_heap_after_pop< [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `will_delete_a_specific_element_by_key_from_max_heap` is never used [INFO] [stderr] --> tests/common/mod.rs:353:12 [INFO] [stderr] | [INFO] [stderr] 353 | pub fn will_delete_a_specific_element_by_key_from_max_heap>( [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function `will_delete_a_specific_element_by_key_from_max_heap_after_pop` is never used [INFO] [stderr] --> tests/common/mod.rs:370:12 [INFO] [stderr] | [INFO] [stderr] 370 | pub fn will_delete_a_specific_element_by_key_from_max_heap_after_pop< [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: `heapz` (lib test) generated 7 warnings (7 duplicates) [INFO] [stderr] warning: `heapz` (test "linked") generated 8 warnings [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.16s [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/x86_64-unknown-linux-musl/debug/deps/heapz-d9a788d8447e95d9) [INFO] [stdout] [INFO] [stdout] running 1 test [INFO] [stdout] test utils::math::log::returns_log_of_numbers_greater_than_zero ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 1 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s [INFO] [stdout] [INFO] [stderr] Running tests/linked.rs (/opt/rustwide/target/x86_64-unknown-linux-musl/debug/deps/linked-caff5b3ba9bd64ff) [INFO] [stdout] [INFO] [stdout] running 18 tests [INFO] [stdout] test pop::returns_none_if_the_max_heap_is_empty ... ok [INFO] [stdout] test push::adds_a_higher_item_to_the_heap_before_a_lower_in_a_max_heap ... ok [INFO] [stdout] test push::adds_a_lower_item_to_the_heap_before_a_higher_in_a_min_heap ... ok [INFO] [stdout] test push::adds_a_higher_item_to_the_heap_behind_a_lower_in_a_min_heap ... ok [INFO] [stdout] test push::adds_a_lower_item_to_the_heap_behind_a_higher_in_a_max_heap ... ok [INFO] [stdout] test top::returns_none_if_the_heap_is_empty ... ok [INFO] [stdout] test push::adds_a_value_to_the_heap ... ok [INFO] [stdout] test pop::returns_the_first_value_from_the_max_heap ... ok [INFO] [stdout] test size::returns_the_correct_size_of_a_heap_after_adding_elements ... ok [INFO] [stdout] test pop::removes_the_first_value_from_max_heap ... ok [INFO] [stdout] test size::returns_the_correct_size_of_a_heap_after_removing_an_element ... ok [INFO] [stdout] test pop::removes_the_first_value_from_min_heap ... ok [INFO] [stdout] test pop::returns_none_if_the_min_heap_is_empty ... ok [INFO] [stdout] test pop::returns_the_first_value_from_the_min_heap ... ok [INFO] [stdout] test pop::returns_all_elements_from_largest_to_smallest_in_a_max_heap ... ok [INFO] [stdout] test top::returns_the_first_value_in_a_min_heap ... ok [INFO] [stdout] test top::returns_the_first_value_in_a_max_heap ... ok [INFO] [stdout] test pop::returns_all_elements_from_smallest_to_largest_in_a_min_heap ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 18 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.02s [INFO] [stdout] [INFO] [stderr] Running tests/ranked.rs (/opt/rustwide/target/x86_64-unknown-linux-musl/debug/deps/ranked-e00e4614871e60f8) [INFO] [stdout] [INFO] [stdout] running 120 tests [INFO] [stdout] test multi_pass_max2::push::adds_a_higher_item_to_the_heap_behind_a_lower ... ok [INFO] [stdout] test multi_pass_max2::push::adds_a_lower_item_to_the_heap_before_a_higher ... ok [INFO] [stdout] test multi_pass_max2::pop::returns_none_if_the_heap_is_empty ... ok [INFO] [stdout] test multi_pass_max2::top::returns_none_if_the_heap_is_empty ... ok [INFO] [stdout] test multi_pass_max2::pop::removes_the_first_value_from_heap ... ok [INFO] [stdout] test multi_pass_max::pop::returns_none_if_the_heap_is_empty ... ok [INFO] [stdout] test multi_pass_max2::size::returns_the_correct_size_of_a_heap_after_adding_elements ... ok [INFO] [stdout] test multi_pass_max2::top::adds_a_higher_item_to_the_heap_behind_a_lower ... ok [INFO] [stdout] test multi_pass_max::push::adds_a_higher_item_to_the_heap_behind_a_lower ... ok [INFO] [stdout] test multi_pass_max::push::adds_a_lower_item_to_the_heap_before_a_higher ... ok [INFO] [stdout] test multi_pass_max::push::adds_a_value_to_the_heap ... ok [INFO] [stdout] test multi_pass_max2::push::adds_a_value_to_the_heap ... ok [INFO] [stdout] test multi_pass_max::pop::returns_the_first_value_from_the_heap ... ok [INFO] [stdout] test multi_pass_max::size::returns_the_correct_size_of_a_heap_after_adding_elements ... ok [INFO] [stdout] test multi_pass_max2::size::returns_the_first_value_in_a_heap ... ok [INFO] [stdout] test multi_pass_max2::pop::returns_the_first_value_from_the_heap ... ok [INFO] [stdout] test multi_pass_max::pop::removes_the_first_value_from_heap ... ok [INFO] [stdout] test multi_pass_max::top::returns_none_if_the_heap_is_empty ... ok [INFO] [stdout] test multi_pass_max::top::adds_a_higher_item_to_the_heap_behind_a_lower ... ok [INFO] [stdout] test multi_pass_min2::pop::returns_none_if_the_heap_is_empty ... ok [INFO] [stdout] test multi_pass_min2::pop::returns_the_first_value_from_the_heap ... ok [INFO] [stdout] test multi_pass_max::size::returns_the_first_value_in_a_heap ... ok [INFO] [stdout] test multi_pass_min2::push::adds_a_higher_item_to_the_heap_behind_a_lower ... ok [INFO] [stdout] test multi_pass_min2::pop::removes_the_first_value_from_heap ... ok [INFO] [stdout] test multi_pass_min2::push::adds_a_value_to_the_heap ... ok [INFO] [stdout] test multi_pass_min2::push::adds_a_lower_item_to_the_heap_before_a_higher ... ok [INFO] [stdout] test multi_pass_min2::top::adds_a_higher_item_to_the_heap_behind_a_lower ... ok [INFO] [stdout] test multi_pass_min2::size::returns_the_correct_size_of_a_heap_after_adding_elements ... ok [INFO] [stdout] test multi_pass_min2::top::returns_none_if_the_heap_is_empty ... ok [INFO] [stdout] test multi_pass_max2::delete::delete_an_element_by_key_after_pop ... ok [INFO] [stdout] test multi_pass_min2::size::returns_the_first_value_in_a_heap ... ok [INFO] [stdout] test multi_pass_max::delete::delete_an_element_by_key ... ok [INFO] [stdout] test multi_pass_min2::delete::delete_an_element_by_key_after_pop ... ok [INFO] [stdout] test multi_pass_max::pop::returns_all_elements_from_largest_to_smallest ... ok [INFO] [stdout] test multi_pass_max2::delete::delete_an_element_by_key ... ok [INFO] [stdout] test multi_pass_max2::pop::returns_all_elements_from_largest_to_smallest ... ok [INFO] [stdout] test multi_pass_min::push::adds_a_higher_item_to_the_heap_behind_a_lower ... ok [INFO] [stdout] test multi_pass_min::push::adds_a_lower_item_to_the_heap_before_a_higher ... ok [INFO] [stdout] test multi_pass_min::pop::returns_none_if_the_heap_is_empty ... ok [INFO] [stdout] test multi_pass_min::push::adds_a_value_to_the_heap ... ok [INFO] [stdout] test multi_pass_max2::update::updates_an_element_by_key_after_pop ... ok [INFO] [stdout] test multi_pass_min::pop::removes_the_first_value_from_heap ... ok [INFO] [stdout] test multi_pass_min::pop::returns_the_first_value_from_the_heap ... ok [INFO] [stdout] test multi_pass_min2::pop::returns_all_elements_from_largest_to_smallest ... ok [INFO] [stdout] test multi_pass_min::top::adds_a_higher_item_to_the_heap_behind_a_lower ... ok [INFO] [stdout] test multi_pass_min::size::returns_the_correct_size_of_a_heap_after_adding_elements ... ok [INFO] [stdout] test multi_pass_max2::update::updates_an_element_by_key ... ok [INFO] [stdout] test multi_pass_min::size::returns_the_first_value_in_a_heap ... ok [INFO] [stdout] test multi_pass_min::top::returns_none_if_the_heap_is_empty ... ok [INFO] [stdout] test single_pass_max2::pop::returns_none_if_the_heap_is_empty ... ok [INFO] [stdout] test multi_pass_max::update::updates_an_element_by_key ... ok [INFO] [stdout] test single_pass_max2::pop::removes_the_first_value_from_heap ... ok [INFO] [stdout] test single_pass_max2::pop::returns_the_first_value_from_the_heap ... ok [INFO] [stdout] test multi_pass_max::update::updates_an_element_by_key_after_pop ... ok [INFO] [stdout] test single_pass_max2::push::adds_a_higher_item_to_the_heap_behind_a_lower ... ok [INFO] [stdout] test multi_pass_min2::delete::delete_an_element_by_key ... ok [INFO] [stdout] test single_pass_max2::push::adds_a_lower_item_to_the_heap_before_a_higher ... ok [INFO] [stdout] test multi_pass_max::delete::delete_an_element_by_key_after_pop ... ok [INFO] [stdout] test single_pass_max2::push::adds_a_value_to_the_heap ... ok [INFO] [stdout] test single_pass_max2::top::adds_a_higher_item_to_the_heap_behind_a_lower ... ok [INFO] [stdout] test multi_pass_min::delete::delete_an_element_by_key ... ok [INFO] [stdout] test single_pass_max2::top::returns_none_if_the_heap_is_empty ... ok [INFO] [stdout] test single_pass_max2::size::returns_the_correct_size_of_a_heap_after_adding_elements ... ok [INFO] [stdout] test single_pass_max2::size::returns_the_first_value_in_a_heap ... ok [INFO] [stdout] test single_pass_max::pop::returns_none_if_the_heap_is_empty ... ok [INFO] [stdout] test multi_pass_min2::update::updates_an_element_by_key ... ok [INFO] [stdout] test single_pass_max::pop::returns_the_first_value_from_the_heap ... ok [INFO] [stdout] test single_pass_max::push::adds_a_higher_item_to_the_heap_behind_a_lower ... ok [INFO] [stdout] test single_pass_max::push::adds_a_lower_item_to_the_heap_before_a_higher ... ok [INFO] [stdout] test single_pass_max::push::adds_a_value_to_the_heap ... ok [INFO] [stdout] test multi_pass_min2::update::updates_an_element_by_key_after_pop ... ok [INFO] [stdout] test multi_pass_min::delete::delete_an_element_by_key_after_pop ... ok [INFO] [stdout] test single_pass_max::top::returns_none_if_the_heap_is_empty ... ok [INFO] [stdout] test single_pass_max::pop::removes_the_first_value_from_heap ... ok [INFO] [stdout] test single_pass_max::size::returns_the_correct_size_of_a_heap_after_adding_elements ... ok [INFO] [stdout] test single_pass_max::top::adds_a_higher_item_to_the_heap_behind_a_lower ... ok [INFO] [stdout] test single_pass_max::size::returns_the_first_value_in_a_heap ... ok [INFO] [stdout] test single_pass_min2::pop::removes_the_first_value_from_heap ... ok [INFO] [stdout] test single_pass_max2::update::updates_an_element_by_key_after_pop ... ok [INFO] [stdout] test multi_pass_min::update::updates_an_element_by_key ... ok [INFO] [stdout] test single_pass_max2::delete::delete_an_element_by_key_after_pop ... ok [INFO] [stdout] test single_pass_min2::pop::returns_none_if_the_heap_is_empty ... ok [INFO] [stdout] test single_pass_max2::pop::returns_all_elements_from_largest_to_smallest ... ok [INFO] [stdout] test single_pass_min2::push::adds_a_value_to_the_heap ... ok [INFO] [stdout] test single_pass_min2::push::adds_a_lower_item_to_the_heap_before_a_higher ... ok [INFO] [stdout] test single_pass_min2::push::adds_a_higher_item_to_the_heap_behind_a_lower ... ok [INFO] [stdout] test single_pass_min2::top::adds_a_higher_item_to_the_heap_behind_a_lower ... ok [INFO] [stdout] test single_pass_min2::top::returns_none_if_the_heap_is_empty ... ok [INFO] [stdout] test single_pass_min2::pop::returns_the_first_value_from_the_heap ... ok [INFO] [stdout] test single_pass_min2::size::returns_the_correct_size_of_a_heap_after_adding_elements ... ok [INFO] [stdout] test multi_pass_min::update::updates_an_element_by_key_after_pop ... ok [INFO] [stdout] test single_pass_max::delete::delete_an_element_by_key_after_pop ... ok [INFO] [stdout] test multi_pass_min::pop::returns_all_elements_from_largest_to_smallest ... ok [INFO] [stdout] test single_pass_min2::size::returns_the_first_value_in_a_heap ... ok [INFO] [stdout] test single_pass_max::delete::delete_an_element_by_key ... ok [INFO] [stdout] test single_pass_max2::delete::delete_an_element_by_key ... ok [INFO] [stdout] test single_pass_min::pop::removes_the_first_value_from_heap ... ok [INFO] [stdout] test single_pass_min::pop::returns_none_if_the_heap_is_empty ... ok [INFO] [stdout] test single_pass_min::push::adds_a_lower_item_to_the_heap_before_a_higher ... ok [INFO] [stdout] test single_pass_min::push::adds_a_higher_item_to_the_heap_behind_a_lower ... ok [INFO] [stdout] test single_pass_min::push::adds_a_value_to_the_heap ... ok [INFO] [stdout] test single_pass_min::size::returns_the_correct_size_of_a_heap_after_adding_elements ... ok [INFO] [stdout] test single_pass_min::pop::returns_the_first_value_from_the_heap ... ok [INFO] [stdout] test single_pass_min::top::returns_none_if_the_heap_is_empty ... ok [INFO] [stdout] test single_pass_min::top::adds_a_higher_item_to_the_heap_behind_a_lower ... ok [INFO] [stdout] test single_pass_min::size::returns_the_first_value_in_a_heap ... ok [INFO] [stdout] test single_pass_max::pop::returns_all_elements_from_largest_to_smallest ... ok [INFO] [stdout] test single_pass_max::update::updates_an_element_by_key_after_pop ... ok [INFO] [stdout] test single_pass_max2::update::updates_an_element_by_key ... ok [INFO] [stdout] test single_pass_max::update::updates_an_element_by_key ... ok [INFO] [stdout] test single_pass_min2::update::updates_an_element_by_key ... ok [INFO] [stdout] test single_pass_min::pop::returns_all_elements_from_largest_to_smallest ... ok [INFO] [stdout] test single_pass_min2::delete::delete_an_element_by_key ... ok [INFO] [stdout] test single_pass_min2::delete::delete_an_element_by_key_after_pop ... ok [INFO] [stdout] test single_pass_min2::pop::returns_all_elements_from_largest_to_smallest ... ok [INFO] [stdout] test single_pass_min::delete::delete_an_element_by_key_after_pop ... ok [INFO] [stdout] test single_pass_min::update::updates_an_element_by_key_after_pop ... ok [INFO] [stdout] test single_pass_min2::update::updates_an_element_by_key_after_pop ... ok [INFO] [stdout] test single_pass_min::update::updates_an_element_by_key ... ok [INFO] [stdout] test single_pass_min::delete::delete_an_element_by_key ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 120 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.58s [INFO] [stdout] [INFO] running `Command { std: "docker" "inspect" "6247036c454b7f497674483a97d8a01bf8796b8eb6e53abbb441dd955e254352", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "6247036c454b7f497674483a97d8a01bf8796b8eb6e53abbb441dd955e254352", kill_on_drop: false }` [INFO] [stdout] 6247036c454b7f497674483a97d8a01bf8796b8eb6e53abbb441dd955e254352