[INFO] cloning repository https://github.com/Finomnis/SortingVisualization [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/Finomnis/SortingVisualization" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FFinomnis%2FSortingVisualization", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FFinomnis%2FSortingVisualization'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 7e251b9e0ef5138166d8a273508e19f5dc1ba41a [INFO] checking Finomnis/SortingVisualization against try#8ea250bdb76176ecb0225baa34aa634b024ae0e2 for pr-101692 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FFinomnis%2FSortingVisualization" "/workspace/builds/worker-4/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-4/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/Finomnis/SortingVisualization on toolchain 8ea250bdb76176ecb0225baa34aa634b024ae0e2 [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+8ea250bdb76176ecb0225baa34aa634b024ae0e2" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/Finomnis/SortingVisualization [INFO] finished tweaking git repo https://github.com/Finomnis/SortingVisualization [INFO] tweaked toml for git repo https://github.com/Finomnis/SortingVisualization written to /workspace/builds/worker-4/source/Cargo.toml [INFO] crate git repo https://github.com/Finomnis/SortingVisualization already has a lockfile, it will not be regenerated [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+8ea250bdb76176ecb0225baa34aa634b024ae0e2" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4/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:824c28ce115f6b999260af6986f3384c158e782489540e41c0b698ca1d9fd927" "/opt/rustwide/cargo-home/bin/cargo" "+8ea250bdb76176ecb0225baa34aa634b024ae0e2" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 3b67668cce21e400c6c0b4b16e5294fc0411ec4c3d919e13c9cf95a328d28209 [INFO] running `Command { std: "docker" "start" "-a" "3b67668cce21e400c6c0b4b16e5294fc0411ec4c3d919e13c9cf95a328d28209", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "3b67668cce21e400c6c0b4b16e5294fc0411ec4c3d919e13c9cf95a328d28209", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "3b67668cce21e400c6c0b4b16e5294fc0411ec4c3d919e13c9cf95a328d28209", kill_on_drop: false }` [INFO] [stdout] 3b67668cce21e400c6c0b4b16e5294fc0411ec4c3d919e13c9cf95a328d28209 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4/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:824c28ce115f6b999260af6986f3384c158e782489540e41c0b698ca1d9fd927" "/opt/rustwide/cargo-home/bin/cargo" "+8ea250bdb76176ecb0225baa34aa634b024ae0e2" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] a068f0bd1c7cb3d6e19f56f0980d9becbc2b166c84c2b2a6e8eb3ebef1a32582 [INFO] running `Command { std: "docker" "start" "-a" "a068f0bd1c7cb3d6e19f56f0980d9becbc2b166c84c2b2a6e8eb3ebef1a32582", kill_on_drop: false }` [INFO] [stderr] Compiling autocfg v1.1.0 [INFO] [stderr] Compiling libc v0.2.132 [INFO] [stderr] Checking cfg-if v1.0.0 [INFO] [stderr] Compiling proc-macro2 v1.0.43 [INFO] [stderr] Compiling unicode-ident v1.0.3 [INFO] [stderr] Compiling syn v1.0.99 [INFO] [stderr] Checking scopeguard v1.1.0 [INFO] [stderr] Checking lazy_static v1.4.0 [INFO] [stderr] Compiling memchr v2.3.4 [INFO] [stderr] Compiling version_check v0.9.4 [INFO] [stderr] Checking futures-core v0.3.14 [INFO] [stderr] Checking futures-sink v0.3.14 [INFO] [stderr] Compiling rayon-core v1.9.3 [INFO] [stderr] Compiling proc-macro-hack v0.5.19 [INFO] [stderr] Compiling serde v1.0.144 [INFO] [stderr] Checking adler v1.0.2 [INFO] [stderr] Compiling crc32fast v1.2.1 [INFO] [stderr] Compiling rand_core v0.6.2 [INFO] [stderr] Compiling proc-macro-nested v0.1.7 [INFO] [stderr] Compiling bitflags v1.2.1 [INFO] [stderr] Checking either v1.6.1 [INFO] [stderr] Compiling siphasher v0.3.5 [INFO] [stderr] Compiling log v0.4.14 [INFO] [stderr] Checking smallvec v1.9.0 [INFO] [stderr] Checking pin-project-lite v0.2.6 [INFO] [stderr] Compiling parking_lot_core v0.9.3 [INFO] [stderr] Checking weezl v0.1.5 [INFO] [stderr] Checking pin-utils v0.1.0 [INFO] [stderr] Checking futures-task v0.3.14 [INFO] [stderr] Checking futures-io v0.3.14 [INFO] [stderr] Checking slab v0.4.3 [INFO] [stderr] Checking regex-syntax v0.6.23 [INFO] [stderr] Checking os_str_bytes v6.3.0 [INFO] [stderr] Compiling palette v0.6.1 [INFO] [stderr] Checking ppv-lite86 v0.2.10 [INFO] [stderr] Compiling heck v0.4.0 [INFO] [stderr] Checking lebe v0.5.2 [INFO] [stderr] Checking half v1.8.2 [INFO] [stderr] Checking termcolor v1.1.2 [INFO] [stderr] Checking bit_field v0.10.1 [INFO] [stderr] Checking color_quant v1.1.0 [INFO] [stderr] Checking once_cell v1.14.0 [INFO] [stderr] Checking hashbrown v0.9.1 [INFO] [stderr] Checking bytes v1.0.1 [INFO] [stderr] Checking humantime v2.1.0 [INFO] [stderr] Checking strsim v0.10.0 [INFO] [stderr] Checking textwrap v0.15.0 [INFO] [stderr] Checking scoped_threadpool v0.1.9 [INFO] [stderr] Checking bytemuck v1.12.1 [INFO] [stderr] Checking byteorder v1.4.3 [INFO] [stderr] Checking colorous v1.0.3 [INFO] [stderr] Checking futures-channel v0.3.14 [INFO] [stderr] Checking miniz_oxide v0.5.4 [INFO] [stderr] Compiling proc-macro-error-attr v1.0.4 [INFO] [stderr] Compiling proc-macro-error v1.0.4 [INFO] [stderr] Compiling rand v0.8.3 [INFO] [stderr] Compiling crossbeam-utils v0.8.3 [INFO] [stderr] Compiling memoffset v0.6.3 [INFO] [stderr] Compiling lock_api v0.4.8 [INFO] [stderr] Compiling num-traits v0.2.14 [INFO] [stderr] Compiling rayon v1.5.3 [INFO] [stderr] Compiling num-integer v0.1.44 [INFO] [stderr] Compiling indexmap v1.6.2 [INFO] [stderr] Compiling num-rational v0.4.1 [INFO] [stderr] Compiling tokio v1.21.0 [INFO] [stderr] Checking itertools v0.10.0 [INFO] [stderr] Compiling phf_shared v0.11.1 [INFO] [stderr] Checking clap_lex v0.2.4 [INFO] [stderr] Checking gif v0.11.2 [INFO] [stderr] Compiling phf_generator v0.11.1 [INFO] [stderr] Compiling quote v1.0.9 [INFO] [stderr] Checking aho-corasick v0.7.15 [INFO] [stderr] Checking num_cpus v1.13.0 [INFO] [stderr] Checking getrandom v0.2.7 [INFO] [stderr] Checking atty v0.2.14 [INFO] [stderr] Checking signal-hook-registry v1.3.0 [INFO] [stderr] Checking socket2 v0.4.7 [INFO] [stderr] Checking flate2 v1.0.24 [INFO] [stderr] Checking mio v0.8.4 [INFO] [stderr] Compiling toml v0.5.9 [INFO] [stderr] Checking regex v1.4.6 [INFO] [stderr] Checking threadpool v1.8.1 [INFO] [stderr] Checking nanorand v0.7.0 [INFO] [stderr] Checking spin v0.9.4 [INFO] [stderr] Checking parking_lot v0.12.1 [INFO] [stderr] Checking crossbeam-epoch v0.9.3 [INFO] [stderr] Checking crossbeam-channel v0.5.1 [INFO] [stderr] Checking png v0.17.6 [INFO] [stderr] Checking approx v0.5.1 [INFO] [stderr] Compiling find-crate v0.6.3 [INFO] [stderr] Checking env_logger v0.9.0 [INFO] [stderr] Checking rand_chacha v0.3.0 [INFO] [stderr] Checking crossbeam-deque v0.8.2 [INFO] [stderr] Checking jpeg-decoder v0.2.6 [INFO] [stderr] Compiling pin-project-internal v1.0.12 [INFO] [stderr] Compiling futures-macro v0.3.14 [INFO] [stderr] Compiling phf_macros v0.11.1 [INFO] [stderr] Compiling palette_derive v0.6.1 [INFO] [stderr] Compiling clap_derive v3.2.18 [INFO] [stderr] Compiling tokio-macros v1.8.0 [INFO] [stderr] Compiling async-recursion v1.0.0 [INFO] [stderr] Checking tiff v0.7.3 [INFO] [stderr] Checking pin-project v1.0.12 [INFO] [stderr] Checking phf v0.11.1 [INFO] [stderr] Checking clap v3.2.20 [INFO] [stderr] Checking flume v0.10.14 [INFO] [stderr] Checking futures-util v0.3.14 [INFO] [stderr] Checking exr v1.5.0 [INFO] [stderr] Checking futures-executor v0.3.14 [INFO] [stderr] Checking futures v0.3.14 [INFO] [stderr] Checking image v0.24.3 [INFO] [stderr] Checking sorting_visualizations v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] error[E0391]: cycle detected when type-checking `sorting_algorithms::merge_sort_recursive_async::merge_sort` [INFO] [stdout] --> src/sorting_algorithms/merge_sort_recursive_async.rs:60:1 [INFO] [stdout] | [INFO] [stdout] 60 | #[async_recursion] [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: ...which requires evaluating trait selection obligation `[generator interior@src/sorting_algorithms/merge_sort_recursive_async.rs:61:93: 81:2]: core::marker::Send`... [INFO] [stdout] note: ...which requires generator glue MIR for `sorting_algorithms::merge_sort_recursive_async::merge_sort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/merge_sort_recursive_async.rs:61:93 [INFO] [stdout] | [INFO] [stdout] 61 | async fn merge_sort(data: AsyncSortableData, partition_start: usize, partition_size: usize) { [INFO] [stdout] | _____________________________________________________________________________________________^ [INFO] [stdout] 62 | | if partition_size < 2 { [INFO] [stdout] 63 | | return; [INFO] [stdout] 64 | | } [INFO] [stdout] ... | [INFO] [stdout] 80 | | .await; [INFO] [stdout] 81 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires elaborating drops for `sorting_algorithms::merge_sort_recursive_async::merge_sort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/merge_sort_recursive_async.rs:61:93 [INFO] [stdout] | [INFO] [stdout] 61 | async fn merge_sort(data: AsyncSortableData, partition_start: usize, partition_size: usize) { [INFO] [stdout] | _____________________________________________________________________________________________^ [INFO] [stdout] 62 | | if partition_size < 2 { [INFO] [stdout] 63 | | return; [INFO] [stdout] 64 | | } [INFO] [stdout] ... | [INFO] [stdout] 80 | | .await; [INFO] [stdout] 81 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires borrow-checking `sorting_algorithms::merge_sort_recursive_async::merge_sort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/merge_sort_recursive_async.rs:61:93 [INFO] [stdout] | [INFO] [stdout] 61 | async fn merge_sort(data: AsyncSortableData, partition_start: usize, partition_size: usize) { [INFO] [stdout] | _____________________________________________________________________________________________^ [INFO] [stdout] 62 | | if partition_size < 2 { [INFO] [stdout] 63 | | return; [INFO] [stdout] 64 | | } [INFO] [stdout] ... | [INFO] [stdout] 80 | | .await; [INFO] [stdout] 81 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires processing `sorting_algorithms::merge_sort_recursive_async::merge_sort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/merge_sort_recursive_async.rs:61:93 [INFO] [stdout] | [INFO] [stdout] 61 | async fn merge_sort(data: AsyncSortableData, partition_start: usize, partition_size: usize) { [INFO] [stdout] | _____________________________________________________________________________________________^ [INFO] [stdout] 62 | | if partition_size < 2 { [INFO] [stdout] 63 | | return; [INFO] [stdout] 64 | | } [INFO] [stdout] ... | [INFO] [stdout] 80 | | .await; [INFO] [stdout] 81 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires processing MIR for `sorting_algorithms::merge_sort_recursive_async::merge_sort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/merge_sort_recursive_async.rs:61:93 [INFO] [stdout] | [INFO] [stdout] 61 | async fn merge_sort(data: AsyncSortableData, partition_start: usize, partition_size: usize) { [INFO] [stdout] | _____________________________________________________________________________________________^ [INFO] [stdout] 62 | | if partition_size < 2 { [INFO] [stdout] 63 | | return; [INFO] [stdout] 64 | | } [INFO] [stdout] ... | [INFO] [stdout] 80 | | .await; [INFO] [stdout] 81 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires unsafety-checking `sorting_algorithms::merge_sort_recursive_async::merge_sort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/merge_sort_recursive_async.rs:61:93 [INFO] [stdout] | [INFO] [stdout] 61 | async fn merge_sort(data: AsyncSortableData, partition_start: usize, partition_size: usize) { [INFO] [stdout] | _____________________________________________________________________________________________^ [INFO] [stdout] 62 | | if partition_size < 2 { [INFO] [stdout] 63 | | return; [INFO] [stdout] 64 | | } [INFO] [stdout] ... | [INFO] [stdout] 80 | | .await; [INFO] [stdout] 81 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires building MIR for `sorting_algorithms::merge_sort_recursive_async::merge_sort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/merge_sort_recursive_async.rs:61:93 [INFO] [stdout] | [INFO] [stdout] 61 | async fn merge_sort(data: AsyncSortableData, partition_start: usize, partition_size: usize) { [INFO] [stdout] | _____________________________________________________________________________________________^ [INFO] [stdout] 62 | | if partition_size < 2 { [INFO] [stdout] 63 | | return; [INFO] [stdout] 64 | | } [INFO] [stdout] ... | [INFO] [stdout] 80 | | .await; [INFO] [stdout] 81 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires type-checking `sorting_algorithms::merge_sort_recursive_async::merge_sort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/merge_sort_recursive_async.rs:61:93 [INFO] [stdout] | [INFO] [stdout] 61 | async fn merge_sort(data: AsyncSortableData, partition_start: usize, partition_size: usize) { [INFO] [stdout] | _____________________________________________________________________________________________^ [INFO] [stdout] 62 | | if partition_size < 2 { [INFO] [stdout] 63 | | return; [INFO] [stdout] 64 | | } [INFO] [stdout] ... | [INFO] [stdout] 80 | | .await; [INFO] [stdout] 81 | | } [INFO] [stdout] | |_^ [INFO] [stdout] = note: ...which again requires type-checking `sorting_algorithms::merge_sort_recursive_async::merge_sort`, completing the cycle [INFO] [stdout] = note: cycle used when type-checking all item bodies [INFO] [stdout] = note: this error originates in the attribute macro `async_recursion` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0391]: cycle detected when type-checking `sorting_algorithms::merge_sort_recursive_async::merge_sort` [INFO] [stdout] --> src/sorting_algorithms/merge_sort_recursive_async.rs:60:1 [INFO] [stdout] | [INFO] [stdout] 60 | #[async_recursion] [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: ...which requires evaluating trait selection obligation `[generator interior@src/sorting_algorithms/merge_sort_recursive_async.rs:61:93: 81:2]: core::marker::Send`... [INFO] [stdout] note: ...which requires generator glue MIR for `sorting_algorithms::merge_sort_recursive_async::merge_sort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/merge_sort_recursive_async.rs:61:93 [INFO] [stdout] | [INFO] [stdout] 61 | async fn merge_sort(data: AsyncSortableData, partition_start: usize, partition_size: usize) { [INFO] [stdout] | _____________________________________________________________________________________________^ [INFO] [stdout] 62 | | if partition_size < 2 { [INFO] [stdout] 63 | | return; [INFO] [stdout] 64 | | } [INFO] [stdout] ... | [INFO] [stdout] 80 | | .await; [INFO] [stdout] 81 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires elaborating drops for `sorting_algorithms::merge_sort_recursive_async::merge_sort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/merge_sort_recursive_async.rs:61:93 [INFO] [stdout] | [INFO] [stdout] 61 | async fn merge_sort(data: AsyncSortableData, partition_start: usize, partition_size: usize) { [INFO] [stdout] | _____________________________________________________________________________________________^ [INFO] [stdout] 62 | | if partition_size < 2 { [INFO] [stdout] 63 | | return; [INFO] [stdout] 64 | | } [INFO] [stdout] ... | [INFO] [stdout] 80 | | .await; [INFO] [stdout] 81 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires borrow-checking `sorting_algorithms::merge_sort_recursive_async::merge_sort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/merge_sort_recursive_async.rs:61:93 [INFO] [stdout] | [INFO] [stdout] 61 | async fn merge_sort(data: AsyncSortableData, partition_start: usize, partition_size: usize) { [INFO] [stdout] | _____________________________________________________________________________________________^ [INFO] [stdout] 62 | | if partition_size < 2 { [INFO] [stdout] 63 | | return; [INFO] [stdout] 64 | | } [INFO] [stdout] ... | [INFO] [stdout] 80 | | .await; [INFO] [stdout] 81 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires processing `sorting_algorithms::merge_sort_recursive_async::merge_sort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/merge_sort_recursive_async.rs:61:93 [INFO] [stdout] | [INFO] [stdout] 61 | async fn merge_sort(data: AsyncSortableData, partition_start: usize, partition_size: usize) { [INFO] [stdout] | _____________________________________________________________________________________________^ [INFO] [stdout] 62 | | if partition_size < 2 { [INFO] [stdout] 63 | | return; [INFO] [stdout] 64 | | } [INFO] [stdout] ... | [INFO] [stdout] 80 | | .await; [INFO] [stdout] 81 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires processing MIR for `sorting_algorithms::merge_sort_recursive_async::merge_sort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/merge_sort_recursive_async.rs:61:93 [INFO] [stdout] | [INFO] [stdout] 61 | async fn merge_sort(data: AsyncSortableData, partition_start: usize, partition_size: usize) { [INFO] [stdout] | _____________________________________________________________________________________________^ [INFO] [stdout] 62 | | if partition_size < 2 { [INFO] [stdout] 63 | | return; [INFO] [stdout] 64 | | } [INFO] [stdout] ... | [INFO] [stdout] 80 | | .await; [INFO] [stdout] 81 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires unsafety-checking `sorting_algorithms::merge_sort_recursive_async::merge_sort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/merge_sort_recursive_async.rs:61:93 [INFO] [stdout] | [INFO] [stdout] 61 | async fn merge_sort(data: AsyncSortableData, partition_start: usize, partition_size: usize) { [INFO] [stdout] | _____________________________________________________________________________________________^ [INFO] [stdout] 62 | | if partition_size < 2 { [INFO] [stdout] 63 | | return; [INFO] [stdout] 64 | | } [INFO] [stdout] ... | [INFO] [stdout] 80 | | .await; [INFO] [stdout] 81 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires building MIR for `sorting_algorithms::merge_sort_recursive_async::merge_sort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/merge_sort_recursive_async.rs:61:93 [INFO] [stdout] | [INFO] [stdout] 61 | async fn merge_sort(data: AsyncSortableData, partition_start: usize, partition_size: usize) { [INFO] [stdout] | _____________________________________________________________________________________________^ [INFO] [stdout] 62 | | if partition_size < 2 { [INFO] [stdout] 63 | | return; [INFO] [stdout] 64 | | } [INFO] [stdout] ... | [INFO] [stdout] 80 | | .await; [INFO] [stdout] 81 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires type-checking `sorting_algorithms::merge_sort_recursive_async::merge_sort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/merge_sort_recursive_async.rs:61:93 [INFO] [stdout] | [INFO] [stdout] 61 | async fn merge_sort(data: AsyncSortableData, partition_start: usize, partition_size: usize) { [INFO] [stdout] | _____________________________________________________________________________________________^ [INFO] [stdout] 62 | | if partition_size < 2 { [INFO] [stdout] 63 | | return; [INFO] [stdout] 64 | | } [INFO] [stdout] ... | [INFO] [stdout] 80 | | .await; [INFO] [stdout] 81 | | } [INFO] [stdout] | |_^ [INFO] [stdout] = note: ...which again requires type-checking `sorting_algorithms::merge_sort_recursive_async::merge_sort`, completing the cycle [INFO] [stdout] = note: cycle used when type-checking all item bodies [INFO] [stdout] = note: this error originates in the attribute macro `async_recursion` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0391]: cycle detected when type-checking `sorting_algorithms::quicksort_hoare_async::quicksort` [INFO] [stdout] --> src/sorting_algorithms/quicksort_hoare_async.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | #[async_recursion] [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: ...which requires evaluating trait selection obligation `[generator interior@src/sorting_algorithms/quicksort_hoare_async.rs:6:67: 20:2]: core::marker::Send`... [INFO] [stdout] note: ...which requires generator glue MIR for `sorting_algorithms::quicksort_hoare_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_hoare_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | if lo + 1 < p && p + 1 < hi { [INFO] [stdout] ... | [INFO] [stdout] 19 | | } [INFO] [stdout] 20 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires elaborating drops for `sorting_algorithms::quicksort_hoare_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_hoare_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | if lo + 1 < p && p + 1 < hi { [INFO] [stdout] ... | [INFO] [stdout] 19 | | } [INFO] [stdout] 20 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires borrow-checking `sorting_algorithms::quicksort_hoare_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_hoare_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | if lo + 1 < p && p + 1 < hi { [INFO] [stdout] ... | [INFO] [stdout] 19 | | } [INFO] [stdout] 20 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires processing `sorting_algorithms::quicksort_hoare_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_hoare_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | if lo + 1 < p && p + 1 < hi { [INFO] [stdout] ... | [INFO] [stdout] 19 | | } [INFO] [stdout] 20 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires processing MIR for `sorting_algorithms::quicksort_hoare_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_hoare_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | if lo + 1 < p && p + 1 < hi { [INFO] [stdout] ... | [INFO] [stdout] 19 | | } [INFO] [stdout] 20 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires unsafety-checking `sorting_algorithms::quicksort_hoare_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_hoare_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | if lo + 1 < p && p + 1 < hi { [INFO] [stdout] ... | [INFO] [stdout] 19 | | } [INFO] [stdout] 20 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires building MIR for `sorting_algorithms::quicksort_hoare_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_hoare_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | if lo + 1 < p && p + 1 < hi { [INFO] [stdout] ... | [INFO] [stdout] 19 | | } [INFO] [stdout] 20 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires type-checking `sorting_algorithms::quicksort_hoare_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_hoare_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | if lo + 1 < p && p + 1 < hi { [INFO] [stdout] ... | [INFO] [stdout] 19 | | } [INFO] [stdout] 20 | | } [INFO] [stdout] | |_^ [INFO] [stdout] = note: ...which again requires type-checking `sorting_algorithms::quicksort_hoare_async::quicksort`, completing the cycle [INFO] [stdout] = note: cycle used when type-checking all item bodies [INFO] [stdout] = note: this error originates in the attribute macro `async_recursion` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0391]: cycle detected when type-checking `sorting_algorithms::quicksort_lomuto_async::quicksort` [INFO] [stdout] --> src/sorting_algorithms/quicksort_lomuto_async.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | #[async_recursion] [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: ...which requires evaluating trait selection obligation `[generator interior@src/sorting_algorithms/quicksort_lomuto_async.rs:6:67: 19:2]: core::marker::Send`... [INFO] [stdout] note: ...which requires generator glue MIR for `sorting_algorithms::quicksort_lomuto_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_lomuto_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | [INFO] [stdout] ... | [INFO] [stdout] 18 | | } [INFO] [stdout] 19 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires elaborating drops for `sorting_algorithms::quicksort_lomuto_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_lomuto_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | [INFO] [stdout] ... | [INFO] [stdout] 18 | | } [INFO] [stdout] 19 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires borrow-checking `sorting_algorithms::quicksort_lomuto_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_lomuto_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | [INFO] [stdout] ... | [INFO] [stdout] 18 | | } [INFO] [stdout] 19 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires processing `sorting_algorithms::quicksort_lomuto_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_lomuto_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | [INFO] [stdout] ... | [INFO] [stdout] 18 | | } [INFO] [stdout] 19 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires processing MIR for `sorting_algorithms::quicksort_lomuto_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_lomuto_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | [INFO] [stdout] ... | [INFO] [stdout] 18 | | } [INFO] [stdout] 19 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires unsafety-checking `sorting_algorithms::quicksort_lomuto_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_lomuto_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | [INFO] [stdout] ... | [INFO] [stdout] 18 | | } [INFO] [stdout] 19 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires building MIR for `sorting_algorithms::quicksort_lomuto_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_lomuto_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | [INFO] [stdout] ... | [INFO] [stdout] 18 | | } [INFO] [stdout] 19 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires type-checking `sorting_algorithms::quicksort_lomuto_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_lomuto_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | [INFO] [stdout] ... | [INFO] [stdout] 18 | | } [INFO] [stdout] 19 | | } [INFO] [stdout] | |_^ [INFO] [stdout] = note: ...which again requires type-checking `sorting_algorithms::quicksort_lomuto_async::quicksort`, completing the cycle [INFO] [stdout] = note: cycle used when type-checking all item bodies [INFO] [stdout] = note: this error originates in the attribute macro `async_recursion` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: aborting due to 3 previous errors [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] For more information about this error, try `rustc --explain E0391`. [INFO] [stdout] [INFO] [stderr] error: could not compile `sorting_visualizations` due to 4 previous errors [INFO] [stderr] warning: build failed, waiting for other jobs to finish... [INFO] [stdout] error[E0391]: cycle detected when type-checking `sorting_algorithms::quicksort_hoare_async::quicksort` [INFO] [stdout] --> src/sorting_algorithms/quicksort_hoare_async.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | #[async_recursion] [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: ...which requires evaluating trait selection obligation `[generator interior@src/sorting_algorithms/quicksort_hoare_async.rs:6:67: 20:2]: core::marker::Send`... [INFO] [stdout] note: ...which requires generator glue MIR for `sorting_algorithms::quicksort_hoare_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_hoare_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | if lo + 1 < p && p + 1 < hi { [INFO] [stdout] ... | [INFO] [stdout] 19 | | } [INFO] [stdout] 20 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires elaborating drops for `sorting_algorithms::quicksort_hoare_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_hoare_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | if lo + 1 < p && p + 1 < hi { [INFO] [stdout] ... | [INFO] [stdout] 19 | | } [INFO] [stdout] 20 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires borrow-checking `sorting_algorithms::quicksort_hoare_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_hoare_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | if lo + 1 < p && p + 1 < hi { [INFO] [stdout] ... | [INFO] [stdout] 19 | | } [INFO] [stdout] 20 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires processing `sorting_algorithms::quicksort_hoare_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_hoare_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | if lo + 1 < p && p + 1 < hi { [INFO] [stdout] ... | [INFO] [stdout] 19 | | } [INFO] [stdout] 20 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires processing MIR for `sorting_algorithms::quicksort_hoare_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_hoare_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | if lo + 1 < p && p + 1 < hi { [INFO] [stdout] ... | [INFO] [stdout] 19 | | } [INFO] [stdout] 20 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires unsafety-checking `sorting_algorithms::quicksort_hoare_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_hoare_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | if lo + 1 < p && p + 1 < hi { [INFO] [stdout] ... | [INFO] [stdout] 19 | | } [INFO] [stdout] 20 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires building MIR for `sorting_algorithms::quicksort_hoare_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_hoare_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | if lo + 1 < p && p + 1 < hi { [INFO] [stdout] ... | [INFO] [stdout] 19 | | } [INFO] [stdout] 20 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires type-checking `sorting_algorithms::quicksort_hoare_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_hoare_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | if lo + 1 < p && p + 1 < hi { [INFO] [stdout] ... | [INFO] [stdout] 19 | | } [INFO] [stdout] 20 | | } [INFO] [stdout] | |_^ [INFO] [stdout] = note: ...which again requires type-checking `sorting_algorithms::quicksort_hoare_async::quicksort`, completing the cycle [INFO] [stdout] = note: cycle used when type-checking all item bodies [INFO] [stdout] = note: this error originates in the attribute macro `async_recursion` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error[E0391]: cycle detected when type-checking `sorting_algorithms::quicksort_lomuto_async::quicksort` [INFO] [stdout] --> src/sorting_algorithms/quicksort_lomuto_async.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | #[async_recursion] [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: ...which requires evaluating trait selection obligation `[generator interior@src/sorting_algorithms/quicksort_lomuto_async.rs:6:67: 19:2]: core::marker::Send`... [INFO] [stdout] note: ...which requires generator glue MIR for `sorting_algorithms::quicksort_lomuto_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_lomuto_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | [INFO] [stdout] ... | [INFO] [stdout] 18 | | } [INFO] [stdout] 19 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires elaborating drops for `sorting_algorithms::quicksort_lomuto_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_lomuto_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | [INFO] [stdout] ... | [INFO] [stdout] 18 | | } [INFO] [stdout] 19 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires borrow-checking `sorting_algorithms::quicksort_lomuto_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_lomuto_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | [INFO] [stdout] ... | [INFO] [stdout] 18 | | } [INFO] [stdout] 19 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires processing `sorting_algorithms::quicksort_lomuto_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_lomuto_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | [INFO] [stdout] ... | [INFO] [stdout] 18 | | } [INFO] [stdout] 19 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires processing MIR for `sorting_algorithms::quicksort_lomuto_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_lomuto_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | [INFO] [stdout] ... | [INFO] [stdout] 18 | | } [INFO] [stdout] 19 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires unsafety-checking `sorting_algorithms::quicksort_lomuto_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_lomuto_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | [INFO] [stdout] ... | [INFO] [stdout] 18 | | } [INFO] [stdout] 19 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires building MIR for `sorting_algorithms::quicksort_lomuto_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_lomuto_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | [INFO] [stdout] ... | [INFO] [stdout] 18 | | } [INFO] [stdout] 19 | | } [INFO] [stdout] | |_^ [INFO] [stdout] note: ...which requires type-checking `sorting_algorithms::quicksort_lomuto_async::quicksort::{closure#0}`... [INFO] [stdout] --> src/sorting_algorithms/quicksort_lomuto_async.rs:6:67 [INFO] [stdout] | [INFO] [stdout] 6 | async fn quicksort(data: AsyncSortableData, lo: usize, hi: usize) { [INFO] [stdout] | ___________________________________________________________________^ [INFO] [stdout] 7 | | if lo < hi { [INFO] [stdout] 8 | | let p = partition(&data, lo, hi).await; [INFO] [stdout] 9 | | [INFO] [stdout] ... | [INFO] [stdout] 18 | | } [INFO] [stdout] 19 | | } [INFO] [stdout] | |_^ [INFO] [stdout] = note: ...which again requires type-checking `sorting_algorithms::quicksort_lomuto_async::quicksort`, completing the cycle [INFO] [stdout] = note: cycle used when type-checking all item bodies [INFO] [stdout] = note: this error originates in the attribute macro `async_recursion` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] error: aborting due to 3 previous errors [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] For more information about this error, try `rustc --explain E0391`. [INFO] [stdout] [INFO] [stderr] error: could not compile `sorting_visualizations` due to 4 previous errors [INFO] running `Command { std: "docker" "inspect" "a068f0bd1c7cb3d6e19f56f0980d9becbc2b166c84c2b2a6e8eb3ebef1a32582", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "a068f0bd1c7cb3d6e19f56f0980d9becbc2b166c84c2b2a6e8eb3ebef1a32582", kill_on_drop: false }` [INFO] [stdout] a068f0bd1c7cb3d6e19f56f0980d9becbc2b166c84c2b2a6e8eb3ebef1a32582