[INFO] fetching crate kagemeka 0.1.0... [INFO] testing kagemeka-0.1.0 against 1.60.0 for beta-1.61-1 [INFO] extracting crate kagemeka 0.1.0 into /workspace/builds/worker-5/source [INFO] validating manifest of crates.io crate kagemeka 0.1.0 on toolchain 1.60.0 [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+1.60.0" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking crates.io crate kagemeka 0.1.0 [INFO] finished tweaking crates.io crate kagemeka 0.1.0 [INFO] tweaked toml for crates.io crate kagemeka 0.1.0 written to /workspace/builds/worker-5/source/Cargo.toml [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+1.60.0" "generate-lockfile" "--manifest-path" "Cargo.toml" "-Zno-index-update", kill_on_drop: false }` [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+1.60.0" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5/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:b0c94ce3c1162fcb8e57cac5b65ec2f72eabb1eebea4fcc35e269e823f681646" "/opt/rustwide/cargo-home/bin/cargo" "+1.60.0" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 7a315c5f5d4e95fbd8eddecf35ad0afe4991e061fbd7338c96c614b54349d99f [INFO] running `Command { std: "docker" "start" "-a" "7a315c5f5d4e95fbd8eddecf35ad0afe4991e061fbd7338c96c614b54349d99f", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "7a315c5f5d4e95fbd8eddecf35ad0afe4991e061fbd7338c96c614b54349d99f", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "7a315c5f5d4e95fbd8eddecf35ad0afe4991e061fbd7338c96c614b54349d99f", kill_on_drop: false }` [INFO] [stdout] 7a315c5f5d4e95fbd8eddecf35ad0afe4991e061fbd7338c96c614b54349d99f [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:b0c94ce3c1162fcb8e57cac5b65ec2f72eabb1eebea4fcc35e269e823f681646" "/opt/rustwide/cargo-home/bin/cargo" "+1.60.0" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] f441f0b7270e12c06d48e2c9b93d7710a1e52144ed56db9a3fd36eea9fc72ea9 [INFO] running `Command { std: "docker" "start" "-a" "f441f0b7270e12c06d48e2c9b93d7710a1e52144ed56db9a3fd36eea9fc72ea9", kill_on_drop: false }` [INFO] [stderr] Compiling kagemeka v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `SparseTable` [INFO] [stdout] --> src/graph_theory/lca.rs:108:17 [INFO] [stdout] | [INFO] [stdout] 108 | use super::{SparseTable, DisjointSparseTable, euler_tour_node, Semigroup}; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `UnionFind` [INFO] [stdout] --> src/union_find.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct UnionFind { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/union_find.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 7 | pub fn new(n: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find` [INFO] [stdout] --> src/union_find.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 11 | pub fn find(&mut self, u: usize) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `unite` [INFO] [stdout] --> src/union_find.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn unite(&mut self, u: usize, v: usize) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `size` [INFO] [stdout] --> src/union_find.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn size(&mut self, u: usize) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `RollbackUnionFind` [INFO] [stdout] --> src/union_find.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct RollbackUnionFind {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `PersistentUnionFind` [INFO] [stdout] --> src/union_find.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct PersistentUnionFind {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `SparseTable` [INFO] [stdout] --> src/sparse_table.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 9 | pub struct SparseTable<'a, S> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/sparse_table.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn new(sg: Semigroup<'a, S>, a: &Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/sparse_table.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn get(&self, l: usize, r: usize) -> S { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `DisjointSparseTable` [INFO] [stdout] --> src/sparse_table.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub struct DisjointSparseTable<'a, S> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/sparse_table.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn new(sg: Semigroup<'a, S>, a: &Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/sparse_table.rs:76:12 [INFO] [stdout] | [INFO] [stdout] 76 | pub fn get(&self, l: usize, r: usize) -> S { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `unique` [INFO] [stdout] --> src/vector.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn unique(a: &Vec) -> Vec { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `compress_array` [INFO] [stdout] --> src/vector.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | pub fn compress_array(a: &Vec) -> (Vec, Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `longest_increasing_sequence` [INFO] [stdout] --> src/dp.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn longest_increasing_sequence(a: &[T]) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `least_prime_factor` [INFO] [stdout] --> src/number_theory/prime.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn least_prime_factor(n: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `greatest_prime_factor` [INFO] [stdout] --> src/number_theory/prime.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn greatest_prime_factor(n: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `sieve_of_eratosthenes` [INFO] [stdout] --> src/number_theory/prime.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn sieve_of_eratosthenes(n: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `find_prime_numbers` [INFO] [stdout] --> src/number_theory/prime.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn find_prime_numbers(n: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `prime_factorize` [INFO] [stdout] --> src/number_theory/prime.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn prime_factorize(mut n: usize) -> std::collections::BTreeMap { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `PrimeFactorizeLPF` [INFO] [stdout] --> src/number_theory/prime.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub struct PrimeFactorizeLPF { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/number_theory/prime.rs:68:12 [INFO] [stdout] | [INFO] [stdout] 68 | pub fn new(n: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `factorize` [INFO] [stdout] --> src/number_theory/prime.rs:72:12 [INFO] [stdout] | [INFO] [stdout] 72 | pub fn factorize(&self, mut n: usize) -> std::collections::BTreeMap { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `count_prime_factors` [INFO] [stdout] --> src/number_theory/prime.rs:84:8 [INFO] [stdout] | [INFO] [stdout] 84 | pub fn count_prime_factors(n: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `find_divisors` [INFO] [stdout] --> src/number_theory/divisor.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn find_divisors(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `gcd` [INFO] [stdout] --> src/number_theory/lcm_gcd.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn gcd(a: usize, b: usize) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `lcm` [INFO] [stdout] --> src/number_theory/lcm_gcd.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn lcm(a: usize, b: usize) -> usize { a / gcd(a, b) * b } [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `euler_totient` [INFO] [stdout] --> src/number_theory/euler_totient.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn euler_totient(mut n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `EulerTotientLPF` [INFO] [stdout] --> src/number_theory/euler_totient.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct EulerTotientLPF {} [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `extgcd` [INFO] [stdout] --> src/number_theory/extgcd.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn extgcd(a: i64, b: i64) -> (i64, i64, i64) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bfs` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn bfs(g: &[Vec], src: usize) -> Vec { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `dijkstra_sparse` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn dijkstra_sparse(g: &Vec>, src: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `dijkstra_dense` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn dijkstra_dense(g: &Vec>, src: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:77:8 [INFO] [stdout] | [INFO] [stdout] 77 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bellman_ford_sparse` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:94:8 [INFO] [stdout] | [INFO] [stdout] 94 | pub fn bellman_ford_sparse(g: &Vec>, src: usize) -> Result, NegativeCycleError> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bellman_ford_dense` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:119:8 [INFO] [stdout] | [INFO] [stdout] 119 | pub fn bellman_ford_dense(g: &Vec>, src: usize) -> Result, NegativeCycleError> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `johnson_dense` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:143:8 [INFO] [stdout] | [INFO] [stdout] 143 | pub fn johnson_dense(g: &Vec>) -> Result>, NegativeCycleError> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `floyd_warshall` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:169:8 [INFO] [stdout] | [INFO] [stdout] 169 | pub fn floyd_warshall(mut g: Vec>) -> Result>, NegativeCycleError> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `with_dfs` [INFO] [stdout] --> src/graph_theory/connected_components.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn with_dfs(n: usize, g: &Vec<(usize, usize)>) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `with_bfs` [INFO] [stdout] --> src/graph_theory/connected_components.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn with_bfs(n: usize, g: &Vec<(usize, usize)>) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `with_union_find` [INFO] [stdout] --> src/graph_theory/connected_components.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn with_union_find(n: usize, g: &Vec<(usize, usize)>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `kruskal` [INFO] [stdout] --> src/graph_theory/mst.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | pub fn kruskal(n: usize, mut g: Vec<(usize, usize, i64)>) -> Vec<(usize, usize, i64)> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `prim_sparse` [INFO] [stdout] --> src/graph_theory/mst.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn prim_sparse(n: usize, g: &Vec<(usize, usize, i64)>) -> Vec<(usize, usize, i64)> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `prim_dense` [INFO] [stdout] --> src/graph_theory/mst.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn prim_dense(g: &Vec>) -> Vec<(usize, usize, i64)> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `boruvka` [INFO] [stdout] --> src/graph_theory/mst.rs:85:8 [INFO] [stdout] | [INFO] [stdout] 85 | pub fn boruvka(n: usize, g: &Vec<(usize, usize, i64)>) -> Vec<(usize, usize, i64)> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `reverse_delete` [INFO] [stdout] --> src/graph_theory/mst.rs:114:8 [INFO] [stdout] | [INFO] [stdout] 114 | pub fn reverse_delete() {} [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `randomized_linear` [INFO] [stdout] --> src/graph_theory/mst.rs:117:8 [INFO] [stdout] | [INFO] [stdout] 117 | pub fn randomized_linear() {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `lowlink` [INFO] [stdout] --> src/graph_theory/lowlink.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | pub fn lowlink(g: &Vec>) -> (Vec, Vec) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bridges` [INFO] [stdout] --> src/graph_theory/lowlink.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn bridges(n: usize, g: &Vec<(usize, usize)>) -> Vec<(usize, usize)> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `articulation_points` [INFO] [stdout] --> src/graph_theory/lowlink.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn articulation_points(g: &Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `path_based` [INFO] [stdout] --> src/graph_theory/scc.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn path_based(g: &Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `tarjan` [INFO] [stdout] --> src/graph_theory/scc.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn tarjan(g: &Vec>) -> Vec { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `kosaraju` [INFO] [stdout] --> src/graph_theory/scc.rs:111:8 [INFO] [stdout] | [INFO] [stdout] 111 | pub fn kosaraju(g: &Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/topological_sort.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `with_dfs` [INFO] [stdout] --> src/graph_theory/topological_sort.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn with_dfs(g: &Vec>) -> Result, NonDAGError> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `kahn` [INFO] [stdout] --> src/graph_theory/topological_sort.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn kahn(g: &Vec>) -> Result, NonDAGError> { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `tree_dfs` [INFO] [stdout] --> src/graph_theory/tree_diameter.rs:2:4 [INFO] [stdout] | [INFO] [stdout] 2 | fn tree_dfs(g: &Vec>, root: usize) -> (Vec, Vec) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `tree_diameter` [INFO] [stdout] --> src/graph_theory/tree_diameter.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn tree_diameter(g: &Vec<(usize, usize, i64)>) -> (Vec, i64) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `euler_tour_edge` [INFO] [stdout] --> src/graph_theory/euler_tour.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn euler_tour_edge(g: &Vec<(usize, usize)>, root: usize) -> (Vec, Vec, Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `euler_tour_node` [INFO] [stdout] --> src/graph_theory/euler_tour.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn euler_tour_node(g: &Vec<(usize, usize)>, root: usize) -> (Vec, Vec, Vec, Vec, Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `rerooting` [INFO] [stdout] --> src/graph_theory/rerooting.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn rerooting(g: &Vec<(usize, usize, F)>, m: &Monoid, map: Box S>) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `tree_bfs` [INFO] [stdout] --> src/graph_theory/tree_bfs.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | pub fn tree_bfs(g: &Vec<(usize, usize)>, root: usize) -> (Vec, Vec) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `tarjan_offline` [INFO] [stdout] --> src/graph_theory/lca.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn tarjan_offline(g: &Vec<(usize, usize)>, uv: &Vec<(usize, usize)>, root: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `BinaryLifting` [INFO] [stdout] --> src/graph_theory/lca.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub struct BinaryLifting { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/lca.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 70 | pub fn new(g: &Vec<(usize, usize)>, root: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/graph_theory/lca.rs:86:12 [INFO] [stdout] | [INFO] [stdout] 86 | pub fn get(&self, mut u: usize, mut v: usize) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `with_hl_decomposition` [INFO] [stdout] --> src/graph_theory/lca.rs:103:8 [INFO] [stdout] | [INFO] [stdout] 103 | pub fn with_hl_decomposition() {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `WithHLD` [INFO] [stdout] --> src/graph_theory/lca.rs:178:12 [INFO] [stdout] | [INFO] [stdout] 178 | pub struct WithHLD {} [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `edmonds_karp` [INFO] [stdout] --> src/graph_theory/max_flow.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | pub fn edmonds_karp(g: &Vec>, src: usize, sink: usize) -> u64 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `ford_fulkerson` [INFO] [stdout] --> src/graph_theory/max_flow.rs:63:8 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn ford_fulkerson(g: &Vec>, src: usize, sink: usize) -> u64 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `dinic` [INFO] [stdout] --> src/graph_theory/max_flow.rs:114:8 [INFO] [stdout] | [INFO] [stdout] 114 | pub fn dinic(g: &Vec>, src: usize, sink: usize) -> u64 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `mpm` [INFO] [stdout] --> src/graph_theory/max_flow.rs:178:8 [INFO] [stdout] | [INFO] [stdout] 178 | pub fn mpm() {} [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `push_relabel_fifo_vertex` [INFO] [stdout] --> src/graph_theory/max_flow.rs:182:8 [INFO] [stdout] | [INFO] [stdout] 182 | pub fn push_relabel_fifo_vertex() {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `push_relabel_dist_vertex` [INFO] [stdout] --> src/graph_theory/max_flow.rs:183:8 [INFO] [stdout] | [INFO] [stdout] 183 | pub fn push_relabel_dist_vertex() {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `push_relabel_dynamic_tree` [INFO] [stdout] --> src/graph_theory/max_flow.rs:184:8 [INFO] [stdout] | [INFO] [stdout] 184 | pub fn push_relabel_dynamic_tree() {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `krt` [INFO] [stdout] --> src/graph_theory/max_flow.rs:189:8 [INFO] [stdout] | [INFO] [stdout] 189 | pub fn krt() {} [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `binary_blocking_flow` [INFO] [stdout] --> src/graph_theory/max_flow.rs:194:8 [INFO] [stdout] | [INFO] [stdout] 194 | pub fn binary_blocking_flow() {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `orlin` [INFO] [stdout] --> src/graph_theory/max_flow.rs:198:8 [INFO] [stdout] | [INFO] [stdout] 198 | pub fn orlin() {} [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `ford_fulkerson` [INFO] [stdout] --> src/graph_theory/max_cardinal_match.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | pub fn ford_fulkerson(size_a: usize, size_b: usize, g: &[(usize, usize)]) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `hopcroft_karp` [INFO] [stdout] --> src/graph_theory/max_cardinal_match.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn hopcroft_karp(size_a: usize, size_b: usize, g: &[(usize, usize)]) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `blossom` [INFO] [stdout] --> src/graph_theory/max_cardinal_match.rs:109:8 [INFO] [stdout] | [INFO] [stdout] 109 | pub fn blossom() { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `msb` [INFO] [stdout] --> src/algebra/bit.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | pub fn msb(n: usize) -> isize { 0usize.leading_zeros() as isize - n.leading_zeros() as isize - 1 } [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `msb_number_binary_search` [INFO] [stdout] --> src/algebra/bit.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn msb_number_binary_search(mut n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `lsb` [INFO] [stdout] --> src/algebra/bit.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn lsb(n: usize) -> usize { n.reverse_bits().leading_zeros() as usize } [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `lsb_number` [INFO] [stdout] --> src/algebra/bit.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn lsb_number(n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `delete_least_bit` [INFO] [stdout] --> src/algebra/bit.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn delete_least_bit(n: usize) -> usize { n - lsb_number(n) } [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `delete_least_bit_v2` [INFO] [stdout] --> src/algebra/bit.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn delete_least_bit_v2(n: usize) -> usize { n & (n - 1) } [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bit_length` [INFO] [stdout] --> src/algebra/bit.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn bit_length(n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bit_length_v2` [INFO] [stdout] --> src/algebra/bit.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn bit_length_v2(mut n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bit_length_v3` [INFO] [stdout] --> src/algebra/bit.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn bit_length_v3(n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bit_length_table` [INFO] [stdout] --> src/algebra/bit.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn bit_length_table(n: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `reverse_bits` [INFO] [stdout] --> src/algebra/bit.rs:66:8 [INFO] [stdout] | [INFO] [stdout] 66 | pub fn reverse_bits(n: usize) -> usize { n.reverse_bits() } [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `reverse_bits_v2` [INFO] [stdout] --> src/algebra/bit.rs:69:8 [INFO] [stdout] | [INFO] [stdout] 69 | pub fn reverse_bits_v2(mut n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bit_inverse` [INFO] [stdout] --> src/algebra/bit.rs:79:8 [INFO] [stdout] | [INFO] [stdout] 79 | pub fn bit_inverse(n: usize) -> usize { !n } [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bit_inverse_v2` [INFO] [stdout] --> src/algebra/bit.rs:82:8 [INFO] [stdout] | [INFO] [stdout] 82 | pub fn bit_inverse_v2(n: usize) -> usize { (!0usize) ^ n } [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `popcount` [INFO] [stdout] --> src/algebra/bit.rs:85:8 [INFO] [stdout] | [INFO] [stdout] 85 | pub fn popcount(mut n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `popcount_v2` [INFO] [stdout] --> src/algebra/bit.rs:96:8 [INFO] [stdout] | [INFO] [stdout] 96 | pub fn popcount_v2(n: usize) -> usize { n.count_ones() as usize } [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `popcount_v3` [INFO] [stdout] --> src/algebra/bit.rs:99:8 [INFO] [stdout] | [INFO] [stdout] 99 | pub fn popcount_v3(mut n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `popcount_table` [INFO] [stdout] --> src/algebra/bit.rs:109:8 [INFO] [stdout] | [INFO] [stdout] 109 | pub fn popcount_table(n: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Power` [INFO] [stdout] --> src/algebra/pow.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 12 | pub struct Power<'a, T> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/algebra/pow.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn new(m: structs::Monoid<'a, T>) -> Self { Self { m } } [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `do` [INFO] [stdout] --> src/algebra/pow.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn r#do(&self, x: &T, n: usize) -> T{ [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/algebra/modular.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn new(n: usize) -> Self { Self { value: n % MOD } } [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `value` [INFO] [stdout] --> src/algebra/modular.rs:17:18 [INFO] [stdout] | [INFO] [stdout] 17 | pub const fn value(&self) -> usize { self.value % MOD } [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `size` [INFO] [stdout] --> src/algebra/tensor.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | size: usize, [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `Tensor` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/algebra/tensor.rs:5:10 [INFO] [stdout] | [INFO] [stdout] 5 | #[derive(Clone)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Clone` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `e` [INFO] [stdout] --> src/algebra/tensor.rs:89:12 [INFO] [stdout] | [INFO] [stdout] 89 | pub fn e(&self) -> Self { [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `op` [INFO] [stdout] --> src/algebra/tensor.rs:102:12 [INFO] [stdout] | [INFO] [stdout] 102 | pub fn op(lhs: &Self, rhs: &Self) -> Self { [INFO] [stdout] | ^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pow` [INFO] [stdout] --> src/algebra/tensor.rs:118:12 [INFO] [stdout] | [INFO] [stdout] 118 | pub fn pow(&self, n: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `sa_doubling` [INFO] [stdout] --> src/string/sa.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn sa_doubling(a: &Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `sa_doubling_with_countsort` [INFO] [stdout] --> src/string/sa.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn sa_doubling_with_countsort(a: &Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `sa_is` [INFO] [stdout] --> src/string/sa.rs:75:8 [INFO] [stdout] | [INFO] [stdout] 75 | pub fn sa_is(a: &Vec) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bisect` [INFO] [stdout] --> src/analysis/binary_search.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn bisect(is_ok: &dyn Fn(&T) -> bool, a: &[T]) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `lower_bound` [INFO] [stdout] --> src/analysis/binary_search.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | pub fn lower_bound(a: &[T], x: &T) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `pascal` [INFO] [stdout] --> src/combinatorics/pascal.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn pascal(n: usize) -> Vec> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `m` [INFO] [stdout] --> src/graph_theory/tree/segment_tree.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 8 | m: Monoid<'a, S>, [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/tree/segment_tree.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn new(m: Monoid<'a, S>, n: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `from_vec` [INFO] [stdout] --> src/graph_theory/tree/segment_tree.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn from_vec(m: Monoid<'a, S>, a: &Vec) -> Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge` [INFO] [stdout] --> src/graph_theory/tree/segment_tree.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | fn merge(&mut self, i: usize) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `set` [INFO] [stdout] --> src/graph_theory/tree/segment_tree.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn set(&mut self, mut i: usize, x: S) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/graph_theory/tree/segment_tree.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn get(&self, mut l: usize, mut r: usize) -> S { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_right` [INFO] [stdout] --> src/graph_theory/tree/segment_tree.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn max_right(&self, is_ok: Box bool>, l: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `m` [INFO] [stdout] --> src/graph_theory/tree/fenwick_tree.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | m: Monoid<'a, S>, [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/tree/fenwick_tree.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn new(m: Monoid<'a, S>, n: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `from_vec` [INFO] [stdout] --> src/graph_theory/tree/fenwick_tree.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn from_vec(m: Monoid<'a, S>, a: &Vec) -> Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `set` [INFO] [stdout] --> src/graph_theory/tree/fenwick_tree.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn set(&mut self, mut i: usize, x: &S) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/graph_theory/tree/fenwick_tree.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn get(&self, mut i: usize) -> S { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_right` [INFO] [stdout] --> src/graph_theory/tree/fenwick_tree.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn max_right(&self, is_ok: Box bool>) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `compute_first_idx` [INFO] [stdout] --> src/graph_theory/euler_tour.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn compute_first_idx(tour_edge: &Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `WithSparseTable` [INFO] [stdout] --> src/graph_theory/lca.rs:112:16 [INFO] [stdout] | [INFO] [stdout] 112 | pub struct WithSparseTable<'a, S> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/lca.rs:117:16 [INFO] [stdout] | [INFO] [stdout] 117 | pub fn new(g: &Vec<(usize, usize)>, root: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/graph_theory/lca.rs:132:16 [INFO] [stdout] | [INFO] [stdout] 132 | pub fn get(&self, u: usize, v: usize) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `WithSegmentTree` [INFO] [stdout] --> src/graph_theory/lca.rs:141:16 [INFO] [stdout] | [INFO] [stdout] 141 | pub struct WithSegmentTree<'a, S: Copy> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/lca.rs:146:16 [INFO] [stdout] | [INFO] [stdout] 146 | pub fn new(g: &Vec<(usize, usize)>, root: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/graph_theory/lca.rs:162:16 [INFO] [stdout] | [INFO] [stdout] 162 | pub fn get(&self, u: usize, v: usize) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `WithSqrtDecomposition` [INFO] [stdout] --> src/graph_theory/lca.rs:171:16 [INFO] [stdout] | [INFO] [stdout] 171 | pub struct WithSqrtDecomposition {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Semigroup` [INFO] [stdout] --> src/algebra/abstract_/structure.rs:13:16 [INFO] [stdout] | [INFO] [stdout] 13 | pub struct Semigroup<'a, S> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 138 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 1.32s [INFO] running `Command { std: "docker" "inspect" "f441f0b7270e12c06d48e2c9b93d7710a1e52144ed56db9a3fd36eea9fc72ea9", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "f441f0b7270e12c06d48e2c9b93d7710a1e52144ed56db9a3fd36eea9fc72ea9", kill_on_drop: false }` [INFO] [stdout] f441f0b7270e12c06d48e2c9b93d7710a1e52144ed56db9a3fd36eea9fc72ea9 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:b0c94ce3c1162fcb8e57cac5b65ec2f72eabb1eebea4fcc35e269e823f681646" "/opt/rustwide/cargo-home/bin/cargo" "+1.60.0" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 41e5d9821976fceb5a60523b816093f833d5f5215028944b288033958c925580 [INFO] running `Command { std: "docker" "start" "-a" "41e5d9821976fceb5a60523b816093f833d5f5215028944b288033958c925580", kill_on_drop: false }` [INFO] [stderr] Blocking waiting for file lock on package cache [INFO] [stdout] warning: unused import: `SparseTable` [INFO] [stdout] --> src/graph_theory/lca.rs:108:17 [INFO] [stdout] | [INFO] [stdout] 108 | use super::{SparseTable, DisjointSparseTable, euler_tour_node, Semigroup}; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `UnionFind` [INFO] [stdout] --> src/union_find.rs:1:12 [INFO] [stdout] | [INFO] [stdout] 1 | pub struct UnionFind { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/union_find.rs:7:12 [INFO] [stdout] | [INFO] [stdout] 7 | pub fn new(n: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `find` [INFO] [stdout] --> src/union_find.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 11 | pub fn find(&mut self, u: usize) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `unite` [INFO] [stdout] --> src/union_find.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn unite(&mut self, u: usize, v: usize) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `size` [INFO] [stdout] --> src/union_find.rs:25:12 [INFO] [stdout] | [INFO] [stdout] 25 | pub fn size(&mut self, u: usize) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `RollbackUnionFind` [INFO] [stdout] --> src/union_find.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct RollbackUnionFind {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `PersistentUnionFind` [INFO] [stdout] --> src/union_find.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct PersistentUnionFind {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `SparseTable` [INFO] [stdout] --> src/sparse_table.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 9 | pub struct SparseTable<'a, S> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/sparse_table.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn new(sg: Semigroup<'a, S>, a: &Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/sparse_table.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn get(&self, l: usize, r: usize) -> S { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `DisjointSparseTable` [INFO] [stdout] --> src/sparse_table.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub struct DisjointSparseTable<'a, S> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/sparse_table.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn new(sg: Semigroup<'a, S>, a: &Vec) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/sparse_table.rs:76:12 [INFO] [stdout] | [INFO] [stdout] 76 | pub fn get(&self, l: usize, r: usize) -> S { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `unique` [INFO] [stdout] --> src/vector.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn unique(a: &Vec) -> Vec { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `compress_array` [INFO] [stdout] --> src/vector.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | pub fn compress_array(a: &Vec) -> (Vec, Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `longest_increasing_sequence` [INFO] [stdout] --> src/dp.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn longest_increasing_sequence(a: &[T]) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `least_prime_factor` [INFO] [stdout] --> src/number_theory/prime.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn least_prime_factor(n: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `greatest_prime_factor` [INFO] [stdout] --> src/number_theory/prime.rs:18:8 [INFO] [stdout] | [INFO] [stdout] 18 | pub fn greatest_prime_factor(n: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `sieve_of_eratosthenes` [INFO] [stdout] --> src/number_theory/prime.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn sieve_of_eratosthenes(n: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `find_prime_numbers` [INFO] [stdout] --> src/number_theory/prime.rs:40:8 [INFO] [stdout] | [INFO] [stdout] 40 | pub fn find_prime_numbers(n: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `prime_factorize` [INFO] [stdout] --> src/number_theory/prime.rs:46:8 [INFO] [stdout] | [INFO] [stdout] 46 | pub fn prime_factorize(mut n: usize) -> std::collections::BTreeMap { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `PrimeFactorizeLPF` [INFO] [stdout] --> src/number_theory/prime.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub struct PrimeFactorizeLPF { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/number_theory/prime.rs:68:12 [INFO] [stdout] | [INFO] [stdout] 68 | pub fn new(n: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `factorize` [INFO] [stdout] --> src/number_theory/prime.rs:72:12 [INFO] [stdout] | [INFO] [stdout] 72 | pub fn factorize(&self, mut n: usize) -> std::collections::BTreeMap { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `count_prime_factors` [INFO] [stdout] --> src/number_theory/prime.rs:84:8 [INFO] [stdout] | [INFO] [stdout] 84 | pub fn count_prime_factors(n: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `find_divisors` [INFO] [stdout] --> src/number_theory/divisor.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn find_divisors(n: i32) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `gcd` [INFO] [stdout] --> src/number_theory/lcm_gcd.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn gcd(a: usize, b: usize) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `lcm` [INFO] [stdout] --> src/number_theory/lcm_gcd.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn lcm(a: usize, b: usize) -> usize { a / gcd(a, b) * b } [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `euler_totient` [INFO] [stdout] --> src/number_theory/euler_totient.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn euler_totient(mut n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `EulerTotientLPF` [INFO] [stdout] --> src/number_theory/euler_totient.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct EulerTotientLPF {} [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `extgcd` [INFO] [stdout] --> src/number_theory/extgcd.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn extgcd(a: i64, b: i64) -> (i64, i64, i64) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bfs` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn bfs(g: &[Vec], src: usize) -> Vec { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `dijkstra_sparse` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn dijkstra_sparse(g: &Vec>, src: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `dijkstra_dense` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn dijkstra_dense(g: &Vec>, src: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:77:8 [INFO] [stdout] | [INFO] [stdout] 77 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bellman_ford_sparse` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:94:8 [INFO] [stdout] | [INFO] [stdout] 94 | pub fn bellman_ford_sparse(g: &Vec>, src: usize) -> Result, NegativeCycleError> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bellman_ford_dense` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:119:8 [INFO] [stdout] | [INFO] [stdout] 119 | pub fn bellman_ford_dense(g: &Vec>, src: usize) -> Result, NegativeCycleError> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `johnson_dense` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:143:8 [INFO] [stdout] | [INFO] [stdout] 143 | pub fn johnson_dense(g: &Vec>) -> Result>, NegativeCycleError> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `floyd_warshall` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:169:8 [INFO] [stdout] | [INFO] [stdout] 169 | pub fn floyd_warshall(mut g: Vec>) -> Result>, NegativeCycleError> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `with_dfs` [INFO] [stdout] --> src/graph_theory/connected_components.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn with_dfs(n: usize, g: &Vec<(usize, usize)>) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `with_bfs` [INFO] [stdout] --> src/graph_theory/connected_components.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn with_bfs(n: usize, g: &Vec<(usize, usize)>) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `with_union_find` [INFO] [stdout] --> src/graph_theory/connected_components.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn with_union_find(n: usize, g: &Vec<(usize, usize)>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `kruskal` [INFO] [stdout] --> src/graph_theory/mst.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | pub fn kruskal(n: usize, mut g: Vec<(usize, usize, i64)>) -> Vec<(usize, usize, i64)> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `prim_sparse` [INFO] [stdout] --> src/graph_theory/mst.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn prim_sparse(n: usize, g: &Vec<(usize, usize, i64)>) -> Vec<(usize, usize, i64)> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `prim_dense` [INFO] [stdout] --> src/graph_theory/mst.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn prim_dense(g: &Vec>) -> Vec<(usize, usize, i64)> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `boruvka` [INFO] [stdout] --> src/graph_theory/mst.rs:85:8 [INFO] [stdout] | [INFO] [stdout] 85 | pub fn boruvka(n: usize, g: &Vec<(usize, usize, i64)>) -> Vec<(usize, usize, i64)> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `reverse_delete` [INFO] [stdout] --> src/graph_theory/mst.rs:114:8 [INFO] [stdout] | [INFO] [stdout] 114 | pub fn reverse_delete() {} [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `randomized_linear` [INFO] [stdout] --> src/graph_theory/mst.rs:117:8 [INFO] [stdout] | [INFO] [stdout] 117 | pub fn randomized_linear() {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `lowlink` [INFO] [stdout] --> src/graph_theory/lowlink.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | pub fn lowlink(g: &Vec>) -> (Vec, Vec) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bridges` [INFO] [stdout] --> src/graph_theory/lowlink.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn bridges(n: usize, g: &Vec<(usize, usize)>) -> Vec<(usize, usize)> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `articulation_points` [INFO] [stdout] --> src/graph_theory/lowlink.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn articulation_points(g: &Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `path_based` [INFO] [stdout] --> src/graph_theory/scc.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn path_based(g: &Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `tarjan` [INFO] [stdout] --> src/graph_theory/scc.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn tarjan(g: &Vec>) -> Vec { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `kosaraju` [INFO] [stdout] --> src/graph_theory/scc.rs:111:8 [INFO] [stdout] | [INFO] [stdout] 111 | pub fn kosaraju(g: &Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/topological_sort.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `with_dfs` [INFO] [stdout] --> src/graph_theory/topological_sort.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn with_dfs(g: &Vec>) -> Result, NonDAGError> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `kahn` [INFO] [stdout] --> src/graph_theory/topological_sort.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn kahn(g: &Vec>) -> Result, NonDAGError> { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `tree_dfs` [INFO] [stdout] --> src/graph_theory/tree_diameter.rs:2:4 [INFO] [stdout] | [INFO] [stdout] 2 | fn tree_dfs(g: &Vec>, root: usize) -> (Vec, Vec) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `tree_diameter` [INFO] [stdout] --> src/graph_theory/tree_diameter.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn tree_diameter(g: &Vec<(usize, usize, i64)>) -> (Vec, i64) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `euler_tour_edge` [INFO] [stdout] --> src/graph_theory/euler_tour.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn euler_tour_edge(g: &Vec<(usize, usize)>, root: usize) -> (Vec, Vec, Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `euler_tour_node` [INFO] [stdout] --> src/graph_theory/euler_tour.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn euler_tour_node(g: &Vec<(usize, usize)>, root: usize) -> (Vec, Vec, Vec, Vec, Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `rerooting` [INFO] [stdout] --> src/graph_theory/rerooting.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn rerooting(g: &Vec<(usize, usize, F)>, m: &Monoid, map: Box S>) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `tree_bfs` [INFO] [stdout] --> src/graph_theory/tree_bfs.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | pub fn tree_bfs(g: &Vec<(usize, usize)>, root: usize) -> (Vec, Vec) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `tarjan_offline` [INFO] [stdout] --> src/graph_theory/lca.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn tarjan_offline(g: &Vec<(usize, usize)>, uv: &Vec<(usize, usize)>, root: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `BinaryLifting` [INFO] [stdout] --> src/graph_theory/lca.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub struct BinaryLifting { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/lca.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 70 | pub fn new(g: &Vec<(usize, usize)>, root: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/graph_theory/lca.rs:86:12 [INFO] [stdout] | [INFO] [stdout] 86 | pub fn get(&self, mut u: usize, mut v: usize) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `with_hl_decomposition` [INFO] [stdout] --> src/graph_theory/lca.rs:103:8 [INFO] [stdout] | [INFO] [stdout] 103 | pub fn with_hl_decomposition() {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `WithHLD` [INFO] [stdout] --> src/graph_theory/lca.rs:178:12 [INFO] [stdout] | [INFO] [stdout] 178 | pub struct WithHLD {} [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `edmonds_karp` [INFO] [stdout] --> src/graph_theory/max_flow.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | pub fn edmonds_karp(g: &Vec>, src: usize, sink: usize) -> u64 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `ford_fulkerson` [INFO] [stdout] --> src/graph_theory/max_flow.rs:63:8 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn ford_fulkerson(g: &Vec>, src: usize, sink: usize) -> u64 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `dinic` [INFO] [stdout] --> src/graph_theory/max_flow.rs:114:8 [INFO] [stdout] | [INFO] [stdout] 114 | pub fn dinic(g: &Vec>, src: usize, sink: usize) -> u64 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `mpm` [INFO] [stdout] --> src/graph_theory/max_flow.rs:178:8 [INFO] [stdout] | [INFO] [stdout] 178 | pub fn mpm() {} [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `push_relabel_fifo_vertex` [INFO] [stdout] --> src/graph_theory/max_flow.rs:182:8 [INFO] [stdout] | [INFO] [stdout] 182 | pub fn push_relabel_fifo_vertex() {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `push_relabel_dist_vertex` [INFO] [stdout] --> src/graph_theory/max_flow.rs:183:8 [INFO] [stdout] | [INFO] [stdout] 183 | pub fn push_relabel_dist_vertex() {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `push_relabel_dynamic_tree` [INFO] [stdout] --> src/graph_theory/max_flow.rs:184:8 [INFO] [stdout] | [INFO] [stdout] 184 | pub fn push_relabel_dynamic_tree() {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `krt` [INFO] [stdout] --> src/graph_theory/max_flow.rs:189:8 [INFO] [stdout] | [INFO] [stdout] 189 | pub fn krt() {} [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `binary_blocking_flow` [INFO] [stdout] --> src/graph_theory/max_flow.rs:194:8 [INFO] [stdout] | [INFO] [stdout] 194 | pub fn binary_blocking_flow() {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `orlin` [INFO] [stdout] --> src/graph_theory/max_flow.rs:198:8 [INFO] [stdout] | [INFO] [stdout] 198 | pub fn orlin() {} [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `ford_fulkerson` [INFO] [stdout] --> src/graph_theory/max_cardinal_match.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | pub fn ford_fulkerson(size_a: usize, size_b: usize, g: &[(usize, usize)]) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `hopcroft_karp` [INFO] [stdout] --> src/graph_theory/max_cardinal_match.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn hopcroft_karp(size_a: usize, size_b: usize, g: &[(usize, usize)]) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `blossom` [INFO] [stdout] --> src/graph_theory/max_cardinal_match.rs:109:8 [INFO] [stdout] | [INFO] [stdout] 109 | pub fn blossom() { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `msb` [INFO] [stdout] --> src/algebra/bit.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | pub fn msb(n: usize) -> isize { 0usize.leading_zeros() as isize - n.leading_zeros() as isize - 1 } [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `msb_number_binary_search` [INFO] [stdout] --> src/algebra/bit.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn msb_number_binary_search(mut n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `lsb` [INFO] [stdout] --> src/algebra/bit.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn lsb(n: usize) -> usize { n.reverse_bits().leading_zeros() as usize } [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `lsb_number` [INFO] [stdout] --> src/algebra/bit.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn lsb_number(n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `delete_least_bit` [INFO] [stdout] --> src/algebra/bit.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn delete_least_bit(n: usize) -> usize { n - lsb_number(n) } [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `delete_least_bit_v2` [INFO] [stdout] --> src/algebra/bit.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn delete_least_bit_v2(n: usize) -> usize { n & (n - 1) } [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bit_length` [INFO] [stdout] --> src/algebra/bit.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | pub fn bit_length(n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bit_length_v2` [INFO] [stdout] --> src/algebra/bit.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn bit_length_v2(mut n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bit_length_v3` [INFO] [stdout] --> src/algebra/bit.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn bit_length_v3(n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bit_length_table` [INFO] [stdout] --> src/algebra/bit.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn bit_length_table(n: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `reverse_bits` [INFO] [stdout] --> src/algebra/bit.rs:66:8 [INFO] [stdout] | [INFO] [stdout] 66 | pub fn reverse_bits(n: usize) -> usize { n.reverse_bits() } [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `reverse_bits_v2` [INFO] [stdout] --> src/algebra/bit.rs:69:8 [INFO] [stdout] | [INFO] [stdout] 69 | pub fn reverse_bits_v2(mut n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bit_inverse` [INFO] [stdout] --> src/algebra/bit.rs:79:8 [INFO] [stdout] | [INFO] [stdout] 79 | pub fn bit_inverse(n: usize) -> usize { !n } [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bit_inverse_v2` [INFO] [stdout] --> src/algebra/bit.rs:82:8 [INFO] [stdout] | [INFO] [stdout] 82 | pub fn bit_inverse_v2(n: usize) -> usize { (!0usize) ^ n } [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `popcount` [INFO] [stdout] --> src/algebra/bit.rs:85:8 [INFO] [stdout] | [INFO] [stdout] 85 | pub fn popcount(mut n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `popcount_v2` [INFO] [stdout] --> src/algebra/bit.rs:96:8 [INFO] [stdout] | [INFO] [stdout] 96 | pub fn popcount_v2(n: usize) -> usize { n.count_ones() as usize } [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `popcount_v3` [INFO] [stdout] --> src/algebra/bit.rs:99:8 [INFO] [stdout] | [INFO] [stdout] 99 | pub fn popcount_v3(mut n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling kagemeka v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: function is never used: `popcount_table` [INFO] [stdout] --> src/algebra/bit.rs:109:8 [INFO] [stdout] | [INFO] [stdout] 109 | pub fn popcount_table(n: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Power` [INFO] [stdout] --> src/algebra/pow.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 12 | pub struct Power<'a, T> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/algebra/pow.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn new(m: structs::Monoid<'a, T>) -> Self { Self { m } } [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `do` [INFO] [stdout] --> src/algebra/pow.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn r#do(&self, x: &T, n: usize) -> T{ [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/algebra/modular.rs:16:12 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn new(n: usize) -> Self { Self { value: n % MOD } } [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `value` [INFO] [stdout] --> src/algebra/modular.rs:17:18 [INFO] [stdout] | [INFO] [stdout] 17 | pub const fn value(&self) -> usize { self.value % MOD } [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `size` [INFO] [stdout] --> src/algebra/tensor.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | size: usize, [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `Tensor` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/algebra/tensor.rs:5:10 [INFO] [stdout] | [INFO] [stdout] 5 | #[derive(Clone)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Clone` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `e` [INFO] [stdout] --> src/algebra/tensor.rs:89:12 [INFO] [stdout] | [INFO] [stdout] 89 | pub fn e(&self) -> Self { [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `op` [INFO] [stdout] --> src/algebra/tensor.rs:102:12 [INFO] [stdout] | [INFO] [stdout] 102 | pub fn op(lhs: &Self, rhs: &Self) -> Self { [INFO] [stdout] | ^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pow` [INFO] [stdout] --> src/algebra/tensor.rs:118:12 [INFO] [stdout] | [INFO] [stdout] 118 | pub fn pow(&self, n: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `sa_doubling` [INFO] [stdout] --> src/string/sa.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn sa_doubling(a: &Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `sa_doubling_with_countsort` [INFO] [stdout] --> src/string/sa.rs:31:8 [INFO] [stdout] | [INFO] [stdout] 31 | pub fn sa_doubling_with_countsort(a: &Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `sa_is` [INFO] [stdout] --> src/string/sa.rs:75:8 [INFO] [stdout] | [INFO] [stdout] 75 | pub fn sa_is(a: &Vec) -> Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bisect` [INFO] [stdout] --> src/analysis/binary_search.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn bisect(is_ok: &dyn Fn(&T) -> bool, a: &[T]) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `lower_bound` [INFO] [stdout] --> src/analysis/binary_search.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | pub fn lower_bound(a: &[T], x: &T) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `pascal` [INFO] [stdout] --> src/combinatorics/pascal.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn pascal(n: usize) -> Vec> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `m` [INFO] [stdout] --> src/graph_theory/tree/segment_tree.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 8 | m: Monoid<'a, S>, [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/tree/segment_tree.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn new(m: Monoid<'a, S>, n: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `from_vec` [INFO] [stdout] --> src/graph_theory/tree/segment_tree.rs:27:12 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn from_vec(m: Monoid<'a, S>, a: &Vec) -> Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `merge` [INFO] [stdout] --> src/graph_theory/tree/segment_tree.rs:37:8 [INFO] [stdout] | [INFO] [stdout] 37 | fn merge(&mut self, i: usize) { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `set` [INFO] [stdout] --> src/graph_theory/tree/segment_tree.rs:41:12 [INFO] [stdout] | [INFO] [stdout] 41 | pub fn set(&mut self, mut i: usize, x: S) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/graph_theory/tree/segment_tree.rs:48:12 [INFO] [stdout] | [INFO] [stdout] 48 | pub fn get(&self, mut l: usize, mut r: usize) -> S { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_right` [INFO] [stdout] --> src/graph_theory/tree/segment_tree.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn max_right(&self, is_ok: Box bool>, l: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `m` [INFO] [stdout] --> src/graph_theory/tree/fenwick_tree.rs:4:5 [INFO] [stdout] | [INFO] [stdout] 4 | m: Monoid<'a, S>, [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/tree/fenwick_tree.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn new(m: Monoid<'a, S>, n: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `from_vec` [INFO] [stdout] --> src/graph_theory/tree/fenwick_tree.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn from_vec(m: Monoid<'a, S>, a: &Vec) -> Self { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `set` [INFO] [stdout] --> src/graph_theory/tree/fenwick_tree.rs:34:12 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn set(&mut self, mut i: usize, x: &S) { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/graph_theory/tree/fenwick_tree.rs:43:12 [INFO] [stdout] | [INFO] [stdout] 43 | pub fn get(&self, mut i: usize) -> S { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_right` [INFO] [stdout] --> src/graph_theory/tree/fenwick_tree.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn max_right(&self, is_ok: Box bool>) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `compute_first_idx` [INFO] [stdout] --> src/graph_theory/euler_tour.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn compute_first_idx(tour_edge: &Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `WithSparseTable` [INFO] [stdout] --> src/graph_theory/lca.rs:112:16 [INFO] [stdout] | [INFO] [stdout] 112 | pub struct WithSparseTable<'a, S> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/lca.rs:117:16 [INFO] [stdout] | [INFO] [stdout] 117 | pub fn new(g: &Vec<(usize, usize)>, root: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/graph_theory/lca.rs:132:16 [INFO] [stdout] | [INFO] [stdout] 132 | pub fn get(&self, u: usize, v: usize) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `WithSegmentTree` [INFO] [stdout] --> src/graph_theory/lca.rs:141:16 [INFO] [stdout] | [INFO] [stdout] 141 | pub struct WithSegmentTree<'a, S: Copy> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/lca.rs:146:16 [INFO] [stdout] | [INFO] [stdout] 146 | pub fn new(g: &Vec<(usize, usize)>, root: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/graph_theory/lca.rs:162:16 [INFO] [stdout] | [INFO] [stdout] 162 | pub fn get(&self, u: usize, v: usize) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `WithSqrtDecomposition` [INFO] [stdout] --> src/graph_theory/lca.rs:171:16 [INFO] [stdout] | [INFO] [stdout] 171 | pub struct WithSqrtDecomposition {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Semigroup` [INFO] [stdout] --> src/algebra/abstract_/structure.rs:13:16 [INFO] [stdout] | [INFO] [stdout] 13 | pub struct Semigroup<'a, S> { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 138 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `SparseTable` [INFO] [stdout] --> src/graph_theory/lca.rs:108:17 [INFO] [stdout] | [INFO] [stdout] 108 | use super::{SparseTable, DisjointSparseTable, euler_tour_node, Semigroup}; [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: use of deprecated associated function `std::array::IntoIter::::new`: use `IntoIterator::into_iter` instead [INFO] [stdout] --> src/number_theory/prime.rs:142:43 [INFO] [stdout] | [INFO] [stdout] 142 | BTreeMap::from_iter(IntoIter::new([(3, 1), (5, 1), (7, 1)])), [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(deprecated)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: use of deprecated associated function `std::array::IntoIter::::new`: use `IntoIterator::into_iter` instead [INFO] [stdout] --> src/number_theory/prime.rs:153:43 [INFO] [stdout] | [INFO] [stdout] 153 | BTreeMap::from_iter(IntoIter::new([(3, 1), (5, 1), (7, 1)])), [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `RollbackUnionFind` [INFO] [stdout] --> src/union_find.rs:35:12 [INFO] [stdout] | [INFO] [stdout] 35 | pub struct RollbackUnionFind {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `PersistentUnionFind` [INFO] [stdout] --> src/union_find.rs:39:12 [INFO] [stdout] | [INFO] [stdout] 39 | pub struct PersistentUnionFind {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `longest_increasing_sequence` [INFO] [stdout] --> src/dp.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn longest_increasing_sequence(a: &[T]) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `gcd` [INFO] [stdout] --> src/number_theory/lcm_gcd.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn gcd(a: usize, b: usize) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `lcm` [INFO] [stdout] --> src/number_theory/lcm_gcd.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn lcm(a: usize, b: usize) -> usize { a / gcd(a, b) * b } [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `euler_totient` [INFO] [stdout] --> src/number_theory/euler_totient.rs:3:8 [INFO] [stdout] | [INFO] [stdout] 3 | pub fn euler_totient(mut n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `EulerTotientLPF` [INFO] [stdout] --> src/number_theory/euler_totient.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub struct EulerTotientLPF {} [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `extgcd` [INFO] [stdout] --> src/number_theory/extgcd.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn extgcd(a: i64, b: i64) -> (i64, i64, i64) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bfs` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn bfs(g: &[Vec], src: usize) -> Vec { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `dijkstra_sparse` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn dijkstra_sparse(g: &Vec>, src: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `dijkstra_dense` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn dijkstra_dense(g: &Vec>, src: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:77:8 [INFO] [stdout] | [INFO] [stdout] 77 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bellman_ford_sparse` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:94:8 [INFO] [stdout] | [INFO] [stdout] 94 | pub fn bellman_ford_sparse(g: &Vec>, src: usize) -> Result, NegativeCycleError> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bellman_ford_dense` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:119:8 [INFO] [stdout] | [INFO] [stdout] 119 | pub fn bellman_ford_dense(g: &Vec>, src: usize) -> Result, NegativeCycleError> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `johnson_dense` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:143:8 [INFO] [stdout] | [INFO] [stdout] 143 | pub fn johnson_dense(g: &Vec>) -> Result>, NegativeCycleError> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `floyd_warshall` [INFO] [stdout] --> src/graph_theory/shortest_path.rs:169:8 [INFO] [stdout] | [INFO] [stdout] 169 | pub fn floyd_warshall(mut g: Vec>) -> Result>, NegativeCycleError> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `with_dfs` [INFO] [stdout] --> src/graph_theory/connected_components.rs:4:8 [INFO] [stdout] | [INFO] [stdout] 4 | pub fn with_dfs(n: usize, g: &Vec<(usize, usize)>) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `with_bfs` [INFO] [stdout] --> src/graph_theory/connected_components.rs:26:8 [INFO] [stdout] | [INFO] [stdout] 26 | pub fn with_bfs(n: usize, g: &Vec<(usize, usize)>) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `with_union_find` [INFO] [stdout] --> src/graph_theory/connected_components.rs:51:8 [INFO] [stdout] | [INFO] [stdout] 51 | pub fn with_union_find(n: usize, g: &Vec<(usize, usize)>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `kruskal` [INFO] [stdout] --> src/graph_theory/mst.rs:7:8 [INFO] [stdout] | [INFO] [stdout] 7 | pub fn kruskal(n: usize, mut g: Vec<(usize, usize, i64)>) -> Vec<(usize, usize, i64)> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `prim_sparse` [INFO] [stdout] --> src/graph_theory/mst.rs:22:8 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn prim_sparse(n: usize, g: &Vec<(usize, usize, i64)>) -> Vec<(usize, usize, i64)> { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `prim_dense` [INFO] [stdout] --> src/graph_theory/mst.rs:49:8 [INFO] [stdout] | [INFO] [stdout] 49 | pub fn prim_dense(g: &Vec>) -> Vec<(usize, usize, i64)> { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `boruvka` [INFO] [stdout] --> src/graph_theory/mst.rs:85:8 [INFO] [stdout] | [INFO] [stdout] 85 | pub fn boruvka(n: usize, g: &Vec<(usize, usize, i64)>) -> Vec<(usize, usize, i64)> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `reverse_delete` [INFO] [stdout] --> src/graph_theory/mst.rs:114:8 [INFO] [stdout] | [INFO] [stdout] 114 | pub fn reverse_delete() {} [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `randomized_linear` [INFO] [stdout] --> src/graph_theory/mst.rs:117:8 [INFO] [stdout] | [INFO] [stdout] 117 | pub fn randomized_linear() {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `lowlink` [INFO] [stdout] --> src/graph_theory/lowlink.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | pub fn lowlink(g: &Vec>) -> (Vec, Vec) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bridges` [INFO] [stdout] --> src/graph_theory/lowlink.rs:30:8 [INFO] [stdout] | [INFO] [stdout] 30 | pub fn bridges(n: usize, g: &Vec<(usize, usize)>) -> Vec<(usize, usize)> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `articulation_points` [INFO] [stdout] --> src/graph_theory/lowlink.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn articulation_points(g: &Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `path_based` [INFO] [stdout] --> src/graph_theory/scc.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn path_based(g: &Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `tarjan` [INFO] [stdout] --> src/graph_theory/scc.rs:56:8 [INFO] [stdout] | [INFO] [stdout] 56 | pub fn tarjan(g: &Vec>) -> Vec { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `kosaraju` [INFO] [stdout] --> src/graph_theory/scc.rs:111:8 [INFO] [stdout] | [INFO] [stdout] 111 | pub fn kosaraju(g: &Vec>) -> Vec { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/topological_sort.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | fn new() -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `with_dfs` [INFO] [stdout] --> src/graph_theory/topological_sort.rs:28:8 [INFO] [stdout] | [INFO] [stdout] 28 | pub fn with_dfs(g: &Vec>) -> Result, NonDAGError> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `kahn` [INFO] [stdout] --> src/graph_theory/topological_sort.rs:55:8 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn kahn(g: &Vec>) -> Result, NonDAGError> { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `tree_dfs` [INFO] [stdout] --> src/graph_theory/tree_diameter.rs:2:4 [INFO] [stdout] | [INFO] [stdout] 2 | fn tree_dfs(g: &Vec>, root: usize) -> (Vec, Vec) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `tree_diameter` [INFO] [stdout] --> src/graph_theory/tree_diameter.rs:19:8 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn tree_diameter(g: &Vec<(usize, usize, i64)>) -> (Vec, i64) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `euler_tour_edge` [INFO] [stdout] --> src/graph_theory/euler_tour.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn euler_tour_edge(g: &Vec<(usize, usize)>, root: usize) -> (Vec, Vec, Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `euler_tour_node` [INFO] [stdout] --> src/graph_theory/euler_tour.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn euler_tour_node(g: &Vec<(usize, usize)>, root: usize) -> (Vec, Vec, Vec, Vec, Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `rerooting` [INFO] [stdout] --> src/graph_theory/rerooting.rs:6:8 [INFO] [stdout] | [INFO] [stdout] 6 | pub fn rerooting(g: &Vec<(usize, usize, F)>, m: &Monoid, map: Box S>) -> Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `tree_bfs` [INFO] [stdout] --> src/graph_theory/tree_bfs.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | pub fn tree_bfs(g: &Vec<(usize, usize)>, root: usize) -> (Vec, Vec) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `tarjan_offline` [INFO] [stdout] --> src/graph_theory/lca.rs:16:8 [INFO] [stdout] | [INFO] [stdout] 16 | pub fn tarjan_offline(g: &Vec<(usize, usize)>, uv: &Vec<(usize, usize)>, root: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `BinaryLifting` [INFO] [stdout] --> src/graph_theory/lca.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub struct BinaryLifting { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/lca.rs:70:12 [INFO] [stdout] | [INFO] [stdout] 70 | pub fn new(g: &Vec<(usize, usize)>, root: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/graph_theory/lca.rs:86:12 [INFO] [stdout] | [INFO] [stdout] 86 | pub fn get(&self, mut u: usize, mut v: usize) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `with_hl_decomposition` [INFO] [stdout] --> src/graph_theory/lca.rs:103:8 [INFO] [stdout] | [INFO] [stdout] 103 | pub fn with_hl_decomposition() {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `WithHLD` [INFO] [stdout] --> src/graph_theory/lca.rs:178:12 [INFO] [stdout] | [INFO] [stdout] 178 | pub struct WithHLD {} [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `edmonds_karp` [INFO] [stdout] --> src/graph_theory/max_flow.rs:2:8 [INFO] [stdout] | [INFO] [stdout] 2 | pub fn edmonds_karp(g: &Vec>, src: usize, sink: usize) -> u64 { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `ford_fulkerson` [INFO] [stdout] --> src/graph_theory/max_flow.rs:63:8 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn ford_fulkerson(g: &Vec>, src: usize, sink: usize) -> u64 { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `dinic` [INFO] [stdout] --> src/graph_theory/max_flow.rs:114:8 [INFO] [stdout] | [INFO] [stdout] 114 | pub fn dinic(g: &Vec>, src: usize, sink: usize) -> u64 { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `mpm` [INFO] [stdout] --> src/graph_theory/max_flow.rs:178:8 [INFO] [stdout] | [INFO] [stdout] 178 | pub fn mpm() {} [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `push_relabel_fifo_vertex` [INFO] [stdout] --> src/graph_theory/max_flow.rs:182:8 [INFO] [stdout] | [INFO] [stdout] 182 | pub fn push_relabel_fifo_vertex() {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `push_relabel_dist_vertex` [INFO] [stdout] --> src/graph_theory/max_flow.rs:183:8 [INFO] [stdout] | [INFO] [stdout] 183 | pub fn push_relabel_dist_vertex() {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `push_relabel_dynamic_tree` [INFO] [stdout] --> src/graph_theory/max_flow.rs:184:8 [INFO] [stdout] | [INFO] [stdout] 184 | pub fn push_relabel_dynamic_tree() {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `krt` [INFO] [stdout] --> src/graph_theory/max_flow.rs:189:8 [INFO] [stdout] | [INFO] [stdout] 189 | pub fn krt() {} [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `binary_blocking_flow` [INFO] [stdout] --> src/graph_theory/max_flow.rs:194:8 [INFO] [stdout] | [INFO] [stdout] 194 | pub fn binary_blocking_flow() {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `orlin` [INFO] [stdout] --> src/graph_theory/max_flow.rs:198:8 [INFO] [stdout] | [INFO] [stdout] 198 | pub fn orlin() {} [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `ford_fulkerson` [INFO] [stdout] --> src/graph_theory/max_cardinal_match.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | pub fn ford_fulkerson(size_a: usize, size_b: usize, g: &[(usize, usize)]) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `hopcroft_karp` [INFO] [stdout] --> src/graph_theory/max_cardinal_match.rs:45:8 [INFO] [stdout] | [INFO] [stdout] 45 | pub fn hopcroft_karp(size_a: usize, size_b: usize, g: &[(usize, usize)]) -> Vec> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `blossom` [INFO] [stdout] --> src/graph_theory/max_cardinal_match.rs:109:8 [INFO] [stdout] | [INFO] [stdout] 109 | pub fn blossom() { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `msb` [INFO] [stdout] --> src/algebra/bit.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | pub fn msb(n: usize) -> isize { 0usize.leading_zeros() as isize - n.leading_zeros() as isize - 1 } [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `msb_number_binary_search` [INFO] [stdout] --> src/algebra/bit.rs:13:8 [INFO] [stdout] | [INFO] [stdout] 13 | pub fn msb_number_binary_search(mut n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `lsb` [INFO] [stdout] --> src/algebra/bit.rs:24:8 [INFO] [stdout] | [INFO] [stdout] 24 | pub fn lsb(n: usize) -> usize { n.reverse_bits().leading_zeros() as usize } [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `lsb_number` [INFO] [stdout] --> src/algebra/bit.rs:27:8 [INFO] [stdout] | [INFO] [stdout] 27 | pub fn lsb_number(n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `delete_least_bit` [INFO] [stdout] --> src/algebra/bit.rs:32:8 [INFO] [stdout] | [INFO] [stdout] 32 | pub fn delete_least_bit(n: usize) -> usize { n - lsb_number(n) } [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `delete_least_bit_v2` [INFO] [stdout] --> src/algebra/bit.rs:34:8 [INFO] [stdout] | [INFO] [stdout] 34 | pub fn delete_least_bit_v2(n: usize) -> usize { n & (n - 1) } [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bit_length_v2` [INFO] [stdout] --> src/algebra/bit.rs:42:8 [INFO] [stdout] | [INFO] [stdout] 42 | pub fn bit_length_v2(mut n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bit_length_v3` [INFO] [stdout] --> src/algebra/bit.rs:52:8 [INFO] [stdout] | [INFO] [stdout] 52 | pub fn bit_length_v3(n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bit_length_table` [INFO] [stdout] --> src/algebra/bit.rs:59:8 [INFO] [stdout] | [INFO] [stdout] 59 | pub fn bit_length_table(n: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `reverse_bits` [INFO] [stdout] --> src/algebra/bit.rs:66:8 [INFO] [stdout] | [INFO] [stdout] 66 | pub fn reverse_bits(n: usize) -> usize { n.reverse_bits() } [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `reverse_bits_v2` [INFO] [stdout] --> src/algebra/bit.rs:69:8 [INFO] [stdout] | [INFO] [stdout] 69 | pub fn reverse_bits_v2(mut n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bit_inverse` [INFO] [stdout] --> src/algebra/bit.rs:79:8 [INFO] [stdout] | [INFO] [stdout] 79 | pub fn bit_inverse(n: usize) -> usize { !n } [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bit_inverse_v2` [INFO] [stdout] --> src/algebra/bit.rs:82:8 [INFO] [stdout] | [INFO] [stdout] 82 | pub fn bit_inverse_v2(n: usize) -> usize { (!0usize) ^ n } [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `popcount` [INFO] [stdout] --> src/algebra/bit.rs:85:8 [INFO] [stdout] | [INFO] [stdout] 85 | pub fn popcount(mut n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `popcount_v2` [INFO] [stdout] --> src/algebra/bit.rs:96:8 [INFO] [stdout] | [INFO] [stdout] 96 | pub fn popcount_v2(n: usize) -> usize { n.count_ones() as usize } [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `popcount_v3` [INFO] [stdout] --> src/algebra/bit.rs:99:8 [INFO] [stdout] | [INFO] [stdout] 99 | pub fn popcount_v3(mut n: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `popcount_table` [INFO] [stdout] --> src/algebra/bit.rs:109:8 [INFO] [stdout] | [INFO] [stdout] 109 | pub fn popcount_table(n: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `Power` [INFO] [stdout] --> src/algebra/pow.rs:12:12 [INFO] [stdout] | [INFO] [stdout] 12 | pub struct Power<'a, T> { [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/algebra/pow.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn new(m: structs::Monoid<'a, T>) -> Self { Self { m } } [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `do` [INFO] [stdout] --> src/algebra/pow.rs:19:12 [INFO] [stdout] | [INFO] [stdout] 19 | pub fn r#do(&self, x: &T, n: usize) -> T{ [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `value` [INFO] [stdout] --> src/algebra/modular.rs:17:18 [INFO] [stdout] | [INFO] [stdout] 17 | pub const fn value(&self) -> usize { self.value % MOD } [INFO] [stdout] | ^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `size` [INFO] [stdout] --> src/algebra/tensor.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 9 | size: usize, [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] note: `Tensor` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stdout] --> src/algebra/tensor.rs:5:10 [INFO] [stdout] | [INFO] [stdout] 5 | #[derive(Clone)] [INFO] [stdout] | ^^^^^ [INFO] [stdout] = note: this warning originates in the derive macro `Clone` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `e` [INFO] [stdout] --> src/algebra/tensor.rs:89:12 [INFO] [stdout] | [INFO] [stdout] 89 | pub fn e(&self) -> Self { [INFO] [stdout] | ^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `op` [INFO] [stdout] --> src/algebra/tensor.rs:102:12 [INFO] [stdout] | [INFO] [stdout] 102 | pub fn op(lhs: &Self, rhs: &Self) -> Self { [INFO] [stdout] | ^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pow` [INFO] [stdout] --> src/algebra/tensor.rs:118:12 [INFO] [stdout] | [INFO] [stdout] 118 | pub fn pow(&self, n: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `bisect` [INFO] [stdout] --> src/analysis/binary_search.rs:1:8 [INFO] [stdout] | [INFO] [stdout] 1 | pub fn bisect(is_ok: &dyn Fn(&T) -> bool, a: &[T]) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `lower_bound` [INFO] [stdout] --> src/analysis/binary_search.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | pub fn lower_bound(a: &[T], x: &T) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `pascal` [INFO] [stdout] --> src/combinatorics/pascal.rs:5:8 [INFO] [stdout] | [INFO] [stdout] 5 | pub fn pascal(n: usize) -> Vec> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/tree/segment_tree.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 22 | pub fn new(m: Monoid<'a, S>, n: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_right` [INFO] [stdout] --> src/graph_theory/tree/segment_tree.rs:62:12 [INFO] [stdout] | [INFO] [stdout] 62 | pub fn max_right(&self, is_ok: Box bool>, l: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/tree/fenwick_tree.rs:17:12 [INFO] [stdout] | [INFO] [stdout] 17 | pub fn new(m: Monoid<'a, S>, n: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `max_right` [INFO] [stdout] --> src/graph_theory/tree/fenwick_tree.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 53 | pub fn max_right(&self, is_ok: Box bool>) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function is never used: `compute_first_idx` [INFO] [stdout] --> src/graph_theory/euler_tour.rs:55:12 [INFO] [stdout] | [INFO] [stdout] 55 | pub fn compute_first_idx(tour_edge: &Vec) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `WithSparseTable` [INFO] [stdout] --> src/graph_theory/lca.rs:112:16 [INFO] [stdout] | [INFO] [stdout] 112 | pub struct WithSparseTable<'a, S> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/lca.rs:117:16 [INFO] [stdout] | [INFO] [stdout] 117 | pub fn new(g: &Vec<(usize, usize)>, root: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/graph_theory/lca.rs:132:16 [INFO] [stdout] | [INFO] [stdout] 132 | pub fn get(&self, u: usize, v: usize) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `WithSegmentTree` [INFO] [stdout] --> src/graph_theory/lca.rs:141:16 [INFO] [stdout] | [INFO] [stdout] 141 | pub struct WithSegmentTree<'a, S: Copy> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/graph_theory/lca.rs:146:16 [INFO] [stdout] | [INFO] [stdout] 146 | pub fn new(g: &Vec<(usize, usize)>, root: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/graph_theory/lca.rs:162:16 [INFO] [stdout] | [INFO] [stdout] 162 | pub fn get(&self, u: usize, v: usize) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct is never constructed: `WithSqrtDecomposition` [INFO] [stdout] --> src/graph_theory/lca.rs:171:16 [INFO] [stdout] | [INFO] [stdout] 171 | pub struct WithSqrtDecomposition {} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 102 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished test [unoptimized + debuginfo] target(s) in 1.79s [INFO] running `Command { std: "docker" "inspect" "41e5d9821976fceb5a60523b816093f833d5f5215028944b288033958c925580", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "41e5d9821976fceb5a60523b816093f833d5f5215028944b288033958c925580", kill_on_drop: false }` [INFO] [stdout] 41e5d9821976fceb5a60523b816093f833d5f5215028944b288033958c925580 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-5/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-5/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:b0c94ce3c1162fcb8e57cac5b65ec2f72eabb1eebea4fcc35e269e823f681646" "/opt/rustwide/cargo-home/bin/cargo" "+1.60.0" "test" "--frozen", kill_on_drop: false }` [INFO] [stdout] 707b9b79f1b0d7bef95432d446160e0ebf3b8bc52e58feb91107cf79136ff4f6 [INFO] running `Command { std: "docker" "start" "-a" "707b9b79f1b0d7bef95432d446160e0ebf3b8bc52e58feb91107cf79136ff4f6", kill_on_drop: false }` [INFO] [stderr] warning: unused import: `SparseTable` [INFO] [stderr] --> src/graph_theory/lca.rs:108:17 [INFO] [stderr] | [INFO] [stderr] 108 | use super::{SparseTable, DisjointSparseTable, euler_tour_node, Semigroup}; [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` on by default [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `UnionFind` [INFO] [stderr] --> src/union_find.rs:1:12 [INFO] [stderr] | [INFO] [stderr] 1 | pub struct UnionFind { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/union_find.rs:7:12 [INFO] [stderr] | [INFO] [stderr] 7 | pub fn new(n: usize) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `find` [INFO] [stderr] --> src/union_find.rs:11:12 [INFO] [stderr] | [INFO] [stderr] 11 | pub fn find(&mut self, u: usize) -> usize { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `unite` [INFO] [stderr] --> src/union_find.rs:17:12 [INFO] [stderr] | [INFO] [stderr] 17 | pub fn unite(&mut self, u: usize, v: usize) { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `size` [INFO] [stderr] --> src/union_find.rs:25:12 [INFO] [stderr] | [INFO] [stderr] 25 | pub fn size(&mut self, u: usize) -> usize { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `RollbackUnionFind` [INFO] [stderr] --> src/union_find.rs:35:12 [INFO] [stderr] | [INFO] [stderr] 35 | pub struct RollbackUnionFind {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `PersistentUnionFind` [INFO] [stderr] --> src/union_find.rs:39:12 [INFO] [stderr] | [INFO] [stderr] 39 | pub struct PersistentUnionFind {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `SparseTable` [INFO] [stderr] --> src/sparse_table.rs:9:12 [INFO] [stderr] | [INFO] [stderr] 9 | pub struct SparseTable<'a, S> { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/sparse_table.rs:17:12 [INFO] [stderr] | [INFO] [stderr] 17 | pub fn new(sg: Semigroup<'a, S>, a: &Vec) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get` [INFO] [stderr] --> src/sparse_table.rs:34:12 [INFO] [stderr] | [INFO] [stderr] 34 | pub fn get(&self, l: usize, r: usize) -> S { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `DisjointSparseTable` [INFO] [stderr] --> src/sparse_table.rs:48:12 [INFO] [stderr] | [INFO] [stderr] 48 | pub struct DisjointSparseTable<'a, S> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/sparse_table.rs:55:12 [INFO] [stderr] | [INFO] [stderr] 55 | pub fn new(sg: Semigroup<'a, S>, a: &Vec) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get` [INFO] [stderr] --> src/sparse_table.rs:76:12 [INFO] [stderr] | [INFO] [stderr] 76 | pub fn get(&self, l: usize, r: usize) -> S { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `unique` [INFO] [stderr] --> src/vector.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn unique(a: &Vec) -> Vec { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `compress_array` [INFO] [stderr] --> src/vector.rs:9:8 [INFO] [stderr] | [INFO] [stderr] 9 | pub fn compress_array(a: &Vec) -> (Vec, Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `longest_increasing_sequence` [INFO] [stderr] --> src/dp.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn longest_increasing_sequence(a: &[T]) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `least_prime_factor` [INFO] [stderr] --> src/number_theory/prime.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub fn least_prime_factor(n: usize) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `greatest_prime_factor` [INFO] [stderr] --> src/number_theory/prime.rs:18:8 [INFO] [stderr] | [INFO] [stderr] 18 | pub fn greatest_prime_factor(n: usize) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `sieve_of_eratosthenes` [INFO] [stderr] --> src/number_theory/prime.rs:34:8 [INFO] [stderr] | [INFO] [stderr] 34 | pub fn sieve_of_eratosthenes(n: usize) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `find_prime_numbers` [INFO] [stderr] --> src/number_theory/prime.rs:40:8 [INFO] [stderr] | [INFO] [stderr] 40 | pub fn find_prime_numbers(n: usize) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `prime_factorize` [INFO] [stderr] --> src/number_theory/prime.rs:46:8 [INFO] [stderr] | [INFO] [stderr] 46 | pub fn prime_factorize(mut n: usize) -> std::collections::BTreeMap { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `PrimeFactorizeLPF` [INFO] [stderr] --> src/number_theory/prime.rs:62:12 [INFO] [stderr] | [INFO] [stderr] 62 | pub struct PrimeFactorizeLPF { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/number_theory/prime.rs:68:12 [INFO] [stderr] | [INFO] [stderr] 68 | pub fn new(n: usize) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `factorize` [INFO] [stderr] --> src/number_theory/prime.rs:72:12 [INFO] [stderr] | [INFO] [stderr] 72 | pub fn factorize(&self, mut n: usize) -> std::collections::BTreeMap { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `count_prime_factors` [INFO] [stderr] --> src/number_theory/prime.rs:84:8 [INFO] [stderr] | [INFO] [stderr] 84 | pub fn count_prime_factors(n: usize) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `find_divisors` [INFO] [stderr] --> src/number_theory/divisor.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn find_divisors(n: i32) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `gcd` [INFO] [stderr] --> src/number_theory/lcm_gcd.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn gcd(a: usize, b: usize) -> usize { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `lcm` [INFO] [stderr] --> src/number_theory/lcm_gcd.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn lcm(a: usize, b: usize) -> usize { a / gcd(a, b) * b } [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `euler_totient` [INFO] [stderr] --> src/number_theory/euler_totient.rs:3:8 [INFO] [stderr] | [INFO] [stderr] 3 | pub fn euler_totient(mut n: usize) -> usize { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `EulerTotientLPF` [INFO] [stderr] --> src/number_theory/euler_totient.rs:19:12 [INFO] [stderr] | [INFO] [stderr] 19 | pub struct EulerTotientLPF {} [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `extgcd` [INFO] [stderr] --> src/number_theory/extgcd.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn extgcd(a: i64, b: i64) -> (i64, i64, i64) { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `bfs` [INFO] [stderr] --> src/graph_theory/shortest_path.rs:4:8 [INFO] [stderr] | [INFO] [stderr] 4 | pub fn bfs(g: &[Vec], src: usize) -> Vec { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `dijkstra_sparse` [INFO] [stderr] --> src/graph_theory/shortest_path.rs:24:8 [INFO] [stderr] | [INFO] [stderr] 24 | pub fn dijkstra_sparse(g: &Vec>, src: usize) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `dijkstra_dense` [INFO] [stderr] --> src/graph_theory/shortest_path.rs:45:8 [INFO] [stderr] | [INFO] [stderr] 45 | pub fn dijkstra_dense(g: &Vec>, src: usize) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/graph_theory/shortest_path.rs:77:8 [INFO] [stderr] | [INFO] [stderr] 77 | fn new() -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `bellman_ford_sparse` [INFO] [stderr] --> src/graph_theory/shortest_path.rs:94:8 [INFO] [stderr] | [INFO] [stderr] 94 | pub fn bellman_ford_sparse(g: &Vec>, src: usize) -> Result, NegativeCycleError> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `bellman_ford_dense` [INFO] [stderr] --> src/graph_theory/shortest_path.rs:119:8 [INFO] [stderr] | [INFO] [stderr] 119 | pub fn bellman_ford_dense(g: &Vec>, src: usize) -> Result, NegativeCycleError> { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `johnson_dense` [INFO] [stderr] --> src/graph_theory/shortest_path.rs:143:8 [INFO] [stderr] | [INFO] [stderr] 143 | pub fn johnson_dense(g: &Vec>) -> Result>, NegativeCycleError> { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `floyd_warshall` [INFO] [stderr] --> src/graph_theory/shortest_path.rs:169:8 [INFO] [stderr] | [INFO] [stderr] 169 | pub fn floyd_warshall(mut g: Vec>) -> Result>, NegativeCycleError> { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `with_dfs` [INFO] [stderr] --> src/graph_theory/connected_components.rs:4:8 [INFO] [stderr] | [INFO] [stderr] 4 | pub fn with_dfs(n: usize, g: &Vec<(usize, usize)>) -> Vec { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `with_bfs` [INFO] [stderr] --> src/graph_theory/connected_components.rs:26:8 [INFO] [stderr] | [INFO] [stderr] 26 | pub fn with_bfs(n: usize, g: &Vec<(usize, usize)>) -> Vec { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `with_union_find` [INFO] [stderr] --> src/graph_theory/connected_components.rs:51:8 [INFO] [stderr] | [INFO] [stderr] 51 | pub fn with_union_find(n: usize, g: &Vec<(usize, usize)>) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `kruskal` [INFO] [stderr] --> src/graph_theory/mst.rs:7:8 [INFO] [stderr] | [INFO] [stderr] 7 | pub fn kruskal(n: usize, mut g: Vec<(usize, usize, i64)>) -> Vec<(usize, usize, i64)> { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `prim_sparse` [INFO] [stderr] --> src/graph_theory/mst.rs:22:8 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn prim_sparse(n: usize, g: &Vec<(usize, usize, i64)>) -> Vec<(usize, usize, i64)> { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `prim_dense` [INFO] [stderr] --> src/graph_theory/mst.rs:49:8 [INFO] [stderr] | [INFO] [stderr] 49 | pub fn prim_dense(g: &Vec>) -> Vec<(usize, usize, i64)> { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `boruvka` [INFO] [stderr] --> src/graph_theory/mst.rs:85:8 [INFO] [stderr] | [INFO] [stderr] 85 | pub fn boruvka(n: usize, g: &Vec<(usize, usize, i64)>) -> Vec<(usize, usize, i64)> { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `reverse_delete` [INFO] [stderr] --> src/graph_theory/mst.rs:114:8 [INFO] [stderr] | [INFO] [stderr] 114 | pub fn reverse_delete() {} [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `randomized_linear` [INFO] [stderr] --> src/graph_theory/mst.rs:117:8 [INFO] [stderr] | [INFO] [stderr] 117 | pub fn randomized_linear() {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `lowlink` [INFO] [stderr] --> src/graph_theory/lowlink.rs:2:8 [INFO] [stderr] | [INFO] [stderr] 2 | pub fn lowlink(g: &Vec>) -> (Vec, Vec) { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `bridges` [INFO] [stderr] --> src/graph_theory/lowlink.rs:30:8 [INFO] [stderr] | [INFO] [stderr] 30 | pub fn bridges(n: usize, g: &Vec<(usize, usize)>) -> Vec<(usize, usize)> { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `articulation_points` [INFO] [stderr] --> src/graph_theory/lowlink.rs:52:8 [INFO] [stderr] | [INFO] [stderr] 52 | pub fn articulation_points(g: &Vec>) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `path_based` [INFO] [stderr] --> src/graph_theory/scc.rs:6:8 [INFO] [stderr] | [INFO] [stderr] 6 | pub fn path_based(g: &Vec>) -> Vec { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `tarjan` [INFO] [stderr] --> src/graph_theory/scc.rs:56:8 [INFO] [stderr] | [INFO] [stderr] 56 | pub fn tarjan(g: &Vec>) -> Vec { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `kosaraju` [INFO] [stderr] --> src/graph_theory/scc.rs:111:8 [INFO] [stderr] | [INFO] [stderr] 111 | pub fn kosaraju(g: &Vec>) -> Vec { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/graph_theory/topological_sort.rs:8:8 [INFO] [stderr] | [INFO] [stderr] 8 | fn new() -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `with_dfs` [INFO] [stderr] --> src/graph_theory/topological_sort.rs:28:8 [INFO] [stderr] | [INFO] [stderr] 28 | pub fn with_dfs(g: &Vec>) -> Result, NonDAGError> { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `kahn` [INFO] [stderr] --> src/graph_theory/topological_sort.rs:55:8 [INFO] [stderr] | [INFO] [stderr] 55 | pub fn kahn(g: &Vec>) -> Result, NonDAGError> { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `tree_dfs` [INFO] [stderr] --> src/graph_theory/tree_diameter.rs:2:4 [INFO] [stderr] | [INFO] [stderr] 2 | fn tree_dfs(g: &Vec>, root: usize) -> (Vec, Vec) { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `tree_diameter` [INFO] [stderr] --> src/graph_theory/tree_diameter.rs:19:8 [INFO] [stderr] | [INFO] [stderr] 19 | pub fn tree_diameter(g: &Vec<(usize, usize, i64)>) -> (Vec, i64) { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `euler_tour_edge` [INFO] [stderr] --> src/graph_theory/euler_tour.rs:6:8 [INFO] [stderr] | [INFO] [stderr] 6 | pub fn euler_tour_edge(g: &Vec<(usize, usize)>, root: usize) -> (Vec, Vec, Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `euler_tour_node` [INFO] [stderr] --> src/graph_theory/euler_tour.rs:34:8 [INFO] [stderr] | [INFO] [stderr] 34 | pub fn euler_tour_node(g: &Vec<(usize, usize)>, root: usize) -> (Vec, Vec, Vec, Vec, Vec) { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `rerooting` [INFO] [stderr] --> src/graph_theory/rerooting.rs:6:8 [INFO] [stderr] | [INFO] [stderr] 6 | pub fn rerooting(g: &Vec<(usize, usize, F)>, m: &Monoid, map: Box S>) -> Vec { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `tree_bfs` [INFO] [stderr] --> src/graph_theory/tree_bfs.rs:2:8 [INFO] [stderr] | [INFO] [stderr] 2 | pub fn tree_bfs(g: &Vec<(usize, usize)>, root: usize) -> (Vec, Vec) { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `tarjan_offline` [INFO] [stderr] --> src/graph_theory/lca.rs:16:8 [INFO] [stderr] | [INFO] [stderr] 16 | pub fn tarjan_offline(g: &Vec<(usize, usize)>, uv: &Vec<(usize, usize)>, root: usize) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `BinaryLifting` [INFO] [stderr] --> src/graph_theory/lca.rs:62:12 [INFO] [stderr] | [INFO] [stderr] 62 | pub struct BinaryLifting { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/graph_theory/lca.rs:70:12 [INFO] [stderr] | [INFO] [stderr] 70 | pub fn new(g: &Vec<(usize, usize)>, root: usize) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get` [INFO] [stderr] --> src/graph_theory/lca.rs:86:12 [INFO] [stderr] | [INFO] [stderr] 86 | pub fn get(&self, mut u: usize, mut v: usize) -> usize { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `with_hl_decomposition` [INFO] [stderr] --> src/graph_theory/lca.rs:103:8 [INFO] [stderr] | [INFO] [stderr] 103 | pub fn with_hl_decomposition() {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `WithHLD` [INFO] [stderr] --> src/graph_theory/lca.rs:178:12 [INFO] [stderr] | [INFO] [stderr] 178 | pub struct WithHLD {} [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `edmonds_karp` [INFO] [stderr] --> src/graph_theory/max_flow.rs:2:8 [INFO] [stderr] | [INFO] [stderr] 2 | pub fn edmonds_karp(g: &Vec>, src: usize, sink: usize) -> u64 { [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `ford_fulkerson` [INFO] [stderr] --> src/graph_theory/max_flow.rs:63:8 [INFO] [stderr] | [INFO] [stderr] 63 | pub fn ford_fulkerson(g: &Vec>, src: usize, sink: usize) -> u64 { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `dinic` [INFO] [stderr] --> src/graph_theory/max_flow.rs:114:8 [INFO] [stderr] | [INFO] [stderr] 114 | pub fn dinic(g: &Vec>, src: usize, sink: usize) -> u64 { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `mpm` [INFO] [stderr] --> src/graph_theory/max_flow.rs:178:8 [INFO] [stderr] | [INFO] [stderr] 178 | pub fn mpm() {} [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `push_relabel_fifo_vertex` [INFO] [stderr] --> src/graph_theory/max_flow.rs:182:8 [INFO] [stderr] | [INFO] [stderr] 182 | pub fn push_relabel_fifo_vertex() {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `push_relabel_dist_vertex` [INFO] [stderr] --> src/graph_theory/max_flow.rs:183:8 [INFO] [stderr] | [INFO] [stderr] 183 | pub fn push_relabel_dist_vertex() {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `push_relabel_dynamic_tree` [INFO] [stderr] --> src/graph_theory/max_flow.rs:184:8 [INFO] [stderr] | [INFO] [stderr] 184 | pub fn push_relabel_dynamic_tree() {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `krt` [INFO] [stderr] --> src/graph_theory/max_flow.rs:189:8 [INFO] [stderr] | [INFO] [stderr] 189 | pub fn krt() {} [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `binary_blocking_flow` [INFO] [stderr] --> src/graph_theory/max_flow.rs:194:8 [INFO] [stderr] | [INFO] [stderr] 194 | pub fn binary_blocking_flow() {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `orlin` [INFO] [stderr] --> src/graph_theory/max_flow.rs:198:8 [INFO] [stderr] | [INFO] [stderr] 198 | pub fn orlin() {} [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `ford_fulkerson` [INFO] [stderr] --> src/graph_theory/max_cardinal_match.rs:10:8 [INFO] [stderr] | [INFO] [stderr] 10 | pub fn ford_fulkerson(size_a: usize, size_b: usize, g: &[(usize, usize)]) -> Vec> { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `hopcroft_karp` [INFO] [stderr] --> src/graph_theory/max_cardinal_match.rs:45:8 [INFO] [stderr] | [INFO] [stderr] 45 | pub fn hopcroft_karp(size_a: usize, size_b: usize, g: &[(usize, usize)]) -> Vec> { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `blossom` [INFO] [stderr] --> src/graph_theory/max_cardinal_match.rs:109:8 [INFO] [stderr] | [INFO] [stderr] 109 | pub fn blossom() { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `msb` [INFO] [stderr] --> src/algebra/bit.rs:10:8 [INFO] [stderr] | [INFO] [stderr] 10 | pub fn msb(n: usize) -> isize { 0usize.leading_zeros() as isize - n.leading_zeros() as isize - 1 } [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `msb_number_binary_search` [INFO] [stderr] --> src/algebra/bit.rs:13:8 [INFO] [stderr] | [INFO] [stderr] 13 | pub fn msb_number_binary_search(mut n: usize) -> usize { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `lsb` [INFO] [stderr] --> src/algebra/bit.rs:24:8 [INFO] [stderr] | [INFO] [stderr] 24 | pub fn lsb(n: usize) -> usize { n.reverse_bits().leading_zeros() as usize } [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `lsb_number` [INFO] [stderr] --> src/algebra/bit.rs:27:8 [INFO] [stderr] | [INFO] [stderr] 27 | pub fn lsb_number(n: usize) -> usize { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `delete_least_bit` [INFO] [stderr] --> src/algebra/bit.rs:32:8 [INFO] [stderr] | [INFO] [stderr] 32 | pub fn delete_least_bit(n: usize) -> usize { n - lsb_number(n) } [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `delete_least_bit_v2` [INFO] [stderr] --> src/algebra/bit.rs:34:8 [INFO] [stderr] | [INFO] [stderr] 34 | pub fn delete_least_bit_v2(n: usize) -> usize { n & (n - 1) } [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `bit_length` [INFO] [stderr] --> src/algebra/bit.rs:37:8 [INFO] [stderr] | [INFO] [stderr] 37 | pub fn bit_length(n: usize) -> usize { [INFO] [stderr] | ^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `bit_length_v2` [INFO] [stderr] --> src/algebra/bit.rs:42:8 [INFO] [stderr] | [INFO] [stderr] 42 | pub fn bit_length_v2(mut n: usize) -> usize { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `bit_length_v3` [INFO] [stderr] --> src/algebra/bit.rs:52:8 [INFO] [stderr] | [INFO] [stderr] 52 | pub fn bit_length_v3(n: usize) -> usize { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `bit_length_table` [INFO] [stderr] --> src/algebra/bit.rs:59:8 [INFO] [stderr] | [INFO] [stderr] 59 | pub fn bit_length_table(n: usize) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `reverse_bits` [INFO] [stderr] --> src/algebra/bit.rs:66:8 [INFO] [stderr] | [INFO] [stderr] 66 | pub fn reverse_bits(n: usize) -> usize { n.reverse_bits() } [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `reverse_bits_v2` [INFO] [stderr] --> src/algebra/bit.rs:69:8 [INFO] [stderr] | [INFO] [stderr] 69 | pub fn reverse_bits_v2(mut n: usize) -> usize { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `bit_inverse` [INFO] [stderr] --> src/algebra/bit.rs:79:8 [INFO] [stderr] | [INFO] [stderr] 79 | pub fn bit_inverse(n: usize) -> usize { !n } [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `bit_inverse_v2` [INFO] [stderr] --> src/algebra/bit.rs:82:8 [INFO] [stderr] | [INFO] [stderr] 82 | pub fn bit_inverse_v2(n: usize) -> usize { (!0usize) ^ n } [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `popcount` [INFO] [stderr] --> src/algebra/bit.rs:85:8 [INFO] [stderr] | [INFO] [stderr] 85 | pub fn popcount(mut n: usize) -> usize { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `popcount_v2` [INFO] [stderr] --> src/algebra/bit.rs:96:8 [INFO] [stderr] | [INFO] [stderr] 96 | pub fn popcount_v2(n: usize) -> usize { n.count_ones() as usize } [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `popcount_v3` [INFO] [stderr] --> src/algebra/bit.rs:99:8 [INFO] [stderr] | [INFO] [stderr] 99 | pub fn popcount_v3(mut n: usize) -> usize { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `popcount_table` [INFO] [stderr] --> src/algebra/bit.rs:109:8 [INFO] [stderr] | [INFO] [stderr] 109 | pub fn popcount_table(n: usize) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Power` [INFO] [stderr] --> src/algebra/pow.rs:12:12 [INFO] [stderr] | [INFO] [stderr] 12 | pub struct Power<'a, T> { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/algebra/pow.rs:17:12 [INFO] [stderr] | [INFO] [stderr] 17 | pub fn new(m: structs::Monoid<'a, T>) -> Self { Self { m } } [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `do` [INFO] [stderr] --> src/algebra/pow.rs:19:12 [INFO] [stderr] | [INFO] [stderr] 19 | pub fn r#do(&self, x: &T, n: usize) -> T{ [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/algebra/modular.rs:16:12 [INFO] [stderr] | [INFO] [stderr] 16 | pub fn new(n: usize) -> Self { Self { value: n % MOD } } [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `value` [INFO] [stderr] --> src/algebra/modular.rs:17:18 [INFO] [stderr] | [INFO] [stderr] 17 | pub const fn value(&self) -> usize { self.value % MOD } [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: field is never read: `size` [INFO] [stderr] --> src/algebra/tensor.rs:9:5 [INFO] [stderr] | [INFO] [stderr] 9 | size: usize, [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] note: `Tensor` has a derived impl for the trait `Clone`, but this is intentionally ignored during dead code analysis [INFO] [stderr] --> src/algebra/tensor.rs:5:10 [INFO] [stderr] | [INFO] [stderr] 5 | #[derive(Clone)] [INFO] [stderr] | ^^^^^ [INFO] [stderr] = note: this warning originates in the derive macro `Clone` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `e` [INFO] [stderr] --> src/algebra/tensor.rs:89:12 [INFO] [stderr] | [INFO] [stderr] 89 | pub fn e(&self) -> Self { [INFO] [stderr] | ^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `op` [INFO] [stderr] --> src/algebra/tensor.rs:102:12 [INFO] [stderr] | [INFO] [stderr] 102 | pub fn op(lhs: &Self, rhs: &Self) -> Self { [INFO] [stderr] | ^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `pow` [INFO] [stderr] --> src/algebra/tensor.rs:118:12 [INFO] [stderr] | [INFO] [stderr] 118 | pub fn pow(&self, n: usize) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `sa_doubling` [INFO] [stderr] --> src/string/sa.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn sa_doubling(a: &Vec) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `sa_doubling_with_countsort` [INFO] [stderr] --> src/string/sa.rs:31:8 [INFO] [stderr] | [INFO] [stderr] 31 | pub fn sa_doubling_with_countsort(a: &Vec) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `sa_is` [INFO] [stderr] --> src/string/sa.rs:75:8 [INFO] [stderr] | [INFO] [stderr] 75 | pub fn sa_is(a: &Vec) -> Vec { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `bisect` [INFO] [stderr] --> src/analysis/binary_search.rs:1:8 [INFO] [stderr] | [INFO] [stderr] 1 | pub fn bisect(is_ok: &dyn Fn(&T) -> bool, a: &[T]) -> usize { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `lower_bound` [INFO] [stderr] --> src/analysis/binary_search.rs:11:8 [INFO] [stderr] | [INFO] [stderr] 11 | pub fn lower_bound(a: &[T], x: &T) -> usize { [INFO] [stderr] | ^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `pascal` [INFO] [stderr] --> src/combinatorics/pascal.rs:5:8 [INFO] [stderr] | [INFO] [stderr] 5 | pub fn pascal(n: usize) -> Vec> { [INFO] [stderr] | ^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: field is never read: `m` [INFO] [stderr] --> src/graph_theory/tree/segment_tree.rs:8:5 [INFO] [stderr] | [INFO] [stderr] 8 | m: Monoid<'a, S>, [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/graph_theory/tree/segment_tree.rs:22:12 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn new(m: Monoid<'a, S>, n: usize) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `from_vec` [INFO] [stderr] --> src/graph_theory/tree/segment_tree.rs:27:12 [INFO] [stderr] | [INFO] [stderr] 27 | pub fn from_vec(m: Monoid<'a, S>, a: &Vec) -> Self { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `merge` [INFO] [stderr] --> src/graph_theory/tree/segment_tree.rs:37:8 [INFO] [stderr] | [INFO] [stderr] 37 | fn merge(&mut self, i: usize) { [INFO] [stderr] | ^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `set` [INFO] [stderr] --> src/graph_theory/tree/segment_tree.rs:41:12 [INFO] [stderr] | [INFO] [stderr] 41 | pub fn set(&mut self, mut i: usize, x: S) { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get` [INFO] [stderr] --> src/graph_theory/tree/segment_tree.rs:48:12 [INFO] [stderr] | [INFO] [stderr] 48 | pub fn get(&self, mut l: usize, mut r: usize) -> S { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `max_right` [INFO] [stderr] --> src/graph_theory/tree/segment_tree.rs:62:12 [INFO] [stderr] | [INFO] [stderr] 62 | pub fn max_right(&self, is_ok: Box bool>, l: usize) -> usize { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: field is never read: `m` [INFO] [stderr] --> src/graph_theory/tree/fenwick_tree.rs:4:5 [INFO] [stderr] | [INFO] [stderr] 4 | m: Monoid<'a, S>, [INFO] [stderr] | ^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/graph_theory/tree/fenwick_tree.rs:17:12 [INFO] [stderr] | [INFO] [stderr] 17 | pub fn new(m: Monoid<'a, S>, n: usize) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `from_vec` [INFO] [stderr] --> src/graph_theory/tree/fenwick_tree.rs:22:12 [INFO] [stderr] | [INFO] [stderr] 22 | pub fn from_vec(m: Monoid<'a, S>, a: &Vec) -> Self { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `set` [INFO] [stderr] --> src/graph_theory/tree/fenwick_tree.rs:34:12 [INFO] [stderr] | [INFO] [stderr] 34 | pub fn set(&mut self, mut i: usize, x: &S) { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get` [INFO] [stderr] --> src/graph_theory/tree/fenwick_tree.rs:43:12 [INFO] [stderr] | [INFO] [stderr] 43 | pub fn get(&self, mut i: usize) -> S { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `max_right` [INFO] [stderr] --> src/graph_theory/tree/fenwick_tree.rs:53:12 [INFO] [stderr] | [INFO] [stderr] 53 | pub fn max_right(&self, is_ok: Box bool>) -> usize { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: function is never used: `compute_first_idx` [INFO] [stderr] --> src/graph_theory/euler_tour.rs:55:12 [INFO] [stderr] | [INFO] [stderr] 55 | pub fn compute_first_idx(tour_edge: &Vec) -> Vec { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `WithSparseTable` [INFO] [stderr] --> src/graph_theory/lca.rs:112:16 [INFO] [stderr] | [INFO] [stderr] 112 | pub struct WithSparseTable<'a, S> { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/graph_theory/lca.rs:117:16 [INFO] [stderr] | [INFO] [stderr] 117 | pub fn new(g: &Vec<(usize, usize)>, root: usize) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get` [INFO] [stderr] --> src/graph_theory/lca.rs:132:16 [INFO] [stderr] | [INFO] [stderr] 132 | pub fn get(&self, u: usize, v: usize) -> usize { [INFO] [stderr] | ^^^ [INFO] [stdout] [INFO] [stderr] [INFO] [stdout] running 25 tests [INFO] [stderr] warning: struct is never constructed: `WithSegmentTree` [INFO] [stdout] test algebra::modular::tests::test_add ... ok [INFO] [stderr] --> src/graph_theory/lca.rs:141:16 [INFO] [stdout] test algebra::modular::tests::test_inverse ... ok [INFO] [stderr] | [INFO] [stdout] test algebra::modular::tests::test_add_assign ... ok [INFO] [stderr] 141 | pub struct WithSegmentTree<'a, S: Copy> { [INFO] [stdout] test algebra::modular::tests::test_mul_assign ... ok [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stdout] test algebra::modular::tests::test_neg ... ok [INFO] [stderr] [INFO] [stdout] test algebra::modular::tests::test_new ... ok [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stdout] test algebra::modular::tests::test_sub ... ok [INFO] [stderr] --> src/graph_theory/lca.rs:146:16 [INFO] [stdout] test algebra::modular::tests::test_sub_assign ... ok [INFO] [stderr] | [INFO] [stdout] test graph_theory::tree::segment_tree::tests::test_segment_tree ... ok [INFO] [stderr] 146 | pub fn new(g: &Vec<(usize, usize)>, root: usize) -> Self { [INFO] [stdout] test number_theory::divisor::tests::test_find_divisors ... ok [INFO] [stderr] | ^^^ [INFO] [stdout] test number_theory::prime::tests::test_count_prime_factors ... ok [INFO] [stderr] [INFO] [stdout] test number_theory::prime::tests::test_prime_factorize ... ok [INFO] [stderr] warning: associated function is never used: `get` [INFO] [stdout] test sparse_table::tests::test_sparse_table ... ok [INFO] [stderr] --> src/graph_theory/lca.rs:162:16 [INFO] [stdout] test string::sa::tests::test_sa_is ... ok [INFO] [stderr] | [INFO] [stdout] test number_theory::prime::tests::test_prime_factorize_lpf ... ok [INFO] [stderr] 162 | pub fn get(&self, u: usize, v: usize) -> usize { [INFO] [stdout] test number_theory::prime::tests::test_find_prime_numbers ... ok [INFO] [stderr] | ^^^ [INFO] [stdout] test number_theory::prime::tests::test_sieve_of_eratosthenes ... ok [INFO] [stderr] [INFO] [stdout] test number_theory::prime::tests::test_greatest_prime_factor ... ok [INFO] [stderr] warning: struct is never constructed: `WithSqrtDecomposition` [INFO] [stderr] --> src/graph_theory/lca.rs:171:16 [INFO] [stderr] | [INFO] [stderr] 171 | pub struct WithSqrtDecomposition {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `Semigroup` [INFO] [stderr] --> src/algebra/abstract_/structure.rs:13:16 [INFO] [stderr] | [INFO] [stderr] 13 | pub struct Semigroup<'a, S> { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: `kagemeka` (lib) generated 138 warnings [INFO] [stderr] warning: use of deprecated associated function `std::array::IntoIter::::new`: use `IntoIterator::into_iter` instead [INFO] [stderr] --> src/number_theory/prime.rs:142:43 [INFO] [stderr] | [INFO] [stderr] 142 | BTreeMap::from_iter(IntoIter::new([(3, 1), (5, 1), (7, 1)])), [INFO] [stderr] | ^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(deprecated)]` on by default [INFO] [stderr] [INFO] [stderr] warning: use of deprecated associated function `std::array::IntoIter::::new`: use `IntoIterator::into_iter` instead [INFO] [stderr] --> src/number_theory/prime.rs:153:43 [INFO] [stderr] | [INFO] [stderr] 153 | BTreeMap::from_iter(IntoIter::new([(3, 1), (5, 1), (7, 1)])), [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: struct is never constructed: `RollbackUnionFind` [INFO] [stderr] --> src/union_find.rs:35:12 [INFO] [stderr] | [INFO] [stderr] 35 | pub struct RollbackUnionFind {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: `kagemeka` (lib test) generated 102 warnings (99 duplicates) [INFO] [stderr] Finished test [unoptimized + debuginfo] target(s) in 0.01s [INFO] [stderr] Running unittests (/opt/rustwide/target/debug/deps/kagemeka-8805ec17e2168d2b) [INFO] [stderr] Doc-tests kagemeka [INFO] [stdout] test algebra::modular::tests::test_mul ... ok [INFO] [stdout] test string::sa::tests::test_sa_doubling ... ok [INFO] [stdout] test number_theory::prime::tests::test_least_prime_factor ... ok [INFO] [stdout] test string::sa::tests::test_sa_doubling_with_countsort ... ok [INFO] [stdout] test union_find::tests::test_uf ... ok [INFO] [stdout] test graph_theory::tree::fenwick_tree::tests::test_fenwick_tree ... ok [INFO] [stdout] test sparse_table::tests::test_disjoint_sparse_table ... ok [INFO] [stdout] [INFO] [stdout] test result: ok. 25 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s [INFO] [stdout] [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" "707b9b79f1b0d7bef95432d446160e0ebf3b8bc52e58feb91107cf79136ff4f6", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "707b9b79f1b0d7bef95432d446160e0ebf3b8bc52e58feb91107cf79136ff4f6", kill_on_drop: false }` [INFO] [stdout] 707b9b79f1b0d7bef95432d446160e0ebf3b8bc52e58feb91107cf79136ff4f6