[INFO] fetching crate rudac 0.8.3...
[INFO] testing rudac-0.8.3 against beta-2022-02-22 for beta-1.60-1
[INFO] extracting crate rudac 0.8.3 into /workspace/builds/worker-2/source
[INFO] validating manifest of crates.io crate rudac 0.8.3 on toolchain beta-2022-02-22
[INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+beta-2022-02-22" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] started tweaking crates.io crate rudac 0.8.3
[INFO] finished tweaking crates.io crate rudac 0.8.3
[INFO] tweaked toml for crates.io crate rudac 0.8.3 written to /workspace/builds/worker-2/source/Cargo.toml
[INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+beta-2022-02-22" "generate-lockfile" "--manifest-path" "Cargo.toml" "-Zno-index-update", kill_on_drop: false }`
[INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+beta-2022-02-22" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/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:0cd99ca24d8e8c98e67c542213511d985b8778b5bdcbb160e038429496686047" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2022-02-22" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap.
[INFO] [stdout] 5ca0f6e1a0b8d20c7e4f6e8196fb2334e011f371fcb8b1dda435b315a7140870
[INFO] running `Command { std: "docker" "start" "-a" "5ca0f6e1a0b8d20c7e4f6e8196fb2334e011f371fcb8b1dda435b315a7140870", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "5ca0f6e1a0b8d20c7e4f6e8196fb2334e011f371fcb8b1dda435b315a7140870", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "5ca0f6e1a0b8d20c7e4f6e8196fb2334e011f371fcb8b1dda435b315a7140870", kill_on_drop: false }`
[INFO] [stdout] 5ca0f6e1a0b8d20c7e4f6e8196fb2334e011f371fcb8b1dda435b315a7140870
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/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=warn" "-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:0cd99ca24d8e8c98e67c542213511d985b8778b5bdcbb160e038429496686047" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2022-02-22" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap.
[INFO] [stdout] 06718e664328629f4a2dffee75648dd0dbabf85f895ff7a989f41396c1642ccc
[INFO] running `Command { std: "docker" "start" "-a" "06718e664328629f4a2dffee75648dd0dbabf85f895ff7a989f41396c1642ccc", kill_on_drop: false }`
[INFO] [stderr]    Compiling rudac v0.8.3 (/opt/rustwide/workdir)
[INFO] [stderr]     Finished dev [unoptimized + debuginfo] target(s) in 1.98s
[INFO] running `Command { std: "docker" "inspect" "06718e664328629f4a2dffee75648dd0dbabf85f895ff7a989f41396c1642ccc", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "06718e664328629f4a2dffee75648dd0dbabf85f895ff7a989f41396c1642ccc", kill_on_drop: false }`
[INFO] [stdout] 06718e664328629f4a2dffee75648dd0dbabf85f895ff7a989f41396c1642ccc
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/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=warn" "-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:0cd99ca24d8e8c98e67c542213511d985b8778b5bdcbb160e038429496686047" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2022-02-22" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] bacdbc93bbc8f52060f9137dd6eca92e89a734a88e3c03539246af3fda3adc17
[INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap.
[INFO] running `Command { std: "docker" "start" "-a" "bacdbc93bbc8f52060f9137dd6eca92e89a734a88e3c03539246af3fda3adc17", kill_on_drop: false }`
[INFO] [stderr]    Compiling rudac v0.8.3 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused borrow that must be used
[INFO] [stdout]    --> src/queue/circular.rs:566:9
[INFO] [stdout]     |
[INFO] [stdout] 566 |         &vc[0];
[INFO] [stdout]     |         ^^^^^^ the borrow produces a value
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_must_use)]` on by default
[INFO] [stdout] help: use `let _ = ...` to ignore the resulting value
[INFO] [stdout]     |
[INFO] [stdout] 566 |         let _ = &vc[0];
[INFO] [stdout]     |         +++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused borrow that must be used
[INFO] [stdout]    --> src/queue/circular.rs:574:9
[INFO] [stdout]     |
[INFO] [stdout] 574 |         &vc[0];
[INFO] [stdout]     |         ^^^^^^ the borrow produces a value
[INFO] [stdout]     |
[INFO] [stdout] help: use `let _ = ...` to ignore the resulting value
[INFO] [stdout]     |
[INFO] [stdout] 574 |         let _ = &vc[0];
[INFO] [stdout]     |         +++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused borrow that must be used
[INFO] [stdout]    --> src/queue/circular.rs:584:9
[INFO] [stdout]     |
[INFO] [stdout] 584 |         &vc[1];
[INFO] [stdout]     |         ^^^^^^ the borrow produces a value
[INFO] [stdout]     |
[INFO] [stdout] help: use `let _ = ...` to ignore the resulting value
[INFO] [stdout]     |
[INFO] [stdout] 584 |         let _ = &vc[1];
[INFO] [stdout]     |         +++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused borrow that must be used
[INFO] [stdout]    --> src/queue/circular.rs:596:9
[INFO] [stdout]     |
[INFO] [stdout] 596 |         &vc[3];
[INFO] [stdout]     |         ^^^^^^ the borrow produces a value
[INFO] [stdout]     |
[INFO] [stdout] help: use `let _ = ...` to ignore the resulting value
[INFO] [stdout]     |
[INFO] [stdout] 596 |         let _ = &vc[3];
[INFO] [stdout]     |         +++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused borrow that must be used
[INFO] [stdout]    --> src/queue/circular.rs:609:9
[INFO] [stdout]     |
[INFO] [stdout] 609 |         &vc[3];
[INFO] [stdout]     |         ^^^^^^ the borrow produces a value
[INFO] [stdout]     |
[INFO] [stdout] help: use `let _ = ...` to ignore the resulting value
[INFO] [stdout]     |
[INFO] [stdout] 609 |         let _ = &vc[3];
[INFO] [stdout]     |         +++++++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 5 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished test [unoptimized + debuginfo] target(s) in 4.50s
[INFO] running `Command { std: "docker" "inspect" "bacdbc93bbc8f52060f9137dd6eca92e89a734a88e3c03539246af3fda3adc17", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "bacdbc93bbc8f52060f9137dd6eca92e89a734a88e3c03539246af3fda3adc17", kill_on_drop: false }`
[INFO] [stdout] bacdbc93bbc8f52060f9137dd6eca92e89a734a88e3c03539246af3fda3adc17
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/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=warn" "-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:0cd99ca24d8e8c98e67c542213511d985b8778b5bdcbb160e038429496686047" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2022-02-22" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] baa6d7eee3ee873d4c3e3ab415deb2b1b133cf7de91f51978ece423d5106217e
[INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap.
[INFO] running `Command { std: "docker" "start" "-a" "baa6d7eee3ee873d4c3e3ab415deb2b1b133cf7de91f51978ece423d5106217e", kill_on_drop: false }`
[INFO] [stderr] warning: unused borrow that must be used
[INFO] [stderr]    --> src/queue/circular.rs:566:9
[INFO] [stderr]     |
[INFO] [stderr] 566 |         &vc[0];
[INFO] [stderr]     |         ^^^^^^ the borrow produces a value
[INFO] [stderr]     |
[INFO] [stderr]     = note: `#[warn(unused_must_use)]` on by default
[INFO] [stderr] help: use `let _ = ...` to ignore the resulting value
[INFO] [stderr]     |
[INFO] [stderr] 566 |         let _ = &vc[0];
[INFO] [stderr]     |         +++++++
[INFO] [stderr] 
[INFO] [stderr] warning: unused borrow that must be used
[INFO] [stderr]    --> src/queue/circular.rs:574:9
[INFO] [stderr]     |
[INFO] [stderr] 574 |         &vc[0];
[INFO] [stderr]     |         ^^^^^^ the borrow produces a value
[INFO] [stderr]     |
[INFO] [stderr] help: use `let _ = ...` to ignore the resulting value
[INFO] [stderr]     |
[INFO] [stderr] 574 |         let _ = &vc[0];
[INFO] [stderr]     |         +++++++
[INFO] [stderr] 
[INFO] [stderr] warning: unused borrow that must be used
[INFO] [stderr]    --> src/queue/circular.rs:584:9
[INFO] [stderr]     |
[INFO] [stderr] 584 |         &vc[1];
[INFO] [stderr]     |         ^^^^^^ the borrow produces a value
[INFO] [stderr]     |
[INFO] [stderr] help: use `let _ = ...` to ignore the resulting value
[INFO] [stderr]     |
[INFO] [stderr] 584 |         let _ = &vc[1];
[INFO] [stderr]     |         +++++++
[INFO] [stderr] 
[INFO] [stderr] warning: unused borrow that must be used
[INFO] [stderr]    --> src/queue/circular.rs:596:9
[INFO] [stderr]     |
[INFO] [stderr] 596 |         &vc[3];
[INFO] [stderr]     |         ^^^^^^ the borrow produces a value
[INFO] [stderr]     |
[INFO] [stderr] help: use `let _ = ...` to ignore the resulting value
[INFO] [stderr]     |
[INFO] [stderr] 596 |         let _ = &vc[3];
[INFO] [stderr]     |         +++++++
[INFO] [stderr] 
[INFO] [stderr] warning: unused borrow that must be used
[INFO] [stderr]    --> src/queue/circular.rs:609:9
[INFO] [stderr]     |
[INFO] [stderr] 609 |         &vc[3];
[INFO] [stderr]     |         ^^^^^^ the borrow produces a value
[INFO] [stderr]     |
[INFO] [stderr] help: use `let _ = ...` to ignore the resulting value
[INFO] [stderr]     |
[INFO] [stderr] 609 |         let _ = &vc[3];
[INFO] [stderr]     |         +++++++
[INFO] [stderr] 
[INFO] [stderr] warning: `rudac` (lib test) generated 5 warnings
[INFO] [stderr]     Finished test [unoptimized + debuginfo] target(s) in 0.01s
[INFO] [stderr]      Running unittests (/opt/rustwide/target/debug/deps/rudac-af0c632319d3634f)
[INFO] [stdout] 
[INFO] [stdout] running 229 tests
[INFO] [stdout] test algo::find::kth::tests::algo_find_kth_1 ... ok
[INFO] [stdout] test algo::find::kth::tests::algo_find_kth_3 ... ok
[INFO] [stdout] test algo::find::kth::tests::algo_find_set_median_1 ... ok
[INFO] [stdout] test algo::search::exponential::tests::algo_search_exponential_search ... ok
[INFO] [stdout] test algo::search::binary::tests::algo_search_binary_search ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_init_min ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_merge_max_1 ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_merge_min_1 ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_merge_min_2 ... ok
[INFO] [stdout] test algo::search::linear::tests::algo_search_linear_search ... ok
[INFO] [stdout] test algo::sort::merge::tests::algo_sort_merge_1 ... ok
[INFO] [stdout] test algo::sort::quick::tests::algo_sort_quick_1 ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_merge_max_2 ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_peek_max_2 ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_peek_min_1 ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_peek_min_empty_heap ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_pop_max_1 ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_pop_max_2 ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_push_min_3 ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_push_max_2 ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_push_max_3 ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_push_min_1 ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_push_min_2 ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_peek_max_1 ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_init_max ... ok
[INFO] [stdout] test algo::search::fibonacci::tests::algo_search_fibonacci_search ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_pop_min_1 ... ok
[INFO] [stdout] test heap::fibonacci::fibonacci_heap_tests::heap_fibonacci_consolidate_1 ... ok
[INFO] [stdout] test heap::fibonacci::fibonacci_heap_tests::heap_fibonacci_consolidate_5 ... ok
[INFO] [stdout] test heap::fibonacci::fibonacci_heap_tests::heap_fibonacci_consolidate_4 ... ok
[INFO] [stdout] test heap::fibonacci::fibonacci_heap_tests::heap_fibonacci_consolidate_3 ... ok
[INFO] [stdout] test heap::fibonacci::fibonacci_heap_tests::heap_fibonacci_consolidate_6 ... ok
[INFO] [stdout] test heap::fibonacci::fibonacci_heap_tests::heap_fibonacci_consolidate_2 ... ok
[INFO] [stdout] test heap::fibonacci::fibonacci_heap_tests::heap_fibonacci_pop_3 ... ok
[INFO] [stdout] test heap::fibonacci::fibonacci_heap_tests::heap_fibonacci_pop_4 ... ok
[INFO] [stdout] test heap::fibonacci::fibonacci_heap_tests::heap_fibonacci_pop_multi_1 ... ok
[INFO] [stdout] test heap::fibonacci::fibonacci_heap_tests::heap_fibonacci_pop_multi_2 ... ok
[INFO] [stdout] test heap::fibonacci::fibonacci_heap_tests::heap_fibonacci_push_2 ... ok
[INFO] [stdout] test heap::fibonacci::fibonacci_heap_tests::heap_fibonacci_pop_2 ... ok
[INFO] [stdout] test heap::fibonacci::fibonacci_heap_tests::heap_fibonacci_pop_1 ... ok
[INFO] [stdout] test heap::fibonacci::fibonacci_heap_tests::heap_fibonacci_merge_after_consolidate ... ok
[INFO] [stdout] test heap::fibonacci::fibonacci_heap_tests::heap_fibonacci_init ... ok
[INFO] [stdout] test heap::fibonacci::fibonacci_heap_tests::heap_fibonacci_merge_2 ... ok
[INFO] [stdout] test heap::fibonacci::fibonacci_heap_tests::heap_fibonacci_merge_1 ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_push_max_1 ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_pop_min_2 ... ok
[INFO] [stdout] test heap::fibonacci::internal_tree_tests::heap_fibonacci_internal_tree_merge_3 ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_peek_max_empty_heap ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_peek_min_2 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_greatest_child_or_grandchild_1 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_init ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_peek_max_2 ... ok
[INFO] [stdout] test heap::fibonacci::internal_tree_tests::heap_fibonacci_internal_tree_is_smaller ... ok
[INFO] [stdout] test heap::fibonacci::internal_tree_tests::heap_fibonacci_internal_tree_init ... ok
[INFO] [stdout] test heap::fibonacci::internal_tree_tests::heap_fibonacci_internal_tree_add_child_2 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_peek_max_1 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_peek_max_4 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_peek_max_3 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_peek_min_1 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_peek_min_2 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_peek_min_3 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_push_down_1 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_push_1 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_push_2 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_push_pop_max_3 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_push_pop_min_1 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_push_pop_min_2 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_push_pop_max_2 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_push_pop_max_1 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_push_pop_min_3 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_replace_max_1 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_replace_max_2 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_replace_max_3 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_replace_min_1 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_replace_min_2 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_smallest_child_or_grandchild_1 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_tree_grandparent ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_tree_has_child ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_tree_has_grandparent ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_tree_has_left_child ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_tree_has_right_child ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_tree_is_on_min_level ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_tree_left_child ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_tree_parent ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_tree_right_child ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_with_capacity ... ok
[INFO] [stdout] test queue::circular::tests::apply_map ... ok
[INFO] [stdout] test queue::circular::tests::apply_map_closure ... ok
[INFO] [stdout] test queue::circular::tests::apply_map_closure_primitive_data ... ok
[INFO] [stdout] test queue::circular::tests::apply_map_primitive_data ... ok
[INFO] [stdout] test queue::circular::tests::clear_circular_queue ... ok
[INFO] [stdout] test queue::circular::tests::clear_queue_with_capacity_zero ... ok
[INFO] [stdout] test queue::circular::tests::create_circular_queue_1 ... ok
[INFO] [stdout] test queue::circular::tests::create_circular_queue_2 ... ok
[INFO] [stdout] test queue::circular::tests::dequeue_multiple_elements ... ok
[INFO] [stdout] test queue::circular::tests::dequeue_one_element ... ok
[INFO] [stdout] test queue::circular::tests::dequeue_when_rear_smaller_than_front_index ... ok
[INFO] [stdout] test queue::circular::tests::enqueue_dequeue_of_primitive_data ... ok
[INFO] [stdout] test queue::circular::tests::enqueue_on_capacity_big ... ok
[INFO] [stdout] test queue::circular::tests::dequeue_on_queue_capacity_zero ... ok
[INFO] [stdout] test queue::circular::tests::enqueue_on_capacity_zero ... ok
[INFO] [stdout] test queue::circular::tests::enqueue_on_full_queue ... ok
[INFO] [stdout] test queue::circular::tests::index_trait ... ok
[INFO] [stdout] test heap::fibonacci::internal_tree_tests::heap_fibonacci_internal_tree_add_child_1 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_build_heap_2 ... ok
[INFO] [stdout] test heap::fibonacci::internal_tree_tests::heap_fibonacci_internal_tree_merge_1 ... ok
[INFO] [stdout] test heap::fibonacci::internal_tree_tests::heap_fibonacci_internal_tree_merge_2 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_pop_max ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_pop_min ... ok
[INFO] [stdout] test queue::circular::tests::index_trait_rear_before_front ... ok
[INFO] [stdout] test queue::circular::tests::iterator_trait ... ok
[INFO] [stdout] test queue::circular::tests::iterator_trait_on_empty_queue ... ok
[INFO] [stdout] test queue::circular::tests::mut_index_trait ... ok
[INFO] [stdout] test queue::circular::tests::mut_index_trait_dequeue ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_delete_2 ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_delete_1 ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_delete_max_1 ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_delete_max_2 ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_delete_min_1 ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_delete_min_2 ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_contains_1 ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_ceiling_1 ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_floor_1 ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_get_1 ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_get_3 ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_get_2 ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_insert_1 ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_is_empty ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_init ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_keys_between_1 ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_insert_2 ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_node_max_height ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_node_update_height ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_keys_1 ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_select_1 ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_insert_3 ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_rank_1 ... ok
[INFO] [stdout] test tree::binomial::tests::tree_binomial_init_max ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_size_between_1 ... ok
[INFO] [stdout] test tree::binomial::tests::tree_binomial_init_min ... ok
[INFO] [stdout] test tree::binomial::tests::tree_binomial_merge_rank_0_min ... ok
[INFO] [stdout] test tree::binomial::tests::tree_binomial_merge_rank_0_ref_max ... ok
[INFO] [stdout] test tree::binomial::tests::tree_binomial_merge_rank_0_max ... ok
[INFO] [stdout] test tree::binomial::tests::tree_binomial_merge_rank_0_ref_min ... ok
[INFO] [stdout] test tree::binomial::tests::tree_binomial_merge_rank_1_max ... ok
[INFO] [stdout] test tree::binomial::tests::tree_binomial_merge_rank_1_min ... ok
[INFO] [stdout] test tree::binomial::tests::tree_binomial_merge_rank_2_max ... ok
[INFO] [stdout] test tree::binomial::tests::tree_binomial_merge_rank_2_min ... ok
[INFO] [stdout] test tree::avl::tests::tree_avl_size_1 ... ok
[INFO] [stdout] test tree::interval::tests::tree_interval_debug ... ok
[INFO] [stdout] test tree::interval::tests::tree_interval_delete_1 ... ok
[INFO] [stdout] test heap::fibonacci::fibonacci_heap_tests::heap_fibonacci_panic_merge - should panic ... ok
[INFO] [stdout] test heap::binomial::tests::heap_binomial_panic_merge - should panic ... ok
[INFO] [stdout] test tree::interval::tests::tree_interval_find_overlap_1 ... ok
[INFO] [stdout] test tree::interval::tests::tree_interval_delete_max_1 ... ok
[INFO] [stdout] test tree::interval::tests::tree_interval_find_overlap_2 ... ok
[INFO] [stdout] test tree::interval::tests::tree_interval_find_overlap_3 ... ok
[INFO] [stdout] test tree::interval::tests::tree_interval_find_overlaps_1 ... ok
[INFO] [stdout] test tree::interval::tests::tree_interval_init ... ok
[INFO] [stdout] test tree::interval::tests::tree_interval_insert ... ok
[INFO] [stdout] test tree::interval::tests::tree_interval_intervals_between_1 ... ok
[INFO] [stdout] test tree::interval::tests::tree_interval_select_1 ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_ceiling_1 ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_contains_1 ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_delete_1 ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_delete_2 ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_delete_max_1 ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_delete_max_2 ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_delete_min_1 ... ok
[INFO] [stdout] test heap::fibonacci::fibonacci_heap_tests::heap_fibonacci_push_1 ... ok
[INFO] [stdout] test tree::interval::tests::tree_interval_delete_min_1 ... ok
[INFO] [stdout] test heap::fibonacci::fibonacci_heap_tests::heap_fibonacci_merge_3 ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_floor_1 ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_delete_min_2 ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_insert_1 ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_get_1 ... ok
[INFO] [stdout] test heap::fibonacci::internal_tree_tests::heap_fibonacci_internal_tree_panic_merge - should panic ... ok
[INFO] [stdout] test algo::find::kth::tests::algo_find_kth_2 ... ok
[INFO] [stdout] test heap::minmax::tests::heap_minmax_build_heap_1 ... ok
[INFO] [stdout] test queue::circular::tests::index_trait_out_of_bounds - should panic ... ok
[INFO] [stdout] test queue::circular::tests::index_trait_out_of_bounds_1 - should panic ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_insert_2 ... ok
[INFO] [stdout] test queue::circular::tests::index_trait_out_of_bounds_2 - should panic ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_size_1 ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_insert_3 ... ok
[INFO] [stdout] test queue::circular::tests::index_trait_out_of_bounds_3 - should panic ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_select_1 ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_get_2 ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_get_3 ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_keys_1 ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_is_empty ... ok
[INFO] [stdout] test util::interval::tests::until_interval_contains_1 ... ok
[INFO] [stdout] test util::interval::tests::until_interval_get_overlap_1 ... ok
[INFO] [stdout] test util::interval::tests::until_interval_get_overlap_10 ... ok
[INFO] [stdout] test util::interval::tests::until_interval_contains_4 ... ok
[INFO] [stdout] test util::interval::tests::until_interval_get_overlap_11 ... ok
[INFO] [stdout] test util::interval::tests::until_interval_get_overlap_2 ... ok
[INFO] [stdout] test util::interval::tests::until_interval_get_overlap_3 ... ok
[INFO] [stdout] test util::interval::tests::until_interval_get_overlap_4 ... ok
[INFO] [stdout] test util::interval::tests::until_interval_get_overlap_5 ... ok
[INFO] [stdout] test util::interval::tests::until_interval_get_overlap_6 ... ok
[INFO] [stdout] test util::interval::tests::until_interval_get_overlap_7 ... ok
[INFO] [stdout] test util::interval::tests::until_interval_get_overlap_8 ... ok
[INFO] [stdout] test util::interval::tests::until_interval_get_overlap_9 ... ok
[INFO] [stdout] test util::interval::tests::util_interval_compare_1 ... ok
[INFO] [stdout] test util::interval::tests::util_interval_overlaps_1 ... ok
[INFO] [stdout] test tree::binomial::tests::tree_binomial_panic_get_payload - should panic ... ok
[INFO] [stdout] test tree::binomial::tests::tree_binomial_panic_merge_different_ranks - should panic ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_init ... ok
[INFO] [stdout] test util::interval::tests::util_interval_overlaps_2 ... ok
[INFO] [stdout] test util::interval::tests::until_interval_contains_2 ... ok
[INFO] [stdout] test util::interval::tests::util_interval_overlaps_3 ... ok
[INFO] [stdout] test util::interval::tests::util_interval_overlaps_4 ... ok
[INFO] [stdout] test tree::binomial::tests::tree_binomial_panic_merge_min_max - should panic ... ok
[INFO] [stdout] test queue::circular::tests::index_trait_out_of_bounds_rear_before_front_index - should panic ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_size_between_1 ... ok
[INFO] [stdout] test util::interval::tests::until_interval_contains_3 ... ok
[INFO] [stdout] test util::interval::tests::until_interval_contains_5 ... ok
[INFO] [stdout] test util::interval::tests::util_interval_overlaps_5 ... ok
[INFO] [stdout] test util::interval::tests::util_interval_valid_1 ... ok
[INFO] [stdout] test util::interval::tests::util_interval_panic_new_1 - should panic ... ok
[INFO] [stdout] test util::interval::tests::util_interval_overlaps_7 ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_keys_between_1 ... ok
[INFO] [stdout] test util::interval::tests::util_interval_overlaps_6 ... ok
[INFO] [stdout] test util::interval::tests::util_interval_overlaps_8 ... ok
[INFO] [stdout] test util::interval::tests::util_interval_panic_new_4 - should panic ... ok
[INFO] [stdout] test util::interval::tests::util_interval_panic_new_3 - should panic ... ok
[INFO] [stdout] test tree::rb::tests::tree_rb_rank_1 ... ok
[INFO] [stdout] test util::interval::tests::util_interval_panic_new_2 - should panic ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 229 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.08s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests rudac
[INFO] [stdout] 
[INFO] [stdout] running 140 tests
[INFO] [stdout] test src/algo/search/linear.rs - algo::search::linear::linear_search_with (line 37) ... ok
[INFO] [stdout] test src/algo/find/kth.rs - algo::find::kth::median_with (line 206) ... ok
[INFO] [stdout] test src/algo/search/fibonacci.rs - algo::search::fibonacci::fibonacci_search_with (line 43) ... ok
[INFO] [stdout] test src/algo/search/binary.rs - algo::search::binary::binary_search_with (line 39) ... ok
[INFO] [stdout] test src/algo/search/fibonacci.rs - algo::search::fibonacci::fibonacci_search (line 14) ... ok
[INFO] [stdout] test src/algo/find/kth.rs - algo::find::kth::max_with (line 160) ... ok
[INFO] [stdout] test src/algo/search/exponential.rs - algo::search::exponential::exponential_search_with (line 40) ... ok
[INFO] [stdout] test src/algo/search/binary.rs - algo::search::binary::binary_search (line 12) ... ok
[INFO] [stdout] test src/algo/search/linear.rs - algo::search::linear::linear_search (line 12) ... ok
[INFO] [stdout] test src/algo/find/kth.rs - algo::find::kth::max (line 139) ... ok
[INFO] [stdout] test src/algo/find/kth.rs - algo::find::kth::min_with (line 114) ... ok
[INFO] [stdout] test src/algo/find/kth.rs - algo::find::kth::kth_with (line 41) ... ok
[INFO] [stdout] test src/algo/find/kth.rs - algo::find::kth::min (line 93) ... ok
[INFO] [stdout] test src/algo/sort/merge.rs - algo::sort::merge::merge_sort (line 9) ... ok
[INFO] [stdout] test src/algo/search/exponential.rs - algo::search::exponential::exponential_search (line 13) ... ok
[INFO] [stdout] test src/algo/find/kth.rs - algo::find::kth::median (line 185) ... ok
[INFO] [stdout] test src/algo/find/kth.rs - algo::find::kth::kth (line 14) ... ok
[INFO] [stdout] test src/algo/transform/partition.rs - algo::transform::partition::partition (line 11) ... ok
[INFO] [stdout] test src/algo/sort/merge.rs - algo::sort::merge::merge_sort_with (line 29) ... ok
[INFO] [stdout] test src/heap/binomial.rs - heap::binomial::BinomialHeap<T>::init_min (line 70) ... ok
[INFO] [stdout] test src/algo/sort/quick.rs - algo::sort::quick::quick_sort_with (line 31) ... ok
[INFO] [stdout] test src/algo/sort/quick.rs - algo::sort::quick::quick_sort (line 11) ... ok
[INFO] [stdout] test src/heap/binomial.rs - heap::binomial::BinomialHeap<T>::init_max (line 85) ... ok
[INFO] [stdout] test src/algo/transform/partition.rs - algo::transform::partition::partition_with (line 35) ... ok
[INFO] [stdout] test src/heap/binomial.rs - heap::binomial::BinomialHeap<T>::is_min (line 319) ... ok
[INFO] [stdout] test src/heap/binomial.rs - heap::binomial::BinomialHeap<T>::is_max (line 333) ... ok
[INFO] [stdout] test src/heap/binomial.rs - heap::binomial::BinomialHeap (line 6) ... ok
[INFO] [stdout] test src/heap/binomial.rs - heap::binomial::BinomialHeap<T>::is_empty (line 347) ... ok
[INFO] [stdout] test src/heap/binomial.rs - heap::binomial::BinomialHeap<T>::pop (line 218) ... ok
[INFO] [stdout] test src/heap/binomial.rs - heap::binomial::BinomialHeap<T>::clear (line 281) ... ok
[INFO] [stdout] test src/heap/binomial.rs - heap::binomial::BinomialHeap<T>::merge (line 104) ... ok
[INFO] [stdout] test src/heap/binomial.rs - heap::binomial::BinomialHeap<T>::peek (line 252) ... ok
[INFO] [stdout] test src/heap/fibonacci.rs - heap::fibonacci::FibonacciHeap<T>::init_min (line 305) ... ok
[INFO] [stdout] test src/heap/binomial.rs - heap::binomial::BinomialHeap<T>::preorder (line 421) ... ok
[INFO] [stdout] test src/heap/fibonacci.rs - heap::fibonacci::FibonacciHeap<T>::init_max (line 319) ... ok
[INFO] [stdout] test src/heap/binomial.rs - heap::binomial::BinomialHeap<T>::push (line 161) ... ok
[INFO] [stdout] test src/heap/fibonacci.rs - heap::fibonacci::FibonacciHeap (line 256) ... ok
[INFO] [stdout] test src/heap/fibonacci.rs - heap::fibonacci::FibonacciHeap<T>::is_min (line 658) ... ok
[INFO] [stdout] test src/heap/fibonacci.rs - heap::fibonacci::FibonacciHeap<T>::is_max (line 672) ... ok
[INFO] [stdout] test src/heap/binomial.rs - heap::binomial::BinomialHeap<T>::size (line 299) ... ok
[INFO] [stdout] test src/heap/fibonacci.rs - heap::fibonacci::FibonacciHeap<T>::clear (line 604) ... ok
[INFO] [stdout] test src/heap/fibonacci.rs - heap::fibonacci::FibonacciHeap<T>::peek (line 583) ... ok
[INFO] [stdout] test src/heap/fibonacci.rs - heap::fibonacci::FibonacciHeap<T>::is_empty (line 624) ... ok
[INFO] [stdout] test src/heap/minmax.rs - heap::minmax::MinMax<T>::init (line 29) ... ok
[INFO] [stdout] test src/heap/minmax.rs - heap::minmax::MinMax<T>::peek_min (line 354) ... ok
[INFO] [stdout] test src/heap/fibonacci.rs - heap::fibonacci::FibonacciHeap<T>::size (line 642) ... ok
[INFO] [stdout] test src/heap/fibonacci.rs - heap::fibonacci::FibonacciHeap<T>::merge (line 395) ... ok
[INFO] [stdout] test src/heap/fibonacci.rs - heap::fibonacci::FibonacciHeap<T>::push (line 336) ... ok
[INFO] [stdout] test src/heap/minmax.rs - heap::minmax::MinMax (line 5) ... ok
[INFO] [stdout] test src/heap/minmax.rs - heap::minmax::MinMax<T>::push (line 279) ... ok
[INFO] [stdout] test src/heap/minmax.rs - heap::minmax::MinMax<T>::build_heap (line 63) ... ok
[INFO] [stdout] test src/heap/minmax.rs - heap::minmax::MinMax<T>::pop_min (line 400) ... ok
[INFO] [stdout] test src/heap/fibonacci.rs - heap::fibonacci::FibonacciHeap<T>::preorder (line 696) ... ok
[INFO] [stdout] test src/heap/fibonacci.rs - heap::fibonacci::FibonacciHeap<T>::pop (line 464) ... ok
[INFO] [stdout] test src/heap/minmax.rs - heap::minmax::MinMax<T>::push_pop_min (line 464) ... ok
[INFO] [stdout] test src/heap/minmax.rs - heap::minmax::MinMax<T>::push_pop_max (line 497) ... ok
[INFO] [stdout] test src/heap/minmax.rs - heap::minmax::MinMax<T>::pop_max (line 426) ... ok
[INFO] [stdout] test src/heap/minmax.rs - heap::minmax::MinMax<T>::peek_max (line 373) ... ok
[INFO] [stdout] test src/queue/circular.rs - queue::circular::Circular<T>::empty (line 65) ... ok
[INFO] [stdout] test src/queue/circular.rs - queue::circular::Circular<T>::dequeue (line 133) ... ok
[INFO] [stdout] test src/queue/circular.rs - queue::circular::Circular<T>::enqueue (line 97) ... ok
[INFO] [stdout] test src/heap/minmax.rs - heap::minmax::MinMax<T>::replace_min (line 539) ... ok
[INFO] [stdout] test src/heap/minmax.rs - heap::minmax::MinMax<T>::with_capacity (line 43) ... ok
[INFO] [stdout] test src/queue/circular.rs - queue::circular::Circular<T>::full (line 79) ... ok
[INFO] [stdout] test src/heap/minmax.rs - heap::minmax::MinMax<T>::replace_max (line 572) ... ok
[INFO] [stdout] test src/queue/circular.rs - queue::circular::Circular (line 5) ... ok
[INFO] [stdout] test src/queue/circular.rs - queue::circular::Circular<T>::new (line 33) ... ok
[INFO] [stdout] test src/queue/circular.rs - queue::circular::Circular<T>::map (line 163) ... ok
[INFO] [stdout] test src/tree/avl.rs - tree::avl::AVL<K,V>::contains (line 167) ... ok
[INFO] [stdout] test src/tree/avl.rs - tree::avl::AVL<K,V>::delete_max (line 415) ... ok
[INFO] [stdout] test src/queue/circular.rs - queue::circular::Circular<T>::map_closure (line 191) ... ok
[INFO] [stdout] test src/queue/circular.rs - queue::circular::Circular<T>::size (line 50) ... ok
[INFO] [stdout] test src/tree/avl.rs - tree::avl::AVL<K,V>::ceiling (line 498) ... ok
[INFO] [stdout] test src/tree/avl.rs - tree::avl::AVL (line 75) ... ok
[INFO] [stdout] test src/tree/avl.rs - tree::avl::AVL<K,V>::delete (line 314) ... ok
[INFO] [stdout] test src/tree/avl.rs - tree::avl::AVL<K,V>::get (line 187) ... ok
[INFO] [stdout] test src/tree/avl.rs - tree::avl::AVL<K,V>::insert (line 226) ... ok
[INFO] [stdout] test src/tree/avl.rs - tree::avl::AVL<K,V>::delete_min (line 376) ... ok
[INFO] [stdout] test src/tree/avl.rs - tree::avl::AVL<K,V>::floor (line 457) ... ok
[INFO] [stdout] test src/tree/avl.rs - tree::avl::AVL<K,V>::init (line 105) ... ok
[INFO] [stdout] test src/tree/avl.rs - tree::avl::AVL<K,V>::rank (line 639) ... ok
[INFO] [stdout] test src/tree/avl.rs - tree::avl::AVL<K,V>::is_empty (line 121) ... ok
[INFO] [stdout] test src/tree/avl.rs - tree::avl::AVL<K,V>::keys_between (line 743) ... ok
[INFO] [stdout] test src/tree/avl.rs - tree::avl::AVL<K,V>::keys (line 671) ... ok
[INFO] [stdout] test src/tree/avl.rs - tree::avl::AVL<K,V>::max (line 609) ... ok
[INFO] [stdout] test src/tree/avl.rs - tree::avl::AVL<K,V>::min (line 582) ... ok
[INFO] [stdout] test src/tree/avl.rs - tree::avl::AVL<K,V>::size (line 140) ... ok
[INFO] [stdout] test src/tree/avl.rs - tree::avl::AVL<K,V>::select (line 542) ... ok
[INFO] [stdout] test src/tree/avl.rs - tree::avl::AVL<K,V>::size_between (line 793) ... ok
[INFO] [stdout] test src/tree/binomial.rs - tree::binomial::BinomialTree<T>::get_payload (line 211) ... ok
[INFO] [stdout] test src/tree/binomial.rs - tree::binomial::BinomialTree<T>::init_max (line 67) ... ok
[INFO] [stdout] test src/tree/binomial.rs - tree::binomial::BinomialTree<T>::is_max (line 192) ... ok
[INFO] [stdout] test src/tree/binomial.rs - tree::binomial::BinomialTree<T>::is_greater_or_equal (line 264) ... ok
[INFO] [stdout] test src/tree/binomial.rs - tree::binomial::BinomialTree<T>::is_min (line 176) ... ok
[INFO] [stdout] test src/tree/binomial.rs - tree::binomial::BinomialTree (line 8) ... ok
[INFO] [stdout] test src/tree/binomial.rs - tree::binomial::BinomialTree<T>::init_min (line 46) ... ok
[INFO] [stdout] test src/tree/binomial.rs - tree::binomial::BinomialTree<T>::is_smaller_or_equal (line 244) ... ok
[INFO] [stdout] test src/tree/binomial.rs - tree::binomial::BinomialTree<T>::rank (line 162) ... ok
[INFO] [stdout] test src/tree/binomial.rs - tree::binomial::BinomialTree<T>::merge (line 113) ... ok
[INFO] [stdout] test src/tree/binomial.rs - tree::binomial::BinomialTree<T>::peek_payload (line 229) ... ok
[INFO] [stdout] test src/tree/binomial.rs - tree::binomial::BinomialTree<T>::preorder (line 298) ... ok
[INFO] [stdout] test src/tree/interval.rs - tree::interval::IntervalTree<T>::init (line 188) ... ok
[INFO] [stdout] test src/tree/interval.rs - tree::interval::IntervalTree<T>::delete_max (line 595) ... ok
[INFO] [stdout] test src/tree/interval.rs - tree::interval::IntervalTree<T>::delete (line 475) ... ok
[INFO] [stdout] test src/tree/interval.rs - tree::interval::IntervalTree<T>::delete_min (line 549) ... ok
[INFO] [stdout] test src/tree/interval.rs - tree::interval::IntervalTree<T>::find_overlap (line 243) ... ok
[INFO] [stdout] test src/tree/interval.rs - tree::interval::IntervalTree<T>::insert (line 372) ... ok
[INFO] [stdout] test src/tree/interval.rs - tree::interval::IntervalTree (line 136) ... ok
[INFO] [stdout] test src/tree/interval.rs - tree::interval::IntervalTree<T>::overlaps (line 218) ... ok
[INFO] [stdout] test src/tree/interval.rs - tree::interval::IntervalTree<T>::find_overlaps (line 310) ... ok
[INFO] [stdout] test src/tree/interval.rs - tree::interval::IntervalTree<T>::select (line 646) ... ok
[INFO] [stdout] test src/tree/interval.rs - tree::interval::IntervalTree<T>::rank (line 812) ... ok
[INFO] [stdout] test src/tree/interval.rs - tree::interval::IntervalTree<T>::intervals_between (line 709) ... ok
[INFO] [stdout] test src/tree/interval.rs - tree::interval::IntervalTree<T>::size_between (line 857) ... ok
[INFO] [stdout] test src/tree/rb.rs - tree::rb::RedBlack (line 81) ... ok
[INFO] [stdout] test src/tree/rb.rs - tree::rb::RedBlack<K,V>::ceiling (line 570) ... ok
[INFO] [stdout] test src/tree/rb.rs - tree::rb::RedBlack<K,V>::delete (line 408) ... ok
[INFO] [stdout] test src/tree/rb.rs - tree::rb::RedBlack<K,V>::contains (line 201) ... ok
[INFO] [stdout] test src/tree/rb.rs - tree::rb::RedBlack<K,V>::delete_max (line 338) ... ok
[INFO] [stdout] test src/tree/rb.rs - tree::rb::RedBlack<K,V>::is_empty (line 145) ... ok
[INFO] [stdout] test src/tree/rb.rs - tree::rb::RedBlack<K,V>::insert (line 224) ... ok
[INFO] [stdout] test src/tree/rb.rs - tree::rb::RedBlack<K,V>::delete_min (line 280) ... ok
[INFO] [stdout] test src/tree/rb.rs - tree::rb::RedBlack<K,V>::floor (line 524) ... ok
[INFO] [stdout] test src/tree/rb.rs - tree::rb::RedBlack<K,V>::init (line 111) ... ok
[INFO] [stdout] test src/tree/rb.rs - tree::rb::RedBlack<K,V>::get (line 166) ... ok
[INFO] [stdout] test src/tree/rb.rs - tree::rb::RedBlack<K,V>::size (line 127) ... ok
[INFO] [stdout] test src/tree/rb.rs - tree::rb::RedBlack<K,V>::keys (line 755) ... ok
[INFO] [stdout] test src/tree/rb.rs - tree::rb::RedBlack<K,V>::min (line 661) ... ok
[INFO] [stdout] test src/tree/rb.rs - tree::rb::RedBlack<K,V>::max (line 688) ... ok
[INFO] [stdout] test src/tree/rb.rs - tree::rb::RedBlack<K,V>::select (line 619) ... ok
[INFO] [stdout] test src/tree/rb.rs - tree::rb::RedBlack<K,V>::size_between (line 877) ... ok
[INFO] [stdout] test src/tree/rb.rs - tree::rb::RedBlack<K,V>::rank (line 718) ... ok
[INFO] [stdout] test src/util/interval.rs - util::interval::Interval<T>::overlaps (line 163) ... ok
[INFO] [stdout] test src/tree/rb.rs - tree::rb::RedBlack<K,V>::keys_between (line 827) ... ok
[INFO] [stdout] test src/util/interval.rs - util::interval::Interval<T>::duplicate (line 112) ... ok
[INFO] [stdout] test src/util/interval.rs - util::interval::Interval (line 10) ... ok
[INFO] [stdout] test src/util/interval.rs - util::interval::Interval<T>::contains (line 201) ... ok
[INFO] [stdout] test src/util/interval.rs - util::interval::Interval<T>::new (line 57) ... ok
[INFO] [stdout] test src/util/interval.rs - util::interval::Interval<T>::get_overlap (line 223) ... ok
[INFO] [stdout] test src/util/interval.rs - util::interval::Interval<T>::point (line 89) ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 140 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 34.31s
[INFO] [stdout] 
[INFO] running `Command { std: "docker" "inspect" "baa6d7eee3ee873d4c3e3ab415deb2b1b133cf7de91f51978ece423d5106217e", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "baa6d7eee3ee873d4c3e3ab415deb2b1b133cf7de91f51978ece423d5106217e", kill_on_drop: false }`
[INFO] [stdout] baa6d7eee3ee873d4c3e3ab415deb2b1b133cf7de91f51978ece423d5106217e