[INFO] fetching crate Route16 0.0.1... [INFO] testing Route16-0.0.1 against beta-2021-09-08 for beta-1.56-1 [INFO] extracting crate Route16 0.0.1 into /workspace/builds/worker-2/source [INFO] validating manifest of crates.io crate Route16 0.0.1 on toolchain beta-2021-09-08 [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+beta-2021-09-08" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking crates.io crate Route16 0.0.1 [INFO] finished tweaking crates.io crate Route16 0.0.1 [INFO] tweaked toml for crates.io crate Route16 0.0.1 written to /workspace/builds/worker-2/source/Cargo.toml [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+beta-2021-09-08" "generate-lockfile" "--manifest-path" "Cargo.toml" "-Zno-index-update", kill_on_drop: false }` [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+beta-2021-09-08" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Downloading crates ... [INFO] [stderr] Downloaded rental v0.5.6 [INFO] [stderr] Downloaded priority-queue v0.7.0 [INFO] [stderr] Downloaded protobuf-codegen-pure v2.25.1 [INFO] [stderr] Downloaded osmpbfreader v0.13.4 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/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:a89201d6b5b9fd45c15d5952ece0a0129e7e80cb26ec023fd59cf09bc26f1604" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2021-09-08" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 5c781053f8101e4a310e32f42f1ea9b81b59404e2f319269cd1f9ff770fa0f0e [INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap. [INFO] running `Command { std: "docker" "start" "-a" "5c781053f8101e4a310e32f42f1ea9b81b59404e2f319269cd1f9ff770fa0f0e", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "5c781053f8101e4a310e32f42f1ea9b81b59404e2f319269cd1f9ff770fa0f0e", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "5c781053f8101e4a310e32f42f1ea9b81b59404e2f319269cd1f9ff770fa0f0e", kill_on_drop: false }` [INFO] [stdout] 5c781053f8101e4a310e32f42f1ea9b81b59404e2f319269cd1f9ff770fa0f0e [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/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:a89201d6b5b9fd45c15d5952ece0a0129e7e80cb26ec023fd59cf09bc26f1604" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2021-09-08" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap. [INFO] [stdout] 2d22571602a4259b02206ef2270b2b1bde73990cd8aa252ab1fd52731892a39b [INFO] running `Command { std: "docker" "start" "-a" "2d22571602a4259b02206ef2270b2b1bde73990cd8aa252ab1fd52731892a39b", kill_on_drop: false }` [INFO] [stderr] Compiling protobuf v2.25.1 [INFO] [stderr] Compiling stable_deref_trait v1.2.0 [INFO] [stderr] Compiling pub-iterator-type v0.1.1 [INFO] [stderr] Compiling take_mut v0.2.2 [INFO] [stderr] Compiling rustc-hash v1.1.0 [INFO] [stderr] Compiling if_chain v1.0.2 [INFO] [stderr] Compiling num-traits v0.2.14 [INFO] [stderr] Compiling num-bigint v0.2.6 [INFO] [stderr] Compiling num-iter v0.1.42 [INFO] [stderr] Compiling num-rational v0.2.4 [INFO] [stderr] Compiling num-complex v0.2.4 [INFO] [stderr] Compiling flate2 v1.0.21 [INFO] [stderr] Compiling rental-impl v0.5.5 [INFO] [stderr] Compiling serde_derive v1.0.130 [INFO] [stderr] Compiling par-map v0.1.4 [INFO] [stderr] Compiling priority-queue v0.7.0 [INFO] [stderr] Compiling num-integer v0.1.44 [INFO] [stderr] Compiling num v0.2.1 [INFO] [stderr] Compiling protobuf-codegen v2.25.1 [INFO] [stderr] Compiling flat_map v0.0.9 [INFO] [stderr] Compiling protobuf-codegen-pure v2.25.1 [INFO] [stderr] Compiling rental v0.5.6 [INFO] [stderr] Compiling osmpbfreader v0.13.4 [INFO] [stderr] Compiling Route16 v0.0.1 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `RankedWeightedEdge` [INFO] [stdout] --> src/io/dimacs_graph_builder.rs:5:27 [INFO] [stdout] | [INFO] [stdout] 5 | EdgeTrait, RankTrait, RankedWeightedEdge, WeightedEdge, WeightedEdgeWithHopLength, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable statement [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:567:9 [INFO] [stdout] | [INFO] [stdout] 395 | / loop { [INFO] [stdout] 396 | | let mut forward_finished = false; [INFO] [stdout] 397 | | if self.forward_heap.is_empty() { [INFO] [stdout] 398 | | forward_finished = true; [INFO] [stdout] ... | [INFO] [stdout] 564 | | } [INFO] [stdout] 565 | | } [INFO] [stdout] | |_________- any code following this expression is unreachable [INFO] [stdout] 566 | [INFO] [stdout] 567 | / debug!( [INFO] [stdout] 568 | | "Could not find a path, exiting, forward heap size = {}, back heap size = {}", [INFO] [stdout] 569 | | self.forward_heap.size(), [INFO] [stdout] 570 | | self.backward_heap.size() [INFO] [stdout] 571 | | ); [INFO] [stdout] | |__________^ unreachable statement [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unreachable_code)]` on by default [INFO] [stdout] = note: this warning originates in the macro `log` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `RankTrait` [INFO] [stdout] --> src/io/dimacs_graph_builder.rs:5:16 [INFO] [stdout] | [INFO] [stdout] 5 | EdgeTrait, RankTrait, RankedWeightedEdge, WeightedEdge, WeightedEdgeWithHopLength, [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `total_vertices_settled` is assigned to, but never used [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:51:17 [INFO] [stdout] | [INFO] [stdout] 51 | let mut total_vertices_settled = 0; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] = note: consider using `_total_vertices_settled` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `start` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:134:13 [INFO] [stdout] | [INFO] [stdout] 134 | let start = Instant::now(); [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_start` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `node_importance` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:152:41 [INFO] [stdout] | [INFO] [stdout] 152 | let (node_being_contracted, node_importance) = node_heap.pop(); [INFO] [stdout] | ^^^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_node_importance` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num_vertices` is never read [INFO] [stdout] --> src/algorithms/contraction_hierarchy/shortest_path_test.rs:38:11 [INFO] [stdout] | [INFO] [stdout] 38 | let mut num_vertices = 0; [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `vertex_1` [INFO] [stdout] --> src/data_structures/graphs/graph.rs:160:50 [INFO] [stdout] | [INFO] [stdout] 160 | fn get_outbound_edge_between_vertices(&self, vertex_1: u32, vertex_2: u32) -> Option { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_vertex_1` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `vertex_2` [INFO] [stdout] --> src/data_structures/graphs/graph.rs:160:65 [INFO] [stdout] | [INFO] [stdout] 160 | fn get_outbound_edge_between_vertices(&self, vertex_1: u32, vertex_2: u32) -> Option { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_vertex_2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `item` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:45:32 [INFO] [stdout] | [INFO] [stdout] 45 | fn change_priority(&mut self, item: T) {} [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_item` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:121:18 [INFO] [stdout] | [INFO] [stdout] 121 | pub fn build(mut graph: Graph, max_pop_count: u32) -> CHGraph { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:131:13 [INFO] [stdout] | [INFO] [stdout] 131 | let mut shortest_path_test = ShortestPathTest::new(Rc::clone(&graph_rc), max_pop_count); [INFO] [stdout] | ----^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:232:41 [INFO] [stdout] | [INFO] [stdout] 232 | ... let mut graph_ref_mut = graph_rc.as_ptr(); [INFO] [stdout] | ----^^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `rank` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:28:5 [INFO] [stdout] | [INFO] [stdout] 28 | rank: Vec, [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `order` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:29:5 [INFO] [stdout] | [INFO] [stdout] 29 | order: Vec, [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `level` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:30:5 [INFO] [stdout] | [INFO] [stdout] 30 | level: Vec, [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `max_pop_count` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:31:5 [INFO] [stdout] | [INFO] [stdout] 31 | max_pop_count: u32, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `parent_forward` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:343:5 [INFO] [stdout] | [INFO] [stdout] 343 | parent_forward: Vec, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `parent_backward` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:344:5 [INFO] [stdout] | [INFO] [stdout] 344 | parent_backward: Vec, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pin_source_without_bypass_node` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/shortest_path_test.rs:63:9 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn pin_source_without_bypass_node(&mut self, source: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `data` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:7:2 [INFO] [stdout] | [INFO] [stdout] 7 | data: Vec, [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:11:5 [INFO] [stdout] | [INFO] [stdout] 11 | fn new() -> CustomBinaryHeap { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `with_capacity` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:15:5 [INFO] [stdout] | [INFO] [stdout] 15 | fn with_capacity(capacity: usize) -> CustomBinaryHeap { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `push` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:21:5 [INFO] [stdout] | [INFO] [stdout] 21 | fn push(&mut self, item: T) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_empty` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:27:5 [INFO] [stdout] | [INFO] [stdout] 27 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `len` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:31:5 [INFO] [stdout] | [INFO] [stdout] 31 | fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pop` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:35:5 [INFO] [stdout] | [INFO] [stdout] 35 | fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `change_priority` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:45:5 [INFO] [stdout] | [INFO] [stdout] 45 | fn change_priority(&mut self, item: T) {} [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sift_up` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:47:5 [INFO] [stdout] | [INFO] [stdout] 47 | fn sift_up(&mut self, start: usize, pos: usize) -> usize { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sift_down_range` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:64:5 [INFO] [stdout] | [INFO] [stdout] 64 | fn sift_down_range(&mut self, pos: usize, end: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sift_down` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:84:5 [INFO] [stdout] | [INFO] [stdout] 84 | fn sift_down(&mut self, pos: usize) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sift_down_to_bottom` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:94:5 [INFO] [stdout] | [INFO] [stdout] 94 | fn sift_down_to_bottom(&mut self, mut pos: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rebuild` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:114:5 [INFO] [stdout] | [INFO] [stdout] 114 | fn rebuild(&mut self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:138:12 [INFO] [stdout] | [INFO] [stdout] 138 | unsafe fn new(data: &'a mut [T], pos: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pos` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:150:5 [INFO] [stdout] | [INFO] [stdout] 150 | fn pos(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `element` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:156:5 [INFO] [stdout] | [INFO] [stdout] 156 | fn element(&self) -> &T { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:164:12 [INFO] [stdout] | [INFO] [stdout] 164 | unsafe fn get(&self, index: usize) -> &T { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `move_to` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:174:12 [INFO] [stdout] | [INFO] [stdout] 174 | unsafe fn move_to(&mut self, index: usize) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: crate `Route16` should have a snake case name [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] = help: convert the identifier to snake case: `route16` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait method `MAX` should have a snake case name [INFO] [stdout] --> src/data_structures/graphs/weight.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | fn MAX() -> Self; [INFO] [stdout] | ^^^ help: convert the identifier to snake case: `max` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait method `MIN` should have a snake case name [INFO] [stdout] --> src/data_structures/graphs/weight.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | fn MIN() -> Self; [INFO] [stdout] | ^^^ help: convert the identifier to snake case: `min` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait method `ZERO` should have a snake case name [INFO] [stdout] --> src/data_structures/graphs/weight.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | fn ZERO() -> Self; [INFO] [stdout] | ^^^^ help: convert the identifier to snake case: `zero` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 42 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 35.49s [INFO] running `Command { std: "docker" "inspect" "2d22571602a4259b02206ef2270b2b1bde73990cd8aa252ab1fd52731892a39b", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "2d22571602a4259b02206ef2270b2b1bde73990cd8aa252ab1fd52731892a39b", kill_on_drop: false }` [INFO] [stdout] 2d22571602a4259b02206ef2270b2b1bde73990cd8aa252ab1fd52731892a39b [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/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:a89201d6b5b9fd45c15d5952ece0a0129e7e80cb26ec023fd59cf09bc26f1604" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2021-09-08" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap. [INFO] [stdout] 5bbcb25fa3bc8acaf8b6367f95f2234253706c310709749c4e71a88ec12446e2 [INFO] running `Command { std: "docker" "start" "-a" "5bbcb25fa3bc8acaf8b6367f95f2234253706c310709749c4e71a88ec12446e2", kill_on_drop: false }` [INFO] [stdout] warning: unused import: `RankedWeightedEdge` [INFO] [stdout] --> src/io/dimacs_graph_builder.rs:5:27 [INFO] [stdout] | [INFO] [stdout] 5 | EdgeTrait, RankTrait, RankedWeightedEdge, WeightedEdge, WeightedEdgeWithHopLength, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable statement [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:567:9 [INFO] [stdout] | [INFO] [stdout] 395 | / loop { [INFO] [stdout] 396 | | let mut forward_finished = false; [INFO] [stdout] 397 | | if self.forward_heap.is_empty() { [INFO] [stdout] 398 | | forward_finished = true; [INFO] [stdout] ... | [INFO] [stdout] 564 | | } [INFO] [stdout] 565 | | } [INFO] [stdout] | |_________- any code following this expression is unreachable [INFO] [stdout] 566 | [INFO] [stdout] 567 | / debug!( [INFO] [stdout] 568 | | "Could not find a path, exiting, forward heap size = {}, back heap size = {}", [INFO] [stdout] 569 | | self.forward_heap.size(), [INFO] [stdout] 570 | | self.backward_heap.size() [INFO] [stdout] 571 | | ); [INFO] [stdout] | |__________^ unreachable statement [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unreachable_code)]` on by default [INFO] [stdout] = note: this warning originates in the macro `log` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `RankTrait` [INFO] [stdout] --> src/io/dimacs_graph_builder.rs:5:16 [INFO] [stdout] | [INFO] [stdout] 5 | EdgeTrait, RankTrait, RankedWeightedEdge, WeightedEdge, WeightedEdgeWithHopLength, [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `total_vertices_settled` is assigned to, but never used [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:51:17 [INFO] [stdout] | [INFO] [stdout] 51 | let mut total_vertices_settled = 0; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] = note: consider using `_total_vertices_settled` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `start` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:134:13 [INFO] [stdout] | [INFO] [stdout] 134 | let start = Instant::now(); [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_start` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `node_importance` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:152:41 [INFO] [stdout] | [INFO] [stdout] 152 | let (node_being_contracted, node_importance) = node_heap.pop(); [INFO] [stdout] | ^^^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_node_importance` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num_vertices` is never read [INFO] [stdout] --> src/algorithms/contraction_hierarchy/shortest_path_test.rs:38:11 [INFO] [stdout] | [INFO] [stdout] 38 | let mut num_vertices = 0; [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `vertex_1` [INFO] [stdout] --> src/data_structures/graphs/graph.rs:160:50 [INFO] [stdout] | [INFO] [stdout] 160 | fn get_outbound_edge_between_vertices(&self, vertex_1: u32, vertex_2: u32) -> Option { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_vertex_1` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `vertex_2` [INFO] [stdout] --> src/data_structures/graphs/graph.rs:160:65 [INFO] [stdout] | [INFO] [stdout] 160 | fn get_outbound_edge_between_vertices(&self, vertex_1: u32, vertex_2: u32) -> Option { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_vertex_2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `item` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:45:32 [INFO] [stdout] | [INFO] [stdout] 45 | fn change_priority(&mut self, item: T) {} [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_item` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:121:18 [INFO] [stdout] | [INFO] [stdout] 121 | pub fn build(mut graph: Graph, max_pop_count: u32) -> CHGraph { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:131:13 [INFO] [stdout] | [INFO] [stdout] 131 | let mut shortest_path_test = ShortestPathTest::new(Rc::clone(&graph_rc), max_pop_count); [INFO] [stdout] | ----^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:232:41 [INFO] [stdout] | [INFO] [stdout] 232 | ... let mut graph_ref_mut = graph_rc.as_ptr(); [INFO] [stdout] | ----^^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `rank` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:28:5 [INFO] [stdout] | [INFO] [stdout] 28 | rank: Vec, [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `order` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:29:5 [INFO] [stdout] | [INFO] [stdout] 29 | order: Vec, [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `level` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:30:5 [INFO] [stdout] | [INFO] [stdout] 30 | level: Vec, [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `max_pop_count` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:31:5 [INFO] [stdout] | [INFO] [stdout] 31 | max_pop_count: u32, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `parent_forward` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:343:5 [INFO] [stdout] | [INFO] [stdout] 343 | parent_forward: Vec, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `parent_backward` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:344:5 [INFO] [stdout] | [INFO] [stdout] 344 | parent_backward: Vec, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pin_source_without_bypass_node` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/shortest_path_test.rs:63:9 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn pin_source_without_bypass_node(&mut self, source: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `data` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:7:2 [INFO] [stdout] | [INFO] [stdout] 7 | data: Vec, [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:11:5 [INFO] [stdout] | [INFO] [stdout] 11 | fn new() -> CustomBinaryHeap { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `with_capacity` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:15:5 [INFO] [stdout] | [INFO] [stdout] 15 | fn with_capacity(capacity: usize) -> CustomBinaryHeap { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `push` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:21:5 [INFO] [stdout] | [INFO] [stdout] 21 | fn push(&mut self, item: T) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_empty` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:27:5 [INFO] [stdout] | [INFO] [stdout] 27 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `len` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:31:5 [INFO] [stdout] | [INFO] [stdout] 31 | fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pop` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:35:5 [INFO] [stdout] | [INFO] [stdout] 35 | fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `change_priority` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:45:5 [INFO] [stdout] | [INFO] [stdout] 45 | fn change_priority(&mut self, item: T) {} [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling Route16 v0.0.1 (/opt/rustwide/workdir) [INFO] [stdout] warning: associated function is never used: `sift_up` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:47:5 [INFO] [stdout] | [INFO] [stdout] 47 | fn sift_up(&mut self, start: usize, pos: usize) -> usize { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sift_down_range` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:64:5 [INFO] [stdout] | [INFO] [stdout] 64 | fn sift_down_range(&mut self, pos: usize, end: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sift_down` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:84:5 [INFO] [stdout] | [INFO] [stdout] 84 | fn sift_down(&mut self, pos: usize) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sift_down_to_bottom` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:94:5 [INFO] [stdout] | [INFO] [stdout] 94 | fn sift_down_to_bottom(&mut self, mut pos: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rebuild` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:114:5 [INFO] [stdout] | [INFO] [stdout] 114 | fn rebuild(&mut self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:138:12 [INFO] [stdout] | [INFO] [stdout] 138 | unsafe fn new(data: &'a mut [T], pos: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pos` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:150:5 [INFO] [stdout] | [INFO] [stdout] 150 | fn pos(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `element` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:156:5 [INFO] [stdout] | [INFO] [stdout] 156 | fn element(&self) -> &T { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:164:12 [INFO] [stdout] | [INFO] [stdout] 164 | unsafe fn get(&self, index: usize) -> &T { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `move_to` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:174:12 [INFO] [stdout] | [INFO] [stdout] 174 | unsafe fn move_to(&mut self, index: usize) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: crate `Route16` should have a snake case name [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] = help: convert the identifier to snake case: `route16` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait method `MAX` should have a snake case name [INFO] [stdout] --> src/data_structures/graphs/weight.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | fn MAX() -> Self; [INFO] [stdout] | ^^^ help: convert the identifier to snake case: `max` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait method `MIN` should have a snake case name [INFO] [stdout] --> src/data_structures/graphs/weight.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | fn MIN() -> Self; [INFO] [stdout] | ^^^ help: convert the identifier to snake case: `min` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait method `ZERO` should have a snake case name [INFO] [stdout] --> src/data_structures/graphs/weight.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | fn ZERO() -> Self; [INFO] [stdout] | ^^^^ help: convert the identifier to snake case: `zero` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 42 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `RankedWeightedEdge` [INFO] [stdout] --> src/io/dimacs_graph_builder.rs:5:27 [INFO] [stdout] | [INFO] [stdout] 5 | EdgeTrait, RankTrait, RankedWeightedEdge, WeightedEdge, WeightedEdgeWithHopLength, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unreachable statement [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:567:9 [INFO] [stdout] | [INFO] [stdout] 395 | / loop { [INFO] [stdout] 396 | | let mut forward_finished = false; [INFO] [stdout] 397 | | if self.forward_heap.is_empty() { [INFO] [stdout] 398 | | forward_finished = true; [INFO] [stdout] ... | [INFO] [stdout] 564 | | } [INFO] [stdout] 565 | | } [INFO] [stdout] | |_________- any code following this expression is unreachable [INFO] [stdout] 566 | [INFO] [stdout] 567 | / debug!( [INFO] [stdout] 568 | | "Could not find a path, exiting, forward heap size = {}, back heap size = {}", [INFO] [stdout] 569 | | self.forward_heap.size(), [INFO] [stdout] 570 | | self.backward_heap.size() [INFO] [stdout] 571 | | ); [INFO] [stdout] | |__________^ unreachable statement [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unreachable_code)]` on by default [INFO] [stdout] = note: this warning originates in the macro `log` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `RankTrait` [INFO] [stdout] --> src/io/dimacs_graph_builder.rs:5:16 [INFO] [stdout] | [INFO] [stdout] 5 | EdgeTrait, RankTrait, RankedWeightedEdge, WeightedEdge, WeightedEdgeWithHopLength, [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable `total_vertices_settled` is assigned to, but never used [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:51:17 [INFO] [stdout] | [INFO] [stdout] 51 | let mut total_vertices_settled = 0; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] = note: consider using `_total_vertices_settled` instead [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `start` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:134:13 [INFO] [stdout] | [INFO] [stdout] 134 | let start = Instant::now(); [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_start` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `node_importance` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:152:41 [INFO] [stdout] | [INFO] [stdout] 152 | let (node_being_contracted, node_importance) = node_heap.pop(); [INFO] [stdout] | ^^^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_node_importance` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: value assigned to `num_vertices` is never read [INFO] [stdout] --> src/algorithms/contraction_hierarchy/shortest_path_test.rs:38:11 [INFO] [stdout] | [INFO] [stdout] 38 | let mut num_vertices = 0; [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_assignments)]` on by default [INFO] [stdout] = help: maybe it is overwritten before being read? [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `vertex_1` [INFO] [stdout] --> src/data_structures/graphs/graph.rs:160:50 [INFO] [stdout] | [INFO] [stdout] 160 | fn get_outbound_edge_between_vertices(&self, vertex_1: u32, vertex_2: u32) -> Option { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_vertex_1` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `vertex_2` [INFO] [stdout] --> src/data_structures/graphs/graph.rs:160:65 [INFO] [stdout] | [INFO] [stdout] 160 | fn get_outbound_edge_between_vertices(&self, vertex_1: u32, vertex_2: u32) -> Option { [INFO] [stdout] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_vertex_2` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `item` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:45:32 [INFO] [stdout] | [INFO] [stdout] 45 | fn change_priority(&mut self, item: T) {} [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_item` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:121:18 [INFO] [stdout] | [INFO] [stdout] 121 | pub fn build(mut graph: Graph, max_pop_count: u32) -> CHGraph { [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:131:13 [INFO] [stdout] | [INFO] [stdout] 131 | let mut shortest_path_test = ShortestPathTest::new(Rc::clone(&graph_rc), max_pop_count); [INFO] [stdout] | ----^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:232:41 [INFO] [stdout] | [INFO] [stdout] 232 | ... let mut graph_ref_mut = graph_rc.as_ptr(); [INFO] [stdout] | ----^^^^^^^^^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `rank` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:28:5 [INFO] [stdout] | [INFO] [stdout] 28 | rank: Vec, [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `order` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:29:5 [INFO] [stdout] | [INFO] [stdout] 29 | order: Vec, [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `level` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:30:5 [INFO] [stdout] | [INFO] [stdout] 30 | level: Vec, [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `max_pop_count` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:31:5 [INFO] [stdout] | [INFO] [stdout] 31 | max_pop_count: u32, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `parent_forward` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:343:5 [INFO] [stdout] | [INFO] [stdout] 343 | parent_forward: Vec, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `parent_backward` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:344:5 [INFO] [stdout] | [INFO] [stdout] 344 | parent_backward: Vec, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pin_source_without_bypass_node` [INFO] [stdout] --> src/algorithms/contraction_hierarchy/shortest_path_test.rs:63:9 [INFO] [stdout] | [INFO] [stdout] 63 | pub fn pin_source_without_bypass_node(&mut self, source: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field is never read: `data` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:7:2 [INFO] [stdout] | [INFO] [stdout] 7 | data: Vec, [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:11:5 [INFO] [stdout] | [INFO] [stdout] 11 | fn new() -> CustomBinaryHeap { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `with_capacity` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:15:5 [INFO] [stdout] | [INFO] [stdout] 15 | fn with_capacity(capacity: usize) -> CustomBinaryHeap { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `push` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:21:5 [INFO] [stdout] | [INFO] [stdout] 21 | fn push(&mut self, item: T) { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `is_empty` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:27:5 [INFO] [stdout] | [INFO] [stdout] 27 | fn is_empty(&self) -> bool { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `len` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:31:5 [INFO] [stdout] | [INFO] [stdout] 31 | fn len(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pop` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:35:5 [INFO] [stdout] | [INFO] [stdout] 35 | fn pop(&mut self) -> Option { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `change_priority` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:45:5 [INFO] [stdout] | [INFO] [stdout] 45 | fn change_priority(&mut self, item: T) {} [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sift_up` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:47:5 [INFO] [stdout] | [INFO] [stdout] 47 | fn sift_up(&mut self, start: usize, pos: usize) -> usize { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sift_down_range` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:64:5 [INFO] [stdout] | [INFO] [stdout] 64 | fn sift_down_range(&mut self, pos: usize, end: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sift_down` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:84:5 [INFO] [stdout] | [INFO] [stdout] 84 | fn sift_down(&mut self, pos: usize) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `sift_down_to_bottom` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:94:5 [INFO] [stdout] | [INFO] [stdout] 94 | fn sift_down_to_bottom(&mut self, mut pos: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `rebuild` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:114:5 [INFO] [stdout] | [INFO] [stdout] 114 | fn rebuild(&mut self) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `new` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:138:12 [INFO] [stdout] | [INFO] [stdout] 138 | unsafe fn new(data: &'a mut [T], pos: usize) -> Self { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `pos` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:150:5 [INFO] [stdout] | [INFO] [stdout] 150 | fn pos(&self) -> usize { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `element` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:156:5 [INFO] [stdout] | [INFO] [stdout] 156 | fn element(&self) -> &T { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `get` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:164:12 [INFO] [stdout] | [INFO] [stdout] 164 | unsafe fn get(&self, index: usize) -> &T { [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated function is never used: `move_to` [INFO] [stdout] --> src/data_structures/heaps/custom_binary_heap.rs:174:12 [INFO] [stdout] | [INFO] [stdout] 174 | unsafe fn move_to(&mut self, index: usize) { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: crate `Route16` should have a snake case name [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(non_snake_case)]` on by default [INFO] [stdout] = help: convert the identifier to snake case: `route16` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait method `MAX` should have a snake case name [INFO] [stdout] --> src/data_structures/graphs/weight.rs:8:8 [INFO] [stdout] | [INFO] [stdout] 8 | fn MAX() -> Self; [INFO] [stdout] | ^^^ help: convert the identifier to snake case: `max` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait method `MIN` should have a snake case name [INFO] [stdout] --> src/data_structures/graphs/weight.rs:9:8 [INFO] [stdout] | [INFO] [stdout] 9 | fn MIN() -> Self; [INFO] [stdout] | ^^^ help: convert the identifier to snake case: `min` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: trait method `ZERO` should have a snake case name [INFO] [stdout] --> src/data_structures/graphs/weight.rs:10:8 [INFO] [stdout] | [INFO] [stdout] 10 | fn ZERO() -> Self; [INFO] [stdout] | ^^^^ help: convert the identifier to snake case: `zero` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 42 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished test [unoptimized + debuginfo] target(s) in 1.57s [INFO] running `Command { std: "docker" "inspect" "5bbcb25fa3bc8acaf8b6367f95f2234253706c310709749c4e71a88ec12446e2", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "5bbcb25fa3bc8acaf8b6367f95f2234253706c310709749c4e71a88ec12446e2", kill_on_drop: false }` [INFO] [stdout] 5bbcb25fa3bc8acaf8b6367f95f2234253706c310709749c4e71a88ec12446e2 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-2/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:a89201d6b5b9fd45c15d5952ece0a0129e7e80cb26ec023fd59cf09bc26f1604" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2021-09-08" "test" "--frozen", kill_on_drop: false }` [INFO] [stdout] 31e8fb1ced2989b93a2380266e79bb7dbe121701e903912a9ffb4c0dbbe6ec8f [INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap. [INFO] running `Command { std: "docker" "start" "-a" "31e8fb1ced2989b93a2380266e79bb7dbe121701e903912a9ffb4c0dbbe6ec8f", kill_on_drop: false }` [INFO] [stderr] warning: unused import: `RankedWeightedEdge` [INFO] [stderr] --> src/io/dimacs_graph_builder.rs:5:27 [INFO] [stderr] | [INFO] [stderr] 5 | EdgeTrait, RankTrait, RankedWeightedEdge, WeightedEdge, WeightedEdgeWithHopLength, [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_imports)]` on by default [INFO] [stderr] [INFO] [stderr] warning: unreachable statement [INFO] [stderr] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:567:9 [INFO] [stderr] | [INFO] [stderr] 395 | / loop { [INFO] [stderr] 396 | | let mut forward_finished = false; [INFO] [stderr] 397 | | if self.forward_heap.is_empty() { [INFO] [stderr] 398 | | forward_finished = true; [INFO] [stderr] ... | [INFO] [stderr] 564 | | } [INFO] [stderr] 565 | | } [INFO] [stderr] | |_________- any code following this expression is unreachable [INFO] [stderr] 566 | [INFO] [stderr] 567 | / debug!( [INFO] [stderr] 568 | | "Could not find a path, exiting, forward heap size = {}, back heap size = {}", [INFO] [stderr] 569 | | self.forward_heap.size(), [INFO] [stderr] 570 | | self.backward_heap.size() [INFO] [stderr] 571 | | ); [INFO] [stderr] | |__________^ unreachable statement [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unreachable_code)]` on by default [INFO] [stderr] = note: this warning originates in the macro `log` (in Nightly builds, run with -Z macro-backtrace for more info) [INFO] [stderr] [INFO] [stderr] warning: unused import: `RankTrait` [INFO] [stderr] --> src/io/dimacs_graph_builder.rs:5:16 [INFO] [stderr] | [INFO] [stderr] 5 | EdgeTrait, RankTrait, RankedWeightedEdge, WeightedEdge, WeightedEdgeWithHopLength, [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: variable `total_vertices_settled` is assigned to, but never used [INFO] [stderr] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:51:17 [INFO] [stderr] | [INFO] [stderr] 51 | let mut total_vertices_settled = 0; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_variables)]` on by default [INFO] [stderr] = note: consider using `_total_vertices_settled` instead [INFO] [stderr] [INFO] [stderr] warning: unused variable: `start` [INFO] [stderr] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:134:13 [INFO] [stderr] | [INFO] [stderr] 134 | let start = Instant::now(); [INFO] [stderr] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_start` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `node_importance` [INFO] [stderr] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:152:41 [INFO] [stderr] | [INFO] [stderr] 152 | let (node_being_contracted, node_importance) = node_heap.pop(); [INFO] [stderr] | ^^^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_node_importance` [INFO] [stderr] [INFO] [stderr] warning: value assigned to `num_vertices` is never read [INFO] [stderr] --> src/algorithms/contraction_hierarchy/shortest_path_test.rs:38:11 [INFO] [stderr] | [INFO] [stderr] 38 | let mut num_vertices = 0; [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_assignments)]` on by default [INFO] [stderr] = help: maybe it is overwritten before being read? [INFO] [stderr] [INFO] [stderr] warning: unused variable: `vertex_1` [INFO] [stderr] --> src/data_structures/graphs/graph.rs:160:50 [INFO] [stderr] | [INFO] [stderr] 160 | fn get_outbound_edge_between_vertices(&self, vertex_1: u32, vertex_2: u32) -> Option { [INFO] [stderr] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_vertex_1` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `vertex_2` [INFO] [stderr] --> src/data_structures/graphs/graph.rs:160:65 [INFO] [stderr] | [INFO] [stderr] 160 | fn get_outbound_edge_between_vertices(&self, vertex_1: u32, vertex_2: u32) -> Option { [INFO] [stderr] | ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_vertex_2` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `item` [INFO] [stderr] --> src/data_structures/heaps/custom_binary_heap.rs:45:32 [INFO] [stderr] | [INFO] [stderr] 45 | fn change_priority(&mut self, item: T) {} [INFO] [stderr] | ^^^^ help: if this is intentional, prefix it with an underscore: `_item` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:121:18 [INFO] [stderr] | [INFO] [stderr] 121 | pub fn build(mut graph: Graph, max_pop_count: u32) -> CHGraph { [INFO] [stderr] | ----^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_mut)]` on by default [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:131:13 [INFO] [stderr] | [INFO] [stderr] 131 | let mut shortest_path_test = ShortestPathTest::new(Rc::clone(&graph_rc), max_pop_count); [INFO] [stderr] | ----^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:232:41 [INFO] [stderr] | [INFO] [stderr] 232 | ... let mut graph_ref_mut = graph_rc.as_ptr(); [INFO] [stderr] | ----^^^^^^^^^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: field is never read: `rank` [INFO] [stderr] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:28:5 [INFO] [stderr] | [INFO] [stderr] 28 | rank: Vec, [INFO] [stderr] | ^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(dead_code)]` on by default [INFO] [stderr] [INFO] [stderr] warning: field is never read: `order` [INFO] [stderr] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:29:5 [INFO] [stderr] | [INFO] [stderr] 29 | order: Vec, [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: field is never read: `level` [INFO] [stderr] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:30:5 [INFO] [stderr] | [INFO] [stderr] 30 | level: Vec, [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: field is never read: `max_pop_count` [INFO] [stderr] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:31:5 [INFO] [stderr] | [INFO] [stderr] 31 | max_pop_count: u32, [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: field is never read: `parent_forward` [INFO] [stderr] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:343:5 [INFO] [stderr] | [INFO] [stderr] 343 | parent_forward: Vec, [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: field is never read: `parent_backward` [INFO] [stderr] --> src/algorithms/contraction_hierarchy/contraction_hierarchy.rs:344:5 [INFO] [stderr] | [INFO] [stderr] 344 | parent_backward: Vec, [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `pin_source_without_bypass_node` [INFO] [stderr] --> src/algorithms/contraction_hierarchy/shortest_path_test.rs:63:9 [INFO] [stderr] | [INFO] [stderr] 63 | pub fn pin_source_without_bypass_node(&mut self, source: u32) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: field is never read: `data` [INFO] [stderr] --> src/data_structures/heaps/custom_binary_heap.rs:7:2 [INFO] [stderr] | [INFO] [stderr] 7 | data: Vec, [INFO] [stderr] | ^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/data_structures/heaps/custom_binary_heap.rs:11:5 [INFO] [stderr] | [INFO] [stderr] 11 | fn new() -> CustomBinaryHeap { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `with_capacity` [INFO] [stderr] --> src/data_structures/heaps/custom_binary_heap.rs:15:5 [INFO] [stderr] | [INFO] [stderr] 15 | fn with_capacity(capacity: usize) -> CustomBinaryHeap { [INFO] [stderr] | ^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `push` [INFO] [stderr] --> src/data_structures/heaps/custom_binary_heap.rs:21:5 [INFO] [stderr] | [INFO] [stderr] 21 | fn push(&mut self, item: T) { [INFO] [stderr] | ^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `is_empty` [INFO] [stderr] --> src/data_structures/heaps/custom_binary_heap.rs:27:5 [INFO] [stderr] | [INFO] [stderr] 27 | fn is_empty(&self) -> bool { [INFO] [stderr] | ^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `len` [INFO] [stderr] --> src/data_structures/heaps/custom_binary_heap.rs:31:5 [INFO] [stderr] | [INFO] [stderr] 31 | fn len(&self) -> usize { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `pop` [INFO] [stderr] --> src/data_structures/heaps/custom_binary_heap.rs:35:5 [INFO] [stderr] | [INFO] [stderr] 35 | fn pop(&mut self) -> Option { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `change_priority` [INFO] [stderr] --> src/data_structures/heaps/custom_binary_heap.rs:45:5 [INFO] [stderr] | [INFO] [stderr] 45 | fn change_priority(&mut self, item: T) {} [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `sift_up` [INFO] [stderr] --> src/data_structures/heaps/custom_binary_heap.rs:47:5 [INFO] [stderr] | [INFO] [stderr] 47 | fn sift_up(&mut self, start: usize, pos: usize) -> usize { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `sift_down_range` [INFO] [stderr] --> src/data_structures/heaps/custom_binary_heap.rs:64:5 [INFO] [stderr] | [INFO] [stderr] 64 | fn sift_down_range(&mut self, pos: usize, end: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `sift_down` [INFO] [stderr] --> src/data_structures/heaps/custom_binary_heap.rs:84:5 [INFO] [stderr] | [INFO] [stderr] 84 | fn sift_down(&mut self, pos: usize) { [INFO] [stderr] | ^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `sift_down_to_bottom` [INFO] [stderr] --> src/data_structures/heaps/custom_binary_heap.rs:94:5 [INFO] [stderr] | [INFO] [stderr] 94 | fn sift_down_to_bottom(&mut self, mut pos: usize) { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `rebuild` [INFO] [stderr] --> src/data_structures/heaps/custom_binary_heap.rs:114:5 [INFO] [stderr] | [INFO] [stderr] 114 | fn rebuild(&mut self) { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `new` [INFO] [stderr] --> src/data_structures/heaps/custom_binary_heap.rs:138:12 [INFO] [stderr] | [INFO] [stderr] 138 | unsafe fn new(data: &'a mut [T], pos: usize) -> Self { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `pos` [INFO] [stderr] --> src/data_structures/heaps/custom_binary_heap.rs:150:5 [INFO] [stderr] | [INFO] [stderr] 150 | fn pos(&self) -> usize { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `element` [INFO] [stderr] --> src/data_structures/heaps/custom_binary_heap.rs:156:5 [INFO] [stderr] | [INFO] [stderr] 156 | fn element(&self) -> &T { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `get` [INFO] [stderr] --> src/data_structures/heaps/custom_binary_heap.rs:164:12 [INFO] [stderr] | [INFO] [stderr] 164 | unsafe fn get(&self, index: usize) -> &T { [INFO] [stderr] | ^^^ [INFO] [stderr] [INFO] [stderr] warning: associated function is never used: `move_to` [INFO] [stderr] --> src/data_structures/heaps/custom_binary_heap.rs:174:12 [INFO] [stderr] | [INFO] [stderr] 174 | unsafe fn move_to(&mut self, index: usize) { [INFO] [stderr] | ^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: crate `Route16` should have a snake case name [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(non_snake_case)]` on by default [INFO] [stderr] = help: convert the identifier to snake case: `route16` [INFO] [stderr] [INFO] [stderr] warning: trait method `MAX` should have a snake case name [INFO] [stderr] --> src/data_structures/graphs/weight.rs:8:8 [INFO] [stderr] | [INFO] [stderr] 8 | fn MAX() -> Self; [INFO] [stderr] | ^^^ help: convert the identifier to snake case: `max` [INFO] [stderr] [INFO] [stderr] warning: trait method `MIN` should have a snake case name [INFO] [stderr] --> src/data_structures/graphs/weight.rs:9:8 [INFO] [stderr] | [INFO] [stderr] 9 | fn MIN() -> Self; [INFO] [stderr] | ^^^ help: convert the identifier to snake case: `min` [INFO] [stderr] [INFO] [stderr] warning: trait method `ZERO` should have a snake case name [INFO] [stderr] --> src/data_structures/graphs/weight.rs:10:8 [INFO] [stderr] | [INFO] [stderr] 10 | fn ZERO() -> Self; [INFO] [stderr] | ^^^^ help: convert the identifier to snake case: `zero` [INFO] [stderr] [INFO] [stderr] warning: `Route16` (lib) generated 42 warnings [INFO] [stderr] warning: `Route16` (lib test) generated 42 warnings (42 duplicates) [INFO] [stderr] Finished test [unoptimized + debuginfo] target(s) in 0.06s [INFO] [stderr] Running unittests (/opt/rustwide/target/debug/deps/Route16-149b0bd0f0bcd166) [INFO] [stdout] [INFO] [stderr] Doc-tests Route16 [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] [stdout] [INFO] [stdout] running 1 test [INFO] [stdout] test src/data_structures/heaps/index_heap.rs - data_structures::heaps::index_heap (line 9) ... FAILED [INFO] [stdout] [INFO] [stdout] failures: [INFO] [stdout] [INFO] [stdout] ---- src/data_structures/heaps/index_heap.rs - data_structures::heaps::index_heap (line 9) stdout ---- [INFO] [stdout] error[E0433]: failed to resolve: use of undeclared crate or module `stud_rust_base` [INFO] [stdout] --> src/data_structures/heaps/index_heap.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 2 | use stud_rust_base::index_heap::{Indexing, IndexdMinHeap}; [INFO] [stdout] | ^^^^^^^^^^^^^^ use of undeclared crate or module `stud_rust_base` [INFO] [stdout] [INFO] [stdout] error[E0405]: cannot find trait `Indexing` in this scope [INFO] [stdout] --> src/data_structures/heaps/index_heap.rs:20:6 [INFO] [stdout] | [INFO] [stdout] 12 | impl Indexing for State { [INFO] [stdout] | ^^^^^^^^ not found in this scope [INFO] [stdout] | [INFO] [stdout] help: consider importing this trait [INFO] [stdout] | [INFO] [stdout] 2 | use Route16::data_structures::heaps::index_heap::Indexing; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] error[E0433]: failed to resolve: use of undeclared type `IndexdMinHeap` [INFO] [stdout] --> src/data_structures/heaps/index_heap.rs:27:20 [INFO] [stdout] | [INFO] [stdout] 19 | let mut heap = IndexdMinHeap::new(3); [INFO] [stdout] | ^^^^^^^^^^^^^ not found in this scope [INFO] [stdout] | [INFO] [stdout] help: consider importing this struct [INFO] [stdout] | [INFO] [stdout] 2 | use Route16::data_structures::heaps::index_heap::IndexdMinHeap; [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] error: aborting due to 3 previous errors [INFO] [stdout] [INFO] [stdout] Some errors have detailed explanations: E0405, E0433. [INFO] [stdout] For more information about an error, try `rustc --explain E0405`. [INFO] [stdout] Couldn't compile the test. [INFO] [stdout] [INFO] [stdout] failures: [INFO] [stdout] src/data_structures/heaps/index_heap.rs - data_structures::heaps::index_heap (line 9) [INFO] [stdout] [INFO] [stdout] test result: FAILED. 0 passed; 1 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.21s [INFO] [stdout] [INFO] [stderr] error: test failed, to rerun pass '--doc' [INFO] running `Command { std: "docker" "inspect" "31e8fb1ced2989b93a2380266e79bb7dbe121701e903912a9ffb4c0dbbe6ec8f", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "31e8fb1ced2989b93a2380266e79bb7dbe121701e903912a9ffb4c0dbbe6ec8f", kill_on_drop: false }` [INFO] [stdout] 31e8fb1ced2989b93a2380266e79bb7dbe121701e903912a9ffb4c0dbbe6ec8f