[INFO] cloning repository https://github.com/LMH01/simple_graph_algorithms
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/LMH01/simple_graph_algorithms" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FLMH01%2Fsimple_graph_algorithms", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FLMH01%2Fsimple_graph_algorithms'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] da9bd35c9af077d72d9d2627f5ae7d49afb77f03
[INFO] documenting LMH01/simple_graph_algorithms against da3f5c31e5535b3dc210067de660a45784ae1e9c for pr-162169
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FLMH01%2Fsimple_graph_algorithms" "/workspace/builds/worker-0-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-0-tc2/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/LMH01/simple_graph_algorithms
[INFO] finished tweaking git repo https://github.com/LMH01/simple_graph_algorithms
[INFO] tweaked toml for git repo https://github.com/LMH01/simple_graph_algorithms written to /workspace/builds/worker-0-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/LMH01/simple_graph_algorithms on toolchain da3f5c31e5535b3dc210067de660a45784ae1e9c
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+da3f5c31e5535b3dc210067de660a45784ae1e9c" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/LMH01/simple_graph_algorithms 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" "+da3f5c31e5535b3dc210067de660a45784ae1e9c" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]  Downloading crates ...
[INFO] [stderr]   Downloaded serde_derive v1.0.164
[INFO] [stderr]   Downloaded oorandom v11.1.3
[INFO] [stderr]   Downloaded plotters-backend v0.3.4
[INFO] [stderr]   Downloaded ciborium-io v0.2.1
[INFO] [stderr]   Downloaded ciborium-ll v0.2.1
[INFO] [stderr]   Downloaded memoffset v0.9.0
[INFO] [stderr]   Downloaded plotters-svg v0.3.3
[INFO] [stderr]   Downloaded walkdir v2.3.3
[INFO] [stderr]   Downloaded os_str_bytes v6.5.1
[INFO] [stderr]   Downloaded proc-macro2 v1.0.60
[INFO] [stderr]   Downloaded criterion v0.4.0
[INFO] [stderr]   Downloaded crossbeam-utils v0.8.16
[INFO] [stderr]   Downloaded crossbeam-epoch v0.9.15
[INFO] [stderr]   Downloaded log v0.4.19
[INFO] [stderr]   Downloaded ciborium v0.2.1
[INFO] [stderr]   Downloaded crossbeam-deque v0.8.3
[INFO] [stderr]   Downloaded serde v1.0.164
[INFO] [stderr]   Downloaded textwrap v0.16.0
[INFO] [stderr]   Downloaded rayon-core v1.11.0
[INFO] [stderr]   Downloaded crossbeam-channel v0.5.8
[INFO] [stderr]   Downloaded bumpalo v3.13.0
[INFO] [stderr]   Downloaded serde_json v1.0.96
[INFO] [stderr]   Downloaded plotters v0.3.4
[INFO] [stderr]   Downloaded rayon v1.7.0
[INFO] [stderr]   Downloaded clap v3.2.25
[INFO] [stderr]   Downloaded syn v2.0.18
[INFO] [stderr]   Downloaded regex v1.8.4
[INFO] [stderr]   Downloaded regex-syntax v0.7.2
[INFO] [stderr]   Downloaded libc v0.2.146
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc2/target:/opt/rustwide/target:rw,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" "-m" "1610612736" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:8683fc1fc2eb5c9ac98e0d076ab094b2ffac7f99da555d2b6a2e27f346de2ec7" "sleep" "infinity", kill_on_drop: false }`
[INFO] [stdout] 493132ae62ce4080543141cd2ee13e07c8d98decd80051a24275d7b51d37df64
[INFO] running `Command { std: "docker" "start" "493132ae62ce4080543141cd2ee13e07c8d98decd80051a24275d7b51d37df64", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "493132ae62ce4080543141cd2ee13e07c8d98decd80051a24275d7b51d37df64", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "exec" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-w" "/opt/rustwide/workdir" "--user" "0:0" "493132ae62ce4080543141cd2ee13e07c8d98decd80051a24275d7b51d37df64" "/opt/rustwide/cargo-home/bin/cargo" "+da3f5c31e5535b3dc210067de660a45784ae1e9c" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "493132ae62ce4080543141cd2ee13e07c8d98decd80051a24275d7b51d37df64", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "exec" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-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" "-w" "/opt/rustwide/workdir" "--user" "0:0" "493132ae62ce4080543141cd2ee13e07c8d98decd80051a24275d7b51d37df64" "/opt/rustwide/cargo-home/bin/cargo" "+da3f5c31e5535b3dc210067de660a45784ae1e9c" "doc" "--frozen" "--no-deps" "--document-private-items" "--message-format=json", kill_on_drop: false }`
[INFO] [stderr]  Documenting simple_graph_algorithms v1.0.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: redundant explicit link target
[INFO] [stdout]  --> src/lib.rs:3:60
[INFO] [stdout]   |
[INFO] [stdout] 3 | //! All algorithms in this crate are run using the [Graph](struct.Graph.html) struct.
[INFO] [stdout]   |                                                     -----  ^^^^^^^^^^^^^^^^^ explicit target is redundant
[INFO] [stdout]   |                                                     |
[INFO] [stdout]   |                                                     because label contains path that resolves to same destination
[INFO] [stdout]   |
[INFO] [stdout]   = note: when a link's destination is not specified,
[INFO] [stdout]           the label is used to resolve intra-doc links
[INFO] [stdout]   = note: `#[warn(rustdoc::redundant_explicit_links)]` on by default
[INFO] [stdout] help: remove explicit link target
[INFO] [stdout]   |
[INFO] [stdout] 3 - //! All algorithms in this crate are run using the [Graph](struct.Graph.html) struct.
[INFO] [stdout] 3 + //! All algorithms in this crate are run using the [Graph] struct.
[INFO] [stdout]   |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: redundant explicit link target
[INFO] [stdout]   --> src/algorithms.rs:29:24
[INFO] [stdout]    |
[INFO] [stdout] 29 | /// Use [bellman_ford](fn.bellman_ford.html) instead if your graph contains those edges with negative weights.
[INFO] [stdout]    |          ------------  ^^^^^^^^^^^^^^^^^^^^ explicit target is redundant
[INFO] [stdout]    |          |
[INFO] [stdout]    |          because label contains path that resolves to same destination
[INFO] [stdout]    |
[INFO] [stdout]    = note: when a link's destination is not specified,
[INFO] [stdout]            the label is used to resolve intra-doc links
[INFO] [stdout] help: remove explicit link target
[INFO] [stdout]    |
[INFO] [stdout] 29 - /// Use [bellman_ford](fn.bellman_ford.html) instead if your graph contains those edges with negative weights.
[INFO] [stdout] 29 + /// Use [bellman_ford] instead if your graph contains those edges with negative weights.
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: redundant explicit link target
[INFO] [stdout]   --> src/algorithms.rs:35:79
[INFO] [stdout]    |
[INFO] [stdout] 35 | ...essfully, the resulting [ShortestPathTree](../struct.ShortestPathTree.html) can be used to receive the shortest distance and path...
[INFO] [stdout]    |                             ----------------  ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ explicit target is redundant
[INFO] [stdout]    |                             |
[INFO] [stdout]    |                             because label contains path that resolves to same destination
[INFO] [stdout]    |
[INFO] [stdout]    = note: when a link's destination is not specified,
[INFO] [stdout]            the label is used to resolve intra-doc links
[INFO] [stdout] help: remove explicit link target
[INFO] [stdout]    |
[INFO] [stdout] 35 - /// Once the algorithm was run successfully, the resulting [ShortestPathTree](../struct.ShortestPathTree.html) can be used to receive the shortest distance and path to a node.
[INFO] [stdout] 35 + /// Once the algorithm was run successfully, the resulting [ShortestPathTree] can be used to receive the shortest distance and path to a node.
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: redundant explicit link target
[INFO] [stdout]    --> src/algorithms.rs:128:79
[INFO] [stdout]     |
[INFO] [stdout] 128 | ...essfully, the resulting [ShortestPathTree](../struct.ShortestPathTree.html) can be used to receive the shortest distance and pat...
[INFO] [stdout]     |                             ----------------  ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ explicit target is redundant
[INFO] [stdout]     |                             |
[INFO] [stdout]     |                             because label contains path that resolves to same destination
[INFO] [stdout]     |
[INFO] [stdout]     = note: when a link's destination is not specified,
[INFO] [stdout]             the label is used to resolve intra-doc links
[INFO] [stdout] help: remove explicit link target
[INFO] [stdout]     |
[INFO] [stdout] 128 - /// Once the algorithm was run successfully, the resulting [ShortestPathTree](../struct.ShortestPathTree.html) can be used to receive the shortest distance and path to a node.
[INFO] [stdout] 128 + /// Once the algorithm was run successfully, the resulting [ShortestPathTree] can be used to receive the shortest distance and path to a node.
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: redundant explicit link target
[INFO] [stdout]    --> src/lib.rs:165:33
[INFO] [stdout]     |
[INFO] [stdout] 165 |     /// path see [ShortestPath](struct.ShortestPath.html).
[INFO] [stdout]     |                   ------------  ^^^^^^^^^^^^^^^^^^^^^^^^ explicit target is redundant
[INFO] [stdout]     |                   |
[INFO] [stdout]     |                   because label contains path that resolves to same destination
[INFO] [stdout]     |
[INFO] [stdout]     = note: when a link's destination is not specified,
[INFO] [stdout]             the label is used to resolve intra-doc links
[INFO] [stdout] help: remove explicit link target
[INFO] [stdout]     |
[INFO] [stdout] 165 -     /// path see [ShortestPath](struct.ShortestPath.html).
[INFO] [stdout] 165 +     /// path see [ShortestPath].
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.40s
[INFO] [stderr]    Generated /opt/rustwide/target/doc/simple_graph_algorithms/index.html
[INFO] running `Command { std: "docker" "inspect" "493132ae62ce4080543141cd2ee13e07c8d98decd80051a24275d7b51d37df64", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "exec" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-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" "DOCS_RS=1" "-e" "RUSTC_BOOTSTRAP=1" "-w" "/opt/rustwide/workdir" "--user" "0:0" "493132ae62ce4080543141cd2ee13e07c8d98decd80051a24275d7b51d37df64" "/opt/rustwide/cargo-home/bin/cargo" "+da3f5c31e5535b3dc210067de660a45784ae1e9c" "rustdoc" "--lib" "-Zrustdoc-map" "--config" "build.rustdocflags=[\"--cfg\", \"docsrs\", \"-Z\", \"unstable-options\", \"--document-private-items\"]" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stderr]  Documenting simple_graph_algorithms v1.0.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: redundant explicit link target
[INFO] [stdout]  --> src/lib.rs:3:60
[INFO] [stdout]   |
[INFO] [stdout] 3 | //! All algorithms in this crate are run using the [Graph](struct.Graph.html) struct.
[INFO] [stdout]   |                                                     -----  ^^^^^^^^^^^^^^^^^ explicit target is redundant
[INFO] [stdout]   |                                                     |
[INFO] [stdout]   |                                                     because label contains path that resolves to same destination
[INFO] [stdout]   |
[INFO] [stdout]   = note: when a link's destination is not specified,
[INFO] [stdout]           the label is used to resolve intra-doc links
[INFO] [stdout]   = note: `#[warn(rustdoc::redundant_explicit_links)]` on by default
[INFO] [stdout] help: remove explicit link target
[INFO] [stdout]   |
[INFO] [stdout] 3 - //! All algorithms in this crate are run using the [Graph](struct.Graph.html) struct.
[INFO] [stdout] 3 + //! All algorithms in this crate are run using the [Graph] struct.
[INFO] [stdout]   |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: redundant explicit link target
[INFO] [stdout]   --> src/algorithms.rs:29:24
[INFO] [stdout]    |
[INFO] [stdout] 29 | /// Use [bellman_ford](fn.bellman_ford.html) instead if your graph contains those edges with negative weights.
[INFO] [stdout]    |          ------------  ^^^^^^^^^^^^^^^^^^^^ explicit target is redundant
[INFO] [stdout]    |          |
[INFO] [stdout]    |          because label contains path that resolves to same destination
[INFO] [stdout]    |
[INFO] [stdout]    = note: when a link's destination is not specified,
[INFO] [stdout]            the label is used to resolve intra-doc links
[INFO] [stdout] help: remove explicit link target
[INFO] [stdout]    |
[INFO] [stdout] 29 - /// Use [bellman_ford](fn.bellman_ford.html) instead if your graph contains those edges with negative weights.
[INFO] [stdout] 29 + /// Use [bellman_ford] instead if your graph contains those edges with negative weights.
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: redundant explicit link target
[INFO] [stdout]   --> src/algorithms.rs:35:79
[INFO] [stdout]    |
[INFO] [stdout] 35 | ...essfully, the resulting [ShortestPathTree](../struct.ShortestPathTree.html) can be used to receive the shortest distance and path...
[INFO] [stdout]    |                             ----------------  ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ explicit target is redundant
[INFO] [stdout]    |                             |
[INFO] [stdout]    |                             because label contains path that resolves to same destination
[INFO] [stdout]    |
[INFO] [stdout]    = note: when a link's destination is not specified,
[INFO] [stdout]            the label is used to resolve intra-doc links
[INFO] [stdout] help: remove explicit link target
[INFO] [stdout]    |
[INFO] [stdout] 35 - /// Once the algorithm was run successfully, the resulting [ShortestPathTree](../struct.ShortestPathTree.html) can be used to receive the shortest distance and path to a node.
[INFO] [stdout] 35 + /// Once the algorithm was run successfully, the resulting [ShortestPathTree] can be used to receive the shortest distance and path to a node.
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: redundant explicit link target
[INFO] [stdout]    --> src/algorithms.rs:128:79
[INFO] [stdout]     |
[INFO] [stdout] 128 | ...essfully, the resulting [ShortestPathTree](../struct.ShortestPathTree.html) can be used to receive the shortest distance and pat...
[INFO] [stdout]     |                             ----------------  ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ explicit target is redundant
[INFO] [stdout]     |                             |
[INFO] [stdout]     |                             because label contains path that resolves to same destination
[INFO] [stdout]     |
[INFO] [stdout]     = note: when a link's destination is not specified,
[INFO] [stdout]             the label is used to resolve intra-doc links
[INFO] [stdout] help: remove explicit link target
[INFO] [stdout]     |
[INFO] [stdout] 128 - /// Once the algorithm was run successfully, the resulting [ShortestPathTree](../struct.ShortestPathTree.html) can be used to receive the shortest distance and path to a node.
[INFO] [stdout] 128 + /// Once the algorithm was run successfully, the resulting [ShortestPathTree] can be used to receive the shortest distance and path to a node.
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: redundant explicit link target
[INFO] [stdout]    --> src/lib.rs:165:33
[INFO] [stdout]     |
[INFO] [stdout] 165 |     /// path see [ShortestPath](struct.ShortestPath.html).
[INFO] [stdout]     |                   ------------  ^^^^^^^^^^^^^^^^^^^^^^^^ explicit target is redundant
[INFO] [stdout]     |                   |
[INFO] [stdout]     |                   because label contains path that resolves to same destination
[INFO] [stdout]     |
[INFO] [stdout]     = note: when a link's destination is not specified,
[INFO] [stdout]             the label is used to resolve intra-doc links
[INFO] [stdout] help: remove explicit link target
[INFO] [stdout]     |
[INFO] [stdout] 165 -     /// path see [ShortestPath](struct.ShortestPath.html).
[INFO] [stdout] 165 +     /// path see [ShortestPath].
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.49s
[INFO] [stderr]    Generated /opt/rustwide/target/doc/simple_graph_algorithms/index.html
[INFO] running `Command { std: "docker" "inspect" "493132ae62ce4080543141cd2ee13e07c8d98decd80051a24275d7b51d37df64", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "493132ae62ce4080543141cd2ee13e07c8d98decd80051a24275d7b51d37df64", kill_on_drop: false }`
[INFO] [stdout] 493132ae62ce4080543141cd2ee13e07c8d98decd80051a24275d7b51d37df64
