[INFO] fetching crate nb-tree 0.2.0-alpha01...
[INFO] testing nb-tree-0.2.0-alpha01 against master#c90bcb9571b7aab0d8beaa2ce8a998ffaf079d38 for pr-146098-7
[INFO] extracting crate nb-tree 0.2.0-alpha01 into /workspace/builds/worker-5-tc1/source
[INFO] started tweaking crates.io crate nb-tree 0.2.0-alpha01
[INFO] finished tweaking crates.io crate nb-tree 0.2.0-alpha01
[INFO] tweaked toml for crates.io crate nb-tree 0.2.0-alpha01 written to /workspace/builds/worker-5-tc1/source/Cargo.toml
[INFO] validating manifest of crates.io crate nb-tree 0.2.0-alpha01 on toolchain c90bcb9571b7aab0d8beaa2ce8a998ffaf079d38
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+c90bcb9571b7aab0d8beaa2ce8a998ffaf079d38" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate crates.io crate nb-tree 0.2.0-alpha01 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" "+c90bcb9571b7aab0d8beaa2ce8a998ffaf079d38" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]  Downloading crates ...
[INFO] [stderr]   Downloaded replace_with v0.1.7
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:4848fb76d95f26979359cc7e45710b1dbc8f3acb7aeedee7c460d7702230f228" "/opt/rustwide/cargo-home/bin/cargo" "+c90bcb9571b7aab0d8beaa2ce8a998ffaf079d38" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 6bb776fd1a4862ad58f855e9b3c458a38b074f00f686b2f260e12c62d924b89b
[INFO] running `Command { std: "docker" "start" "-a" "6bb776fd1a4862ad58f855e9b3c458a38b074f00f686b2f260e12c62d924b89b", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "6bb776fd1a4862ad58f855e9b3c458a38b074f00f686b2f260e12c62d924b89b", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "6bb776fd1a4862ad58f855e9b3c458a38b074f00f686b2f260e12c62d924b89b", kill_on_drop: false }`
[INFO] [stdout] 6bb776fd1a4862ad58f855e9b3c458a38b074f00f686b2f260e12c62d924b89b
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:4848fb76d95f26979359cc7e45710b1dbc8f3acb7aeedee7c460d7702230f228" "/opt/rustwide/cargo-home/bin/cargo" "+c90bcb9571b7aab0d8beaa2ce8a998ffaf079d38" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 1c66895df73a84456a1560b997fe2d1ade11ed1f0e2dbdcf7db8112b4ffd5c54
[INFO] running `Command { std: "docker" "start" "-a" "1c66895df73a84456a1560b997fe2d1ade11ed1f0e2dbdcf7db8112b4ffd5c54", kill_on_drop: false }`
[INFO] [stderr]    Compiling proc-macro2 v1.0.86
[INFO] [stderr]    Compiling replace_with v0.1.7
[INFO] [stderr]    Compiling quote v1.0.36
[INFO] [stderr]    Compiling syn v2.0.68
[INFO] [stderr]    Compiling tracing-attributes v0.1.27
[INFO] [stderr]    Compiling tracing v0.1.40
[INFO] [stderr]    Compiling nb-tree v0.2.0-alpha01 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused imports: `debug`, `error`, `trace_span`, and `trace`
[INFO] [stdout]  --> src/tree/default.rs:3:15
[INFO] [stdout]   |
[INFO] [stdout] 3 | use tracing::{debug, error, trace, trace_span};
[INFO] [stdout]   |               ^^^^^  ^^^^^  ^^^^^  ^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `error`
[INFO] [stdout]  --> src/tree/diff.rs:2:22
[INFO] [stdout]   |
[INFO] [stdout] 2 | use tracing::{debug, error, trace, trace_span};
[INFO] [stdout]   |                      ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `prelude::DiffNode`
[INFO] [stdout]  --> src/tree/iter/depth.rs:4:25
[INFO] [stdout]   |
[INFO] [stdout] 4 | use crate::{path::Path, prelude::DiffNode, tree::node::TreeNode};
[INFO] [stdout]   |                         ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `any::Any` and `mem`
[INFO] [stdout]  --> src/tree/iter/sortable.rs:7:11
[INFO] [stdout]   |
[INFO] [stdout] 7 | use std::{any::Any, hash::Hash, iter::FusedIterator, marker::PhantomData, mem};
[INFO] [stdout]   |           ^^^^^^^^                                                        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `debug`, `error`, `trace_span`, and `trace`
[INFO] [stdout]    --> src/tree/mod.rs:424:15
[INFO] [stdout]     |
[INFO] [stdout] 424 | use tracing::{debug, error, trace, trace_span};
[INFO] [stdout]     |               ^^^^^  ^^^^^  ^^^^^  ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `branch`
[INFO] [stdout]   --> src/tree/iter/depth.rs:79:33
[INFO] [stdout]    |
[INFO] [stdout] 79 |         if let Self::Step { up, branch, data } = self {
[INFO] [stdout]    |                                 ^^^^^^ help: try ignoring the field: `branch: _`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `data`
[INFO] [stdout]   --> src/tree/iter/depth.rs:79:41
[INFO] [stdout]    |
[INFO] [stdout] 79 |         if let Self::Step { up, branch, data } = self {
[INFO] [stdout]    |                                         ^^^^ help: try ignoring the field: `data: _`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `tree::node::TreeNode<N, B>` is more private than the item `TreeIntoIterTarget::target`
[INFO] [stdout]    --> src/tree/iter/depth.rs:248:5
[INFO] [stdout]     |
[INFO] [stdout] 248 |     fn target(node: TreeNode<N, B>) -> Self::Target;
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ associated function `TreeIntoIterTarget::target` is reachable at visibility `pub`
[INFO] [stdout]     |
[INFO] [stdout] note: but type `tree::node::TreeNode<N, B>` is only usable at visibility `pub(crate)`
[INFO] [stdout]    --> src/tree/node.rs:4:1
[INFO] [stdout]     |
[INFO] [stdout]   4 | pub(crate) struct TreeNode<N, B> {
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     = note: `#[warn(private_interfaces)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `tree::node::TreeNode<N, B>` is more private than the item `<N as TreeIntoIterTarget<N, B>>::target`
[INFO] [stdout]    --> src/tree/iter/depth.rs:253:5
[INFO] [stdout]     |
[INFO] [stdout] 253 |     fn target(node: TreeNode<N, B>) -> Self::Target {
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ associated function `<N as TreeIntoIterTarget<N, B>>::target` is reachable at visibility `pub`
[INFO] [stdout]     |
[INFO] [stdout] note: but type `tree::node::TreeNode<N, B>` is only usable at visibility `pub(crate)`
[INFO] [stdout]    --> src/tree/node.rs:4:1
[INFO] [stdout]     |
[INFO] [stdout]   4 | pub(crate) struct TreeNode<N, B> {
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Before` is never constructed
[INFO] [stdout]   --> src/tree/diff.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub struct Before<N>(PhantomData<N>);
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Now` is never constructed
[INFO] [stdout]   --> src/tree/diff.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub struct Now<N>(PhantomData<N>);
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `sort` is never read
[INFO] [stdout]   --> src/tree/iter/sortable.rs:20:5
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub struct IterSortable<'a, N, B, T, S>
[INFO] [stdout]    |            ------------ field in this struct
[INFO] [stdout] ...
[INFO] [stdout] 20 |     sort: S,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `into_node` is never used
[INFO] [stdout]   --> src/tree/entry/detached.rs:43:19
[INFO] [stdout]    |
[INFO] [stdout] 35 | / impl<R, N, B, const BOUND: bool> DetachedEntry<R, N, B, BOUND>
[INFO] [stdout] 36 | | where
[INFO] [stdout] 37 | |     R: Deref<Target = Tree<N, B>>,
[INFO] [stdout]    | |__________________________________- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 43 |       pub(super) fn into_node(self, position: AttachedPosition<B, NodeIDX>) -> Node<R, N, B, BOUND> {
[INFO] [stdout]    |                     ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `into_detached_entry` is never used
[INFO] [stdout]   --> src/tree/entry/node.rs:67:19
[INFO] [stdout]    |
[INFO] [stdout] 59 | / impl<R, N, B, const BOUND: bool> Node<R, N, B, BOUND>
[INFO] [stdout] 60 | | where
[INFO] [stdout] 61 | |     R: Deref<Target = Tree<N, B>>,
[INFO] [stdout]    | |__________________________________- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 67 |       pub(super) fn into_detached_entry(
[INFO] [stdout]    |                     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/tree/mod.rs:776:17
[INFO] [stdout]     |
[INFO] [stdout] 776 |     pub fn iter(&self) -> Iter<N, B, &N> {
[INFO] [stdout]     |                 ^^^^^     ^^^^^^^^^^^^^^
[INFO] [stdout]     |                 |         |          |
[INFO] [stdout]     |                 |         |          the same lifetime is elided here
[INFO] [stdout]     |                 |         the same lifetime is hidden here
[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] 776 |     pub fn iter(&self) -> Iter<'_, N, B, &N> {
[INFO] [stdout]     |                                +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused `Result` that must be used
[INFO] [stdout]     --> src/tree/mod.rs:1196:13
[INFO] [stdout]      |
[INFO] [stdout] 1196 |             entry.apply_move(&d);
[INFO] [stdout]      |             ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]      |
[INFO] [stdout]      = note: this `Result` may be an `Err` variant, which should be handled
[INFO] [stdout]      = note: `#[warn(unused_must_use)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] help: use `let _ = ...` to ignore the resulting value
[INFO] [stdout]      |
[INFO] [stdout] 1196 |             let _ = entry.apply_move(&d);
[INFO] [stdout]      |             +++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 7.64s
[INFO] running `Command { std: "docker" "inspect" "1c66895df73a84456a1560b997fe2d1ade11ed1f0e2dbdcf7db8112b4ffd5c54", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "1c66895df73a84456a1560b997fe2d1ade11ed1f0e2dbdcf7db8112b4ffd5c54", kill_on_drop: false }`
[INFO] [stdout] 1c66895df73a84456a1560b997fe2d1ade11ed1f0e2dbdcf7db8112b4ffd5c54
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:4848fb76d95f26979359cc7e45710b1dbc8f3acb7aeedee7c460d7702230f228" "/opt/rustwide/cargo-home/bin/cargo" "+c90bcb9571b7aab0d8beaa2ce8a998ffaf079d38" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 8a0f827e4ed1e85b428c6812d5ea5589ff0a722411f76855f13e33ab66d4ad46
[INFO] running `Command { std: "docker" "start" "-a" "8a0f827e4ed1e85b428c6812d5ea5589ff0a722411f76855f13e33ab66d4ad46", kill_on_drop: false }`
[INFO] [stderr]    Compiling regex-syntax v0.8.4
[INFO] [stderr]    Compiling tracing v0.1.40
[INFO] [stderr]    Compiling anstyle-parse v0.2.4
[INFO] [stderr]    Compiling anstyle-query v1.1.0
[INFO] [stderr]    Compiling env_filter v0.1.0
[INFO] [stderr]    Compiling test-log-macros v0.2.16
[INFO] [stderr]    Compiling nb-tree v0.2.0-alpha01 (/opt/rustwide/workdir)
[INFO] [stderr]    Compiling anstream v0.6.14
[INFO] [stdout] warning: unused imports: `debug`, `error`, `trace_span`, and `trace`
[INFO] [stdout]  --> src/tree/default.rs:3:15
[INFO] [stdout]   |
[INFO] [stdout] 3 | use tracing::{debug, error, trace, trace_span};
[INFO] [stdout]   |               ^^^^^  ^^^^^  ^^^^^  ^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `error`
[INFO] [stdout]  --> src/tree/diff.rs:2:22
[INFO] [stdout]   |
[INFO] [stdout] 2 | use tracing::{debug, error, trace, trace_span};
[INFO] [stdout]   |                      ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `prelude::DiffNode`
[INFO] [stdout]  --> src/tree/iter/depth.rs:4:25
[INFO] [stdout]   |
[INFO] [stdout] 4 | use crate::{path::Path, prelude::DiffNode, tree::node::TreeNode};
[INFO] [stdout]   |                         ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `any::Any` and `mem`
[INFO] [stdout]  --> src/tree/iter/sortable.rs:7:11
[INFO] [stdout]   |
[INFO] [stdout] 7 | use std::{any::Any, hash::Hash, iter::FusedIterator, marker::PhantomData, mem};
[INFO] [stdout]   |           ^^^^^^^^                                                        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `debug`, `error`, `trace_span`, and `trace`
[INFO] [stdout]    --> src/tree/mod.rs:424:15
[INFO] [stdout]     |
[INFO] [stdout] 424 | use tracing::{debug, error, trace, trace_span};
[INFO] [stdout]     |               ^^^^^  ^^^^^  ^^^^^  ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling env_logger v0.11.3
[INFO] [stdout] warning: unused variable: `branch`
[INFO] [stdout]   --> src/tree/iter/depth.rs:79:33
[INFO] [stdout]    |
[INFO] [stdout] 79 |         if let Self::Step { up, branch, data } = self {
[INFO] [stdout]    |                                 ^^^^^^ help: try ignoring the field: `branch: _`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `data`
[INFO] [stdout]   --> src/tree/iter/depth.rs:79:41
[INFO] [stdout]    |
[INFO] [stdout] 79 |         if let Self::Step { up, branch, data } = self {
[INFO] [stdout]    |                                         ^^^^ help: try ignoring the field: `data: _`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `tree::node::TreeNode<N, B>` is more private than the item `TreeIntoIterTarget::target`
[INFO] [stdout]    --> src/tree/iter/depth.rs:248:5
[INFO] [stdout]     |
[INFO] [stdout] 248 |     fn target(node: TreeNode<N, B>) -> Self::Target;
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ associated function `TreeIntoIterTarget::target` is reachable at visibility `pub`
[INFO] [stdout]     |
[INFO] [stdout] note: but type `tree::node::TreeNode<N, B>` is only usable at visibility `pub(crate)`
[INFO] [stdout]    --> src/tree/node.rs:4:1
[INFO] [stdout]     |
[INFO] [stdout]   4 | pub(crate) struct TreeNode<N, B> {
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     = note: `#[warn(private_interfaces)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `tree::node::TreeNode<N, B>` is more private than the item `<N as TreeIntoIterTarget<N, B>>::target`
[INFO] [stdout]    --> src/tree/iter/depth.rs:253:5
[INFO] [stdout]     |
[INFO] [stdout] 253 |     fn target(node: TreeNode<N, B>) -> Self::Target {
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ associated function `<N as TreeIntoIterTarget<N, B>>::target` is reachable at visibility `pub`
[INFO] [stdout]     |
[INFO] [stdout] note: but type `tree::node::TreeNode<N, B>` is only usable at visibility `pub(crate)`
[INFO] [stdout]    --> src/tree/node.rs:4:1
[INFO] [stdout]     |
[INFO] [stdout]   4 | pub(crate) struct TreeNode<N, B> {
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Before` is never constructed
[INFO] [stdout]   --> src/tree/diff.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub struct Before<N>(PhantomData<N>);
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Now` is never constructed
[INFO] [stdout]   --> src/tree/diff.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub struct Now<N>(PhantomData<N>);
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `sort` is never read
[INFO] [stdout]   --> src/tree/iter/sortable.rs:20:5
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub struct IterSortable<'a, N, B, T, S>
[INFO] [stdout]    |            ------------ field in this struct
[INFO] [stdout] ...
[INFO] [stdout] 20 |     sort: S,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `into_node` is never used
[INFO] [stdout]   --> src/tree/entry/detached.rs:43:19
[INFO] [stdout]    |
[INFO] [stdout] 35 | / impl<R, N, B, const BOUND: bool> DetachedEntry<R, N, B, BOUND>
[INFO] [stdout] 36 | | where
[INFO] [stdout] 37 | |     R: Deref<Target = Tree<N, B>>,
[INFO] [stdout]    | |__________________________________- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 43 |       pub(super) fn into_node(self, position: AttachedPosition<B, NodeIDX>) -> Node<R, N, B, BOUND> {
[INFO] [stdout]    |                     ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `into_detached_entry` is never used
[INFO] [stdout]   --> src/tree/entry/node.rs:67:19
[INFO] [stdout]    |
[INFO] [stdout] 59 | / impl<R, N, B, const BOUND: bool> Node<R, N, B, BOUND>
[INFO] [stdout] 60 | | where
[INFO] [stdout] 61 | |     R: Deref<Target = Tree<N, B>>,
[INFO] [stdout]    | |__________________________________- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 67 |       pub(super) fn into_detached_entry(
[INFO] [stdout]    |                     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/tree/mod.rs:776:17
[INFO] [stdout]     |
[INFO] [stdout] 776 |     pub fn iter(&self) -> Iter<N, B, &N> {
[INFO] [stdout]     |                 ^^^^^     ^^^^^^^^^^^^^^
[INFO] [stdout]     |                 |         |          |
[INFO] [stdout]     |                 |         |          the same lifetime is elided here
[INFO] [stdout]     |                 |         the same lifetime is hidden here
[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] 776 |     pub fn iter(&self) -> Iter<'_, N, B, &N> {
[INFO] [stdout]     |                                +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused `Result` that must be used
[INFO] [stdout]     --> src/tree/mod.rs:1196:13
[INFO] [stdout]      |
[INFO] [stdout] 1196 |             entry.apply_move(&d);
[INFO] [stdout]      |             ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]      |
[INFO] [stdout]      = note: this `Result` may be an `Err` variant, which should be handled
[INFO] [stdout]      = note: `#[warn(unused_must_use)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] help: use `let _ = ...` to ignore the resulting value
[INFO] [stdout]      |
[INFO] [stdout] 1196 |             let _ = entry.apply_move(&d);
[INFO] [stdout]      |             +++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling regex-automata v0.4.7
[INFO] [stderr]    Compiling regex v1.10.5
[INFO] [stderr]    Compiling tracing-subscriber v0.3.18
[INFO] [stderr]    Compiling test-log v0.2.16
[INFO] [stdout] warning: unused imports: `Level`, `debug`, `error`, `info`, `span`, `trace`, and `warn`
[INFO] [stdout]  --> examples/test.rs:1:15
[INFO] [stdout]   |
[INFO] [stdout] 1 | use tracing::{debug, error, info, level_filters::LevelFilter, span, trace, warn, Level};
[INFO] [stdout]   |               ^^^^^  ^^^^^  ^^^^                              ^^^^  ^^^^^  ^^^^  ^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `path`
[INFO] [stdout]   --> src/macros.rs:39:17
[INFO] [stdout]    |
[INFO] [stdout] 39 |     use crate::{path, prelude::Path /*, tree, tree::Tree*/};
[INFO] [stdout]    |                 ^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `debug`, `error`, `trace_span`, and `trace`
[INFO] [stdout]  --> src/tree/default.rs:3:15
[INFO] [stdout]   |
[INFO] [stdout] 3 | use tracing::{debug, error, trace, trace_span};
[INFO] [stdout]   |               ^^^^^  ^^^^^  ^^^^^  ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `error`
[INFO] [stdout]  --> src/tree/diff.rs:2:22
[INFO] [stdout]   |
[INFO] [stdout] 2 | use tracing::{debug, error, trace, trace_span};
[INFO] [stdout]   |                      ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `prelude::DiffNode`
[INFO] [stdout]  --> src/tree/iter/depth.rs:4:25
[INFO] [stdout]   |
[INFO] [stdout] 4 | use crate::{path::Path, prelude::DiffNode, tree::node::TreeNode};
[INFO] [stdout]   |                         ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `any::Any` and `mem`
[INFO] [stdout]  --> src/tree/iter/sortable.rs:7:11
[INFO] [stdout]   |
[INFO] [stdout] 7 | use std::{any::Any, hash::Hash, iter::FusedIterator, marker::PhantomData, mem};
[INFO] [stdout]   |           ^^^^^^^^                                                        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `debug`, `error`, `trace_span`, and `trace`
[INFO] [stdout]    --> src/tree/mod.rs:424:15
[INFO] [stdout]     |
[INFO] [stdout] 424 | use tracing::{debug, error, trace, trace_span};
[INFO] [stdout]     |               ^^^^^  ^^^^^  ^^^^^  ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `debug` and `trace`
[INFO] [stdout]     --> src/tree/mod.rs:1511:19
[INFO] [stdout]      |
[INFO] [stdout] 1511 |     use tracing::{debug, trace};
[INFO] [stdout]      |                   ^^^^^  ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `branch`
[INFO] [stdout]   --> src/tree/iter/depth.rs:79:33
[INFO] [stdout]    |
[INFO] [stdout] 79 |         if let Self::Step { up, branch, data } = self {
[INFO] [stdout]    |                                 ^^^^^^ help: try ignoring the field: `branch: _`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `data`
[INFO] [stdout]   --> src/tree/iter/depth.rs:79:41
[INFO] [stdout]    |
[INFO] [stdout] 79 |         if let Self::Step { up, branch, data } = self {
[INFO] [stdout]    |                                         ^^^^ help: try ignoring the field: `data: _`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]     --> src/tree/mod.rs:1751:13
[INFO] [stdout]      |
[INFO] [stdout] 1751 |         let mut tree1 = new_tree();
[INFO] [stdout]      |             ----^^^^^
[INFO] [stdout]      |             |
[INFO] [stdout]      |             help: remove this `mut`
[INFO] [stdout]      |
[INFO] [stdout]      = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `tree::node::TreeNode<N, B>` is more private than the item `TreeIntoIterTarget::target`
[INFO] [stdout]    --> src/tree/iter/depth.rs:248:5
[INFO] [stdout]     |
[INFO] [stdout] 248 |     fn target(node: TreeNode<N, B>) -> Self::Target;
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ associated function `TreeIntoIterTarget::target` is reachable at visibility `pub`
[INFO] [stdout]     |
[INFO] [stdout] note: but type `tree::node::TreeNode<N, B>` is only usable at visibility `pub(crate)`
[INFO] [stdout]    --> src/tree/node.rs:4:1
[INFO] [stdout]     |
[INFO] [stdout]   4 | pub(crate) struct TreeNode<N, B> {
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     = note: `#[warn(private_interfaces)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `tree::node::TreeNode<N, B>` is more private than the item `<N as TreeIntoIterTarget<N, B>>::target`
[INFO] [stdout]    --> src/tree/iter/depth.rs:253:5
[INFO] [stdout]     |
[INFO] [stdout] 253 |     fn target(node: TreeNode<N, B>) -> Self::Target {
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ associated function `<N as TreeIntoIterTarget<N, B>>::target` is reachable at visibility `pub`
[INFO] [stdout]     |
[INFO] [stdout] note: but type `tree::node::TreeNode<N, B>` is only usable at visibility `pub(crate)`
[INFO] [stdout]    --> src/tree/node.rs:4:1
[INFO] [stdout]     |
[INFO] [stdout]   4 | pub(crate) struct TreeNode<N, B> {
[INFO] [stdout]     | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Before` is never constructed
[INFO] [stdout]   --> src/tree/diff.rs:18:12
[INFO] [stdout]    |
[INFO] [stdout] 18 | pub struct Before<N>(PhantomData<N>);
[INFO] [stdout]    |            ^^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Now` is never constructed
[INFO] [stdout]   --> src/tree/diff.rs:19:12
[INFO] [stdout]    |
[INFO] [stdout] 19 | pub struct Now<N>(PhantomData<N>);
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `sort` is never read
[INFO] [stdout]   --> src/tree/iter/sortable.rs:20:5
[INFO] [stdout]    |
[INFO] [stdout] 11 | pub struct IterSortable<'a, N, B, T, S>
[INFO] [stdout]    |            ------------ field in this struct
[INFO] [stdout] ...
[INFO] [stdout] 20 |     sort: S,
[INFO] [stdout]    |     ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `into_node` is never used
[INFO] [stdout]   --> src/tree/entry/detached.rs:43:19
[INFO] [stdout]    |
[INFO] [stdout] 35 | / impl<R, N, B, const BOUND: bool> DetachedEntry<R, N, B, BOUND>
[INFO] [stdout] 36 | | where
[INFO] [stdout] 37 | |     R: Deref<Target = Tree<N, B>>,
[INFO] [stdout]    | |__________________________________- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 43 |       pub(super) fn into_node(self, position: AttachedPosition<B, NodeIDX>) -> Node<R, N, B, BOUND> {
[INFO] [stdout]    |                     ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `into_detached_entry` is never used
[INFO] [stdout]   --> src/tree/entry/node.rs:67:19
[INFO] [stdout]    |
[INFO] [stdout] 59 | / impl<R, N, B, const BOUND: bool> Node<R, N, B, BOUND>
[INFO] [stdout] 60 | | where
[INFO] [stdout] 61 | |     R: Deref<Target = Tree<N, B>>,
[INFO] [stdout]    | |__________________________________- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 67 |       pub(super) fn into_detached_entry(
[INFO] [stdout]    |                     ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stdout]    --> src/tree/mod.rs:776:17
[INFO] [stdout]     |
[INFO] [stdout] 776 |     pub fn iter(&self) -> Iter<N, B, &N> {
[INFO] [stdout]     |                 ^^^^^     ^^^^^^^^^^^^^^
[INFO] [stdout]     |                 |         |          |
[INFO] [stdout]     |                 |         |          the same lifetime is elided here
[INFO] [stdout]     |                 |         the same lifetime is hidden here
[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] 776 |     pub fn iter(&self) -> Iter<'_, N, B, &N> {
[INFO] [stdout]     |                                +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused `Result` that must be used
[INFO] [stdout]     --> src/tree/mod.rs:1196:13
[INFO] [stdout]      |
[INFO] [stdout] 1196 |             entry.apply_move(&d);
[INFO] [stdout]      |             ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]      |
[INFO] [stdout]      = note: this `Result` may be an `Err` variant, which should be handled
[INFO] [stdout]      = note: `#[warn(unused_must_use)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] help: use `let _ = ...` to ignore the resulting value
[INFO] [stdout]      |
[INFO] [stdout] 1196 |             let _ = entry.apply_move(&d);
[INFO] [stdout]      |             +++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 9.80s
[INFO] running `Command { std: "docker" "inspect" "8a0f827e4ed1e85b428c6812d5ea5589ff0a722411f76855f13e33ab66d4ad46", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "8a0f827e4ed1e85b428c6812d5ea5589ff0a722411f76855f13e33ab66d4ad46", kill_on_drop: false }`
[INFO] [stdout] 8a0f827e4ed1e85b428c6812d5ea5589ff0a722411f76855f13e33ab66d4ad46
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:4848fb76d95f26979359cc7e45710b1dbc8f3acb7aeedee7c460d7702230f228" "/opt/rustwide/cargo-home/bin/cargo" "+c90bcb9571b7aab0d8beaa2ce8a998ffaf079d38" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] 8a7db7dcd4837f9e8026567fa3bf0e010027fd8f60f06320788c8122e1f65c88
[INFO] running `Command { std: "docker" "start" "-a" "8a7db7dcd4837f9e8026567fa3bf0e010027fd8f60f06320788c8122e1f65c88", kill_on_drop: false }`
[INFO] [stderr] warning: unused imports: `debug`, `error`, `trace_span`, and `trace`
[INFO] [stderr]  --> src/tree/default.rs:3:15
[INFO] [stderr]   |
[INFO] [stderr] 3 | use tracing::{debug, error, trace, trace_span};
[INFO] [stderr]   |               ^^^^^  ^^^^^  ^^^^^  ^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `error`
[INFO] [stderr]  --> src/tree/diff.rs:2:22
[INFO] [stderr]   |
[INFO] [stderr] 2 | use tracing::{debug, error, trace, trace_span};
[INFO] [stderr]   |                      ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `prelude::DiffNode`
[INFO] [stderr]  --> src/tree/iter/depth.rs:4:25
[INFO] [stderr]   |
[INFO] [stderr] 4 | use crate::{path::Path, prelude::DiffNode, tree::node::TreeNode};
[INFO] [stderr]   |                         ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused imports: `any::Any` and `mem`
[INFO] [stderr]  --> src/tree/iter/sortable.rs:7:11
[INFO] [stderr]   |
[INFO] [stderr] 7 | use std::{any::Any, hash::Hash, iter::FusedIterator, marker::PhantomData, mem};
[INFO] [stderr]   |           ^^^^^^^^                                                        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused imports: `debug`, `error`, `trace_span`, and `trace`
[INFO] [stderr]    --> src/tree/mod.rs:424:15
[INFO] [stderr]     |
[INFO] [stderr] 424 | use tracing::{debug, error, trace, trace_span};
[INFO] [stderr]     |               ^^^^^  ^^^^^  ^^^^^  ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `branch`
[INFO] [stderr]   --> src/tree/iter/depth.rs:79:33
[INFO] [stderr]    |
[INFO] [stderr] 79 |         if let Self::Step { up, branch, data } = self {
[INFO] [stderr]    |                                 ^^^^^^ help: try ignoring the field: `branch: _`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `data`
[INFO] [stderr]   --> src/tree/iter/depth.rs:79:41
[INFO] [stderr]    |
[INFO] [stderr] 79 |         if let Self::Step { up, branch, data } = self {
[INFO] [stderr]    |                                         ^^^^ help: try ignoring the field: `data: _`
[INFO] [stderr] 
[INFO] [stderr] warning: type `tree::node::TreeNode<N, B>` is more private than the item `TreeIntoIterTarget::target`
[INFO] [stderr]    --> src/tree/iter/depth.rs:248:5
[INFO] [stderr]     |
[INFO] [stderr] 248 |     fn target(node: TreeNode<N, B>) -> Self::Target;
[INFO] [stderr]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ associated function `TreeIntoIterTarget::target` is reachable at visibility `pub`
[INFO] [stderr]     |
[INFO] [stderr] note: but type `tree::node::TreeNode<N, B>` is only usable at visibility `pub(crate)`
[INFO] [stderr]    --> src/tree/node.rs:4:1
[INFO] [stderr]     |
[INFO] [stderr]   4 | pub(crate) struct TreeNode<N, B> {
[INFO] [stderr]     | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]     = note: `#[warn(private_interfaces)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: type `tree::node::TreeNode<N, B>` is more private than the item `<N as TreeIntoIterTarget<N, B>>::target`
[INFO] [stderr]    --> src/tree/iter/depth.rs:253:5
[INFO] [stderr]     |
[INFO] [stderr] 253 |     fn target(node: TreeNode<N, B>) -> Self::Target {
[INFO] [stderr]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ associated function `<N as TreeIntoIterTarget<N, B>>::target` is reachable at visibility `pub`
[INFO] [stderr]     |
[INFO] [stderr] note: but type `tree::node::TreeNode<N, B>` is only usable at visibility `pub(crate)`
[INFO] [stderr]    --> src/tree/node.rs:4:1
[INFO] [stderr]     |
[INFO] [stderr]   4 | pub(crate) struct TreeNode<N, B> {
[INFO] [stderr]     | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Before` is never constructed
[INFO] [stderr]   --> src/tree/diff.rs:18:12
[INFO] [stderr]    |
[INFO] [stderr] 18 | pub struct Before<N>(PhantomData<N>);
[INFO] [stderr]    |            ^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Now` is never constructed
[INFO] [stderr]   --> src/tree/diff.rs:19:12
[INFO] [stderr]    |
[INFO] [stderr] 19 | pub struct Now<N>(PhantomData<N>);
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: field `sort` is never read
[INFO] [stderr]   --> src/tree/iter/sortable.rs:20:5
[INFO] [stderr]    |
[INFO] [stderr] 11 | pub struct IterSortable<'a, N, B, T, S>
[INFO] [stderr]    |            ------------ field in this struct
[INFO] [stderr] ...
[INFO] [stderr] 20 |     sort: S,
[INFO] [stderr]    |     ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method `into_node` is never used
[INFO] [stderr]   --> src/tree/entry/detached.rs:43:19
[INFO] [stderr]    |
[INFO] [stderr] 35 | / impl<R, N, B, const BOUND: bool> DetachedEntry<R, N, B, BOUND>
[INFO] [stderr] 36 | | where
[INFO] [stderr] 37 | |     R: Deref<Target = Tree<N, B>>,
[INFO] [stderr]    | |__________________________________- method in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 43 |       pub(super) fn into_node(self, position: AttachedPosition<B, NodeIDX>) -> Node<R, N, B, BOUND> {
[INFO] [stderr]    |                     ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method `into_detached_entry` is never used
[INFO] [stderr]   --> src/tree/entry/node.rs:67:19
[INFO] [stderr]    |
[INFO] [stderr] 59 | / impl<R, N, B, const BOUND: bool> Node<R, N, B, BOUND>
[INFO] [stderr] 60 | | where
[INFO] [stderr] 61 | |     R: Deref<Target = Tree<N, B>>,
[INFO] [stderr]    | |__________________________________- method in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 67 |       pub(super) fn into_detached_entry(
[INFO] [stderr]    |                     ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: hiding a lifetime that's elided elsewhere is confusing
[INFO] [stderr]    --> src/tree/mod.rs:776:17
[INFO] [stderr]     |
[INFO] [stderr] 776 |     pub fn iter(&self) -> Iter<N, B, &N> {
[INFO] [stderr]     |                 ^^^^^     ^^^^^^^^^^^^^^
[INFO] [stderr]     |                 |         |          |
[INFO] [stderr]     |                 |         |          the same lifetime is elided here
[INFO] [stderr]     |                 |         the same lifetime is hidden here
[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] 776 |     pub fn iter(&self) -> Iter<'_, N, B, &N> {
[INFO] [stderr]     |                                +++
[INFO] [stderr] 
[INFO] [stderr] warning: unused `Result` that must be used
[INFO] [stderr]     --> src/tree/mod.rs:1196:13
[INFO] [stderr]      |
[INFO] [stderr] 1196 |             entry.apply_move(&d);
[INFO] [stderr]      |             ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]      |
[INFO] [stderr]      = note: this `Result` may be an `Err` variant, which should be handled
[INFO] [stderr]      = note: `#[warn(unused_must_use)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] help: use `let _ = ...` to ignore the resulting value
[INFO] [stderr]      |
[INFO] [stderr] 1196 |             let _ = entry.apply_move(&d);
[INFO] [stderr]      |             +++++++
[INFO] [stderr] 
[INFO] [stderr] warning: `nb-tree` (lib) generated 16 warnings (run `cargo fix --lib -p nb-tree` to apply 8 suggestions)
[INFO] [stderr] warning: unused import: `path`
[INFO] [stderr]   --> src/macros.rs:39:17
[INFO] [stderr]    |
[INFO] [stderr] 39 |     use crate::{path, prelude::Path /*, tree, tree::Tree*/};
[INFO] [stderr]    |                 ^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused imports: `debug`, `error`, `trace_span`, and `trace`
[INFO] [stderr]  --> src/tree/default.rs:3:15
[INFO] [stderr]   |
[INFO] [stderr] 3 | use tracing::{debug, error, trace, trace_span};
[INFO] [stderr]   |               ^^^^^  ^^^^^  ^^^^^  ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused imports: `debug` and `trace`
[INFO] [stderr]     --> src/tree/mod.rs:1511:19
[INFO] [stderr]      |
[INFO] [stderr] 1511 |     use tracing::{debug, trace};
[INFO] [stderr]      |                   ^^^^^  ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]     --> src/tree/mod.rs:1751:13
[INFO] [stderr]      |
[INFO] [stderr] 1751 |         let mut tree1 = new_tree();
[INFO] [stderr]      |             ----^^^^^
[INFO] [stderr]      |             |
[INFO] [stderr]      |             help: remove this `mut`
[INFO] [stderr]      |
[INFO] [stderr]      = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused imports: `Level`, `debug`, `error`, `info`, `span`, `trace`, and `warn`
[INFO] [stderr]  --> examples/test.rs:1:15
[INFO] [stderr]   |
[INFO] [stderr] 1 | use tracing::{debug, error, info, level_filters::LevelFilter, span, trace, warn, Level};
[INFO] [stderr]   |               ^^^^^  ^^^^^  ^^^^                              ^^^^  ^^^^^  ^^^^  ^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: `nb-tree` (lib test) generated 19 warnings (15 duplicates) (run `cargo fix --lib -p nb-tree --tests` to apply 4 suggestions)
[INFO] [stderr] warning: `nb-tree` (example "test") generated 1 warning (run `cargo fix --example "test" -p nb-tree` to apply 1 suggestion)
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.11s
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/nb_tree-6ddcbba436745f6f)
[INFO] [stdout] 
[INFO] [stdout] running 41 tests
[INFO] [stdout] test macros::tests::path ... ok
[INFO] [stdout] test path::tests::from_to ... ok
[INFO] [stdout] test path::tests::apply_deref ... ok
[INFO] [stdout] test path::tests::apply ... ok
[INFO] [stdout] test path::tests::iter ... ok
[INFO] [stdout] test path::tests::push_pop_get ... ok
[INFO] [stdout] test path::tests::apply_with ... ok
[INFO] [stdout] test tree::tests::apply ... ok
[INFO] [stdout] test tree::tests::apply_diff ... ok
[INFO] [stdout] test tree::tests::apply_map ... ok
[INFO] [stdout] test tree::tests::apply_diff_with ... ok
[INFO] [stdout] test tree::tests::clear ... ok
[INFO] [stdout] test tree::tests::combine ... ok
[INFO] [stdout] test tree::tests::entry_mut ... ok
[INFO] [stdout] test tree::tests::eq_tree ... ok
[INFO] [stdout] test tree::tests::get ... ok
[INFO] [stdout] test tree::tests::get_idx_path_idxs ... ok
[INFO] [stdout] test tree::tests::force_apply ... ok
[INFO] [stdout] test tree::tests::get_root_idx ... ok
[INFO] [stdout] test tree::tests::index ... ok
[INFO] [stdout] test tree::tests::insert ... ok
[INFO] [stdout] test tree::tests::insert_at ... ok
[INFO] [stdout] test tree::tests::insert_root ... ok
[INFO] [stdout] test tree::tests::i ... ok
[INFO] [stdout] test tree::tests::get_root ... ok
[INFO] [stdout] test tree::tests::is_empty ... ok
[INFO] [stdout] test tree::tests::is_subtree_eq ... ok
[INFO] [stdout] test tree::tests::get_mut ... ok
[INFO] [stdout] test tree::tests::iter_iter_on ... ok
[INFO] [stdout] test tree::tests::entry ... ok
[INFO] [stdout] test tree::tests::remove_subtree_at ... ok
[INFO] [stdout] test tree::tests::len ... ok
[INFO] [stdout] test tree::tests::root_entry ... ok
[INFO] [stdout] test tree::tests::root_entry_mut ... ok
[INFO] [stdout] test tree::tests::values ... ok
[INFO] [stdout] test tree::tests::new ... ok
[INFO] [stdout] test tree::tests::remove_subtree ... ok
[INFO] [stdout] test tree::tests::insert_at_panic_parent - should panic ... ok
[INFO] [stdout] test tree::tests::index_inexistent1 - should panic ... ok
[INFO] [stdout] test tree::tests::index_inexistent2 - should panic ... ok
[INFO] [stdout] test tree::tests::index_inexistent3 - should panic ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 41 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.04s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests nb_tree
[INFO] [stdout] 
[INFO] [stdout] running 40 tests
[INFO] [stdout] test src/lib.rs - tree (line 87) ... ok
[INFO] [stdout] test src/lib.rs - tree (line 395) ... ok
[INFO] [stdout] test src/lib.rs - tree (line 270) ... ok
[INFO] [stdout] test src/lib.rs - tree (line 57) ... ok
[INFO] [stdout] test src/lib.rs - tree (line 126) ... ok
[INFO] [stdout] test src/lib.rs - tree (line 73) ... ok
[INFO] [stdout] test src/lib.rs - tree (line 303) ... ok
[INFO] [stdout] test src/lib.rs - tree (line 105) ... ok
[INFO] [stdout] test src/lib.rs - tree (line 377) ... ok
[INFO] [stdout] test src/lib.rs - tree (line 183) ... ok
[INFO] [stdout] test src/lib.rs - tree (line 160) ... ok
[INFO] [stdout] test src/lib.rs - tree (line 139) ... ok
[INFO] [stdout] test src/lib.rs - tree (line 239) ... ok
[INFO] [stdout] test src/lib.rs - tree (line 342) ... ok
[INFO] [stdout] test src/lib.rs - tree (line 205) ... ok
[INFO] [stdout] test src/macros.rs - macros::path (line 12) ... ok
[INFO] [stdout] test src/lib.rs - tree (line 359) ... ok
[INFO] [stdout] test src/path.rs - path::Path (line 30) ... ok
[INFO] [stdout] test src/tree/mod.rs - tree::Tree (line 453) ... ok
[INFO] [stdout] test src/path.rs - path::Path<B>::apply (line 229) ... ok
[INFO] [stdout] test src/tree/mod.rs - tree::Tree<N,B>::entry (line 994) ... ok
[INFO] [stdout] test src/tree/mod.rs - tree::Tree<N,B>::combine (line 1237) ... ok
[INFO] [stdout] test src/tree/mod.rs - tree::Tree<N,B>::is_empty (line 635) ... ok
[INFO] [stdout] test src/tree/mod.rs - tree::Tree<N,B>::get (line 897) ... ok
[INFO] [stdout] test src/tree/mod.rs - tree::Tree<N,B>::insert (line 1053) ... ok
[INFO] [stdout] test src/tree/mod.rs - tree::Tree<N,B>::entry_mut (line 1011) ... ok
[INFO] [stdout] test src/tree/mod.rs - tree::Tree<N,B>::get_mut (line 921) ... ok
[INFO] [stdout] test src/tree/mod.rs - tree::Tree<N,B>::insert_root (line 593) ... ok
[INFO] [stdout] test src/tree/mod.rs - tree::Tree<N,B>::new (line 541) ... ok
[INFO] [stdout] test src/path.rs - path::Path<B>::apply_with (line 287) ... ok
[INFO] [stdout] test src/tree/mod.rs - tree::Tree<N,B>::len (line 649) ... ok
[INFO] [stdout] test src/tree/mod.rs - tree::Tree<N,B>::get_root (line 566) ... ok
[INFO] [stdout] test src/tree/mod.rs - tree::Tree<N,B>::iter (line 707) ... ok
[INFO] [stdout] test src/tree/mod.rs - tree::Tree<N,B>::force_apply (line 1128) ... ok
[INFO] [stdout] test src/tree/mod.rs - tree::Tree<N,B>::root_entry_mut (line 971) ... ok
[INFO] [stdout] test src/tree/mod.rs - tree::Tree<N,B>::apply (line 1397) ... ok
[INFO] [stdout] test src/tree/mod.rs - tree::Tree<N,B>::remove_subtree (line 1086) ... ok
[INFO] [stdout] test src/tree/mod.rs - tree::Tree<N,B>::apply_diff (line 1437) ... ok
[INFO] [stdout] test src/tree/mod.rs - tree::Tree<N,B>::root_entry (line 945) ... ok
[INFO] [stdout] test src/tree/mod.rs - tree::Tree<N,B>::values (line 669) ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 40 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 3.13s
[INFO] [stdout] 
[INFO] running `Command { std: "docker" "inspect" "8a7db7dcd4837f9e8026567fa3bf0e010027fd8f60f06320788c8122e1f65c88", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "8a7db7dcd4837f9e8026567fa3bf0e010027fd8f60f06320788c8122e1f65c88", kill_on_drop: false }`
[INFO] [stdout] 8a7db7dcd4837f9e8026567fa3bf0e010027fd8f60f06320788c8122e1f65c88
