[INFO] fetching crate heapz 1.1.4...
[INFO] testing heapz-1.1.4 against try#0abe69e6c16114311cc2700e972492e64d69c28f for pr-154065-1
[INFO] extracting crate heapz 1.1.4 into /workspace/builds/worker-2-tc2/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-2-tc2/source/Cargo.toml
[INFO] validating manifest of crates.io crate heapz 1.1.4 on toolchain 0abe69e6c16114311cc2700e972492e64d69c28f
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+0abe69e6c16114311cc2700e972492e64d69c28f" "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" "+0abe69e6c16114311cc2700e972492e64d69c28f" "generate-lockfile" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]     Updating crates.io index
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]      Locking 75 packages to latest compatible versions
[INFO] [stderr]       Adding criterion v0.4.0 (available: v0.8.2)
[INFO] [stderr]       Adding rand v0.8.5 (available: v0.10.0)
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+0abe69e6c16114311cc2700e972492e64d69c28f" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+0abe69e6c16114311cc2700e972492e64d69c28f" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] e02f7f85d5ec1d1717acdf7ff4e985204d4efd326dfd052e910f1a8633206bbf
[INFO] running `Command { std: "docker" "start" "-a" "e02f7f85d5ec1d1717acdf7ff4e985204d4efd326dfd052e910f1a8633206bbf", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "e02f7f85d5ec1d1717acdf7ff4e985204d4efd326dfd052e910f1a8633206bbf", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "e02f7f85d5ec1d1717acdf7ff4e985204d4efd326dfd052e910f1a8633206bbf", kill_on_drop: false }`
[INFO] [stdout] e02f7f85d5ec1d1717acdf7ff4e985204d4efd326dfd052e910f1a8633206bbf
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+0abe69e6c16114311cc2700e972492e64d69c28f" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] bc97e3ac5fbfd381c58b4b6f4f28b520ba2b4f3c5c4762bb30ba42ebbce99290
[INFO] running `Command { std: "docker" "start" "-a" "bc97e3ac5fbfd381c58b4b6f4f28b520ba2b4f3c5c4762bb30ba42ebbce99290", 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)]` (part of `#[warn(unused)]`) 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<K, V>;
[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<K, V>;
[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<K: Hash + Eq + Clone, V: PartialOrd> {
[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)]` (part of `#[warn(unused)]`) 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<K, V> RankPairingHeap<K, V>
[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<K: Hash + Eq + Clone, V: PartialOrd> RankPairingHeap<K, V> {
[INFO] [stdout]     | --------------------------------------------------------------- methods in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 296 |     fn get_index<F: Fn(&Node<K, V>) -> 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.35s
[INFO] running `Command { std: "docker" "inspect" "bc97e3ac5fbfd381c58b4b6f4f28b520ba2b4f3c5c4762bb30ba42ebbce99290", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "bc97e3ac5fbfd381c58b4b6f4f28b520ba2b4f3c5c4762bb30ba42ebbce99290", kill_on_drop: false }`
[INFO] [stdout] bc97e3ac5fbfd381c58b4b6f4f28b520ba2b4f3c5c4762bb30ba42ebbce99290
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+0abe69e6c16114311cc2700e972492e64d69c28f" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] ebaf222f331c7569d8e5de2265fe18441d1082dc59b5d2a5b99c105c5fcc983f
[INFO] running `Command { std: "docker" "start" "-a" "ebaf222f331c7569d8e5de2265fe18441d1082dc59b5d2a5b99c105c5fcc983f", kill_on_drop: false }`
[INFO] [stderr]    Compiling rayon-core v1.13.0
[INFO] [stderr]    Compiling either v1.15.0
[INFO] [stderr]    Compiling ciborium-io v0.2.2
[INFO] [stderr]    Compiling plotters-backend v0.3.7
[INFO] [stderr]    Compiling os_str_bytes v6.6.1
[INFO] [stderr]    Compiling regex-syntax v0.8.10
[INFO] [stderr]    Compiling memchr v2.8.0
[INFO] [stderr]    Compiling cast v0.3.0
[INFO] [stderr]    Compiling crossbeam-epoch v0.9.18
[INFO] [stderr]    Compiling textwrap v0.16.2
[INFO] [stderr]    Compiling atty v0.2.14
[INFO] [stderr]    Compiling zerocopy-derive v0.8.48
[INFO] [stderr]    Compiling serde_derive v1.0.228
[INFO] [stderr]    Compiling rand_core v0.6.4
[INFO] [stderr]    Compiling anes v0.1.6
[INFO] [stderr]    Compiling oorandom v11.1.5
[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)]` (part of `#[warn(unused)]`) 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<K, V>;
[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<K, V>;
[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<K: Hash + Eq + Clone, V: PartialOrd> {
[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)]` (part of `#[warn(unused)]`) 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<K, V> RankPairingHeap<K, V>
[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<K: Hash + Eq + Clone, V: PartialOrd> RankPairingHeap<K, V> {
[INFO] [stdout]     | --------------------------------------------------------------- methods in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 296 |     fn get_index<F: Fn(&Node<K, V>) -> 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 itertools v0.10.5
[INFO] [stderr]    Compiling crossbeam-deque v0.8.6
[INFO] [stderr]    Compiling plotters-svg v0.3.7
[INFO] [stderr]    Compiling clap_lex v0.2.4
[INFO] [stderr]    Compiling clap v3.2.25
[INFO] [stderr]    Compiling serde_json v1.0.149
[INFO] [stderr]    Compiling plotters v0.3.7
[INFO] [stderr]    Compiling rayon v1.11.0
[INFO] [stderr]    Compiling regex-automata v0.4.14
[INFO] [stderr]    Compiling zerocopy v0.8.48
[INFO] [stderr]    Compiling criterion-plot v0.5.0
[INFO] [stderr]    Compiling regex v1.12.3
[INFO] [stderr]    Compiling serde v1.0.228
[INFO] [stderr]    Compiling tinytemplate v1.2.1
[INFO] [stderr]    Compiling half v2.7.1
[INFO] [stderr]    Compiling ppv-lite86 v0.2.21
[INFO] [stderr]    Compiling ciborium-ll v0.2.2
[INFO] [stderr]    Compiling rand_chacha v0.3.1
[INFO] [stderr]    Compiling ciborium v0.2.2
[INFO] [stderr]    Compiling rand v0.8.5
[INFO] [stderr]    Compiling criterion v0.4.0
[INFO] [stderr]    Compiling heapz v1.1.4 (/opt/rustwide/workdir)
[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<T: DecreaseKey<i32, i32>>(
[INFO] [stdout]     |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) 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<T: DecreaseKey<i32, i32>>(
[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<T: DecreaseKey<i32, i32>>(
[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<T: DecreaseKey<i32, i32>>(
[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] [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)]` (part of `#[warn(unused)]`) 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<K, V>;
[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<K, V>;
[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<K: Hash + Eq + Clone, V: PartialOrd> {
[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)]` (part of `#[warn(unused)]`) 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<K, V> RankPairingHeap<K, V>
[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<K: Hash + Eq + Clone, V: PartialOrd> RankPairingHeap<K, V> {
[INFO] [stdout]     | --------------------------------------------------------------- methods in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 296 |     fn get_index<F: Fn(&Node<K, V>) -> 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 `test` profile [unoptimized + debuginfo] target(s) in 20.39s
[INFO] running `Command { std: "docker" "inspect" "ebaf222f331c7569d8e5de2265fe18441d1082dc59b5d2a5b99c105c5fcc983f", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "ebaf222f331c7569d8e5de2265fe18441d1082dc59b5d2a5b99c105c5fcc983f", kill_on_drop: false }`
[INFO] [stdout] ebaf222f331c7569d8e5de2265fe18441d1082dc59b5d2a5b99c105c5fcc983f
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+0abe69e6c16114311cc2700e972492e64d69c28f" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] 4631619fbb8fab8c494e721b3a088bacaa35b95186e77a36e8b3fe9c77a38a1f
[INFO] running `Command { std: "docker" "start" "-a" "4631619fbb8fab8c494e721b3a088bacaa35b95186e77a36e8b3fe9c77a38a1f", 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)]` (part of `#[warn(unused)]`) 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<K, V>;
[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<K, V>;
[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<K: Hash + Eq + Clone, V: PartialOrd> {
[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)]` (part of `#[warn(unused)]`) 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<K, V> RankPairingHeap<K, V>
[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<K: Hash + Eq + Clone, V: PartialOrd> RankPairingHeap<K, V> {
[INFO] [stderr]     | --------------------------------------------------------------- methods in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 296 |     fn get_index<F: Fn(&Node<K, V>) -> 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<T: DecreaseKey<i32, i32>>(
[INFO] [stderr]     |            ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]     |
[INFO] [stderr]     = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) 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<T: DecreaseKey<i32, i32>>(
[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<T: DecreaseKey<i32, i32>>(
[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<T: DecreaseKey<i32, i32>>(
[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` (test "linked") generated 8 warnings
[INFO] [stderr] warning: `heapz` (lib test) generated 7 warnings (7 duplicates)
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.10s
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/heapz-8d6b6f8dc41dbad8)
[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/debug/deps/linked-bc3b8927712844af)
[INFO] [stdout] 
[INFO] [stdout] running 18 tests
[INFO] [stdout] test pop::removes_the_first_value_from_max_heap ... ok
[INFO] [stdout] test push::adds_a_higher_item_to_the_heap_behind_a_lower_in_a_min_heap ... ok
[INFO] [stdout] test pop::removes_the_first_value_from_min_heap ... ok
[INFO] [stdout] test pop::returns_all_elements_from_largest_to_smallest_in_a_max_heap ... ok
[INFO] [stdout] test pop::returns_the_first_value_from_the_max_heap ... ok
[INFO] [stdout] test push::adds_a_value_to_the_heap ... ok
[INFO] [stdout] test pop::returns_none_if_the_max_heap_is_empty ... 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_lower_item_to_the_heap_behind_a_higher_in_a_max_heap ... ok
[INFO] [stdout] test pop::returns_the_first_value_from_the_min_heap ... ok
[INFO] [stdout] test pop::returns_all_elements_from_smallest_to_largest_in_a_min_heap ... ok
[INFO] [stdout] test push::adds_a_higher_item_to_the_heap_before_a_lower_in_a_max_heap ... ok
[INFO] [stdout] test pop::returns_none_if_the_min_heap_is_empty ... ok
[INFO] [stdout] test top::returns_none_if_the_heap_is_empty ... ok
[INFO] [stdout] test size::returns_the_correct_size_of_a_heap_after_removing_an_element ... ok
[INFO] [stdout] test top::returns_the_first_value_in_a_max_heap ... ok
[INFO] [stdout] test top::returns_the_first_value_in_a_min_heap ... ok
[INFO] [stdout] test size::returns_the_correct_size_of_a_heap_after_adding_elements ... 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/debug/deps/ranked-082ade1cebdcf69b)
[INFO] [stdout] 
[INFO] [stdout] running 120 tests
[INFO] [stdout] test multi_pass_max2::pop::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_max2::top::returns_none_if_the_heap_is_empty ... 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::push::adds_a_value_to_the_heap ... ok
[INFO] [stdout] test multi_pass_max::pop::returns_none_if_the_heap_is_empty ... 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_max2::pop::returns_the_first_value_from_the_heap ... ok
[INFO] [stdout] test multi_pass_max2::size::returns_the_first_value_in_a_heap ... ok
[INFO] [stdout] test multi_pass_max2::push::adds_a_higher_item_to_the_heap_behind_a_lower ... ok
[INFO] [stdout] test multi_pass_max::push::adds_a_value_to_the_heap ... ok
[INFO] [stdout] test multi_pass_max2::top::adds_a_higher_item_to_the_heap_behind_a_lower ... 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::delete::delete_an_element_by_key_after_pop ... ok
[INFO] [stdout] test multi_pass_max2::delete::delete_an_element_by_key ... 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_max2::update::updates_an_element_by_key_after_pop ... ok
[INFO] [stdout] test multi_pass_max::size::returns_the_first_value_in_a_heap ... ok
[INFO] [stdout] test multi_pass_max::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::size::returns_the_correct_size_of_a_heap_after_adding_elements ... ok
[INFO] [stdout] test multi_pass_max::pop::returns_all_elements_from_largest_to_smallest ... ok
[INFO] [stdout] test multi_pass_max::update::updates_an_element_by_key_after_pop ... ok
[INFO] [stdout] test multi_pass_min2::delete::delete_an_element_by_key ... ok
[INFO] [stdout] test multi_pass_min2::pop::returns_none_if_the_heap_is_empty ... 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::push::adds_a_lower_item_to_the_heap_before_a_higher ... ok
[INFO] [stdout] test multi_pass_min2::push::adds_a_value_to_the_heap ... ok
[INFO] [stdout] test multi_pass_min2::top::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_min2::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_max::delete::delete_an_element_by_key_after_pop ... ok
[INFO] [stdout] test multi_pass_min2::pop::removes_the_first_value_from_heap ... ok
[INFO] [stdout] test multi_pass_min2::top::adds_a_higher_item_to_the_heap_behind_a_lower ... 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_higher_item_to_the_heap_behind_a_lower ... ok
[INFO] [stdout] test multi_pass_min::push::adds_a_value_to_the_heap ... 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::size::returns_the_correct_size_of_a_heap_after_adding_elements ... 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 multi_pass_min2::size::returns_the_first_value_in_a_heap ... 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::pop::returns_the_first_value_from_the_heap ... ok
[INFO] [stdout] test multi_pass_max::update::updates_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_min::pop::removes_the_first_value_from_heap ... ok
[INFO] [stdout] test multi_pass_min2::update::updates_an_element_by_key ... ok
[INFO] [stdout] test multi_pass_min::delete::delete_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::push::adds_a_higher_item_to_the_heap_behind_a_lower ... ok
[INFO] [stdout] test single_pass_max2::pop::returns_none_if_the_heap_is_empty ... ok
[INFO] [stdout] test single_pass_max2::push::adds_a_lower_item_to_the_heap_before_a_higher ... ok
[INFO] [stdout] test single_pass_max2::push::adds_a_value_to_the_heap ... 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::top::adds_a_higher_item_to_the_heap_behind_a_lower ... ok
[INFO] [stdout] test single_pass_max2::size::returns_the_first_value_in_a_heap ... ok
[INFO] [stdout] test single_pass_max2::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::pop::returns_all_elements_from_largest_to_smallest ... ok
[INFO] [stdout] test single_pass_max2::top::returns_none_if_the_heap_is_empty ... ok
[INFO] [stdout] test single_pass_max2::pop::removes_the_first_value_from_heap ... ok
[INFO] [stdout] test single_pass_max::pop::returns_none_if_the_heap_is_empty ... ok
[INFO] [stdout] test multi_pass_min::delete::delete_an_element_by_key ... 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::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::pop::removes_the_first_value_from_heap ... 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_max2::pop::returns_all_elements_from_largest_to_smallest ... ok
[INFO] [stdout] test single_pass_max2::update::updates_an_element_by_key ... ok
[INFO] [stdout] test single_pass_max2::delete::delete_an_element_by_key ... ok
[INFO] [stdout] test single_pass_max2::pop::returns_all_elements_from_largest_to_smallest ... ok
[INFO] [stdout] test single_pass_max2::update::updates_an_element_by_key_after_pop ... ok
[INFO] [stdout] test single_pass_max2::delete::delete_an_element_by_key_after_pop ... ok
[INFO] [stdout] test single_pass_max::top::adds_a_higher_item_to_the_heap_behind_a_lower ... ok
[INFO] [stdout] test multi_pass_max::delete::delete_an_element_by_key ... 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::returns_none_if_the_heap_is_empty ... ok
[INFO] [stdout] test single_pass_max::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 multi_pass_min::update::updates_an_element_by_key_after_pop ... 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::pop::returns_none_if_the_heap_is_empty ... ok
[INFO] [stdout] test single_pass_max::delete::delete_an_element_by_key ... 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_max::delete::delete_an_element_by_key_after_pop ... ok
[INFO] [stdout] test single_pass_min2::top::returns_none_if_the_heap_is_empty ... ok
[INFO] [stdout] test single_pass_min2::size::returns_the_correct_size_of_a_heap_after_adding_elements ... ok
[INFO] [stdout] test single_pass_min2::pop::returns_the_first_value_from_the_heap ... 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::delete::delete_an_element_by_key ... ok
[INFO] [stdout] test single_pass_min2::size::returns_the_first_value_in_a_heap ... ok
[INFO] [stdout] test single_pass_min::push::adds_a_value_to_the_heap ... ok
[INFO] [stdout] test single_pass_min::push::adds_a_lower_item_to_the_heap_before_a_higher ... ok
[INFO] [stdout] test single_pass_max::update::updates_an_element_by_key ... ok
[INFO] [stdout] test single_pass_min2::pop::removes_the_first_value_from_heap ... 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::top::adds_a_higher_item_to_the_heap_behind_a_lower ... ok
[INFO] [stdout] test single_pass_min::pop::returns_none_if_the_heap_is_empty ... ok
[INFO] [stdout] test single_pass_min::size::returns_the_correct_size_of_a_heap_after_adding_elements ... ok
[INFO] [stdout] test single_pass_min2::delete::delete_an_element_by_key_after_pop ... ok
[INFO] [stdout] test single_pass_max::update::updates_an_element_by_key_after_pop ... ok
[INFO] [stdout] test single_pass_min::pop::removes_the_first_value_from_heap ... ok
[INFO] [stdout] test single_pass_min::top::returns_none_if_the_heap_is_empty ... ok
[INFO] [stdout] test single_pass_min::pop::returns_the_first_value_from_the_heap ... ok
[INFO] [stdout] test single_pass_min2::pop::returns_all_elements_from_largest_to_smallest ... ok
[INFO] [stdout] test single_pass_min::size::returns_the_first_value_in_a_heap ... ok
[INFO] [stdout] test single_pass_min::delete::delete_an_element_by_key ... ok
[INFO] [stdout] test single_pass_min2::update::updates_an_element_by_key_after_pop ... ok
[INFO] [stdout] test single_pass_min::delete::delete_an_element_by_key_after_pop ... ok
[INFO] [stdout] test single_pass_min::pop::returns_all_elements_from_largest_to_smallest ... ok
[INFO] [stdout] test single_pass_min2::update::updates_an_element_by_key ... ok
[INFO] [stdout] test single_pass_min::update::updates_an_element_by_key_after_pop ... ok
[INFO] [stdout] test single_pass_min::update::updates_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.15s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests heapz
[INFO] [stderr] warning: unknown lint: `rustdoc::missing_doc_code_examples`
[INFO] [stderr]  --> src/lib.rs:2:9
[INFO] [stderr]   |
[INFO] [stderr] 2 | #![deny(rustdoc::missing_doc_code_examples)]
[INFO] [stderr]   |         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: the `rustdoc::missing_doc_code_examples` lint is unstable
[INFO] [stderr]   = note: see issue #101730 <https://github.com/rust-lang/rust/issues/101730> for more information
[INFO] [stderr]   = help: add `#![feature(rustdoc_missing_doc_code_examples)]` to the crate attributes to enable
[INFO] [stderr]   = note: this compiler was built on 2026-03-19; consider upgrading it if it is out of date
[INFO] [stderr]   = note: `#[warn(unknown_lints)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: 1 warning emitted
[INFO] [stderr] 
[INFO] [stdout] 
[INFO] [stdout] running 32 tests
[INFO] [stdout] test src/lib.rs - Heap::top_mut (line 111) ... ok
[INFO] [stdout] test src/pairing_heap.rs - pairing_heap::PairingHeap<K,V>::size (line 143) ... ok
[INFO] [stdout] test src/lib.rs - Heap::pop (line 131) ... ok
[INFO] [stdout] test src/pairing_heap.rs - pairing_heap::PairingHeap<K,V>::min (line 45) ... ok
[INFO] [stdout] test src/pairing_heap.rs - pairing_heap::PairingHeap<K,V>::top (line 182) ... ok
[INFO] [stdout] test src/pairing_heap.rs - pairing_heap::PairingHeap<K,V>::is_empty (line 126) ... ok
[INFO] [stdout] test src/pairing_heap.rs - pairing_heap::PairingHeap<K,V>::top_mut (line 200) ... ok
[INFO] [stdout] test src/pairing_heap.rs - pairing_heap::PairingHeap<K,V>::max (line 56) ... ok
[INFO] [stdout] test src/lib.rs - Heap::top (line 92) ... ok
[INFO] [stdout] test src/pairing_heap.rs - pairing_heap::PairingHeap<K,V>::pop (line 218) ... ok
[INFO] [stdout] test src/lib.rs - Heap::push (line 74) ... ok
[INFO] [stdout] test src/lib.rs - Heap::is_empty (line 38) ... ok
[INFO] [stdout] test src/lib.rs - Heap::size (line 56) ... ok
[INFO] [stdout] test src/lib.rs - DecreaseKey::update (line 157) ... ok
[INFO] [stdout] test src/pairing_heap.rs - pairing_heap::PairingHeap<K,V>::push (line 160) ... ok
[INFO] [stdout] test src/rank_pairing_heap.rs - rank_pairing_heap::RankPairingHeap<K,V>::multi_pass_max (line 137) ... ok
[INFO] [stdout] test src/lib.rs - DecreaseKey::delete (line 180) ... ok
[INFO] [stdout] test src/rank_pairing_heap.rs - rank_pairing_heap::RankPairingHeap<K,V>::is_empty (line 716) ... ok
[INFO] [stdout] test src/rank_pairing_heap.rs - rank_pairing_heap::RankPairingHeap<K,V>::multi_pass_min2 (line 170) ... ok
[INFO] [stdout] test src/rank_pairing_heap.rs - rank_pairing_heap::RankPairingHeap<K,V>::multi_pass_min (line 159) ... ok
[INFO] [stdout] test src/rank_pairing_heap.rs - rank_pairing_heap::RankPairingHeap<K,V>::single_pass_min (line 115) ... ok
[INFO] [stdout] test src/rank_pairing_heap.rs - rank_pairing_heap::RankPairingHeap<K,V>::single_pass_max2 (line 104) ... ok
[INFO] [stdout] test src/rank_pairing_heap.rs - rank_pairing_heap::RankPairingHeap<K,V>::multi_pass_max2 (line 148) ... ok
[INFO] [stdout] test src/rank_pairing_heap.rs - rank_pairing_heap::RankPairingHeap<K,V>::single_pass_max (line 93) ... ok
[INFO] [stdout] test src/rank_pairing_heap.rs - rank_pairing_heap::RankPairingHeap<K,V>::single_pass_min2 (line 126) ... ok
[INFO] [stdout] test src/rank_pairing_heap.rs - rank_pairing_heap::RankPairingHeap<K,V>::delete (line 891) ... ok
[INFO] [stdout] test src/rank_pairing_heap.rs - rank_pairing_heap::RankPairingHeap<K,V>::push (line 750) ... ok
[INFO] [stdout] test src/rank_pairing_heap.rs - rank_pairing_heap::RankPairingHeap<K,V>::size (line 733) ... ok
[INFO] [stdout] test src/rank_pairing_heap.rs - rank_pairing_heap::RankPairingHeap<K,V>::update (line 840) ... ok
[INFO] [stdout] test src/rank_pairing_heap.rs - rank_pairing_heap::RankPairingHeap<K,V>::pop (line 804) ... ok
[INFO] [stdout] test src/rank_pairing_heap.rs - rank_pairing_heap::RankPairingHeap<K,V>::top (line 768) ... ok
[INFO] [stdout] test src/rank_pairing_heap.rs - rank_pairing_heap::RankPairingHeap<K,V>::top_mut (line 786) ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 32 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.99s
[INFO] [stdout] 
[INFO] running `Command { std: "docker" "inspect" "4631619fbb8fab8c494e721b3a088bacaa35b95186e77a36e8b3fe9c77a38a1f", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "4631619fbb8fab8c494e721b3a088bacaa35b95186e77a36e8b3fe9c77a38a1f", kill_on_drop: false }`
[INFO] [stdout] 4631619fbb8fab8c494e721b3a088bacaa35b95186e77a36e8b3fe9c77a38a1f
