[INFO] fetching crate cinnabar 0.2.0... [INFO] checking cinnabar-0.2.0 against master#cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3 for pr-135841 [INFO] extracting crate cinnabar 0.2.0 into /workspace/builds/worker-0-tc1/source [INFO] validating manifest of crates.io crate cinnabar 0.2.0 on toolchain cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking crates.io crate cinnabar 0.2.0 [INFO] finished tweaking crates.io crate cinnabar 0.2.0 [INFO] tweaked toml for crates.io crate cinnabar 0.2.0 written to /workspace/builds/worker-0-tc1/source/Cargo.toml [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3" "generate-lockfile" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Updating crates.io index [INFO] [stderr] Locking 5 packages to latest compatible versions [INFO] [stderr] Adding itertools v0.10.5 (available: v0.14.0) [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [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:c80049f3b88b82089a44e0f06d0d6029d44b96b7257e55a1cd63dbc9f4c33334" "/opt/rustwide/cargo-home/bin/cargo" "+cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] a8c66a56349935f628810f4f55bdef67fe7846a4ea44b93e64fa7ee3ebecd888 [INFO] running `Command { std: "docker" "start" "-a" "a8c66a56349935f628810f4f55bdef67fe7846a4ea44b93e64fa7ee3ebecd888", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "a8c66a56349935f628810f4f55bdef67fe7846a4ea44b93e64fa7ee3ebecd888", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "a8c66a56349935f628810f4f55bdef67fe7846a4ea44b93e64fa7ee3ebecd888", kill_on_drop: false }` [INFO] [stdout] a8c66a56349935f628810f4f55bdef67fe7846a4ea44b93e64fa7ee3ebecd888 [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:c80049f3b88b82089a44e0f06d0d6029d44b96b7257e55a1cd63dbc9f4c33334" "/opt/rustwide/cargo-home/bin/cargo" "+cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 7d8b7da6271af11caaba1a883f101ed7ba53bf841c30b2eebeb37eb5ae86e8f1 [INFO] running `Command { std: "docker" "start" "-a" "7d8b7da6271af11caaba1a883f101ed7ba53bf841c30b2eebeb37eb5ae86e8f1", kill_on_drop: false }` [INFO] [stderr] Checking either v1.13.0 [INFO] [stderr] Checking yansi v1.0.1 [INFO] [stderr] Checking diff v0.1.13 [INFO] [stderr] Checking itertools v0.10.5 [INFO] [stderr] Checking pretty_assertions v1.4.1 [INFO] [stderr] Checking cinnabar v0.2.0 (/opt/rustwide/workdir) [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/adjacency.rs:98:25 [INFO] [stdout] | [INFO] [stdout] 98 | type Vertices<'a> = impl Topology; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/adjacency.rs:111:22 [INFO] [stdout] | [INFO] [stdout] 111 | type Edges<'a> = impl Topology; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/adjacency.rs:124:22 [INFO] [stdout] | [INFO] [stdout] 124 | type Edges<'a> = impl Topology; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/adjacency.rs:148:25 [INFO] [stdout] | [INFO] [stdout] 148 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/adjacency.rs:149:29 [INFO] [stdout] | [INFO] [stdout] 149 | type AdjacentIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/adjacency.rs:176:25 [INFO] [stdout] | [INFO] [stdout] 176 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/adjacency.rs:177:29 [INFO] [stdout] | [INFO] [stdout] 177 | type AdjacentIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/adjacency.rs:201:25 [INFO] [stdout] | [INFO] [stdout] 201 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/adjacency.rs:202:29 [INFO] [stdout] | [INFO] [stdout] 202 | type AdjacentIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/grid.rs:123:25 [INFO] [stdout] | [INFO] [stdout] 123 | type Vertices<'a> = impl Topology; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/grid.rs:136:22 [INFO] [stdout] | [INFO] [stdout] 136 | type Edges<'a> = impl Topology; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/grid.rs:156:25 [INFO] [stdout] | [INFO] [stdout] 156 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/grid.rs:157:29 [INFO] [stdout] | [INFO] [stdout] 157 | type AdjacentIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/grid.rs:186:25 [INFO] [stdout] | [INFO] [stdout] 186 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/grid.rs:187:29 [INFO] [stdout] | [INFO] [stdout] 187 | type AdjacentIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unexpected `cfg` condition value: `serde` [INFO] [stdout] --> src/utils/unordered_pair.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 10 | #[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))] [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ help: remove the condition [INFO] [stdout] | [INFO] [stdout] = note: no expected values for `feature` [INFO] [stdout] = help: consider adding `serde` as a feature in `Cargo.toml` [INFO] [stdout] = note: see for more information about checking conditional configuration [INFO] [stdout] = note: `#[warn(unexpected_cfgs)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/adjacency.rs:98:25 [INFO] [stdout] | [INFO] [stdout] 98 | type Vertices<'a> = impl Topology; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/adjacency.rs:111:22 [INFO] [stdout] | [INFO] [stdout] 111 | type Edges<'a> = impl Topology; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/adjacency.rs:124:22 [INFO] [stdout] | [INFO] [stdout] 124 | type Edges<'a> = impl Topology; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/adjacency.rs:148:25 [INFO] [stdout] | [INFO] [stdout] 148 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/adjacency.rs:149:29 [INFO] [stdout] | [INFO] [stdout] 149 | type AdjacentIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/adjacency.rs:176:25 [INFO] [stdout] | [INFO] [stdout] 176 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/adjacency.rs:177:29 [INFO] [stdout] | [INFO] [stdout] 177 | type AdjacentIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/adjacency.rs:201:25 [INFO] [stdout] | [INFO] [stdout] 201 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/adjacency.rs:202:29 [INFO] [stdout] | [INFO] [stdout] 202 | type AdjacentIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/grid.rs:123:25 [INFO] [stdout] | [INFO] [stdout] 123 | type Vertices<'a> = impl Topology; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/grid.rs:136:22 [INFO] [stdout] | [INFO] [stdout] 136 | type Edges<'a> = impl Topology; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/grid.rs:156:25 [INFO] [stdout] | [INFO] [stdout] 156 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/grid.rs:157:29 [INFO] [stdout] | [INFO] [stdout] 157 | type AdjacentIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/grid.rs:186:25 [INFO] [stdout] | [INFO] [stdout] 186 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0658]: `impl Trait` in associated types is unstable [INFO] [stdout] --> src/graphs/grid.rs:187:29 [INFO] [stdout] | [INFO] [stdout] 187 | type AdjacentIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: see issue #63063 for more information [INFO] [stdout] = help: add `#![feature(impl_trait_in_assoc_type)]` to the crate attributes to enable [INFO] [stdout] = note: this compiler was built on 2025-01-21; consider upgrading it if it is out of date [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unexpected `cfg` condition value: `serde` [INFO] [stdout] --> src/utils/unordered_pair.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 10 | #[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))] [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ help: remove the condition [INFO] [stdout] | [INFO] [stdout] = note: no expected values for `feature` [INFO] [stdout] = help: consider adding `serde` as a feature in `Cargo.toml` [INFO] [stdout] = note: see for more information about checking conditional configuration [INFO] [stdout] = note: `#[warn(unexpected_cfgs)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: the feature `generic_associated_types` has been stable since 1.65.0 and no longer requires an attribute to enable [INFO] [stdout] --> src/lib.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | #![feature(generic_associated_types)] [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(stable_features)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: the feature `mixed_integer_ops` has been stable since 1.66.0 and no longer requires an attribute to enable [INFO] [stdout] --> src/lib.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | #![feature(mixed_integer_ops)] [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: the feature `generic_associated_types` has been stable since 1.65.0 and no longer requires an attribute to enable [INFO] [stdout] --> src/lib.rs:36:12 [INFO] [stdout] | [INFO] [stdout] 36 | #![feature(generic_associated_types)] [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(stable_features)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: the feature `mixed_integer_ops` has been stable since 1.66.0 and no longer requires an attribute to enable [INFO] [stdout] --> src/lib.rs:37:12 [INFO] [stdout] | [INFO] [stdout] 37 | #![feature(mixed_integer_ops)] [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:105:9 [INFO] [stdout] | [INFO] [stdout] 98 | type Vertices<'a> = impl Topology; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'a` as defined here... [INFO] [stdout] ... [INFO] [stdout] 105 | Vertices { graph: self } [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> src/graphs/adjacency.rs:142:5 [INFO] [stdout] | [INFO] [stdout] 142 | graph: &'a AdjacencyGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 98 | type Vertices<'a> = impl Topology where I: 'a; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `D` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:105:9 [INFO] [stdout] | [INFO] [stdout] 98 | type Vertices<'a> = impl Topology; [INFO] [stdout] | -- the parameter type `D` must be valid for the lifetime `'a` as defined here... [INFO] [stdout] ... [INFO] [stdout] 105 | Vertices { graph: self } [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `D` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> src/graphs/adjacency.rs:142:5 [INFO] [stdout] | [INFO] [stdout] 142 | graph: &'a AdjacencyGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 98 | type Vertices<'a> = impl Topology where D: 'a; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:105:9 [INFO] [stdout] | [INFO] [stdout] 98 | type Vertices<'a> = impl Topology; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'a` as defined here... [INFO] [stdout] ... [INFO] [stdout] 105 | Vertices { graph: self } [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> src/graphs/adjacency.rs:142:5 [INFO] [stdout] | [INFO] [stdout] 142 | graph: &'a AdjacencyGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 98 | type Vertices<'a> = impl Topology where I: 'a; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `D` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:105:9 [INFO] [stdout] | [INFO] [stdout] 98 | type Vertices<'a> = impl Topology; [INFO] [stdout] | -- the parameter type `D` must be valid for the lifetime `'a` as defined here... [INFO] [stdout] ... [INFO] [stdout] 105 | Vertices { graph: self } [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `D` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> src/graphs/adjacency.rs:142:5 [INFO] [stdout] | [INFO] [stdout] 142 | graph: &'a AdjacencyGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 98 | type Vertices<'a> = impl Topology where D: 'a; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:118:9 [INFO] [stdout] | [INFO] [stdout] 111 | type Edges<'a> = impl Topology; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'a` as defined here... [INFO] [stdout] ... [INFO] [stdout] 118 | Edges { graph: self } [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> src/graphs/adjacency.rs:170:5 [INFO] [stdout] | [INFO] [stdout] 170 | graph: &'a AdjacencyGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 111 | type Edges<'a> = impl Topology where I: 'a; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:118:9 [INFO] [stdout] | [INFO] [stdout] 111 | type Edges<'a> = impl Topology; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'a` as defined here... [INFO] [stdout] ... [INFO] [stdout] 118 | Edges { graph: self } [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> src/graphs/adjacency.rs:170:5 [INFO] [stdout] | [INFO] [stdout] 170 | graph: &'a AdjacencyGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 111 | type Edges<'a> = impl Topology where I: 'a; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:135:9 [INFO] [stdout] | [INFO] [stdout] 124 | type Edges<'a> = impl Topology; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'a` as defined here... [INFO] [stdout] ... [INFO] [stdout] 135 | Edges { graph: self } [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> src/graphs/adjacency.rs:170:5 [INFO] [stdout] | [INFO] [stdout] 170 | graph: &'a AdjacencyGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 124 | type Edges<'a> = impl Topology where I: 'a; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:135:9 [INFO] [stdout] | [INFO] [stdout] 124 | type Edges<'a> = impl Topology; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'a` as defined here... [INFO] [stdout] ... [INFO] [stdout] 135 | Edges { graph: self } [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> src/graphs/adjacency.rs:170:5 [INFO] [stdout] | [INFO] [stdout] 170 | graph: &'a AdjacencyGraph, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 124 | type Edges<'a> = impl Topology where I: 'a; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:152:9 [INFO] [stdout] | [INFO] [stdout] 148 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 152 | self.graph.storage.keys().copied() [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> src/graphs/adjacency.rs:148:30 [INFO] [stdout] | [INFO] [stdout] 148 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 148 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:152:9 [INFO] [stdout] | [INFO] [stdout] 148 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 152 | self.graph.storage.keys().copied() [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> /rustc/cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3/library/std/src/collections/hash/map.rs:1608:24 [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 148 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:152:9 [INFO] [stdout] | [INFO] [stdout] 148 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 152 | self.graph.storage.keys().copied() [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> src/graphs/adjacency.rs:148:30 [INFO] [stdout] | [INFO] [stdout] 148 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 148 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:152:9 [INFO] [stdout] | [INFO] [stdout] 148 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 152 | self.graph.storage.keys().copied() [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> /rustc/cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3/library/std/src/collections/hash/map.rs:1608:24 [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 148 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:152:9 [INFO] [stdout] | [INFO] [stdout] 148 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 152 | self.graph.storage.keys().copied() [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `HashSet` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> /rustc/cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3/library/std/src/collections/hash/map.rs:1608:31 [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 148 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:152:9 [INFO] [stdout] | [INFO] [stdout] 148 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 152 | self.graph.storage.keys().copied() [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds [INFO] [stdout] | [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 148 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:152:9 [INFO] [stdout] | [INFO] [stdout] 148 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 152 | self.graph.storage.keys().copied() [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `HashSet` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> /rustc/cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3/library/std/src/collections/hash/map.rs:1608:31 [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 148 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:152:9 [INFO] [stdout] | [INFO] [stdout] 148 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 152 | self.graph.storage.keys().copied() [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds [INFO] [stdout] | [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 148 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:156:9 [INFO] [stdout] | [INFO] [stdout] 149 | type AdjacentIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 156 | / self.graph [INFO] [stdout] 157 | | .storage [INFO] [stdout] 158 | | .get(&item) [INFO] [stdout] 159 | | .map(|edges| edges.iter().copied()) [INFO] [stdout] | |_______________________________________________^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> src/graphs/adjacency.rs:149:34 [INFO] [stdout] | [INFO] [stdout] 149 | type AdjacentIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 149 | type AdjacentIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:156:9 [INFO] [stdout] | [INFO] [stdout] 149 | type AdjacentIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 156 | / self.graph [INFO] [stdout] 157 | | .storage [INFO] [stdout] 158 | | .get(&item) [INFO] [stdout] 159 | | .map(|edges| edges.iter().copied()) [INFO] [stdout] | |_______________________________________________^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> /rustc/cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3/library/std/src/collections/hash/set.rs:1316:24 [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 149 | type AdjacentIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:156:9 [INFO] [stdout] | [INFO] [stdout] 149 | type AdjacentIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 156 | / self.graph [INFO] [stdout] 157 | | .storage [INFO] [stdout] 158 | | .get(&item) [INFO] [stdout] 159 | | .map(|edges| edges.iter().copied()) [INFO] [stdout] | |_______________________________________________^ ...so that the type `I` will meet its required lifetime bounds [INFO] [stdout] | [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 149 | type AdjacentIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:156:9 [INFO] [stdout] | [INFO] [stdout] 149 | type AdjacentIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 156 | / self.graph [INFO] [stdout] 157 | | .storage [INFO] [stdout] 158 | | .get(&item) [INFO] [stdout] 159 | | .map(|edges| edges.iter().copied()) [INFO] [stdout] | |_______________________________________________^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> src/graphs/adjacency.rs:149:34 [INFO] [stdout] | [INFO] [stdout] 149 | type AdjacentIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 149 | type AdjacentIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:156:9 [INFO] [stdout] | [INFO] [stdout] 149 | type AdjacentIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 156 | / self.graph [INFO] [stdout] 157 | | .storage [INFO] [stdout] 158 | | .get(&item) [INFO] [stdout] 159 | | .map(|edges| edges.iter().copied()) [INFO] [stdout] | |_______________________________________________^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> /rustc/cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3/library/std/src/collections/hash/set.rs:1316:24 [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 149 | type AdjacentIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:156:9 [INFO] [stdout] | [INFO] [stdout] 149 | type AdjacentIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 156 | / self.graph [INFO] [stdout] 157 | | .storage [INFO] [stdout] 158 | | .get(&item) [INFO] [stdout] 159 | | .map(|edges| edges.iter().copied()) [INFO] [stdout] | |_______________________________________________^ ...so that the type `I` will meet its required lifetime bounds [INFO] [stdout] | [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 149 | type AdjacentIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:180:9 [INFO] [stdout] | [INFO] [stdout] 176 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 180 | / self.graph [INFO] [stdout] 181 | | .storage [INFO] [stdout] 182 | | .iter() [INFO] [stdout] 183 | | .map(|(start, edges)| edges.iter().map(|end| (*start, *end))) [INFO] [stdout] 184 | | .flatten() [INFO] [stdout] | |______________________^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> /rustc/cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3/library/std/src/collections/hash/map.rs:1484:24 [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 176 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:180:9 [INFO] [stdout] | [INFO] [stdout] 176 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 180 | / self.graph [INFO] [stdout] 181 | | .storage [INFO] [stdout] 182 | | .iter() [INFO] [stdout] 183 | | .map(|(start, edges)| edges.iter().map(|end| (*start, *end))) [INFO] [stdout] 184 | | .flatten() [INFO] [stdout] | |______________________^ ...so that the type `HashSet` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> /rustc/cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3/library/std/src/collections/hash/map.rs:1484:31 [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 176 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:180:9 [INFO] [stdout] | [INFO] [stdout] 176 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 180 | / self.graph [INFO] [stdout] 181 | | .storage [INFO] [stdout] 182 | | .iter() [INFO] [stdout] 183 | | .map(|(start, edges)| edges.iter().map(|end| (*start, *end))) [INFO] [stdout] 184 | | .flatten() [INFO] [stdout] | |______________________^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> /rustc/cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3/library/std/src/collections/hash/map.rs:1484:24 [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 176 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:180:9 [INFO] [stdout] | [INFO] [stdout] 176 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 180 | / self.graph [INFO] [stdout] 181 | | .storage [INFO] [stdout] 182 | | .iter() [INFO] [stdout] 183 | | .map(|(start, edges)| edges.iter().map(|end| (*start, *end))) [INFO] [stdout] 184 | | .flatten() [INFO] [stdout] | |______________________^ ...so that the type `HashSet` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> /rustc/cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3/library/std/src/collections/hash/map.rs:1484:31 [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 176 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:205:9 [INFO] [stdout] | [INFO] [stdout] 201 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 205 | / self.graph [INFO] [stdout] 206 | | .storage [INFO] [stdout] 207 | | .iter() [INFO] [stdout] 208 | | .map(|(start, edges)| edges.iter().map(|end| (*start, *end).into())) [INFO] [stdout] 209 | | .flatten() [INFO] [stdout] | |______________________^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> /rustc/cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3/library/std/src/collections/hash/map.rs:1484:24 [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 201 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:205:9 [INFO] [stdout] | [INFO] [stdout] 201 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 205 | / self.graph [INFO] [stdout] 206 | | .storage [INFO] [stdout] 207 | | .iter() [INFO] [stdout] 208 | | .map(|(start, edges)| edges.iter().map(|end| (*start, *end).into())) [INFO] [stdout] 209 | | .flatten() [INFO] [stdout] | |______________________^ ...so that the type `HashSet` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> /rustc/cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3/library/std/src/collections/hash/map.rs:1484:31 [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 201 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:205:9 [INFO] [stdout] | [INFO] [stdout] 201 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 205 | / self.graph [INFO] [stdout] 206 | | .storage [INFO] [stdout] 207 | | .iter() [INFO] [stdout] 208 | | .map(|(start, edges)| edges.iter().map(|end| (*start, *end).into())) [INFO] [stdout] 209 | | .flatten() [INFO] [stdout] | |______________________^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> /rustc/cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3/library/std/src/collections/hash/map.rs:1484:24 [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 201 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/adjacency.rs:205:9 [INFO] [stdout] | [INFO] [stdout] 201 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 205 | / self.graph [INFO] [stdout] 206 | | .storage [INFO] [stdout] 207 | | .iter() [INFO] [stdout] 208 | | .map(|(start, edges)| edges.iter().map(|end| (*start, *end).into())) [INFO] [stdout] 209 | | .flatten() [INFO] [stdout] | |______________________^ ...so that the type `HashSet` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> /rustc/cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3/library/std/src/collections/hash/map.rs:1484:31 [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 201 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/grid.rs:130:9 [INFO] [stdout] | [INFO] [stdout] 123 | type Vertices<'a> = impl Topology; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'a` as defined here... [INFO] [stdout] ... [INFO] [stdout] 130 | Vertices { grid: self } [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> src/graphs/grid.rs:150:5 [INFO] [stdout] | [INFO] [stdout] 150 | grid: &'a Grid, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 123 | type Vertices<'a> = impl Topology where I: 'a; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/grid.rs:143:9 [INFO] [stdout] | [INFO] [stdout] 136 | type Edges<'a> = impl Topology; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'a` as defined here... [INFO] [stdout] ... [INFO] [stdout] 143 | Edges { grid: self } [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> src/graphs/grid.rs:180:5 [INFO] [stdout] | [INFO] [stdout] 180 | grid: &'a Grid, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 136 | type Edges<'a> = impl Topology where I: 'a; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/grid.rs:160:9 [INFO] [stdout] | [INFO] [stdout] 156 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 160 | self.grid.coords.keys().copied() [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> src/graphs/grid.rs:156:30 [INFO] [stdout] | [INFO] [stdout] 156 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 156 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/grid.rs:160:9 [INFO] [stdout] | [INFO] [stdout] 156 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 160 | self.grid.coords.keys().copied() [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> /rustc/cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3/library/std/src/collections/hash/map.rs:1608:24 [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 156 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/grid.rs:160:9 [INFO] [stdout] | [INFO] [stdout] 156 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 160 | self.grid.coords.keys().copied() [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds [INFO] [stdout] | [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 156 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/grid.rs:130:9 [INFO] [stdout] | [INFO] [stdout] 123 | type Vertices<'a> = impl Topology; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'a` as defined here... [INFO] [stdout] ... [INFO] [stdout] 130 | Vertices { grid: self } [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> src/graphs/grid.rs:150:5 [INFO] [stdout] | [INFO] [stdout] 150 | grid: &'a Grid, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 123 | type Vertices<'a> = impl Topology where I: 'a; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/grid.rs:169:9 [INFO] [stdout] | [INFO] [stdout] 157 | type AdjacentIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 169 | Some(iter) [INFO] [stdout] | ^^^^^^^^^^ ...so that the reference type `&'b Grid` does not outlive the data it points at [INFO] [stdout] | [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 157 | type AdjacentIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/grid.rs:143:9 [INFO] [stdout] | [INFO] [stdout] 136 | type Edges<'a> = impl Topology; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'a` as defined here... [INFO] [stdout] ... [INFO] [stdout] 143 | Edges { grid: self } [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> src/graphs/grid.rs:180:5 [INFO] [stdout] | [INFO] [stdout] 180 | grid: &'a Grid, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 136 | type Edges<'a> = impl Topology where I: 'a; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/grid.rs:160:9 [INFO] [stdout] | [INFO] [stdout] 156 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 160 | self.grid.coords.keys().copied() [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> src/graphs/grid.rs:156:30 [INFO] [stdout] | [INFO] [stdout] 156 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 156 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/grid.rs:160:9 [INFO] [stdout] | [INFO] [stdout] 156 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 160 | self.grid.coords.keys().copied() [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> /rustc/cd805f09ffbfa3896c8f50a619de9b67e1d9f3c3/library/std/src/collections/hash/map.rs:1608:24 [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 156 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/grid.rs:160:9 [INFO] [stdout] | [INFO] [stdout] 156 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 160 | self.grid.coords.keys().copied() [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds [INFO] [stdout] | [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 156 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/grid.rs:169:9 [INFO] [stdout] | [INFO] [stdout] 157 | type AdjacentIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 169 | Some(iter) [INFO] [stdout] | ^^^^^^^^^^ ...so that the reference type `&'b Grid` does not outlive the data it points at [INFO] [stdout] | [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 157 | type AdjacentIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/grid.rs:205:9 [INFO] [stdout] | [INFO] [stdout] 186 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 205 | by_rows.chain(by_columns) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the reference type `&'b Vec>` does not outlive the data it points at [INFO] [stdout] | [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 186 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/grid.rs:205:9 [INFO] [stdout] | [INFO] [stdout] 186 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 205 | by_rows.chain(by_columns) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the reference type `&'b grid::Edges<'b, I>` does not outlive the data it points at [INFO] [stdout] | [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 186 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/grid.rs:205:9 [INFO] [stdout] | [INFO] [stdout] 186 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 205 | by_rows.chain(by_columns) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> src/graphs/grid.rs:180:5 [INFO] [stdout] | [INFO] [stdout] 180 | grid: &'a Grid, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 186 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/grid.rs:205:9 [INFO] [stdout] | [INFO] [stdout] 186 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 205 | by_rows.chain(by_columns) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the reference type `&'b Vec>` does not outlive the data it points at [INFO] [stdout] | [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 186 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/grid.rs:205:9 [INFO] [stdout] | [INFO] [stdout] 186 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 205 | by_rows.chain(by_columns) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the reference type `&'b grid::Edges<'b, I>` does not outlive the data it points at [INFO] [stdout] | [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 186 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0309]: the parameter type `I` may not live long enough [INFO] [stdout] --> src/graphs/grid.rs:205:9 [INFO] [stdout] | [INFO] [stdout] 186 | type ItemIter<'b> = impl Iterator; [INFO] [stdout] | -- the parameter type `I` must be valid for the lifetime `'b` as defined here... [INFO] [stdout] ... [INFO] [stdout] 205 | by_rows.chain(by_columns) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ ...so that the type `I` will meet its required lifetime bounds... [INFO] [stdout] | [INFO] [stdout] note: ...that is required by this bound [INFO] [stdout] --> src/graphs/grid.rs:180:5 [INFO] [stdout] | [INFO] [stdout] 180 | grid: &'a Grid, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] help: consider adding an explicit lifetime bound [INFO] [stdout] | [INFO] [stdout] 186 | type ItemIter<'b> = impl Iterator where I: 'b; [INFO] [stdout] | +++++++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: missing required bound on `Vertices` [INFO] [stdout] --> src/providers.rs:11:5 [INFO] [stdout] | [INFO] [stdout] 11 | type Vertices<'a>: Topology; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^- [INFO] [stdout] | | [INFO] [stdout] | help: add the required where clause: `where Self: 'a` [INFO] [stdout] | [INFO] [stdout] = note: this bound is currently required to ensure that impls have maximum flexibility [INFO] [stdout] = note: we are soliciting feedback, see issue #87479 for more information [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: missing required bound on `Edges` [INFO] [stdout] --> src/providers.rs:27:5 [INFO] [stdout] | [INFO] [stdout] 27 | type Edges<'a>: Topology; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^- [INFO] [stdout] | | [INFO] [stdout] | help: add the required where clause: `where Self: 'a` [INFO] [stdout] | [INFO] [stdout] = note: this bound is currently required to ensure that impls have maximum flexibility [INFO] [stdout] = note: we are soliciting feedback, see issue #87479 for more information [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: missing required bound on `ItemIter` [INFO] [stdout] --> src/topology.rs:20:5 [INFO] [stdout] | [INFO] [stdout] 20 | type ItemIter<'a>: Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^- [INFO] [stdout] | | [INFO] [stdout] | help: add the required where clause: `where Self: 'a` [INFO] [stdout] | [INFO] [stdout] = note: this bound is currently required to ensure that impls have maximum flexibility [INFO] [stdout] = note: we are soliciting feedback, see issue #87479 for more information [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: missing required bound on `AdjacentIter` [INFO] [stdout] --> src/topology.rs:23:5 [INFO] [stdout] | [INFO] [stdout] 23 | type AdjacentIter<'a>: Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^- [INFO] [stdout] | | [INFO] [stdout] | help: add the required where clause: `where Self: 'a` [INFO] [stdout] | [INFO] [stdout] = note: this bound is currently required to ensure that impls have maximum flexibility [INFO] [stdout] = note: we are soliciting feedback, see issue #87479 for more information [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: missing required bound on `Vertices` [INFO] [stdout] --> src/providers.rs:11:5 [INFO] [stdout] | [INFO] [stdout] 11 | type Vertices<'a>: Topology; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^- [INFO] [stdout] | | [INFO] [stdout] | help: add the required where clause: `where Self: 'a` [INFO] [stdout] | [INFO] [stdout] = note: this bound is currently required to ensure that impls have maximum flexibility [INFO] [stdout] = note: we are soliciting feedback, see issue #87479 for more information [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: missing required bound on `Edges` [INFO] [stdout] --> src/providers.rs:27:5 [INFO] [stdout] | [INFO] [stdout] 27 | type Edges<'a>: Topology; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^- [INFO] [stdout] | | [INFO] [stdout] | help: add the required where clause: `where Self: 'a` [INFO] [stdout] | [INFO] [stdout] = note: this bound is currently required to ensure that impls have maximum flexibility [INFO] [stdout] = note: we are soliciting feedback, see issue #87479 for more information [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: missing required bound on `ItemIter` [INFO] [stdout] --> src/topology.rs:20:5 [INFO] [stdout] | [INFO] [stdout] 20 | type ItemIter<'a>: Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^- [INFO] [stdout] | | [INFO] [stdout] | help: add the required where clause: `where Self: 'a` [INFO] [stdout] | [INFO] [stdout] = note: this bound is currently required to ensure that impls have maximum flexibility [INFO] [stdout] = note: we are soliciting feedback, see issue #87479 for more information [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: missing required bound on `AdjacentIter` [INFO] [stdout] --> src/topology.rs:23:5 [INFO] [stdout] | [INFO] [stdout] 23 | type AdjacentIter<'a>: Iterator; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^- [INFO] [stdout] | | [INFO] [stdout] | help: add the required where clause: `where Self: 'a` [INFO] [stdout] | [INFO] [stdout] = note: this bound is currently required to ensure that impls have maximum flexibility [INFO] [stdout] = note: we are soliciting feedback, see issue #87479 for more information [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] Some errors have detailed explanations: E0309, E0658. [INFO] [stdout] [INFO] [stdout] For more information about an error, try `rustc --explain E0309`. [INFO] [stdout] [INFO] [stderr] error: could not compile `cinnabar` (lib) due to 43 previous errors; 3 warnings emitted [INFO] [stderr] warning: build failed, waiting for other jobs to finish... [INFO] [stdout] Some errors have detailed explanations: E0309, E0658. [INFO] [stdout] [INFO] [stdout] For more information about an error, try `rustc --explain E0309`. [INFO] [stdout] [INFO] [stderr] error: could not compile `cinnabar` (lib test) due to 43 previous errors; 3 warnings emitted [INFO] running `Command { std: "docker" "inspect" "7d8b7da6271af11caaba1a883f101ed7ba53bf841c30b2eebeb37eb5ae86e8f1", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "7d8b7da6271af11caaba1a883f101ed7ba53bf841c30b2eebeb37eb5ae86e8f1", kill_on_drop: false }` [INFO] [stdout] 7d8b7da6271af11caaba1a883f101ed7ba53bf841c30b2eebeb37eb5ae86e8f1