[INFO] cloning repository https://github.com/char16t/rust-recepies
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/char16t/rust-recepies" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fchar16t%2Frust-recepies", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fchar16t%2Frust-recepies'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 2b4dd655ff0acfaf2eaf44ed24e8a66c22479034
[INFO] testing char16t/rust-recepies against 1.98.0-beta.1 for beta-1.98-1
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fchar16t%2Frust-recepies" "/workspace/builds/worker-2-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-2-tc2/source'...
[INFO] [stderr] done.
[INFO] removed /workspace/builds/worker-2-tc2/source/.cargo/config.toml
[INFO] started tweaking git repo https://github.com/char16t/rust-recepies
[INFO] finished tweaking git repo https://github.com/char16t/rust-recepies
[INFO] tweaked toml for git repo https://github.com/char16t/rust-recepies written to /workspace/builds/worker-2-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/char16t/rust-recepies on toolchain 1.98.0-beta.1
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1.98.0-beta.1" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/char16t/rust-recepies 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" "+1.98.0-beta.1" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2-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:3d5ced03c013a94a2f102a4510f48a6e9184255caf5fd8244f58017bde7f5210" "sleep" "infinity", kill_on_drop: false }`
[INFO] [stdout] decb122ce4305ce105113e4b0e7e313b26d87bd6daba2d9f779c22b3ecab4cc3
[INFO] running `Command { std: "docker" "start" "decb122ce4305ce105113e4b0e7e313b26d87bd6daba2d9f779c22b3ecab4cc3", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "decb122ce4305ce105113e4b0e7e313b26d87bd6daba2d9f779c22b3ecab4cc3", 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" "decb122ce4305ce105113e4b0e7e313b26d87bd6daba2d9f779c22b3ecab4cc3" "/opt/rustwide/cargo-home/bin/cargo" "+1.98.0-beta.1" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "decb122ce4305ce105113e4b0e7e313b26d87bd6daba2d9f779c22b3ecab4cc3", 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=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-w" "/opt/rustwide/workdir" "--user" "0:0" "decb122ce4305ce105113e4b0e7e313b26d87bd6daba2d9f779c22b3ecab4cc3" "/opt/rustwide/cargo-home/bin/cargo" "+1.98.0-beta.1" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stderr]    Compiling char16t v0.1.1 (/opt/rustwide/workdir)
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/graphs.rs:49:21
[INFO] [stdout]    |
[INFO] [stdout] 49 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListGraphDfsIterator<T> {
[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] 49 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListGraphDfsIterator<'_, T> {
[INFO] [stdout]    |                                                                            +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/graphs.rs:52:21
[INFO] [stdout]    |
[INFO] [stdout] 52 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListGraphBfsIterator<T> {
[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] 52 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListGraphBfsIterator<'_, T> {
[INFO] [stdout]    |                                                                            +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/graphs.rs:519:21
[INFO] [stdout]     |
[INFO] [stdout] 519 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListWightedGraphDfsIterator<T, W> {
[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] 519 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListWightedGraphDfsIterator<'_, T, W> {
[INFO] [stdout]     |                                                                                   +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/graphs.rs:522:21
[INFO] [stdout]     |
[INFO] [stdout] 522 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListWightedGraphBfsIterator<T, W> {
[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] 522 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListWightedGraphBfsIterator<'_, T, W> {
[INFO] [stdout]     |                                                                                   +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/graphs.rs:525:25
[INFO] [stdout]     |
[INFO] [stdout] 525 |     pub fn iter_dfs_asc(&self, start_node: T) -> AdjacencyListWightedGraphAscDfsIterator<T, W> {
[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] 525 |     pub fn iter_dfs_asc(&self, start_node: T) -> AdjacencyListWightedGraphAscDfsIterator<'_, T, W> {
[INFO] [stdout]     |                                                                                          +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/graphs.rs:528:25
[INFO] [stdout]     |
[INFO] [stdout] 528 |     pub fn iter_bfs_asc(&self, start_node: T) -> AdjacencyListWightedGraphAscBfsIterator<T, W> {
[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] 528 |     pub fn iter_bfs_asc(&self, start_node: T) -> AdjacencyListWightedGraphAscBfsIterator<'_, T, W> {
[INFO] [stdout]     |                                                                                          +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/graphs.rs:531:26
[INFO] [stdout]     |
[INFO] [stdout] 531 |     pub fn iter_dfs_desc(&self, start_node: T) -> AdjacencyListWightedGraphDescDfsIterator<T, W> {
[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] 531 |     pub fn iter_dfs_desc(&self, start_node: T) -> AdjacencyListWightedGraphDescDfsIterator<'_, T, W> {
[INFO] [stdout]     |                                                                                            +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/graphs.rs:534:26
[INFO] [stdout]     |
[INFO] [stdout] 534 |     pub fn iter_bfs_desc(&self, start_node: T) -> AdjacencyListWightedGraphDescBfsIterator<T, W> {
[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] 534 |     pub fn iter_bfs_desc(&self, start_node: T) -> AdjacencyListWightedGraphDescBfsIterator<'_, T, W> {
[INFO] [stdout]     |                                                                                            +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/trees.rs:25:21
[INFO] [stdout]    |
[INFO] [stdout] 25 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListTreeDfsIterator<T> {
[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] 25 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListTreeDfsIterator<'_, T> {
[INFO] [stdout]    |                                                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/trees.rs:28:21
[INFO] [stdout]    |
[INFO] [stdout] 28 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListTreeBfsIterator<T> {
[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] 28 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListTreeBfsIterator<'_, T> {
[INFO] [stdout]    |                                                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/trees.rs:185:21
[INFO] [stdout]     |
[INFO] [stdout] 185 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListTreeDfsIterator<T> {
[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] 185 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListTreeDfsIterator<'_, T> {
[INFO] [stdout]     |                                                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/trees.rs:188:21
[INFO] [stdout]     |
[INFO] [stdout] 188 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListTreeBfsIterator<T> {
[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] 188 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListTreeBfsIterator<'_, T> {
[INFO] [stdout]     |                                                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/trees.rs:468:21
[INFO] [stdout]     |
[INFO] [stdout] 468 |     pub fn iter_dfs(&self, start_node: K) -> KeyValueTreeDfsIterator<K, V> {
[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] 468 |     pub fn iter_dfs(&self, start_node: K) -> KeyValueTreeDfsIterator<'_, K, V> {
[INFO] [stdout]     |                                                                      +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/trees.rs:471:21
[INFO] [stdout]     |
[INFO] [stdout] 471 |     pub fn iter_bfs(&self, start_node: K) -> KeyValueTreeBfsIterator<K, V> {
[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] 471 |     pub fn iter_bfs(&self, start_node: K) -> KeyValueTreeBfsIterator<'_, K, V> {
[INFO] [stdout]     |                                                                      +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/trees.rs:688:21
[INFO] [stdout]     |
[INFO] [stdout] 688 |     pub fn dfs_iter(&self) -> DfsIterator<T> {
[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] 688 |     pub fn dfs_iter(&self) -> DfsIterator<'_, T> {
[INFO] [stdout]     |                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/trees.rs:691:21
[INFO] [stdout]     |
[INFO] [stdout] 691 |     pub fn bfs_iter(&self) -> BfsIterator<T> {
[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] 691 |     pub fn bfs_iter(&self) -> BfsIterator<'_, T> {
[INFO] [stdout]     |                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 2.11s
[INFO] running `Command { std: "docker" "inspect" "decb122ce4305ce105113e4b0e7e313b26d87bd6daba2d9f779c22b3ecab4cc3", 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=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-w" "/opt/rustwide/workdir" "--user" "0:0" "decb122ce4305ce105113e4b0e7e313b26d87bd6daba2d9f779c22b3ecab4cc3" "/opt/rustwide/cargo-home/bin/cargo" "+1.98.0-beta.1" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/graphs.rs:49:21
[INFO] [stdout]    |
[INFO] [stdout] 49 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListGraphDfsIterator<T> {
[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] 49 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListGraphDfsIterator<'_, T> {
[INFO] [stdout]    |                                                                            +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/graphs.rs:52:21
[INFO] [stdout]    |
[INFO] [stdout] 52 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListGraphBfsIterator<T> {
[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] 52 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListGraphBfsIterator<'_, T> {
[INFO] [stdout]    |                                                                            +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/graphs.rs:519:21
[INFO] [stdout]     |
[INFO] [stdout] 519 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListWightedGraphDfsIterator<T, W> {
[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] 519 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListWightedGraphDfsIterator<'_, T, W> {
[INFO] [stdout]     |                                                                                   +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/graphs.rs:522:21
[INFO] [stdout]     |
[INFO] [stdout] 522 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListWightedGraphBfsIterator<T, W> {
[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] 522 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListWightedGraphBfsIterator<'_, T, W> {
[INFO] [stdout]     |                                                                                   +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/graphs.rs:525:25
[INFO] [stdout]     |
[INFO] [stdout] 525 |     pub fn iter_dfs_asc(&self, start_node: T) -> AdjacencyListWightedGraphAscDfsIterator<T, W> {
[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] 525 |     pub fn iter_dfs_asc(&self, start_node: T) -> AdjacencyListWightedGraphAscDfsIterator<'_, T, W> {
[INFO] [stdout]     |                                                                                          +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/graphs.rs:528:25
[INFO] [stdout]     |
[INFO] [stdout] 528 |     pub fn iter_bfs_asc(&self, start_node: T) -> AdjacencyListWightedGraphAscBfsIterator<T, W> {
[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] 528 |     pub fn iter_bfs_asc(&self, start_node: T) -> AdjacencyListWightedGraphAscBfsIterator<'_, T, W> {
[INFO] [stdout]     |                                                                                          +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/graphs.rs:531:26
[INFO] [stdout]     |
[INFO] [stdout] 531 |     pub fn iter_dfs_desc(&self, start_node: T) -> AdjacencyListWightedGraphDescDfsIterator<T, W> {
[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] 531 |     pub fn iter_dfs_desc(&self, start_node: T) -> AdjacencyListWightedGraphDescDfsIterator<'_, T, W> {
[INFO] [stdout]     |                                                                                            +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/graphs.rs:534:26
[INFO] [stdout]     |
[INFO] [stdout] 534 |     pub fn iter_bfs_desc(&self, start_node: T) -> AdjacencyListWightedGraphDescBfsIterator<T, W> {
[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] 534 |     pub fn iter_bfs_desc(&self, start_node: T) -> AdjacencyListWightedGraphDescBfsIterator<'_, T, W> {
[INFO] [stdout]     |                                                                                            +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/trees.rs:25:21
[INFO] [stdout]    |
[INFO] [stdout] 25 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListTreeDfsIterator<T> {
[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] 25 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListTreeDfsIterator<'_, T> {
[INFO] [stdout]    |                                                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/trees.rs:28:21
[INFO] [stdout]    |
[INFO] [stdout] 28 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListTreeBfsIterator<T> {
[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] 28 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListTreeBfsIterator<'_, T> {
[INFO] [stdout]    |                                                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/trees.rs:185:21
[INFO] [stdout]     |
[INFO] [stdout] 185 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListTreeDfsIterator<T> {
[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] 185 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListTreeDfsIterator<'_, T> {
[INFO] [stdout]     |                                                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/trees.rs:188:21
[INFO] [stdout]     |
[INFO] [stdout] 188 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListTreeBfsIterator<T> {
[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] 188 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListTreeBfsIterator<'_, T> {
[INFO] [stdout]     |                                                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/trees.rs:468:21
[INFO] [stdout]     |
[INFO] [stdout] 468 |     pub fn iter_dfs(&self, start_node: K) -> KeyValueTreeDfsIterator<K, V> {
[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] 468 |     pub fn iter_dfs(&self, start_node: K) -> KeyValueTreeDfsIterator<'_, K, V> {
[INFO] [stdout]     |                                                                      +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/trees.rs:471:21
[INFO] [stdout]     |
[INFO] [stdout] 471 |     pub fn iter_bfs(&self, start_node: K) -> KeyValueTreeBfsIterator<K, V> {
[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] 471 |     pub fn iter_bfs(&self, start_node: K) -> KeyValueTreeBfsIterator<'_, K, V> {
[INFO] [stdout]     |                                                                      +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/trees.rs:688:21
[INFO] [stdout]     |
[INFO] [stdout] 688 |     pub fn dfs_iter(&self) -> DfsIterator<T> {
[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] 688 |     pub fn dfs_iter(&self) -> DfsIterator<'_, T> {
[INFO] [stdout]     |                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/trees.rs:691:21
[INFO] [stdout]     |
[INFO] [stdout] 691 |     pub fn bfs_iter(&self) -> BfsIterator<T> {
[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] 691 |     pub fn bfs_iter(&self) -> BfsIterator<'_, T> {
[INFO] [stdout]     |                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling char16t v0.1.1 (/opt/rustwide/workdir)
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/graphs.rs:49:21
[INFO] [stdout]    |
[INFO] [stdout] 49 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListGraphDfsIterator<T> {
[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] 49 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListGraphDfsIterator<'_, T> {
[INFO] [stdout]    |                                                                            +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/graphs.rs:52:21
[INFO] [stdout]    |
[INFO] [stdout] 52 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListGraphBfsIterator<T> {
[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] 52 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListGraphBfsIterator<'_, T> {
[INFO] [stdout]    |                                                                            +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/graphs.rs:519:21
[INFO] [stdout]     |
[INFO] [stdout] 519 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListWightedGraphDfsIterator<T, W> {
[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] 519 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListWightedGraphDfsIterator<'_, T, W> {
[INFO] [stdout]     |                                                                                   +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/graphs.rs:522:21
[INFO] [stdout]     |
[INFO] [stdout] 522 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListWightedGraphBfsIterator<T, W> {
[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] 522 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListWightedGraphBfsIterator<'_, T, W> {
[INFO] [stdout]     |                                                                                   +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/graphs.rs:525:25
[INFO] [stdout]     |
[INFO] [stdout] 525 |     pub fn iter_dfs_asc(&self, start_node: T) -> AdjacencyListWightedGraphAscDfsIterator<T, W> {
[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] 525 |     pub fn iter_dfs_asc(&self, start_node: T) -> AdjacencyListWightedGraphAscDfsIterator<'_, T, W> {
[INFO] [stdout]     |                                                                                          +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/graphs.rs:528:25
[INFO] [stdout]     |
[INFO] [stdout] 528 |     pub fn iter_bfs_asc(&self, start_node: T) -> AdjacencyListWightedGraphAscBfsIterator<T, W> {
[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] 528 |     pub fn iter_bfs_asc(&self, start_node: T) -> AdjacencyListWightedGraphAscBfsIterator<'_, T, W> {
[INFO] [stdout]     |                                                                                          +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/graphs.rs:531:26
[INFO] [stdout]     |
[INFO] [stdout] 531 |     pub fn iter_dfs_desc(&self, start_node: T) -> AdjacencyListWightedGraphDescDfsIterator<T, W> {
[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] 531 |     pub fn iter_dfs_desc(&self, start_node: T) -> AdjacencyListWightedGraphDescDfsIterator<'_, T, W> {
[INFO] [stdout]     |                                                                                            +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/graphs.rs:534:26
[INFO] [stdout]     |
[INFO] [stdout] 534 |     pub fn iter_bfs_desc(&self, start_node: T) -> AdjacencyListWightedGraphDescBfsIterator<T, W> {
[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] 534 |     pub fn iter_bfs_desc(&self, start_node: T) -> AdjacencyListWightedGraphDescBfsIterator<'_, T, W> {
[INFO] [stdout]     |                                                                                            +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/trees.rs:25:21
[INFO] [stdout]    |
[INFO] [stdout] 25 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListTreeDfsIterator<T> {
[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] 25 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListTreeDfsIterator<'_, T> {
[INFO] [stdout]    |                                                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]   --> src/trees.rs:28:21
[INFO] [stdout]    |
[INFO] [stdout] 28 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListTreeBfsIterator<T> {
[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] 28 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListTreeBfsIterator<'_, T> {
[INFO] [stdout]    |                                                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/trees.rs:185:21
[INFO] [stdout]     |
[INFO] [stdout] 185 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListTreeDfsIterator<T> {
[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] 185 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListTreeDfsIterator<'_, T> {
[INFO] [stdout]     |                                                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/trees.rs:188:21
[INFO] [stdout]     |
[INFO] [stdout] 188 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListTreeBfsIterator<T> {
[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] 188 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListTreeBfsIterator<'_, T> {
[INFO] [stdout]     |                                                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/trees.rs:468:21
[INFO] [stdout]     |
[INFO] [stdout] 468 |     pub fn iter_dfs(&self, start_node: K) -> KeyValueTreeDfsIterator<K, V> {
[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] 468 |     pub fn iter_dfs(&self, start_node: K) -> KeyValueTreeDfsIterator<'_, K, V> {
[INFO] [stdout]     |                                                                      +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/trees.rs:471:21
[INFO] [stdout]     |
[INFO] [stdout] 471 |     pub fn iter_bfs(&self, start_node: K) -> KeyValueTreeBfsIterator<K, V> {
[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] 471 |     pub fn iter_bfs(&self, start_node: K) -> KeyValueTreeBfsIterator<'_, K, V> {
[INFO] [stdout]     |                                                                      +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/trees.rs:688:21
[INFO] [stdout]     |
[INFO] [stdout] 688 |     pub fn dfs_iter(&self) -> DfsIterator<T> {
[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] 688 |     pub fn dfs_iter(&self) -> DfsIterator<'_, T> {
[INFO] [stdout]     |                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/trees.rs:691:21
[INFO] [stdout]     |
[INFO] [stdout] 691 |     pub fn bfs_iter(&self) -> BfsIterator<T> {
[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] 691 |     pub fn bfs_iter(&self) -> BfsIterator<'_, T> {
[INFO] [stdout]     |                                           +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 7.02s
[INFO] running `Command { std: "docker" "inspect" "decb122ce4305ce105113e4b0e7e313b26d87bd6daba2d9f779c22b3ecab4cc3", 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=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-w" "/opt/rustwide/workdir" "--user" "0:0" "decb122ce4305ce105113e4b0e7e313b26d87bd6daba2d9f779c22b3ecab4cc3" "/opt/rustwide/cargo-home/bin/cargo" "+1.98.0-beta.1" "test" "--frozen", kill_on_drop: false }`
[INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stderr]   --> src/graphs.rs:49:21
[INFO] [stderr]    |
[INFO] [stderr] 49 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListGraphDfsIterator<T> {
[INFO] [stderr]    |                     ^^^^^                    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stderr]    |                     |
[INFO] [stderr]    |                     the lifetime is elided 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: use `'_` for type paths
[INFO] [stderr]    |
[INFO] [stderr] 49 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListGraphDfsIterator<'_, T> {
[INFO] [stderr]    |                                                                            +++
[INFO] [stderr] 
[INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stderr]   --> src/graphs.rs:52:21
[INFO] [stderr]    |
[INFO] [stderr] 52 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListGraphBfsIterator<T> {
[INFO] [stderr]    |                     ^^^^^                    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stderr]    |                     |
[INFO] [stderr]    |                     the lifetime is elided here
[INFO] [stderr]    |
[INFO] [stderr]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stderr] help: use `'_` for type paths
[INFO] [stderr]    |
[INFO] [stderr] 52 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListGraphBfsIterator<'_, T> {
[INFO] [stderr]    |                                                                            +++
[INFO] [stderr] 
[INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stderr]    --> src/graphs.rs:519:21
[INFO] [stderr]     |
[INFO] [stderr] 519 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListWightedGraphDfsIterator<T, W> {
[INFO] [stderr]     |                     ^^^^^                    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stderr]     |                     |
[INFO] [stderr]     |                     the lifetime is elided here
[INFO] [stderr]     |
[INFO] [stderr]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stderr] help: use `'_` for type paths
[INFO] [stderr]     |
[INFO] [stderr] 519 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListWightedGraphDfsIterator<'_, T, W> {
[INFO] [stderr]     |                                                                                   +++
[INFO] [stderr] 
[INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stderr]    --> src/graphs.rs:522:21
[INFO] [stderr]     |
[INFO] [stderr] 522 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListWightedGraphBfsIterator<T, W> {
[INFO] [stderr]     |                     ^^^^^                    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stderr]     |                     |
[INFO] [stderr]     |                     the lifetime is elided here
[INFO] [stderr]     |
[INFO] [stderr]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stderr] help: use `'_` for type paths
[INFO] [stderr]     |
[INFO] [stderr] 522 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListWightedGraphBfsIterator<'_, T, W> {
[INFO] [stderr]     |                                                                                   +++
[INFO] [stderr] 
[INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stderr]    --> src/graphs.rs:525:25
[INFO] [stderr]     |
[INFO] [stderr] 525 |     pub fn iter_dfs_asc(&self, start_node: T) -> AdjacencyListWightedGraphAscDfsIterator<T, W> {
[INFO] [stderr]     |                         ^^^^^                    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stderr]     |                         |
[INFO] [stderr]     |                         the lifetime is elided here
[INFO] [stderr]     |
[INFO] [stderr]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stderr] help: use `'_` for type paths
[INFO] [stderr]     |
[INFO] [stderr] 525 |     pub fn iter_dfs_asc(&self, start_node: T) -> AdjacencyListWightedGraphAscDfsIterator<'_, T, W> {
[INFO] [stderr]     |                                                                                          +++
[INFO] [stderr] 
[INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stderr]    --> src/graphs.rs:528:25
[INFO] [stderr]     |
[INFO] [stderr] 528 |     pub fn iter_bfs_asc(&self, start_node: T) -> AdjacencyListWightedGraphAscBfsIterator<T, W> {
[INFO] [stderr]     |                         ^^^^^                    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stderr]     |                         |
[INFO] [stderr]     |                         the lifetime is elided here
[INFO] [stderr]     |
[INFO] [stderr]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stderr] help: use `'_` for type paths
[INFO] [stderr]     |
[INFO] [stderr] 528 |     pub fn iter_bfs_asc(&self, start_node: T) -> AdjacencyListWightedGraphAscBfsIterator<'_, T, W> {
[INFO] [stderr]     |                                                                                          +++
[INFO] [stderr] 
[INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stderr]    --> src/graphs.rs:531:26
[INFO] [stderr]     |
[INFO] [stderr] 531 |     pub fn iter_dfs_desc(&self, start_node: T) -> AdjacencyListWightedGraphDescDfsIterator<T, W> {
[INFO] [stderr]     |                          ^^^^^                    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stderr]     |                          |
[INFO] [stderr]     |                          the lifetime is elided here
[INFO] [stderr]     |
[INFO] [stderr]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stderr] help: use `'_` for type paths
[INFO] [stderr]     |
[INFO] [stderr] 531 |     pub fn iter_dfs_desc(&self, start_node: T) -> AdjacencyListWightedGraphDescDfsIterator<'_, T, W> {
[INFO] [stderr]     |                                                                                            +++
[INFO] [stderr] 
[INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stderr]    --> src/graphs.rs:534:26
[INFO] [stderr]     |
[INFO] [stderr] 534 |     pub fn iter_bfs_desc(&self, start_node: T) -> AdjacencyListWightedGraphDescBfsIterator<T, W> {
[INFO] [stderr]     |                          ^^^^^                    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stderr]     |                          |
[INFO] [stderr]     |                          the lifetime is elided here
[INFO] [stderr]     |
[INFO] [stderr]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stderr] help: use `'_` for type paths
[INFO] [stderr]     |
[INFO] [stderr] 534 |     pub fn iter_bfs_desc(&self, start_node: T) -> AdjacencyListWightedGraphDescBfsIterator<'_, T, W> {
[INFO] [stderr]     |                                                                                            +++
[INFO] [stderr] 
[INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stderr]   --> src/trees.rs:25:21
[INFO] [stderr]    |
[INFO] [stderr] 25 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListTreeDfsIterator<T> {
[INFO] [stderr]    |                     ^^^^^                    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stderr]    |                     |
[INFO] [stderr]    |                     the lifetime is elided here
[INFO] [stderr]    |
[INFO] [stderr]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stderr] help: use `'_` for type paths
[INFO] [stderr]    |
[INFO] [stderr] 25 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListTreeDfsIterator<'_, T> {
[INFO] [stderr]    |                                                                           +++
[INFO] [stderr] 
[INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stderr]   --> src/trees.rs:28:21
[INFO] [stderr]    |
[INFO] [stderr] 28 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListTreeBfsIterator<T> {
[INFO] [stderr]    |                     ^^^^^                    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stderr]    |                     |
[INFO] [stderr]    |                     the lifetime is elided here
[INFO] [stderr]    |
[INFO] [stderr]    = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stderr] help: use `'_` for type paths
[INFO] [stderr]    |
[INFO] [stderr] 28 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListTreeBfsIterator<'_, T> {
[INFO] [stderr]    |                                                                           +++
[INFO] [stderr] 
[INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stderr]    --> src/trees.rs:185:21
[INFO] [stderr]     |
[INFO] [stderr] 185 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListTreeDfsIterator<T> {
[INFO] [stderr]     |                     ^^^^^                    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stderr]     |                     |
[INFO] [stderr]     |                     the lifetime is elided here
[INFO] [stderr]     |
[INFO] [stderr]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stderr] help: use `'_` for type paths
[INFO] [stderr]     |
[INFO] [stderr] 185 |     pub fn iter_dfs(&self, start_node: T) -> AdjacencyListTreeDfsIterator<'_, T> {
[INFO] [stderr]     |                                                                           +++
[INFO] [stderr] 
[INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stderr]    --> src/trees.rs:188:21
[INFO] [stderr]     |
[INFO] [stderr] 188 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListTreeBfsIterator<T> {
[INFO] [stderr]     |                     ^^^^^                    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stderr]     |                     |
[INFO] [stderr]     |                     the lifetime is elided here
[INFO] [stderr]     |
[INFO] [stderr]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stderr] help: use `'_` for type paths
[INFO] [stderr]     |
[INFO] [stderr] 188 |     pub fn iter_bfs(&self, start_node: T) -> AdjacencyListTreeBfsIterator<'_, T> {
[INFO] [stderr]     |                                                                           +++
[INFO] [stderr] 
[INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stderr]    --> src/trees.rs:468:21
[INFO] [stderr]     |
[INFO] [stderr] 468 |     pub fn iter_dfs(&self, start_node: K) -> KeyValueTreeDfsIterator<K, V> {
[INFO] [stderr]     |                     ^^^^^                    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stderr]     |                     |
[INFO] [stderr]     |                     the lifetime is elided here
[INFO] [stderr]     |
[INFO] [stderr]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stderr] help: use `'_` for type paths
[INFO] [stderr]     |
[INFO] [stderr] 468 |     pub fn iter_dfs(&self, start_node: K) -> KeyValueTreeDfsIterator<'_, K, V> {
[INFO] [stderr]     |                                                                      +++
[INFO] [stderr] 
[INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stderr]    --> src/trees.rs:471:21
[INFO] [stderr]     |
[INFO] [stderr] 471 |     pub fn iter_bfs(&self, start_node: K) -> KeyValueTreeBfsIterator<K, V> {
[INFO] [stderr]     |                     ^^^^^                    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stderr]     |                     |
[INFO] [stderr]     |                     the lifetime is elided here
[INFO] [stderr]     |
[INFO] [stderr]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stderr] help: use `'_` for type paths
[INFO] [stderr]     |
[INFO] [stderr] 471 |     pub fn iter_bfs(&self, start_node: K) -> KeyValueTreeBfsIterator<'_, K, V> {
[INFO] [stderr]     |                                                                      +++
[INFO] [stderr] 
[INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stderr]    --> src/trees.rs:688:21
[INFO] [stderr]     |
[INFO] [stderr] 688 |     pub fn dfs_iter(&self) -> DfsIterator<T> {
[INFO] [stderr]     |                     ^^^^^     ^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stderr]     |                     |
[INFO] [stderr]     |                     the lifetime is elided here
[INFO] [stderr]     |
[INFO] [stderr]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stderr] help: use `'_` for type paths
[INFO] [stderr]     |
[INFO] [stderr] 688 |     pub fn dfs_iter(&self) -> DfsIterator<'_, T> {
[INFO] [stderr]     |                                           +++
[INFO] [stderr] 
[INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stderr]    --> src/trees.rs:691:21
[INFO] [stderr]     |
[INFO] [stderr] 691 |     pub fn bfs_iter(&self) -> BfsIterator<T> {
[INFO] [stderr]     |                     ^^^^^     ^^^^^^^^^^^^^^ the same lifetime is hidden here
[INFO] [stderr]     |                     |
[INFO] [stderr]     |                     the lifetime is elided here
[INFO] [stderr]     |
[INFO] [stderr]     = help: the same lifetime is referred to in inconsistent ways, making the signature confusing
[INFO] [stderr] help: use `'_` for type paths
[INFO] [stderr]     |
[INFO] [stderr] 691 |     pub fn bfs_iter(&self) -> BfsIterator<'_, T> {
[INFO] [stderr]     |                                           +++
[INFO] [stderr] 
[INFO] [stderr] warning: `char16t` (lib) generated 16 warnings (run `cargo fix --lib -p char16t` to apply 16 suggestions)
[INFO] [stderr] warning: `char16t` (lib test) generated 16 warnings (16 duplicates)
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.02s
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/char16t-07f6be33ed580788)
[INFO] [stdout] 
[INFO] [stdout] running 268 tests
[INFO] [stdout] test bits::tests::test_count_set_bits ... ok
[INFO] [stdout] test bits::tests::test_is_bit_set_in_matrix ... ok
[INFO] [stdout] test bits::tests::test_is_bit_set ... ok
[INFO] [stdout] test benchmark::tests::test_time ... ok
[INFO] [stdout] test bits::tests::test_is_power_of_two ... ok
[INFO] [stdout] test bits::tests::test_long_arithmetic_debug ... ok
[INFO] [stdout] test bits::tests::test_long_arithmetic_set_bit ... ok
[INFO] [stdout] test bits::tests::test_long_arithmetic_toggle_bit ... ok
[INFO] [stdout] test bits::tests::test_long_arithmetic_unset_bit ... ok
[INFO] [stdout] test bits::tests::test_long_arithmetic_with_capacity ... ok
[INFO] [stdout] test bits::tests::test_sets_difference ... ok
[INFO] [stdout] test bits::tests::test_set_bit ... ok
[INFO] [stdout] test bits::tests::test_sets_intersection ... ok
[INFO] [stdout] test bits::tests::test_sets_is_subset ... ok
[INFO] [stdout] test bits::tests::test_sets_is_superset ... ok
[INFO] [stdout] test bits::tests::test_sets_symetric_difference ... ok
[INFO] [stdout] test bits::tests::test_sets_union ... ok
[INFO] [stdout] test bits::tests::test_toggle_bit ... ok
[INFO] [stdout] test bits::tests::test_toggle_bit_in_matrix ... ok
[INFO] [stdout] test bits::tests::test_unset_bit ... ok
[INFO] [stdout] test combinatorics::tests::test_binomial_coefficient ... ok
[INFO] [stdout] test combinatorics::tests::test_burnsides_lemma ... ok
[INFO] [stdout] test combinatorics::tests::test_catalan_number ... ok
[INFO] [stdout] test combinatorics::tests::test_combinations ... ok
[INFO] [stdout] test combinatorics::tests::test_combinations_with_repetitions ... ok
[INFO] [stdout] test combinatorics::tests::test_count_combinations ... ok
[INFO] [stdout] test bits::tests::test_unset_bit_in_matrix ... ok
[INFO] [stdout] test combinatorics::tests::test_count_derangements ... ok
[INFO] [stdout] test combinatorics::tests::test_count_combinations_with_repetitions ... ok
[INFO] [stdout] test combinatorics::tests::test_count_permutations_with_repetitions ... ok
[INFO] [stdout] test combinatorics::tests::test_count_permutations ... ok
[INFO] [stdout] test combinatorics::tests::test_count_placements_with_repetitions ... ok
[INFO] [stdout] test combinatorics::tests::test_multinomial_coefficient ... ok
[INFO] [stdout] test combinatorics::tests::test_factorial_i128 ... ok
[INFO] [stdout] test combinatorics::tests::test_permutations ... ok
[INFO] [stdout] test combinatorics::tests::test_count_placements ... ok
[INFO] [stdout] test combinatorics::tests::test_inclusion_exclusion ... ok
[INFO] [stdout] test combinatorics::tests::test_factorial_usize ... ok
[INFO] [stdout] test combinatorics::tests::test_placements_with_repetitions ... ok
[INFO] [stdout] test combinatorics::tests::test_permutations_with_repetitions ... ok
[INFO] [stdout] test combinatorics::tests::test_placements ... ok
[INFO] [stdout] test bits::tests::test_set_bit_in_matrix ... ok
[INFO] [stdout] test concurrency::tests::test_thread_pool_creation ... ok
[INFO] [stdout] test coordinates::tests::test_create_coordinate_function_2d ... ok
[INFO] [stdout] test concurrency::tests::test_multiple_job_execution ... ok
[INFO] [stdout] test coordinates::tests::test_create_coordinate_function_3d ... ok
[INFO] [stdout] test coordinates::tests::test_create_coordinate_function_4d ... ok
[INFO] [stdout] test fourier::tests::test_fast_fourier_transform ... ok
[INFO] [stdout] test concurrency::tests::test_thread_pool_shutdown ... ok
[INFO] [stdout] test games::tests::test_grundy_game_integration ... ok
[INFO] [stdout] test concurrency::tests::test_worker_1_thread ... ok
[INFO] [stdout] test fourier::tests::test_signal_handle ... ok
[INFO] [stdout] test games::tests::test_grundy_number ... ok
[INFO] [stdout] test games::tests::test_is_losing_state ... ok
[INFO] [stdout] test games::tests::test_is_nim_game_over ... ok
[INFO] [stdout] test games::tests::test_is_winning_state ... ok
[INFO] [stdout] test games::tests::test_mex ... ok
[INFO] [stdout] test games::tests::test_misere_nim_move ... ok
[INFO] [stdout] test games::tests::test_nim_integration ... ok
[INFO] [stdout] test games::tests::test_nim_move ... ok
[INFO] [stdout] test games::tests::test_nim_sum ... ok
[INFO] [stdout] test games::tests::test_misere_nim_integration ... ok
[INFO] [stdout] test geometry::tests::test_add ... ok
[INFO] [stdout] test geometry::tests::test_add_assign ... ok
[INFO] [stdout] test geometry::tests::test_conj ... ok
[INFO] [stdout] test geometry::tests::test_cos ... ok
[INFO] [stdout] test fourier::tests::test_multiply_polynomials ... ok
[INFO] [stdout] test games::tests::test_grundy_game_move ... ok
[INFO] [stdout] test geometry::tests::test_display ... ok
[INFO] [stdout] test geometry::tests::test_distance_from_point_to_line ... ok
[INFO] [stdout] test geometry::tests::test_cross_product ... ok
[INFO] [stdout] test geometry::tests::test_debug ... ok
[INFO] [stdout] test geometry::tests::test_exp ... ok
[INFO] [stdout] test geometry::tests::test_mul ... ok
[INFO] [stdout] test geometry::tests::test_mul_assign ... ok
[INFO] [stdout] test geometry::tests::test_point_position_relative_line ... ok
[INFO] [stdout] test geometry::tests::test_neg ... ok
[INFO] [stdout] test geometry::tests::test_polar ... ok
[INFO] [stdout] test geometry::tests::test_re_im ... ok
[INFO] [stdout] test geometry::tests::test_sin ... ok
[INFO] [stdout] test geometry::tests::test_sub ... ok
[INFO] [stdout] test geometry::tests::test_sub_assign ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_directed_graph ... ok
[INFO] [stdout] test geometry::tests::test_div ... ok
[INFO] [stdout] test geometry::tests::test_div_assign ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_graph_bfs_iterator ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_graph_dfs_iterator ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_graph_bfs_iterator_2 ... ok
[INFO] [stdout] test games::tests::test_is_grundy_game_over ... ok
[INFO] [stdout] test graphs::tests::test_2sat ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_graph_directed_eulerian_path_for_connected_graphs ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_graph_directed_has_cycle ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_graph_dfs_iterator_2 ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_graph_edge_disjoint_paths ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_graph_is_connected ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_graph_topological_sort_directed_1 ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_graph_node_disjoint_paths ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_graph_topological_sort_directed_2 ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_graph_directed_strongly_connected_components ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_graph_undirected_eulerian_path_for_connected_graphs ... ok
[INFO] [stdout] test concurrency::tests::test_invalid_thread_pool_creation - should panic ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_graph_topological_sort_undirected ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_undirected_graph ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighed_directed_graph ... ok
[INFO] [stdout] test games::tests::test_grundy_game_move_panic - should panic ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighed_undirected_graph ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_asc_bfs_iterator ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_asc_bfs_iterator_2 ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_bfs_iterator ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_desc_bfs_iterator ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_bfs_iterator_2 ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_desc_bfs_iterator_2 ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_asc_dfs_iterator ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_asc_dfs_iterator_2 ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_graph_edge_disjoint_paths_panic - should panic ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_desc_dfs_iterator ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_dfs_iterator ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_desc_dfs_iterator_2 ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_graph_node_disjoint_paths_panic - should panic ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_dijkstra ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_directed_eulerian_path_for_connected_graphs ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_directed_has_cycle ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_graph_undirected_has_cycle - should panic ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_dfs_iterator_2 ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_directed_strongly_connected_components ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_graph_undirected_strongly_connected_components - should panic ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_edge_disjoint_paths ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_edge_disjoint_paths_panic - should panic ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_max_flow ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_minimum_cut ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_is_connected ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_node_disjoint_paths ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_topological_sort_directed_2 ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_topological_sort_directed_1 ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_max_flow_panic - should panic ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_wighted_graph_directed_maximum_spanning_tree_kruskal ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_topological_sort_undirected ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_minimum_cut_panic - should panic ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_wighted_graph_directed_minimum_spanning_tree_kruskal ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_node_disjoint_paths_panic - should panic ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_matrix_directed_graph ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_wighted_graph_undirected_minimum_spanning_tree_kruskal ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_matrix_undirected_graph ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_matrix_weighed_directed_graph ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_wighted_graph_undirected_maximum_spanning_tree_kruskal ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_undirected_eulerian_path_for_connected_graphs ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_undirected_has_cycle - should panic ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_list_weighted_graph_undirected_strongly_connected_components - should panic ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_matrix_weighed_directed_graph_floyd_warshall ... ok
[INFO] [stdout] test graphs::tests::test_adjacency_matrix_weighed_undirected_graph ... ok
[INFO] [stdout] test graphs::tests::test_edge_list_directed_graph ... ok
[INFO] [stdout] test graphs::tests::test_edge_list_weighted_directed_graph_bellman_ford ... ok
[INFO] [stdout] test graphs::tests::test_edge_list_weighted_directed_graph ... ok
[INFO] [stdout] test graphs::tests::test_edge_list_weighted_directed_graph_bellman_ford_negative_cycle - should panic ... ok
[INFO] [stdout] test graphs::tests::test_edge_list_weighted_undirected_graph ... ok
[INFO] [stdout] test graphs::tests::test_successor_graph_enumerated ... ok
[INFO] [stdout] test graphs::tests::test_successor_graph_enumerated_2 ... ok
[INFO] [stdout] test graphs::tests::test_successor_graph ... ok
[INFO] [stdout] test heaps::tests::test_max_binary_heap ... ok
[INFO] [stdout] test heaps::tests::test_max_binary_heap_2 ... ok
[INFO] [stdout] test heaps::tests::test_min_binary_heap ... ok
[INFO] [stdout] test heaps::tests::test_min_binary_heap_2 ... ok
[INFO] [stdout] test input::tests::bench_take_num ... ok
[INFO] [stdout] test input::tests::test_take_2nums ... ok
[INFO] [stdout] test input::tests::test_take_3nums ... ok
[INFO] [stdout] test input::tests::test_take_4nums ... ok
[INFO] [stdout] test input::tests::test_take_num ... ok
[INFO] [stdout] test input::tests::test_take_string ... ok
[INFO] [stdout] test input::tests::test_take_vector ... ok
[INFO] [stdout] test matrices::tests::test_create_vector ... ok
[INFO] [stdout] test matrices::tests::test_fib ... ok
[INFO] [stdout] test matrices::tests::test_gaussian_elimination ... ok
[INFO] [stdout] test matrices::tests::test_linear_recurrent_sequence ... ok
[INFO] [stdout] test matrices::tests::test_matrix_add ... ok
[INFO] [stdout] test matrices::tests::test_create_matrix ... ok
[INFO] [stdout] test matrices::tests::test_matrix_add_panic - should panic ... ok
[INFO] [stdout] test matrices::tests::test_matrix_diag ... ok
[INFO] [stdout] test matrices::tests::test_matrix_data_access ... ok
[INFO] [stdout] test matrices::tests::test_matrix_display ... ok
[INFO] [stdout] test matrices::tests::test_matrix_mul ... ok
[INFO] [stdout] test matrices::tests::test_matrix_mul_scalar ... ok
[INFO] [stdout] test matrices::tests::test_matrix_pow ... ok
[INFO] [stdout] test matrices::tests::test_matrix_sub ... ok
[INFO] [stdout] test matrices::tests::test_matrix_transpose ... ok
[INFO] [stdout] test matrices::tests::test_number_of_paths_with_n_egdes ... ok
[INFO] [stdout] test matrices::tests::test_shortest_path_with_n_eges ... ok
[INFO] [stdout] test matrices::tests::test_matrix_pow_zero - should panic ... ok
[INFO] [stdout] test numbers::tests::test_approx_equal ... ok
[INFO] [stdout] test matrices::tests::test_matrix_sub_panic - should panic ... ok
[INFO] [stdout] test matrices::tests::test_matrix_pow_non_square - should panic ... ok
[INFO] [stdout] test numbers::tests::test_diophantine_equation ... ok
[INFO] [stdout] test numbers::tests::test_chinese_remainder_theorem ... ok
[INFO] [stdout] test numbers::tests::test_fib ... ok
[INFO] [stdout] test numbers::tests::test_euler_totient ... ok
[INFO] [stdout] test numbers::tests::test_gcd ... ok
[INFO] [stdout] test matrices::tests::test_matrix_mul_panic - should panic ... ok
[INFO] [stdout] test numbers::tests::test_gcd_extended ... ok
[INFO] [stdout] test numbers::tests::test_is_prime ... ok
[INFO] [stdout] test numbers::tests::test_modinverse ... ok
[INFO] [stdout] test numbers::tests::test_lcm ... ok
[INFO] [stdout] test numbers::tests::test_modpow ... ok
[INFO] [stdout] test numbers::tests::test_pow ... ok
[INFO] [stdout] test numbers::tests::test_prime_factors ... ok
[INFO] [stdout] test numbers::tests::test_sieve_of_eratosthenes ... ok
[INFO] [stdout] test probability::tests::test_discrete_random_variable_expected_value ... ok
[INFO] [stdout] test probability::tests::test_markov_chain ... ok
[INFO] [stdout] test random::tests::test_xoshiro256_dieharder ... ok
[INFO] [stdout] test random::tests::test_xoshiro256_rand ... ok
[INFO] [stdout] test random::tests::test_xoshiro256_rand_float ... ok
[INFO] [stdout] test random::tests::test_xoshiro256_rand_range ... ok
[INFO] [stdout] test random::tests::test_xoshiro256_shuffle ... ok
[INFO] [stdout] test ranges::tests::test_build_prefix_sum_array ... ok
[INFO] [stdout] test ranges::tests::test_build_prefix_sum_array_2d ... ok
[INFO] [stdout] test ranges::tests::test_build_prefix_sum_array_3d ... ok
[INFO] [stdout] test ranges::tests::test_build_sparse_table ... ok
[INFO] [stdout] test ranges::tests::test_difference_array ... ok
[INFO] [stdout] test ranges::tests::test_fenwick_tree ... ok
[INFO] [stdout] test ranges::tests::test_range_min ... ok
[INFO] [stdout] test ranges::tests::test_range_sum ... ok
[INFO] [stdout] test ranges::tests::test_range_sum_2d ... ok
[INFO] [stdout] test ranges::tests::test_range_sum_2d_panic_x - should panic ... ok
[INFO] [stdout] test ranges::tests::test_range_sum_3d ... ok
[INFO] [stdout] test ranges::tests::test_range_sum_2d_panic_y - should panic ... ok
[INFO] [stdout] test ranges::tests::test_range_sum_3d_panic_x - should panic ... ok
[INFO] [stdout] test ranges::tests::test_range_sum_3d_panic_y - should panic ... ok
[INFO] [stdout] test ranges::tests::test_range_sum_3d_panic_z - should panic ... ok
[INFO] [stdout] test ranges::tests::test_segment_tree_struct_logical_ops ... ok
[INFO] [stdout] test ranges::tests::test_segment_tree_struct_sum ... ok
[INFO] [stdout] test ranges::tests::test_segment_tree_sum ... ok
[INFO] [stdout] test sequences::tests::test_enumerate_inplace ... ok
[INFO] [stdout] test sequences::tests::test_enumerate_inplace_ordered ... ok
[INFO] [stdout] test sort::tests::test_binary_search_1 ... ok
[INFO] [stdout] test sort::tests::test_binary_search_2 ... ok
[INFO] [stdout] test strings::tests::test_count_different_substrings ... ok
[INFO] [stdout] test strings::tests::test_de_bruijn_sequence ... ok
[INFO] [stdout] test strings::tests::test_de_bruijn_sequence_fail ... ok
[INFO] [stdout] test strings::tests::test_fuzzy_search_jaro_winkler ... ok
[INFO] [stdout] test strings::tests::test_fuzzy_search_levenshtein_distance ... ok
[INFO] [stdout] test strings::tests::test_fuzzy_search_jaro_winkler_with_synonyms ... ok
[INFO] [stdout] test strings::tests::test_fuzzy_search_levenshtein_distance_with_synonyms ... ok
[INFO] [stdout] test strings::tests::test_jaro_similarity ... ok
[INFO] [stdout] test strings::tests::test_longest_common_subsequence ... ok
[INFO] [stdout] test strings::tests::test_levenshtein_distance ... ok
[INFO] [stdout] test strings::tests::test_jaro_winkler_similarity ... ok
[INFO] [stdout] test strings::tests::test_polynomial_hash ... ok
[INFO] [stdout] test strings::tests::test_pattern_matching ... ok
[INFO] [stdout] test strings::tests::test_trie ... ok
[INFO] [stdout] test trees::tests::test_adjacency_list_tree_2_ancestors ... ok
[INFO] [stdout] test trees::tests::test_adjacency_list_tree_2_ancestors_small_tree ... ok
[INFO] [stdout] test trees::tests::test_adjacency_list_tree_2_bfs ... ok
[INFO] [stdout] test trees::tests::test_adjacency_list_tree_2_dfs ... ok
[INFO] [stdout] test trees::tests::test_adjacency_list_tree_2_diameter ... ok
[INFO] [stdout] test trees::tests::test_adjacency_list_tree_2_distance ... ok
[INFO] [stdout] test trees::tests::test_adjacency_list_tree_2_lowest_common_ancestor ... ok
[INFO] [stdout] test trees::tests::test_adjacency_list_tree_bfs ... ok
[INFO] [stdout] test trees::tests::test_adjacency_list_tree_dfs ... ok
[INFO] [stdout] test trees::tests::test_adjacency_list_tree_diameter ... ok
[INFO] [stdout] test trees::tests::test_key_value_tree_bfs ... ok
[INFO] [stdout] test trees::tests::test_key_value_tree_diameter ... ok
[INFO] [stdout] test trees::tests::test_key_value_tree_range_query ... ok
[INFO] [stdout] test trees::tests::test_key_value_tree_dfs ... ok
[INFO] [stdout] test trees::tests::test_node_bfs ... ok
[INFO] [stdout] test trees::tests::test_node_dfs ... ok
[INFO] [stdout] test trees::tests::test_node_euler ... ok
[INFO] [stdout] test trees::tests::test_prufer_code_decode ... ok
[INFO] [stdout] test trees::tests::test_prufer_code_encode ... ok
[INFO] [stdout] test probability::tests::test_discrete_random_variable_rand ... ok
[INFO] [stdout] test concurrency::tests::test_job_execution ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 268 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.51s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests char16t
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] running `Command { std: "docker" "inspect" "decb122ce4305ce105113e4b0e7e313b26d87bd6daba2d9f779c22b3ecab4cc3", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "decb122ce4305ce105113e4b0e7e313b26d87bd6daba2d9f779c22b3ecab4cc3", kill_on_drop: false }`
[INFO] [stdout] decb122ce4305ce105113e4b0e7e313b26d87bd6daba2d9f779c22b3ecab4cc3
