[INFO] cloning repository https://github.com/MariiaRa/algorithms-rust
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/MariiaRa/algorithms-rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FMariiaRa%2Falgorithms-rust", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FMariiaRa%2Falgorithms-rust'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] be066c396add23e23609008bd931474d39a3b48c
[INFO] checking MariiaRa/algorithms-rust against try#a7a572ce3edd6d476191fbfe92c9c1986e009b34 for pr-87190-3
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FMariiaRa%2Falgorithms-rust" "/workspace/builds/worker-45/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-45/source'...
[INFO] [stderr] done.
[INFO] validating manifest of git repo https://github.com/MariiaRa/algorithms-rust on toolchain a7a572ce3edd6d476191fbfe92c9c1986e009b34
[INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+a7a572ce3edd6d476191fbfe92c9c1986e009b34" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] started tweaking git repo https://github.com/MariiaRa/algorithms-rust
[INFO] finished tweaking git repo https://github.com/MariiaRa/algorithms-rust
[INFO] tweaked toml for git repo https://github.com/MariiaRa/algorithms-rust written to /workspace/builds/worker-45/source/Cargo.toml
[INFO] crate git repo https://github.com/MariiaRa/algorithms-rust already has a lockfile, it will not be regenerated
[INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+a7a572ce3edd6d476191fbfe92c9c1986e009b34" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]  Downloading crates ...
[INFO] [stderr]   Downloaded bitflags v1.0.5
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-45/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-45/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:34b6a614d2c27851fe6cbf88fbd1137609cefab8b10d0615aaeb6fd47975d74e" "/opt/rustwide/cargo-home/bin/cargo" "+a7a572ce3edd6d476191fbfe92c9c1986e009b34" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] c9d63733ce74f4c0976de65c58fbba2704384893e840a7eda31f75f938dc4b09
[INFO] running `Command { std: "docker" "start" "-a" "c9d63733ce74f4c0976de65c58fbba2704384893e840a7eda31f75f938dc4b09", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "c9d63733ce74f4c0976de65c58fbba2704384893e840a7eda31f75f938dc4b09", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "c9d63733ce74f4c0976de65c58fbba2704384893e840a7eda31f75f938dc4b09", kill_on_drop: false }`
[INFO] [stdout] c9d63733ce74f4c0976de65c58fbba2704384893e840a7eda31f75f938dc4b09
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-45/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-45/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" "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:34b6a614d2c27851fe6cbf88fbd1137609cefab8b10d0615aaeb6fd47975d74e" "/opt/rustwide/cargo-home/bin/cargo" "+a7a572ce3edd6d476191fbfe92c9c1986e009b34" "check" "--frozen" "--all" "--all-targets" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 9ccdb9a59632426d10a5af525cbef2f149a3b1d034d58d86ab552ba850d1c290
[INFO] running `Command { std: "docker" "start" "-a" "9ccdb9a59632426d10a5af525cbef2f149a3b1d034d58d86ab552ba850d1c290", kill_on_drop: false }`
[INFO] [stderr] Copying to /tmp/fixit
[INFO] [stderr] Running `cargo fix --edition`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]    Compiling autocfg v0.1.2
[INFO] [stderr]     Checking rand_core v0.4.0
[INFO] [stderr]    Compiling libc v0.2.54
[INFO] [stderr]     Checking rand_core v0.3.1
[INFO] [stderr]     Checking rand_jitter v0.1.4
[INFO] [stderr]    Compiling rand_pcg v0.1.2
[INFO] [stderr]    Compiling rand_chacha v0.1.1
[INFO] [stderr]    Compiling rand v0.6.5
[INFO] [stderr]     Checking rand_hc v0.1.0
[INFO] [stderr]     Checking rand_xorshift v0.1.1
[INFO] [stderr]     Checking rand_isaac v0.1.1
[INFO] [stderr]     Checking rand_os v0.1.3
[INFO] [stderr]     Checking algorithms v0.1.0 (/tmp/fixit)
[INFO] [stderr]    Migrating src/main.rs from 2018 edition to 2021
[INFO] [stderr]        Fixed src/main.rs (1 fix)
[INFO] [stderr]        Fixed src/dataStructures/mod.rs (14 fixes)
[INFO] [stderr]        Fixed src/sorting/mod.rs (3 fixes)
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:209:13
[INFO] [stdout]     |
[INFO] [stdout] 208 |             _Equal => true,
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] 209 |             _Less => match self.left {
[INFO] [stdout]     |             ^^^^^ unreachable pattern
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unreachable_patterns)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:213:13
[INFO] [stdout]     |
[INFO] [stdout] 208 |             _Equal => true,
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] ...
[INFO] [stdout] 213 |             _Greater => match self.right {
[INFO] [stdout]     |             ^^^^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:223:13
[INFO] [stdout]     |
[INFO] [stdout] 222 |             _Equal => Some(&self.data),
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] 223 |             _Less => match self.right {
[INFO] [stdout]     |             ^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:227:13
[INFO] [stdout]     |
[INFO] [stdout] 222 |             _Equal => Some(&self.data),
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] ...
[INFO] [stdout] 227 |             _Greater => match self.left {
[INFO] [stdout]     |             ^^^^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:237:13
[INFO] [stdout]     |
[INFO] [stdout] 236 |             _Equal => {}, // do nothing; item is already inside the tree
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] 237 |             _Less => match self.right {
[INFO] [stdout]     |             ^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:241:13
[INFO] [stdout]     |
[INFO] [stdout] 236 |             _Equal => {}, // do nothing; item is already inside the tree
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] ...
[INFO] [stdout] 241 |             _Greater => match self.left {
[INFO] [stdout]     |             ^^^^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:287:21
[INFO] [stdout]     |
[INFO] [stdout] 265 |                     _Equal => match (&node.left, &node.right) {
[INFO] [stdout]     |                     ------ matches any value
[INFO] [stdout] ...
[INFO] [stdout] 287 |                     _Greater => node.remove(key),
[INFO] [stdout]     |                     ^^^^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:288:21
[INFO] [stdout]     |
[INFO] [stdout] 265 |                     _Equal => match (&node.left, &node.right) {
[INFO] [stdout]     |                     ------ matches any value
[INFO] [stdout] ...
[INFO] [stdout] 288 |                     _Less => {}
[INFO] [stdout]     |                     ^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:209:13
[INFO] [stdout]     |
[INFO] [stdout] 208 |             _Equal => true,
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] 209 |             _Less => match self.left {
[INFO] [stdout]     |             ^^^^^ unreachable pattern
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unreachable_patterns)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:213:13
[INFO] [stdout]     |
[INFO] [stdout] 208 |             _Equal => true,
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] ...
[INFO] [stdout] 213 |             _Greater => match self.right {
[INFO] [stdout]     |             ^^^^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:223:13
[INFO] [stdout]     |
[INFO] [stdout] 222 |             _Equal => Some(&self.data),
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] 223 |             _Less => match self.right {
[INFO] [stdout]     |             ^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:227:13
[INFO] [stdout]     |
[INFO] [stdout] 222 |             _Equal => Some(&self.data),
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] ...
[INFO] [stdout] 227 |             _Greater => match self.left {
[INFO] [stdout]     |             ^^^^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:237:13
[INFO] [stdout]     |
[INFO] [stdout] 236 |             _Equal => {}, // do nothing; item is already inside the tree
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] 237 |             _Less => match self.right {
[INFO] [stdout]     |             ^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:241:13
[INFO] [stdout]     |
[INFO] [stdout] 236 |             _Equal => {}, // do nothing; item is already inside the tree
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] ...
[INFO] [stdout] 241 |             _Greater => match self.left {
[INFO] [stdout]     |             ^^^^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:287:21
[INFO] [stdout]     |
[INFO] [stdout] 265 |                     _Equal => match (&node.left, &node.right) {
[INFO] [stdout]     |                     ------ matches any value
[INFO] [stdout] ...
[INFO] [stdout] 287 |                     _Greater => node.remove(key),
[INFO] [stdout]     |                     ^^^^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:288:21
[INFO] [stdout]     |
[INFO] [stdout] 265 |                     _Equal => match (&node.left, &node.right) {
[INFO] [stdout]     |                     ------ matches any value
[INFO] [stdout] ...
[INFO] [stdout] 288 |                     _Less => {}
[INFO] [stdout]     |                     ^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `partition_pivot_left`
[INFO] [stdout]    --> src/sorting/mod.rs:209:4
[INFO] [stdout]     |
[INFO] [stdout] 209 | fn partition_pivot_left<T, F>(elements: &mut [T], f: &F) -> usize
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `counting_sort_two`
[INFO] [stdout]    --> src/sorting/mod.rs:386:8
[INFO] [stdout]     |
[INFO] [stdout] 386 | pub fn counting_sort_two<F, T>(arr: &mut [T], min: usize, max: usize, key: F)
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `radix_sort_two`
[INFO] [stdout]    --> src/sorting/mod.rs:415:8
[INFO] [stdout]     |
[INFO] [stdout] 415 | pub fn radix_sort_two(arr: &mut [i32]) {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Stack`
[INFO] [stdout]  --> src/dataStructures/mod.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub struct Stack<T> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `with_capacity`
[INFO] [stdout]   --> src/dataStructures/mod.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 13 |     pub fn with_capacity(maxsize: usize) -> Self {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `pop`
[INFO] [stdout]   --> src/dataStructures/mod.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 20 |     pub fn pop(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `push`
[INFO] [stdout]   --> src/dataStructures/mod.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 24 |     pub fn push(&mut self, item: T) -> bool {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `size`
[INFO] [stdout]   --> src/dataStructures/mod.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 32 |     pub fn size(&self) -> usize {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias is never used: `Link`
[INFO] [stdout]   --> src/dataStructures/mod.rs:37:1
[INFO] [stdout]    |
[INFO] [stdout] 37 | type Link<T> = Option<Rc<RefCell<QueueNode<T>>>>;
[INFO] [stdout]    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `QueueNode`
[INFO] [stdout]   --> src/dataStructures/mod.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 39 | struct QueueNode<T> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Queue`
[INFO] [stdout]   --> src/dataStructures/mod.rs:43:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub struct Queue<T> {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> src/dataStructures/mod.rs:50:12
[INFO] [stdout]    |
[INFO] [stdout] 50 |     pub fn new() -> Queue<T> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `is_empty`
[INFO] [stdout]   --> src/dataStructures/mod.rs:57:12
[INFO] [stdout]    |
[INFO] [stdout] 57 |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `size`
[INFO] [stdout]   --> src/dataStructures/mod.rs:60:12
[INFO] [stdout]    |
[INFO] [stdout] 60 |     pub fn size(&self) -> usize {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `enqueue`
[INFO] [stdout]   --> src/dataStructures/mod.rs:63:12
[INFO] [stdout]    |
[INFO] [stdout] 63 |     pub fn enqueue(&mut self, item: T) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `dequeue`
[INFO] [stdout]   --> src/dataStructures/mod.rs:75:12
[INFO] [stdout]    |
[INFO] [stdout] 75 |     pub fn dequeue(&mut self) -> Result<T, String> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `dequeue_back`
[INFO] [stdout]   --> src/dataStructures/mod.rs:90:12
[INFO] [stdout]    |
[INFO] [stdout] 90 |     pub fn dequeue_back(&mut self) -> Result<T, String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `TreeNode`
[INFO] [stdout]    --> src/dataStructures/mod.rs:194:8
[INFO] [stdout]     |
[INFO] [stdout] 194 | struct TreeNode<K, V> {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]    --> src/dataStructures/mod.rs:202:12
[INFO] [stdout]     |
[INFO] [stdout] 202 |     pub fn new(key: K, item: V) -> Box<TreeNode<K, V>> {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `contains`
[INFO] [stdout]    --> src/dataStructures/mod.rs:206:12
[INFO] [stdout]     |
[INFO] [stdout] 206 |     pub fn contains(&self, key: K) -> bool {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `get`
[INFO] [stdout]    --> src/dataStructures/mod.rs:220:12
[INFO] [stdout]     |
[INFO] [stdout] 220 |     pub fn get(&self, key: K) -> Option<&V> {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `insert`
[INFO] [stdout]    --> src/dataStructures/mod.rs:234:12
[INFO] [stdout]     |
[INFO] [stdout] 234 |     pub fn insert(&mut self, key: K, item: V) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `print`
[INFO] [stdout]    --> src/dataStructures/mod.rs:248:12
[INFO] [stdout]     |
[INFO] [stdout] 248 |     pub fn print(&self) {
[INFO] [stdout]     |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `remove`
[INFO] [stdout]    --> src/dataStructures/mod.rs:260:12
[INFO] [stdout]     |
[INFO] [stdout] 260 |     pub fn remove(&mut self, key: K) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `delete_min`
[INFO] [stdout]    --> src/dataStructures/mod.rs:325:8
[INFO] [stdout]     |
[INFO] [stdout] 325 |     fn delete_min(&mut self) -> Option<Box<TreeNode<K, V>>> {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `min`
[INFO] [stdout]    --> src/dataStructures/mod.rs:346:8
[INFO] [stdout]     |
[INFO] [stdout] 346 |     fn min(&mut self) -> Option<Box<TreeNode<K, V>>> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `dataStructures` should have a snake case name
[INFO] [stdout]  --> src/main.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | mod dataStructures;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^ help: convert the identifier to snake case: `data_structures`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Equal` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:208:13
[INFO] [stdout]     |
[INFO] [stdout] 208 |             _Equal => true,
[INFO] [stdout]     |             ^^^^^^ help: convert the identifier to snake case: `_equal`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Less` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:209:13
[INFO] [stdout]     |
[INFO] [stdout] 209 |             _Less => match self.left {
[INFO] [stdout]     |             ^^^^^ help: convert the identifier to snake case: `_less`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Greater` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:213:13
[INFO] [stdout]     |
[INFO] [stdout] 213 |             _Greater => match self.right {
[INFO] [stdout]     |             ^^^^^^^^ help: convert the identifier to snake case: `_greater`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Equal` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:222:13
[INFO] [stdout]     |
[INFO] [stdout] 222 |             _Equal => Some(&self.data),
[INFO] [stdout]     |             ^^^^^^ help: convert the identifier to snake case: `_equal`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Less` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:223:13
[INFO] [stdout]     |
[INFO] [stdout] 223 |             _Less => match self.right {
[INFO] [stdout]     |             ^^^^^ help: convert the identifier to snake case: `_less`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Greater` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:227:13
[INFO] [stdout]     |
[INFO] [stdout] 227 |             _Greater => match self.left {
[INFO] [stdout]     |             ^^^^^^^^ help: convert the identifier to snake case: `_greater`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Equal` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:236:13
[INFO] [stdout]     |
[INFO] [stdout] 236 |             _Equal => {}, // do nothing; item is already inside the tree
[INFO] [stdout]     |             ^^^^^^ help: convert the identifier to snake case: `_equal`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Less` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:237:13
[INFO] [stdout]     |
[INFO] [stdout] 237 |             _Less => match self.right {
[INFO] [stdout]     |             ^^^^^ help: convert the identifier to snake case: `_less`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Greater` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:241:13
[INFO] [stdout]     |
[INFO] [stdout] 241 |             _Greater => match self.left {
[INFO] [stdout]     |             ^^^^^^^^ help: convert the identifier to snake case: `_greater`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Equal` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:265:21
[INFO] [stdout]     |
[INFO] [stdout] 265 |                     _Equal => match (&node.left, &node.right) {
[INFO] [stdout]     |                     ^^^^^^ help: convert the identifier to snake case: `_equal`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Greater` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:287:21
[INFO] [stdout]     |
[INFO] [stdout] 287 |                     _Greater => node.remove(key),
[INFO] [stdout]     |                     ^^^^^^^^ help: convert the identifier to snake case: `_greater`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Less` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:288:21
[INFO] [stdout]     |
[INFO] [stdout] 288 |                     _Less => {}
[INFO] [stdout]     |                     ^^^^^ help: convert the identifier to snake case: `_less`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 47 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `partition_pivot_left`
[INFO] [stdout]    --> src/sorting/mod.rs:209:4
[INFO] [stdout]     |
[INFO] [stdout] 209 | fn partition_pivot_left<T, F>(elements: &mut [T], f: &F) -> usize
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `counting_sort_two`
[INFO] [stdout]    --> src/sorting/mod.rs:386:8
[INFO] [stdout]     |
[INFO] [stdout] 386 | pub fn counting_sort_two<F, T>(arr: &mut [T], min: usize, max: usize, key: F)
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `radix_sort_two`
[INFO] [stdout]    --> src/sorting/mod.rs:415:8
[INFO] [stdout]     |
[INFO] [stdout] 415 | pub fn radix_sort_two(arr: &mut [i32]) {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Stack`
[INFO] [stdout]  --> src/dataStructures/mod.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub struct Stack<T> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `with_capacity`
[INFO] [stdout]   --> src/dataStructures/mod.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 13 |     pub fn with_capacity(maxsize: usize) -> Self {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `pop`
[INFO] [stdout]   --> src/dataStructures/mod.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 20 |     pub fn pop(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `push`
[INFO] [stdout]   --> src/dataStructures/mod.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 24 |     pub fn push(&mut self, item: T) -> bool {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `size`
[INFO] [stdout]   --> src/dataStructures/mod.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 32 |     pub fn size(&self) -> usize {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias is never used: `Link`
[INFO] [stdout]   --> src/dataStructures/mod.rs:37:1
[INFO] [stdout]    |
[INFO] [stdout] 37 | type Link<T> = Option<Rc<RefCell<QueueNode<T>>>>;
[INFO] [stdout]    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `QueueNode`
[INFO] [stdout]   --> src/dataStructures/mod.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 39 | struct QueueNode<T> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Queue`
[INFO] [stdout]   --> src/dataStructures/mod.rs:43:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub struct Queue<T> {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> src/dataStructures/mod.rs:50:12
[INFO] [stdout]    |
[INFO] [stdout] 50 |     pub fn new() -> Queue<T> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `is_empty`
[INFO] [stdout]   --> src/dataStructures/mod.rs:57:12
[INFO] [stdout]    |
[INFO] [stdout] 57 |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `size`
[INFO] [stdout]   --> src/dataStructures/mod.rs:60:12
[INFO] [stdout]    |
[INFO] [stdout] 60 |     pub fn size(&self) -> usize {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `enqueue`
[INFO] [stdout]   --> src/dataStructures/mod.rs:63:12
[INFO] [stdout]    |
[INFO] [stdout] 63 |     pub fn enqueue(&mut self, item: T) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `dequeue`
[INFO] [stdout]   --> src/dataStructures/mod.rs:75:12
[INFO] [stdout]    |
[INFO] [stdout] 75 |     pub fn dequeue(&mut self) -> Result<T, String> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `dequeue_back`
[INFO] [stdout]   --> src/dataStructures/mod.rs:90:12
[INFO] [stdout]    |
[INFO] [stdout] 90 |     pub fn dequeue_back(&mut self) -> Result<T, String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `TreeNode`
[INFO] [stdout]    --> src/dataStructures/mod.rs:194:8
[INFO] [stdout]     |
[INFO] [stdout] 194 | struct TreeNode<K, V> {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]    --> src/dataStructures/mod.rs:202:12
[INFO] [stdout]     |
[INFO] [stdout] 202 |     pub fn new(key: K, item: V) -> Box<TreeNode<K, V>> {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `contains`
[INFO] [stdout]    --> src/dataStructures/mod.rs:206:12
[INFO] [stdout]     |
[INFO] [stdout] 206 |     pub fn contains(&self, key: K) -> bool {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `get`
[INFO] [stdout]    --> src/dataStructures/mod.rs:220:12
[INFO] [stdout]     |
[INFO] [stdout] 220 |     pub fn get(&self, key: K) -> Option<&V> {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `insert`
[INFO] [stdout]    --> src/dataStructures/mod.rs:234:12
[INFO] [stdout]     |
[INFO] [stdout] 234 |     pub fn insert(&mut self, key: K, item: V) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `print`
[INFO] [stdout]    --> src/dataStructures/mod.rs:248:12
[INFO] [stdout]     |
[INFO] [stdout] 248 |     pub fn print(&self) {
[INFO] [stdout]     |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `remove`
[INFO] [stdout]    --> src/dataStructures/mod.rs:260:12
[INFO] [stdout]     |
[INFO] [stdout] 260 |     pub fn remove(&mut self, key: K) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `delete_min`
[INFO] [stdout]    --> src/dataStructures/mod.rs:325:8
[INFO] [stdout]     |
[INFO] [stdout] 325 |     fn delete_min(&mut self) -> Option<Box<TreeNode<K, V>>> {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `min`
[INFO] [stdout]    --> src/dataStructures/mod.rs:346:8
[INFO] [stdout]     |
[INFO] [stdout] 346 |     fn min(&mut self) -> Option<Box<TreeNode<K, V>>> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `dataStructures` should have a snake case name
[INFO] [stdout]  --> src/main.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | mod dataStructures;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^ help: convert the identifier to snake case: `data_structures`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Equal` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:208:13
[INFO] [stdout]     |
[INFO] [stdout] 208 |             _Equal => true,
[INFO] [stdout]     |             ^^^^^^ help: convert the identifier to snake case: `_equal`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Less` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:209:13
[INFO] [stdout]     |
[INFO] [stdout] 209 |             _Less => match self.left {
[INFO] [stdout]     |             ^^^^^ help: convert the identifier to snake case: `_less`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Greater` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:213:13
[INFO] [stdout]     |
[INFO] [stdout] 213 |             _Greater => match self.right {
[INFO] [stdout]     |             ^^^^^^^^ help: convert the identifier to snake case: `_greater`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Equal` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:222:13
[INFO] [stdout]     |
[INFO] [stdout] 222 |             _Equal => Some(&self.data),
[INFO] [stdout]     |             ^^^^^^ help: convert the identifier to snake case: `_equal`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Less` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:223:13
[INFO] [stdout]     |
[INFO] [stdout] 223 |             _Less => match self.right {
[INFO] [stdout]     |             ^^^^^ help: convert the identifier to snake case: `_less`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Greater` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:227:13
[INFO] [stdout]     |
[INFO] [stdout] 227 |             _Greater => match self.left {
[INFO] [stdout]     |             ^^^^^^^^ help: convert the identifier to snake case: `_greater`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Equal` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:236:13
[INFO] [stdout]     |
[INFO] [stdout] 236 |             _Equal => {}, // do nothing; item is already inside the tree
[INFO] [stdout]     |             ^^^^^^ help: convert the identifier to snake case: `_equal`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Less` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:237:13
[INFO] [stdout]     |
[INFO] [stdout] 237 |             _Less => match self.right {
[INFO] [stdout]     |             ^^^^^ help: convert the identifier to snake case: `_less`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Greater` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:241:13
[INFO] [stdout]     |
[INFO] [stdout] 241 |             _Greater => match self.left {
[INFO] [stdout]     |             ^^^^^^^^ help: convert the identifier to snake case: `_greater`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Equal` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:265:21
[INFO] [stdout]     |
[INFO] [stdout] 265 |                     _Equal => match (&node.left, &node.right) {
[INFO] [stdout]     |                     ^^^^^^ help: convert the identifier to snake case: `_equal`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Greater` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:287:21
[INFO] [stdout]     |
[INFO] [stdout] 287 |                     _Greater => node.remove(key),
[INFO] [stdout]     |                     ^^^^^^^^ help: convert the identifier to snake case: `_greater`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Less` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:288:21
[INFO] [stdout]     |
[INFO] [stdout] 288 |                     _Less => {}
[INFO] [stdout]     |                     ^^^^^ help: convert the identifier to snake case: `_less`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 47 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished dev [unoptimized + debuginfo] target(s) in 8.85s
[INFO] [stderr] Running `cargo check` to verify 2021
[INFO] [stderr]     Checking algorithms v0.1.0 (/tmp/fixit)
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:209:13
[INFO] [stdout]     |
[INFO] [stdout] 208 |             _Equal => true,
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] 209 |             _Less => match self.left {
[INFO] [stdout]     |             ^^^^^ unreachable pattern
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unreachable_patterns)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:213:13
[INFO] [stdout]     |
[INFO] [stdout] 208 |             _Equal => true,
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] ...
[INFO] [stdout] 213 |             _Greater => match self.right {
[INFO] [stdout]     |             ^^^^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:223:13
[INFO] [stdout]     |
[INFO] [stdout] 222 |             _Equal => Some(&self.data),
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] 223 |             _Less => match self.right {
[INFO] [stdout]     |             ^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:227:13
[INFO] [stdout]     |
[INFO] [stdout] 222 |             _Equal => Some(&self.data),
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] ...
[INFO] [stdout] 227 |             _Greater => match self.left {
[INFO] [stdout]     |             ^^^^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:237:13
[INFO] [stdout]     |
[INFO] [stdout] 236 |             _Equal => {}, // do nothing; item is already inside the tree
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] 237 |             _Less => match self.right {
[INFO] [stdout]     |             ^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:241:13
[INFO] [stdout]     |
[INFO] [stdout] 236 |             _Equal => {}, // do nothing; item is already inside the tree
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] ...
[INFO] [stdout] 241 |             _Greater => match self.left {
[INFO] [stdout]     |             ^^^^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:287:21
[INFO] [stdout]     |
[INFO] [stdout] 265 |                     _Equal => match (&node.left, &node.right) {
[INFO] [stdout]     |                     ------ matches any value
[INFO] [stdout] ...
[INFO] [stdout] 287 |                     _Greater => node.remove(key),
[INFO] [stdout]     |                     ^^^^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:288:21
[INFO] [stdout]     |
[INFO] [stdout] 265 |                     _Equal => match (&node.left, &node.right) {
[INFO] [stdout]     |                     ------ matches any value
[INFO] [stdout] ...
[INFO] [stdout] 288 |                     _Less => {}
[INFO] [stdout]     |                     ^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:209:13
[INFO] [stdout]     |
[INFO] [stdout] 208 |             _Equal => true,
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] 209 |             _Less => match self.left {
[INFO] [stdout]     |             ^^^^^ unreachable pattern
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unreachable_patterns)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:213:13
[INFO] [stdout]     |
[INFO] [stdout] 208 |             _Equal => true,
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] ...
[INFO] [stdout] 213 |             _Greater => match self.right {
[INFO] [stdout]     |             ^^^^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:223:13
[INFO] [stdout]     |
[INFO] [stdout] 222 |             _Equal => Some(&self.data),
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] 223 |             _Less => match self.right {
[INFO] [stdout]     |             ^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:227:13
[INFO] [stdout]     |
[INFO] [stdout] 222 |             _Equal => Some(&self.data),
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] ...
[INFO] [stdout] 227 |             _Greater => match self.left {
[INFO] [stdout]     |             ^^^^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:237:13
[INFO] [stdout]     |
[INFO] [stdout] 236 |             _Equal => {}, // do nothing; item is already inside the tree
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] 237 |             _Less => match self.right {
[INFO] [stdout]     |             ^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:241:13
[INFO] [stdout]     |
[INFO] [stdout] 236 |             _Equal => {}, // do nothing; item is already inside the tree
[INFO] [stdout]     |             ------ matches any value
[INFO] [stdout] ...
[INFO] [stdout] 241 |             _Greater => match self.left {
[INFO] [stdout]     |             ^^^^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:287:21
[INFO] [stdout]     |
[INFO] [stdout] 265 |                     _Equal => match (&node.left, &node.right) {
[INFO] [stdout]     |                     ------ matches any value
[INFO] [stdout] ...
[INFO] [stdout] 287 |                     _Greater => node.remove(key),
[INFO] [stdout]     |                     ^^^^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unreachable pattern
[INFO] [stdout]    --> src/dataStructures/mod.rs:288:21
[INFO] [stdout]     |
[INFO] [stdout] 265 |                     _Equal => match (&node.left, &node.right) {
[INFO] [stdout]     |                     ------ matches any value
[INFO] [stdout] ...
[INFO] [stdout] 288 |                     _Less => {}
[INFO] [stdout]     |                     ^^^^^ unreachable pattern
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `partition_pivot_left`
[INFO] [stdout]    --> src/sorting/mod.rs:209:4
[INFO] [stdout]     |
[INFO] [stdout] 209 | fn partition_pivot_left<T, F>(elements: &mut [T], f: &F) -> usize
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `counting_sort_two`
[INFO] [stdout]    --> src/sorting/mod.rs:386:8
[INFO] [stdout]     |
[INFO] [stdout] 386 | pub fn counting_sort_two<F, T>(arr: &mut [T], min: usize, max: usize, key: F)
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `radix_sort_two`
[INFO] [stdout]    --> src/sorting/mod.rs:415:8
[INFO] [stdout]     |
[INFO] [stdout] 415 | pub fn radix_sort_two(arr: &mut [i32]) {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Stack`
[INFO] [stdout]  --> src/dataStructures/mod.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub struct Stack<T> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `with_capacity`
[INFO] [stdout]   --> src/dataStructures/mod.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 13 |     pub fn with_capacity(maxsize: usize) -> Self {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `pop`
[INFO] [stdout]   --> src/dataStructures/mod.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 20 |     pub fn pop(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `push`
[INFO] [stdout]   --> src/dataStructures/mod.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 24 |     pub fn push(&mut self, item: T) -> bool {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `size`
[INFO] [stdout]   --> src/dataStructures/mod.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 32 |     pub fn size(&self) -> usize {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias is never used: `Link`
[INFO] [stdout]   --> src/dataStructures/mod.rs:37:1
[INFO] [stdout]    |
[INFO] [stdout] 37 | type Link<T> = Option<Rc<RefCell<QueueNode<T>>>>;
[INFO] [stdout]    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `QueueNode`
[INFO] [stdout]   --> src/dataStructures/mod.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 39 | struct QueueNode<T> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Queue`
[INFO] [stdout]   --> src/dataStructures/mod.rs:43:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub struct Queue<T> {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> src/dataStructures/mod.rs:50:12
[INFO] [stdout]    |
[INFO] [stdout] 50 |     pub fn new() -> Queue<T> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `is_empty`
[INFO] [stdout]   --> src/dataStructures/mod.rs:57:12
[INFO] [stdout]    |
[INFO] [stdout] 57 |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `size`
[INFO] [stdout]   --> src/dataStructures/mod.rs:60:12
[INFO] [stdout]    |
[INFO] [stdout] 60 |     pub fn size(&self) -> usize {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `enqueue`
[INFO] [stdout]   --> src/dataStructures/mod.rs:63:12
[INFO] [stdout]    |
[INFO] [stdout] 63 |     pub fn enqueue(&mut self, item: T) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `dequeue`
[INFO] [stdout]   --> src/dataStructures/mod.rs:75:12
[INFO] [stdout]    |
[INFO] [stdout] 75 |     pub fn dequeue(&mut self) -> Result<T, String> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `dequeue_back`
[INFO] [stdout]   --> src/dataStructures/mod.rs:90:12
[INFO] [stdout]    |
[INFO] [stdout] 90 |     pub fn dequeue_back(&mut self) -> Result<T, String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `TreeNode`
[INFO] [stdout]    --> src/dataStructures/mod.rs:194:8
[INFO] [stdout]     |
[INFO] [stdout] 194 | struct TreeNode<K, V> {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]    --> src/dataStructures/mod.rs:202:12
[INFO] [stdout]     |
[INFO] [stdout] 202 |     pub fn new(key: K, item: V) -> Box<TreeNode<K, V>> {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `contains`
[INFO] [stdout]    --> src/dataStructures/mod.rs:206:12
[INFO] [stdout]     |
[INFO] [stdout] 206 |     pub fn contains(&self, key: K) -> bool {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `get`
[INFO] [stdout]    --> src/dataStructures/mod.rs:220:12
[INFO] [stdout]     |
[INFO] [stdout] 220 |     pub fn get(&self, key: K) -> Option<&V> {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `insert`
[INFO] [stdout]    --> src/dataStructures/mod.rs:234:12
[INFO] [stdout]     |
[INFO] [stdout] 234 |     pub fn insert(&mut self, key: K, item: V) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `print`
[INFO] [stdout]    --> src/dataStructures/mod.rs:248:12
[INFO] [stdout]     |
[INFO] [stdout] 248 |     pub fn print(&self) {
[INFO] [stdout]     |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `remove`
[INFO] [stdout]    --> src/dataStructures/mod.rs:260:12
[INFO] [stdout]     |
[INFO] [stdout] 260 |     pub fn remove(&mut self, key: K) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `delete_min`
[INFO] [stdout]    --> src/dataStructures/mod.rs:325:8
[INFO] [stdout]     |
[INFO] [stdout] 325 |     fn delete_min(&mut self) -> Option<Box<TreeNode<K, V>>> {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `min`
[INFO] [stdout]    --> src/dataStructures/mod.rs:346:8
[INFO] [stdout]     |
[INFO] [stdout] 346 |     fn min(&mut self) -> Option<Box<TreeNode<K, V>>> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `dataStructures` should have a snake case name
[INFO] [stdout]  --> src/main.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | mod dataStructures;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^ help: convert the identifier to snake case: `data_structures`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Equal` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:208:13
[INFO] [stdout]     |
[INFO] [stdout] 208 |             _Equal => true,
[INFO] [stdout]     |             ^^^^^^ help: convert the identifier to snake case: `_equal`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Less` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:209:13
[INFO] [stdout]     |
[INFO] [stdout] 209 |             _Less => match self.left {
[INFO] [stdout]     |             ^^^^^ help: convert the identifier to snake case: `_less`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Greater` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:213:13
[INFO] [stdout]     |
[INFO] [stdout] 213 |             _Greater => match self.right {
[INFO] [stdout]     |             ^^^^^^^^ help: convert the identifier to snake case: `_greater`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Equal` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:222:13
[INFO] [stdout]     |
[INFO] [stdout] 222 |             _Equal => Some(&self.data),
[INFO] [stdout]     |             ^^^^^^ help: convert the identifier to snake case: `_equal`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Less` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:223:13
[INFO] [stdout]     |
[INFO] [stdout] 223 |             _Less => match self.right {
[INFO] [stdout]     |             ^^^^^ help: convert the identifier to snake case: `_less`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Greater` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:227:13
[INFO] [stdout]     |
[INFO] [stdout] 227 |             _Greater => match self.left {
[INFO] [stdout]     |             ^^^^^^^^ help: convert the identifier to snake case: `_greater`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Equal` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:236:13
[INFO] [stdout]     |
[INFO] [stdout] 236 |             _Equal => {}, // do nothing; item is already inside the tree
[INFO] [stdout]     |             ^^^^^^ help: convert the identifier to snake case: `_equal`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Less` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:237:13
[INFO] [stdout]     |
[INFO] [stdout] 237 |             _Less => match self.right {
[INFO] [stdout]     |             ^^^^^ help: convert the identifier to snake case: `_less`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Greater` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:241:13
[INFO] [stdout]     |
[INFO] [stdout] 241 |             _Greater => match self.left {
[INFO] [stdout]     |             ^^^^^^^^ help: convert the identifier to snake case: `_greater`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Equal` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:265:21
[INFO] [stdout]     |
[INFO] [stdout] 265 |                     _Equal => match (&node.left, &node.right) {
[INFO] [stdout]     |                     ^^^^^^ help: convert the identifier to snake case: `_equal`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Greater` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:287:21
[INFO] [stdout]     |
[INFO] [stdout] 287 |                     _Greater => node.remove(key),
[INFO] [stdout]     |                     ^^^^^^^^ help: convert the identifier to snake case: `_greater`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Less` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:288:21
[INFO] [stdout]     |
[INFO] [stdout] 288 |                     _Less => {}
[INFO] [stdout]     |                     ^^^^^ help: convert the identifier to snake case: `_less`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 47 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `partition_pivot_left`
[INFO] [stdout]    --> src/sorting/mod.rs:209:4
[INFO] [stdout]     |
[INFO] [stdout] 209 | fn partition_pivot_left<T, F>(elements: &mut [T], f: &F) -> usize
[INFO] [stdout]     |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `counting_sort_two`
[INFO] [stdout]    --> src/sorting/mod.rs:386:8
[INFO] [stdout]     |
[INFO] [stdout] 386 | pub fn counting_sort_two<F, T>(arr: &mut [T], min: usize, max: usize, key: F)
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function is never used: `radix_sort_two`
[INFO] [stdout]    --> src/sorting/mod.rs:415:8
[INFO] [stdout]     |
[INFO] [stdout] 415 | pub fn radix_sort_two(arr: &mut [i32]) {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Stack`
[INFO] [stdout]  --> src/dataStructures/mod.rs:7:12
[INFO] [stdout]   |
[INFO] [stdout] 7 | pub struct Stack<T> {
[INFO] [stdout]   |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `with_capacity`
[INFO] [stdout]   --> src/dataStructures/mod.rs:13:12
[INFO] [stdout]    |
[INFO] [stdout] 13 |     pub fn with_capacity(maxsize: usize) -> Self {
[INFO] [stdout]    |            ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `pop`
[INFO] [stdout]   --> src/dataStructures/mod.rs:20:12
[INFO] [stdout]    |
[INFO] [stdout] 20 |     pub fn pop(&mut self) -> Option<T> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `push`
[INFO] [stdout]   --> src/dataStructures/mod.rs:24:12
[INFO] [stdout]    |
[INFO] [stdout] 24 |     pub fn push(&mut self, item: T) -> bool {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `size`
[INFO] [stdout]   --> src/dataStructures/mod.rs:32:12
[INFO] [stdout]    |
[INFO] [stdout] 32 |     pub fn size(&self) -> usize {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type alias is never used: `Link`
[INFO] [stdout]   --> src/dataStructures/mod.rs:37:1
[INFO] [stdout]    |
[INFO] [stdout] 37 | type Link<T> = Option<Rc<RefCell<QueueNode<T>>>>;
[INFO] [stdout]    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `QueueNode`
[INFO] [stdout]   --> src/dataStructures/mod.rs:39:8
[INFO] [stdout]    |
[INFO] [stdout] 39 | struct QueueNode<T> {
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `Queue`
[INFO] [stdout]   --> src/dataStructures/mod.rs:43:12
[INFO] [stdout]    |
[INFO] [stdout] 43 | pub struct Queue<T> {
[INFO] [stdout]    |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]   --> src/dataStructures/mod.rs:50:12
[INFO] [stdout]    |
[INFO] [stdout] 50 |     pub fn new() -> Queue<T> {
[INFO] [stdout]    |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `is_empty`
[INFO] [stdout]   --> src/dataStructures/mod.rs:57:12
[INFO] [stdout]    |
[INFO] [stdout] 57 |     pub fn is_empty(&self) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `size`
[INFO] [stdout]   --> src/dataStructures/mod.rs:60:12
[INFO] [stdout]    |
[INFO] [stdout] 60 |     pub fn size(&self) -> usize {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `enqueue`
[INFO] [stdout]   --> src/dataStructures/mod.rs:63:12
[INFO] [stdout]    |
[INFO] [stdout] 63 |     pub fn enqueue(&mut self, item: T) {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `dequeue`
[INFO] [stdout]   --> src/dataStructures/mod.rs:75:12
[INFO] [stdout]    |
[INFO] [stdout] 75 |     pub fn dequeue(&mut self) -> Result<T, String> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `dequeue_back`
[INFO] [stdout]   --> src/dataStructures/mod.rs:90:12
[INFO] [stdout]    |
[INFO] [stdout] 90 |     pub fn dequeue_back(&mut self) -> Result<T, String> {
[INFO] [stdout]    |            ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct is never constructed: `TreeNode`
[INFO] [stdout]    --> src/dataStructures/mod.rs:194:8
[INFO] [stdout]     |
[INFO] [stdout] 194 | struct TreeNode<K, V> {
[INFO] [stdout]     |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `new`
[INFO] [stdout]    --> src/dataStructures/mod.rs:202:12
[INFO] [stdout]     |
[INFO] [stdout] 202 |     pub fn new(key: K, item: V) -> Box<TreeNode<K, V>> {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `contains`
[INFO] [stdout]    --> src/dataStructures/mod.rs:206:12
[INFO] [stdout]     |
[INFO] [stdout] 206 |     pub fn contains(&self, key: K) -> bool {
[INFO] [stdout]     |            ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `get`
[INFO] [stdout]    --> src/dataStructures/mod.rs:220:12
[INFO] [stdout]     |
[INFO] [stdout] 220 |     pub fn get(&self, key: K) -> Option<&V> {
[INFO] [stdout]     |            ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `insert`
[INFO] [stdout]    --> src/dataStructures/mod.rs:234:12
[INFO] [stdout]     |
[INFO] [stdout] 234 |     pub fn insert(&mut self, key: K, item: V) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `print`
[INFO] [stdout]    --> src/dataStructures/mod.rs:248:12
[INFO] [stdout]     |
[INFO] [stdout] 248 |     pub fn print(&self) {
[INFO] [stdout]     |            ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `remove`
[INFO] [stdout]    --> src/dataStructures/mod.rs:260:12
[INFO] [stdout]     |
[INFO] [stdout] 260 |     pub fn remove(&mut self, key: K) {
[INFO] [stdout]     |            ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `delete_min`
[INFO] [stdout]    --> src/dataStructures/mod.rs:325:8
[INFO] [stdout]     |
[INFO] [stdout] 325 |     fn delete_min(&mut self) -> Option<Box<TreeNode<K, V>>> {
[INFO] [stdout]     |        ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function is never used: `min`
[INFO] [stdout]    --> src/dataStructures/mod.rs:346:8
[INFO] [stdout]     |
[INFO] [stdout] 346 |     fn min(&mut self) -> Option<Box<TreeNode<K, V>>> {
[INFO] [stdout]     |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: module `dataStructures` should have a snake case name
[INFO] [stdout]  --> src/main.rs:5:5
[INFO] [stdout]   |
[INFO] [stdout] 5 | mod dataStructures;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^ help: convert the identifier to snake case: `data_structures`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Equal` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:208:13
[INFO] [stdout]     |
[INFO] [stdout] 208 |             _Equal => true,
[INFO] [stdout]     |             ^^^^^^ help: convert the identifier to snake case: `_equal`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Less` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:209:13
[INFO] [stdout]     |
[INFO] [stdout] 209 |             _Less => match self.left {
[INFO] [stdout]     |             ^^^^^ help: convert the identifier to snake case: `_less`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Greater` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:213:13
[INFO] [stdout]     |
[INFO] [stdout] 213 |             _Greater => match self.right {
[INFO] [stdout]     |             ^^^^^^^^ help: convert the identifier to snake case: `_greater`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Equal` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:222:13
[INFO] [stdout]     |
[INFO] [stdout] 222 |             _Equal => Some(&self.data),
[INFO] [stdout]     |             ^^^^^^ help: convert the identifier to snake case: `_equal`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Less` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:223:13
[INFO] [stdout]     |
[INFO] [stdout] 223 |             _Less => match self.right {
[INFO] [stdout]     |             ^^^^^ help: convert the identifier to snake case: `_less`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Greater` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:227:13
[INFO] [stdout]     |
[INFO] [stdout] 227 |             _Greater => match self.left {
[INFO] [stdout]     |             ^^^^^^^^ help: convert the identifier to snake case: `_greater`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Equal` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:236:13
[INFO] [stdout]     |
[INFO] [stdout] 236 |             _Equal => {}, // do nothing; item is already inside the tree
[INFO] [stdout]     |             ^^^^^^ help: convert the identifier to snake case: `_equal`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Less` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:237:13
[INFO] [stdout]     |
[INFO] [stdout] 237 |             _Less => match self.right {
[INFO] [stdout]     |             ^^^^^ help: convert the identifier to snake case: `_less`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Greater` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:241:13
[INFO] [stdout]     |
[INFO] [stdout] 241 |             _Greater => match self.left {
[INFO] [stdout]     |             ^^^^^^^^ help: convert the identifier to snake case: `_greater`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Equal` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:265:21
[INFO] [stdout]     |
[INFO] [stdout] 265 |                     _Equal => match (&node.left, &node.right) {
[INFO] [stdout]     |                     ^^^^^^ help: convert the identifier to snake case: `_equal`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Greater` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:287:21
[INFO] [stdout]     |
[INFO] [stdout] 287 |                     _Greater => node.remove(key),
[INFO] [stdout]     |                     ^^^^^^^^ help: convert the identifier to snake case: `_greater`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `_Less` should have a snake case name
[INFO] [stdout]    --> src/dataStructures/mod.rs:288:21
[INFO] [stdout]     |
[INFO] [stdout] 288 |                     _Less => {}
[INFO] [stdout]     |                     ^^^^^ help: convert the identifier to snake case: `_less`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 47 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished dev [unoptimized + debuginfo] target(s) in 0.54s
[INFO] running `Command { std: "docker" "inspect" "9ccdb9a59632426d10a5af525cbef2f149a3b1d034d58d86ab552ba850d1c290", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "9ccdb9a59632426d10a5af525cbef2f149a3b1d034d58d86ab552ba850d1c290", kill_on_drop: false }`
[INFO] [stdout] 9ccdb9a59632426d10a5af525cbef2f149a3b1d034d58d86ab552ba850d1c290