[INFO] cloning repository https://github.com/DashaPoliazz/bicycles
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/DashaPoliazz/bicycles" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FDashaPoliazz%2Fbicycles", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FDashaPoliazz%2Fbicycles'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] 1bfa29ce7b4a0a9f7d838f84077c84f907ca18fa
[INFO] checking DashaPoliazz/bicycles/1bfa29ce7b4a0a9f7d838f84077c84f907ca18fa against try#ccf408f4326a858c00dd845a64a86b16f360a801 for pr-129466-2
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FDashaPoliazz%2Fbicycles" "/workspace/builds/worker-7-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-7-tc2/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/DashaPoliazz/bicycles on toolchain ccf408f4326a858c00dd845a64a86b16f360a801
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ccf408f4326a858c00dd845a64a86b16f360a801" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/DashaPoliazz/bicycles
[INFO] finished tweaking git repo https://github.com/DashaPoliazz/bicycles
[INFO] tweaked toml for git repo https://github.com/DashaPoliazz/bicycles written to /workspace/builds/worker-7-tc2/source/Cargo.toml
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ccf408f4326a858c00dd845a64a86b16f360a801" "generate-lockfile" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Updating crates.io index
[INFO] [stderr]      Locking 15 packages to latest compatible versions
[INFO] [stderr]       Adding wasi v0.11.0+wasi-snapshot-preview1 (available: v0.13.2+wasi-0.2.1)
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+ccf408f4326a858c00dd845a64a86b16f360a801" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/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:ceb6ea022f8a89cebbe621bb4987e73a935bd40dfbb726f832cfff4742a5b95a" "/opt/rustwide/cargo-home/bin/cargo" "+ccf408f4326a858c00dd845a64a86b16f360a801" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 18951dd97d6631e3c9317be75e95104f9b95c719fadd0663068b8c9899ff1180
[INFO] running `Command { std: "docker" "start" "-a" "18951dd97d6631e3c9317be75e95104f9b95c719fadd0663068b8c9899ff1180", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "18951dd97d6631e3c9317be75e95104f9b95c719fadd0663068b8c9899ff1180", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "18951dd97d6631e3c9317be75e95104f9b95c719fadd0663068b8c9899ff1180", kill_on_drop: false }`
[INFO] [stdout] 18951dd97d6631e3c9317be75e95104f9b95c719fadd0663068b8c9899ff1180
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc2/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:ceb6ea022f8a89cebbe621bb4987e73a935bd40dfbb726f832cfff4742a5b95a" "/opt/rustwide/cargo-home/bin/cargo" "+ccf408f4326a858c00dd845a64a86b16f360a801" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] a850e1fe04941e3a864e35c545bdf3b8f42201a1d1e73136dab3a5c5565cacb2
[INFO] running `Command { std: "docker" "start" "-a" "a850e1fe04941e3a864e35c545bdf3b8f42201a1d1e73136dab3a5c5565cacb2", kill_on_drop: false }`
[INFO] [stderr] Copying to /tmp/fixit
[INFO] [stderr] Running `cargo fix --edition`
[INFO] [stderr]    Migrating algoritms/bubble_sort/Cargo.toml from 2021 edition to 2024
[INFO] [stderr]    Migrating algoritms/heap_sort/Cargo.toml from 2021 edition to 2024
[INFO] [stderr]    Migrating algoritms/merge_sort/Cargo.toml from 2021 edition to 2024
[INFO] [stderr]    Migrating algoritms/quick_sort/Cargo.toml from 2021 edition to 2024
[INFO] [stderr]    Migrating data_structures/binary_tree/Cargo.toml from 2021 edition to 2024
[INFO] [stderr]    Migrating data_structures/doubly_linked_list/Cargo.toml from 2021 edition to 2024
[INFO] [stderr]    Migrating data_structures/heap/Cargo.toml from 2021 edition to 2024
[INFO] [stderr]    Migrating data_structures/singly_linked_list/Cargo.toml from 2021 edition to 2024
[INFO] [stderr]    Migrating Cargo.toml from 2021 edition to 2024
[INFO] [stderr]    Compiling proc-macro2 v1.0.86
[INFO] [stderr]    Compiling unicode-ident v1.0.13
[INFO] [stderr]    Compiling libc v0.2.159
[INFO] [stderr]     Checking byteorder v1.5.0
[INFO] [stderr]     Checking doubly_linked_list v0.1.0 (/tmp/fixit/data_structures/doubly_linked_list)
[INFO] [stderr]     Checking bubble_sort v0.1.0 (/tmp/fixit/algoritms/bubble_sort)
[INFO] [stderr]     Checking merge_sort v0.1.0 (/tmp/fixit/algoritms/merge_sort)
[INFO] [stderr]     Checking quick_sort v0.1.0 (/tmp/fixit/algoritms/quick_sort)
[INFO] [stderr]    Migrating algoritms/quick_sort/src/lib.rs from 2021 edition to 2024
[INFO] [stdout] warning: function `partition` is never used
[INFO] [stdout]  --> algoritms/quick_sort/src/lib.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn partition(left: usize, right: usize, xs: &mut Vec<usize>) -> usize {
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `qs` is never used
[INFO] [stdout]   --> algoritms/quick_sort/src/lib.rs:17:4
[INFO] [stdout]    |
[INFO] [stdout] 17 | fn qs(left: usize, right: usize, xs: &mut Vec<usize>) {
[INFO] [stdout]    |    ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `quick_sort` is never used
[INFO] [stdout]   --> algoritms/quick_sort/src/lib.rs:29:4
[INFO] [stdout]    |
[INFO] [stdout] 29 | fn quick_sort(xs: &mut Vec<usize>) {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 3 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Checking singly_linked_list v0.1.0 (/tmp/fixit/data_structures/singly_linked_list)
[INFO] [stderr]    Migrating data_structures/doubly_linked_list/src/lib.rs from 2021 edition to 2024
[INFO] [stderr]     Checking heap v0.1.0 (/tmp/fixit/data_structures/heap)
[INFO] [stderr]        Fixed data_structures/doubly_linked_list/src/lib.rs (4 fixes)
[INFO] [stderr]    Migrating algoritms/bubble_sort/src/lib.rs from 2021 edition to 2024
[INFO] [stdout] warning: function `bubble_sort` is never used
[INFO] [stdout]  --> algoritms/bubble_sort/src/lib.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn bubble_sort<T>(v: &mut [T]) -> &[T]
[INFO] [stdout]   |    ^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Migrating algoritms/merge_sort/src/lib.rs from 2021 edition to 2024
[INFO] [stdout] warning: 1 warning emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]  --> algoritms/merge_sort/src/lib.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn merge<T>(left: &[T], right: &[T]) -> Vec<T>
[INFO] [stdout]   |    ^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_sort` is never used
[INFO] [stdout]   --> algoritms/merge_sort/src/lib.rs:28:4
[INFO] [stdout]    |
[INFO] [stdout] 28 | fn merge_sort<T>(xs: Vec<T>) -> Vec<T>
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Migrating data_structures/singly_linked_list/src/lib.rs from 2021 edition to 2024
[INFO] [stderr]     Checking bicycles v0.1.0 (/tmp/fixit)
[INFO] [stderr]    Migrating data_structures/heap/src/lib.rs from 2021 edition to 2024
[INFO] [stderr]     Checking binary_tree v0.1.0 (/tmp/fixit/data_structures/binary_tree)
[INFO] [stderr]        Fixed data_structures/heap/src/lib.rs (1 fix)
[INFO] [stdout] warning: struct `Heap` is never constructed
[INFO] [stdout]  --> data_structures/heap/src/lib.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Heap<T, F>
[INFO] [stdout]   |        ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> data_structures/heap/src/lib.rs:15:8
[INFO] [stdout]     |
[INFO] [stdout] 10  | / impl<T, F> Heap<T, F>
[INFO] [stdout] 11  | | where
[INFO] [stdout] 12  | |     T: PartialOrd,
[INFO] [stdout] 13  | |     F: Fn(&T, &T) -> bool,
[INFO] [stdout]     | |__________________________- associated items in this implementation
[INFO] [stdout] 14  |   {
[INFO] [stdout] 15  |       fn new(comparator: F) -> Self {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 22  |       pub fn push(&mut self, item: T) {
[INFO] [stdout]     |              ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27  |       pub fn pop(&mut self) -> Option<T> {
[INFO] [stdout]     |              ^^^
[INFO] [stdout] ...
[INFO] [stdout] 39  |       fn heapify_up(&mut self, mut idx: usize) {
[INFO] [stdout]     |          ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 55  |       fn heapify_down(&mut self, idx: usize) {
[INFO] [stdout]     |          ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 78  |       fn swap_with_left(&mut self, parent_idx: usize) {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 83  |       fn swap_with_right(&mut self, parent_idx: usize) {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 88  |       fn get_left_child_idx(&self, idx: usize) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 91  |       fn get_left_child(&self, idx: usize) -> Option<&T> {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 94  |       fn get_right_child_idx(&self, idx: usize) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 97  |       fn get_right_child(&self, idx: usize) -> Option<&T> {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 100 |       fn get_parent_idx(&self, idx: usize) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 103 |       fn get_parent(&self, idx: usize) -> Option<&T> {
[INFO] [stdout]     |          ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `LinkedList` is never constructed
[INFO] [stdout]  --> data_structures/singly_linked_list/src/lib.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct LinkedList<T>(Option<(T, Box<LinkedList<T>>)>);
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push_front`, and `push_back` are never used
[INFO] [stdout]   --> data_structures/singly_linked_list/src/lib.rs:4:12
[INFO] [stdout]    |
[INFO] [stdout] 3  | impl<T> LinkedList<T> {
[INFO] [stdout]    | --------------------- associated items in this implementation
[INFO] [stdout] 4  |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 8  |     pub fn push_front(&mut self, val: T) {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     pub fn push_back(&mut self, val: T) {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling quote v1.0.37
[INFO] [stderr]        Fixed data_structures/doubly_linked_list/src/lib.rs (1 fix)
[INFO] [stdout] warning: type alias `NodeStrongRef` is never used
[INFO] [stdout]  --> data_structures/doubly_linked_list/src/lib.rs:4:6
[INFO] [stdout]   |
[INFO] [stdout] 4 | type NodeStrongRef<T> = Rc<RefCell<T>>;
[INFO] [stdout]   |      ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `NodeWeakRef` is never used
[INFO] [stdout]  --> data_structures/doubly_linked_list/src/lib.rs:5:6
[INFO] [stdout]   |
[INFO] [stdout] 5 | type NodeWeakRef<T> = Weak<RefCell<T>>;
[INFO] [stdout]   |      ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> data_structures/doubly_linked_list/src/lib.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct Node<T> {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `set_next`, and `set_prev` are never used
[INFO] [stdout]   --> data_structures/doubly_linked_list/src/lib.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl<T> Node<T> {
[INFO] [stdout]    | --------------- associated items in this implementation
[INFO] [stdout] 14 |     fn new(value: T) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 22 |     fn set_next(&mut self, next: NodeStrongRef<Node<T>>) {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn set_prev(&mut self, prev: NodeWeakRef<Node<T>>) {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `DEQ` is never constructed
[INFO] [stdout]   --> data_structures/doubly_linked_list/src/lib.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct DEQ<T> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> data_structures/doubly_linked_list/src/lib.rs:38:8
[INFO] [stdout]     |
[INFO] [stdout] 37  | impl<T> DEQ<T> {
[INFO] [stdout]     | -------------- associated items in this implementation
[INFO] [stdout] 38  |     fn new() -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 46  |     fn peek_front(&self) -> Option<T>
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56  |     fn peek_back(&self) -> Option<T>
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 71  |     fn push_front(&mut self, value: T) {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 92  |     fn push_back(&mut self, value: T) {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 110 |     fn pop_front(&mut self) -> Option<T>
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 124 |     fn pop_back(&mut self) -> Option<T>
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 6 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Migrating src/main.rs from 2021 edition to 2024
[INFO] [stderr]    Compiling syn v2.0.77
[INFO] [stderr]    Migrating data_structures/binary_tree/src/lib.rs from 2021 edition to 2024
[INFO] [stderr]        Fixed data_structures/binary_tree/src/lib.rs (1 fix)
[INFO] [stderr]     Checking getrandom v0.2.15
[INFO] [stderr]        Fixed data_structures/heap/src/lib.rs (1 fix)
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]    --> data_structures/heap/src/lib.rs:152:13
[INFO] [stdout]     |
[INFO] [stdout] 152 |         for n in 0..11 {
[INFO] [stdout]     |             ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `get_parent` is never used
[INFO] [stdout]    --> data_structures/heap/src/lib.rs:103:8
[INFO] [stdout]     |
[INFO] [stdout] 10  | / impl<T, F> Heap<T, F>
[INFO] [stdout] 11  | | where
[INFO] [stdout] 12  | |     T: PartialOrd,
[INFO] [stdout] 13  | |     F: Fn(&T, &T) -> bool,
[INFO] [stdout]     | |__________________________- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 103 |       fn get_parent(&self, idx: usize) -> Option<&T> {
[INFO] [stdout]     |          ^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Checking rand_core v0.6.4
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> data_structures/binary_tree/src/lib.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Node<T>
[INFO] [stdout]   |        ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> data_structures/binary_tree/src/lib.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | / impl<T> Node<T>
[INFO] [stdout] 11 | | where
[INFO] [stdout] 12 | |     T: PartialOrd,
[INFO] [stdout]    | |__________________- associated function in this implementation
[INFO] [stdout] 13 |   {
[INFO] [stdout] 14 |       fn new(value: T) -> Self {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BinarySearchTree` is never constructed
[INFO] [stdout]   --> data_structures/binary_tree/src/lib.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct BinarySearchTree<T: PartialOrd>(Option<Box<Node<T>>>);
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `inorder`, and `inorder_traverse` are never used
[INFO] [stdout]   --> data_structures/binary_tree/src/lib.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | / impl<T> BinarySearchTree<T>
[INFO] [stdout] 25 | | where
[INFO] [stdout] 26 | |     T: PartialOrd,
[INFO] [stdout]    | |__________________- associated items in this implementation
[INFO] [stdout] 27 |   {
[INFO] [stdout] 28 |       fn new() -> Self {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |       fn insert(&mut self, value: T) {
[INFO] [stdout]    |          ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 47 |       pub fn inorder(&self) -> Vec<T>
[INFO] [stdout]    |              ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 54 |       fn inorder_traverse(&self, mut result: Vec<T>) -> Vec<T>
[INFO] [stdout]    |          ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 4 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling zerocopy-derive v0.7.35
[INFO] [stderr]     Checking zerocopy v0.7.35
[INFO] [stderr]     Checking ppv-lite86 v0.2.20
[INFO] [stderr]     Checking rand_chacha v0.3.1
[INFO] [stderr]     Checking rand v0.8.5
[INFO] [stderr]     Checking heap_sort v0.1.0 (/tmp/fixit/algoritms/heap_sort)
[INFO] [stderr]    Migrating algoritms/heap_sort/src/lib.rs from 2021 edition to 2024
[INFO] [stderr]        Fixed algoritms/heap_sort/src/lib.rs (2 fixes)
[INFO] [stdout] warning: type alias `Comparator` is never used
[INFO] [stdout]  --> algoritms/heap_sort/src/lib.rs:1:6
[INFO] [stdout]   |
[INFO] [stdout] 1 | type Comparator<T> = dyn Fn(Option<&T>, Option<&T>) -> bool;
[INFO] [stdout]   |      ^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `build_heap` is never used
[INFO] [stdout]  --> algoritms/heap_sort/src/lib.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn build_heap<T>(items: &mut Vec<T>, comparator: &Box<Comparator<T>>) {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heapify_down` is never used
[INFO] [stdout]   --> algoritms/heap_sort/src/lib.rs:12:4
[INFO] [stdout]    |
[INFO] [stdout] 12 | fn heapify_down<T>(lookup: &mut Vec<T>, idx: usize, bound: usize, comparator: &Box<Comparator<T>>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sort` is never used
[INFO] [stdout]   --> algoritms/heap_sort/src/lib.rs:31:4
[INFO] [stdout]    |
[INFO] [stdout] 31 | fn sort<T>(mut items: Vec<T>, comparator: Box<Comparator<T>>) -> Vec<T> {
[INFO] [stdout]    |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 4 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 3.83s
[INFO] [stderr] Running `cargo check` to verify 2024
[INFO] [stderr]     Checking doubly_linked_list v0.1.0 (/tmp/fixit/data_structures/doubly_linked_list)
[INFO] [stderr]     Checking binary_tree v0.1.0 (/tmp/fixit/data_structures/binary_tree)
[INFO] [stdout] warning: struct `LinkedList` is never constructed
[INFO] [stdout]  --> data_structures/singly_linked_list/src/lib.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct LinkedList<T>(Option<(T, Box<LinkedList<T>>)>);
[INFO] [stdout]   |        ^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `push_front`, and `push_back` are never used
[INFO] [stdout]   --> data_structures/singly_linked_list/src/lib.rs:4:12
[INFO] [stdout]    |
[INFO] [stdout] 3  | impl<T> LinkedList<T> {
[INFO] [stdout]    | --------------------- associated items in this implementation
[INFO] [stdout] 4  |     pub fn new() -> Self {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] ...
[INFO] [stdout] 8  |     pub fn push_front(&mut self, val: T) {
[INFO] [stdout]    |            ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 13 |     pub fn push_back(&mut self, val: T) {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Checking bicycles v0.1.0 (/tmp/fixit)
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> data_structures/binary_tree/src/lib.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Node<T>
[INFO] [stdout]   |        ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> data_structures/binary_tree/src/lib.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | / impl<T> Node<T>
[INFO] [stdout] 11 | | where
[INFO] [stdout] 12 | |     T: PartialOrd,
[INFO] [stdout]    | |__________________- associated function in this implementation
[INFO] [stdout] 13 |   {
[INFO] [stdout] 14 |       fn new(value: T) -> Self {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `BinarySearchTree` is never constructed
[INFO] [stdout]   --> data_structures/binary_tree/src/lib.rs:23:8
[INFO] [stdout]    |
[INFO] [stdout] 23 | struct BinarySearchTree<T: PartialOrd>(Option<Box<Node<T>>>);
[INFO] [stdout]    |        ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `insert`, `inorder`, and `inorder_traverse` are never used
[INFO] [stdout]   --> data_structures/binary_tree/src/lib.rs:28:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | / impl<T> BinarySearchTree<T>
[INFO] [stdout] 25 | | where
[INFO] [stdout] 26 | |     T: PartialOrd,
[INFO] [stdout]    | |__________________- associated items in this implementation
[INFO] [stdout] 27 |   {
[INFO] [stdout] 28 |       fn new() -> Self {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |       fn insert(&mut self, value: T) {
[INFO] [stdout]    |          ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 47 |       pub fn inorder(&self) -> Vec<T>
[INFO] [stdout]    |              ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 54 |       fn inorder_traverse(&self, mut result: Vec<T>) -> Vec<T>
[INFO] [stdout]    |          ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 4 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bubble_sort` is never used
[INFO] [stdout]  --> algoritms/bubble_sort/src/lib.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn bubble_sort<T>(v: &mut [T]) -> &[T]
[INFO] [stdout]   |    ^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 1 warning emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Checking heap v0.1.0 (/tmp/fixit/data_structures/heap)
[INFO] [stdout] warning: function `partition` is never used
[INFO] [stdout]  --> algoritms/quick_sort/src/lib.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn partition(left: usize, right: usize, xs: &mut Vec<usize>) -> usize {
[INFO] [stdout]   |    ^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `qs` is never used
[INFO] [stdout]   --> algoritms/quick_sort/src/lib.rs:17:4
[INFO] [stdout]    |
[INFO] [stdout] 17 | fn qs(left: usize, right: usize, xs: &mut Vec<usize>) {
[INFO] [stdout]    |    ^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `quick_sort` is never used
[INFO] [stdout]   --> algoritms/quick_sort/src/lib.rs:29:4
[INFO] [stdout]    |
[INFO] [stdout] 29 | fn quick_sort(xs: &mut Vec<usize>) {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 3 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge` is never used
[INFO] [stdout]  --> algoritms/merge_sort/src/lib.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn merge<T>(left: &[T], right: &[T]) -> Vec<T>
[INFO] [stdout]   |    ^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `merge_sort` is never used
[INFO] [stdout]   --> algoritms/merge_sort/src/lib.rs:28:4
[INFO] [stdout]    |
[INFO] [stdout] 28 | fn merge_sort<T>(xs: Vec<T>) -> Vec<T>
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Checking heap_sort v0.1.0 (/tmp/fixit/algoritms/heap_sort)
[INFO] [stdout] error[E0412]: cannot find type `DEQ` in this scope
[INFO] [stdout]    --> data_structures/doubly_linked_list/src/lib.rs:154:22
[INFO] [stdout]     |
[INFO] [stdout] 154 |         let mut deq: DEQ<i32> = DEQ::new();
[INFO] [stdout]     |                      ^^^ not found in this scope
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this struct
[INFO] [stdout]     |
[INFO] [stdout] 152 +     use crate::DEQ;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Heap` is never constructed
[INFO] [stdout]  --> data_structures/heap/src/lib.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Heap<T, F>
[INFO] [stdout]   |        ^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> data_structures/heap/src/lib.rs:15:8
[INFO] [stdout]     |
[INFO] [stdout] 10  | / impl<T, F> Heap<T, F>
[INFO] [stdout] 11  | | where
[INFO] [stdout] 12  | |     T: PartialOrd,
[INFO] [stdout] 13  | |     F: Fn(&T, &T) -> bool,
[INFO] [stdout]     | |__________________________- associated items in this implementation
[INFO] [stdout] 14  |   {
[INFO] [stdout] 15  |       fn new(comparator: F) -> Self {
[INFO] [stdout]     |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 22  |       pub fn push(&mut self, item: T) {
[INFO] [stdout]     |              ^^^^
[INFO] [stdout] ...
[INFO] [stdout] 27  |       pub fn pop(&mut self) -> Option<T> {
[INFO] [stdout]     |              ^^^
[INFO] [stdout] ...
[INFO] [stdout] 39  |       fn heapify_up(&mut self, mut idx: usize) {
[INFO] [stdout]     |          ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 55  |       fn heapify_down(&mut self, idx: usize) {
[INFO] [stdout]     |          ^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 78  |       fn swap_with_left(&mut self, parent_idx: usize) {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 83  |       fn swap_with_right(&mut self, parent_idx: usize) {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 88  |       fn get_left_child_idx(&self, idx: usize) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 91  |       fn get_left_child(&self, idx: usize) -> Option<&T> {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 94  |       fn get_right_child_idx(&self, idx: usize) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 97  |       fn get_right_child(&self, idx: usize) -> Option<&T> {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 100 |       fn get_parent_idx(&self, idx: usize) -> usize {
[INFO] [stdout]     |          ^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 103 |       fn get_parent(&self, idx: usize) -> Option<&T> {
[INFO] [stdout]     |          ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `NodeStrongRef` is never used
[INFO] [stdout]  --> data_structures/doubly_linked_list/src/lib.rs:4:6
[INFO] [stdout]   |
[INFO] [stdout] 4 | type NodeStrongRef<T> = Rc<RefCell<T>>;
[INFO] [stdout]   |      ^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `NodeWeakRef` is never used
[INFO] [stdout]  --> data_structures/doubly_linked_list/src/lib.rs:5:6
[INFO] [stdout]   |
[INFO] [stdout] 5 | type NodeWeakRef<T> = Weak<RefCell<T>>;
[INFO] [stdout]   |      ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Node` is never constructed
[INFO] [stdout]  --> data_structures/doubly_linked_list/src/lib.rs:7:8
[INFO] [stdout]   |
[INFO] [stdout] 7 | struct Node<T> {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0433]: failed to resolve: use of undeclared type `DEQ`
[INFO] [stdout]    --> data_structures/doubly_linked_list/src/lib.rs:154:33
[INFO] [stdout]     |
[INFO] [stdout] 154 |         let mut deq: DEQ<i32> = DEQ::new();
[INFO] [stdout]     |                                 ^^^ use of undeclared type `DEQ`
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this struct
[INFO] [stdout]     |
[INFO] [stdout] 152 +     use crate::DEQ;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `set_next`, and `set_prev` are never used
[INFO] [stdout]   --> data_structures/doubly_linked_list/src/lib.rs:14:8
[INFO] [stdout]    |
[INFO] [stdout] 13 | impl<T> Node<T> {
[INFO] [stdout]    | --------------- associated items in this implementation
[INFO] [stdout] 14 |     fn new(value: T) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 22 |     fn set_next(&mut self, next: NodeStrongRef<Node<T>>) {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 26 |     fn set_prev(&mut self, prev: NodeWeakRef<Node<T>>) {
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0433]: failed to resolve: use of undeclared type `DEQ`
[INFO] [stdout]    --> data_structures/doubly_linked_list/src/lib.rs:163:23
[INFO] [stdout]     |
[INFO] [stdout] 163 |         let mut deq = DEQ::<i32>::new();
[INFO] [stdout]     |                       ^^^ use of undeclared type `DEQ`
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this struct
[INFO] [stdout]     |
[INFO] [stdout] 152 +     use crate::DEQ;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `DEQ` is never constructed
[INFO] [stdout]   --> data_structures/doubly_linked_list/src/lib.rs:31:8
[INFO] [stdout]    |
[INFO] [stdout] 31 | struct DEQ<T> {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0433]: failed to resolve: use of undeclared type `DEQ`
[INFO] [stdout]    --> data_structures/doubly_linked_list/src/lib.rs:175:23
[INFO] [stdout]     |
[INFO] [stdout] 175 |         let mut deq = DEQ::<i32>::new();
[INFO] [stdout]     |                       ^^^ use of undeclared type `DEQ`
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this struct
[INFO] [stdout]     |
[INFO] [stdout] 152 +     use crate::DEQ;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0433]: failed to resolve: use of undeclared type `DEQ`
[INFO] [stdout]    --> data_structures/doubly_linked_list/src/lib.rs:186:23
[INFO] [stdout]     |
[INFO] [stdout] 186 |         let mut deq = DEQ::<i32>::new();
[INFO] [stdout]     |                       ^^^ use of undeclared type `DEQ`
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this struct
[INFO] [stdout]     |
[INFO] [stdout] 152 +     use crate::DEQ;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: multiple associated items are never used
[INFO] [stdout]    --> data_structures/doubly_linked_list/src/lib.rs:38:8
[INFO] [stdout]     |
[INFO] [stdout] 37  | impl<T> DEQ<T> {
[INFO] [stdout]     | -------------- associated items in this implementation
[INFO] [stdout] 38  |     fn new() -> Self {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 46  |     fn peek_front(&self) -> Option<T>
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 56  |     fn peek_back(&self) -> Option<T>
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 71  |     fn push_front(&mut self, value: T) {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 92  |     fn push_back(&mut self, value: T) {
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 110 |     fn pop_front(&mut self) -> Option<T>
[INFO] [stdout]     |        ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 124 |     fn pop_back(&mut self) -> Option<T>
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0433]: failed to resolve: use of undeclared type `DEQ`
[INFO] [stdout]    --> data_structures/doubly_linked_list/src/lib.rs:199:23
[INFO] [stdout]     |
[INFO] [stdout] 199 |         let mut deq = DEQ::<i32>::new();
[INFO] [stdout]     |                       ^^^ use of undeclared type `DEQ`
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this struct
[INFO] [stdout]     |
[INFO] [stdout] 152 +     use crate::DEQ;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0433]: failed to resolve: use of undeclared type `DEQ`
[INFO] [stdout]    --> data_structures/doubly_linked_list/src/lib.rs:212:23
[INFO] [stdout]     |
[INFO] [stdout] 212 |         let mut deq = DEQ::<i32>::new();
[INFO] [stdout]     |                       ^^^ use of undeclared type `DEQ`
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this struct
[INFO] [stdout]     |
[INFO] [stdout] 152 +     use crate::DEQ;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0433]: failed to resolve: use of undeclared type `DEQ`
[INFO] [stdout]    --> data_structures/doubly_linked_list/src/lib.rs:226:23
[INFO] [stdout]     |
[INFO] [stdout] 226 |         let mut deq = DEQ::<i32>::new();
[INFO] [stdout]     |                       ^^^ use of undeclared type `DEQ`
[INFO] [stdout]     |
[INFO] [stdout] help: consider importing this struct
[INFO] [stdout]     |
[INFO] [stdout] 152 +     use crate::DEQ;
[INFO] [stdout]     |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 6 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `n`
[INFO] [stdout]    --> data_structures/heap/src/lib.rs:152:13
[INFO] [stdout]     |
[INFO] [stdout] 152 |         for n in 0..11 {
[INFO] [stdout]     |             ^ help: if this is intentional, prefix it with an underscore: `_n`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `get_parent` is never used
[INFO] [stdout]    --> data_structures/heap/src/lib.rs:103:8
[INFO] [stdout]     |
[INFO] [stdout] 10  | / impl<T, F> Heap<T, F>
[INFO] [stdout] 11  | | where
[INFO] [stdout] 12  | |     T: PartialOrd,
[INFO] [stdout] 13  | |     F: Fn(&T, &T) -> bool,
[INFO] [stdout]     | |__________________________- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 103 |       fn get_parent(&self, idx: usize) -> Option<&T> {
[INFO] [stdout]     |          ^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 2 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias `Comparator` is never used
[INFO] [stdout]  --> algoritms/heap_sort/src/lib.rs:1:6
[INFO] [stdout]   |
[INFO] [stdout] 1 | type Comparator<T> = dyn Fn(Option<&T>, Option<&T>) -> bool;
[INFO] [stdout]   |      ^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `build_heap` is never used
[INFO] [stdout]  --> algoritms/heap_sort/src/lib.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn build_heap<T>(items: &mut Vec<T>, comparator: &Box<Comparator<T>>) {
[INFO] [stdout]   |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `heapify_down` is never used
[INFO] [stdout]   --> algoritms/heap_sort/src/lib.rs:12:4
[INFO] [stdout]    |
[INFO] [stdout] 12 | fn heapify_down<T>(lookup: &mut Vec<T>, idx: usize, bound: usize, comparator: &Box<Comparator<T>>) {
[INFO] [stdout]    |    ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `sort` is never used
[INFO] [stdout]   --> algoritms/heap_sort/src/lib.rs:31:4
[INFO] [stdout]    |
[INFO] [stdout] 31 | fn sort<T>(mut items: Vec<T>, comparator: Box<Comparator<T>>) -> Vec<T> {
[INFO] [stdout]    |    ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error: aborting due to 8 previous errors
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] Some errors have detailed explanations: E0412, E0433.
[INFO] [stdout] 
[INFO] [stdout] For more information about an error, try `rustc --explain E0412`.
[INFO] [stdout] 
[INFO] [stdout] warning: 4 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `doubly_linked_list` (lib test) due to 9 previous errors
[INFO] [stderr] warning: build failed, waiting for other jobs to finish...
[INFO] [stderr] error: failed to check after updating to 2024
[INFO] [stderr] 
[INFO] [stderr] Caused by:
[INFO] [stderr]   process didn't exit successfully: `cargo check --frozen --all --all-targets --message-format=json` (exit status: 101)
[INFO] running `Command { std: "docker" "inspect" "a850e1fe04941e3a864e35c545bdf3b8f42201a1d1e73136dab3a5c5565cacb2", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "a850e1fe04941e3a864e35c545bdf3b8f42201a1d1e73136dab3a5c5565cacb2", kill_on_drop: false }`
[INFO] [stdout] a850e1fe04941e3a864e35c545bdf3b8f42201a1d1e73136dab3a5c5565cacb2