[INFO] cloning repository https://github.com/Acasune/rs-library
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/Acasune/rs-library" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FAcasune%2Frs-library", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FAcasune%2Frs-library'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] c28e04e5d47aec38fbfe40b51e29764d9ef479fd
[INFO] testing Acasune/rs-library against master#d98a5da813da67eb189387b8ccfb73cf481275d8+rustflags=-Copt-level=3 for pr-138759
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FAcasune%2Frs-library" "/workspace/builds/worker-3-tc1/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-3-tc1/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/Acasune/rs-library
[INFO] finished tweaking git repo https://github.com/Acasune/rs-library
[INFO] tweaked toml for git repo https://github.com/Acasune/rs-library written to /workspace/builds/worker-3-tc1/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/Acasune/rs-library on toolchain d98a5da813da67eb189387b8ccfb73cf481275d8
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+d98a5da813da67eb189387b8ccfb73cf481275d8" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/Acasune/rs-library already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+d98a5da813da67eb189387b8ccfb73cf481275d8" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+d98a5da813da67eb189387b8ccfb73cf481275d8" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] f908f306e226fc04565c7190f28b91d05cb50d6b23e65f8162ef69908556ad17
[INFO] running `Command { std: "docker" "start" "-a" "f908f306e226fc04565c7190f28b91d05cb50d6b23e65f8162ef69908556ad17", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "f908f306e226fc04565c7190f28b91d05cb50d6b23e65f8162ef69908556ad17", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "f908f306e226fc04565c7190f28b91d05cb50d6b23e65f8162ef69908556ad17", kill_on_drop: false }`
[INFO] [stdout] f908f306e226fc04565c7190f28b91d05cb50d6b23e65f8162ef69908556ad17
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid -Copt-level=3" "-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:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+d98a5da813da67eb189387b8ccfb73cf481275d8" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 778c1bf5617877576da46c61b7e6ef26a490a7979ceba551123c16c4c3f79ac0
[INFO] running `Command { std: "docker" "start" "-a" "778c1bf5617877576da46c61b7e6ef26a490a7979ceba551123c16c4c3f79ac0", kill_on_drop: false }`
[INFO] [stderr]    Compiling rs-library v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: type `mod_combination` should have an upper camel case name
[INFO] [stdout]  --> src/algorithms/mod_combination.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct mod_combination {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^ help: convert the identifier to upper camel case: `ModCombination`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_camel_case_types)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `cnt` is assigned to, but never used
[INFO] [stdout]   --> src/data_structures/range_add_query_tree.rs:16:17
[INFO] [stdout]    |
[INFO] [stdout] 16 |         let mut cnt = 0;
[INFO] [stdout]    |                 ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: consider using `_cnt` instead
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/data_structures/range_add_query_tree.rs:42:19
[INFO] [stdout]    |
[INFO] [stdout] 42 |     fn sum(&self, mut pos: usize) -> i64 {
[INFO] [stdout]    |                   ----^^^
[INFO] [stdout]    |                   |
[INFO] [stdout]    |                   help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/data_structures/union_find.rs:15:13
[INFO] [stdout]    |
[INFO] [stdout] 15 |         let mut rank = vec![1; n];
[INFO] [stdout]    |             ----^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `eratosthenes` is never used
[INFO] [stdout]  --> src/algorithms/eratosthenes.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn eratosthenes(size: usize) -> Vec<bool> {
[INFO] [stdout]   |    ^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `get_primes` is never used
[INFO] [stdout]   --> src/algorithms/eratosthenes.rs:17:4
[INFO] [stdout]    |
[INFO] [stdout] 17 | fn get_primes(size: usize) -> Vec<i64> {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `ext_gcd` is never used
[INFO] [stdout]  --> src/algorithms/ext_gcd.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn ext_gcd(a: i64, b: i64) -> (i64, i64, i64) {
[INFO] [stdout]   |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `gcd` is never used
[INFO] [stdout]   --> src/algorithms/ext_gcd.rs:10:4
[INFO] [stdout]    |
[INFO] [stdout] 10 | fn gcd(a: i64, b: i64) -> i64 {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lcm` is never used
[INFO] [stdout]   --> src/algorithms/ext_gcd.rs:14:4
[INFO] [stdout]    |
[INFO] [stdout] 14 | fn lcm(a: i64, b: i64) -> i64 {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `mod_combination` is never constructed
[INFO] [stdout]  --> src/algorithms/mod_combination.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct mod_combination {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `com`, and `multi_choose` are never used
[INFO] [stdout]   --> src/algorithms/mod_combination.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout] 8  | impl mod_combination {
[INFO] [stdout]    | -------------------- associated items in this implementation
[INFO] [stdout] 9  |     fn new(N: usize, md: usize) -> mod_combination {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn com(&self, n: usize, k: usize) -> usize {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn multi_choose(&self, n: usize, k: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `mod_pow` is never used
[INFO] [stdout]  --> src/algorithms/mod_pow.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn mod_pow(base: i64, power: i64, md: i64) -> i64 {
[INFO] [stdout]   |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `FenwickTree` is never constructed
[INFO] [stdout]  --> src/data_structures/fenwick_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct FenwickTree<T> {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `add`, `sum`, and `query` are never used
[INFO] [stdout]   --> src/data_structures/fenwick_tree.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 7  | / impl<T> FenwickTree<T>
[INFO] [stdout] 8  | | where
[INFO] [stdout] 9  | |     T: Clone,
[INFO] [stdout] 10 | |     T: std::ops::AddAssign<T>,
[INFO] [stdout]    | |______________________________- associated items in this implementation
[INFO] [stdout] 11 |   {
[INFO] [stdout] 12 |       fn new(n: usize, e: T) -> Self {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |       fn add(&mut self, mut pos: usize, x: T) {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |       fn sum(&self, mut pos: usize) -> T
[INFO] [stdout]    |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |       fn query(&self, l: usize, r: usize) -> T
[INFO] [stdout]    |          ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `PURQ` is never constructed
[INFO] [stdout]  --> src/data_structures/point_update_range_query.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct PURQ<T, F> {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `update`, `update_tmp`, `update_all`, and `find` are never used
[INFO] [stdout]   --> src/data_structures/point_update_range_query.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | / impl<T, F> PURQ<T, F>
[INFO] [stdout] 11 | | where
[INFO] [stdout] 12 | |     T: Clone,
[INFO] [stdout] 13 | |     F: Fn(&T, &T) -> T,
[INFO] [stdout]    | |_______________________- associated items in this implementation
[INFO] [stdout] 14 |   {
[INFO] [stdout] 15 |       fn new(n: usize, e: T, op: F) -> Self {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 24 |       fn update(&mut self, pos: usize, v: T) {
[INFO] [stdout]    |          ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |       fn update_tmp(&mut self, pos: usize, v: T) {
[INFO] [stdout]    |          ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |       fn update_all(&mut self) {
[INFO] [stdout]    |          ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |       fn find(&self, l: usize, r: usize) -> T {
[INFO] [stdout]    |          ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `RangeAddQueryTree` is never constructed
[INFO] [stdout]  --> src/data_structures/range_add_query_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct RangeAddQueryTree {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `add_sub`, `add`, `sum_sub`, `sum`, and `query` are never used
[INFO] [stdout]   --> src/data_structures/range_add_query_tree.rs:7:8
[INFO] [stdout]    |
[INFO] [stdout] 6  | impl RangeAddQueryTree {
[INFO] [stdout]    | ---------------------- associated items in this implementation
[INFO] [stdout] 7  |     fn new(n: usize) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn add_sub(&mut self, bit: usize, mut pos: usize, x: i64) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn add(&mut self, l: usize, r: usize, x: i64) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn sum_sub(&self, bit: usize, mut pos: usize) -> i64 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn sum(&self, mut pos: usize) -> i64 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 46 |     fn query(&self, l: usize, r: usize) -> i64 {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `UnionFindTree` is never constructed
[INFO] [stdout]  --> src/data_structures/union_find.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct UnionFindTree {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `UnionFind` is never used
[INFO] [stdout]  --> src/data_structures/union_find.rs:6:7
[INFO] [stdout]   |
[INFO] [stdout] 6 | trait UnionFind {
[INFO] [stdout]   |       ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bfs` is never used
[INFO] [stdout]  --> src/snippets/dfs_bfs.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn bfs(s: usize, G: &Vec<Vec<usize>>) -> Vec<usize> {
[INFO] [stdout]   |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `dfs` is never used
[INFO] [stdout]   --> src/snippets/dfs_bfs.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn dfs(s: usize, G: &Vec<Vec<usize>>) -> Vec<usize> {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `dijkstra` is never used
[INFO] [stdout]  --> src/snippets/dijkstra.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn dijkstra(s: usize, E: &Vec<Vec<(usize, usize)>>) -> Vec<usize> {
[INFO] [stdout]   |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `clockwise_rotate` is never used
[INFO] [stdout]  --> src/snippets/vectors_rotates.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn clockwise_rotate<T>(graph: &Vec<Vec<T>>) -> Vec<Vec<T>>
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `anticlockwise_rotate` is never used
[INFO] [stdout]   --> src/snippets/vectors_rotates.rs:15:4
[INFO] [stdout]    |
[INFO] [stdout] 15 | fn anticlockwise_rotate<T>(graph: &Vec<Vec<T>>) -> Vec<Vec<T>>
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `N` should have a snake case name
[INFO] [stdout]  --> src/algorithms/mod_combination.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 9 |     fn new(N: usize, md: usize) -> mod_combination {
[INFO] [stdout]   |            ^ help: convert the identifier to snake case: `n`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `G` should have a snake case name
[INFO] [stdout]  --> src/snippets/dfs_bfs.rs:1:18
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn bfs(s: usize, G: &Vec<Vec<usize>>) -> Vec<usize> {
[INFO] [stdout]   |                  ^ help: convert the identifier to snake case: `g`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `G` should have a snake case name
[INFO] [stdout]   --> src/snippets/dfs_bfs.rs:22:18
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn dfs(s: usize, G: &Vec<Vec<usize>>) -> Vec<usize> {
[INFO] [stdout]    |                  ^ help: convert the identifier to snake case: `g`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `E` should have a snake case name
[INFO] [stdout]  --> src/snippets/dijkstra.rs:3:23
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn dijkstra(s: usize, E: &Vec<Vec<(usize, usize)>>) -> Vec<usize> {
[INFO] [stdout]   |                       ^ help: convert the identifier to snake case: `e`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `N` should have a snake case name
[INFO] [stdout]  --> src/snippets/dijkstra.rs:4:9
[INFO] [stdout]   |
[INFO] [stdout] 4 |     let N = E.len();
[INFO] [stdout]   |         ^ help: convert the identifier to snake case: `n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `H` should have a snake case name
[INFO] [stdout]  --> src/snippets/vectors_rotates.rs:5:9
[INFO] [stdout]   |
[INFO] [stdout] 5 |     let H = graph.len();
[INFO] [stdout]   |         ^ help: convert the identifier to snake case: `h`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `W` should have a snake case name
[INFO] [stdout]  --> src/snippets/vectors_rotates.rs:6:9
[INFO] [stdout]   |
[INFO] [stdout] 6 |     let W = graph[0].len();
[INFO] [stdout]   |         ^ help: convert the identifier to snake case (notice the capitalization): `w`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `H` should have a snake case name
[INFO] [stdout]   --> src/snippets/vectors_rotates.rs:19:9
[INFO] [stdout]    |
[INFO] [stdout] 19 |     let H = graph.len();
[INFO] [stdout]    |         ^ help: convert the identifier to snake case: `h`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `W` should have a snake case name
[INFO] [stdout]   --> src/snippets/vectors_rotates.rs:20:9
[INFO] [stdout]    |
[INFO] [stdout] 20 |     let W = graph[0].len();
[INFO] [stdout]    |         ^ help: convert the identifier to snake case (notice the capitalization): `w`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.60s
[INFO] running `Command { std: "docker" "inspect" "778c1bf5617877576da46c61b7e6ef26a490a7979ceba551123c16c4c3f79ac0", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "778c1bf5617877576da46c61b7e6ef26a490a7979ceba551123c16c4c3f79ac0", kill_on_drop: false }`
[INFO] [stdout] 778c1bf5617877576da46c61b7e6ef26a490a7979ceba551123c16c4c3f79ac0
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid -Copt-level=3" "-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:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+d98a5da813da67eb189387b8ccfb73cf481275d8" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 296c42ff9f8741615f0b22f2e51f0e34f35c380b76744fa252eb86213d348290
[INFO] running `Command { std: "docker" "start" "-a" "296c42ff9f8741615f0b22f2e51f0e34f35c380b76744fa252eb86213d348290", kill_on_drop: false }`
[INFO] [stdout] warning: type `mod_combination` should have an upper camel case name
[INFO] [stdout]  --> src/algorithms/mod_combination.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct mod_combination {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^ help: convert the identifier to upper camel case: `ModCombination`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_camel_case_types)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `cnt` is assigned to, but never used
[INFO] [stdout]   --> src/data_structures/range_add_query_tree.rs:16:17
[INFO] [stdout]    |
[INFO] [stdout] 16 |         let mut cnt = 0;
[INFO] [stdout]    |                 ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: consider using `_cnt` instead
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/data_structures/range_add_query_tree.rs:42:19
[INFO] [stdout]    |
[INFO] [stdout] 42 |     fn sum(&self, mut pos: usize) -> i64 {
[INFO] [stdout]    |                   ----^^^
[INFO] [stdout]    |                   |
[INFO] [stdout]    |                   help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/data_structures/union_find.rs:15:13
[INFO] [stdout]    |
[INFO] [stdout] 15 |         let mut rank = vec![1; n];
[INFO] [stdout]    |             ----^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `eratosthenes` is never used
[INFO] [stdout]  --> src/algorithms/eratosthenes.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn eratosthenes(size: usize) -> Vec<bool> {
[INFO] [stdout]   |    ^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `get_primes` is never used
[INFO] [stdout]   --> src/algorithms/eratosthenes.rs:17:4
[INFO] [stdout]    |
[INFO] [stdout] 17 | fn get_primes(size: usize) -> Vec<i64> {
[INFO] [stdout]    |    ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `ext_gcd` is never used
[INFO] [stdout]  --> src/algorithms/ext_gcd.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn ext_gcd(a: i64, b: i64) -> (i64, i64, i64) {
[INFO] [stdout]   |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `gcd` is never used
[INFO] [stdout]   --> src/algorithms/ext_gcd.rs:10:4
[INFO] [stdout]    |
[INFO] [stdout] 10 | fn gcd(a: i64, b: i64) -> i64 {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `lcm` is never used
[INFO] [stdout]   --> src/algorithms/ext_gcd.rs:14:4
[INFO] [stdout]    |
[INFO] [stdout] 14 | fn lcm(a: i64, b: i64) -> i64 {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `mod_combination` is never constructed
[INFO] [stdout]  --> src/algorithms/mod_combination.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct mod_combination {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `com`, and `multi_choose` are never used
[INFO] [stdout]   --> src/algorithms/mod_combination.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout] 8  | impl mod_combination {
[INFO] [stdout]    | -------------------- associated items in this implementation
[INFO] [stdout] 9  |     fn new(N: usize, md: usize) -> mod_combination {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn com(&self, n: usize, k: usize) -> usize {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn multi_choose(&self, n: usize, k: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `mod_pow` is never used
[INFO] [stdout]  --> src/algorithms/mod_pow.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn mod_pow(base: i64, power: i64, md: i64) -> i64 {
[INFO] [stdout]   |    ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `FenwickTree` is never constructed
[INFO] [stdout]  --> src/data_structures/fenwick_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct FenwickTree<T> {
[INFO] [stdout]   |        ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `add`, `sum`, and `query` are never used
[INFO] [stdout]   --> src/data_structures/fenwick_tree.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 7  | / impl<T> FenwickTree<T>
[INFO] [stdout] 8  | | where
[INFO] [stdout] 9  | |     T: Clone,
[INFO] [stdout] 10 | |     T: std::ops::AddAssign<T>,
[INFO] [stdout]    | |______________________________- associated items in this implementation
[INFO] [stdout] 11 |   {
[INFO] [stdout] 12 |       fn new(n: usize, e: T) -> Self {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |       fn add(&mut self, mut pos: usize, x: T) {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 27 |       fn sum(&self, mut pos: usize) -> T
[INFO] [stdout]    |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 41 |       fn query(&self, l: usize, r: usize) -> T
[INFO] [stdout]    |          ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `PURQ` is never constructed
[INFO] [stdout]  --> src/data_structures/point_update_range_query.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct PURQ<T, F> {
[INFO] [stdout]   |        ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `update`, `update_tmp`, `update_all`, and `find` are never used
[INFO] [stdout]   --> src/data_structures/point_update_range_query.rs:15:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | / impl<T, F> PURQ<T, F>
[INFO] [stdout] 11 | | where
[INFO] [stdout] 12 | |     T: Clone,
[INFO] [stdout] 13 | |     F: Fn(&T, &T) -> T,
[INFO] [stdout]    | |_______________________- associated items in this implementation
[INFO] [stdout] 14 |   {
[INFO] [stdout] 15 |       fn new(n: usize, e: T, op: F) -> Self {
[INFO] [stdout]    |          ^^^
[INFO] [stdout] ...
[INFO] [stdout] 24 |       fn update(&mut self, pos: usize, v: T) {
[INFO] [stdout]    |          ^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |       fn update_tmp(&mut self, pos: usize, v: T) {
[INFO] [stdout]    |          ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 39 |       fn update_all(&mut self) {
[INFO] [stdout]    |          ^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 45 |       fn find(&self, l: usize, r: usize) -> T {
[INFO] [stdout]    |          ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `RangeAddQueryTree` is never constructed
[INFO] [stdout]  --> src/data_structures/range_add_query_tree.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct RangeAddQueryTree {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `add_sub`, `add`, `sum_sub`, `sum`, and `query` are never used
[INFO] [stdout]   --> src/data_structures/range_add_query_tree.rs:7:8
[INFO] [stdout]    |
[INFO] [stdout] 6  | impl RangeAddQueryTree {
[INFO] [stdout]    | ---------------------- associated items in this implementation
[INFO] [stdout] 7  |     fn new(n: usize) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 15 |     fn add_sub(&mut self, bit: usize, mut pos: usize, x: i64) {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     fn add(&mut self, l: usize, r: usize, x: i64) {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 32 |     fn sum_sub(&self, bit: usize, mut pos: usize) -> i64 {
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 42 |     fn sum(&self, mut pos: usize) -> i64 {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 46 |     fn query(&self, l: usize, r: usize) -> i64 {
[INFO] [stdout]    |        ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `UnionFindTree` is never constructed
[INFO] [stdout]  --> src/data_structures/union_find.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct UnionFindTree {
[INFO] [stdout]   |        ^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: trait `UnionFind` is never used
[INFO] [stdout]  --> src/data_structures/union_find.rs:6:7
[INFO] [stdout]   |
[INFO] [stdout] 6 | trait UnionFind {
[INFO] [stdout]   |       ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bfs` is never used
[INFO] [stdout]  --> src/snippets/dfs_bfs.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn bfs(s: usize, G: &Vec<Vec<usize>>) -> Vec<usize> {
[INFO] [stdout]   |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `dfs` is never used
[INFO] [stdout]   --> src/snippets/dfs_bfs.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn dfs(s: usize, G: &Vec<Vec<usize>>) -> Vec<usize> {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `dijkstra` is never used
[INFO] [stdout]  --> src/snippets/dijkstra.rs:3:4
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn dijkstra(s: usize, E: &Vec<Vec<(usize, usize)>>) -> Vec<usize> {
[INFO] [stdout]   |    ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `clockwise_rotate` is never used
[INFO] [stdout]  --> src/snippets/vectors_rotates.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn clockwise_rotate<T>(graph: &Vec<Vec<T>>) -> Vec<Vec<T>>
[INFO] [stdout]   |    ^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `anticlockwise_rotate` is never used
[INFO] [stdout]   --> src/snippets/vectors_rotates.rs:15:4
[INFO] [stdout]    |
[INFO] [stdout] 15 | fn anticlockwise_rotate<T>(graph: &Vec<Vec<T>>) -> Vec<Vec<T>>
[INFO] [stdout]    |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `N` should have a snake case name
[INFO] [stdout]  --> src/algorithms/mod_combination.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 9 |     fn new(N: usize, md: usize) -> mod_combination {
[INFO] [stdout]   |            ^ help: convert the identifier to snake case: `n`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `G` should have a snake case name
[INFO] [stdout]  --> src/snippets/dfs_bfs.rs:1:18
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn bfs(s: usize, G: &Vec<Vec<usize>>) -> Vec<usize> {
[INFO] [stdout]   |                  ^ help: convert the identifier to snake case: `g`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling rs-library v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: variable `G` should have a snake case name
[INFO] [stdout]   --> src/snippets/dfs_bfs.rs:22:18
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn dfs(s: usize, G: &Vec<Vec<usize>>) -> Vec<usize> {
[INFO] [stdout]    |                  ^ help: convert the identifier to snake case: `g`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `E` should have a snake case name
[INFO] [stdout]  --> src/snippets/dijkstra.rs:3:23
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn dijkstra(s: usize, E: &Vec<Vec<(usize, usize)>>) -> Vec<usize> {
[INFO] [stdout]   |                       ^ help: convert the identifier to snake case: `e`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `N` should have a snake case name
[INFO] [stdout]  --> src/snippets/dijkstra.rs:4:9
[INFO] [stdout]   |
[INFO] [stdout] 4 |     let N = E.len();
[INFO] [stdout]   |         ^ help: convert the identifier to snake case: `n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `H` should have a snake case name
[INFO] [stdout]  --> src/snippets/vectors_rotates.rs:5:9
[INFO] [stdout]   |
[INFO] [stdout] 5 |     let H = graph.len();
[INFO] [stdout]   |         ^ help: convert the identifier to snake case: `h`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `W` should have a snake case name
[INFO] [stdout]  --> src/snippets/vectors_rotates.rs:6:9
[INFO] [stdout]   |
[INFO] [stdout] 6 |     let W = graph[0].len();
[INFO] [stdout]   |         ^ help: convert the identifier to snake case (notice the capitalization): `w`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `H` should have a snake case name
[INFO] [stdout]   --> src/snippets/vectors_rotates.rs:19:9
[INFO] [stdout]    |
[INFO] [stdout] 19 |     let H = graph.len();
[INFO] [stdout]    |         ^ help: convert the identifier to snake case: `h`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `W` should have a snake case name
[INFO] [stdout]   --> src/snippets/vectors_rotates.rs:20:9
[INFO] [stdout]    |
[INFO] [stdout] 20 |     let W = graph[0].len();
[INFO] [stdout]    |         ^ help: convert the identifier to snake case (notice the capitalization): `w`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unnecessary parentheses around function argument
[INFO] [stdout]   --> src/algorithms/ext_gcd.rs:65:29
[INFO] [stdout]    |
[INFO] [stdout] 65 |         let actual = lcm(2, (2 * 2));
[INFO] [stdout]    |                             ^     ^
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_parens)]` on by default
[INFO] [stdout] help: remove these parentheses
[INFO] [stdout]    |
[INFO] [stdout] 65 -         let actual = lcm(2, (2 * 2));
[INFO] [stdout] 65 +         let actual = lcm(2, 2 * 2);
[INFO] [stdout]    |
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `mod_combination` should have an upper camel case name
[INFO] [stdout]  --> src/algorithms/mod_combination.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct mod_combination {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^ help: convert the identifier to upper camel case: `ModCombination`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_camel_case_types)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: type `dist_to` should have an upper camel case name
[INFO] [stdout]   --> src/snippets/dijkstra.rs:31:14
[INFO] [stdout]    |
[INFO] [stdout] 31 |         type dist_to = (usize, usize);
[INFO] [stdout]    |              ^^^^^^^ help: convert the identifier to upper camel case: `DistTo`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `g`
[INFO] [stdout]   --> src/algorithms/ext_gcd.rs:33:32
[INFO] [stdout]    |
[INFO] [stdout] 33 |             let (mut x, mut y, g) = ext_gcd(a, b);
[INFO] [stdout]    |                                ^ help: if this is intentional, prefix it with an underscore: `_g`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `cnt` is assigned to, but never used
[INFO] [stdout]   --> src/data_structures/range_add_query_tree.rs:16:17
[INFO] [stdout]    |
[INFO] [stdout] 16 |         let mut cnt = 0;
[INFO] [stdout]    |                 ^^^
[INFO] [stdout]    |
[INFO] [stdout]    = note: consider using `_cnt` instead
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/data_structures/range_add_query_tree.rs:42:19
[INFO] [stdout]    |
[INFO] [stdout] 42 |     fn sum(&self, mut pos: usize) -> i64 {
[INFO] [stdout]    |                   ----^^^
[INFO] [stdout]    |                   |
[INFO] [stdout]    |                   help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/data_structures/union_find.rs:15:13
[INFO] [stdout]    |
[INFO] [stdout] 15 |         let mut rank = vec![1; n];
[INFO] [stdout]    |             ----^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `mod_combination` is never constructed
[INFO] [stdout]  --> src/algorithms/mod_combination.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct mod_combination {
[INFO] [stdout]   |        ^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated items `new`, `com`, and `multi_choose` are never used
[INFO] [stdout]   --> src/algorithms/mod_combination.rs:9:8
[INFO] [stdout]    |
[INFO] [stdout] 8  | impl mod_combination {
[INFO] [stdout]    | -------------------- associated items in this implementation
[INFO] [stdout] 9  |     fn new(N: usize, md: usize) -> mod_combination {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 31 |     fn com(&self, n: usize, k: usize) -> usize {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] ...
[INFO] [stdout] 38 |     fn multi_choose(&self, n: usize, k: usize) -> usize {
[INFO] [stdout]    |        ^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `update` is never used
[INFO] [stdout]   --> src/data_structures/point_update_range_query.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | / impl<T, F> PURQ<T, F>
[INFO] [stdout] 11 | | where
[INFO] [stdout] 12 | |     T: Clone,
[INFO] [stdout] 13 | |     F: Fn(&T, &T) -> T,
[INFO] [stdout]    | |_______________________- method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 24 |       fn update(&mut self, pos: usize, v: T) {
[INFO] [stdout]    |          ^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: field `size` is never read
[INFO] [stdout]  --> src/data_structures/union_find.rs:4:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct UnionFindTree {
[INFO] [stdout]   |        ------------- field in this struct
[INFO] [stdout] ...
[INFO] [stdout] 4 |     size: usize,
[INFO] [stdout]   |     ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `is_same` is never used
[INFO] [stdout]   --> src/data_structures/union_find.rs:10:8
[INFO] [stdout]    |
[INFO] [stdout] 6  | trait UnionFind {
[INFO] [stdout]    |       --------- method in this trait
[INFO] [stdout] ...
[INFO] [stdout] 10 |     fn is_same(&mut self, x: usize, y: usize) -> bool;
[INFO] [stdout]    |        ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `bfs` is never used
[INFO] [stdout]  --> src/snippets/dfs_bfs.rs:1:4
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn bfs(s: usize, G: &Vec<Vec<usize>>) -> Vec<usize> {
[INFO] [stdout]   |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `dfs` is never used
[INFO] [stdout]   --> src/snippets/dfs_bfs.rs:22:4
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn dfs(s: usize, G: &Vec<Vec<usize>>) -> Vec<usize> {
[INFO] [stdout]    |    ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `N` should have a snake case name
[INFO] [stdout]  --> src/algorithms/mod_combination.rs:9:12
[INFO] [stdout]   |
[INFO] [stdout] 9 |     fn new(N: usize, md: usize) -> mod_combination {
[INFO] [stdout]   |            ^ help: convert the identifier to snake case: `n`
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(non_snake_case)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `G` should have a snake case name
[INFO] [stdout]  --> src/snippets/dfs_bfs.rs:1:18
[INFO] [stdout]   |
[INFO] [stdout] 1 | fn bfs(s: usize, G: &Vec<Vec<usize>>) -> Vec<usize> {
[INFO] [stdout]   |                  ^ help: convert the identifier to snake case: `g`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `G` should have a snake case name
[INFO] [stdout]   --> src/snippets/dfs_bfs.rs:22:18
[INFO] [stdout]    |
[INFO] [stdout] 22 | fn dfs(s: usize, G: &Vec<Vec<usize>>) -> Vec<usize> {
[INFO] [stdout]    |                  ^ help: convert the identifier to snake case: `g`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `E` should have a snake case name
[INFO] [stdout]  --> src/snippets/dijkstra.rs:3:23
[INFO] [stdout]   |
[INFO] [stdout] 3 | fn dijkstra(s: usize, E: &Vec<Vec<(usize, usize)>>) -> Vec<usize> {
[INFO] [stdout]   |                       ^ help: convert the identifier to snake case: `e`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `N` should have a snake case name
[INFO] [stdout]  --> src/snippets/dijkstra.rs:4:9
[INFO] [stdout]   |
[INFO] [stdout] 4 |     let N = E.len();
[INFO] [stdout]   |         ^ help: convert the identifier to snake case: `n`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `INF` should have a snake case name
[INFO] [stdout]   --> src/snippets/dijkstra.rs:38:17
[INFO] [stdout]    |
[INFO] [stdout] 38 |             let INF = usize::MAX / 10;
[INFO] [stdout]    |                 ^^^ help: convert the identifier to snake case: `inf`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `E` should have a snake case name
[INFO] [stdout]   --> src/snippets/dijkstra.rs:39:21
[INFO] [stdout]    |
[INFO] [stdout] 39 |             let mut E = vec![vec![]; n_v];
[INFO] [stdout]    |                     ^ help: convert the identifier to snake case: `e`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `H` should have a snake case name
[INFO] [stdout]  --> src/snippets/vectors_rotates.rs:5:9
[INFO] [stdout]   |
[INFO] [stdout] 5 |     let H = graph.len();
[INFO] [stdout]   |         ^ help: convert the identifier to snake case: `h`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `W` should have a snake case name
[INFO] [stdout]  --> src/snippets/vectors_rotates.rs:6:9
[INFO] [stdout]   |
[INFO] [stdout] 6 |     let W = graph[0].len();
[INFO] [stdout]   |         ^ help: convert the identifier to snake case (notice the capitalization): `w`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `H` should have a snake case name
[INFO] [stdout]   --> src/snippets/vectors_rotates.rs:19:9
[INFO] [stdout]    |
[INFO] [stdout] 19 |     let H = graph.len();
[INFO] [stdout]    |         ^ help: convert the identifier to snake case: `h`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable `W` should have a snake case name
[INFO] [stdout]   --> src/snippets/vectors_rotates.rs:20:9
[INFO] [stdout]    |
[INFO] [stdout] 20 |     let W = graph[0].len();
[INFO] [stdout]    |         ^ help: convert the identifier to snake case (notice the capitalization): `w`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 3.38s
[INFO] running `Command { std: "docker" "inspect" "296c42ff9f8741615f0b22f2e51f0e34f35c380b76744fa252eb86213d348290", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "296c42ff9f8741615f0b22f2e51f0e34f35c380b76744fa252eb86213d348290", kill_on_drop: false }`
[INFO] [stdout] 296c42ff9f8741615f0b22f2e51f0e34f35c380b76744fa252eb86213d348290
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid -Copt-level=3" "-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:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+d98a5da813da67eb189387b8ccfb73cf481275d8" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] b745a25b7e9c0138d5a332da3dae04e8a039904ac5d0c59120486293871a9403
[INFO] running `Command { std: "docker" "start" "-a" "b745a25b7e9c0138d5a332da3dae04e8a039904ac5d0c59120486293871a9403", kill_on_drop: false }`
[INFO] [stderr] warning: type `mod_combination` should have an upper camel case name
[INFO] [stderr]  --> src/algorithms/mod_combination.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct mod_combination {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^ help: convert the identifier to upper camel case: `ModCombination`
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(non_camel_case_types)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable `cnt` is assigned to, but never used
[INFO] [stderr]   --> src/data_structures/range_add_query_tree.rs:16:17
[INFO] [stderr]    |
[INFO] [stderr] 16 |         let mut cnt = 0;
[INFO] [stderr]    |                 ^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: consider using `_cnt` instead
[INFO] [stderr]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/data_structures/range_add_query_tree.rs:42:19
[INFO] [stderr]    |
[INFO] [stderr] 42 |     fn sum(&self, mut pos: usize) -> i64 {
[INFO] [stderr]    |                   ----^^^
[INFO] [stderr]    |                   |
[INFO] [stderr]    |                   help: remove this `mut`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_mut)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/data_structures/union_find.rs:15:13
[INFO] [stderr]    |
[INFO] [stderr] 15 |         let mut rank = vec![1; n];
[INFO] [stderr]    |             ----^^^^
[INFO] [stderr]    |             |
[INFO] [stderr]    |             help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: function `eratosthenes` is never used
[INFO] [stderr]  --> src/algorithms/eratosthenes.rs:1:4
[INFO] [stderr]   |
[INFO] [stderr] 1 | fn eratosthenes(size: usize) -> Vec<bool> {
[INFO] [stderr]   |    ^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: function `get_primes` is never used
[INFO] [stderr]   --> src/algorithms/eratosthenes.rs:17:4
[INFO] [stderr]    |
[INFO] [stderr] 17 | fn get_primes(size: usize) -> Vec<i64> {
[INFO] [stderr]    |    ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `ext_gcd` is never used
[INFO] [stderr]  --> src/algorithms/ext_gcd.rs:1:4
[INFO] [stderr]   |
[INFO] [stderr] 1 | fn ext_gcd(a: i64, b: i64) -> (i64, i64, i64) {
[INFO] [stderr]   |    ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `gcd` is never used
[INFO] [stderr]   --> src/algorithms/ext_gcd.rs:10:4
[INFO] [stderr]    |
[INFO] [stderr] 10 | fn gcd(a: i64, b: i64) -> i64 {
[INFO] [stderr]    |    ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `lcm` is never used
[INFO] [stderr]   --> src/algorithms/ext_gcd.rs:14:4
[INFO] [stderr]    |
[INFO] [stderr] 14 | fn lcm(a: i64, b: i64) -> i64 {
[INFO] [stderr]    |    ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `mod_combination` is never constructed
[INFO] [stderr]  --> src/algorithms/mod_combination.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct mod_combination {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `com`, and `multi_choose` are never used
[INFO] [stderr]   --> src/algorithms/mod_combination.rs:9:8
[INFO] [stderr]    |
[INFO] [stderr] 8  | impl mod_combination {
[INFO] [stderr]    | -------------------- associated items in this implementation
[INFO] [stderr] 9  |     fn new(N: usize, md: usize) -> mod_combination {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 31 |     fn com(&self, n: usize, k: usize) -> usize {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 38 |     fn multi_choose(&self, n: usize, k: usize) -> usize {
[INFO] [stderr]    |        ^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `mod_pow` is never used
[INFO] [stderr]  --> src/algorithms/mod_pow.rs:1:4
[INFO] [stderr]   |
[INFO] [stderr] 1 | fn mod_pow(base: i64, power: i64, md: i64) -> i64 {
[INFO] [stderr]   |    ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `FenwickTree` is never constructed
[INFO] [stderr]  --> src/data_structures/fenwick_tree.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct FenwickTree<T> {
[INFO] [stderr]   |        ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `add`, `sum`, and `query` are never used
[INFO] [stderr]   --> src/data_structures/fenwick_tree.rs:12:8
[INFO] [stderr]    |
[INFO] [stderr] 7  | / impl<T> FenwickTree<T>
[INFO] [stderr] 8  | | where
[INFO] [stderr] 9  | |     T: Clone,
[INFO] [stderr] 10 | |     T: std::ops::AddAssign<T>,
[INFO] [stderr]    | |______________________________- associated items in this implementation
[INFO] [stderr] 11 |   {
[INFO] [stderr] 12 |       fn new(n: usize, e: T) -> Self {
[INFO] [stderr]    |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 20 |       fn add(&mut self, mut pos: usize, x: T) {
[INFO] [stderr]    |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 27 |       fn sum(&self, mut pos: usize) -> T
[INFO] [stderr]    |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 41 |       fn query(&self, l: usize, r: usize) -> T
[INFO] [stderr]    |          ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `PURQ` is never constructed
[INFO] [stderr]  --> src/data_structures/point_update_range_query.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | struct PURQ<T, F> {
[INFO] [stderr]   |        ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `update`, `update_tmp`, `update_all`, and `find` are never used
[INFO] [stderr]   --> src/data_structures/point_update_range_query.rs:15:8
[INFO] [stderr]    |
[INFO] [stderr] 10 | / impl<T, F> PURQ<T, F>
[INFO] [stderr] 11 | | where
[INFO] [stderr] 12 | |     T: Clone,
[INFO] [stderr] 13 | |     F: Fn(&T, &T) -> T,
[INFO] [stderr]    | |_______________________- associated items in this implementation
[INFO] [stderr] 14 |   {
[INFO] [stderr] 15 |       fn new(n: usize, e: T, op: F) -> Self {
[INFO] [stderr]    |          ^^^
[INFO] [stderr] ...
[INFO] [stderr] 24 |       fn update(&mut self, pos: usize, v: T) {
[INFO] [stderr]    |          ^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 35 |       fn update_tmp(&mut self, pos: usize, v: T) {
[INFO] [stderr]    |          ^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 39 |       fn update_all(&mut self) {
[INFO] [stderr]    |          ^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 45 |       fn find(&self, l: usize, r: usize) -> T {
[INFO] [stderr]    |          ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `RangeAddQueryTree` is never constructed
[INFO] [stderr]  --> src/data_structures/range_add_query_tree.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct RangeAddQueryTree {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated items `new`, `add_sub`, `add`, `sum_sub`, `sum`, and `query` are never used
[INFO] [stderr]   --> src/data_structures/range_add_query_tree.rs:7:8
[INFO] [stderr]    |
[INFO] [stderr] 6  | impl RangeAddQueryTree {
[INFO] [stderr]    | ---------------------- associated items in this implementation
[INFO] [stderr] 7  |     fn new(n: usize) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 15 |     fn add_sub(&mut self, bit: usize, mut pos: usize, x: i64) {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 25 |     fn add(&mut self, l: usize, r: usize, x: i64) {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 32 |     fn sum_sub(&self, bit: usize, mut pos: usize) -> i64 {
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 42 |     fn sum(&self, mut pos: usize) -> i64 {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] ...
[INFO] [stderr] 46 |     fn query(&self, l: usize, r: usize) -> i64 {
[INFO] [stderr]    |        ^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `UnionFindTree` is never constructed
[INFO] [stderr]  --> src/data_structures/union_find.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct UnionFindTree {
[INFO] [stderr]   |        ^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: trait `UnionFind` is never used
[INFO] [stderr]  --> src/data_structures/union_find.rs:6:7
[INFO] [stderr]   |
[INFO] [stderr] 6 | trait UnionFind {
[INFO] [stderr]   |       ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `bfs` is never used
[INFO] [stderr]  --> src/snippets/dfs_bfs.rs:1:4
[INFO] [stderr]   |
[INFO] [stderr] 1 | fn bfs(s: usize, G: &Vec<Vec<usize>>) -> Vec<usize> {
[INFO] [stderr]   |    ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `dfs` is never used
[INFO] [stderr]   --> src/snippets/dfs_bfs.rs:22:4
[INFO] [stderr]    |
[INFO] [stderr] 22 | fn dfs(s: usize, G: &Vec<Vec<usize>>) -> Vec<usize> {
[INFO] [stderr]    |    ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `dijkstra` is never used
[INFO] [stderr]  --> src/snippets/dijkstra.rs:3:4
[INFO] [stderr]   |
[INFO] [stderr] 3 | fn dijkstra(s: usize, E: &Vec<Vec<(usize, usize)>>) -> Vec<usize> {
[INFO] [stderr]   |    ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `clockwise_rotate` is never used
[INFO] [stderr]  --> src/snippets/vectors_rotates.rs:1:4
[INFO] [stderr]   |
[INFO] [stderr] 1 | fn clockwise_rotate<T>(graph: &Vec<Vec<T>>) -> Vec<Vec<T>>
[INFO] [stderr]   |    ^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `anticlockwise_rotate` is never used
[INFO] [stderr]   --> src/snippets/vectors_rotates.rs:15:4
[INFO] [stderr]    |
[INFO] [stderr] 15 | fn anticlockwise_rotate<T>(graph: &Vec<Vec<T>>) -> Vec<Vec<T>>
[INFO] [stderr]    |    ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: variable `N` should have a snake case name
[INFO] [stderr]  --> src/algorithms/mod_combination.rs:9:12
[INFO] [stderr]   |
[INFO] [stderr] 9 |     fn new(N: usize, md: usize) -> mod_combination {
[INFO] [stderr]   |            ^ help: convert the identifier to snake case: `n`
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(non_snake_case)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable `G` should have a snake case name
[INFO] [stderr]  --> src/snippets/dfs_bfs.rs:1:18
[INFO] [stderr]   |
[INFO] [stderr] 1 | fn bfs(s: usize, G: &Vec<Vec<usize>>) -> Vec<usize> {
[INFO] [stderr]   |                  ^ help: convert the identifier to snake case: `g`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `G` should have a snake case name
[INFO] [stderr]   --> src/snippets/dfs_bfs.rs:22:18
[INFO] [stderr]    |
[INFO] [stderr] 22 | fn dfs(s: usize, G: &Vec<Vec<usize>>) -> Vec<usize> {
[INFO] [stderr]    |                  ^ help: convert the identifier to snake case: `g`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `E` should have a snake case name
[INFO] [stderr]  --> src/snippets/dijkstra.rs:3:23
[INFO] [stderr]   |
[INFO] [stderr] 3 | fn dijkstra(s: usize, E: &Vec<Vec<(usize, usize)>>) -> Vec<usize> {
[INFO] [stderr]   |                       ^ help: convert the identifier to snake case: `e`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `N` should have a snake case name
[INFO] [stderr]  --> src/snippets/dijkstra.rs:4:9
[INFO] [stderr]   |
[INFO] [stderr] 4 |     let N = E.len();
[INFO] [stderr]   |         ^ help: convert the identifier to snake case: `n`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `H` should have a snake case name
[INFO] [stderr]  --> src/snippets/vectors_rotates.rs:5:9
[INFO] [stderr]   |
[INFO] [stderr] 5 |     let H = graph.len();
[INFO] [stderr]   |         ^ help: convert the identifier to snake case: `h`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `W` should have a snake case name
[INFO] [stderr]  --> src/snippets/vectors_rotates.rs:6:9
[INFO] [stderr]   |
[INFO] [stderr] 6 |     let W = graph[0].len();
[INFO] [stderr]   |         ^ help: convert the identifier to snake case (notice the capitalization): `w`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `H` should have a snake case name
[INFO] [stderr]   --> src/snippets/vectors_rotates.rs:19:9
[INFO] [stderr]    |
[INFO] [stderr] 19 |     let H = graph.len();
[INFO] [stderr]    |         ^ help: convert the identifier to snake case: `h`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `W` should have a snake case name
[INFO] [stderr]   --> src/snippets/vectors_rotates.rs:20:9
[INFO] [stderr]    |
[INFO] [stderr] 20 |     let W = graph[0].len();
[INFO] [stderr]    |         ^ help: convert the identifier to snake case (notice the capitalization): `w`
[INFO] [stderr] 
[INFO] [stderr] warning: `rs-library` (lib) generated 34 warnings (run `cargo fix --lib -p rs-library` to apply 2 suggestions)
[INFO] [stderr] warning: unnecessary parentheses around function argument
[INFO] [stderr]   --> src/algorithms/ext_gcd.rs:65:29
[INFO] [stderr]    |
[INFO] [stderr] 65 |         let actual = lcm(2, (2 * 2));
[INFO] [stderr]    |                             ^     ^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_parens)]` on by default
[INFO] [stderr] help: remove these parentheses
[INFO] [stderr]    |
[INFO] [stderr] 65 -         let actual = lcm(2, (2 * 2));
[INFO] [stderr] 65 +         let actual = lcm(2, 2 * 2);
[INFO] [stderr]    |
[INFO] [stderr] 
[INFO] [stderr] warning: type `dist_to` should have an upper camel case name
[INFO] [stderr]   --> src/snippets/dijkstra.rs:31:14
[INFO] [stderr]    |
[INFO] [stderr] 31 |         type dist_to = (usize, usize);
[INFO] [stderr]    |              ^^^^^^^ help: convert the identifier to upper camel case: `DistTo`
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `g`
[INFO] [stderr]   --> src/algorithms/ext_gcd.rs:33:32
[INFO] [stderr]    |
[INFO] [stderr] 33 |             let (mut x, mut y, g) = ext_gcd(a, b);
[INFO] [stderr]    |                                ^ help: if this is intentional, prefix it with an underscore: `_g`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_variables)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable `cnt` is assigned to, but never used
[INFO] [stderr]   --> src/data_structures/range_add_query_tree.rs:16:17
[INFO] [stderr]    |
[INFO] [stderr] 16 |         let mut cnt = 0;
[INFO] [stderr]    |                 ^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: consider using `_cnt` instead
[INFO] [stderr] 
[INFO] [stderr] warning: struct `mod_combination` is never constructed
[INFO] [stderr]  --> src/algorithms/mod_combination.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct mod_combination {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: method `update` is never used
[INFO] [stderr]   --> src/data_structures/point_update_range_query.rs:24:8
[INFO] [stderr]    |
[INFO] [stderr] 10 | / impl<T, F> PURQ<T, F>
[INFO] [stderr] 11 | | where
[INFO] [stderr] 12 | |     T: Clone,
[INFO] [stderr] 13 | |     F: Fn(&T, &T) -> T,
[INFO] [stderr]    | |_______________________- method in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 24 |       fn update(&mut self, pos: usize, v: T) {
[INFO] [stderr]    |          ^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: field `size` is never read
[INFO] [stderr]  --> src/data_structures/union_find.rs:4:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct UnionFindTree {
[INFO] [stderr]   |        ------------- field in this struct
[INFO] [stderr] ...
[INFO] [stderr] 4 |     size: usize,
[INFO] [stderr]   |     ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method `is_same` is never used
[INFO] [stderr]   --> src/data_structures/union_find.rs:10:8
[INFO] [stderr]    |
[INFO] [stderr] 6  | trait UnionFind {
[INFO] [stderr]    |       --------- method in this trait
[INFO] [stderr] ...
[INFO] [stderr] 10 |     fn is_same(&mut self, x: usize, y: usize) -> bool;
[INFO] [stderr]    |        ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: variable `INF` should have a snake case name
[INFO] [stderr]   --> src/snippets/dijkstra.rs:38:17
[INFO] [stderr]    |
[INFO] [stderr] 38 |             let INF = usize::MAX / 10;
[INFO] [stderr]    |                 ^^^ help: convert the identifier to snake case: `inf`
[INFO] [stderr] 
[INFO] [stderr] warning: variable `E` should have a snake case name
[INFO] [stderr]   --> src/snippets/dijkstra.rs:39:21
[INFO] [stderr]    |
[INFO] [stderr] 39 |             let mut E = vec![vec![]; n_v];
[INFO] [stderr]    |                     ^ help: convert the identifier to snake case: `e`
[INFO] [stderr] 
[INFO] [stderr] warning: `rs-library` (lib test) generated 25 warnings (15 duplicates) (run `cargo fix --lib -p rs-library --tests` to apply 1 suggestion)
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.10s
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/rs_library-725456324409adb4)
[INFO] [stdout] 
[INFO] [stdout] running 19 tests
[INFO] [stdout] test algorithms::eratosthenes::tests::test_eratosthenes ... ok
[INFO] [stdout] test algorithms::eratosthenes::tests::test_get_primes ... ok
[INFO] [stdout] test algorithms::ext_gcd::tests::test_find_gcd ... ok
[INFO] [stdout] test algorithms::ext_gcd::tests::test_find_lcm ... ok
[INFO] [stdout] test data_structures::range_add_query_tree::tests::test_raqt_max ... ok
[INFO] [stdout] test algorithms::mod_pow::tests::test_mod_pow ... ok
[INFO] [stdout] test snippets::vectors_rotates::tests::test_anticlockwise_rotated_char ... ok
[INFO] [stdout] test data_structures::fenwick_tree::tests::test_raqt_max ... ok
[INFO] [stdout] test data_structures::point_update_range_query::tests::test_purq_max ... ok
[INFO] [stdout] test snippets::vectors_rotates::tests::test_clockwise_rotated_usize ... ok
[INFO] [stdout] test snippets::vectors_rotates::tests::test_anticlockwise_rotated_usize ... ok
[INFO] [stdout] test data_structures::point_update_range_query::tests::test_purq_min ... ok
[INFO] [stdout] test utils::scanner::tests::write_test ... ok
[INFO] [stdout] test utils::scanner::tests::test_input ... ok
[INFO] [stdout] test snippets::vectors_rotates::tests::test_clockwise_rotated_char ... ok
[INFO] [stdout] test snippets::dijkstra::tests::solve_grl_1_a ... ok
[INFO] [stdout] test algorithms::ext_gcd::tests::test_ext_gcd ... ok
[INFO] [stdout] test utils::tester::tests::test_get_test_data ... ok
[INFO] [stdout] test data_structures::union_find::tests::solve_dsl1_1_a ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 19 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.17s
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]      Running unittests src/main.rs (/opt/rustwide/target/debug/deps/rs_library-6530632ac3b46289)
[INFO] [stdout] running 0 tests
[INFO] [stderr]    Doc-tests rs_library
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stderr] warning: type `mod_combination` should have an upper camel case name
[INFO] [stderr]  --> src/algorithms/mod_combination.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct mod_combination {
[INFO] [stderr]   |        ^^^^^^^^^^^^^^^ help: convert the identifier to upper camel case: `ModCombination`
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(non_camel_case_types)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: 1 warning emitted
[INFO] [stderr] 
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] running `Command { std: "docker" "inspect" "b745a25b7e9c0138d5a332da3dae04e8a039904ac5d0c59120486293871a9403", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "b745a25b7e9c0138d5a332da3dae04e8a039904ac5d0c59120486293871a9403", kill_on_drop: false }`
[INFO] [stdout] b745a25b7e9c0138d5a332da3dae04e8a039904ac5d0c59120486293871a9403
