[INFO] fetching crate graphlib 0.6.3... [INFO] testing graphlib-0.6.3 against master#350d0ef0ec0493e6d21cfb265cb8211a0e74d766 for pr-145330-1 [INFO] extracting crate graphlib 0.6.3 into /workspace/builds/worker-7-tc1/source [INFO] started tweaking crates.io crate graphlib 0.6.3 [INFO] finished tweaking crates.io crate graphlib 0.6.3 [INFO] tweaked toml for crates.io crate graphlib 0.6.3 written to /workspace/builds/worker-7-tc1/source/Cargo.toml [INFO] validating manifest of crates.io crate graphlib 0.6.3 on toolchain 350d0ef0ec0493e6d21cfb265cb8211a0e74d766 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+350d0ef0ec0493e6d21cfb265cb8211a0e74d766" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] crate crates.io crate graphlib 0.6.3 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" "+350d0ef0ec0493e6d21cfb265cb8211a0e74d766" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Updating crates.io index [INFO] [stderr] Downloading crates ... [INFO] [stderr] Downloaded memoffset v0.6.4 [INFO] [stderr] Downloaded ppv-lite86 v0.2.15 [INFO] [stderr] Downloaded dot v0.1.4 [INFO] [stderr] Downloaded crossbeam-epoch v0.9.5 [INFO] [stderr] Downloaded semver v1.0.4 [INFO] [stderr] Downloaded js-sys v0.3.55 [INFO] [stderr] Downloaded serde_json v1.0.69 [INFO] [stderr] Downloaded rayon v1.5.1 [INFO] [stderr] Downloaded libc v0.2.107 [INFO] [stderr] Downloaded itertools v0.10.1 [INFO] [stderr] Downloaded web-sys v0.3.55 [INFO] [stderr] Downloaded rayon-core v1.9.1 [INFO] [stderr] Downloaded rand_isaac v0.2.0 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+350d0ef0ec0493e6d21cfb265cb8211a0e74d766" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 6a2e9e675e485bf16632f6b79a3f81718a6e42da964b030e477b9ff337bba008 [INFO] running `Command { std: "docker" "start" "-a" "6a2e9e675e485bf16632f6b79a3f81718a6e42da964b030e477b9ff337bba008", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "6a2e9e675e485bf16632f6b79a3f81718a6e42da964b030e477b9ff337bba008", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "6a2e9e675e485bf16632f6b79a3f81718a6e42da964b030e477b9ff337bba008", kill_on_drop: false }` [INFO] [stdout] 6a2e9e675e485bf16632f6b79a3f81718a6e42da964b030e477b9ff337bba008 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+350d0ef0ec0493e6d21cfb265cb8211a0e74d766" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] bfd5b844493e277d36f946545d3bac1728ee460d31b8d6c2cdc09e4263599a5c [INFO] running `Command { std: "docker" "start" "-a" "bfd5b844493e277d36f946545d3bac1728ee460d31b8d6c2cdc09e4263599a5c", kill_on_drop: false }` [INFO] [stderr] Compiling rand_core v0.5.1 [INFO] [stderr] Compiling autocfg v0.1.7 [INFO] [stderr] Compiling ppv-lite86 v0.2.15 [INFO] [stderr] Compiling ahash v0.2.19 [INFO] [stderr] Compiling hex v0.4.3 [INFO] [stderr] Compiling rand_isaac v0.2.0 [INFO] [stderr] Compiling hashbrown v0.6.3 [INFO] [stderr] Compiling rand_chacha v0.2.2 [INFO] [stderr] Compiling rand v0.7.3 [INFO] [stderr] Compiling graphlib v0.6.3 (/opt/rustwide/workdir) [INFO] [stdout] warning: methods `matches` and `matches_any` are never used [INFO] [stdout] --> src/edge.rs:43:19 [INFO] [stdout] | [INFO] [stdout] 36 | impl Edge { [INFO] [stdout] | --------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 43 | pub(crate) fn matches(&self, a: &VertexId, b: &VertexId) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | pub(crate) fn matches_any(&self, id: &VertexId) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: eliding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/iterators/bfs.rs:35:24 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn new(graph: &'a Graph) -> Bfs<'_, T> { [INFO] [stdout] | ^^ -- the same lifetime is elided here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is named here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 35 - pub fn new(graph: &'a Graph) -> Bfs<'_, T> { [INFO] [stdout] 35 + pub fn new(graph: &'a Graph) -> Bfs<'a, T> { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: eliding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/iterators/dfs.rs:42:24 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn new(graph: &'a Graph) -> Dfs<'_, T> { [INFO] [stdout] | ^^ -- the same lifetime is elided here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is named here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 42 - pub fn new(graph: &'a Graph) -> Dfs<'_, T> { [INFO] [stdout] 42 + pub fn new(graph: &'a Graph) -> Dfs<'a, T> { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/iterators/dijkstra.rs:100:41 [INFO] [stdout] | [INFO] [stdout] 100 | pub fn get_path_to(mut self, vert: &'a VertexId) -> Result { [INFO] [stdout] | ^^ ---------- the same lifetime is hidden here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is named here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 100 | pub fn get_path_to(mut self, vert: &'a VertexId) -> Result, GraphErr> { [INFO] [stdout] | ++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: eliding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/iterators/topo.rs:33:24 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn new(graph: &'a Graph) -> Topo<'_, T> { [INFO] [stdout] | ^^ -- the same lifetime is elided here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is named here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 33 - pub fn new(graph: &'a Graph) -> Topo<'_, T> { [INFO] [stdout] 33 + pub fn new(graph: &'a Graph) -> Topo<'a, T> { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 2.29s [INFO] running `Command { std: "docker" "inspect" "bfd5b844493e277d36f946545d3bac1728ee460d31b8d6c2cdc09e4263599a5c", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "bfd5b844493e277d36f946545d3bac1728ee460d31b8d6c2cdc09e4263599a5c", kill_on_drop: false }` [INFO] [stdout] bfd5b844493e277d36f946545d3bac1728ee460d31b8d6c2cdc09e4263599a5c [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+350d0ef0ec0493e6d21cfb265cb8211a0e74d766" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 41e2ce8b2d923be126265749961504c1e47a2e9d2bff21ed20604124eb6a51d8 [INFO] running `Command { std: "docker" "start" "-a" "41e2ce8b2d923be126265749961504c1e47a2e9d2bff21ed20604124eb6a51d8", kill_on_drop: false }` [INFO] [stderr] Compiling serde v1.0.130 [INFO] [stderr] Compiling crossbeam-utils v0.8.5 [INFO] [stderr] Compiling semver v1.0.4 [INFO] [stderr] Compiling memoffset v0.6.4 [INFO] [stderr] Compiling libc v0.2.107 [INFO] [stderr] Compiling proc-macro2 v1.0.32 [INFO] [stderr] Compiling crossbeam-epoch v0.9.5 [INFO] [stderr] Compiling memchr v2.4.1 [INFO] [stderr] Compiling rayon-core v1.9.1 [INFO] [stderr] Compiling unicode-xid v0.2.2 [INFO] [stderr] Compiling num-traits v0.2.14 [INFO] [stderr] Compiling serde_json v1.0.69 [INFO] [stderr] Compiling syn v1.0.81 [INFO] [stderr] Compiling rayon v1.5.1 [INFO] [stderr] Compiling plotters-backend v0.3.2 [INFO] [stderr] Compiling unicode-width v0.1.9 [INFO] [stderr] Compiling serde_derive v1.0.130 [INFO] [stderr] Compiling regex-automata v0.1.10 [INFO] [stderr] Compiling textwrap v0.11.0 [INFO] [stderr] Compiling itertools v0.10.1 [INFO] [stderr] Compiling regex-syntax v0.6.25 [INFO] [stderr] Compiling plotters-svg v0.3.1 [INFO] [stderr] Compiling rustc_version v0.4.0 [INFO] [stderr] Compiling half v1.8.2 [INFO] [stderr] Compiling walkdir v2.3.2 [INFO] [stderr] Compiling clap v2.33.3 [INFO] [stderr] Compiling oorandom v11.1.3 [INFO] [stdout] warning: methods `matches` and `matches_any` are never used [INFO] [stdout] --> src/edge.rs:43:19 [INFO] [stdout] | [INFO] [stdout] 36 | impl Edge { [INFO] [stdout] | --------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 43 | pub(crate) fn matches(&self, a: &VertexId, b: &VertexId) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | pub(crate) fn matches_any(&self, id: &VertexId) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: eliding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/iterators/bfs.rs:35:24 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn new(graph: &'a Graph) -> Bfs<'_, T> { [INFO] [stdout] | ^^ -- the same lifetime is elided here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is named here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 35 - pub fn new(graph: &'a Graph) -> Bfs<'_, T> { [INFO] [stdout] 35 + pub fn new(graph: &'a Graph) -> Bfs<'a, T> { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: eliding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/iterators/dfs.rs:42:24 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn new(graph: &'a Graph) -> Dfs<'_, T> { [INFO] [stdout] | ^^ -- the same lifetime is elided here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is named here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 42 - pub fn new(graph: &'a Graph) -> Dfs<'_, T> { [INFO] [stdout] 42 + pub fn new(graph: &'a Graph) -> Dfs<'a, T> { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/iterators/dijkstra.rs:100:41 [INFO] [stdout] | [INFO] [stdout] 100 | pub fn get_path_to(mut self, vert: &'a VertexId) -> Result { [INFO] [stdout] | ^^ ---------- the same lifetime is hidden here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is named here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 100 | pub fn get_path_to(mut self, vert: &'a VertexId) -> Result, GraphErr> { [INFO] [stdout] | ++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: eliding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/iterators/topo.rs:33:24 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn new(graph: &'a Graph) -> Topo<'_, T> { [INFO] [stdout] | ^^ -- the same lifetime is elided here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is named here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 33 - pub fn new(graph: &'a Graph) -> Topo<'_, T> { [INFO] [stdout] 33 + pub fn new(graph: &'a Graph) -> Topo<'a, T> { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling cast v0.2.7 [INFO] [stderr] Compiling csv-core v0.1.10 [INFO] [stderr] Compiling quote v1.0.10 [INFO] [stderr] Compiling crossbeam-channel v0.5.1 [INFO] [stderr] Compiling num_cpus v1.13.0 [INFO] [stderr] Compiling atty v0.2.14 [INFO] [stderr] Compiling plotters v0.3.1 [INFO] [stderr] Compiling crossbeam-deque v0.8.1 [INFO] [stderr] Compiling regex v1.5.4 [INFO] [stderr] Compiling criterion-plot v0.4.4 [INFO] [stderr] Compiling bstr v0.2.17 [INFO] [stderr] Compiling serde_cbor v0.11.2 [INFO] [stderr] Compiling csv v1.1.6 [INFO] [stderr] Compiling tinytemplate v1.2.1 [INFO] [stderr] Compiling criterion v0.3.5 [INFO] [stderr] Compiling graphlib v0.6.3 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused variable: `f` [INFO] [stdout] --> examples/dot.rs:6:13 [INFO] [stdout] | [INFO] [stdout] 6 | let mut f = File::create("example1.dot").unwrap(); [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_f` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> examples/dot.rs:6:9 [INFO] [stdout] | [INFO] [stdout] 6 | let mut f = File::create("example1.dot").unwrap(); [INFO] [stdout] | ----^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `id` [INFO] [stdout] --> src/graph.rs:1844:13 [INFO] [stdout] | [INFO] [stdout] 1844 | let id = VertexId::random(); [INFO] [stdout] | ^^ help: if this is intentional, prefix it with an underscore: `_id` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/iterators/dijkstra.rs:247:13 [INFO] [stdout] | [INFO] [stdout] 247 | let mut iterator = Dijkstra::new(&graph, &v1).unwrap(); [INFO] [stdout] | ----^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `matches` and `matches_any` are never used [INFO] [stdout] --> src/edge.rs:43:19 [INFO] [stdout] | [INFO] [stdout] 36 | impl Edge { [INFO] [stdout] | --------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 43 | pub(crate) fn matches(&self, a: &VertexId, b: &VertexId) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | pub(crate) fn matches_any(&self, id: &VertexId) -> bool { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: eliding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/iterators/bfs.rs:35:24 [INFO] [stdout] | [INFO] [stdout] 35 | pub fn new(graph: &'a Graph) -> Bfs<'_, T> { [INFO] [stdout] | ^^ -- the same lifetime is elided here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is named here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 35 - pub fn new(graph: &'a Graph) -> Bfs<'_, T> { [INFO] [stdout] 35 + pub fn new(graph: &'a Graph) -> Bfs<'a, T> { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: eliding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/iterators/dfs.rs:42:24 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn new(graph: &'a Graph) -> Dfs<'_, T> { [INFO] [stdout] | ^^ -- the same lifetime is elided here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is named here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 42 - pub fn new(graph: &'a Graph) -> Dfs<'_, T> { [INFO] [stdout] 42 + pub fn new(graph: &'a Graph) -> Dfs<'a, T> { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/iterators/dfs.rs:197:9 [INFO] [stdout] | [INFO] [stdout] 197 | graph.add_edge(&v1, &v2); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] = note: `#[warn(unused_must_use)]` on by default [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 197 | let _ = graph.add_edge(&v1, &v2); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/iterators/dfs.rs:198:9 [INFO] [stdout] | [INFO] [stdout] 198 | graph.add_edge(&v3, &v2); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 198 | let _ = graph.add_edge(&v3, &v2); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: hiding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/iterators/dijkstra.rs:100:41 [INFO] [stdout] | [INFO] [stdout] 100 | pub fn get_path_to(mut self, vert: &'a VertexId) -> Result { [INFO] [stdout] | ^^ ---------- the same lifetime is hidden here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is named here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 100 | pub fn get_path_to(mut self, vert: &'a VertexId) -> Result, GraphErr> { [INFO] [stdout] | ++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/iterators/dijkstra.rs:202:9 [INFO] [stdout] | [INFO] [stdout] 202 | graph.add_edge_with_weight(&v1, &v2, 0.0); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 202 | let _ = graph.add_edge_with_weight(&v1, &v2, 0.0); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/iterators/dijkstra.rs:215:9 [INFO] [stdout] | [INFO] [stdout] 215 | graph.add_edge_with_weight(&v1, &v2, -0.1); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 215 | let _ = graph.add_edge_with_weight(&v1, &v2, -0.1); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/iterators/dijkstra.rs:216:9 [INFO] [stdout] | [INFO] [stdout] 216 | graph.add_edge_with_weight(&v2, &v1, 0.1); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 216 | let _ = graph.add_edge_with_weight(&v2, &v1, 0.1); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/iterators/dijkstra.rs:230:9 [INFO] [stdout] | [INFO] [stdout] 230 | graph.add_edge_with_weight(&v1, &v2, 0.0); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 230 | let _ = graph.add_edge_with_weight(&v1, &v2, 0.0); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/iterators/dijkstra.rs:245:9 [INFO] [stdout] | [INFO] [stdout] 245 | graph.add_edge_with_weight(&v1, &v2, 0.0); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 245 | let _ = graph.add_edge_with_weight(&v1, &v2, 0.0); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/iterators/dijkstra.rs:260:9 [INFO] [stdout] | [INFO] [stdout] 260 | graph.add_edge_with_weight(&v1, &v2, 0.0); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 260 | let _ = graph.add_edge_with_weight(&v1, &v2, 0.0); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/iterators/dijkstra.rs:315:9 [INFO] [stdout] | [INFO] [stdout] 315 | iterator.set_source(&v_c); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 315 | let _ = iterator.set_source(&v_c); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: eliding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/iterators/topo.rs:33:24 [INFO] [stdout] | [INFO] [stdout] 33 | pub fn new(graph: &'a Graph) -> Topo<'_, T> { [INFO] [stdout] | ^^ -- the same lifetime is elided here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is named here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 33 - pub fn new(graph: &'a Graph) -> Topo<'_, T> { [INFO] [stdout] 33 + pub fn new(graph: &'a Graph) -> Topo<'a, T> { [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 26.75s [INFO] [stderr] warning: the following packages contain code that will be rejected by a future version of Rust: criterion v0.3.5 [INFO] [stderr] note: to see what the problems were, use the option `--future-incompat-report`, or run `cargo report future-incompatibilities --id 2` [INFO] running `Command { std: "docker" "inspect" "41e2ce8b2d923be126265749961504c1e47a2e9d2bff21ed20604124eb6a51d8", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "41e2ce8b2d923be126265749961504c1e47a2e9d2bff21ed20604124eb6a51d8", kill_on_drop: false }` [INFO] [stdout] 41e2ce8b2d923be126265749961504c1e47a2e9d2bff21ed20604124eb6a51d8 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-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:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+350d0ef0ec0493e6d21cfb265cb8211a0e74d766" "test" "--frozen", kill_on_drop: false }` [INFO] [stdout] 67f8376405f05fdb3dccc4ced4ed445bd8c68148d297a08043e5b7865f3247b0 [INFO] running `Command { std: "docker" "start" "-a" "67f8376405f05fdb3dccc4ced4ed445bd8c68148d297a08043e5b7865f3247b0", kill_on_drop: false }` [INFO] [stderr] warning: methods `matches` and `matches_any` are never used [INFO] [stderr] --> src/edge.rs:43:19 [INFO] [stderr] | [INFO] [stderr] 36 | impl Edge { [INFO] [stderr] | --------- methods in this implementation [INFO] [stderr] ... [INFO] [stderr] 43 | pub(crate) fn matches(&self, a: &VertexId, b: &VertexId) -> bool { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] ... [INFO] [stderr] 49 | pub(crate) fn matches_any(&self, id: &VertexId) -> bool { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: eliding a lifetime that's named elsewhere is confusing [INFO] [stderr] --> src/iterators/bfs.rs:35:24 [INFO] [stderr] | [INFO] [stderr] 35 | pub fn new(graph: &'a Graph) -> Bfs<'_, T> { [INFO] [stderr] | ^^ -- the same lifetime is elided here [INFO] [stderr] | | [INFO] [stderr] | the lifetime is named here [INFO] [stderr] | [INFO] [stderr] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stderr] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stderr] help: consistently use `'a` [INFO] [stderr] | [INFO] [stderr] 35 - pub fn new(graph: &'a Graph) -> Bfs<'_, T> { [INFO] [stderr] 35 + pub fn new(graph: &'a Graph) -> Bfs<'a, T> { [INFO] [stderr] | [INFO] [stderr] [INFO] [stderr] warning: eliding a lifetime that's named elsewhere is confusing [INFO] [stderr] --> src/iterators/dfs.rs:42:24 [INFO] [stderr] | [INFO] [stderr] 42 | pub fn new(graph: &'a Graph) -> Dfs<'_, T> { [INFO] [stderr] | ^^ -- the same lifetime is elided here [INFO] [stderr] | | [INFO] [stderr] | the lifetime is named here [INFO] [stderr] | [INFO] [stderr] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stderr] help: consistently use `'a` [INFO] [stderr] | [INFO] [stderr] 42 - pub fn new(graph: &'a Graph) -> Dfs<'_, T> { [INFO] [stderr] 42 + pub fn new(graph: &'a Graph) -> Dfs<'a, T> { [INFO] [stderr] | [INFO] [stderr] [INFO] [stderr] warning: hiding a lifetime that's named elsewhere is confusing [INFO] [stderr] --> src/iterators/dijkstra.rs:100:41 [INFO] [stderr] | [INFO] [stderr] 100 | pub fn get_path_to(mut self, vert: &'a VertexId) -> Result { [INFO] [stderr] | ^^ ---------- the same lifetime is hidden here [INFO] [stderr] | | [INFO] [stderr] | the lifetime is named here [INFO] [stderr] | [INFO] [stderr] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stderr] help: consistently use `'a` [INFO] [stderr] | [INFO] [stderr] 100 | pub fn get_path_to(mut self, vert: &'a VertexId) -> Result, GraphErr> { [INFO] [stderr] | ++++ [INFO] [stderr] [INFO] [stderr] warning: eliding a lifetime that's named elsewhere is confusing [INFO] [stderr] --> src/iterators/topo.rs:33:24 [INFO] [stderr] | [INFO] [stderr] 33 | pub fn new(graph: &'a Graph) -> Topo<'_, T> { [INFO] [stderr] | ^^ -- the same lifetime is elided here [INFO] [stderr] | | [INFO] [stderr] | the lifetime is named here [INFO] [stderr] | [INFO] [stderr] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stderr] help: consistently use `'a` [INFO] [stderr] | [INFO] [stderr] 33 - pub fn new(graph: &'a Graph) -> Topo<'_, T> { [INFO] [stderr] 33 + pub fn new(graph: &'a Graph) -> Topo<'a, T> { [INFO] [stderr] | [INFO] [stderr] [INFO] [stderr] warning: `graphlib` (lib) generated 5 warnings (run `cargo fix --lib -p graphlib` to apply 4 suggestions) [INFO] [stderr] warning: unused variable: `id` [INFO] [stderr] --> src/graph.rs:1844:13 [INFO] [stderr] | [INFO] [stderr] 1844 | let id = VertexId::random(); [INFO] [stderr] | ^^ help: if this is intentional, prefix it with an underscore: `_id` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_variables)]` on by default [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/iterators/dijkstra.rs:247:13 [INFO] [stderr] | [INFO] [stderr] 247 | let mut iterator = Dijkstra::new(&graph, &v1).unwrap(); [INFO] [stderr] | ----^^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_mut)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/iterators/dfs.rs:197:9 [INFO] [stderr] | [INFO] [stderr] 197 | graph.add_edge(&v1, &v2); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] = note: `#[warn(unused_must_use)]` on by default [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 197 | let _ = graph.add_edge(&v1, &v2); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/iterators/dfs.rs:198:9 [INFO] [stderr] | [INFO] [stderr] 198 | graph.add_edge(&v3, &v2); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 198 | let _ = graph.add_edge(&v3, &v2); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/iterators/dijkstra.rs:202:9 [INFO] [stderr] | [INFO] [stderr] 202 | graph.add_edge_with_weight(&v1, &v2, 0.0); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 202 | let _ = graph.add_edge_with_weight(&v1, &v2, 0.0); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/iterators/dijkstra.rs:215:9 [INFO] [stderr] | [INFO] [stderr] 215 | graph.add_edge_with_weight(&v1, &v2, -0.1); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 215 | let _ = graph.add_edge_with_weight(&v1, &v2, -0.1); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/iterators/dijkstra.rs:216:9 [INFO] [stderr] | [INFO] [stderr] 216 | graph.add_edge_with_weight(&v2, &v1, 0.1); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 216 | let _ = graph.add_edge_with_weight(&v2, &v1, 0.1); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/iterators/dijkstra.rs:230:9 [INFO] [stderr] | [INFO] [stderr] 230 | graph.add_edge_with_weight(&v1, &v2, 0.0); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 230 | let _ = graph.add_edge_with_weight(&v1, &v2, 0.0); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/iterators/dijkstra.rs:245:9 [INFO] [stderr] | [INFO] [stderr] 245 | graph.add_edge_with_weight(&v1, &v2, 0.0); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 245 | let _ = graph.add_edge_with_weight(&v1, &v2, 0.0); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/iterators/dijkstra.rs:260:9 [INFO] [stderr] | [INFO] [stderr] 260 | graph.add_edge_with_weight(&v1, &v2, 0.0); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 260 | let _ = graph.add_edge_with_weight(&v1, &v2, 0.0); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/iterators/dijkstra.rs:315:9 [INFO] [stderr] | [INFO] [stderr] 315 | iterator.set_source(&v_c); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 315 | let _ = iterator.set_source(&v_c); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused variable: `f` [INFO] [stderr] --> examples/dot.rs:6:13 [INFO] [stderr] | [INFO] [stderr] 6 | let mut f = File::create("example1.dot").unwrap(); [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_f` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_variables)]` on by default [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> examples/dot.rs:6:9 [INFO] [stderr] | [INFO] [stderr] 6 | let mut f = File::create("example1.dot").unwrap(); [INFO] [stderr] | ----^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_mut)]` on by default [INFO] [stderr] [INFO] [stderr] warning: `graphlib` (lib test) generated 16 warnings (5 duplicates) (run `cargo fix --lib -p graphlib --tests` to apply 1 suggestion) [INFO] [stderr] warning: `graphlib` (example "dot") generated 2 warnings (run `cargo fix --example "dot"` to apply 1 suggestion) [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.14s [INFO] [stderr] warning: the following packages contain code that will be rejected by a future version of Rust: criterion v0.3.5 [INFO] [stderr] note: to see what the problems were, use the option `--future-incompat-report`, or run `cargo report future-incompatibilities --id 2` [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/graphlib-6c256194d45a8d1d) [INFO] [stdout] [INFO] [stdout] running 26 tests [INFO] [stdout] test graph::tests::is_thread_safe ... ok [INFO] [stdout] test graph::tests::test_clonable ... ok [INFO] [stdout] test graph::tests::dfs ... ok [INFO] [stdout] test iterators::dfs::tests::cycle_self_edge ... ok [INFO] [stdout] test graph::tests::test_non_clonable_type ... ok [INFO] [stdout] test iterators::dfs::tests::not_cyclic_edge_to_successor ... ok [INFO] [stdout] test iterators::dfs::tests::not_cyclic_split_merge_continue ... ok [INFO] [stdout] test iterators::dijkstra::tests::test_get_path_to_with_invalid_vertex ... ok [INFO] [stdout] test graph::tests::dfs_mul_roots ... ok [INFO] [stdout] test iterators::dfs::tests::not_cyclic ... ok [INFO] [stdout] test iterators::dfs::tests::not_cyclic_edge_split_merge ... ok [INFO] [stdout] test iterators::dijkstra::tests::test_get_distance_with_invalid_vertex ... ok [INFO] [stdout] test iterators::dijkstra::tests::test_new_with_invalid_source ... ok [INFO] [stdout] test iterators::dijkstra::tests::test_new_with_empty_graph ... ok [INFO] [stdout] test iterators::dijkstra::tests::test_set_source_with_invalid_vertex ... ok [INFO] [stdout] test iterators::owning_iterator::tests::it_yields_correct_vertex_ids ... ok [INFO] [stdout] test iterators::dijkstra::tests::test_on_unweighted_graph ... ok [INFO] [stdout] test iterators::topo::tests::is_not_cyclic ... ok [INFO] [stdout] test graph::tests::test_remove_edge ... ok [INFO] [stdout] test iterators::topo::tests::is_cyclic ... ok [INFO] [stdout] test iterators::dijkstra::tests::test_new_with_negative_weight_edge ... ok [INFO] [stdout] test iterators::dijkstra::tests::test_on_connected_graphs ... ok [INFO] [stdout] test iterators::topo::tests::was_cyclic ... ok [INFO] [stdout] test iterators::topo::tests::is_cyclic_and_panic - should panic ... ok [INFO] [stdout] test graph::tests::test_add_edge_cycle_check ... ok [INFO] [stdout] test iterators::dfs::tests::is_cyclic ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 26 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.56s [INFO] [stdout] [INFO] [stderr] Doc-tests graphlib [INFO] [stdout] [INFO] [stdout] running 39 tests [INFO] [stdout] test src/graph.rs - graph::Graph::fetch (line 532) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::add_vertex (line 255) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::fetch_mut (line 553) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::capacity (line 149) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::fold (line 718) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::edge_count (line 489) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::add_edge_with_weight (line 341) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::has_edge (line 464) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::map (line 747) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::add_edge (line 276) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::dijkstra (line 1258) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::is_cyclic (line 792) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::bfs (line 1176) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::remove (line 581) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::add_edge_check_cycle (line 310) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::in_neighbors_count (line 869) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::new (line 93) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::edges (line 1023) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::reserve (line 171) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::retain (line 689) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::neighbors (line 990) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::neighbors_count (line 845) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::dfs (line 1145) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::in_neighbors (line 927) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::out_neighbors (line 961) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::shrink_to_fit (line 217) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::remove_edge (line 633) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::values (line 1303) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::roots_count (line 821) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::vertices (line 1118) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::out_neighbors_count (line 896) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::with_capacity (line 120) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::vertex_count (line 513) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::set_weight (line 414) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::roots (line 1053) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::tips (line 1085) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::topo (line 1227) ... ok [INFO] [stdout] test src/graph.rs - graph::Graph::weight (line 379) ... ok [INFO] [stdout] test src/lib.rs - (line 13) ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 39 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 5.43s [INFO] [stdout] [INFO] running `Command { std: "docker" "inspect" "67f8376405f05fdb3dccc4ced4ed445bd8c68148d297a08043e5b7865f3247b0", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "67f8376405f05fdb3dccc4ced4ed445bd8c68148d297a08043e5b7865f3247b0", kill_on_drop: false }` [INFO] [stdout] 67f8376405f05fdb3dccc4ced4ed445bd8c68148d297a08043e5b7865f3247b0