[INFO] fetching crate prepona 0.1.0... [INFO] testing prepona-0.1.0 against master#cdb45c87e2cd43495379f7e867e3cc15dcee9f93 for pr-145838-1 [INFO] extracting crate prepona 0.1.0 into /workspace/builds/worker-1-tc1/source [INFO] started tweaking crates.io crate prepona 0.1.0 [INFO] finished tweaking crates.io crate prepona 0.1.0 [INFO] tweaked toml for crates.io crate prepona 0.1.0 written to /workspace/builds/worker-1-tc1/source/Cargo.toml [INFO] validating manifest of crates.io crate prepona 0.1.0 on toolchain cdb45c87e2cd43495379f7e867e3cc15dcee9f93 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+cdb45c87e2cd43495379f7e867e3cc15dcee9f93" "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" "+cdb45c87e2cd43495379f7e867e3cc15dcee9f93" "generate-lockfile" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Updating crates.io index [INFO] [stderr] Locking 4 packages to latest compatible versions [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+cdb45c87e2cd43495379f7e867e3cc15dcee9f93" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Downloading crates ... [INFO] [stderr] Downloaded magnitude v0.3.2 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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:7ad1b28ee6f5f7f699f6cf7015098d6ccdd96d6f2d78dd06228f5b4c9faf309c" "/opt/rustwide/cargo-home/bin/cargo" "+cdb45c87e2cd43495379f7e867e3cc15dcee9f93" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 03e1ed9b0f2236fa3f521fadd3b0cb43ebc1302ceac6639863c1bf010e9683d2 [INFO] running `Command { std: "docker" "start" "-a" "03e1ed9b0f2236fa3f521fadd3b0cb43ebc1302ceac6639863c1bf010e9683d2", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "03e1ed9b0f2236fa3f521fadd3b0cb43ebc1302ceac6639863c1bf010e9683d2", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "03e1ed9b0f2236fa3f521fadd3b0cb43ebc1302ceac6639863c1bf010e9683d2", kill_on_drop: false }` [INFO] [stdout] 03e1ed9b0f2236fa3f521fadd3b0cb43ebc1302ceac6639863c1bf010e9683d2 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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:7ad1b28ee6f5f7f699f6cf7015098d6ccdd96d6f2d78dd06228f5b4c9faf309c" "/opt/rustwide/cargo-home/bin/cargo" "+cdb45c87e2cd43495379f7e867e3cc15dcee9f93" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] b8864d39ba393ff4619fc2313ab37e392ff3691e161a04daac62f113e5c6fa08 [INFO] running `Command { std: "docker" "start" "-a" "b8864d39ba393ff4619fc2313ab37e392ff3691e161a04daac62f113e5c6fa08", kill_on_drop: false }` [INFO] [stderr] Compiling magnitude v0.3.2 [INFO] [stderr] Compiling prepona v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algo/has_cycle.rs:83:51 [INFO] [stdout] | [INFO] [stdout] 83 | pub fn execute(mut self, graph: &G) -> Option> [INFO] [stdout] | ^^ ^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is elided here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 83 | pub fn execute(mut self, graph: &G) -> Option> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/algo/mst/kruskal.rs:93:10 [INFO] [stdout] | [INFO] [stdout] 92 | graph: &'a G, [INFO] [stdout] | -- the lifetime is named here [INFO] [stdout] 93 | ) -> Subgraph [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 93 | ) -> Subgraph<'a, W, E, UndirectedEdge, G> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algo/shortest_path/bellman_ford.rs:97:16 [INFO] [stdout] | [INFO] [stdout] 97 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 98 | src_id: usize, [INFO] [stdout] 99 | ) -> Result> [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 99 | ) -> Result> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algo/shortest_path/dijkstra.rs:106:16 [INFO] [stdout] | [INFO] [stdout] 106 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 107 | src_id: usize, [INFO] [stdout] 108 | ) -> ShortestPathSubgraph [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 108 | ) -> ShortestPathSubgraph<'_, W, E, Ty, G> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: eliding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/algo/vertex_edge_cut.rs:90:82 [INFO] [stdout] | [INFO] [stdout] 90 | pub fn execute(mut self, graph: &'a G) -> (Vec, Vec<(usize, usize, &E)>) [INFO] [stdout] | -- the lifetime is named here ^^ the same lifetime is elided here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 90 | pub fn execute(mut self, graph: &'a G) -> (Vec, Vec<(usize, usize, &'a E)>) [INFO] [stdout] | ++ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.95s [INFO] running `Command { std: "docker" "inspect" "b8864d39ba393ff4619fc2313ab37e392ff3691e161a04daac62f113e5c6fa08", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "b8864d39ba393ff4619fc2313ab37e392ff3691e161a04daac62f113e5c6fa08", kill_on_drop: false }` [INFO] [stdout] b8864d39ba393ff4619fc2313ab37e392ff3691e161a04daac62f113e5c6fa08 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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:7ad1b28ee6f5f7f699f6cf7015098d6ccdd96d6f2d78dd06228f5b4c9faf309c" "/opt/rustwide/cargo-home/bin/cargo" "+cdb45c87e2cd43495379f7e867e3cc15dcee9f93" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] b5ddac4147c0e6437f2529fd9d88be7260cc62ce1d3ce8e6c84bbed69d5ce9c0 [INFO] running `Command { std: "docker" "start" "-a" "b5ddac4147c0e6437f2529fd9d88be7260cc62ce1d3ce8e6c84bbed69d5ce9c0", kill_on_drop: false }` [INFO] [stderr] Compiling prepona v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algo/has_cycle.rs:83:51 [INFO] [stdout] | [INFO] [stdout] 83 | pub fn execute(mut self, graph: &G) -> Option> [INFO] [stdout] | ^^ ^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is elided here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 83 | pub fn execute(mut self, graph: &G) -> Option> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/algo/mst/kruskal.rs:93:10 [INFO] [stdout] | [INFO] [stdout] 92 | graph: &'a G, [INFO] [stdout] | -- the lifetime is named here [INFO] [stdout] 93 | ) -> Subgraph [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 93 | ) -> Subgraph<'a, W, E, UndirectedEdge, G> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algo/shortest_path/bellman_ford.rs:97:16 [INFO] [stdout] | [INFO] [stdout] 97 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 98 | src_id: usize, [INFO] [stdout] 99 | ) -> Result> [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 99 | ) -> Result> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algo/shortest_path/dijkstra.rs:106:16 [INFO] [stdout] | [INFO] [stdout] 106 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 107 | src_id: usize, [INFO] [stdout] 108 | ) -> ShortestPathSubgraph [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 108 | ) -> ShortestPathSubgraph<'_, W, E, Ty, G> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: eliding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/algo/vertex_edge_cut.rs:90:82 [INFO] [stdout] | [INFO] [stdout] 90 | pub fn execute(mut self, graph: &'a G) -> (Vec, Vec<(usize, usize, &E)>) [INFO] [stdout] | -- the lifetime is named here ^^ the same lifetime is elided here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 90 | pub fn execute(mut self, graph: &'a G) -> (Vec, Vec<(usize, usize, &'a E)>) [INFO] [stdout] | ++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algo/has_cycle.rs:83:51 [INFO] [stdout] | [INFO] [stdout] 83 | pub fn execute(mut self, graph: &G) -> Option> [INFO] [stdout] | ^^ ^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is elided here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 83 | pub fn execute(mut self, graph: &G) -> Option> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/algo/mst/kruskal.rs:93:10 [INFO] [stdout] | [INFO] [stdout] 92 | graph: &'a G, [INFO] [stdout] | -- the lifetime is named here [INFO] [stdout] 93 | ) -> Subgraph [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 93 | ) -> Subgraph<'a, W, E, UndirectedEdge, G> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algo/shortest_path/bellman_ford.rs:97:16 [INFO] [stdout] | [INFO] [stdout] 97 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 98 | src_id: usize, [INFO] [stdout] 99 | ) -> Result> [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 99 | ) -> Result> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algo/shortest_path/dijkstra.rs:106:16 [INFO] [stdout] | [INFO] [stdout] 106 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 107 | src_id: usize, [INFO] [stdout] 108 | ) -> ShortestPathSubgraph [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 108 | ) -> ShortestPathSubgraph<'_, W, E, Ty, G> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: eliding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/algo/vertex_edge_cut.rs:90:82 [INFO] [stdout] | [INFO] [stdout] 90 | pub fn execute(mut self, graph: &'a G) -> (Vec, Vec<(usize, usize, &E)>) [INFO] [stdout] | -- the lifetime is named here ^^ the same lifetime is elided here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 90 | pub fn execute(mut self, graph: &'a G) -> (Vec, Vec<(usize, usize, &'a E)>) [INFO] [stdout] | ++ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 3.62s [INFO] running `Command { std: "docker" "inspect" "b5ddac4147c0e6437f2529fd9d88be7260cc62ce1d3ce8e6c84bbed69d5ce9c0", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "b5ddac4147c0e6437f2529fd9d88be7260cc62ce1d3ce8e6c84bbed69d5ce9c0", kill_on_drop: false }` [INFO] [stdout] b5ddac4147c0e6437f2529fd9d88be7260cc62ce1d3ce8e6c84bbed69d5ce9c0 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-1-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:7ad1b28ee6f5f7f699f6cf7015098d6ccdd96d6f2d78dd06228f5b4c9faf309c" "/opt/rustwide/cargo-home/bin/cargo" "+cdb45c87e2cd43495379f7e867e3cc15dcee9f93" "test" "--frozen", kill_on_drop: false }` [INFO] [stdout] 67a7d0ac79f41602de113f50aafeabe8eb56f6eb78a9cf12d8b71b839a1d3342 [INFO] running `Command { std: "docker" "start" "-a" "67a7d0ac79f41602de113f50aafeabe8eb56f6eb78a9cf12d8b71b839a1d3342", kill_on_drop: false }` [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algo/has_cycle.rs:83:51 [INFO] [stderr] | [INFO] [stderr] 83 | pub fn execute(mut self, graph: &G) -> Option> [INFO] [stderr] | ^^ ^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here [INFO] [stderr] | | [INFO] [stderr] | the lifetime is elided here [INFO] [stderr] | [INFO] [stderr] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stderr] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stderr] help: use `'_` for type paths [INFO] [stderr] | [INFO] [stderr] 83 | pub fn execute(mut self, graph: &G) -> Option> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's named elsewhere is confusing [INFO] [stderr] --> src/algo/mst/kruskal.rs:93:10 [INFO] [stderr] | [INFO] [stderr] 92 | graph: &'a G, [INFO] [stderr] | -- the lifetime is named here [INFO] [stderr] 93 | ) -> Subgraph [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here [INFO] [stderr] | [INFO] [stderr] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stderr] help: consistently use `'a` [INFO] [stderr] | [INFO] [stderr] 93 | ) -> Subgraph<'a, W, E, UndirectedEdge, G> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algo/shortest_path/bellman_ford.rs:97:16 [INFO] [stderr] | [INFO] [stderr] 97 | graph: &G, [INFO] [stderr] | ^^ the lifetime is elided here [INFO] [stderr] 98 | src_id: usize, [INFO] [stderr] 99 | ) -> Result> [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here [INFO] [stderr] | [INFO] [stderr] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stderr] help: use `'_` for type paths [INFO] [stderr] | [INFO] [stderr] 99 | ) -> Result> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algo/shortest_path/dijkstra.rs:106:16 [INFO] [stderr] | [INFO] [stderr] 106 | graph: &G, [INFO] [stderr] | ^^ the lifetime is elided here [INFO] [stderr] 107 | src_id: usize, [INFO] [stderr] 108 | ) -> ShortestPathSubgraph [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here [INFO] [stderr] | [INFO] [stderr] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stderr] help: use `'_` for type paths [INFO] [stderr] | [INFO] [stderr] 108 | ) -> ShortestPathSubgraph<'_, W, E, Ty, G> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: eliding a lifetime that's named elsewhere is confusing [INFO] [stderr] --> src/algo/vertex_edge_cut.rs:90:82 [INFO] [stderr] | [INFO] [stderr] 90 | pub fn execute(mut self, graph: &'a G) -> (Vec, Vec<(usize, usize, &E)>) [INFO] [stderr] | -- the lifetime is named here ^^ the same lifetime is elided here [INFO] [stderr] | [INFO] [stderr] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stderr] help: consistently use `'a` [INFO] [stderr] | [INFO] [stderr] 90 | pub fn execute(mut self, graph: &'a G) -> (Vec, Vec<(usize, usize, &'a E)>) [INFO] [stderr] | ++ [INFO] [stderr] [INFO] [stderr] warning: `prepona` (lib) generated 5 warnings (run `cargo fix --lib -p prepona` to apply 5 suggestions) [INFO] [stderr] warning: `prepona` (lib test) generated 5 warnings (5 duplicates) [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.05s [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/prepona-4991902f0fd5c1be) [INFO] [stdout] [INFO] [stdout] running 153 tests [INFO] [stdout] test algo::cc::cc::tests::empty_graph ... ok [INFO] [stdout] test algo::cc::tarjan::tests::empty_graph ... ok [INFO] [stdout] test algo::cc::tarjan::tests::graph_with_no_edge ... ok [INFO] [stdout] test algo::cc::cc::tests::trivial_graph ... ok [INFO] [stdout] test algo::cc::cc::tests::graph_with_one_component ... ok [INFO] [stdout] test algo::cc::cc::tests::graph_with_no_edge ... ok [INFO] [stdout] test algo::cc::tarjan::tests::single_component_graph ... ok [INFO] [stdout] test algo::cc::tarjan::tests::trivial_graph ... ok [INFO] [stdout] test algo::eulerian::tests::calling_trail_on_directed_graph_with_circuit ... ok [INFO] [stdout] test algo::eulerian::tests::complex_undirected_graph_with_eulerian_circuit ... ok [INFO] [stdout] test algo::eulerian::tests::calling_trail_on_undirected_graph_with_circuit ... ok [INFO] [stdout] test algo::eulerian::tests::complex_directed_graph_with_eulerian_trail ... ok [INFO] [stdout] test algo::eulerian::tests::complex_directed_graph_with_eulerian_circuit ... ok [INFO] [stdout] test algo::eulerian::tests::complex_undirected_graph_with_eulerian_trail ... ok [INFO] [stdout] test algo::eulerian::tests::one_vertex_directed_graph_circuit ... ok [INFO] [stdout] test algo::eulerian::tests::one_vertex_directed_graph_trail ... ok [INFO] [stdout] test algo::eulerian::tests::one_vertex_undirected_graph_circuit ... ok [INFO] [stdout] test algo::eulerian::tests::trivial_directed_graph_with_eulerian_circuit ... ok [INFO] [stdout] test algo::eulerian::tests::trivial_directed_graph_with_eulerian_trail ... ok [INFO] [stdout] test algo::eulerian::tests::trivial_undirected_graph_with_eulerian_circuit2 ... ok [INFO] [stdout] test algo::eulerian::tests::trivial_undirected_graph_with_eulerian_trail ... ok [INFO] [stdout] test algo::eulerian::tests::one_vertex_undirected_graph_trail ... ok [INFO] [stdout] test algo::eulerian::tests::trivial_directed_graph_with_eulerian_circuit2 ... ok [INFO] [stdout] test algo::eulerian::tests::undirected_graph_with_start_other_than_0 ... ok [INFO] [stdout] test algo::has_cycle::tests::empty_undirected_graph ... ok [INFO] [stdout] test algo::has_cycle::tests::trivial_undirected_graph ... ok [INFO] [stdout] test algo::has_cycle::tests::empty_directed_graph ... ok [INFO] [stdout] test algo::has_cycle::tests::trivial_directed_graph_with_cycle ... ok [INFO] [stdout] test algo::eulerian::tests::trivial_undirected_graph_with_eulerian_circuit ... ok [INFO] [stdout] test algo::has_cycle::tests::trivial_directed_graph_without_cycle ... ok [INFO] [stdout] test algo::has_cycle::tests::two_node_undirected ... ok [INFO] [stdout] test algo::mst::kruskal::tests::empty_graph ... ok [INFO] [stdout] test algo::shortest_path::bellman_ford::tests::directed_graph_with_negative_cycle ... ok [INFO] [stdout] test algo::has_cycle::tests::trivial_undirected_graph_without_cycle ... ok [INFO] [stdout] test algo::has_cycle::tests::two_node_directed ... ok [INFO] [stdout] test algo::mst::kruskal::tests::trivial_directed_graph ... ok [INFO] [stdout] test algo::shortest_path::bellman_ford::tests::one_vertex_directed_graph ... ok [INFO] [stdout] test algo::shortest_path::bellman_ford::tests::one_vertex_undirected_graph ... ok [INFO] [stdout] test algo::shortest_path::bellman_ford::tests::undirected_graph_with_negative_walk ... ok [INFO] [stdout] test algo::shortest_path::dijkstra::tests::one_vertex_directed_graph ... ok [INFO] [stdout] test algo::shortest_path::bellman_ford::tests::trivial_directed_graph ... ok [INFO] [stdout] test algo::shortest_path::bellman_ford::tests::trivial_undirected_graph ... ok [INFO] [stdout] test algo::shortest_path::dijkstra::tests::one_vertex_undirected_graph ... ok [INFO] [stdout] test algo::shortest_path::bellman_ford::tests::undirected_graph_with_negative_cycle ... ok [INFO] [stdout] test algo::shortest_path::dijkstra::tests::trivial_directed_graph ... ok [INFO] [stdout] test algo::shortest_path::dijkstra::tests::trivial_undirected_graph ... ok [INFO] [stdout] test algo::shortest_path::floyd_warshall::tests::empty_directed_graph ... ok [INFO] [stdout] test algo::shortest_path::floyd_warshall::tests::directed_graph_with_negative_cycle ... ok [INFO] [stdout] test algo::shortest_path::floyd_warshall::tests::empty_undirected_graph ... ok [INFO] [stdout] test algo::shortest_path::floyd_warshall::tests::trivial_directed_graph ... ok [INFO] [stdout] test algo::shortest_path::floyd_warshall::tests::trivial_undirected_graph ... ok [INFO] [stdout] test algo::shortest_path::floyd_warshall::tests::undirected_graph_with_negative_cycle ... ok [INFO] [stdout] test algo::shortest_path::floyd_warshall::tests::undirected_graph_with_negative_walk ... ok [INFO] [stdout] test algo::traversal::dfs::tests::empty_directed_graph ... ok [INFO] [stdout] test algo::topological_sort::tests::empty_graph ... ok [INFO] [stdout] test algo::traversal::dfs::tests::empty_undirected_graph ... ok [INFO] [stdout] test algo::traversal::dfs::tests::not_connected_undirected_graph ... ok [INFO] [stdout] test algo::traversal::dfs::tests::single_vertex_directed_graph ... ok [INFO] [stdout] test algo::traversal::dfs::tests::not_strongly_connected_directed_graph ... ok [INFO] [stdout] test algo::topological_sort::tests::one_vertex_graph ... ok [INFO] [stdout] test algo::vertex_edge_cut::tests::complex_graph ... ok [INFO] [stdout] test algo::topological_sort::tests::trivial_graph ... ok [INFO] [stdout] test algo::traversal::dfs::tests::single_vertex_undirected_graph ... ok [INFO] [stdout] test algo::traversal::dfs::tests::trivial_directed_graph ... ok [INFO] [stdout] test algo::traversal::dfs::tests::trivial_directed_graph_2 ... ok [INFO] [stdout] test algo::vertex_edge_cut::tests::non_bridge_edge_between_two_cut_vertices ... ok [INFO] [stdout] test algo::vertex_edge_cut::tests::empty_graph ... ok [INFO] [stdout] test algo::vertex_edge_cut::tests::one_vertex_graph ... ok [INFO] [stdout] test algo::traversal::dfs::tests::trivial_undirected_graph ... ok [INFO] [stdout] test algo::vertex_edge_cut::tests::trivial_graph ... ok [INFO] [stdout] test algo::vertex_edge_cut::tests::two_vertex_graph ... ok [INFO] [stdout] test algo::vertex_edge_cut::tests::trivial_graph_2 ... ok [INFO] [stdout] test graph::edge::default_edge::tests::from_triplet ... ok [INFO] [stdout] test graph::edge::default_edge::tests::init ... ok [INFO] [stdout] test graph::edge::default_edge::tests::set_weight ... ok [INFO] [stdout] test graph::edge::flow_edge::tests::from_quintuplet_with_flow_larger_than_capacity ... ok [INFO] [stdout] test graph::edge::flow_edge::tests::init_with ... ok [INFO] [stdout] test graph::edge::flow_edge::tests::from_triplet ... ok [INFO] [stdout] test graph::edge::flow_edge::tests::from_quintuplet ... ok [INFO] [stdout] test graph::edge::flow_edge::tests::set_flow ... ok [INFO] [stdout] test graph::edge::flow_edge::tests::set_capacity ... ok [INFO] [stdout] test graph::edge::flow_edge::tests::set_weight ... ok [INFO] [stdout] test graph::edge::flow_edge::tests::init ... ok [INFO] [stdout] test graph::edge::tests::test_directed_edge ... ok [INFO] [stdout] test graph::edge::tests::test_undirected_edge ... ok [INFO] [stdout] test provide::id_map::tests::get_virt_to_real ... ok [INFO] [stdout] test provide::id_map::tests::init ... ok [INFO] [stdout] test provide::id_map::tests::get_real_to_virt ... ok [INFO] [stdout] test algo::eulerian::tests::directed_graph_with_start_other_than_0 ... ok [INFO] [stdout] test provide::id_map::tests::put_real_to_virt ... ok [INFO] [stdout] test provide::id_map::tests::put_virt_to_real ... ok [INFO] [stdout] test storage::adj_list::tests::directed_add_edge ... ok [INFO] [stdout] test storage::adj_list::tests::directed_add_vertex_after_vertex_deletion ... ok [INFO] [stdout] test storage::adj_list::tests::directed_delete_vertex ... ok [INFO] [stdout] test storage::adj_list::tests::directed_empty_list ... ok [INFO] [stdout] test storage::adj_list::tests::directed_add_vertex ... ok [INFO] [stdout] test storage::adj_list::tests::directed_remove_edge ... ok [INFO] [stdout] test storage::adj_list::tests::directed_update_edge ... ok [INFO] [stdout] test storage::adj_list::tests::edge_count ... ok [INFO] [stdout] test storage::adj_list::tests::undirected_add_edge ... ok [INFO] [stdout] test storage::adj_list::tests::undirected_add_vertex ... ok [INFO] [stdout] test storage::adj_list::tests::undirected_add_vertex_after_vertex_deletion ... ok [INFO] [stdout] test storage::adj_list::tests::directed_has_edge ... ok [INFO] [stdout] test storage::adj_list::tests::directed_neighbors ... ok [INFO] [stdout] test storage::adj_list::tests::undirected_has_edge ... ok [INFO] [stdout] test storage::adj_list::tests::undirected_delete_vertex ... ok [INFO] [stdout] test storage::adj_list::tests::undirected_empty_list ... ok [INFO] [stdout] test storage::adj_list::tests::undirected_neighbors ... ok [INFO] [stdout] test storage::adj_list::tests::undirected_remove_edge ... ok [INFO] [stdout] test storage::adj_map::tests::directed_add_edge ... ok [INFO] [stdout] test storage::adj_list::tests::undirected_update_edge ... ok [INFO] [stdout] test storage::adj_map::tests::directed_add_vertex_after_vertex_deletion ... ok [INFO] [stdout] test storage::adj_map::tests::directed_add_vertex ... ok [INFO] [stdout] test storage::adj_map::tests::directed_delete_vertex ... ok [INFO] [stdout] test storage::adj_map::tests::directed_has_edge ... ok [INFO] [stdout] test storage::adj_map::tests::directed_neighbors ... ok [INFO] [stdout] test storage::adj_map::tests::directed_empty_map ... ok [INFO] [stdout] test storage::adj_map::tests::directed_remove_edge ... ok [INFO] [stdout] test storage::adj_map::tests::directed_update_edge ... ok [INFO] [stdout] test storage::adj_map::tests::undirected_add_edge ... ok [INFO] [stdout] test storage::adj_map::tests::undirected_add_vertex ... ok [INFO] [stdout] test storage::adj_map::tests::undirected_add_vertex_after_vertex_deletion ... ok [INFO] [stdout] test storage::adj_map::tests::edge_count ... ok [INFO] [stdout] test storage::adj_map::tests::undirected_delete_vertex ... ok [INFO] [stdout] test storage::adj_map::tests::undirected_empty_map ... ok [INFO] [stdout] test storage::adj_map::tests::undirected_has_edge ... ok [INFO] [stdout] test storage::adj_map::tests::undirected_neighbors ... ok [INFO] [stdout] test storage::adj_map::tests::undirected_remove_edge ... ok [INFO] [stdout] test storage::adj_matrix::tests::directed_add_vertex ... ok [INFO] [stdout] test storage::adj_map::tests::undirected_update_edge ... ok [INFO] [stdout] test storage::adj_matrix::tests::directed_add_edge ... ok [INFO] [stdout] test storage::adj_matrix::tests::directed_delete_vertex ... ok [INFO] [stdout] test graph::edge::flow_edge::tests::init_with_flow_larger_than_capacity - should panic ... ok [INFO] [stdout] test graph::edge::flow_edge::tests::set_flow_larger_than_capacity - should panic ... ok [INFO] [stdout] test graph::edge::flow_edge::tests::set_capacity_smaller_than_flow - should panic ... ok [INFO] [stdout] test graph::structs::simple_graph::tests::add_loop ... ok [INFO] [stdout] test graph::structs::simple_graph::tests::add_multiple_edge ... ok [INFO] [stdout] test storage::adj_matrix::tests::directed_empty_matrix ... ok [INFO] [stdout] test storage::adj_matrix::tests::directed_has_edge ... ok [INFO] [stdout] test storage::adj_matrix::tests::directed_add_vertex_after_vertex_deletion ... ok [INFO] [stdout] test storage::adj_matrix::tests::directed_update_edge ... ok [INFO] [stdout] test storage::adj_matrix::tests::edge_count ... ok [INFO] [stdout] test storage::adj_matrix::tests::undirected_add_vertex ... ok [INFO] [stdout] test storage::adj_matrix::tests::undirected_empty_matrix ... ok [INFO] [stdout] test storage::adj_matrix::tests::directed_neighbors ... ok [INFO] [stdout] test storage::adj_matrix::tests::undirected_has_edge ... ok [INFO] [stdout] test storage::adj_matrix::tests::undirected_delete_vertex ... ok [INFO] [stdout] test storage::adj_matrix::tests::undirected_add_vertex_after_vertex_deletion ... ok [INFO] [stdout] test storage::adj_matrix::tests::undirected_add_edge ... ok [INFO] [stdout] test storage::adj_matrix::tests::directed_remove_edge ... ok [INFO] [stdout] test storage::adj_matrix::tests::undirected_neighbors ... ok [INFO] [stderr] Doc-tests prepona [INFO] [stdout] test storage::adj_matrix::tests::undirected_remove_edge ... ok [INFO] [stdout] test storage::adj_matrix::tests::undirected_update_edge ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 153 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.05s [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] running 14 tests [INFO] [stdout] test src/algo/shortest_path/dijkstra.rs - algo::shortest_path::dijkstra::Dijkstra (line 15) ... ok [INFO] [stdout] test src/algo/cc/cc.rs - algo::cc::cc::ConnectedComponents (line 8) ... ok [INFO] [stdout] test src/algo/cc/tarjan.rs - algo::cc::tarjan::TarjanSCC (line 9) ... ok [INFO] [stdout] test src/algo/eulerian.rs - algo::eulerian::Eulerian (line 14) ... ok [INFO] [stdout] test src/algo/shortest_path/floyd_warshall.rs - algo::shortest_path::floyd_warshall::FloydWarshall (line 14) ... ok [INFO] [stdout] test src/graph/structs/simple_graph.rs - graph::structs::simple_graph::SimpleGraph::init (line 57) ... ok [INFO] [stdout] test src/algo/has_cycle.rs - algo::has_cycle::HasCycle (line 11) ... ok [INFO] [stdout] test src/storage/adj_list/mod.rs - storage::adj_list::AdjList::init (line 70) ... ok [INFO] [stdout] test src/storage/adj_map/mod.rs - storage::adj_map::AdjMap::init (line 74) ... ok [INFO] [stdout] test src/algo/vertex_edge_cut.rs - algo::vertex_edge_cut::VertexEdgeCut (line 13) ... ok [INFO] [stdout] test src/storage/adj_matrix/mod.rs - storage::adj_matrix::AdjMatrix::init (line 74) ... ok [INFO] [stdout] test src/algo/mst/kruskal.rs - algo::mst::kruskal::Kruskal (line 11) ... ok [INFO] [stdout] test src/algo/shortest_path/bellman_ford.rs - algo::shortest_path::bellman_ford::BellmanFord (line 17) ... ok [INFO] [stdout] test src/algo/topological_sort.rs - algo::topological_sort::TopologicalSort (line 8) ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 14 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 3.02s [INFO] [stdout] [INFO] running `Command { std: "docker" "inspect" "67a7d0ac79f41602de113f50aafeabe8eb56f6eb78a9cf12d8b71b839a1d3342", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "67a7d0ac79f41602de113f50aafeabe8eb56f6eb78a9cf12d8b71b839a1d3342", kill_on_drop: false }` [INFO] [stdout] 67a7d0ac79f41602de113f50aafeabe8eb56f6eb78a9cf12d8b71b839a1d3342