[INFO] cloning repository https://github.com/Steditor/Enumeration-of-Solution-Parts [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/Steditor/Enumeration-of-Solution-Parts" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FSteditor%2FEnumeration-of-Solution-Parts", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FSteditor%2FEnumeration-of-Solution-Parts'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 079c845051f78e9f6dbfc857db91c3e18ed0ac39 [INFO] testing Steditor/Enumeration-of-Solution-Parts against master#ad85bc524b1ad696e42061ad8338d382dffbdbe5 for pr-146237 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FSteditor%2FEnumeration-of-Solution-Parts" "/workspace/builds/worker-0-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-0-tc1/source'... [INFO] [stderr] done. [INFO] removed /workspace/builds/worker-0-tc1/source/rust-toolchain.toml [INFO] started tweaking git repo https://github.com/Steditor/Enumeration-of-Solution-Parts [INFO] finished tweaking git repo https://github.com/Steditor/Enumeration-of-Solution-Parts [INFO] tweaked toml for git repo https://github.com/Steditor/Enumeration-of-Solution-Parts written to /workspace/builds/worker-0-tc1/source/Cargo.toml [INFO] validating manifest of git repo https://github.com/Steditor/Enumeration-of-Solution-Parts on toolchain ad85bc524b1ad696e42061ad8338d382dffbdbe5 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ad85bc524b1ad696e42061ad8338d382dffbdbe5" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] crate git repo https://github.com/Steditor/Enumeration-of-Solution-Parts already has a lockfile, it will not be regenerated [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ad85bc524b1ad696e42061ad8338d382dffbdbe5" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Updating crates.io index [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stderr] Downloading crates ... [INFO] [stderr] Downloaded protobuf-codegen v3.7.2 [INFO] [stderr] Downloaded pub-iterator-type v0.1.1 [INFO] [stderr] Downloaded flat_map v0.0.10 [INFO] [stderr] Downloaded par-map v0.1.4 [INFO] [stderr] Downloaded osmpbfreader v0.17.0 [INFO] [stderr] Downloaded osm4routing v0.7.2 [INFO] [stderr] Downloaded binary-heap-plus v0.5.0 [INFO] [stderr] Downloaded rstest v0.23.0 [INFO] [stderr] Downloaded protobuf-parse v3.7.2 [INFO] [stderr] Downloaded compare v0.1.0 [INFO] [stderr] Downloaded protobuf-support v3.7.2 [INFO] [stderr] Downloaded svg v0.18.0 [INFO] [stderr] Downloaded protobuf v3.7.2 [INFO] [stderr] Downloaded rstest_macros v0.23.0 [INFO] [stderr] Downloaded testdrop v0.1.2 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-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" "+ad85bc524b1ad696e42061ad8338d382dffbdbe5" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] b26cad2a1b1ef84e8be5baf4266bcc4eefd9ff7efc8466a4423158b26d8d11a2 [INFO] running `Command { std: "docker" "start" "-a" "b26cad2a1b1ef84e8be5baf4266bcc4eefd9ff7efc8466a4423158b26d8d11a2", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "b26cad2a1b1ef84e8be5baf4266bcc4eefd9ff7efc8466a4423158b26d8d11a2", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "b26cad2a1b1ef84e8be5baf4266bcc4eefd9ff7efc8466a4423158b26d8d11a2", kill_on_drop: false }` [INFO] [stdout] b26cad2a1b1ef84e8be5baf4266bcc4eefd9ff7efc8466a4423158b26d8d11a2 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-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" "+ad85bc524b1ad696e42061ad8338d382dffbdbe5" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] f159a7a1d6760282e54ec5789888edfe50faeb15bc1a24dbf09a0be22f2668d1 [INFO] running `Command { std: "docker" "start" "-a" "f159a7a1d6760282e54ec5789888edfe50faeb15bc1a24dbf09a0be22f2668d1", kill_on_drop: false }` [INFO] [stderr] Compiling libc v0.2.172 [INFO] [stderr] Compiling smallvec v1.15.0 [INFO] [stderr] Compiling hashbrown v0.15.2 [INFO] [stderr] Compiling libm v0.2.13 [INFO] [stderr] Compiling num-traits v0.2.19 [INFO] [stderr] Compiling cc v1.2.20 [INFO] [stderr] Compiling bitflags v2.9.0 [INFO] [stderr] Compiling serde v1.0.219 [INFO] [stderr] Compiling getrandom v0.3.2 [INFO] [stderr] Compiling syn v2.0.101 [INFO] [stderr] Compiling litemap v0.7.5 [INFO] [stderr] Compiling icu_locid_transform_data v1.5.1 [INFO] [stderr] Compiling rustix v1.0.5 [INFO] [stderr] Compiling rustix v0.38.44 [INFO] [stderr] Compiling protobuf v3.7.2 [INFO] [stderr] Compiling icu_properties_data v1.5.1 [INFO] [stderr] Compiling linux-raw-sys v0.9.4 [INFO] [stderr] Compiling linux-raw-sys v0.4.15 [INFO] [stderr] Compiling anyhow v1.0.98 [INFO] [stderr] Compiling aho-corasick v1.1.3 [INFO] [stderr] Compiling home v0.5.11 [INFO] [stderr] Compiling either v1.15.0 [INFO] [stderr] Compiling regex-syntax v0.8.5 [INFO] [stderr] Compiling icu_normalizer_data v1.5.1 [INFO] [stderr] Compiling fastrand v2.3.0 [INFO] [stderr] Compiling openssl v0.10.72 [INFO] [stderr] Compiling tracing v0.1.41 [INFO] [stderr] Compiling indexmap v2.9.0 [INFO] [stderr] Compiling zerocopy v0.8.25 [INFO] [stderr] Compiling smartstring v1.0.1 [INFO] [stderr] Compiling anstyle-parse v0.2.6 [INFO] [stderr] Compiling futures-channel v0.3.31 [INFO] [stderr] Compiling futures v0.1.31 [INFO] [stderr] Compiling anstyle-query v1.1.2 [INFO] [stderr] Compiling colorchoice v1.0.3 [INFO] [stderr] Compiling miniz_oxide v0.8.8 [INFO] [stderr] Compiling anstream v0.6.18 [INFO] [stderr] Compiling portable-atomic v1.11.0 [INFO] [stderr] Compiling clap_lex v0.7.4 [INFO] [stderr] Compiling time-core v0.1.4 [INFO] [stderr] Compiling pub-iterator-type v0.1.1 [INFO] [stderr] Compiling time-macros v0.2.22 [INFO] [stderr] Compiling openssl-sys v0.9.107 [INFO] [stderr] Compiling deranged v0.4.0 [INFO] [stderr] Compiling clap_builder v4.5.37 [INFO] [stderr] Compiling parking_lot_core v0.9.10 [INFO] [stderr] Compiling mio v1.0.3 [INFO] [stderr] Compiling socket2 v0.5.9 [INFO] [stderr] Compiling signal-hook-registry v1.4.5 [INFO] [stderr] Compiling parking_lot v0.12.3 [INFO] [stderr] Compiling regex-automata v0.4.9 [INFO] [stderr] Compiling native-tls v0.2.14 [INFO] [stderr] Compiling num_cpus v1.16.0 [INFO] [stderr] Compiling tempfile v3.19.1 [INFO] [stderr] Compiling getrandom v0.2.16 [INFO] [stderr] Compiling flate2 v1.1.1 [INFO] [stderr] Compiling num-integer v0.1.46 [INFO] [stderr] Compiling rand_core v0.6.4 [INFO] [stderr] Compiling futures-cpupool v0.1.8 [INFO] [stderr] Compiling csv-core v0.1.12 [INFO] [stderr] Compiling sync_wrapper v1.0.2 [INFO] [stderr] Compiling self_cell v1.2.0 [INFO] [stderr] Compiling unicode-width v0.2.0 [INFO] [stderr] Compiling num_threads v0.1.7 [INFO] [stderr] Compiling rustls-pki-types v1.11.0 [INFO] [stderr] Compiling colored v2.2.0 [INFO] [stderr] Compiling num-bigint v0.4.6 [INFO] [stderr] Compiling par-map v0.1.4 [INFO] [stderr] Compiling num-iter v0.1.45 [INFO] [stderr] Compiling ppv-lite86 v0.2.21 [INFO] [stderr] Compiling rustls-pemfile v2.2.0 [INFO] [stderr] Compiling time v0.3.41 [INFO] [stderr] Compiling console v0.15.11 [INFO] [stderr] Compiling geo-types v0.7.16 [INFO] [stderr] Compiling num-complex v0.4.6 [INFO] [stderr] Compiling encoding_rs v0.8.35 [INFO] [stderr] Compiling rand_chacha v0.3.1 [INFO] [stderr] Compiling number_prefix v0.4.0 [INFO] [stderr] Compiling compare v0.1.0 [INFO] [stderr] Compiling rand v0.8.5 [INFO] [stderr] Compiling indicatif v0.17.11 [INFO] [stderr] Compiling walkdir v2.5.0 [INFO] [stderr] Compiling rand_pcg v0.3.1 [INFO] [stderr] Compiling binary-heap-plus v0.5.0 [INFO] [stderr] Compiling itertools v0.14.0 [INFO] [stderr] Compiling float-cmp v0.10.0 [INFO] [stderr] Compiling which v4.4.2 [INFO] [stderr] Compiling svg v0.18.0 [INFO] [stderr] Compiling num-rational v0.4.2 [INFO] [stderr] Compiling num v0.4.3 [INFO] [stderr] Compiling simple_logger v5.0.0 [INFO] [stderr] Compiling regex v1.11.1 [INFO] [stderr] Compiling synstructure v0.13.1 [INFO] [stderr] Compiling zerofrom-derive v0.1.6 [INFO] [stderr] Compiling yoke-derive v0.7.5 [INFO] [stderr] Compiling zerovec-derive v0.10.3 [INFO] [stderr] Compiling displaydoc v0.2.5 [INFO] [stderr] Compiling serde_derive v1.0.219 [INFO] [stderr] Compiling tokio-macros v2.5.0 [INFO] [stderr] Compiling thiserror-impl v1.0.69 [INFO] [stderr] Compiling icu_provider_macros v1.5.0 [INFO] [stderr] Compiling futures-macro v0.3.31 [INFO] [stderr] Compiling openssl-macros v0.1.1 [INFO] [stderr] Compiling clap_derive v4.5.32 [INFO] [stderr] Compiling tokio v1.44.2 [INFO] [stderr] Compiling futures-util v0.3.31 [INFO] [stderr] Compiling thiserror v1.0.69 [INFO] [stderr] Compiling protobuf-support v3.7.2 [INFO] [stderr] Compiling zerofrom v0.1.6 [INFO] [stderr] Compiling yoke v0.7.5 [INFO] [stderr] Compiling zerovec v0.10.4 [INFO] [stderr] Compiling clap v4.5.37 [INFO] [stderr] Compiling tinystr v0.7.6 [INFO] [stderr] Compiling icu_collections v1.5.0 [INFO] [stderr] Compiling icu_locid v1.5.0 [INFO] [stderr] Compiling icu_provider v1.5.0 [INFO] [stderr] Compiling icu_locid_transform v1.5.0 [INFO] [stderr] Compiling protobuf-parse v3.7.2 [INFO] [stderr] Compiling icu_properties v1.5.1 [INFO] [stderr] Compiling tokio-util v0.7.15 [INFO] [stderr] Compiling tower v0.5.2 [INFO] [stderr] Compiling protobuf-codegen v3.7.2 [INFO] [stderr] Compiling tokio-native-tls v0.3.1 [INFO] [stderr] Compiling h2 v0.4.9 [INFO] [stderr] Compiling flat_map v0.0.10 [INFO] [stderr] Compiling serde_urlencoded v0.7.1 [INFO] [stderr] Compiling csv v1.3.1 [INFO] [stderr] Compiling serde_json v1.0.140 [INFO] [stderr] Compiling osmpbfreader v0.17.0 [INFO] [stderr] Compiling icu_normalizer v1.5.0 [INFO] [stderr] Compiling idna_adapter v1.2.0 [INFO] [stderr] Compiling idna v1.0.3 [INFO] [stderr] Compiling url v2.5.4 [INFO] [stderr] Compiling osm4routing v0.7.2 [INFO] [stderr] Compiling hyper v1.6.0 [INFO] [stderr] Compiling hyper-util v0.1.11 [INFO] [stderr] Compiling hyper-tls v0.6.0 [INFO] [stderr] Compiling reqwest v0.12.15 [INFO] [stderr] Compiling experiments v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/unweighted.rs:34:16 [INFO] [stdout] | [INFO] [stdout] 34 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 35 | ) -> PreparedEnumerationAlgorithm> [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] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 35 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/unweighted.rs:53:16 [INFO] [stdout] | [INFO] [stdout] 53 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 54 | u: I, [INFO] [stdout] 55 | ) -> PreparedEnumerationAlgorithm> [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] 55 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/unweighted_no_self.rs:33:16 [INFO] [stdout] | [INFO] [stdout] 33 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 34 | ) -> PreparedEnumerationAlgorithm> [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] 34 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/unweighted_no_self.rs:52:16 [INFO] [stdout] | [INFO] [stdout] 52 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 53 | u: I, [INFO] [stdout] 54 | ) -> PreparedEnumerationAlgorithm> [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] 54 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/unweighted_no_self.rs:80:16 [INFO] [stdout] | [INFO] [stdout] 80 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 81 | u: I, [INFO] [stdout] 82 | ) -> PreparedEnumerationAlgorithm> [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] 82 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/unweighted_sorted.rs:37:16 [INFO] [stdout] | [INFO] [stdout] 37 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 38 | ) -> PreparedEnumerationAlgorithm> [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] 38 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/weighted.rs:57:16 [INFO] [stdout] | [INFO] [stdout] 57 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 58 | u: I, [INFO] [stdout] 59 | ) -> PreparedEnumerationAlgorithm> [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] 59 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/weighted_no_self.rs:40:16 [INFO] [stdout] | [INFO] [stdout] 40 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 41 | ) -> PreparedEnumerationAlgorithm> [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] 41 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/weighted_no_self.rs:69:16 [INFO] [stdout] | [INFO] [stdout] 69 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 70 | u: I, [INFO] [stdout] 71 | ) -> PreparedEnumerationAlgorithm> [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] 71 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/weighted_no_self.rs:97:16 [INFO] [stdout] | [INFO] [stdout] 97 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 98 | u: I, [INFO] [stdout] 99 | ) -> PreparedEnumerationAlgorithm> [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 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/weighted_sorted.rs:43:16 [INFO] [stdout] | [INFO] [stdout] 43 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 44 | ) -> PreparedEnumerationAlgorithm> [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] 44 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/boruvka.rs:92:16 [INFO] [stdout] | [INFO] [stdout] 92 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 93 | ) -> PreparedEnumerationAlgorithm> [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] 93 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/boruvka.rs:101:16 [INFO] [stdout] | [INFO] [stdout] 101 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 102 | comparator: C, [INFO] [stdout] 103 | ) -> PreparedEnumerationAlgorithm> { [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] 103 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/enumeration.rs:65:16 [INFO] [stdout] | [INFO] [stdout] 65 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 66 | ) -> PreparedEnumerationAlgorithm> [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] 66 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/enumeration.rs:74:16 [INFO] [stdout] | [INFO] [stdout] 74 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 75 | comparator: C, [INFO] [stdout] 76 | ) -> PreparedEnumerationAlgorithm> { [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] 76 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/kruskal.rs:117:16 [INFO] [stdout] | [INFO] [stdout] 117 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 118 | ) -> PreparedEnumerationAlgorithm> [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] 118 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/kruskal.rs:126:16 [INFO] [stdout] | [INFO] [stdout] 126 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 127 | comparator: C, [INFO] [stdout] 128 | ) -> PreparedEnumerationAlgorithm> { [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] 128 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/prim.rs:103:16 [INFO] [stdout] | [INFO] [stdout] 103 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 104 | ) -> PreparedEnumerationAlgorithm> [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] 104 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/prim.rs:112:16 [INFO] [stdout] | [INFO] [stdout] 112 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 113 | comparator: C, [INFO] [stdout] 114 | ) -> PreparedEnumerationAlgorithm> { [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] 114 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/scheduling/flow_shop/f2_cmax.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | input: &SchedulingInstance, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 40 | ) -> PreparedEnumerationAlgorithm { [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] 40 | ) -> PreparedEnumerationAlgorithm<'_, SchedulePartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/scheduling/parallel_machines/cmax.rs:51:35 [INFO] [stdout] | [INFO] [stdout] 51 | fn prepare_lpt_enumeration(input: &InstanceType) -> PreparedEnumerationAlgorithm { [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] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 51 | fn prepare_lpt_enumeration(input: &InstanceType) -> PreparedEnumerationAlgorithm<'_, SchedulePartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/scheduling/parallel_machines/cmax.rs:175:12 [INFO] [stdout] | [INFO] [stdout] 175 | input: &InstanceType, [INFO] [stdout] | ^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 176 | ) -> PreparedEnumerationAlgorithm { [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] 176 | ) -> PreparedEnumerationAlgorithm<'_, SchedulePartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/scheduling/single_machine/prec_cmax.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | input: &InstanceType, [INFO] [stdout] | ^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 40 | ) -> PreparedEnumerationAlgorithm { [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] 40 | ) -> PreparedEnumerationAlgorithm<'_, SchedulePartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/scheduling/single_machine/rj_cmax.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | input: &InstanceType, [INFO] [stdout] | ^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 29 | ) -> PreparedEnumerationAlgorithm { [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] 29 | ) -> PreparedEnumerationAlgorithm<'_, SchedulePartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/sorting/incremental_heap_sort.rs:13:44 [INFO] [stdout] | [INFO] [stdout] 13 | fn prepare_enumeration_algorithm(input: &SortingInstance) -> PreparedEnumerationAlgorithm [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] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 13 | fn prepare_enumeration_algorithm(input: &SortingInstance) -> PreparedEnumerationAlgorithm<'_, T> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/sorting/incremental_quick_sort.rs:12:44 [INFO] [stdout] | [INFO] [stdout] 12 | fn prepare_enumeration_algorithm(input: &SortingInstance) -> PreparedEnumerationAlgorithm [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] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 12 | fn prepare_enumeration_algorithm(input: &SortingInstance) -> PreparedEnumerationAlgorithm<'_, T> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/data_structures/matrix.rs:38:24 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn iter_matrix(&self) -> MatrixIterator { [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] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 38 | pub fn iter_matrix(&self) -> MatrixIterator<'_, T> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 1m 12s [INFO] running `Command { std: "docker" "inspect" "f159a7a1d6760282e54ec5789888edfe50faeb15bc1a24dbf09a0be22f2668d1", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "f159a7a1d6760282e54ec5789888edfe50faeb15bc1a24dbf09a0be22f2668d1", kill_on_drop: false }` [INFO] [stdout] f159a7a1d6760282e54ec5789888edfe50faeb15bc1a24dbf09a0be22f2668d1 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-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" "+ad85bc524b1ad696e42061ad8338d382dffbdbe5" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 4e7643e475633f0d16b12ea12ca2b9c0a24c06c71292af346ec53d04c4cc9d5a [INFO] running `Command { std: "docker" "start" "-a" "4e7643e475633f0d16b12ea12ca2b9c0a24c06c71292af346ec53d04c4cc9d5a", kill_on_drop: false }` [INFO] [stderr] Compiling syn v2.0.101 [INFO] [stderr] Compiling futures-io v0.3.31 [INFO] [stderr] Compiling regex-automata v0.4.9 [INFO] [stderr] Compiling semver v1.0.26 [INFO] [stderr] Compiling winnow v0.7.7 [INFO] [stderr] Compiling csv-core v0.1.12 [INFO] [stderr] Compiling relative-path v1.9.3 [INFO] [stderr] Compiling glob v0.3.2 [INFO] [stderr] Compiling futures-timer v3.0.3 [INFO] [stderr] Compiling testdrop v0.1.2 [INFO] [stderr] Compiling rustc_version v0.4.1 [INFO] [stderr] Compiling rstest_macros v0.23.0 [INFO] [stderr] Compiling toml_edit v0.22.26 [INFO] [stderr] Compiling regex v1.11.1 [INFO] [stderr] Compiling proc-macro-crate v3.3.0 [INFO] [stderr] Compiling synstructure v0.13.1 [INFO] [stderr] Compiling zerofrom-derive v0.1.6 [INFO] [stderr] Compiling yoke-derive v0.7.5 [INFO] [stderr] Compiling zerovec-derive v0.10.3 [INFO] [stderr] Compiling displaydoc v0.2.5 [INFO] [stderr] Compiling futures-macro v0.3.31 [INFO] [stderr] Compiling thiserror-impl v1.0.69 [INFO] [stderr] Compiling tokio-macros v2.5.0 [INFO] [stderr] Compiling serde_derive v1.0.219 [INFO] [stderr] Compiling icu_provider_macros v1.5.0 [INFO] [stderr] Compiling openssl-macros v0.1.1 [INFO] [stderr] Compiling clap_derive v4.5.32 [INFO] [stderr] Compiling openssl v0.10.72 [INFO] [stderr] Compiling futures-util v0.3.31 [INFO] [stderr] Compiling tokio v1.44.2 [INFO] [stderr] Compiling zerofrom v0.1.6 [INFO] [stderr] Compiling yoke v0.7.5 [INFO] [stderr] Compiling thiserror v1.0.69 [INFO] [stderr] Compiling protobuf-support v3.7.2 [INFO] [stderr] Compiling zerovec v0.10.4 [INFO] [stderr] Compiling protobuf v3.7.2 [INFO] [stderr] Compiling clap v4.5.37 [INFO] [stderr] Compiling tinystr v0.7.6 [INFO] [stderr] Compiling icu_collections v1.5.0 [INFO] [stderr] Compiling icu_locid v1.5.0 [INFO] [stderr] Compiling serde v1.0.219 [INFO] [stderr] Compiling futures-executor v0.3.31 [INFO] [stderr] Compiling icu_provider v1.5.0 [INFO] [stderr] Compiling futures v0.3.31 [INFO] [stderr] Compiling rstest v0.23.0 [INFO] [stderr] Compiling icu_locid_transform v1.5.0 [INFO] [stderr] Compiling icu_properties v1.5.1 [INFO] [stderr] Compiling native-tls v0.2.14 [INFO] [stderr] Compiling protobuf-parse v3.7.2 [INFO] [stderr] Compiling smartstring v1.0.1 [INFO] [stderr] Compiling flat_map v0.0.10 [INFO] [stderr] Compiling csv v1.3.1 [INFO] [stderr] Compiling serde_urlencoded v0.7.1 [INFO] [stderr] Compiling serde_json v1.0.140 [INFO] [stderr] Compiling icu_normalizer v1.5.0 [INFO] [stderr] Compiling tokio-util v0.7.15 [INFO] [stderr] Compiling tokio-native-tls v0.3.1 [INFO] [stderr] Compiling tower v0.5.2 [INFO] [stderr] Compiling protobuf-codegen v3.7.2 [INFO] [stderr] Compiling idna_adapter v1.2.0 [INFO] [stderr] Compiling idna v1.0.3 [INFO] [stderr] Compiling h2 v0.4.9 [INFO] [stderr] Compiling url v2.5.4 [INFO] [stderr] Compiling osmpbfreader v0.17.0 [INFO] [stderr] Compiling osm4routing v0.7.2 [INFO] [stderr] Compiling hyper v1.6.0 [INFO] [stderr] Compiling hyper-util v0.1.11 [INFO] [stderr] Compiling hyper-tls v0.6.0 [INFO] [stderr] Compiling reqwest v0.12.15 [INFO] [stderr] Compiling experiments v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/unweighted.rs:34:16 [INFO] [stdout] | [INFO] [stdout] 34 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 35 | ) -> PreparedEnumerationAlgorithm> [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] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 35 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/unweighted.rs:53:16 [INFO] [stdout] | [INFO] [stdout] 53 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 54 | u: I, [INFO] [stdout] 55 | ) -> PreparedEnumerationAlgorithm> [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] 55 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/unweighted_no_self.rs:33:16 [INFO] [stdout] | [INFO] [stdout] 33 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 34 | ) -> PreparedEnumerationAlgorithm> [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] 34 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/unweighted_no_self.rs:52:16 [INFO] [stdout] | [INFO] [stdout] 52 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 53 | u: I, [INFO] [stdout] 54 | ) -> PreparedEnumerationAlgorithm> [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] 54 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/unweighted_no_self.rs:80:16 [INFO] [stdout] | [INFO] [stdout] 80 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 81 | u: I, [INFO] [stdout] 82 | ) -> PreparedEnumerationAlgorithm> [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] 82 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/unweighted_sorted.rs:37:16 [INFO] [stdout] | [INFO] [stdout] 37 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 38 | ) -> PreparedEnumerationAlgorithm> [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] 38 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/weighted.rs:57:16 [INFO] [stdout] | [INFO] [stdout] 57 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 58 | u: I, [INFO] [stdout] 59 | ) -> PreparedEnumerationAlgorithm> [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] 59 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/weighted_no_self.rs:40:16 [INFO] [stdout] | [INFO] [stdout] 40 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 41 | ) -> PreparedEnumerationAlgorithm> [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] 41 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/weighted_no_self.rs:69:16 [INFO] [stdout] | [INFO] [stdout] 69 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 70 | u: I, [INFO] [stdout] 71 | ) -> PreparedEnumerationAlgorithm> [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] 71 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/weighted_no_self.rs:97:16 [INFO] [stdout] | [INFO] [stdout] 97 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 98 | u: I, [INFO] [stdout] 99 | ) -> PreparedEnumerationAlgorithm> [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 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/weighted_sorted.rs:43:16 [INFO] [stdout] | [INFO] [stdout] 43 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 44 | ) -> PreparedEnumerationAlgorithm> [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] 44 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/boruvka.rs:92:16 [INFO] [stdout] | [INFO] [stdout] 92 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 93 | ) -> PreparedEnumerationAlgorithm> [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] 93 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/boruvka.rs:101:16 [INFO] [stdout] | [INFO] [stdout] 101 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 102 | comparator: C, [INFO] [stdout] 103 | ) -> PreparedEnumerationAlgorithm> { [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] 103 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/enumeration.rs:65:16 [INFO] [stdout] | [INFO] [stdout] 65 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 66 | ) -> PreparedEnumerationAlgorithm> [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] 66 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/enumeration.rs:74:16 [INFO] [stdout] | [INFO] [stdout] 74 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 75 | comparator: C, [INFO] [stdout] 76 | ) -> PreparedEnumerationAlgorithm> { [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] 76 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/kruskal.rs:117:16 [INFO] [stdout] | [INFO] [stdout] 117 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 118 | ) -> PreparedEnumerationAlgorithm> [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] 118 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/kruskal.rs:126:16 [INFO] [stdout] | [INFO] [stdout] 126 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 127 | comparator: C, [INFO] [stdout] 128 | ) -> PreparedEnumerationAlgorithm> { [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] 128 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/prim.rs:103:16 [INFO] [stdout] | [INFO] [stdout] 103 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 104 | ) -> PreparedEnumerationAlgorithm> [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] 104 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/prim.rs:112:16 [INFO] [stdout] | [INFO] [stdout] 112 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 113 | comparator: C, [INFO] [stdout] 114 | ) -> PreparedEnumerationAlgorithm> { [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] 114 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/scheduling/flow_shop/f2_cmax.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | input: &SchedulingInstance, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 40 | ) -> PreparedEnumerationAlgorithm { [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] 40 | ) -> PreparedEnumerationAlgorithm<'_, SchedulePartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/scheduling/parallel_machines/cmax.rs:51:35 [INFO] [stdout] | [INFO] [stdout] 51 | fn prepare_lpt_enumeration(input: &InstanceType) -> PreparedEnumerationAlgorithm { [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] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 51 | fn prepare_lpt_enumeration(input: &InstanceType) -> PreparedEnumerationAlgorithm<'_, SchedulePartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/scheduling/parallel_machines/cmax.rs:175:12 [INFO] [stdout] | [INFO] [stdout] 175 | input: &InstanceType, [INFO] [stdout] | ^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 176 | ) -> PreparedEnumerationAlgorithm { [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] 176 | ) -> PreparedEnumerationAlgorithm<'_, SchedulePartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/scheduling/single_machine/prec_cmax.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | input: &InstanceType, [INFO] [stdout] | ^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 40 | ) -> PreparedEnumerationAlgorithm { [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] 40 | ) -> PreparedEnumerationAlgorithm<'_, SchedulePartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/scheduling/single_machine/rj_cmax.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | input: &InstanceType, [INFO] [stdout] | ^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 29 | ) -> PreparedEnumerationAlgorithm { [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] 29 | ) -> PreparedEnumerationAlgorithm<'_, SchedulePartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/sorting/incremental_heap_sort.rs:13:44 [INFO] [stdout] | [INFO] [stdout] 13 | fn prepare_enumeration_algorithm(input: &SortingInstance) -> PreparedEnumerationAlgorithm [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] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 13 | fn prepare_enumeration_algorithm(input: &SortingInstance) -> PreparedEnumerationAlgorithm<'_, T> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/sorting/incremental_quick_sort.rs:12:44 [INFO] [stdout] | [INFO] [stdout] 12 | fn prepare_enumeration_algorithm(input: &SortingInstance) -> PreparedEnumerationAlgorithm [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] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 12 | fn prepare_enumeration_algorithm(input: &SortingInstance) -> PreparedEnumerationAlgorithm<'_, T> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/data_structures/matrix.rs:38:24 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn iter_matrix(&self) -> MatrixIterator { [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] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 38 | pub fn iter_matrix(&self) -> MatrixIterator<'_, T> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/unweighted.rs:34:16 [INFO] [stdout] | [INFO] [stdout] 34 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 35 | ) -> PreparedEnumerationAlgorithm> [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] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 35 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/unweighted.rs:53:16 [INFO] [stdout] | [INFO] [stdout] 53 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 54 | u: I, [INFO] [stdout] 55 | ) -> PreparedEnumerationAlgorithm> [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] 55 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/unweighted_no_self.rs:33:16 [INFO] [stdout] | [INFO] [stdout] 33 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 34 | ) -> PreparedEnumerationAlgorithm> [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] 34 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/unweighted_no_self.rs:52:16 [INFO] [stdout] | [INFO] [stdout] 52 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 53 | u: I, [INFO] [stdout] 54 | ) -> PreparedEnumerationAlgorithm> [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] 54 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/unweighted_no_self.rs:80:16 [INFO] [stdout] | [INFO] [stdout] 80 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 81 | u: I, [INFO] [stdout] 82 | ) -> PreparedEnumerationAlgorithm> [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] 82 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/unweighted_sorted.rs:37:16 [INFO] [stdout] | [INFO] [stdout] 37 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 38 | ) -> PreparedEnumerationAlgorithm> [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] 38 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/weighted.rs:57:16 [INFO] [stdout] | [INFO] [stdout] 57 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 58 | u: I, [INFO] [stdout] 59 | ) -> PreparedEnumerationAlgorithm> [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] 59 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/weighted_no_self.rs:40:16 [INFO] [stdout] | [INFO] [stdout] 40 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 41 | ) -> PreparedEnumerationAlgorithm> [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] 41 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/weighted_no_self.rs:69:16 [INFO] [stdout] | [INFO] [stdout] 69 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 70 | u: I, [INFO] [stdout] 71 | ) -> PreparedEnumerationAlgorithm> [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] 71 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/weighted_no_self.rs:97:16 [INFO] [stdout] | [INFO] [stdout] 97 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 98 | u: I, [INFO] [stdout] 99 | ) -> PreparedEnumerationAlgorithm> [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 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/shortest_distances/apsd/weighted_sorted.rs:43:16 [INFO] [stdout] | [INFO] [stdout] 43 | graph: &G, [INFO] [stdout] | ^^ the lifetime is elided here [INFO] [stdout] 44 | ) -> PreparedEnumerationAlgorithm> [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] 44 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/boruvka.rs:92:16 [INFO] [stdout] | [INFO] [stdout] 92 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 93 | ) -> PreparedEnumerationAlgorithm> [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] 93 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/boruvka.rs:101:16 [INFO] [stdout] | [INFO] [stdout] 101 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 102 | comparator: C, [INFO] [stdout] 103 | ) -> PreparedEnumerationAlgorithm> { [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] 103 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/enumeration.rs:65:16 [INFO] [stdout] | [INFO] [stdout] 65 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 66 | ) -> PreparedEnumerationAlgorithm> [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] 66 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/enumeration.rs:74:16 [INFO] [stdout] | [INFO] [stdout] 74 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 75 | comparator: C, [INFO] [stdout] 76 | ) -> PreparedEnumerationAlgorithm> { [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] 76 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/kruskal.rs:117:16 [INFO] [stdout] | [INFO] [stdout] 117 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 118 | ) -> PreparedEnumerationAlgorithm> [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] 118 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/kruskal.rs:126:16 [INFO] [stdout] | [INFO] [stdout] 126 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 127 | comparator: C, [INFO] [stdout] 128 | ) -> PreparedEnumerationAlgorithm> { [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] 128 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/prim.rs:103:16 [INFO] [stdout] | [INFO] [stdout] 103 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 104 | ) -> PreparedEnumerationAlgorithm> [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] 104 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/graphs/spanning_tree/undirected_weighted/prim.rs:112:16 [INFO] [stdout] | [INFO] [stdout] 112 | graph: &impl UndirectedGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 113 | comparator: C, [INFO] [stdout] 114 | ) -> PreparedEnumerationAlgorithm> { [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] 114 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/scheduling/flow_shop/f2_cmax.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | input: &SchedulingInstance, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 40 | ) -> PreparedEnumerationAlgorithm { [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] 40 | ) -> PreparedEnumerationAlgorithm<'_, SchedulePartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/scheduling/parallel_machines/cmax.rs:51:35 [INFO] [stdout] | [INFO] [stdout] 51 | fn prepare_lpt_enumeration(input: &InstanceType) -> PreparedEnumerationAlgorithm { [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] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 51 | fn prepare_lpt_enumeration(input: &InstanceType) -> PreparedEnumerationAlgorithm<'_, SchedulePartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/scheduling/parallel_machines/cmax.rs:175:12 [INFO] [stdout] | [INFO] [stdout] 175 | input: &InstanceType, [INFO] [stdout] | ^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 176 | ) -> PreparedEnumerationAlgorithm { [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] 176 | ) -> PreparedEnumerationAlgorithm<'_, SchedulePartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/scheduling/single_machine/prec_cmax.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | input: &InstanceType, [INFO] [stdout] | ^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 40 | ) -> PreparedEnumerationAlgorithm { [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] 40 | ) -> PreparedEnumerationAlgorithm<'_, SchedulePartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/scheduling/single_machine/rj_cmax.rs:28:12 [INFO] [stdout] | [INFO] [stdout] 28 | input: &InstanceType, [INFO] [stdout] | ^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stdout] 29 | ) -> PreparedEnumerationAlgorithm { [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] 29 | ) -> PreparedEnumerationAlgorithm<'_, SchedulePartial> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/sorting/incremental_heap_sort.rs:13:44 [INFO] [stdout] | [INFO] [stdout] 13 | fn prepare_enumeration_algorithm(input: &SortingInstance) -> PreparedEnumerationAlgorithm [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] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 13 | fn prepare_enumeration_algorithm(input: &SortingInstance) -> PreparedEnumerationAlgorithm<'_, T> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/algorithms/sorting/incremental_quick_sort.rs:12:44 [INFO] [stdout] | [INFO] [stdout] 12 | fn prepare_enumeration_algorithm(input: &SortingInstance) -> PreparedEnumerationAlgorithm [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] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 12 | fn prepare_enumeration_algorithm(input: &SortingInstance) -> PreparedEnumerationAlgorithm<'_, T> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stdout] --> src/data_structures/matrix.rs:38:24 [INFO] [stdout] | [INFO] [stdout] 38 | pub fn iter_matrix(&self) -> MatrixIterator { [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] help: use `'_` for type paths [INFO] [stdout] | [INFO] [stdout] 38 | pub fn iter_matrix(&self) -> MatrixIterator<'_, T> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 55.92s [INFO] running `Command { std: "docker" "inspect" "4e7643e475633f0d16b12ea12ca2b9c0a24c06c71292af346ec53d04c4cc9d5a", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "4e7643e475633f0d16b12ea12ca2b9c0a24c06c71292af346ec53d04c4cc9d5a", kill_on_drop: false }` [INFO] [stdout] 4e7643e475633f0d16b12ea12ca2b9c0a24c06c71292af346ec53d04c4cc9d5a [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-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" "+ad85bc524b1ad696e42061ad8338d382dffbdbe5" "test" "--frozen", kill_on_drop: false }` [INFO] [stdout] 1b0bb5d5300cfdfbbab809cb64730878c4b79a5a0d90429dbf1d9c5f6bd4940f [INFO] running `Command { std: "docker" "start" "-a" "1b0bb5d5300cfdfbbab809cb64730878c4b79a5a0d90429dbf1d9c5f6bd4940f", kill_on_drop: false }` [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/graphs/shortest_distances/apsd/unweighted.rs:34:16 [INFO] [stderr] | [INFO] [stderr] 34 | graph: &G, [INFO] [stderr] | ^^ the lifetime is elided here [INFO] [stderr] 35 | ) -> PreparedEnumerationAlgorithm> [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] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stderr] help: use `'_` for type paths [INFO] [stderr] | [INFO] [stderr] 35 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/graphs/shortest_distances/apsd/unweighted.rs:53:16 [INFO] [stderr] | [INFO] [stderr] 53 | graph: &G, [INFO] [stderr] | ^^ the lifetime is elided here [INFO] [stderr] 54 | u: I, [INFO] [stderr] 55 | ) -> PreparedEnumerationAlgorithm> [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] 55 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/graphs/shortest_distances/apsd/unweighted_no_self.rs:33:16 [INFO] [stderr] | [INFO] [stderr] 33 | graph: &G, [INFO] [stderr] | ^^ the lifetime is elided here [INFO] [stderr] 34 | ) -> PreparedEnumerationAlgorithm> [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] 34 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/graphs/shortest_distances/apsd/unweighted_no_self.rs:52:16 [INFO] [stderr] | [INFO] [stderr] 52 | graph: &G, [INFO] [stderr] | ^^ the lifetime is elided here [INFO] [stderr] 53 | u: I, [INFO] [stderr] 54 | ) -> PreparedEnumerationAlgorithm> [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] 54 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/graphs/shortest_distances/apsd/unweighted_no_self.rs:80:16 [INFO] [stderr] | [INFO] [stderr] 80 | graph: &G, [INFO] [stderr] | ^^ the lifetime is elided here [INFO] [stderr] 81 | u: I, [INFO] [stderr] 82 | ) -> PreparedEnumerationAlgorithm> [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] 82 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/graphs/shortest_distances/apsd/unweighted_sorted.rs:37:16 [INFO] [stderr] | [INFO] [stderr] 37 | graph: &G, [INFO] [stderr] | ^^ the lifetime is elided here [INFO] [stderr] 38 | ) -> PreparedEnumerationAlgorithm> [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] 38 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/graphs/shortest_distances/apsd/weighted.rs:57:16 [INFO] [stderr] | [INFO] [stderr] 57 | graph: &G, [INFO] [stderr] | ^^ the lifetime is elided here [INFO] [stderr] 58 | u: I, [INFO] [stderr] 59 | ) -> PreparedEnumerationAlgorithm> [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] 59 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/graphs/shortest_distances/apsd/weighted_no_self.rs:40:16 [INFO] [stderr] | [INFO] [stderr] 40 | graph: &G, [INFO] [stderr] | ^^ the lifetime is elided here [INFO] [stderr] 41 | ) -> PreparedEnumerationAlgorithm> [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] 41 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/graphs/shortest_distances/apsd/weighted_no_self.rs:69:16 [INFO] [stderr] | [INFO] [stderr] 69 | graph: &G, [INFO] [stderr] | ^^ the lifetime is elided here [INFO] [stderr] 70 | u: I, [INFO] [stderr] 71 | ) -> PreparedEnumerationAlgorithm> [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] 71 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/graphs/shortest_distances/apsd/weighted_no_self.rs:97:16 [INFO] [stderr] | [INFO] [stderr] 97 | graph: &G, [INFO] [stderr] | ^^ the lifetime is elided here [INFO] [stderr] 98 | u: I, [INFO] [stderr] 99 | ) -> PreparedEnumerationAlgorithm> [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 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/graphs/shortest_distances/apsd/weighted_sorted.rs:43:16 [INFO] [stderr] | [INFO] [stderr] 43 | graph: &G, [INFO] [stderr] | ^^ the lifetime is elided here [INFO] [stderr] 44 | ) -> PreparedEnumerationAlgorithm> [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] 44 | ) -> PreparedEnumerationAlgorithm<'_, ShortestDistancePartial> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/graphs/spanning_tree/undirected_weighted/boruvka.rs:92:16 [INFO] [stderr] | [INFO] [stderr] 92 | graph: &impl UndirectedGraph, [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stderr] 93 | ) -> PreparedEnumerationAlgorithm> [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] 93 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/graphs/spanning_tree/undirected_weighted/boruvka.rs:101:16 [INFO] [stderr] | [INFO] [stderr] 101 | graph: &impl UndirectedGraph, [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stderr] 102 | comparator: C, [INFO] [stderr] 103 | ) -> PreparedEnumerationAlgorithm> { [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] 103 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> { [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/graphs/spanning_tree/undirected_weighted/enumeration.rs:65:16 [INFO] [stderr] | [INFO] [stderr] 65 | graph: &impl UndirectedGraph, [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stderr] 66 | ) -> PreparedEnumerationAlgorithm> [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] 66 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/graphs/spanning_tree/undirected_weighted/enumeration.rs:74:16 [INFO] [stderr] | [INFO] [stderr] 74 | graph: &impl UndirectedGraph, [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stderr] 75 | comparator: C, [INFO] [stderr] 76 | ) -> PreparedEnumerationAlgorithm> { [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] 76 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> { [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/graphs/spanning_tree/undirected_weighted/kruskal.rs:117:16 [INFO] [stderr] | [INFO] [stderr] 117 | graph: &impl UndirectedGraph, [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stderr] 118 | ) -> PreparedEnumerationAlgorithm> [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] 118 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/graphs/spanning_tree/undirected_weighted/kruskal.rs:126:16 [INFO] [stderr] | [INFO] [stderr] 126 | graph: &impl UndirectedGraph, [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stderr] 127 | comparator: C, [INFO] [stderr] 128 | ) -> PreparedEnumerationAlgorithm> { [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] 128 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> { [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/graphs/spanning_tree/undirected_weighted/prim.rs:103:16 [INFO] [stderr] | [INFO] [stderr] 103 | graph: &impl UndirectedGraph, [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stderr] 104 | ) -> PreparedEnumerationAlgorithm> [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] 104 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/graphs/spanning_tree/undirected_weighted/prim.rs:112:16 [INFO] [stderr] | [INFO] [stderr] 112 | graph: &impl UndirectedGraph, [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stderr] 113 | comparator: C, [INFO] [stderr] 114 | ) -> PreparedEnumerationAlgorithm> { [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] 114 | ) -> PreparedEnumerationAlgorithm<'_, MstPartial> { [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/scheduling/flow_shop/f2_cmax.rs:39:12 [INFO] [stderr] | [INFO] [stderr] 39 | input: &SchedulingInstance, [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stderr] 40 | ) -> PreparedEnumerationAlgorithm { [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] 40 | ) -> PreparedEnumerationAlgorithm<'_, SchedulePartial> { [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/scheduling/parallel_machines/cmax.rs:51:35 [INFO] [stderr] | [INFO] [stderr] 51 | fn prepare_lpt_enumeration(input: &InstanceType) -> PreparedEnumerationAlgorithm { [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] help: use `'_` for type paths [INFO] [stderr] | [INFO] [stderr] 51 | fn prepare_lpt_enumeration(input: &InstanceType) -> PreparedEnumerationAlgorithm<'_, SchedulePartial> { [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/scheduling/parallel_machines/cmax.rs:175:12 [INFO] [stderr] | [INFO] [stderr] 175 | input: &InstanceType, [INFO] [stderr] | ^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stderr] 176 | ) -> PreparedEnumerationAlgorithm { [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] 176 | ) -> PreparedEnumerationAlgorithm<'_, SchedulePartial> { [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/scheduling/single_machine/prec_cmax.rs:39:12 [INFO] [stderr] | [INFO] [stderr] 39 | input: &InstanceType, [INFO] [stderr] | ^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stderr] 40 | ) -> PreparedEnumerationAlgorithm { [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] 40 | ) -> PreparedEnumerationAlgorithm<'_, SchedulePartial> { [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/scheduling/single_machine/rj_cmax.rs:28:12 [INFO] [stderr] | [INFO] [stderr] 28 | input: &InstanceType, [INFO] [stderr] | ^^^^^^^^^^^^^ the lifetime is elided here [INFO] [stderr] 29 | ) -> PreparedEnumerationAlgorithm { [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] 29 | ) -> PreparedEnumerationAlgorithm<'_, SchedulePartial> { [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/sorting/incremental_heap_sort.rs:13:44 [INFO] [stderr] | [INFO] [stderr] 13 | fn prepare_enumeration_algorithm(input: &SortingInstance) -> PreparedEnumerationAlgorithm [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] help: use `'_` for type paths [INFO] [stderr] | [INFO] [stderr] 13 | fn prepare_enumeration_algorithm(input: &SortingInstance) -> PreparedEnumerationAlgorithm<'_, T> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/algorithms/sorting/incremental_quick_sort.rs:12:44 [INFO] [stderr] | [INFO] [stderr] 12 | fn prepare_enumeration_algorithm(input: &SortingInstance) -> PreparedEnumerationAlgorithm [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] help: use `'_` for type paths [INFO] [stderr] | [INFO] [stderr] 12 | fn prepare_enumeration_algorithm(input: &SortingInstance) -> PreparedEnumerationAlgorithm<'_, T> [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing [INFO] [stderr] --> src/data_structures/matrix.rs:38:24 [INFO] [stderr] | [INFO] [stderr] 38 | pub fn iter_matrix(&self) -> MatrixIterator { [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] help: use `'_` for type paths [INFO] [stderr] | [INFO] [stderr] 38 | pub fn iter_matrix(&self) -> MatrixIterator<'_, T> { [INFO] [stderr] | +++ [INFO] [stderr] [INFO] [stderr] warning: `experiments` (lib) generated 27 warnings (run `cargo fix --lib -p experiments` to apply 27 suggestions) [INFO] [stderr] warning: `experiments` (lib test) generated 27 warnings (27 duplicates) [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.43s [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/exp_lib-7387649734acfc1d) [INFO] [stdout] [INFO] [stdout] running 149 tests [INFO] [stdout] test algorithms::graphs::search::bfs::test::test_loop_crls_22_3 ... ok [INFO] [stdout] test algorithms::graphs::search::dfs::test::test_recursive_crls_22_4 ... ok [INFO] [stdout] test algorithms::graphs::search::bfs::test::test_enumeration_crls_22_3 ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::apsd::unweighted::test::test_undirected_enumeration ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::apsd::unweighted_no_self::test::test_directed_enumeration ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::apsd::unweighted_sorted::test::test_directed_enumeration ... ok [INFO] [stdout] test algorithms::graphs::search::dfs::test::test_enumeration_crls_22_4 ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::apsd::unweighted::test::test_undirected ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::apsd::unweighted_sorted::test::test_undirected_enumeration ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::apsd::weighted::test::test_floyd_warshall_nonnegative ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::apsd::weighted::test::test_floyd_warshall ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::apsd::weighted_no_self::test::test_dijkstra_enumeration_nonnegative ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::apsd::weighted_sorted::test::test_directed_enumeration ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::apsd::weighted::test::test_dijkstra_enumeration_nonnegative ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::sssd::unweighted::test::test_undirected_sssd_crls_22_3 ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::apsd::weighted::test::test_dijkstra_nonnegative ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::sssd::unweighted::test::test_directed_sssd_crls_22_3 ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::sssd::unweighted::test::test_directed_sssd_enumeration_crls_22_3 ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::sssd::unweighted_lazy::test::test_directed_sssd_enumeration_crls_22_3 ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::sssd::weighted::test::test_directed_sssd_enumeration_crls_22_6 ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::sssd::weighted::test::test_undirected_sssd_crls_22_6 ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::sssd::weighted::test::test_undirected_sssd_enumeration_crls_22_6 ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::sssd::unweighted_lazy::test::test_undirected_sssd_enumeration_crls_22_3 ... ok [INFO] [stdout] test algorithms::graphs::spanning_tree::undirected_weighted::tests::test_incremental_boruvka_crls ... ok [INFO] [stdout] test algorithms::graphs::spanning_tree::undirected_weighted::tests::test_enumeration_crls ... ok [INFO] [stdout] test algorithms::graphs::spanning_tree::undirected_weighted::tests::test_kruskal_crls ... ok [INFO] [stdout] test algorithms::graphs::spanning_tree::undirected_weighted::tests::test_incremental_kruskal_crls ... ok [INFO] [stdout] test algorithms::graphs::spanning_tree::undirected_weighted::tests::test_boruvka_crls ... ok [INFO] [stdout] test algorithms::graphs::spanning_tree::undirected_weighted::tests::test_incremental_prim_crls ... ok [INFO] [stdout] test algorithms::graphs::spanning_tree::undirected_weighted::tests::test_prim_crls ... ok [INFO] [stdout] test algorithms::graphs::topological_ordering::test::test_dfs_finish_time ... ok [INFO] [stdout] test algorithms::graphs::topological_ordering::test::test_dfs_finish_time_with_cycle ... ok [INFO] [stdout] test algorithms::graphs::topological_ordering::test::test_idfs_finish_time ... ok [INFO] [stdout] test algorithms::graphs::topological_ordering::test::test_iterative_source_removal ... ok [INFO] [stdout] test algorithms::scheduling::flow_shop::f2_cmax::test::test_f2_cmax_enumeration ... ok [INFO] [stdout] test algorithms::graphs::topological_ordering::test::test_iterative_source_removal_with_cycle ... ok [INFO] [stdout] test algorithms::scheduling::flow_shop::f2_cmax::test::test_f2_cmax_total_time ... ok [INFO] [stdout] test algorithms::scheduling::parallel_machines::cmax::test::test_enumeration_coroutine_lpt_small ... ok [INFO] [stdout] test algorithms::scheduling::parallel_machines::cmax::test::test_enumeration_lpt_small ... ok [INFO] [stdout] test algorithms::scheduling::single_machine::prec_cmax::test::test_prec_cmax_total_time_dfs ... ok [INFO] [stdout] test algorithms::scheduling::parallel_machines::cmax::test::test_total_time_lpt ... ok [INFO] [stdout] test algorithms::sorting::counting_sort::test::test_clrs_8_2 ... ok [INFO] [stdout] test algorithms::sorting::counting_sort::test::test_stability ... ok [INFO] [stdout] test algorithms::scheduling::single_machine::prec_cmax::test::test_prec_cmax_enumeration ... ok [INFO] [stdout] test algorithms::scheduling::single_machine::rj_cmax::test::test_rj_cmax_enumeration ... ok [INFO] [stdout] test algorithms::scheduling::single_machine::prec_cmax::test::test_prec_cmax_total_time_idfs ... ok [INFO] [stdout] test algorithms::scheduling::parallel_machines::cmax::test::test_enumeration_coroutine_lpt_big ... ok [INFO] [stdout] test algorithms::sorting::incremental_heap_sort::test::test_delay ... ok [INFO] [stdout] test algorithms::scheduling::single_machine::rj_cmax::test::test_rj_cmax_total_time ... ok [INFO] [stdout] test algorithms::sorting::incremental_quick_sort::test::test_partition_equal_elements ... ok [INFO] [stdout] test algorithms::graphs::topological_ordering::test::test_idfs_finish_time_with_cycle ... ok [INFO] [stdout] test algorithms::scheduling::parallel_machines::cmax::test::test_enumeration_lpt_big ... ok [INFO] [stdout] test algorithms::sorting::incremental_quick_sort::test::test_sort_crls_7_1 ... ok [INFO] [stdout] test algorithms::sorting::incremental_quick_sort::test::test_partition_crls_7_1 ... ok [INFO] [stdout] test algorithms::sorting::incremental_quick_sort::test::test_delay ... ok [INFO] [stdout] test algorithms::sorting::incremental_quick_sort::test::test_sort_paredes_navarro ... ok [INFO] [stdout] test data_generators::scheduling::flow_shop::test::test_ta001 ... ok [INFO] [stdout] test data_structures::graphs::adjacency_array_graph::test::test_build ... ok [INFO] [stdout] test data_structures::graphs::adjacency_array_graph::test::test_build_transposed ... ok [INFO] [stdout] test data_structures::graphs::forest::test::test_edges ... ok [INFO] [stdout] test data_structures::graphs::forest::test::test_in_adjacencies ... ok [INFO] [stdout] test data_structures::graphs::forest::test::test_in_degree ... ok [INFO] [stdout] test data_structures::graphs::forest::test::test_in_neighbors ... ok [INFO] [stdout] test data_structures::graphs::forest::test::test_out_adjacencies ... ok [INFO] [stdout] test data_structures::graphs::forest::test::test_out_degree ... ok [INFO] [stdout] test data_structures::graphs::forest::test::test_vertices ... ok [INFO] [stdout] test data_structures::graphs::tests::directed::test_edges::case_1_directed_adjacency_array ... ok [INFO] [stdout] test algorithms::graphs::search::dfs::test::test_recursive_dfs_tree_22_4 ... ok [INFO] [stdout] test data_structures::graphs::forest::test::test_out_neighbors ... ok [INFO] [stdout] test data_structures::graphs::tests::directed::test_edges::case_2_in_out_adjacency_arrays ... ok [INFO] [stdout] test data_structures::graphs::tests::directed::test_edges::case_3_directed_edge_list ... ok [INFO] [stdout] test data_structures::graphs::tests::directed::test_vertices::case_1_directed_adjacency_array ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::sssd::unweighted::test::test_undirected_sssd_enumeration_crls_22_3 ... ok [INFO] [stdout] test data_structures::graphs::tests::directed::test_vertices::case_2_in_out_adjacency_arrays ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::sssd::weighted::test::test_directed_sssd_crls_22_6 ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_edges::case_2_in_out_adjacency_arrays ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_edges::case_3_directed_edge_list ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_in_adjacencies::case_1_directed_adjacency_array ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_in_adjacencies::case_2_in_out_adjacency_arrays ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_in_adjacencies::case_3_directed_edge_list ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_in_degree::case_1_directed_adjacency_array ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::apsd::unweighted_no_self::test::test_undirected_enumeration ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_in_neighbors::case_2_in_out_adjacency_arrays ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_in_neighbors::case_3_directed_edge_list ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_in_degree::case_2_in_out_adjacency_arrays ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_in_neighbors::case_1_directed_adjacency_array ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_out_adjacencies::case_3_directed_edge_list ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_out_adjacencies::case_2_in_out_adjacency_arrays ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_in_degree::case_3_directed_edge_list ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_out_degree::case_2_in_out_adjacency_arrays ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_out_degree::case_1_directed_adjacency_array ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_out_degree::case_3_directed_edge_list ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_out_adjacencies::case_1_directed_adjacency_array ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_edges::case_1_directed_adjacency_array ... ok [INFO] [stdout] test data_structures::graphs::tests::directed::test_vertices::case_3_directed_edge_list ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_out_neighbors::case_1_directed_adjacency_array ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_out_neighbors::case_2_in_out_adjacency_arrays ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_out_neighbors::case_3_directed_edge_list ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_vertices::case_1_directed_adjacency_array ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_vertices::case_2_in_out_adjacency_arrays ... ok [INFO] [stdout] test data_structures::graphs::tests::directed_weighted::test_vertices::case_3_directed_edge_list ... ok [INFO] [stdout] test data_structures::graphs::tests::undirected::test_edges::case_1_undirected_adjacency_array ... ok [INFO] [stdout] test data_structures::graphs::tests::undirected::test_edges::case_2_undirected_edge_list ... ok [INFO] [stdout] test data_structures::graphs::tests::undirected::test_vertices::case_1_undirected_adjacency_array ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::apsd::unweighted::test::test_directed ... ok [INFO] [stdout] test data_structures::graphs::tests::undirected::test_vertices::case_2_undirected_edge_list ... ok [INFO] [stdout] test data_structures::graphs::tests::undirected_weighted::test_edges::case_1_undirected_adjacency_array ... ok [INFO] [stdout] test data_structures::graphs::tests::undirected_weighted::test_edges::case_2_undirected_edge_list ... ok [INFO] [stdout] test data_structures::graphs::tests::undirected_weighted::test_in_adjacencies::case_1_undirected_adjacency_array ... ok [INFO] [stdout] test data_structures::graphs::tests::undirected_weighted::test_in_adjacencies::case_2_undirected_edge_list ... ok [INFO] [stdout] test data_structures::graphs::tests::undirected_weighted::test_in_degree::case_1_undirected_adjacency_array ... ok [INFO] [stdout] test data_structures::graphs::tests::undirected_weighted::test_in_degree::case_2_undirected_edge_list ... ok [INFO] [stdout] test data_structures::graphs::tests::undirected_weighted::test_in_neighbors::case_1_undirected_adjacency_array ... ok [INFO] [stdout] test data_structures::graphs::tests::undirected_weighted::test_in_neighbors::case_2_undirected_edge_list ... ok [INFO] [stdout] test data_structures::graphs::tests::undirected_weighted::test_out_adjacencies::case_1_undirected_adjacency_array ... ok [INFO] [stdout] test data_structures::graphs::tests::undirected_weighted::test_out_adjacencies::case_2_undirected_edge_list ... ok [INFO] [stdout] test data_structures::graphs::tests::undirected_weighted::test_out_degree::case_1_undirected_adjacency_array ... ok [INFO] [stdout] test data_structures::graphs::tests::undirected_weighted::test_out_degree::case_2_undirected_edge_list ... ok [INFO] [stdout] test data_structures::graphs::tests::undirected_weighted::test_out_neighbors::case_1_undirected_adjacency_array ... ok [INFO] [stdout] test data_structures::graphs::tests::undirected_weighted::test_out_neighbors::case_2_undirected_edge_list ... ok [INFO] [stdout] test data_structures::graphs::tests::undirected_weighted::test_vertices::case_2_undirected_edge_list ... ok [INFO] [stdout] test data_structures::lazy_array::test::test_drops_items ... ok [INFO] [stdout] test data_structures::lazy_array::test::test_get_or_default_with_uninitialized_returns_default ... ok [INFO] [stdout] test data_structures::lazy_array::test::test_get_or_out_of_bounds_returns_none ... ok [INFO] [stdout] test data_structures::lazy_array::test::test_get_or_uninitialized_returns_value ... ok [INFO] [stdout] test data_structures::lazy_array::test::test_get_out_of_bounds_returns_none ... ok [INFO] [stdout] test data_structures::lazy_array::test::test_get_uninitialized_returns_none ... ok [INFO] [stdout] test data_structures::lazy_array::test::test_set_get_multiple ... ok [INFO] [stdout] test data_structures::lazy_array::test::test_set_initialized_drops_old ... ok [INFO] [stdout] test data_structures::lazy_array::test::test_set_initialized_get ... ok [INFO] [stdout] test data_structures::lazy_array::test::test_set_uninitialized_get ... ok [INFO] [stdout] test data_structures::union_find::test::test_crls_21_1 ... ok [INFO] [stdout] test data_structures::lazy_array::test::test_get_or_default_out_of_bounds_returns_none ... ok [INFO] [stdout] test data_structures::lazy_array::test::test_get_or_default_uninitialized_returns_default ... ok [INFO] [stdout] test data_structures::union_find::test::test_flatten_crls_21_1 ... ok [INFO] [stdout] test experiments::aggregation::storing_aggregation::test::test_dirty_aggregation ... ok [INFO] [stdout] test experiments::aggregation::storing_aggregation::test::test_measurement_aggregation_even ... ok [INFO] [stdout] test algorithms::graphs::shortest_distances::apsd::unweighted::test::test_directed_enumeration ... ok [INFO] [stdout] test experiments::aggregation::storing_aggregation::test::test_measurement_aggregation_odd ... ok [INFO] [stdout] test experiments::aggregation::streaming_aggregation::test::test_measurement_aggregation ... ok [INFO] [stdout] test experiments::aggregation::test::test_measurement_file_path_correct ... ok [INFO] [stdout] test experiments::aggregation::test::test_measurement_file_path_illegal_size ... ok [INFO] [stdout] test experiments::aggregation::test::test_measurement_file_path_replace_algorithm ... ok [INFO] [stdout] test experiments::aggregation::test::test_measurement_file_path_too_few_parts ... ok [INFO] [stdout] test experiments::aggregation::test::test_measurement_file_path_too_many_parts ... ok [INFO] [stdout] test experiments::aggregation::test::test_measurement_file_path_wrong_extension ... ok [INFO] [stdout] test experiments::aggregation::test::test_measurement_file_path_wrong_algorithm ... ok [INFO] [stdout] test data_structures::graphs::tests::undirected_weighted::test_vertices::case_1_undirected_adjacency_array ... ok [INFO] [stdout] test data_structures::lazy_array::test::test_get_or_default_with_out_of_bounds_returns_none ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 149 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.07s [INFO] [stdout] [INFO] [stderr] Running unittests src/bin/datasets.rs (/opt/rustwide/target/debug/deps/datasets-8a46f2341fecbff7) [INFO] [stdout] [INFO] [stdout] running 0 tests [INFO] [stdout] [INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s [INFO] [stdout] [INFO] [stderr] Running unittests src/bin/experiments.rs (/opt/rustwide/target/debug/deps/experiments-f756f53be41131ba) [INFO] [stdout] [INFO] [stdout] running 0 tests [INFO] [stdout] [INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s [INFO] [stderr] Running unittests src/bin/test.rs (/opt/rustwide/target/debug/deps/test-5034239b5168fc39) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] running 0 tests [INFO] [stdout] [INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s [INFO] [stderr] Running unittests src/bin/visualize.rs (/opt/rustwide/target/debug/deps/visualize-4e095b3e048fbda3) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] running 0 tests [INFO] [stdout] [INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s [INFO] [stdout] [INFO] [stderr] Doc-tests exp_lib [INFO] [stdout] [INFO] [stdout] running 3 tests [INFO] [stdout] test src/data_structures/matrix.rs - data_structures::matrix::Matrix::iter_matrix (line 32) ... ok [INFO] [stdout] test src/algorithms/sorting/incremental_quick_sort.rs - algorithms::sorting::incremental_quick_sort::IQS (line 29) ... ok [INFO] [stdout] test src/data_generators/permutations.rs - data_generators::permutations::Permutation::permutation (line 10) ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 3 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 1.98s [INFO] [stdout] [INFO] running `Command { std: "docker" "inspect" "1b0bb5d5300cfdfbbab809cb64730878c4b79a5a0d90429dbf1d9c5f6bd4940f", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "1b0bb5d5300cfdfbbab809cb64730878c4b79a5a0d90429dbf1d9c5f6bd4940f", kill_on_drop: false }` [INFO] [stdout] 1b0bb5d5300cfdfbbab809cb64730878c4b79a5a0d90429dbf1d9c5f6bd4940f