[INFO] cloning repository https://github.com/juliuskoskela/rust_graph [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/juliuskoskela/rust_graph" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fjuliuskoskela%2Frust_graph", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fjuliuskoskela%2Frust_graph'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] e4667131e8625e54afbd91d92b2a67515956ec7e [INFO] checking juliuskoskela/rust_graph against master#64b185eddaa1d7ddf5e0c024be23b9cbba6c1722 for pr-143929 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fjuliuskoskela%2Frust_graph" "/workspace/builds/worker-2-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-2-tc1/source'... [INFO] [stderr] done. [INFO] started tweaking git repo https://github.com/juliuskoskela/rust_graph [INFO] finished tweaking git repo https://github.com/juliuskoskela/rust_graph [INFO] tweaked toml for git repo https://github.com/juliuskoskela/rust_graph written to /workspace/builds/worker-2-tc1/source/Cargo.toml [INFO] validating manifest of git repo https://github.com/juliuskoskela/rust_graph on toolchain 64b185eddaa1d7ddf5e0c024be23b9cbba6c1722 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+64b185eddaa1d7ddf5e0c024be23b9cbba6c1722" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] crate git repo https://github.com/juliuskoskela/rust_graph 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" "+64b185eddaa1d7ddf5e0c024be23b9cbba6c1722" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+64b185eddaa1d7ddf5e0c024be23b9cbba6c1722" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 2f138e5c4780173f1fd6bcdd9e95d3f9141730cb92591e3967c5f6dd16c026b9 [INFO] running `Command { std: "docker" "start" "-a" "2f138e5c4780173f1fd6bcdd9e95d3f9141730cb92591e3967c5f6dd16c026b9", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "2f138e5c4780173f1fd6bcdd9e95d3f9141730cb92591e3967c5f6dd16c026b9", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "2f138e5c4780173f1fd6bcdd9e95d3f9141730cb92591e3967c5f6dd16c026b9", kill_on_drop: false }` [INFO] [stdout] 2f138e5c4780173f1fd6bcdd9e95d3f9141730cb92591e3967c5f6dd16c026b9 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:90999bfc7ae267e83380e433d8e61a7c072ca6729e92edbae886d3423b3a6f4c" "/opt/rustwide/cargo-home/bin/cargo" "+64b185eddaa1d7ddf5e0c024be23b9cbba6c1722" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 4fe8f65baf80719dd725e3dd725786393f878d2279a5bc260b33b8bebb191af6 [INFO] running `Command { std: "docker" "start" "-a" "4fe8f65baf80719dd725e3dd725786393f878d2279a5bc260b33b8bebb191af6", kill_on_drop: false }` [INFO] [stderr] Compiling proc-macro2 v1.0.95 [INFO] [stderr] Compiling unicode-ident v1.0.18 [INFO] [stderr] Compiling libc v0.2.172 [INFO] [stderr] Checking cfg-if v1.0.1 [INFO] [stderr] Compiling serde v1.0.219 [INFO] [stderr] Compiling zerocopy v0.8.25 [INFO] [stderr] Compiling crossbeam-utils v0.8.21 [INFO] [stderr] Compiling autocfg v1.4.0 [INFO] [stderr] Compiling rayon-core v1.12.1 [INFO] [stderr] Checking either v1.15.0 [INFO] [stderr] Compiling serde_json v1.0.140 [INFO] [stderr] Compiling version_check v0.9.5 [INFO] [stderr] Compiling getrandom v0.3.3 [INFO] [stderr] Checking half v2.6.0 [INFO] [stderr] Compiling num-traits v0.2.19 [INFO] [stderr] Checking ciborium-io v0.2.2 [INFO] [stderr] Checking once_cell v1.21.3 [INFO] [stderr] Compiling ahash v0.8.12 [INFO] [stderr] Checking clap_lex v0.7.5 [INFO] [stderr] Checking itoa v1.0.15 [INFO] [stderr] Checking ryu v1.0.20 [INFO] [stderr] Checking memchr v2.7.5 [INFO] [stderr] Compiling thiserror v1.0.69 [INFO] [stderr] Checking crossbeam-epoch v0.9.18 [INFO] [stderr] Checking plotters-backend v0.3.7 [INFO] [stderr] Checking anstyle v1.0.11 [INFO] [stderr] Compiling quote v1.0.40 [INFO] [stderr] Checking regex-syntax v0.8.5 [INFO] [stderr] Checking clap_builder v4.5.40 [INFO] [stderr] Checking crossbeam-deque v0.8.6 [INFO] [stderr] Checking plotters-svg v0.3.7 [INFO] [stderr] Compiling syn v2.0.102 [INFO] [stderr] Checking getrandom v0.2.16 [INFO] [stderr] Checking rand_core v0.6.4 [INFO] [stderr] Checking ciborium-ll v0.2.2 [INFO] [stderr] Checking itertools v0.10.5 [INFO] [stderr] Checking equivalent v1.0.2 [INFO] [stderr] Checking cast v0.3.0 [INFO] [stderr] Checking hashbrown v0.15.4 [INFO] [stderr] Checking same-file v1.0.6 [INFO] [stderr] Checking walkdir v2.5.0 [INFO] [stderr] Checking rayon v1.10.0 [INFO] [stderr] Checking regex-automata v0.4.9 [INFO] [stderr] Checking plotters v0.3.7 [INFO] [stderr] Checking ppv-lite86 v0.2.21 [INFO] [stderr] Checking indexmap v2.9.0 [INFO] [stderr] Checking clap v4.5.40 [INFO] [stderr] Checking is-terminal v0.4.16 [INFO] [stderr] Checking rand_chacha v0.3.1 [INFO] [stderr] Checking half v1.8.3 [INFO] [stderr] Checking fixedbitset v0.4.2 [INFO] [stderr] Checking criterion-plot v0.5.0 [INFO] [stderr] Checking oorandom v11.1.5 [INFO] [stderr] Checking anes v0.1.6 [INFO] [stderr] Checking rand v0.8.5 [INFO] [stderr] Checking petgraph v0.6.5 [INFO] [stderr] Compiling serde_derive v1.0.219 [INFO] [stderr] Compiling thiserror-impl v1.0.69 [INFO] [stderr] Checking regex v1.11.1 [INFO] [stderr] Checking ciborium v0.2.2 [INFO] [stderr] Checking serde_cbor v0.11.2 [INFO] [stderr] Checking gdsl v0.2.1 (/opt/rustwide/workdir) [INFO] [stdout] warning: variants `InOrder` and `LevelOrder` are never constructed [INFO] [stdout] --> src/ungraph/node/algo/order.rs:11:5 [INFO] [stdout] | [INFO] [stdout] 8 | pub enum Ordering { [INFO] [stdout] | -------- variants in this enum [INFO] [stdout] ... [INFO] [stdout] 11 | InOrder, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] 12 | LevelOrder, [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/mod.rs:562:21 [INFO] [stdout] | [INFO] [stdout] 562 | pub fn preorder(&self) -> Order { [INFO] [stdout] | ^^^^^ -------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 562 | pub fn preorder(&self) -> Order<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/mod.rs:589:22 [INFO] [stdout] | [INFO] [stdout] 589 | pub fn postorder(&self) -> Order { [INFO] [stdout] | ^^^^^ -------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 589 | pub fn postorder(&self) -> Order<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/mod.rs:621:16 [INFO] [stdout] | [INFO] [stdout] 621 | pub fn dfs(&self) -> Dfs { [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 621 | pub fn dfs(&self) -> Dfs<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/mod.rs:654:16 [INFO] [stdout] | [INFO] [stdout] 654 | pub fn bfs(&self) -> Bfs { [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 654 | pub fn bfs(&self) -> Bfs<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/mod.rs:686:16 [INFO] [stdout] | [INFO] [stdout] 686 | pub fn pfs(&self) -> Pfs [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 686 | pub fn pfs(&self) -> Pfs<'_, K, N, E> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/mod.rs:711:21 [INFO] [stdout] | [INFO] [stdout] 711 | pub fn iter_out(&self) -> IterOut { [INFO] [stdout] | ^^^^^ ---------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 711 | pub fn iter_out(&self) -> IterOut<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/mod.rs:737:20 [INFO] [stdout] | [INFO] [stdout] 737 | pub fn iter_in(&self) -> IterIn { [INFO] [stdout] | ^^^^^ --------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 737 | pub fn iter_in(&self) -> IterIn<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/adjacent.rs:59:25 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn get_outbound(&self, idx: usize) -> Option> { [INFO] [stdout] | ^^^^^ --------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 59 | pub fn get_outbound(&self, idx: usize) -> Option> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/adjacent.rs:63:24 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn get_inbound(&self, idx: usize) -> Option> { [INFO] [stdout] | ^^^^^ --------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 63 | pub fn get_inbound(&self, idx: usize) -> Option> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/adjacent.rs:67:26 [INFO] [stdout] | [INFO] [stdout] 67 | pub fn find_outbound(&self, node: &K) -> Option> { [INFO] [stdout] | ^^^^^ --------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 67 | pub fn find_outbound(&self, node: &K) -> Option> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/adjacent.rs:76:25 [INFO] [stdout] | [INFO] [stdout] 76 | pub fn find_inbound(&self, node: &K) -> Option> { [INFO] [stdout] | ^^^^^ --------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 76 | pub fn find_inbound(&self, node: &K) -> Option> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/algo/path.rs:59:23 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn iter_nodes(&self) -> PathNodeIterator { [INFO] [stdout] | ^^^^^ ------------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 59 | pub fn iter_nodes(&self) -> PathNodeIterator<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/algo/path.rs:66:23 [INFO] [stdout] | [INFO] [stdout] 66 | pub fn iter_edges(&self) -> PathEdgeIterator { [INFO] [stdout] | ^^^^^ ------------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 66 | pub fn iter_edges(&self) -> PathEdgeIterator<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_digraph/node/mod.rs:527:21 [INFO] [stdout] | [INFO] [stdout] 527 | pub fn preorder(&self) -> Order { [INFO] [stdout] | ^^^^^ -------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 527 | pub fn preorder(&self) -> Order<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_digraph/node/mod.rs:554:22 [INFO] [stdout] | [INFO] [stdout] 554 | pub fn postorder(&self) -> Order { [INFO] [stdout] | ^^^^^ -------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 554 | pub fn postorder(&self) -> Order<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_digraph/node/mod.rs:586:16 [INFO] [stdout] | [INFO] [stdout] 586 | pub fn dfs(&self) -> Dfs { [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 586 | pub fn dfs(&self) -> Dfs<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_digraph/node/mod.rs:619:16 [INFO] [stdout] | [INFO] [stdout] 619 | pub fn bfs(&self) -> Bfs { [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 619 | pub fn bfs(&self) -> Bfs<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_digraph/node/mod.rs:651:16 [INFO] [stdout] | [INFO] [stdout] 651 | pub fn pfs(&self) -> Pfs [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 651 | pub fn pfs(&self) -> Pfs<'_, K, N, E> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_digraph/node/mod.rs:676:21 [INFO] [stdout] | [INFO] [stdout] 676 | pub fn iter_out(&self) -> IterOut { [INFO] [stdout] | ^^^^^ ---------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 676 | pub fn iter_out(&self) -> IterOut<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_digraph/node/mod.rs:702:20 [INFO] [stdout] | [INFO] [stdout] 702 | pub fn iter_in(&self) -> IterIn { [INFO] [stdout] | ^^^^^ --------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 702 | pub fn iter_in(&self) -> IterIn<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_digraph/node/algo/path.rs:59:23 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn iter_nodes(&self) -> PathNodeIterator { [INFO] [stdout] | ^^^^^ ------------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 59 | pub fn iter_nodes(&self) -> PathNodeIterator<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_digraph/node/algo/path.rs:66:23 [INFO] [stdout] | [INFO] [stdout] 66 | pub fn iter_edges(&self) -> PathEdgeIterator { [INFO] [stdout] | ^^^^^ ------------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 66 | pub fn iter_edges(&self) -> PathEdgeIterator<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_ungraph/node/mod.rs:407:18 [INFO] [stdout] | [INFO] [stdout] 407 | pub fn order(&self) -> Order { [INFO] [stdout] | ^^^^^ -------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 407 | pub fn order(&self) -> Order<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_ungraph/node/mod.rs:413:16 [INFO] [stdout] | [INFO] [stdout] 413 | pub fn dfs(&self) -> Dfs { [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 413 | pub fn dfs(&self) -> Dfs<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_ungraph/node/mod.rs:419:16 [INFO] [stdout] | [INFO] [stdout] 419 | pub fn bfs(&self) -> Bfs { [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 419 | pub fn bfs(&self) -> Bfs<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_ungraph/node/mod.rs:426:16 [INFO] [stdout] | [INFO] [stdout] 426 | pub fn pfs(&self) -> Pfs [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 426 | pub fn pfs(&self) -> Pfs<'_, K, N, E> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_ungraph/node/mod.rs:434:17 [INFO] [stdout] | [INFO] [stdout] 434 | pub fn iter(&self) -> NodeIterator { [INFO] [stdout] | ^^^^^ --------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 434 | pub fn iter(&self) -> NodeIterator<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_ungraph/node/algo/path.rs:59:23 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn iter_nodes(&self) -> PathNodeIterator { [INFO] [stdout] | ^^^^^ ------------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 59 | pub fn iter_nodes(&self) -> PathNodeIterator<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_ungraph/node/algo/path.rs:66:23 [INFO] [stdout] | [INFO] [stdout] 66 | pub fn iter_edges(&self) -> PathEdgeIterator { [INFO] [stdout] | ^^^^^ ------------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 66 | pub fn iter_edges(&self) -> PathEdgeIterator<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/ungraph/node/mod.rs:391:18 [INFO] [stdout] | [INFO] [stdout] 391 | pub fn order(&self) -> Order { [INFO] [stdout] | ^^^^^ -------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 391 | pub fn order(&self) -> Order<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/ungraph/node/mod.rs:397:16 [INFO] [stdout] | [INFO] [stdout] 397 | pub fn dfs(&self) -> Dfs { [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 397 | pub fn dfs(&self) -> Dfs<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/ungraph/node/mod.rs:403:16 [INFO] [stdout] | [INFO] [stdout] 403 | pub fn bfs(&self) -> Bfs { [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 403 | pub fn bfs(&self) -> Bfs<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/ungraph/node/mod.rs:410:16 [INFO] [stdout] | [INFO] [stdout] 410 | pub fn pfs(&self) -> Pfs [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 410 | pub fn pfs(&self) -> Pfs<'_, K, N, E> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/ungraph/node/mod.rs:418:17 [INFO] [stdout] | [INFO] [stdout] 418 | pub fn iter(&self) -> NodeIterator { [INFO] [stdout] | ^^^^^ --------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 418 | pub fn iter(&self) -> NodeIterator<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/ungraph/node/algo/path.rs:59:23 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn iter_nodes(&self) -> PathNodeIterator { [INFO] [stdout] | ^^^^^ ------------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 59 | pub fn iter_nodes(&self) -> PathNodeIterator<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/ungraph/node/algo/path.rs:66:23 [INFO] [stdout] | [INFO] [stdout] 66 | pub fn iter_edges(&self) -> PathEdgeIterator { [INFO] [stdout] | ^^^^^ ------------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 66 | pub fn iter_edges(&self) -> PathEdgeIterator<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Checking tinytemplate v1.2.1 [INFO] [stderr] Checking criterion v0.5.1 [INFO] [stdout] warning: function `digraph_creation` is never used [INFO] [stdout] --> benches/graph_benchmark.rs:10:4 [INFO] [stdout] | [INFO] [stdout] 10 | fn digraph_creation(c: &mut Criterion) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `digraph_bfs` is never used [INFO] [stdout] --> benches/graph_benchmark.rs:91:4 [INFO] [stdout] | [INFO] [stdout] 91 | fn digraph_bfs(c: &mut Criterion) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `digraph_scc` is never used [INFO] [stdout] --> benches/graph_benchmark.rs:126:4 [INFO] [stdout] | [INFO] [stdout] 126 | fn digraph_scc(c: &mut Criterion) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `digraph_serde` is never used [INFO] [stdout] --> benches/graph_benchmark.rs:144:4 [INFO] [stdout] | [INFO] [stdout] 144 | fn digraph_serde(c: &mut Criterion) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `digraph_page_rank` is never used [INFO] [stdout] --> benches/graph_benchmark.rs:184:4 [INFO] [stdout] | [INFO] [stdout] 184 | fn digraph_page_rank(c: &mut Criterion) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `create_graph_vec_distance_1` is never used [INFO] [stdout] --> benches/test_graphs.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | pub fn create_graph_vec_distance_1(size: usize) -> Vec, usize>> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `N` is never used [INFO] [stdout] --> benches/page_rank.rs:7:6 [INFO] [stdout] | [INFO] [stdout] 7 | type N = Node, Rc>>; [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: type alias `G` is never used [INFO] [stdout] --> benches/page_rank.rs:8:6 [INFO] [stdout] | [INFO] [stdout] 8 | type G = Vec; [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `page_rank` is never used [INFO] [stdout] --> benches/page_rank.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | pub fn page_rank(g: &G, α: f64, ε: f64) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `create_page_rank_dataset` is never used [INFO] [stdout] --> benches/page_rank.rs:43:8 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn create_page_rank_dataset(size: usize, avg_dgr: usize, min_dgr: usize, max_dgr: usize) -> G { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: comparison is useless due to type limits [INFO] [stdout] --> tests/comprehensive_ordering_tests.rs:103:17 [INFO] [stdout] | [INFO] [stdout] 103 | assert!(preorder_edges.len() >= 0); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_comparisons)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variants `InOrder` and `LevelOrder` are never constructed [INFO] [stdout] --> src/ungraph/node/algo/order.rs:11:5 [INFO] [stdout] | [INFO] [stdout] 8 | pub enum Ordering { [INFO] [stdout] | -------- variants in this enum [INFO] [stdout] ... [INFO] [stdout] 11 | InOrder, [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] 12 | LevelOrder, [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/mod.rs:562:21 [INFO] [stdout] | [INFO] [stdout] 562 | pub fn preorder(&self) -> Order { [INFO] [stdout] | ^^^^^ -------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 562 | pub fn preorder(&self) -> Order<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/mod.rs:589:22 [INFO] [stdout] | [INFO] [stdout] 589 | pub fn postorder(&self) -> Order { [INFO] [stdout] | ^^^^^ -------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 589 | pub fn postorder(&self) -> Order<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/mod.rs:621:16 [INFO] [stdout] | [INFO] [stdout] 621 | pub fn dfs(&self) -> Dfs { [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 621 | pub fn dfs(&self) -> Dfs<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/mod.rs:654:16 [INFO] [stdout] | [INFO] [stdout] 654 | pub fn bfs(&self) -> Bfs { [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 654 | pub fn bfs(&self) -> Bfs<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/mod.rs:686:16 [INFO] [stdout] | [INFO] [stdout] 686 | pub fn pfs(&self) -> Pfs [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 686 | pub fn pfs(&self) -> Pfs<'_, K, N, E> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/mod.rs:711:21 [INFO] [stdout] | [INFO] [stdout] 711 | pub fn iter_out(&self) -> IterOut { [INFO] [stdout] | ^^^^^ ---------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 711 | pub fn iter_out(&self) -> IterOut<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/mod.rs:737:20 [INFO] [stdout] | [INFO] [stdout] 737 | pub fn iter_in(&self) -> IterIn { [INFO] [stdout] | ^^^^^ --------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 737 | pub fn iter_in(&self) -> IterIn<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/adjacent.rs:59:25 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn get_outbound(&self, idx: usize) -> Option> { [INFO] [stdout] | ^^^^^ --------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 59 | pub fn get_outbound(&self, idx: usize) -> Option> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/adjacent.rs:63:24 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn get_inbound(&self, idx: usize) -> Option> { [INFO] [stdout] | ^^^^^ --------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 63 | pub fn get_inbound(&self, idx: usize) -> Option> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/adjacent.rs:67:26 [INFO] [stdout] | [INFO] [stdout] 67 | pub fn find_outbound(&self, node: &K) -> Option> { [INFO] [stdout] | ^^^^^ --------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 67 | pub fn find_outbound(&self, node: &K) -> Option> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/adjacent.rs:76:25 [INFO] [stdout] | [INFO] [stdout] 76 | pub fn find_inbound(&self, node: &K) -> Option> { [INFO] [stdout] | ^^^^^ --------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 76 | pub fn find_inbound(&self, node: &K) -> Option> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/algo/path.rs:59:23 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn iter_nodes(&self) -> PathNodeIterator { [INFO] [stdout] | ^^^^^ ------------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 59 | pub fn iter_nodes(&self) -> PathNodeIterator<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/digraph/node/algo/path.rs:66:23 [INFO] [stdout] | [INFO] [stdout] 66 | pub fn iter_edges(&self) -> PathEdgeIterator { [INFO] [stdout] | ^^^^^ ------------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 66 | pub fn iter_edges(&self) -> PathEdgeIterator<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_digraph/node/mod.rs:527:21 [INFO] [stdout] | [INFO] [stdout] 527 | pub fn preorder(&self) -> Order { [INFO] [stdout] | ^^^^^ -------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 527 | pub fn preorder(&self) -> Order<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_digraph/node/mod.rs:554:22 [INFO] [stdout] | [INFO] [stdout] 554 | pub fn postorder(&self) -> Order { [INFO] [stdout] | ^^^^^ -------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 554 | pub fn postorder(&self) -> Order<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_digraph/node/mod.rs:586:16 [INFO] [stdout] | [INFO] [stdout] 586 | pub fn dfs(&self) -> Dfs { [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 586 | pub fn dfs(&self) -> Dfs<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_digraph/node/mod.rs:619:16 [INFO] [stdout] | [INFO] [stdout] 619 | pub fn bfs(&self) -> Bfs { [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 619 | pub fn bfs(&self) -> Bfs<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_digraph/node/mod.rs:651:16 [INFO] [stdout] | [INFO] [stdout] 651 | pub fn pfs(&self) -> Pfs [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 651 | pub fn pfs(&self) -> Pfs<'_, K, N, E> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_digraph/node/mod.rs:676:21 [INFO] [stdout] | [INFO] [stdout] 676 | pub fn iter_out(&self) -> IterOut { [INFO] [stdout] | ^^^^^ ---------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 676 | pub fn iter_out(&self) -> IterOut<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_digraph/node/mod.rs:702:20 [INFO] [stdout] | [INFO] [stdout] 702 | pub fn iter_in(&self) -> IterIn { [INFO] [stdout] | ^^^^^ --------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 702 | pub fn iter_in(&self) -> IterIn<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_digraph/node/algo/path.rs:59:23 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn iter_nodes(&self) -> PathNodeIterator { [INFO] [stdout] | ^^^^^ ------------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 59 | pub fn iter_nodes(&self) -> PathNodeIterator<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_digraph/node/algo/path.rs:66:23 [INFO] [stdout] | [INFO] [stdout] 66 | pub fn iter_edges(&self) -> PathEdgeIterator { [INFO] [stdout] | ^^^^^ ------------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 66 | pub fn iter_edges(&self) -> PathEdgeIterator<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_ungraph/node/mod.rs:407:18 [INFO] [stdout] | [INFO] [stdout] 407 | pub fn order(&self) -> Order { [INFO] [stdout] | ^^^^^ -------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 407 | pub fn order(&self) -> Order<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_ungraph/node/mod.rs:413:16 [INFO] [stdout] | [INFO] [stdout] 413 | pub fn dfs(&self) -> Dfs { [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 413 | pub fn dfs(&self) -> Dfs<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_ungraph/node/mod.rs:419:16 [INFO] [stdout] | [INFO] [stdout] 419 | pub fn bfs(&self) -> Bfs { [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 419 | pub fn bfs(&self) -> Bfs<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_ungraph/node/mod.rs:426:16 [INFO] [stdout] | [INFO] [stdout] 426 | pub fn pfs(&self) -> Pfs [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 426 | pub fn pfs(&self) -> Pfs<'_, K, N, E> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_ungraph/node/mod.rs:434:17 [INFO] [stdout] | [INFO] [stdout] 434 | pub fn iter(&self) -> NodeIterator { [INFO] [stdout] | ^^^^^ --------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 434 | pub fn iter(&self) -> NodeIterator<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_ungraph/node/algo/path.rs:59:23 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn iter_nodes(&self) -> PathNodeIterator { [INFO] [stdout] | ^^^^^ ------------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 59 | pub fn iter_nodes(&self) -> PathNodeIterator<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/sync_ungraph/node/algo/path.rs:66:23 [INFO] [stdout] | [INFO] [stdout] 66 | pub fn iter_edges(&self) -> PathEdgeIterator { [INFO] [stdout] | ^^^^^ ------------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 66 | pub fn iter_edges(&self) -> PathEdgeIterator<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/ungraph/node/mod.rs:391:18 [INFO] [stdout] | [INFO] [stdout] 391 | pub fn order(&self) -> Order { [INFO] [stdout] | ^^^^^ -------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 391 | pub fn order(&self) -> Order<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/ungraph/node/mod.rs:397:16 [INFO] [stdout] | [INFO] [stdout] 397 | pub fn dfs(&self) -> Dfs { [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 397 | pub fn dfs(&self) -> Dfs<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/ungraph/node/mod.rs:403:16 [INFO] [stdout] | [INFO] [stdout] 403 | pub fn bfs(&self) -> Bfs { [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 403 | pub fn bfs(&self) -> Bfs<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/ungraph/node/mod.rs:410:16 [INFO] [stdout] | [INFO] [stdout] 410 | pub fn pfs(&self) -> Pfs [INFO] [stdout] | ^^^^^ ------------ the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 410 | pub fn pfs(&self) -> Pfs<'_, K, N, E> [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/ungraph/node/mod.rs:418:17 [INFO] [stdout] | [INFO] [stdout] 418 | pub fn iter(&self) -> NodeIterator { [INFO] [stdout] | ^^^^^ --------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 418 | pub fn iter(&self) -> NodeIterator<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/ungraph/node/algo/path.rs:59:23 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn iter_nodes(&self) -> PathNodeIterator { [INFO] [stdout] | ^^^^^ ------------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 59 | pub fn iter_nodes(&self) -> PathNodeIterator<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: lifetime flowing from input to output with different syntax can be confusing [INFO] [stdout] --> src/ungraph/node/algo/path.rs:66:23 [INFO] [stdout] | [INFO] [stdout] 66 | pub fn iter_edges(&self) -> PathEdgeIterator { [INFO] [stdout] | ^^^^^ ------------------------- the lifetime gets resolved as `'_` [INFO] [stdout] | | [INFO] [stdout] | this lifetime flows to the output [INFO] [stdout] | [INFO] [stdout] help: one option is to remove the lifetime for references and use the anonymous lifetime for paths [INFO] [stdout] | [INFO] [stdout] 66 | pub fn iter_edges(&self) -> PathEdgeIterator<'_, K, N, E> { [INFO] [stdout] | +++ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 39.87s [INFO] running `Command { std: "docker" "inspect" "4fe8f65baf80719dd725e3dd725786393f878d2279a5bc260b33b8bebb191af6", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "4fe8f65baf80719dd725e3dd725786393f878d2279a5bc260b33b8bebb191af6", kill_on_drop: false }` [INFO] [stdout] 4fe8f65baf80719dd725e3dd725786393f878d2279a5bc260b33b8bebb191af6