[INFO] fetching crate algods 0.1.0...
[INFO] testing algods-0.1.0 against master#c90bcb9571b7aab0d8beaa2ce8a998ffaf079d38 for pr-146098-7
[INFO] extracting crate algods 0.1.0 into /workspace/builds/worker-3-tc1/source
[INFO] started tweaking crates.io crate algods 0.1.0
[INFO] finished tweaking crates.io crate algods 0.1.0
[INFO] tweaked toml for crates.io crate algods 0.1.0 written to /workspace/builds/worker-3-tc1/source/Cargo.toml
[INFO] validating manifest of crates.io crate algods 0.1.0 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 algods 0.1.0 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 getrandom v0.2.10
[INFO] [stderr]   Downloaded proc-macro2 v1.0.63
[INFO] [stderr]   Downloaded clap_lex v0.5.0
[INFO] [stderr]   Downloaded anstyle-wincon v1.0.1
[INFO] [stderr]   Downloaded is-terminal v0.4.7
[INFO] [stderr]   Downloaded quote v1.0.28
[INFO] [stderr]   Downloaded anstream v0.3.2
[INFO] [stderr]   Downloaded clap v4.3.8
[INFO] [stderr]   Downloaded clap_derive v4.3.2
[INFO] [stderr]   Downloaded once_cell v1.18.0
[INFO] [stderr]   Downloaded unicode-ident v1.0.9
[INFO] [stderr]   Downloaded clap_builder v4.3.8
[INFO] [stderr]   Downloaded rustix v0.37.20
[INFO] [stderr]   Downloaded libc v0.2.146
[INFO] [stderr]   Downloaded errno v0.3.1
[INFO] [stderr]   Downloaded syn v2.0.22
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:4848fb76d95f26979359cc7e45710b1dbc8f3acb7aeedee7c460d7702230f228" "/opt/rustwide/cargo-home/bin/cargo" "+c90bcb9571b7aab0d8beaa2ce8a998ffaf079d38" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] cc6c3153b02331b96db3d137969f9303870248fa3c722ba2bf316a9dd29d2017
[INFO] running `Command { std: "docker" "start" "-a" "cc6c3153b02331b96db3d137969f9303870248fa3c722ba2bf316a9dd29d2017", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "cc6c3153b02331b96db3d137969f9303870248fa3c722ba2bf316a9dd29d2017", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "cc6c3153b02331b96db3d137969f9303870248fa3c722ba2bf316a9dd29d2017", kill_on_drop: false }`
[INFO] [stdout] cc6c3153b02331b96db3d137969f9303870248fa3c722ba2bf316a9dd29d2017
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:4848fb76d95f26979359cc7e45710b1dbc8f3acb7aeedee7c460d7702230f228" "/opt/rustwide/cargo-home/bin/cargo" "+c90bcb9571b7aab0d8beaa2ce8a998ffaf079d38" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 44f32cbaf3ae9d18102d9f0f93325fb933e1002b7d5b1ad4410d89d31968fab4
[INFO] running `Command { std: "docker" "start" "-a" "44f32cbaf3ae9d18102d9f0f93325fb933e1002b7d5b1ad4410d89d31968fab4", kill_on_drop: false }`
[INFO] [stderr]    Compiling libc v0.2.146
[INFO] [stderr]    Compiling io-lifetimes v1.0.11
[INFO] [stderr]    Compiling proc-macro2 v1.0.63
[INFO] [stderr]    Compiling rustix v0.37.20
[INFO] [stderr]    Compiling linux-raw-sys v0.3.8
[INFO] [stderr]    Compiling quote v1.0.28
[INFO] [stderr]    Compiling unicode-ident v1.0.9
[INFO] [stderr]    Compiling bitflags v1.3.2
[INFO] [stderr]    Compiling utf8parse v0.2.1
[INFO] [stderr]    Compiling anstyle v1.0.1
[INFO] [stderr]    Compiling anstyle-query v1.0.0
[INFO] [stderr]    Compiling radium v0.7.0
[INFO] [stderr]    Compiling colorchoice v1.0.0
[INFO] [stderr]    Compiling strsim v0.10.0
[INFO] [stderr]    Compiling ppv-lite86 v0.2.17
[INFO] [stderr]    Compiling heck v0.4.1
[INFO] [stderr]    Compiling clap_lex v0.5.0
[INFO] [stderr]    Compiling tap v1.0.1
[INFO] [stderr]    Compiling anstyle-parse v0.2.1
[INFO] [stderr]    Compiling wyz v0.5.1
[INFO] [stderr]    Compiling once_cell v1.18.0
[INFO] [stderr]    Compiling funty v2.0.0
[INFO] [stderr]    Compiling syn v2.0.22
[INFO] [stderr]    Compiling bitvec v1.0.1
[INFO] [stderr]    Compiling getrandom v0.2.10
[INFO] [stderr]    Compiling rand_core v0.6.4
[INFO] [stderr]    Compiling rand_chacha v0.3.1
[INFO] [stderr]    Compiling rand v0.8.5
[INFO] [stderr]    Compiling is-terminal v0.4.7
[INFO] [stderr]    Compiling anstream v0.3.2
[INFO] [stderr]    Compiling clap_builder v4.3.8
[INFO] [stderr]    Compiling clap_derive v4.3.2
[INFO] [stderr]    Compiling clap v4.3.8
[INFO] [stderr]    Compiling algods v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `FlowNetwork`
[INFO] [stdout]  --> src/graph/processing/search/shortest_path.rs:1:70
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::graph::{processing::TopologicalSort, EdgeWeightedDigraph, FlowNetwork, Weight};
[INFO] [stdout]   |                                                                      ^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `FordFulkerson` is never constructed
[INFO] [stdout]  --> src/graph/processing/maxflow_mincut.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub struct FordFulkerson<T>
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `has_augmenting_path`, `max_flow`, and `find_flows` are never used
[INFO] [stdout]   --> src/graph/processing/maxflow_mincut.rs:17:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl<T: Weight> FordFulkerson<T> {
[INFO] [stdout]    | -------------------------------- associated items in this implementation
[INFO] [stdout] 17 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn has_augmenting_path(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51 |     pub fn max_flow(&self) -> Option<T> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 54 |     fn find_flows(&mut self, network: &mut FlowNetwork<T>, source: usize, destination: usize) {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `halve` is never used
[INFO] [stdout]   --> src/data_structure/hash_table.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl<T, U> SepChainTable<T, U> {
[INFO] [stdout]    | ------------------------------ method in this implementation
[INFO] [stdout] 32 |     fn halve(&mut self) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `double` is never used
[INFO] [stdout]   --> src/data_structure/hash_table.rs:62:8
[INFO] [stdout]    |
[INFO] [stdout] 61 | impl<T: Clone, U: Clone> SepChainTable<T, U> {
[INFO] [stdout]    | -------------------------------------------- method in this implementation
[INFO] [stdout] 62 |     fn double(&mut self) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `first_mut` is never used
[INFO] [stdout]    --> src/data_structure/tree_table.rs:695:12
[INFO] [stdout]     |
[INFO] [stdout] 682 | impl<T, U> Pair<T, U> {
[INFO] [stdout]     | --------------------- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 695 |     pub fn first_mut(&mut self) -> &mut T {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/utils/percolation.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Percolation {
[INFO] [stdout]    | ---------------- associated function in this implementation
[INFO] [stdout] 23 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `intersects` is never used
[INFO] [stdout]    --> src/utils/point.rs:254:8
[INFO] [stdout]     |
[INFO] [stdout] 253 | impl<T: Clone + ToString> Segment<T> {
[INFO] [stdout]     | ------------------------------------ method in this implementation
[INFO] [stdout] 254 |     fn intersects(&self, other: &Self) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 14.45s
[INFO] running `Command { std: "docker" "inspect" "44f32cbaf3ae9d18102d9f0f93325fb933e1002b7d5b1ad4410d89d31968fab4", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "44f32cbaf3ae9d18102d9f0f93325fb933e1002b7d5b1ad4410d89d31968fab4", kill_on_drop: false }`
[INFO] [stdout] 44f32cbaf3ae9d18102d9f0f93325fb933e1002b7d5b1ad4410d89d31968fab4
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:4848fb76d95f26979359cc7e45710b1dbc8f3acb7aeedee7c460d7702230f228" "/opt/rustwide/cargo-home/bin/cargo" "+c90bcb9571b7aab0d8beaa2ce8a998ffaf079d38" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 4125b7582d35763ac4dd0b36c47503d55e987169a056083b71b118584b541fa1
[INFO] running `Command { std: "docker" "start" "-a" "4125b7582d35763ac4dd0b36c47503d55e987169a056083b71b118584b541fa1", kill_on_drop: false }`
[INFO] [stderr]    Compiling algods v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `FlowNetwork`
[INFO] [stdout]  --> src/graph/processing/search/shortest_path.rs:1:70
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::graph::{processing::TopologicalSort, EdgeWeightedDigraph, FlowNetwork, Weight};
[INFO] [stdout]   |                                                                      ^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `FordFulkerson` is never constructed
[INFO] [stdout]  --> src/graph/processing/maxflow_mincut.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 9 | pub struct FordFulkerson<T>
[INFO] [stdout]   |            ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `has_augmenting_path`, `max_flow`, and `find_flows` are never used
[INFO] [stdout]   --> src/graph/processing/maxflow_mincut.rs:17:12
[INFO] [stdout]    |
[INFO] [stdout] 16 | impl<T: Weight> FordFulkerson<T> {
[INFO] [stdout]    | -------------------------------- associated items in this implementation
[INFO] [stdout] 17 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 21 |     fn has_augmenting_path(
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 51 |     pub fn max_flow(&self) -> Option<T> {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 54 |     fn find_flows(&mut self, network: &mut FlowNetwork<T>, source: usize, destination: usize) {
[INFO] [stdout]    |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `halve` is never used
[INFO] [stdout]   --> src/data_structure/hash_table.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl<T, U> SepChainTable<T, U> {
[INFO] [stdout]    | ------------------------------ method in this implementation
[INFO] [stdout] 32 |     fn halve(&mut self) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `double` is never used
[INFO] [stdout]   --> src/data_structure/hash_table.rs:62:8
[INFO] [stdout]    |
[INFO] [stdout] 61 | impl<T: Clone, U: Clone> SepChainTable<T, U> {
[INFO] [stdout]    | -------------------------------------------- method in this implementation
[INFO] [stdout] 62 |     fn double(&mut self) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `first_mut` is never used
[INFO] [stdout]    --> src/data_structure/tree_table.rs:695:12
[INFO] [stdout]     |
[INFO] [stdout] 682 | impl<T, U> Pair<T, U> {
[INFO] [stdout]     | --------------------- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 695 |     pub fn first_mut(&mut self) -> &mut T {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/utils/percolation.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Percolation {
[INFO] [stdout]    | ---------------- associated function in this implementation
[INFO] [stdout] 23 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `intersects` is never used
[INFO] [stdout]    --> src/utils/point.rs:254:8
[INFO] [stdout]     |
[INFO] [stdout] 253 | impl<T: Clone + ToString> Segment<T> {
[INFO] [stdout]     | ------------------------------------ method in this implementation
[INFO] [stdout] 254 |     fn intersects(&self, other: &Self) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `FlowNetwork`
[INFO] [stdout]  --> src/graph/processing/search/shortest_path.rs:1:70
[INFO] [stdout]   |
[INFO] [stdout] 1 | use crate::graph::{processing::TopologicalSort, EdgeWeightedDigraph, FlowNetwork, Weight};
[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 variable: `init_len`
[INFO] [stdout]   --> src/compression/unit_test.rs:29:31
[INFO] [stdout]    |
[INFO] [stdout] 29 |         let (compressed_bits, init_len) = run_length.compress();
[INFO] [stdout]    |                               ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_init_len`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `halve` is never used
[INFO] [stdout]   --> src/data_structure/hash_table.rs:32:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | impl<T, U> SepChainTable<T, U> {
[INFO] [stdout]    | ------------------------------ method in this implementation
[INFO] [stdout] 32 |     fn halve(&mut self) {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `double` is never used
[INFO] [stdout]   --> src/data_structure/hash_table.rs:62:8
[INFO] [stdout]    |
[INFO] [stdout] 61 | impl<T: Clone, U: Clone> SepChainTable<T, U> {
[INFO] [stdout]    | -------------------------------------------- method in this implementation
[INFO] [stdout] 62 |     fn double(&mut self) {
[INFO] [stdout]    |        ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `first_mut` is never used
[INFO] [stdout]    --> src/data_structure/tree_table.rs:695:12
[INFO] [stdout]     |
[INFO] [stdout] 682 | impl<T, U> Pair<T, U> {
[INFO] [stdout]     | --------------------- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 695 |     pub fn first_mut(&mut self) -> &mut T {
[INFO] [stdout]     |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/utils/percolation.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Percolation {
[INFO] [stdout]    | ---------------- associated function in this implementation
[INFO] [stdout] 23 |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `intersects` is never used
[INFO] [stdout]    --> src/utils/point.rs:254:8
[INFO] [stdout]     |
[INFO] [stdout] 253 | impl<T: Clone + ToString> Segment<T> {
[INFO] [stdout]     | ------------------------------------ method in this implementation
[INFO] [stdout] 254 |     fn intersects(&self, other: &Self) -> bool {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 3.16s
[INFO] running `Command { std: "docker" "inspect" "4125b7582d35763ac4dd0b36c47503d55e987169a056083b71b118584b541fa1", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "4125b7582d35763ac4dd0b36c47503d55e987169a056083b71b118584b541fa1", kill_on_drop: false }`
[INFO] [stdout] 4125b7582d35763ac4dd0b36c47503d55e987169a056083b71b118584b541fa1
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:4848fb76d95f26979359cc7e45710b1dbc8f3acb7aeedee7c460d7702230f228" "/opt/rustwide/cargo-home/bin/cargo" "+c90bcb9571b7aab0d8beaa2ce8a998ffaf079d38" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] 7be2297c8da8e785ca91b7e7de15013d90e90ae58bffafe3481dc808e3457997
[INFO] running `Command { std: "docker" "start" "-a" "7be2297c8da8e785ca91b7e7de15013d90e90ae58bffafe3481dc808e3457997", kill_on_drop: false }`
[INFO] [stderr] warning: unused import: `FlowNetwork`
[INFO] [stderr]  --> src/graph/processing/search/shortest_path.rs:1:70
[INFO] [stderr]   |
[INFO] [stderr] 1 | use crate::graph::{processing::TopologicalSort, EdgeWeightedDigraph, FlowNetwork, Weight};
[INFO] [stderr]   |                                                                      ^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: struct `FordFulkerson` is never constructed
[INFO] [stderr]  --> src/graph/processing/maxflow_mincut.rs:9:12
[INFO] [stderr]   |
[INFO] [stderr] 9 | pub struct FordFulkerson<T>
[INFO] [stderr]   |            ^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `has_augmenting_path`, `max_flow`, and `find_flows` are never used
[INFO] [stderr]   --> src/graph/processing/maxflow_mincut.rs:17:12
[INFO] [stderr]    |
[INFO] [stderr] 16 | impl<T: Weight> FordFulkerson<T> {
[INFO] [stderr]    | -------------------------------- associated items in this implementation
[INFO] [stderr] 17 |     pub fn new() -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] ...
[INFO] [stderr] 21 |     fn has_augmenting_path(
[INFO] [stderr]    |        ^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 51 |     pub fn max_flow(&self) -> Option<T> {
[INFO] [stderr]    |            ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 54 |     fn find_flows(&mut self, network: &mut FlowNetwork<T>, source: usize, destination: usize) {
[INFO] [stderr]    |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method `halve` is never used
[INFO] [stderr]   --> src/data_structure/hash_table.rs:32:8
[INFO] [stderr]    |
[INFO] [stderr] 31 | impl<T, U> SepChainTable<T, U> {
[INFO] [stderr]    | ------------------------------ method in this implementation
[INFO] [stderr] 32 |     fn halve(&mut self) {
[INFO] [stderr]    |        ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method `double` is never used
[INFO] [stderr]   --> src/data_structure/hash_table.rs:62:8
[INFO] [stderr]    |
[INFO] [stderr] 61 | impl<T: Clone, U: Clone> SepChainTable<T, U> {
[INFO] [stderr]    | -------------------------------------------- method in this implementation
[INFO] [stderr] 62 |     fn double(&mut self) {
[INFO] [stderr]    |        ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method `first_mut` is never used
[INFO] [stderr]    --> src/data_structure/tree_table.rs:695:12
[INFO] [stderr]     |
[INFO] [stderr] 682 | impl<T, U> Pair<T, U> {
[INFO] [stderr]     | --------------------- method in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 695 |     pub fn first_mut(&mut self) -> &mut T {
[INFO] [stderr]     |            ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/utils/percolation.rs:23:12
[INFO] [stderr]    |
[INFO] [stderr] 22 | impl Percolation {
[INFO] [stderr]    | ---------------- associated function in this implementation
[INFO] [stderr] 23 |     pub fn new() -> Self {
[INFO] [stderr]    |            ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method `intersects` is never used
[INFO] [stderr]    --> src/utils/point.rs:254:8
[INFO] [stderr]     |
[INFO] [stderr] 253 | impl<T: Clone + ToString> Segment<T> {
[INFO] [stderr]     | ------------------------------------ method in this implementation
[INFO] [stderr] 254 |     fn intersects(&self, other: &Self) -> bool {
[INFO] [stderr]     |        ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `algods` (lib) generated 8 warnings (run `cargo fix --lib -p algods` to apply 1 suggestion)
[INFO] [stderr] warning: unused variable: `init_len`
[INFO] [stderr]   --> src/compression/unit_test.rs:29:31
[INFO] [stderr]    |
[INFO] [stderr] 29 |         let (compressed_bits, init_len) = run_length.compress();
[INFO] [stderr]    |                               ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_init_len`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: method `halve` is never used
[INFO] [stderr]   --> src/data_structure/hash_table.rs:32:8
[INFO] [stderr]    |
[INFO] [stderr] 31 | impl<T, U> SepChainTable<T, U> {
[INFO] [stderr]    | ------------------------------ method in this implementation
[INFO] [stderr] 32 |     fn halve(&mut self) {
[INFO] [stderr]    |        ^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: `algods` (lib test) generated 7 warnings (5 duplicates) (run `cargo fix --lib -p algods --tests` 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/algods-88c22429c1dba6a4)
[INFO] [stdout] 
[INFO] [stdout] running 67 tests
[INFO] [stdout] test compression::unit_test::tests::test_compress ... ok
[INFO] [stdout] test data_structure::deque::unit_test::tests::test_linked_list_deque_init ... ok
[INFO] [stdout] test data_structure::hash_table::unit_test::tests::test_separate_chaining_symbol_table ... ok
[INFO] [stdout] test data_structure::queue::unit_test::tests::test_linked_list_queue_enqueue ... ok
[INFO] [stdout] test compression::unit_test::tests::test_mutate ... ok
[INFO] [stdout] test data_structure::queue::unit_test::tests::test_linked_list_queue_new ... ok
[INFO] [stdout] test compression::unit_test::tests::test_expand ... ok
[INFO] [stdout] test data_structure::queue::unit_test::tests::test_linked_list_queue_dequeue ... ok
[INFO] [stdout] test data_structure::stack::unit_test::tests::test_linked_list_stack_new ... ok
[INFO] [stdout] test data_structure::stack::unit_test::tests::test_linked_list_stack_init ... ok
[INFO] [stdout] test data_structure::stack::unit_test::tests::test_linked_list_stack_pop ... ok
[INFO] [stdout] test data_structure::stack::unit_test::tests::test_linked_list_stack_push ... ok
[INFO] [stdout] test data_structure::stack::unit_test::tests::test_stack_is_empty ... ok
[INFO] [stdout] test data_structure::stack::unit_test::tests::test_vec_stack_is_empty ... ok
[INFO] [stdout] test data_structure::stack::unit_test::tests::test_vec_stack_pop ... ok
[INFO] [stdout] test data_structure::stack::unit_test::tests::test_vec_stack_push ... ok
[INFO] [stdout] test data_structure::stack::unit_test::tests::test_vec_stack_resize ... ok
[INFO] [stdout] test data_structure::stack::unit_test::tests::test_vec_stack_with_capacity ... ok
[INFO] [stdout] test data_structure::tree_table::unit_test::tests::test_b_tree_symbol_table ... ok
[INFO] [stdout] test data_structure::stack::unit_test::tests::test_stack_push ... ok
[INFO] [stdout] test data_structure::tree_table::unit_test::tests::test_ordered_vec_symbol_table ... ok
[INFO] [stdout] test data_structure::tree_table::unit_test::tests::test_binary_search_tree ... ok
[INFO] [stdout] test graph::directed_graph::unit_test::tests::test_directed_graph ... ok
[INFO] [stdout] test graph::directed_graph::unit_test::tests::test_edge_weighted_directed_graph ... ok
[INFO] [stdout] test graph::directed_graph::unit_test::tests::test_bfs ... ok
[INFO] [stdout] test graph::directed_graph::unit_test::tests::test_topological_sort ... ok
[INFO] [stdout] test graph::processing::maxflow_mincut::unit_test::tests::test_ford_fulkerson ... ok
[INFO] [stdout] test graph::processing::search::unit_test::tests::test_dijkstra ... ok
[INFO] [stdout] test graph::processing::search::unit_test::tests::test_shortest_path_ewdag ... ok
[INFO] [stdout] test graph::undirected_graph::unit_test::tests::test_bfs ... ok
[INFO] [stdout] test graph::undirected_graph::unit_test::tests::test_connected_components ... ok
[INFO] [stdout] test graph::undirected_graph::unit_test::tests::test_dfs ... ok
[INFO] [stdout] test graph::undirected_graph::unit_test::tests::test_undirected_graph ... ok
[INFO] [stdout] test data_structure::stack::unit_test::tests::test_stack_pop - should panic ... ok
[INFO] [stdout] test data_structure::stack::unit_test::tests::test_vec_stack_pop_panic - should panic ... ok
[INFO] [stdout] test data_structure::stack::unit_test::tests::test_vec_stack_with_capacity_panic - should panic ... ok
[INFO] [stdout] test graph::directed_graph::unit_test::tests::test_directed_graph_panic2 - should panic ... ok
[INFO] [stdout] test search::union_find::algorithm::unit_test::tests::test_parse_str_to_algo ... ok
[INFO] [stdout] test search::union_find::unit_test::tests::test_init ... ok
[INFO] [stdout] test graph::directed_graph::unit_test::tests::test_directed_graph_panic1 - should panic ... ok
[INFO] [stdout] test graph::undirected_graph::unit_test::tests::test_undirected_graph_panic1 - should panic ... ok
[INFO] [stdout] test graph::undirected_graph::unit_test::tests::test_undirected_graph_panic2 - should panic ... ok
[INFO] [stdout] test search::union_find::algorithm::unit_test::tests::test_algo_format ... ok
[INFO] [stdout] test search::union_find::unit_test::tests::test_new ... ok
[INFO] [stdout] test sort::merge_sort::algorithm::unit_test::tests::test_algo_format ... ok
[INFO] [stdout] test sort::merge_sort::algorithm::unit_test::tests::test_parse_str_to_algo ... ok
[INFO] [stdout] test data_structure::deque::unit_test::tests::test_linked_list_deque_mutations ... ok
[INFO] [stdout] test data_structure::deque::unit_test::tests::test_linked_list_deque_new ... ok
[INFO] [stdout] test data_structure::queue::unit_test::tests::test_linked_list_queue_init ... ok
[INFO] [stdout] test utils::calculator::unit_test::tests::test_calculator ... ok
[INFO] [stdout] test data_structure::stack::unit_test::tests::test_stack_init ... ok
[INFO] [stdout] test graph::directed_graph::unit_test::tests::test_dfs ... ok
[INFO] [stdout] test graph::directed_graph::unit_test::tests::test_strong_connected_components ... ok
[INFO] [stdout] test search::union_find::unit_test::tests::test_root_connected_union ... ok
[INFO] [stdout] test sort::quick_sort::unit_test::tests::test_quick_select ... ok
[INFO] [stdout] test utils::percolation::unit_test::tests::test_percolation ... ok
[INFO] [stdout] test sort::quick_sort::unit_test::tests::test_quick_sort ... ok
[INFO] [stdout] test sort::insertion_sort::unit_test::tests::test_insertion_sort ... ok
[INFO] [stdout] test data_structure::priority_queue::unit_test::tests::test_init_priority_queue - should panic ... ok
[INFO] [stdout] test sort::merge_sort::unit_test::tests::test_merge_sort ... ok
[INFO] [stdout] test utils::threesum::unit_test::tests::test_threesum ... ok
[INFO] [stdout] test sort::heap_sort::unit_test::tests::test_binary_heap_sort ... ok
[INFO] [stdout] test sort::heap_sort::unit_test::tests::test_heap_sort ... ok
[INFO] [stdout] test data_structure::priority_queue::unit_test::tests::test_max_priority_queue ... ok
[INFO] [stdout] test data_structure::priority_queue::unit_test::tests::test_min_priority_queue ... ok
[INFO] [stdout] test search::binary_search::unit_test::tests::test_binary_search ... ok
[INFO] [stdout] test data_structure::priority_queue::unit_test::tests::test_binary_heap_priority_queue ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 67 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 10.41s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests algods
[INFO] [stdout] 
[INFO] [stdout] running 138 tests
[INFO] [stdout] test src/data_structure/deque.rs - data_structure::deque::Deque<T>::add_first (line 78) ... ok
[INFO] [stdout] test src/compression.rs - compression::RunLength<T,O>::new (line 25) ... ok
[INFO] [stdout] test src/data_structure/deque.rs - data_structure::deque::Deque<T>::add_last (line 91) ... ok
[INFO] [stdout] test src/data_structure/deque.rs - data_structure::deque::Deque<T>::new (line 28) ... ok
[INFO] [stdout] test src/compression.rs - compression::RunLength<T,O>::from_file (line 161) ... ok
[INFO] [stdout] test src/data_structure/deque.rs - data_structure::deque::Deque (line 8) ... ok
[INFO] [stdout] test src/compression.rs - compression::RunLength<T,O>::init (line 48) ... ok
[INFO] [stdout] test src/data_structure/deque.rs - data_structure::deque::Deque<T>::init (line 41) ... ok
[INFO] [stdout] test src/data_structure/deque.rs - data_structure::deque::Deque<T>::is_empty (line 56) ... ok
[INFO] [stdout] test src/data_structure/hash_table.rs - data_structure::hash_table::SepChainTable<T,U>::init (line 104) ... ok
[INFO] [stdout] test src/data_structure/hash_table.rs - data_structure::hash_table::SepChainTable<T,U>::get (line 173) ... ok
[INFO] [stdout] test src/data_structure/deque.rs - data_structure::deque::Deque<T>::len (line 67) ... ok
[INFO] [stdout] test src/data_structure/deque.rs - data_structure::deque::Deque<T>::remove_first (line 105) ... ok
[INFO] [stdout] test src/data_structure/hash_table.rs - data_structure::hash_table::SepChainTable<T,U>::insert (line 125) ... ok
[INFO] [stdout] test src/compression.rs - compression::RunLength<T,O>::bits (line 59) ... ok
[INFO] [stdout] test src/compression.rs - compression::RunLength<T,O>::compress (line 98) ... ok
[INFO] [stdout] test src/data_structure/hash_table.rs - data_structure::hash_table::SepChainTable (line 9) ... ok
[INFO] [stdout] test src/data_structure/deque.rs - data_structure::deque::Deque<T>::remove_last (line 119) ... ok
[INFO] [stdout] test src/data_structure/hash_table.rs - data_structure::hash_table::SepChainTable<T,U>::len (line 39) ... ok
[INFO] [stdout] test src/data_structure/hash_table.rs - data_structure::hash_table::SepChainTable<T,U>::contains (line 160) ... ok
[INFO] [stdout] test src/data_structure/priority_queue.rs - data_structure::priority_queue::BinaryHeapQueue (line 10) ... ok
[INFO] [stdout] test src/data_structure/hash_table.rs - data_structure::hash_table::SepChainTable<T,U>::new (line 89) ... ok
[INFO] [stdout] test src/compression.rs - compression::RunLength<T,O>::push (line 71) ... ok
[INFO] [stdout] test src/data_structure/hash_table.rs - data_structure::hash_table::SepChainTable<T,U>::is_empty (line 51) ... ok
[INFO] [stdout] test src/compression.rs - compression::RunLength<T,O>::expand (line 132) ... ok
[INFO] [stdout] test src/data_structure/priority_queue.rs - data_structure::priority_queue::BinaryHeapQueue<T>::insert (line 88) ... ok
[INFO] [stdout] test src/data_structure/priority_queue.rs - data_structure::priority_queue::BinaryHeapQueue<T>::delete (line 103) ... ok
[INFO] [stdout] test src/data_structure/priority_queue.rs - data_structure::priority_queue::BinaryHeapQueue<T>::is_empty (line 62) ... ok
[INFO] [stdout] test src/data_structure/priority_queue.rs - data_structure::priority_queue::BinaryHeapQueue<T>::len (line 74) ... ok
[INFO] [stdout] test src/compression.rs - compression::RunLength<T,O>::extend_from_raw_slice (line 84) ... ok
[INFO] [stdout] test src/data_structure/priority_queue.rs - data_structure::priority_queue::PriorityQueue<T>::extremum (line 224) ... ok
[INFO] [stdout] test src/data_structure/priority_queue.rs - data_structure::priority_queue::BinaryHeapQueue<T>::new (line 36) ... ok
[INFO] [stdout] test src/data_structure/priority_queue.rs - data_structure::priority_queue::BinaryHeapQueue<T>::extremum (line 118) ... ok
[INFO] [stdout] test src/data_structure/priority_queue.rs - data_structure::priority_queue::PriorityQueue<T>::len (line 206) ... ok
[INFO] [stdout] test src/data_structure/priority_queue.rs - data_structure::priority_queue::PriorityQueue (line 134) ... ok
[INFO] [stdout] test src/data_structure/priority_queue.rs - data_structure::priority_queue::PriorityQueue<T>::is_empty (line 194) ... ok
[INFO] [stdout] test src/data_structure/queue.rs - data_structure::queue::Queue<T>::dequeue (line 81) ... ok
[INFO] [stdout] test src/compression.rs - compression::RunLength<T,O>::len (line 37) ... ok
[INFO] [stdout] test src/data_structure/queue.rs - data_structure::queue::Queue<T>::is_empty (line 58) ... ok
[INFO] [stdout] test src/data_structure/priority_queue.rs - data_structure::priority_queue::PriorityQueue<T>::insert (line 280) ... ok
[INFO] [stdout] test src/data_structure/queue.rs - data_structure::queue::Queue<T>::len (line 69) ... ok
[INFO] [stdout] test src/data_structure/queue.rs - data_structure::queue::Queue<T>::enqueue (line 92) ... ok
[INFO] [stdout] test src/data_structure/priority_queue.rs - data_structure::priority_queue::PriorityQueue<T>::delete (line 356) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::ListStack<T>::len (line 245) ... ok
[INFO] [stdout] test src/data_structure/queue.rs - data_structure::queue::Queue<T>::init (line 43) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::ListStack (line 183) ... ok
[INFO] [stdout] test src/data_structure/queue.rs - data_structure::queue::Queue (line 10) ... ok
[INFO] [stdout] test src/data_structure/priority_queue.rs - data_structure::priority_queue::PriorityQueue<T>::with_capacity (line 169) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::ListStack<T>::init (line 219) ... ok
[INFO] [stdout] test src/data_structure/priority_queue.rs - data_structure::priority_queue::BinaryHeapQueue<T>::with_capacity (line 49) ... ok
[INFO] [stdout] test src/data_structure/queue.rs - data_structure::queue::Queue<T>::new (line 30) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::ListStack<T>::new (line 206) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::ListStack<T>::push (line 268) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::ListStack<T>::pop (line 257) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::ListStack<T>::is_empty (line 234) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::Stack<T>::first_mut (line 98) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::VecStack<T>::is_empty (line 346) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::Stack<T>::is_empty (line 113) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::Stack<T>::init (line 67) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::Stack<T>::first (line 87) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::Stack<T>::new (line 52) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::Stack<T>::pop (line 141) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::Stack (line 32) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::VecStack (line 283) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::VecStack<T>::with_capacity (line 325) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BSearchTree<T,U>::get (line 293) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::VecStack<T>::len (line 358) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BSearchTree<T,U>::len (line 259) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::Stack<T>::push (line 162) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BSearchTree<T,U>::max (line 375) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::Stack<T>::len (line 125) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BSearchTree<T,U>::init (line 246) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::VecStack<T>::push (line 369) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BSearchTree (line 213) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::VecStack<T>::new (line 309) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BSearchTree<T,U>::insert (line 336) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BSearchTree<T,U>::contains (line 282) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BSearchTree<T,U>::floor (line 417) ... ok
[INFO] [stdout] test src/data_structure/stack.rs - data_structure::stack::VecStack<T>::pop (line 397) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BSearchTree<T,U>::is_empty (line 269) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BSearchTree<T,U>::new (line 236) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BTreeTable<T,U>::new (line 49) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BSearchTree<T,U>::min (line 354) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BTreeTable<T,U>::len (line 37) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::OrdVecTable (line 438) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BTreeTable<T,U>::ceil (line 141) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BTreeTable<T,U>::delete (line 110) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BTreeTable (line 8) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BTreeTable<T,U>::insert (line 95) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BTreeTable<T,U>::is_empty (line 26) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BTreeTable<T,U>::contains (line 73) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BTreeTable<T,U>::strict_floor (line 123) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BTreeTable<T,U>::range_count (line 179) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::OrdVecTable<T,U>::contains (line 533) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::OrdVecTable<T,U>::get (line 545) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BTreeTable<T,U>::init (line 61) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::OrdVecTable<T,U>::delete (line 664) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::OrdVecTable<T,U>::is_empty (line 488) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::OrdVecTable<T,U>::ceil (line 590) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::OrdVecTable<T,U>::len (line 478) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::OrdVecTable<T,U>::floor (line 561) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::OrdVecTable<T,U>::min (line 499) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::OrdVecTable<T,U>::init (line 466) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BTreeTable<T,U>::get (line 84) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::UnordVecTable<T,U>::is_empty (line 771) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::UnordVecTable<T,U>::get (line 799) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::BTreeTable<T,U>::range_search (line 161) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::OrdVecTable<T,U>::insert (line 648) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::OrdVecTable<T,U>::new (line 456) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::UnordVecTable<T,U>::init (line 749) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::UnordVecTable<T,U>::new (line 739) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::OrdVecTable<T,U>::max (line 515) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::UnordVecTable<T,U>::contains (line 784) ... ok
[INFO] [stdout] test src/search/union_find.rs - search::union_find::UnionFind (line 10) ... ok
[INFO] [stdout] test src/search/union_find.rs - search::union_find::UnionFind::is_empty (line 103) ... ok
[INFO] [stdout] test src/search/union_find.rs - search::union_find::UnionFind::algo (line 81) ... ok
[INFO] [stdout] test src/search/union_find.rs - search::union_find::UnionFind::root (line 161) ... ok
[INFO] [stdout] test src/search/union_find.rs - search::union_find::UnionFind::len (line 92) ... ok
[INFO] [stdout] test src/search/union_find.rs - search::union_find::UnionFind::connected (line 193) ... ok
[INFO] [stdout] test src/graph/directed_graph.rs - graph::directed_graph::DirectedGraph (line 29) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::UnordVecTable<T,U>::delete (line 854) ... ok
[INFO] [stdout] test src/search/union_find.rs - search::union_find::UnionFind::new (line 45) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::UnordVecTable<T,U>::insert (line 836) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::UnordVecTable (line 722) ... ok
[INFO] [stdout] test src/search/union_find.rs - search::union_find::UnionFind::union (line 217) ... ok
[INFO] [stdout] test src/sort/heap_sort.rs - sort::heap_sort::HeapSort<T>::init (line 45) ... ok
[INFO] [stdout] test src/data_structure/tree_table.rs - data_structure::tree_table::UnordVecTable<T,U>::len (line 761) ... ok
[INFO] [stdout] test src/sort/heap_sort.rs - sort::heap_sort::HeapSort<T>::into_sorted_vec (line 102) ... ok
[INFO] [stdout] test src/sort/merge_sort.rs - sort::merge_sort::MergeSort<T>::init (line 20) ... ok
[INFO] [stdout] test src/search/union_find.rs - search::union_find::UnionFind::from_file (line 117) ... ok
[INFO] [stdout] test src/sort/quick_sort.rs - sort::quick_sort::QuickSort<T>::init (line 18) ... ok
[INFO] [stdout] test src/sort/heap_sort.rs - sort::heap_sort::BinaryHeapSort<T>::into_sorted_vec (line 25) ... ok
[INFO] [stdout] test src/sort/heap_sort.rs - sort::heap_sort::BinaryHeapSort<T>::init (line 14) ... ok
[INFO] [stdout] test src/sort/insertion_sort.rs - sort::insertion_sort::InsertionSort<T>::init (line 13) ... ok
[INFO] [stdout] test src/sort/insertion_sort.rs - sort::insertion_sort::InsertionSort<T>::into_sorted_vec (line 22) ... ok
[INFO] [stdout] test src/sort/quick_sort.rs - sort::quick_sort::QuickSort<T>::into_sorted_vec (line 85) ... ok
[INFO] [stdout] test src/sort/quick_sort.rs - sort::quick_sort::QuickSort<T>::select (line 99) ... ok
[INFO] [stdout] test src/sort/merge_sort.rs - sort::merge_sort::MergeSort<T>::into_sorted_vec (line 81) ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 138 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 7.22s
[INFO] [stdout] 
[INFO] running `Command { std: "docker" "inspect" "7be2297c8da8e785ca91b7e7de15013d90e90ae58bffafe3481dc808e3457997", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "7be2297c8da8e785ca91b7e7de15013d90e90ae58bffafe3481dc808e3457997", kill_on_drop: false }`
[INFO] [stdout] 7be2297c8da8e785ca91b7e7de15013d90e90ae58bffafe3481dc808e3457997
