[INFO] cloning repository https://github.com/christheblog/graph-commands
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/christheblog/graph-commands" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fchristheblog%2Fgraph-commands", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fchristheblog%2Fgraph-commands'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 8861930c516adaa8c85ca1628309ded80f9d7d79
[INFO] checking christheblog/graph-commands against master#bca37a20bd376ce3fd138e7cdee7fe704e0f8814 for pr-139493-3
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fchristheblog%2Fgraph-commands" "/workspace/builds/worker-3-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-3-tc1/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/christheblog/graph-commands
[INFO] finished tweaking git repo https://github.com/christheblog/graph-commands
[INFO] tweaked toml for git repo https://github.com/christheblog/graph-commands written to /workspace/builds/worker-3-tc1/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/christheblog/graph-commands on toolchain bca37a20bd376ce3fd138e7cdee7fe704e0f8814
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+bca37a20bd376ce3fd138e7cdee7fe704e0f8814" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/christheblog/graph-commands 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" "+bca37a20bd376ce3fd138e7cdee7fe704e0f8814" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]  Downloading crates ...
[INFO] [stderr]   Downloaded regex v1.3.5
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-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:aa71247004a7fa38d13ec170f48f06cdedf5bc50b2a8645e56ed7e992e6fa513" "/opt/rustwide/cargo-home/bin/cargo" "+bca37a20bd376ce3fd138e7cdee7fe704e0f8814" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 5cadc22ef2976e4725c99a0a4487d240078e8d23b0936fff82eaed4ddf9ee49e
[INFO] running `Command { std: "docker" "start" "-a" "5cadc22ef2976e4725c99a0a4487d240078e8d23b0936fff82eaed4ddf9ee49e", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "5cadc22ef2976e4725c99a0a4487d240078e8d23b0936fff82eaed4ddf9ee49e", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "5cadc22ef2976e4725c99a0a4487d240078e8d23b0936fff82eaed4ddf9ee49e", kill_on_drop: false }`
[INFO] [stdout] 5cadc22ef2976e4725c99a0a4487d240078e8d23b0936fff82eaed4ddf9ee49e
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-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:aa71247004a7fa38d13ec170f48f06cdedf5bc50b2a8645e56ed7e992e6fa513" "/opt/rustwide/cargo-home/bin/cargo" "+bca37a20bd376ce3fd138e7cdee7fe704e0f8814" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 9925a759d1bcd13b5a0aa6dc19d83d81dd276018c9c2888a291f917c279feffc
[INFO] running `Command { std: "docker" "start" "-a" "9925a759d1bcd13b5a0aa6dc19d83d81dd276018c9c2888a291f917c279feffc", kill_on_drop: false }`
[INFO] [stderr]    Compiling libc v0.2.68
[INFO] [stderr]    Compiling memchr v2.3.3
[INFO] [stderr]    Compiling getrandom v0.1.14
[INFO] [stderr]     Checking either v1.5.3
[INFO] [stderr]     Checking thread_local v1.0.1
[INFO] [stderr]     Checking regex-syntax v0.6.17
[INFO] [stderr]     Checking unicode-width v0.1.7
[INFO] [stderr]     Checking ppv-lite86 v0.2.6
[INFO] [stderr]     Checking textwrap v0.11.0
[INFO] [stderr]     Checking vec_map v0.8.1
[INFO] [stderr]     Checking itertools v0.9.0
[INFO] [stderr]     Checking ansi_term v0.11.0
[INFO] [stderr]     Checking aho-corasick v0.7.10
[INFO] [stderr]     Checking atty v0.2.14
[INFO] [stderr]     Checking clap v2.33.0
[INFO] [stderr]     Checking rand_core v0.5.1
[INFO] [stderr]     Checking rand_chacha v0.2.2
[INFO] [stderr]     Checking rand v0.7.3
[INFO] [stderr]     Checking regex v1.3.5
[INFO] [stderr]     Checking gc-core v0.1.0 (/opt/rustwide/workdir/core)
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/algorithm/topo_sort.rs:25:23
[INFO] [stdout]    |
[INFO] [stdout] 25 | pub fn try_dag(graph: &DirectedGraph) -> Option<DAG> {
[INFO] [stdout]    |                       ^^^^^^^^^^^^^^            ^^^ the same lifetime is hidden here
[INFO] [stdout]    |                       |
[INFO] [stdout]    |                       the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout]    = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 25 | pub fn try_dag(graph: &DirectedGraph) -> Option<DAG<'_>> {
[INFO] [stdout]    |                                                    ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_best.rs:54:12
[INFO] [stdout]    |
[INFO] [stdout] 54 |     graph: &DirectedGraph,
[INFO] [stdout]    |            ^^^^^^^^^^^^^^ the lifetime is elided here
[INFO] [stdout] ...
[INFO] [stdout] 57 | ) -> BestFirstIter<F>
[INFO] [stdout]    |      ^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 57 | ) -> BestFirstIter<'_, F>
[INFO] [stdout]    |                    +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_best.rs:70:30
[INFO] [stdout]    |
[INFO] [stdout] 70 | fn empty_best_iter<F>(graph: &DirectedGraph, scorefn: F) -> BestFirstIter<F>
[INFO] [stdout]    |                              ^^^^^^^^^^^^^^                 ^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |                              |
[INFO] [stdout]    |                              the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 70 | fn empty_best_iter<F>(graph: &DirectedGraph, scorefn: F) -> BestFirstIter<'_, F>
[INFO] [stdout]    |                                                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_best_constraint.rs:60:12
[INFO] [stdout]    |
[INFO] [stdout] 60 |     graph: &DirectedGraph,
[INFO] [stdout]    |            ^^^^^^^^^^^^^^ the lifetime is elided here
[INFO] [stdout] ...
[INFO] [stdout] 64 | ) -> ConstrainedBestFirstIter<F>
[INFO] [stdout]    |      ^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 64 | ) -> ConstrainedBestFirstIter<'_, F>
[INFO] [stdout]    |                               +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_best_constraint.rs:77:12
[INFO] [stdout]    |
[INFO] [stdout] 77 |     graph: &DirectedGraph,
[INFO] [stdout]    |            ^^^^^^^^^^^^^^ the lifetime is elided here
[INFO] [stdout] ...
[INFO] [stdout] 80 | ) -> ConstrainedBestFirstIter<F>
[INFO] [stdout]    |      ^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 80 | ) -> ConstrainedBestFirstIter<'_, F>
[INFO] [stdout]    |                               +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_breadth.rs:38:24
[INFO] [stdout]    |
[INFO] [stdout] 38 | pub fn bfs_iter(graph: &DirectedGraph) -> BreadthFirstIter {
[INFO] [stdout]    |                        ^^^^^^^^^^^^^^     ^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |                        |
[INFO] [stdout]    |                        the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 38 | pub fn bfs_iter(graph: &DirectedGraph) -> BreadthFirstIter<'_> {
[INFO] [stdout]    |                                                           ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_breadth.rs:46:29
[INFO] [stdout]    |
[INFO] [stdout] 46 | pub fn bfs_iter_from(graph: &DirectedGraph, start_vertex: VertexId) -> BreadthFirstIter {
[INFO] [stdout]    |                             ^^^^^^^^^^^^^^ the lifetime is elided here ^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 46 | pub fn bfs_iter_from(graph: &DirectedGraph, start_vertex: VertexId) -> BreadthFirstIter<'_> {
[INFO] [stdout]    |                                                                                        ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_breadth.rs:54:26
[INFO] [stdout]    |
[INFO] [stdout] 54 | fn empty_bfs_iter(graph: &DirectedGraph) -> BreadthFirstIter {
[INFO] [stdout]    |                          ^^^^^^^^^^^^^^     ^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |                          |
[INFO] [stdout]    |                          the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 54 | fn empty_bfs_iter(graph: &DirectedGraph) -> BreadthFirstIter<'_> {
[INFO] [stdout]    |                                                             ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_breadth.rs:93:34
[INFO] [stdout]    |
[INFO] [stdout] 93 | pub fn bfs_path_iter_from(graph: &DirectedGraph, start_vertex: VertexId) -> BreadthFirstPathIter {
[INFO] [stdout]    |                                  ^^^^^^^^^^^^^^ the lifetime is elided here ^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 93 | pub fn bfs_path_iter_from(graph: &DirectedGraph, start_vertex: VertexId) -> BreadthFirstPathIter<'_> {
[INFO] [stdout]    |                                                                                                 ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> core/src/iter/iter_breadth.rs:100:31
[INFO] [stdout]     |
[INFO] [stdout] 100 | fn empty_bfs_path_iter(graph: &DirectedGraph) -> BreadthFirstPathIter {
[INFO] [stdout]     |                               ^^^^^^^^^^^^^^     ^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |                               |
[INFO] [stdout]     |                               the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 100 | fn empty_bfs_path_iter(graph: &DirectedGraph) -> BreadthFirstPathIter<'_> {
[INFO] [stdout]     |                                                                      ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> core/src/iter/iter_cycle.rs:113:26
[INFO] [stdout]     |
[INFO] [stdout] 113 | pub fn cycle_iter(graph: &DirectedGraph) -> CycleIter {
[INFO] [stdout]     |                          ^^^^^^^^^^^^^^     ^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |                          |
[INFO] [stdout]     |                          the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 113 | pub fn cycle_iter(graph: &DirectedGraph) -> CycleIter<'_> {
[INFO] [stdout]     |                                                      ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> core/src/iter/iter_cycle.rs:124:28
[INFO] [stdout]     |
[INFO] [stdout] 124 | fn empty_cycle_iter(graph: &DirectedGraph) -> CycleIter {
[INFO] [stdout]     |                            ^^^^^^^^^^^^^^     ^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |                            |
[INFO] [stdout]     |                            the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 124 | fn empty_cycle_iter(graph: &DirectedGraph) -> CycleIter<'_> {
[INFO] [stdout]     |                                                        ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_depth.rs:43:24
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub fn dfs_iter(graph: &DirectedGraph) -> DepthFirstIter {
[INFO] [stdout]    |                        ^^^^^^^^^^^^^^     ^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |                        |
[INFO] [stdout]    |                        the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub fn dfs_iter(graph: &DirectedGraph) -> DepthFirstIter<'_> {
[INFO] [stdout]    |                                                         ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_depth.rs:51:29
[INFO] [stdout]    |
[INFO] [stdout] 51 | pub fn dfs_iter_from(graph: &DirectedGraph, start_vertex: VertexId) -> DepthFirstIter {
[INFO] [stdout]    |                             ^^^^^^^^^^^^^^ the lifetime is elided here ^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 51 | pub fn dfs_iter_from(graph: &DirectedGraph, start_vertex: VertexId) -> DepthFirstIter<'_> {
[INFO] [stdout]    |                                                                                      ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_depth.rs:59:26
[INFO] [stdout]    |
[INFO] [stdout] 59 | fn empty_dfs_iter(graph: &DirectedGraph) -> DepthFirstIter {
[INFO] [stdout]    |                          ^^^^^^^^^^^^^^     ^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |                          |
[INFO] [stdout]    |                          the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 59 | fn empty_dfs_iter(graph: &DirectedGraph) -> DepthFirstIter<'_> {
[INFO] [stdout]    |                                                           ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> core/src/iter/iter_depth.rs:102:34
[INFO] [stdout]     |
[INFO] [stdout] 102 | pub fn dfs_iter_path_from(graph: &DirectedGraph, start_vertex: VertexId) -> DepthFirstPathIter {
[INFO] [stdout]     |                                  ^^^^^^^^^^^^^^ the lifetime is elided here ^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 102 | pub fn dfs_iter_path_from(graph: &DirectedGraph, start_vertex: VertexId) -> DepthFirstPathIter<'_> {
[INFO] [stdout]     |                                                                                               ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> core/src/iter/iter_depth.rs:109:31
[INFO] [stdout]     |
[INFO] [stdout] 109 | fn empty_dfs_path_iter(graph: &DirectedGraph) -> DepthFirstPathIter {
[INFO] [stdout]     |                               ^^^^^^^^^^^^^^     ^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |                               |
[INFO] [stdout]     |                               the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 109 | fn empty_dfs_path_iter(graph: &DirectedGraph) -> DepthFirstPathIter<'_> {
[INFO] [stdout]     |                                                                    ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Checking gc-command v0.1.0 (/opt/rustwide/workdir/command)
[INFO] [stdout] warning: use of deprecated method `std::error::Error::description`: use the Display impl or to_string()
[INFO] [stdout]   --> command/src/graph_utils.rs:60:35
[INFO] [stdout]    |
[INFO] [stdout] 60 |         Err(io_err) => Err(io_err.description().to_string()),
[INFO] [stdout]    |                                   ^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(deprecated)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: use of deprecated method `std::error::Error::description`: use the Display impl or to_string()
[INFO] [stdout]   --> command/src/graph_utils.rs:60:35
[INFO] [stdout]    |
[INFO] [stdout] 60 |         Err(io_err) => Err(io_err.description().to_string()),
[INFO] [stdout]    |                                   ^^^^^^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(deprecated)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `OVERALL_SCORE` is never used
[INFO] [stdout]  --> command/src/path_formatter.rs:4:7
[INFO] [stdout]   |
[INFO] [stdout] 4 | const OVERALL_SCORE: &str = "{score}";
[INFO] [stdout]   |       ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `OVERALL_SCORE_SHORT` is never used
[INFO] [stdout]  --> command/src/path_formatter.rs:5:7
[INFO] [stdout]   |
[INFO] [stdout] 5 | const OVERALL_SCORE_SHORT: &str = "%S";
[INFO] [stdout]   |       ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `NODE_ID` is never used
[INFO] [stdout]  --> command/src/path_formatter.rs:6:7
[INFO] [stdout]   |
[INFO] [stdout] 6 | const NODE_ID: &str = "{id}";
[INFO] [stdout]   |       ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `NODE_ID_SHORT` is never used
[INFO] [stdout]  --> command/src/path_formatter.rs:7:7
[INFO] [stdout]   |
[INFO] [stdout] 7 | const NODE_ID_SHORT: &str = "%i";
[INFO] [stdout]   |       ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `REPEAT` is never used
[INFO] [stdout]  --> command/src/path_formatter.rs:8:7
[INFO] [stdout]   |
[INFO] [stdout] 8 | const REPEAT: &str = "...";
[INFO] [stdout]   |       ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `OVERALL_SCORE` is never used
[INFO] [stdout]  --> command/src/path_formatter.rs:4:7
[INFO] [stdout]   |
[INFO] [stdout] 4 | const OVERALL_SCORE: &str = "{score}";
[INFO] [stdout]   |       ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `OVERALL_SCORE_SHORT` is never used
[INFO] [stdout]  --> command/src/path_formatter.rs:5:7
[INFO] [stdout]   |
[INFO] [stdout] 5 | const OVERALL_SCORE_SHORT: &str = "%S";
[INFO] [stdout]   |       ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `NODE_ID` is never used
[INFO] [stdout]  --> command/src/path_formatter.rs:6:7
[INFO] [stdout]   |
[INFO] [stdout] 6 | const NODE_ID: &str = "{id}";
[INFO] [stdout]   |       ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `NODE_ID_SHORT` is never used
[INFO] [stdout]  --> command/src/path_formatter.rs:7:7
[INFO] [stdout]   |
[INFO] [stdout] 7 | const NODE_ID_SHORT: &str = "%i";
[INFO] [stdout]   |       ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: constant `REPEAT` is never used
[INFO] [stdout]  --> command/src/path_formatter.rs:8:7
[INFO] [stdout]   |
[INFO] [stdout] 8 | const REPEAT: &str = "...";
[INFO] [stdout]   |       ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-cycle.rs:303:14
[INFO] [stdout]     |
[INFO] [stdout] 303 |     for c in constraint_min_length {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(for_loops_over_fallibles)]` on by default
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 303 -     for c in constraint_min_length {
[INFO] [stdout] 303 +     while let Some(c) = constraint_min_length {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 303 -     for c in constraint_min_length {
[INFO] [stdout] 303 +     if let Some(c) = constraint_min_length {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-cycle.rs:306:14
[INFO] [stdout]     |
[INFO] [stdout] 306 |     for c in constraint_max_length {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 306 -     for c in constraint_max_length {
[INFO] [stdout] 306 +     while let Some(c) = constraint_max_length {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 306 -     for c in constraint_max_length {
[INFO] [stdout] 306 +     if let Some(c) = constraint_max_length {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-cycle.rs:312:14
[INFO] [stdout]     |
[INFO] [stdout] 312 |     for c in constraint_min_score {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 312 -     for c in constraint_min_score {
[INFO] [stdout] 312 +     while let Some(c) = constraint_min_score {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 312 -     for c in constraint_min_score {
[INFO] [stdout] 312 +     if let Some(c) = constraint_min_score {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-cycle.rs:315:14
[INFO] [stdout]     |
[INFO] [stdout] 315 |     for c in constraint_max_score {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 315 -     for c in constraint_max_score {
[INFO] [stdout] 315 +     while let Some(c) = constraint_max_score {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 315 -     for c in constraint_max_score {
[INFO] [stdout] 315 +     if let Some(c) = constraint_max_score {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-cycle.rs:303:14
[INFO] [stdout]     |
[INFO] [stdout] 303 |     for c in constraint_min_length {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(for_loops_over_fallibles)]` on by default
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 303 -     for c in constraint_min_length {
[INFO] [stdout] 303 +     while let Some(c) = constraint_min_length {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 303 -     for c in constraint_min_length {
[INFO] [stdout] 303 +     if let Some(c) = constraint_min_length {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-cycle.rs:306:14
[INFO] [stdout]     |
[INFO] [stdout] 306 |     for c in constraint_max_length {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 306 -     for c in constraint_max_length {
[INFO] [stdout] 306 +     while let Some(c) = constraint_max_length {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 306 -     for c in constraint_max_length {
[INFO] [stdout] 306 +     if let Some(c) = constraint_max_length {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-cycle.rs:312:14
[INFO] [stdout]     |
[INFO] [stdout] 312 |     for c in constraint_min_score {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 312 -     for c in constraint_min_score {
[INFO] [stdout] 312 +     while let Some(c) = constraint_min_score {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 312 -     for c in constraint_min_score {
[INFO] [stdout] 312 +     if let Some(c) = constraint_min_score {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-cycle.rs:315:14
[INFO] [stdout]     |
[INFO] [stdout] 315 |     for c in constraint_max_score {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 315 -     for c in constraint_max_score {
[INFO] [stdout] 315 +     while let Some(c) = constraint_max_score {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 315 -     for c in constraint_max_score {
[INFO] [stdout] 315 +     if let Some(c) = constraint_max_score {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary trailing semicolon
[INFO] [stdout]    --> command/src/bin/gc-csp.rs:242:33
[INFO] [stdout]     |
[INFO] [stdout] 242 |     use gc_core::search::a_star;;
[INFO] [stdout]     |                                 ^ help: remove this semicolon
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(redundant_semicolons)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary trailing semicolon
[INFO] [stdout]    --> command/src/bin/gc-csp.rs:242:33
[INFO] [stdout]     |
[INFO] [stdout] 242 |     use gc_core::search::a_star;;
[INFO] [stdout]     |                                 ^ help: remove this semicolon
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(redundant_semicolons)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `itertools::Itertools`
[INFO] [stdout]  --> command/src/bin/gc-random.rs:8:5
[INFO] [stdout]   |
[INFO] [stdout] 8 | use itertools::Itertools;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `itertools::Itertools`
[INFO] [stdout]  --> command/src/bin/gc-random.rs:8:5
[INFO] [stdout]   |
[INFO] [stdout] 8 | use itertools::Itertools;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-csp.rs:282:14
[INFO] [stdout]     |
[INFO] [stdout] 282 |     for c in constraint_ordered {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(for_loops_over_fallibles)]` on by default
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 282 -     for c in constraint_ordered {
[INFO] [stdout] 282 +     while let Some(c) = constraint_ordered {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 282 -     for c in constraint_ordered {
[INFO] [stdout] 282 +     if let Some(c) = constraint_ordered {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-csp.rs:285:14
[INFO] [stdout]     |
[INFO] [stdout] 285 |     for c in constraint_include_cycle {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 285 -     for c in constraint_include_cycle {
[INFO] [stdout] 285 +     while let Some(c) = constraint_include_cycle {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 285 -     for c in constraint_include_cycle {
[INFO] [stdout] 285 +     if let Some(c) = constraint_include_cycle {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-csp.rs:288:14
[INFO] [stdout]     |
[INFO] [stdout] 288 |     for c in constraint_no_cycle {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 288 -     for c in constraint_no_cycle {
[INFO] [stdout] 288 +     while let Some(c) = constraint_no_cycle {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 288 -     for c in constraint_no_cycle {
[INFO] [stdout] 288 +     if let Some(c) = constraint_no_cycle {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-csp.rs:291:14
[INFO] [stdout]     |
[INFO] [stdout] 291 |     for c in constraint_min_length {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 291 -     for c in constraint_min_length {
[INFO] [stdout] 291 +     while let Some(c) = constraint_min_length {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 291 -     for c in constraint_min_length {
[INFO] [stdout] 291 +     if let Some(c) = constraint_min_length {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-csp.rs:294:14
[INFO] [stdout]     |
[INFO] [stdout] 294 |     for c in constraint_max_length {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 294 -     for c in constraint_max_length {
[INFO] [stdout] 294 +     while let Some(c) = constraint_max_length {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 294 -     for c in constraint_max_length {
[INFO] [stdout] 294 +     if let Some(c) = constraint_max_length {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-csp.rs:300:14
[INFO] [stdout]     |
[INFO] [stdout] 300 |     for c in constraint_min_score {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 300 -     for c in constraint_min_score {
[INFO] [stdout] 300 +     while let Some(c) = constraint_min_score {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 300 -     for c in constraint_min_score {
[INFO] [stdout] 300 +     if let Some(c) = constraint_min_score {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-csp.rs:303:14
[INFO] [stdout]     |
[INFO] [stdout] 303 |     for c in constraint_max_score {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 303 -     for c in constraint_max_score {
[INFO] [stdout] 303 +     while let Some(c) = constraint_max_score {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 303 -     for c in constraint_max_score {
[INFO] [stdout] 303 +     if let Some(c) = constraint_max_score {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-csp.rs:282:14
[INFO] [stdout]     |
[INFO] [stdout] 282 |     for c in constraint_ordered {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(for_loops_over_fallibles)]` on by default
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 282 -     for c in constraint_ordered {
[INFO] [stdout] 282 +     while let Some(c) = constraint_ordered {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 282 -     for c in constraint_ordered {
[INFO] [stdout] 282 +     if let Some(c) = constraint_ordered {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-csp.rs:285:14
[INFO] [stdout]     |
[INFO] [stdout] 285 |     for c in constraint_include_cycle {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 285 -     for c in constraint_include_cycle {
[INFO] [stdout] 285 +     while let Some(c) = constraint_include_cycle {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 285 -     for c in constraint_include_cycle {
[INFO] [stdout] 285 +     if let Some(c) = constraint_include_cycle {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-csp.rs:288:14
[INFO] [stdout]     |
[INFO] [stdout] 288 |     for c in constraint_no_cycle {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 288 -     for c in constraint_no_cycle {
[INFO] [stdout] 288 +     while let Some(c) = constraint_no_cycle {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 288 -     for c in constraint_no_cycle {
[INFO] [stdout] 288 +     if let Some(c) = constraint_no_cycle {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-csp.rs:291:14
[INFO] [stdout]     |
[INFO] [stdout] 291 |     for c in constraint_min_length {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 291 -     for c in constraint_min_length {
[INFO] [stdout] 291 +     while let Some(c) = constraint_min_length {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 291 -     for c in constraint_min_length {
[INFO] [stdout] 291 +     if let Some(c) = constraint_min_length {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-csp.rs:294:14
[INFO] [stdout]     |
[INFO] [stdout] 294 |     for c in constraint_max_length {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 294 -     for c in constraint_max_length {
[INFO] [stdout] 294 +     while let Some(c) = constraint_max_length {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 294 -     for c in constraint_max_length {
[INFO] [stdout] 294 +     if let Some(c) = constraint_max_length {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-csp.rs:300:14
[INFO] [stdout]     |
[INFO] [stdout] 300 |     for c in constraint_min_score {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 300 -     for c in constraint_min_score {
[INFO] [stdout] 300 +     while let Some(c) = constraint_min_score {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 300 -     for c in constraint_min_score {
[INFO] [stdout] 300 +     if let Some(c) = constraint_min_score {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: for loop over an `Option`. This is more readably written as an `if let` statement
[INFO] [stdout]    --> command/src/bin/gc-csp.rs:303:14
[INFO] [stdout]     |
[INFO] [stdout] 303 |     for c in constraint_max_score {
[INFO] [stdout]     |              ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout] help: to check pattern in a loop use `while let`
[INFO] [stdout]     |
[INFO] [stdout] 303 -     for c in constraint_max_score {
[INFO] [stdout] 303 +     while let Some(c) = constraint_max_score {
[INFO] [stdout]     |
[INFO] [stdout] help: consider using `if let` to clear intent
[INFO] [stdout]     |
[INFO] [stdout] 303 -     for c in constraint_max_score {
[INFO] [stdout] 303 +     if let Some(c) = constraint_max_score {
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/algorithm/topo_sort.rs:25:23
[INFO] [stdout]    |
[INFO] [stdout] 25 | pub fn try_dag(graph: &DirectedGraph) -> Option<DAG> {
[INFO] [stdout]    |                       ^^^^^^^^^^^^^^            ^^^ the same lifetime is hidden here
[INFO] [stdout]    |                       |
[INFO] [stdout]    |                       the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout]    = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 25 | pub fn try_dag(graph: &DirectedGraph) -> Option<DAG<'_>> {
[INFO] [stdout]    |                                                    ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_best.rs:54:12
[INFO] [stdout]    |
[INFO] [stdout] 54 |     graph: &DirectedGraph,
[INFO] [stdout]    |            ^^^^^^^^^^^^^^ the lifetime is elided here
[INFO] [stdout] ...
[INFO] [stdout] 57 | ) -> BestFirstIter<F>
[INFO] [stdout]    |      ^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 57 | ) -> BestFirstIter<'_, F>
[INFO] [stdout]    |                    +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_best.rs:70:30
[INFO] [stdout]    |
[INFO] [stdout] 70 | fn empty_best_iter<F>(graph: &DirectedGraph, scorefn: F) -> BestFirstIter<F>
[INFO] [stdout]    |                              ^^^^^^^^^^^^^^                 ^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |                              |
[INFO] [stdout]    |                              the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 70 | fn empty_best_iter<F>(graph: &DirectedGraph, scorefn: F) -> BestFirstIter<'_, F>
[INFO] [stdout]    |                                                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_best_constraint.rs:60:12
[INFO] [stdout]    |
[INFO] [stdout] 60 |     graph: &DirectedGraph,
[INFO] [stdout]    |            ^^^^^^^^^^^^^^ the lifetime is elided here
[INFO] [stdout] ...
[INFO] [stdout] 64 | ) -> ConstrainedBestFirstIter<F>
[INFO] [stdout]    |      ^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 64 | ) -> ConstrainedBestFirstIter<'_, F>
[INFO] [stdout]    |                               +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_best_constraint.rs:77:12
[INFO] [stdout]    |
[INFO] [stdout] 77 |     graph: &DirectedGraph,
[INFO] [stdout]    |            ^^^^^^^^^^^^^^ the lifetime is elided here
[INFO] [stdout] ...
[INFO] [stdout] 80 | ) -> ConstrainedBestFirstIter<F>
[INFO] [stdout]    |      ^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 80 | ) -> ConstrainedBestFirstIter<'_, F>
[INFO] [stdout]    |                               +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_breadth.rs:38:24
[INFO] [stdout]    |
[INFO] [stdout] 38 | pub fn bfs_iter(graph: &DirectedGraph) -> BreadthFirstIter {
[INFO] [stdout]    |                        ^^^^^^^^^^^^^^     ^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |                        |
[INFO] [stdout]    |                        the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 38 | pub fn bfs_iter(graph: &DirectedGraph) -> BreadthFirstIter<'_> {
[INFO] [stdout]    |                                                           ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_breadth.rs:46:29
[INFO] [stdout]    |
[INFO] [stdout] 46 | pub fn bfs_iter_from(graph: &DirectedGraph, start_vertex: VertexId) -> BreadthFirstIter {
[INFO] [stdout]    |                             ^^^^^^^^^^^^^^ the lifetime is elided here ^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 46 | pub fn bfs_iter_from(graph: &DirectedGraph, start_vertex: VertexId) -> BreadthFirstIter<'_> {
[INFO] [stdout]    |                                                                                        ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_breadth.rs:54:26
[INFO] [stdout]    |
[INFO] [stdout] 54 | fn empty_bfs_iter(graph: &DirectedGraph) -> BreadthFirstIter {
[INFO] [stdout]    |                          ^^^^^^^^^^^^^^     ^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |                          |
[INFO] [stdout]    |                          the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 54 | fn empty_bfs_iter(graph: &DirectedGraph) -> BreadthFirstIter<'_> {
[INFO] [stdout]    |                                                             ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_breadth.rs:93:34
[INFO] [stdout]    |
[INFO] [stdout] 93 | pub fn bfs_path_iter_from(graph: &DirectedGraph, start_vertex: VertexId) -> BreadthFirstPathIter {
[INFO] [stdout]    |                                  ^^^^^^^^^^^^^^ the lifetime is elided here ^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 93 | pub fn bfs_path_iter_from(graph: &DirectedGraph, start_vertex: VertexId) -> BreadthFirstPathIter<'_> {
[INFO] [stdout]    |                                                                                                 ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> core/src/iter/iter_breadth.rs:100:31
[INFO] [stdout]     |
[INFO] [stdout] 100 | fn empty_bfs_path_iter(graph: &DirectedGraph) -> BreadthFirstPathIter {
[INFO] [stdout]     |                               ^^^^^^^^^^^^^^     ^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |                               |
[INFO] [stdout]     |                               the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 100 | fn empty_bfs_path_iter(graph: &DirectedGraph) -> BreadthFirstPathIter<'_> {
[INFO] [stdout]     |                                                                      ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> core/src/iter/iter_cycle.rs:113:26
[INFO] [stdout]     |
[INFO] [stdout] 113 | pub fn cycle_iter(graph: &DirectedGraph) -> CycleIter {
[INFO] [stdout]     |                          ^^^^^^^^^^^^^^     ^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |                          |
[INFO] [stdout]     |                          the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 113 | pub fn cycle_iter(graph: &DirectedGraph) -> CycleIter<'_> {
[INFO] [stdout]     |                                                      ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> core/src/iter/iter_cycle.rs:124:28
[INFO] [stdout]     |
[INFO] [stdout] 124 | fn empty_cycle_iter(graph: &DirectedGraph) -> CycleIter {
[INFO] [stdout]     |                            ^^^^^^^^^^^^^^     ^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |                            |
[INFO] [stdout]     |                            the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 124 | fn empty_cycle_iter(graph: &DirectedGraph) -> CycleIter<'_> {
[INFO] [stdout]     |                                                        ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_depth.rs:43:24
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub fn dfs_iter(graph: &DirectedGraph) -> DepthFirstIter {
[INFO] [stdout]    |                        ^^^^^^^^^^^^^^     ^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |                        |
[INFO] [stdout]    |                        the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub fn dfs_iter(graph: &DirectedGraph) -> DepthFirstIter<'_> {
[INFO] [stdout]    |                                                         ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_depth.rs:51:29
[INFO] [stdout]    |
[INFO] [stdout] 51 | pub fn dfs_iter_from(graph: &DirectedGraph, start_vertex: VertexId) -> DepthFirstIter {
[INFO] [stdout]    |                             ^^^^^^^^^^^^^^ the lifetime is elided here ^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 51 | pub fn dfs_iter_from(graph: &DirectedGraph, start_vertex: VertexId) -> DepthFirstIter<'_> {
[INFO] [stdout]    |                                                                                      ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> core/src/iter/iter_depth.rs:59:26
[INFO] [stdout]    |
[INFO] [stdout] 59 | fn empty_dfs_iter(graph: &DirectedGraph) -> DepthFirstIter {
[INFO] [stdout]    |                          ^^^^^^^^^^^^^^     ^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]    |                          |
[INFO] [stdout]    |                          the lifetime is elided here
[INFO] [stdout]    |
[INFO] [stdout]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]    |
[INFO] [stdout] 59 | fn empty_dfs_iter(graph: &DirectedGraph) -> DepthFirstIter<'_> {
[INFO] [stdout]    |                                                           ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> core/src/iter/iter_depth.rs:102:34
[INFO] [stdout]     |
[INFO] [stdout] 102 | pub fn dfs_iter_path_from(graph: &DirectedGraph, start_vertex: VertexId) -> DepthFirstPathIter {
[INFO] [stdout]     |                                  ^^^^^^^^^^^^^^ the lifetime is elided here ^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 102 | pub fn dfs_iter_path_from(graph: &DirectedGraph, start_vertex: VertexId) -> DepthFirstPathIter<'_> {
[INFO] [stdout]     |                                                                                               ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> core/src/iter/iter_depth.rs:109:31
[INFO] [stdout]     |
[INFO] [stdout] 109 | fn empty_dfs_path_iter(graph: &DirectedGraph) -> DepthFirstPathIter {
[INFO] [stdout]     |                               ^^^^^^^^^^^^^^     ^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stdout]     |                               |
[INFO] [stdout]     |                               the lifetime is elided here
[INFO] [stdout]     |
[INFO] [stdout]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stdout] help: use `'_` for type paths
[INFO] [stdout]     |
[INFO] [stdout] 109 | fn empty_dfs_path_iter(graph: &DirectedGraph) -> DepthFirstPathIter<'_> {
[INFO] [stdout]     |                                                                    ++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 9.53s
[INFO] running `Command { std: "docker" "inspect" "9925a759d1bcd13b5a0aa6dc19d83d81dd276018c9c2888a291f917c279feffc", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "9925a759d1bcd13b5a0aa6dc19d83d81dd276018c9c2888a291f917c279feffc", kill_on_drop: false }`
[INFO] [stdout] 9925a759d1bcd13b5a0aa6dc19d83d81dd276018c9c2888a291f917c279feffc
