[INFO] fetching crate icentral-graph 0.1.0... [INFO] testing icentral-graph-0.1.0 against master#caccb4d0368bd918ef6668af8e13834d07040417 for pr-146098-1 [INFO] extracting crate icentral-graph 0.1.0 into /workspace/builds/worker-7-tc1/source [INFO] started tweaking crates.io crate icentral-graph 0.1.0 [INFO] finished tweaking crates.io crate icentral-graph 0.1.0 [INFO] tweaked toml for crates.io crate icentral-graph 0.1.0 written to /workspace/builds/worker-7-tc1/source/Cargo.toml [INFO] validating manifest of crates.io crate icentral-graph 0.1.0 on toolchain caccb4d0368bd918ef6668af8e13834d07040417 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+caccb4d0368bd918ef6668af8e13834d07040417" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] crate crates.io crate icentral-graph 0.1.0 already has a lockfile, it will not be regenerated [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+caccb4d0368bd918ef6668af8e13834d07040417" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] [stderr] Updating crates.io index [INFO] [stderr] Downloading crates ... [INFO] [stderr] Downloaded language-enum v0.1.0 [INFO] [stderr] Downloaded tracing-setup v0.3.6 [INFO] [stderr] Downloaded export-magic v0.3.6 [INFO] [stderr] Downloaded named-item v0.1.0 [INFO] [stderr] Downloaded icentral-nodeid v0.1.0 [INFO] [stderr] Downloaded icentral-visit-markers v0.1.0 [INFO] [stderr] Downloaded icentral-3p v0.1.0 [INFO] [stderr] Downloaded renew-traits v0.1.0 [INFO] [stderr] Downloaded ra_ap_text_edit v0.0.173 [INFO] [stderr] Downloaded queue v0.3.1 [INFO] [stderr] Downloaded always-assert v0.1.3 [INFO] [stderr] Downloaded text-size v1.1.1 [INFO] [stderr] Downloaded icentral-mucid-map v0.1.0 [INFO] [stderr] Downloaded icentral-errors v0.1.0 [INFO] [stderr] Downloaded unicode-properties v0.1.2 [INFO] [stderr] Downloaded icentral-bridge-edges v0.1.0 [INFO] [stderr] Downloaded clap v2.34.0 [INFO] [stderr] Downloaded icentral-parents-map v0.1.0 [INFO] [stderr] Downloaded pbx v0.1.0 [INFO] [stderr] Downloaded float-ord v0.3.2 [INFO] [stderr] Downloaded ordered-float v3.9.2 [INFO] [stderr] Downloaded icentral-delta v0.1.0 [INFO] [stderr] Downloaded icentral-sigmas v0.1.0 [INFO] [stderr] Downloaded text_io v0.1.12 [INFO] [stderr] Downloaded icentral-node-queue v0.1.0 [INFO] [stderr] Downloaded icentral-rbfs v0.1.0 [INFO] [stderr] Downloaded icentral-deltas v0.1.0 [INFO] [stderr] Downloaded icentral-neighbors v0.1.0 [INFO] [stderr] Downloaded icentral-bc-mem v0.1.0 [INFO] [stderr] Downloaded icentral-mock v0.1.0 [INFO] [stderr] Downloaded icentral-articulation-point v0.1.0 [INFO] [stderr] Downloaded ra_ap_syntax v0.0.173 [INFO] [stderr] Downloaded icentral-bbfs v0.1.0 [INFO] [stderr] Downloaded icentral-pair-dependencies v0.1.0 [INFO] [stderr] Downloaded icentral-predecessor-map v0.1.0 [INFO] [stderr] Downloaded icentral-subgraph v0.1.0 [INFO] [stderr] Downloaded nalgebra v0.31.4 [INFO] [stderr] Downloaded icentral-edges v0.1.0 [INFO] [stderr] Downloaded icentral-subgraph-map v0.1.0 [INFO] [stderr] Downloaded windows-sys v0.42.0 [INFO] [stderr] Downloaded derive-error v0.0.5 [INFO] [stderr] Downloaded miow v0.5.0 [INFO] [stderr] Downloaded error-tree v0.3.6 [INFO] [stderr] Downloaded indoc v2.0.5 [INFO] [stderr] Downloaded icentral-label-map v0.1.0 [INFO] [stderr] Downloaded icentral-color-map v0.1.0 [INFO] [stderr] Downloaded icentral-mucid v0.1.0 [INFO] [stderr] Downloaded icentral-stats v0.1.0 [INFO] [stderr] Downloaded icentral-scratch v0.1.0 [INFO] [stderr] Downloaded crossbeam v0.8.4 [INFO] [stderr] Downloaded nalgebra-macros v0.1.0 [INFO] [stderr] Downloaded simba v0.7.3 [INFO] [stderr] Downloaded ra-ap-rustc_lexer v0.10.0 [INFO] [stderr] Downloaded scan-crate-for-typedefs v0.6.0 [INFO] [stderr] Downloaded traced-test v0.3.6 [INFO] [stderr] Downloaded icentral-muc v0.1.0 [INFO] [stderr] Downloaded icentral-articulation-point-map v0.1.0 [INFO] [stderr] Downloaded icentral-conn-vertex-map v0.1.0 [INFO] [stderr] Downloaded icentral-path-counts v0.1.0 [INFO] [stderr] Downloaded dachshund v0.1.10 [INFO] [stderr] Downloaded icentral-brandes v0.1.0 [INFO] [stderr] Downloaded icentral-bcc v0.1.0 [INFO] [stderr] Downloaded icentral-scores v0.1.0 [INFO] [stderr] Downloaded textwrap v0.11.0 [INFO] [stderr] Downloaded delegate v0.10.0 [INFO] [stderr] Downloaded icentral-mindexed-map v0.1.0 [INFO] [stderr] Downloaded crossbeam-queue v0.3.11 [INFO] [stderr] Downloaded priority-queue v1.4.0 [INFO] [stderr] Downloaded cov-mark v2.0.0 [INFO] [stderr] Downloaded perf-event v0.4.7 [INFO] [stderr] Downloaded ra_ap_profile v0.0.173 [INFO] [stderr] Downloaded icentral-node-stack v0.1.0 [INFO] [stderr] Downloaded icentral-distances v0.1.0 [INFO] [stderr] Downloaded icentral-edge v0.1.0 [INFO] [stderr] Downloaded ansi_term v0.12.1 [INFO] [stderr] Downloaded vec_map v0.8.2 [INFO] [stderr] Downloaded roaring v0.10.6 [INFO] [stderr] Downloaded jod-thread v0.1.2 [INFO] [stderr] Downloaded synom v0.11.3 [INFO] [stderr] Downloaded la-arena v0.3.1 [INFO] [stderr] Downloaded unicode-xid v0.2.5 [INFO] [stderr] Downloaded ra_ap_parser v0.0.173 [INFO] [stderr] Downloaded ra_ap_stdx v0.0.173 [INFO] [stderr] Downloaded countme v3.0.1 [INFO] [stderr] Downloaded case v0.1.0 [INFO] [stderr] Downloaded unicode-xid v0.0.4 [INFO] [stderr] Downloaded nanorand v0.7.0 [INFO] [stderr] Downloaded rowan v0.15.16 [INFO] [stderr] Downloaded owned-alloc v0.2.0 [INFO] [stderr] Downloaded drop_bomb v0.1.5 [INFO] [stderr] Downloaded serde_json v1.0.128 [INFO] [stderr] Downloaded icentral-component v0.1.0 [INFO] [stderr] Downloaded icentral-workspace v0.1.0 [INFO] [stderr] Downloaded syn v0.11.11 [INFO] [stderr] Downloaded lockfree v0.5.1 [INFO] [stderr] Downloaded perf-event-open-sys v1.0.1 [INFO] [stderr] Downloaded ra_ap_limit v0.0.173 [INFO] [stderr] Downloaded toml v0.5.11 [INFO] [stderr] Downloaded icentral-graph-interface v0.1.0 [INFO] [stderr] Downloaded icentral-timer v0.1.0 [INFO] [stderr] Downloaded quote v0.3.15 [INFO] [stderr] Downloaded icentral-cycle v0.1.0 [INFO] [stderr] Downloaded strsim v0.8.0 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+caccb4d0368bd918ef6668af8e13834d07040417" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 446221a2d65a0fa586fef5e5599b85098aba244ac14ec12ed55e38183cf2f87e [INFO] running `Command { std: "docker" "start" "-a" "446221a2d65a0fa586fef5e5599b85098aba244ac14ec12ed55e38183cf2f87e", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "446221a2d65a0fa586fef5e5599b85098aba244ac14ec12ed55e38183cf2f87e", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "446221a2d65a0fa586fef5e5599b85098aba244ac14ec12ed55e38183cf2f87e", kill_on_drop: false }` [INFO] [stdout] 446221a2d65a0fa586fef5e5599b85098aba244ac14ec12ed55e38183cf2f87e [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+caccb4d0368bd918ef6668af8e13834d07040417" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 6f340e004d658b48c891a3db2da6515c7153b47ccf19022398784edadf6dbfd7 [INFO] running `Command { std: "docker" "start" "-a" "6f340e004d658b48c891a3db2da6515c7153b47ccf19022398784edadf6dbfd7", kill_on_drop: false }` [INFO] [stderr] Compiling crossbeam-utils v0.8.20 [INFO] [stderr] Compiling libc v0.2.158 [INFO] [stderr] Compiling memchr v2.7.4 [INFO] [stderr] Compiling serde v1.0.210 [INFO] [stderr] Compiling serde_json v1.0.128 [INFO] [stderr] Compiling num-traits v0.2.19 [INFO] [stderr] Compiling syn v2.0.77 [INFO] [stderr] Compiling parking_lot_core v0.9.10 [INFO] [stderr] Compiling lock_api v0.4.12 [INFO] [stderr] Compiling scopeguard v1.2.0 [INFO] [stderr] Compiling syn v1.0.109 [INFO] [stderr] Compiling hashbrown v0.14.5 [INFO] [stderr] Compiling regex-syntax v0.8.4 [INFO] [stderr] Compiling rayon-core v1.12.1 [INFO] [stderr] Compiling crossbeam-epoch v0.9.18 [INFO] [stderr] Compiling crossbeam-deque v0.8.5 [INFO] [stderr] Compiling dashmap v5.5.3 [INFO] [stderr] Compiling tracing-log v0.2.0 [INFO] [stderr] Compiling byteorder v1.5.0 [INFO] [stderr] Compiling rustc-hash v1.1.0 [INFO] [stderr] Compiling countme v3.0.1 [INFO] [stderr] Compiling getrandom v0.2.15 [INFO] [stderr] Compiling perf-event-open-sys v1.0.1 [INFO] [stderr] Compiling export-magic v0.3.6 [INFO] [stderr] Compiling bytemuck v1.18.0 [INFO] [stderr] Compiling text-size v1.1.1 [INFO] [stderr] Compiling unicode-xid v0.2.5 [INFO] [stderr] Compiling unicode-properties v0.1.2 [INFO] [stderr] Compiling rustix v0.38.36 [INFO] [stderr] Compiling ra-ap-rustc_lexer v0.10.0 [INFO] [stderr] Compiling regex-automata v0.4.7 [INFO] [stderr] Compiling perf-event v0.4.7 [INFO] [stderr] Compiling rand_core v0.6.4 [INFO] [stderr] Compiling itertools v0.10.5 [INFO] [stderr] Compiling crossbeam-channel v0.5.13 [INFO] [stderr] Compiling aho-corasick v1.1.3 [INFO] [stderr] Compiling always-assert v0.1.3 [INFO] [stderr] Compiling bitflags v2.6.0 [INFO] [stderr] Compiling linux-raw-sys v0.4.14 [INFO] [stderr] Compiling jod-thread v0.1.2 [INFO] [stderr] Compiling drop_bomb v0.1.5 [INFO] [stderr] Compiling regex v1.10.6 [INFO] [stderr] Compiling ra_ap_limit v0.0.173 [INFO] [stderr] Compiling la-arena v0.3.1 [INFO] [stderr] Compiling equivalent v1.0.1 [INFO] [stderr] Compiling indexmap v2.5.0 [INFO] [stderr] Compiling ra_ap_profile v0.0.173 [INFO] [stderr] Compiling ra_ap_text_edit v0.0.173 [INFO] [stderr] Compiling ra_ap_parser v0.0.173 [INFO] [stderr] Compiling ra_ap_stdx v0.0.173 [INFO] [stderr] Compiling safe_arch v0.7.2 [INFO] [stderr] Compiling rowan v0.15.16 [INFO] [stderr] Compiling matrixmultiply v0.3.9 [INFO] [stderr] Compiling fastrand v2.1.1 [INFO] [stderr] Compiling unicode-xid v0.0.4 [INFO] [stderr] Compiling triomphe v0.1.13 [INFO] [stderr] Compiling same-file v1.0.6 [INFO] [stderr] Compiling cov-mark v2.0.0 [INFO] [stderr] Compiling smol_str v0.2.2 [INFO] [stderr] Compiling serde_derive v1.0.210 [INFO] [stderr] Compiling zerocopy-derive v0.7.35 [INFO] [stderr] Compiling tracing-attributes v0.1.27 [INFO] [stderr] Compiling ra_ap_syntax v0.0.173 [INFO] [stderr] Compiling walkdir v2.5.0 [INFO] [stderr] Compiling tempfile v3.12.0 [INFO] [stderr] Compiling zerocopy v0.7.35 [INFO] [stderr] Compiling ppv-lite86 v0.2.20 [INFO] [stderr] Compiling tracing v0.1.40 [INFO] [stderr] Compiling tracing-subscriber v0.3.18 [INFO] [stderr] Compiling toml v0.5.11 [INFO] [stderr] Compiling rand_chacha v0.3.1 [INFO] [stderr] Compiling synom v0.11.3 [INFO] [stderr] Compiling rand v0.8.5 [INFO] [stderr] Compiling wide v0.7.28 [INFO] [stderr] Compiling delegate v0.10.0 [INFO] [stderr] Compiling rayon v1.10.0 [INFO] [stderr] Compiling num-complex v0.4.6 [INFO] [stderr] Compiling approx v0.5.1 [INFO] [stderr] Compiling num-integer v0.1.46 [INFO] [stderr] Compiling priority-queue v1.4.0 [INFO] [stderr] Compiling either v1.13.0 [INFO] [stderr] Compiling rawpointer v0.2.1 [INFO] [stderr] Compiling indoc v2.0.5 [INFO] [stderr] Compiling quote v0.3.15 [INFO] [stderr] Compiling textwrap v0.11.0 [INFO] [stderr] Compiling syn v0.11.11 [INFO] [stderr] Compiling simba v0.7.3 [INFO] [stderr] Compiling num-rational v0.4.2 [INFO] [stderr] Compiling thiserror-impl v1.0.63 [INFO] [stderr] Compiling nalgebra-macros v0.1.0 [INFO] [stderr] Compiling atty v0.2.14 [INFO] [stderr] Compiling crossbeam-queue v0.3.11 [INFO] [stderr] Compiling vec_map v0.8.2 [INFO] [stderr] Compiling ansi_term v0.12.1 [INFO] [stderr] Compiling strsim v0.8.0 [INFO] [stderr] Compiling case v0.1.0 [INFO] [stderr] Compiling time-macros v0.2.18 [INFO] [stderr] Compiling scan-crate-for-typedefs v0.6.0 [INFO] [stderr] Compiling thiserror v1.0.63 [INFO] [stderr] Compiling crossbeam v0.8.4 [INFO] [stderr] Compiling derive-error v0.0.5 [INFO] [stderr] Compiling clap v2.34.0 [INFO] [stderr] Compiling tracing-serde v0.1.3 [INFO] [stderr] Compiling icentral-3p v0.1.0 [INFO] [stderr] Compiling deranged v0.3.11 [INFO] [stderr] Compiling traced-test v0.3.6 [INFO] [stderr] Compiling roaring v0.10.6 [INFO] [stderr] Compiling ordered-float v3.9.2 [INFO] [stderr] Compiling owned-alloc v0.2.0 [INFO] [stderr] Compiling time v0.3.36 [INFO] [stderr] Compiling lockfree v0.5.1 [INFO] [stderr] Compiling error-tree v0.3.6 [INFO] [stderr] Compiling float-ord v0.3.2 [INFO] [stderr] Compiling nanorand v0.7.0 [INFO] [stderr] Compiling queue v0.3.1 [INFO] [stderr] Compiling text_io v0.1.12 [INFO] [stderr] Compiling pbx v0.1.0 [INFO] [stderr] Compiling renew-traits v0.1.0 [INFO] [stderr] Compiling language-enum v0.1.0 [INFO] [stderr] Compiling named-item v0.1.0 [INFO] [stderr] Compiling tracing-setup v0.3.6 [INFO] [stderr] Compiling nalgebra v0.31.4 [INFO] [stderr] Compiling dachshund v0.1.10 [INFO] [stderr] Compiling icentral-nodeid v0.1.0 [INFO] [stderr] Compiling icentral-stats v0.1.0 [INFO] [stderr] Compiling icentral-timer v0.1.0 [INFO] [stderr] Compiling icentral-mindexed-map v0.1.0 [INFO] [stderr] Compiling icentral-mucid v0.1.0 [INFO] [stderr] Compiling icentral-node-queue v0.1.0 [INFO] [stderr] Compiling icentral-node-stack v0.1.0 [INFO] [stderr] Compiling icentral-color-map v0.1.0 [INFO] [stderr] Compiling icentral-distances v0.1.0 [INFO] [stderr] Compiling icentral-predecessor-map v0.1.0 [INFO] [stderr] Compiling icentral-visit-markers v0.1.0 [INFO] [stderr] Compiling icentral-sigmas v0.1.0 [INFO] [stderr] Compiling icentral-subgraph-map v0.1.0 [INFO] [stderr] Compiling icentral-path-counts v0.1.0 [INFO] [stderr] Compiling icentral-conn-vertex-map v0.1.0 [INFO] [stderr] Compiling icentral-edge v0.1.0 [INFO] [stderr] Compiling icentral-pair-dependencies v0.1.0 [INFO] [stderr] Compiling icentral-articulation-point-map v0.1.0 [INFO] [stderr] Compiling icentral-errors v0.1.0 [INFO] [stderr] Compiling icentral-deltas v0.1.0 [INFO] [stderr] Compiling icentral-neighbors v0.1.0 [INFO] [stderr] Compiling icentral-label-map v0.1.0 [INFO] [stderr] Compiling icentral-articulation-point v0.1.0 [INFO] [stderr] Compiling icentral-edges v0.1.0 [INFO] [stderr] Compiling icentral-bcc v0.1.0 [INFO] [stderr] Compiling icentral-cycle v0.1.0 [INFO] [stderr] Compiling icentral-graph-interface v0.1.0 [INFO] [stderr] Compiling icentral-parents-map v0.1.0 [INFO] [stderr] Compiling icentral-scores v0.1.0 [INFO] [stderr] Compiling icentral-mucid-map v0.1.0 [INFO] [stderr] Compiling icentral-bridge-edges v0.1.0 [INFO] [stderr] Compiling icentral-mock v0.1.0 [INFO] [stderr] Compiling icentral-subgraph v0.1.0 [INFO] [stderr] Compiling icentral-bc-mem v0.1.0 [INFO] [stderr] Compiling icentral-component v0.1.0 [INFO] [stderr] Compiling icentral-scratch v0.1.0 [INFO] [stderr] Compiling icentral-workspace v0.1.0 [INFO] [stderr] Compiling icentral-bbfs v0.1.0 [INFO] [stderr] Compiling icentral-rbfs v0.1.0 [INFO] [stderr] Compiling icentral-brandes v0.1.0 [INFO] [stderr] Compiling icentral-muc v0.1.0 [INFO] [stderr] Compiling icentral-delta v0.1.0 [INFO] [stderr] Compiling icentral-graph v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused doc comment [INFO] [stdout] --> src/create_random_connected.rs:24:9 [INFO] [stdout] | [INFO] [stdout] 24 | /// every node will at least show up once [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] 25 | / for node_idx in 0..n_vertices { [INFO] [stdout] 26 | | nodes.push(node_idx); [INFO] [stdout] 27 | | } [INFO] [stdout] | |_________- rustdoc does not generate documentation for expressions [INFO] [stdout] | [INFO] [stdout] = help: use `//` for a plain comment [INFO] [stdout] = note: `#[warn(unused_doc_comments)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/find_edge_bcc_with_delta.rs:97:54 [INFO] [stdout] | [INFO] [stdout] 97 | let mut subgraph_sz_vec: Vec = vec![];; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(redundant_semicolons)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/graph.rs:222:66 [INFO] [stdout] | [INFO] [stdout] 222 | builder.field("scores", &self.scores.len());; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/init_internals.rs:15:34 [INFO] [stdout] | [INFO] [stdout] 15 | self.bc_computed = false;; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused doc comment [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:1:1 [INFO] [stdout] | [INFO] [stdout] 1 | / /// His disciples asked him: "What should we do for our work to be perfect?" [INFO] [stdout] 2 | | /// [INFO] [stdout] 3 | | /// The master said to them: "be ready in every circumstance. Blessed are they [INFO] [stdout] 4 | | /// who have found the strife, and who have seen the struggle with their eyes. [INFO] [stdout] ... | [INFO] [stdout] 27 | | /// - the dialogue of the savior. [INFO] [stdout] 28 | | /// [INFO] [stdout] | |_--^ [INFO] [stdout] | | [INFO] [stdout] | rustdoc does not generate documentation for macro invocations [INFO] [stdout] | [INFO] [stdout] = help: to document an item produced by a macro, the macro must produce the documentation as part of its expansion [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:91:32 [INFO] [stdout] | [INFO] [stdout] 91 | self.find_conn_verts();; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `item` [INFO] [stdout] --> src/build_graph_hash_mapping_for_conn_vertex.rs:11:9 [INFO] [stdout] | [INFO] [stdout] 11 | item: (NodeId, &Vec), [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_item` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `muc_id` [INFO] [stdout] --> src/build_graph_hash_mapping_for_conn_vertex.rs:12:9 [INFO] [stdout] | [INFO] [stdout] 12 | muc_id: MinimumUnionCycleId) [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_muc_id` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/connected_component_size.rs:16:13 [INFO] [stdout] | [INFO] [stdout] 16 | let mut stack: Stack = default!(); [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `e` [INFO] [stdout] --> src/find_edge_bcc_with_component.rs:28:9 [INFO] [stdout] | [INFO] [stdout] 28 | e: &Edge) [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_e` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `edge` [INFO] [stdout] --> src/find_edge_bcc_with_delta.rs:94:9 [INFO] [stdout] | [INFO] [stdout] 94 | edge: &Edge) [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_edge` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `edge` [INFO] [stdout] --> src/find_edge_bcc_with_scratch.rs:89:9 [INFO] [stdout] | [INFO] [stdout] 89 | edge: &Edge) [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_edge` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: irrefutable `if let` pattern [INFO] [stdout] --> src/find_muc_subgraphs.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 54 | if let conn_vertex_map = muc.vertex_map()? { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this pattern will always match, so the `if let` is useless [INFO] [stdout] = help: consider replacing the `if let` with a `let` [INFO] [stdout] = note: `#[warn(irrefutable_let_patterns)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/find_mucs.rs:37:13 [INFO] [stdout] | [INFO] [stdout] 37 | let mut bridge_vec: Vec = self.find_bridge_edges::(); [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/find_mucs.rs:43:13 [INFO] [stdout] | [INFO] [stdout] 43 | let mut conn_comp_vec: Vec = gh.find_conn_comp()?; [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/insert_edge_and_update_muc.rs:73:13 [INFO] [stdout] | [INFO] [stdout] 73 | let mut shortest_path = self.get_shortest_path( [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/merge_muc_cycle.rs:29:17 [INFO] [stdout] | [INFO] [stdout] 29 | let mut src: NodeId = cycle[i].src; [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/merge_muc_cycle.rs:30:17 [INFO] [stdout] | [INFO] [stdout] 30 | let mut dst: NodeId = cycle[i].dst; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/read_graph.rs:29:13 [INFO] [stdout] | [INFO] [stdout] 29 | for i in 0..m { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/approx_brandes_iteration_runtime_on_bcc_subgraph.rs:49:9 [INFO] [stdout] | [INFO] [stdout] 49 | self.find_edge_bcc_with_scratch(&mut bcc, &Edge::new(src,dst)); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] = note: `#[warn(unused_must_use)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 49 | let _ = self.find_edge_bcc_with_scratch(&mut bcc, &Edge::new(src,dst)); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/approx_brandes_iteration_runtime_on_bcc_subgraph.rs:60:9 [INFO] [stdout] | [INFO] [stdout] 60 | bcc.compute_bc(&mut scores, Some(num_iter)); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 60 | let _ = bcc.compute_bc(&mut scores, Some(num_iter)); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/build_graph_hash_mapping_for_conn_vertex.rs:49:25 [INFO] [stdout] | [INFO] [stdout] 49 | gh.insert_edge(&Edge::new(node, bfs_nbr)); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 49 | let _ = gh.insert_edge(&Edge::new(node, bfs_nbr)); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/connect_node_ids.rs:10:9 [INFO] [stdout] | [INFO] [stdout] 10 | self.insert_edge(&Edge::new(src,dst)); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 10 | let _ = self.insert_edge(&Edge::new(src,dst)); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/create_and_push_new_muc.rs:34:9 [INFO] [stdout] | [INFO] [stdout] 34 | / merge_mucs( [INFO] [stdout] 35 | | &mut self.nodes_to_mucs, [INFO] [stdout] 36 | | &mut new_muc, [INFO] [stdout] 37 | | &mut self.mucs[dst_muc_id.val()] [INFO] [stdout] 38 | | ); [INFO] [stdout] | |_________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 34 | let _ = merge_mucs( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/create_and_push_new_muc.rs:40:9 [INFO] [stdout] | [INFO] [stdout] 40 | / merge_mucs( [INFO] [stdout] 41 | | &mut self.nodes_to_mucs, [INFO] [stdout] 42 | | &mut new_muc, [INFO] [stdout] 43 | | &mut self.mucs[src_muc_id.val()] [INFO] [stdout] 44 | | ); [INFO] [stdout] | |_________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 40 | let _ = merge_mucs( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/create_and_push_new_muc.rs:52:17 [INFO] [stdout] | [INFO] [stdout] 52 | / merge_mucs( [INFO] [stdout] 53 | | &mut self.nodes_to_mucs, [INFO] [stdout] 54 | | &mut new_muc, [INFO] [stdout] 55 | | &mut self.mucs[node_muc_id.val()] [INFO] [stdout] 56 | | ); [INFO] [stdout] | |_________________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 52 | let _ = merge_mucs( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/create_and_push_new_muc.rs:60:9 [INFO] [stdout] | [INFO] [stdout] 60 | new_muc.insert_edge(&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 60 | let _ = new_muc.insert_edge(&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/create_random_connected.rs:46:13 [INFO] [stdout] | [INFO] [stdout] 46 | graph.insert_edge(&rand_edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 46 | let _ = graph.insert_edge(&rand_edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_all_muc_subgraphs.rs:35:13 [INFO] [stdout] | [INFO] [stdout] 35 | self.find_muc_subgraphs(mucid![m]); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 35 | let _ = self.find_muc_subgraphs(mucid![m]); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_edge_bcc_with_component.rs:88:9 [INFO] [stdout] | [INFO] [stdout] 88 | self.insert_edge(e); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 88 | let _ = self.insert_edge(e); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_edge_bcc_with_component.rs:94:9 [INFO] [stdout] | [INFO] [stdout] 94 | self.find_edge_bcc_subgraph(&mut gh, e); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 94 | let _ = self.find_edge_bcc_subgraph(&mut gh, e); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_edge_bcc_with_component.rs:126:9 [INFO] [stdout] | [INFO] [stdout] 126 | gh.remove_edge(e); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 126 | let _ = gh.remove_edge(e); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_edge_bcc_with_component.rs:132:9 [INFO] [stdout] | [INFO] [stdout] 132 | self.remove_edge(e); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 132 | let _ = self.remove_edge(e); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_edge_bcc_with_delta.rs:40:9 [INFO] [stdout] | [INFO] [stdout] 40 | self.find_edge_bcc_subgraph(bcc.bcc_subgraph_mut(), &edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 40 | let _ = self.find_edge_bcc_subgraph(bcc.bcc_subgraph_mut(), &edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_edge_bcc_with_scratch.rs:35:9 [INFO] [stdout] | [INFO] [stdout] 35 | self.find_edge_bcc_subgraph(bcc.bcc_subgraph_mut(), &edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 35 | let _ = self.find_edge_bcc_subgraph(bcc.bcc_subgraph_mut(), &edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_muc_mcb.rs:52:17 [INFO] [stdout] | [INFO] [stdout] 52 | / self.find_muc_mcb_for_cycle( [INFO] [stdout] 53 | | idx, [INFO] [stdout] 54 | | &cycle_graph, [INFO] [stdout] 55 | | &mut visit_markers [INFO] [stdout] 56 | | ); [INFO] [stdout] | |_________________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 52 | let _ = self.find_muc_mcb_for_cycle( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_muc_mcb.rs:62:9 [INFO] [stdout] | [INFO] [stdout] 62 | self.find_conn_verts(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 62 | let _ = self.find_conn_verts(); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_mucs.rs:49:9 [INFO] [stdout] | [INFO] [stdout] 49 | self.find_conn_verts(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 49 | let _ = self.find_conn_verts(); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_mucs.rs:61:9 [INFO] [stdout] | [INFO] [stdout] 61 | self.find_mucs_fast(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 61 | let _ = self.find_mucs_fast(); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/from_filename.rs:9:9 [INFO] [stdout] | [INFO] [stdout] 9 | g.read_graph(filename); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 9 | let _ = g.read_graph(filename); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/graph.rs:84:5 [INFO] [stdout] | [INFO] [stdout] 84 | delegate_to_neighbors_map!{} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 84 | let _ = delegate_to_neighbors_map!{} [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: eliding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/graph.rs:188:34 [INFO] [stdout] | [INFO] [stdout] 188 | fn get_mucs<'a>(&'a self) -> &Vec> { [INFO] [stdout] | -- ^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is elided here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is named here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 188 | fn get_mucs<'a>(&'a self) -> &'a Vec> { [INFO] [stdout] | ++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/init_with_size.rs:13:9 [INFO] [stdout] | [INFO] [stdout] 13 | self.init_internals(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 13 | let _ = self.init_internals(); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_bc.rs:45:9 [INFO] [stdout] | [INFO] [stdout] 45 | self.insert_edge(&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 45 | let _ = self.insert_edge(&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_bc.rs:53:9 [INFO] [stdout] | [INFO] [stdout] 53 | self.find_edge_bcc_with_delta(&mut bcc,&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 53 | let _ = self.find_edge_bcc_with_delta(&mut bcc,&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_bc.rs:66:13 [INFO] [stdout] | [INFO] [stdout] 66 | / bcc.compute_bc_maxiter_exp( [INFO] [stdout] 67 | | &mut self.scores, [INFO] [stdout] 68 | | edge.src, [INFO] [stdout] 69 | | edge.dst, [INFO] [stdout] ... | [INFO] [stdout] 72 | | max_iter_d2 [INFO] [stdout] 73 | | ); [INFO] [stdout] | |_____________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 66 | let _ = bcc.compute_bc_maxiter_exp( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_bc.rs:77:13 [INFO] [stdout] | [INFO] [stdout] 77 | / bcc.compute_bc_exp( [INFO] [stdout] 78 | | &mut self.scores, [INFO] [stdout] 79 | | edge.src, [INFO] [stdout] 80 | | edge.dst, [INFO] [stdout] ... | [INFO] [stdout] 83 | | max_iter_d2 [INFO] [stdout] 84 | | ); [INFO] [stdout] | |_____________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 77 | let _ = bcc.compute_bc_exp( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_bc.rs:91:9 [INFO] [stdout] | [INFO] [stdout] 91 | bcc.bcc_subgraph_remove_edge(&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 91 | let _ = bcc.bcc_subgraph_remove_edge(&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:56:9 [INFO] [stdout] | [INFO] [stdout] 56 | self.mucs[src_muc_id.val()].insert_edge(&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 56 | let _ = self.mucs[src_muc_id.val()].insert_edge(&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:58:9 [INFO] [stdout] | [INFO] [stdout] 58 | self.insert_edge(&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 58 | let _ = self.insert_edge(&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:85:9 [INFO] [stdout] | [INFO] [stdout] 85 | self.insert_edge(&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 85 | let _ = self.insert_edge(&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:91:9 [INFO] [stdout] | [INFO] [stdout] 91 | self.find_conn_verts();; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 91 | let _ = self.find_conn_verts();; [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:93:9 [INFO] [stdout] | [INFO] [stdout] 93 | self.find_muc_subgraphs(id); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 93 | let _ = self.find_muc_subgraphs(id); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:114:13 [INFO] [stdout] | [INFO] [stdout] 114 | / self.insert_edge_and_update_muc_when_we_are_not_in_the_same_muc( [INFO] [stdout] 115 | | edge, [INFO] [stdout] 116 | | src_muc_id, [INFO] [stdout] 117 | | dst_muc_id [INFO] [stdout] 118 | | ); [INFO] [stdout] | |_____________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 114 | let _ = self.insert_edge_and_update_muc_when_we_are_not_in_the_same_muc( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/merge_muc_cycle.rs:32:13 [INFO] [stdout] | [INFO] [stdout] 32 | muc.insert_edge(&Edge::new(src, dst)); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 32 | let _ = muc.insert_edge(&Edge::new(src, dst)); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/subtract_edge.rs:27:9 [INFO] [stdout] | [INFO] [stdout] 27 | self.mucs[muc1_id.val()].insert_conn_vertex(bridge_edge.src, bridge_edge.dst); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 27 | let _ = self.mucs[muc1_id.val()].insert_conn_vertex(bridge_edge.src, bridge_edge.dst); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/subtract_edge.rs:28:9 [INFO] [stdout] | [INFO] [stdout] 28 | self.mucs[muc2_id.val()].insert_conn_vertex(bridge_edge.dst, bridge_edge.src); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 28 | let _ = self.mucs[muc2_id.val()].insert_conn_vertex(bridge_edge.dst, bridge_edge.src); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 1m 09s [INFO] [stderr] warning: the following packages contain code that will be rejected by a future version of Rust: icentral-neighbors v0.1.0 [INFO] [stderr] note: to see what the problems were, use the option `--future-incompat-report`, or run `cargo report future-incompatibilities --id 1` [INFO] running `Command { std: "docker" "inspect" "6f340e004d658b48c891a3db2da6515c7153b47ccf19022398784edadf6dbfd7", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "6f340e004d658b48c891a3db2da6515c7153b47ccf19022398784edadf6dbfd7", kill_on_drop: false }` [INFO] [stdout] 6f340e004d658b48c891a3db2da6515c7153b47ccf19022398784edadf6dbfd7 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+caccb4d0368bd918ef6668af8e13834d07040417" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 338f394dd337cff0854a0d905b29ba613aa8bc020989bfd1e9590140f76d5765 [INFO] running `Command { std: "docker" "start" "-a" "338f394dd337cff0854a0d905b29ba613aa8bc020989bfd1e9590140f76d5765", kill_on_drop: false }` [INFO] [stdout] warning: unused doc comment [INFO] [stdout] --> src/create_random_connected.rs:24:9 [INFO] [stdout] | [INFO] [stdout] 24 | /// every node will at least show up once [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] 25 | / for node_idx in 0..n_vertices { [INFO] [stdout] 26 | | nodes.push(node_idx); [INFO] [stdout] 27 | | } [INFO] [stdout] | |_________- rustdoc does not generate documentation for expressions [INFO] [stdout] | [INFO] [stdout] = help: use `//` for a plain comment [INFO] [stdout] = note: `#[warn(unused_doc_comments)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/find_edge_bcc_with_delta.rs:97:54 [INFO] [stdout] | [INFO] [stdout] 97 | let mut subgraph_sz_vec: Vec = vec![];; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(redundant_semicolons)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/graph.rs:222:66 [INFO] [stdout] | [INFO] [stdout] 222 | builder.field("scores", &self.scores.len());; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/init_internals.rs:15:34 [INFO] [stdout] | [INFO] [stdout] 15 | self.bc_computed = false;; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused doc comment [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:1:1 [INFO] [stdout] | [INFO] [stdout] 1 | / /// His disciples asked him: "What should we do for our work to be perfect?" [INFO] [stdout] 2 | | /// [INFO] [stdout] 3 | | /// The master said to them: "be ready in every circumstance. Blessed are they [INFO] [stdout] 4 | | /// who have found the strife, and who have seen the struggle with their eyes. [INFO] [stdout] ... | [INFO] [stdout] 27 | | /// - the dialogue of the savior. [INFO] [stdout] 28 | | /// [INFO] [stdout] | |_--^ [INFO] [stdout] | | [INFO] [stdout] | rustdoc does not generate documentation for macro invocations [INFO] [stdout] | [INFO] [stdout] = help: to document an item produced by a macro, the macro must produce the documentation as part of its expansion [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:91:32 [INFO] [stdout] | [INFO] [stdout] 91 | self.find_conn_verts();; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `item` [INFO] [stdout] --> src/build_graph_hash_mapping_for_conn_vertex.rs:11:9 [INFO] [stdout] | [INFO] [stdout] 11 | item: (NodeId, &Vec), [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_item` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `muc_id` [INFO] [stdout] --> src/build_graph_hash_mapping_for_conn_vertex.rs:12:9 [INFO] [stdout] | [INFO] [stdout] 12 | muc_id: MinimumUnionCycleId) [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_muc_id` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/connected_component_size.rs:16:13 [INFO] [stdout] | [INFO] [stdout] 16 | let mut stack: Stack = default!(); [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `e` [INFO] [stdout] --> src/find_edge_bcc_with_component.rs:28:9 [INFO] [stdout] | [INFO] [stdout] 28 | e: &Edge) [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_e` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `edge` [INFO] [stdout] --> src/find_edge_bcc_with_delta.rs:94:9 [INFO] [stdout] | [INFO] [stdout] 94 | edge: &Edge) [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_edge` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `edge` [INFO] [stdout] --> src/find_edge_bcc_with_scratch.rs:89:9 [INFO] [stdout] | [INFO] [stdout] 89 | edge: &Edge) [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_edge` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: irrefutable `if let` pattern [INFO] [stdout] --> src/find_muc_subgraphs.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 54 | if let conn_vertex_map = muc.vertex_map()? { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this pattern will always match, so the `if let` is useless [INFO] [stdout] = help: consider replacing the `if let` with a `let` [INFO] [stdout] = note: `#[warn(irrefutable_let_patterns)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/find_mucs.rs:37:13 [INFO] [stdout] | [INFO] [stdout] 37 | let mut bridge_vec: Vec = self.find_bridge_edges::(); [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/find_mucs.rs:43:13 [INFO] [stdout] | [INFO] [stdout] 43 | let mut conn_comp_vec: Vec = gh.find_conn_comp()?; [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/insert_edge_and_update_muc.rs:73:13 [INFO] [stdout] | [INFO] [stdout] 73 | let mut shortest_path = self.get_shortest_path( [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/merge_muc_cycle.rs:29:17 [INFO] [stdout] | [INFO] [stdout] 29 | let mut src: NodeId = cycle[i].src; [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/merge_muc_cycle.rs:30:17 [INFO] [stdout] | [INFO] [stdout] 30 | let mut dst: NodeId = cycle[i].dst; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/read_graph.rs:29:13 [INFO] [stdout] | [INFO] [stdout] 29 | for i in 0..m { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/approx_brandes_iteration_runtime_on_bcc_subgraph.rs:49:9 [INFO] [stdout] | [INFO] [stdout] 49 | self.find_edge_bcc_with_scratch(&mut bcc, &Edge::new(src,dst)); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] = note: `#[warn(unused_must_use)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 49 | let _ = self.find_edge_bcc_with_scratch(&mut bcc, &Edge::new(src,dst)); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/approx_brandes_iteration_runtime_on_bcc_subgraph.rs:60:9 [INFO] [stdout] | [INFO] [stdout] 60 | bcc.compute_bc(&mut scores, Some(num_iter)); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 60 | let _ = bcc.compute_bc(&mut scores, Some(num_iter)); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/build_graph_hash_mapping_for_conn_vertex.rs:49:25 [INFO] [stdout] | [INFO] [stdout] 49 | gh.insert_edge(&Edge::new(node, bfs_nbr)); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 49 | let _ = gh.insert_edge(&Edge::new(node, bfs_nbr)); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/connect_node_ids.rs:10:9 [INFO] [stdout] | [INFO] [stdout] 10 | self.insert_edge(&Edge::new(src,dst)); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 10 | let _ = self.insert_edge(&Edge::new(src,dst)); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/create_and_push_new_muc.rs:34:9 [INFO] [stdout] | [INFO] [stdout] 34 | / merge_mucs( [INFO] [stdout] 35 | | &mut self.nodes_to_mucs, [INFO] [stdout] 36 | | &mut new_muc, [INFO] [stdout] 37 | | &mut self.mucs[dst_muc_id.val()] [INFO] [stdout] 38 | | ); [INFO] [stdout] | |_________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 34 | let _ = merge_mucs( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Compiling icentral-graph v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/create_and_push_new_muc.rs:40:9 [INFO] [stdout] | [INFO] [stdout] 40 | / merge_mucs( [INFO] [stdout] 41 | | &mut self.nodes_to_mucs, [INFO] [stdout] 42 | | &mut new_muc, [INFO] [stdout] 43 | | &mut self.mucs[src_muc_id.val()] [INFO] [stdout] 44 | | ); [INFO] [stdout] | |_________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 40 | let _ = merge_mucs( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/create_and_push_new_muc.rs:52:17 [INFO] [stdout] | [INFO] [stdout] 52 | / merge_mucs( [INFO] [stdout] 53 | | &mut self.nodes_to_mucs, [INFO] [stdout] 54 | | &mut new_muc, [INFO] [stdout] 55 | | &mut self.mucs[node_muc_id.val()] [INFO] [stdout] 56 | | ); [INFO] [stdout] | |_________________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 52 | let _ = merge_mucs( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/create_and_push_new_muc.rs:60:9 [INFO] [stdout] | [INFO] [stdout] 60 | new_muc.insert_edge(&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 60 | let _ = new_muc.insert_edge(&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/create_random_connected.rs:46:13 [INFO] [stdout] | [INFO] [stdout] 46 | graph.insert_edge(&rand_edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 46 | let _ = graph.insert_edge(&rand_edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_all_muc_subgraphs.rs:35:13 [INFO] [stdout] | [INFO] [stdout] 35 | self.find_muc_subgraphs(mucid![m]); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 35 | let _ = self.find_muc_subgraphs(mucid![m]); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_edge_bcc_with_component.rs:88:9 [INFO] [stdout] | [INFO] [stdout] 88 | self.insert_edge(e); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 88 | let _ = self.insert_edge(e); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_edge_bcc_with_component.rs:94:9 [INFO] [stdout] | [INFO] [stdout] 94 | self.find_edge_bcc_subgraph(&mut gh, e); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 94 | let _ = self.find_edge_bcc_subgraph(&mut gh, e); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_edge_bcc_with_component.rs:126:9 [INFO] [stdout] | [INFO] [stdout] 126 | gh.remove_edge(e); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 126 | let _ = gh.remove_edge(e); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_edge_bcc_with_component.rs:132:9 [INFO] [stdout] | [INFO] [stdout] 132 | self.remove_edge(e); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 132 | let _ = self.remove_edge(e); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_edge_bcc_with_delta.rs:40:9 [INFO] [stdout] | [INFO] [stdout] 40 | self.find_edge_bcc_subgraph(bcc.bcc_subgraph_mut(), &edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 40 | let _ = self.find_edge_bcc_subgraph(bcc.bcc_subgraph_mut(), &edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_edge_bcc_with_scratch.rs:35:9 [INFO] [stdout] | [INFO] [stdout] 35 | self.find_edge_bcc_subgraph(bcc.bcc_subgraph_mut(), &edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 35 | let _ = self.find_edge_bcc_subgraph(bcc.bcc_subgraph_mut(), &edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_muc_mcb.rs:52:17 [INFO] [stdout] | [INFO] [stdout] 52 | / self.find_muc_mcb_for_cycle( [INFO] [stdout] 53 | | idx, [INFO] [stdout] 54 | | &cycle_graph, [INFO] [stdout] 55 | | &mut visit_markers [INFO] [stdout] 56 | | ); [INFO] [stdout] | |_________________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 52 | let _ = self.find_muc_mcb_for_cycle( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_muc_mcb.rs:62:9 [INFO] [stdout] | [INFO] [stdout] 62 | self.find_conn_verts(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 62 | let _ = self.find_conn_verts(); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_mucs.rs:49:9 [INFO] [stdout] | [INFO] [stdout] 49 | self.find_conn_verts(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 49 | let _ = self.find_conn_verts(); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_mucs.rs:61:9 [INFO] [stdout] | [INFO] [stdout] 61 | self.find_mucs_fast(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 61 | let _ = self.find_mucs_fast(); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/from_filename.rs:9:9 [INFO] [stdout] | [INFO] [stdout] 9 | g.read_graph(filename); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 9 | let _ = g.read_graph(filename); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/graph.rs:84:5 [INFO] [stdout] | [INFO] [stdout] 84 | delegate_to_neighbors_map!{} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 84 | let _ = delegate_to_neighbors_map!{} [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: eliding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/graph.rs:188:34 [INFO] [stdout] | [INFO] [stdout] 188 | fn get_mucs<'a>(&'a self) -> &Vec> { [INFO] [stdout] | -- ^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is elided here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is named here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 188 | fn get_mucs<'a>(&'a self) -> &'a Vec> { [INFO] [stdout] | ++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/init_with_size.rs:13:9 [INFO] [stdout] | [INFO] [stdout] 13 | self.init_internals(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 13 | let _ = self.init_internals(); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_bc.rs:45:9 [INFO] [stdout] | [INFO] [stdout] 45 | self.insert_edge(&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 45 | let _ = self.insert_edge(&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_bc.rs:53:9 [INFO] [stdout] | [INFO] [stdout] 53 | self.find_edge_bcc_with_delta(&mut bcc,&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 53 | let _ = self.find_edge_bcc_with_delta(&mut bcc,&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_bc.rs:66:13 [INFO] [stdout] | [INFO] [stdout] 66 | / bcc.compute_bc_maxiter_exp( [INFO] [stdout] 67 | | &mut self.scores, [INFO] [stdout] 68 | | edge.src, [INFO] [stdout] 69 | | edge.dst, [INFO] [stdout] ... | [INFO] [stdout] 72 | | max_iter_d2 [INFO] [stdout] 73 | | ); [INFO] [stdout] | |_____________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 66 | let _ = bcc.compute_bc_maxiter_exp( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_bc.rs:77:13 [INFO] [stdout] | [INFO] [stdout] 77 | / bcc.compute_bc_exp( [INFO] [stdout] 78 | | &mut self.scores, [INFO] [stdout] 79 | | edge.src, [INFO] [stdout] 80 | | edge.dst, [INFO] [stdout] ... | [INFO] [stdout] 83 | | max_iter_d2 [INFO] [stdout] 84 | | ); [INFO] [stdout] | |_____________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 77 | let _ = bcc.compute_bc_exp( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_bc.rs:91:9 [INFO] [stdout] | [INFO] [stdout] 91 | bcc.bcc_subgraph_remove_edge(&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 91 | let _ = bcc.bcc_subgraph_remove_edge(&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:56:9 [INFO] [stdout] | [INFO] [stdout] 56 | self.mucs[src_muc_id.val()].insert_edge(&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 56 | let _ = self.mucs[src_muc_id.val()].insert_edge(&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:58:9 [INFO] [stdout] | [INFO] [stdout] 58 | self.insert_edge(&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 58 | let _ = self.insert_edge(&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:85:9 [INFO] [stdout] | [INFO] [stdout] 85 | self.insert_edge(&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 85 | let _ = self.insert_edge(&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:91:9 [INFO] [stdout] | [INFO] [stdout] 91 | self.find_conn_verts();; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 91 | let _ = self.find_conn_verts();; [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:93:9 [INFO] [stdout] | [INFO] [stdout] 93 | self.find_muc_subgraphs(id); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 93 | let _ = self.find_muc_subgraphs(id); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:114:13 [INFO] [stdout] | [INFO] [stdout] 114 | / self.insert_edge_and_update_muc_when_we_are_not_in_the_same_muc( [INFO] [stdout] 115 | | edge, [INFO] [stdout] 116 | | src_muc_id, [INFO] [stdout] 117 | | dst_muc_id [INFO] [stdout] 118 | | ); [INFO] [stdout] | |_____________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 114 | let _ = self.insert_edge_and_update_muc_when_we_are_not_in_the_same_muc( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/merge_muc_cycle.rs:32:13 [INFO] [stdout] | [INFO] [stdout] 32 | muc.insert_edge(&Edge::new(src, dst)); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 32 | let _ = muc.insert_edge(&Edge::new(src, dst)); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/subtract_edge.rs:27:9 [INFO] [stdout] | [INFO] [stdout] 27 | self.mucs[muc1_id.val()].insert_conn_vertex(bridge_edge.src, bridge_edge.dst); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 27 | let _ = self.mucs[muc1_id.val()].insert_conn_vertex(bridge_edge.src, bridge_edge.dst); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/subtract_edge.rs:28:9 [INFO] [stdout] | [INFO] [stdout] 28 | self.mucs[muc2_id.val()].insert_conn_vertex(bridge_edge.dst, bridge_edge.src); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 28 | let _ = self.mucs[muc2_id.val()].insert_conn_vertex(bridge_edge.dst, bridge_edge.src); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused doc comment [INFO] [stdout] --> src/create_random_connected.rs:24:9 [INFO] [stdout] | [INFO] [stdout] 24 | /// every node will at least show up once [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] 25 | / for node_idx in 0..n_vertices { [INFO] [stdout] 26 | | nodes.push(node_idx); [INFO] [stdout] 27 | | } [INFO] [stdout] | |_________- rustdoc does not generate documentation for expressions [INFO] [stdout] | [INFO] [stdout] = help: use `//` for a plain comment [INFO] [stdout] = note: `#[warn(unused_doc_comments)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/find_edge_bcc_with_delta.rs:97:54 [INFO] [stdout] | [INFO] [stdout] 97 | let mut subgraph_sz_vec: Vec = vec![];; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(redundant_semicolons)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/graph.rs:222:66 [INFO] [stdout] | [INFO] [stdout] 222 | builder.field("scores", &self.scores.len());; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/init_internals.rs:15:34 [INFO] [stdout] | [INFO] [stdout] 15 | self.bc_computed = false;; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused doc comment [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:1:1 [INFO] [stdout] | [INFO] [stdout] 1 | / /// His disciples asked him: "What should we do for our work to be perfect?" [INFO] [stdout] 2 | | /// [INFO] [stdout] 3 | | /// The master said to them: "be ready in every circumstance. Blessed are they [INFO] [stdout] 4 | | /// who have found the strife, and who have seen the struggle with their eyes. [INFO] [stdout] ... | [INFO] [stdout] 27 | | /// - the dialogue of the savior. [INFO] [stdout] 28 | | /// [INFO] [stdout] | |_--^ [INFO] [stdout] | | [INFO] [stdout] | rustdoc does not generate documentation for macro invocations [INFO] [stdout] | [INFO] [stdout] = help: to document an item produced by a macro, the macro must produce the documentation as part of its expansion [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary trailing semicolon [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:91:32 [INFO] [stdout] | [INFO] [stdout] 91 | self.find_conn_verts();; [INFO] [stdout] | ^ help: remove this semicolon [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `item` [INFO] [stdout] --> src/build_graph_hash_mapping_for_conn_vertex.rs:11:9 [INFO] [stdout] | [INFO] [stdout] 11 | item: (NodeId, &Vec), [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_item` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `muc_id` [INFO] [stdout] --> src/build_graph_hash_mapping_for_conn_vertex.rs:12:9 [INFO] [stdout] | [INFO] [stdout] 12 | muc_id: MinimumUnionCycleId) [INFO] [stdout] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_muc_id` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/connected_component_size.rs:16:13 [INFO] [stdout] | [INFO] [stdout] 16 | let mut stack: Stack = default!(); [INFO] [stdout] | ----^^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `e` [INFO] [stdout] --> src/find_edge_bcc_with_component.rs:28:9 [INFO] [stdout] | [INFO] [stdout] 28 | e: &Edge) [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_e` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `edge` [INFO] [stdout] --> src/find_edge_bcc_with_delta.rs:94:9 [INFO] [stdout] | [INFO] [stdout] 94 | edge: &Edge) [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_edge` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `edge` [INFO] [stdout] --> src/find_edge_bcc_with_scratch.rs:89:9 [INFO] [stdout] | [INFO] [stdout] 89 | edge: &Edge) [INFO] [stdout] | ^^^^ help: if this is intentional, prefix it with an underscore: `_edge` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: irrefutable `if let` pattern [INFO] [stdout] --> src/find_muc_subgraphs.rs:54:12 [INFO] [stdout] | [INFO] [stdout] 54 | if let conn_vertex_map = muc.vertex_map()? { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this pattern will always match, so the `if let` is useless [INFO] [stdout] = help: consider replacing the `if let` with a `let` [INFO] [stdout] = note: `#[warn(irrefutable_let_patterns)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/find_mucs.rs:37:13 [INFO] [stdout] | [INFO] [stdout] 37 | let mut bridge_vec: Vec = self.find_bridge_edges::(); [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/find_mucs.rs:43:13 [INFO] [stdout] | [INFO] [stdout] 43 | let mut conn_comp_vec: Vec = gh.find_conn_comp()?; [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/insert_edge_and_update_muc.rs:73:13 [INFO] [stdout] | [INFO] [stdout] 73 | let mut shortest_path = self.get_shortest_path( [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/merge_muc_cycle.rs:29:17 [INFO] [stdout] | [INFO] [stdout] 29 | let mut src: NodeId = cycle[i].src; [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/merge_muc_cycle.rs:30:17 [INFO] [stdout] | [INFO] [stdout] 30 | let mut dst: NodeId = cycle[i].dst; [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `i` [INFO] [stdout] --> src/read_graph.rs:29:13 [INFO] [stdout] | [INFO] [stdout] 29 | for i in 0..m { [INFO] [stdout] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/approx_brandes_iteration_runtime_on_bcc_subgraph.rs:49:9 [INFO] [stdout] | [INFO] [stdout] 49 | self.find_edge_bcc_with_scratch(&mut bcc, &Edge::new(src,dst)); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] = note: `#[warn(unused_must_use)]` (part of `#[warn(unused)]`) on by default [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 49 | let _ = self.find_edge_bcc_with_scratch(&mut bcc, &Edge::new(src,dst)); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/approx_brandes_iteration_runtime_on_bcc_subgraph.rs:60:9 [INFO] [stdout] | [INFO] [stdout] 60 | bcc.compute_bc(&mut scores, Some(num_iter)); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 60 | let _ = bcc.compute_bc(&mut scores, Some(num_iter)); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/build_graph_hash_mapping_for_conn_vertex.rs:49:25 [INFO] [stdout] | [INFO] [stdout] 49 | gh.insert_edge(&Edge::new(node, bfs_nbr)); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 49 | let _ = gh.insert_edge(&Edge::new(node, bfs_nbr)); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/connect_node_ids.rs:10:9 [INFO] [stdout] | [INFO] [stdout] 10 | self.insert_edge(&Edge::new(src,dst)); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 10 | let _ = self.insert_edge(&Edge::new(src,dst)); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/create_and_push_new_muc.rs:34:9 [INFO] [stdout] | [INFO] [stdout] 34 | / merge_mucs( [INFO] [stdout] 35 | | &mut self.nodes_to_mucs, [INFO] [stdout] 36 | | &mut new_muc, [INFO] [stdout] 37 | | &mut self.mucs[dst_muc_id.val()] [INFO] [stdout] 38 | | ); [INFO] [stdout] | |_________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 34 | let _ = merge_mucs( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/create_and_push_new_muc.rs:40:9 [INFO] [stdout] | [INFO] [stdout] 40 | / merge_mucs( [INFO] [stdout] 41 | | &mut self.nodes_to_mucs, [INFO] [stdout] 42 | | &mut new_muc, [INFO] [stdout] 43 | | &mut self.mucs[src_muc_id.val()] [INFO] [stdout] 44 | | ); [INFO] [stdout] | |_________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 40 | let _ = merge_mucs( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/create_and_push_new_muc.rs:52:17 [INFO] [stdout] | [INFO] [stdout] 52 | / merge_mucs( [INFO] [stdout] 53 | | &mut self.nodes_to_mucs, [INFO] [stdout] 54 | | &mut new_muc, [INFO] [stdout] 55 | | &mut self.mucs[node_muc_id.val()] [INFO] [stdout] 56 | | ); [INFO] [stdout] | |_________________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 52 | let _ = merge_mucs( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/create_and_push_new_muc.rs:60:9 [INFO] [stdout] | [INFO] [stdout] 60 | new_muc.insert_edge(&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 60 | let _ = new_muc.insert_edge(&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/create_random_connected.rs:46:13 [INFO] [stdout] | [INFO] [stdout] 46 | graph.insert_edge(&rand_edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 46 | let _ = graph.insert_edge(&rand_edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_all_muc_subgraphs.rs:35:13 [INFO] [stdout] | [INFO] [stdout] 35 | self.find_muc_subgraphs(mucid![m]); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 35 | let _ = self.find_muc_subgraphs(mucid![m]); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_edge_bcc_with_component.rs:88:9 [INFO] [stdout] | [INFO] [stdout] 88 | self.insert_edge(e); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 88 | let _ = self.insert_edge(e); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_edge_bcc_with_component.rs:94:9 [INFO] [stdout] | [INFO] [stdout] 94 | self.find_edge_bcc_subgraph(&mut gh, e); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 94 | let _ = self.find_edge_bcc_subgraph(&mut gh, e); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_edge_bcc_with_component.rs:126:9 [INFO] [stdout] | [INFO] [stdout] 126 | gh.remove_edge(e); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 126 | let _ = gh.remove_edge(e); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_edge_bcc_with_component.rs:132:9 [INFO] [stdout] | [INFO] [stdout] 132 | self.remove_edge(e); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 132 | let _ = self.remove_edge(e); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_edge_bcc_with_delta.rs:40:9 [INFO] [stdout] | [INFO] [stdout] 40 | self.find_edge_bcc_subgraph(bcc.bcc_subgraph_mut(), &edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 40 | let _ = self.find_edge_bcc_subgraph(bcc.bcc_subgraph_mut(), &edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_edge_bcc_with_scratch.rs:35:9 [INFO] [stdout] | [INFO] [stdout] 35 | self.find_edge_bcc_subgraph(bcc.bcc_subgraph_mut(), &edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 35 | let _ = self.find_edge_bcc_subgraph(bcc.bcc_subgraph_mut(), &edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_muc_mcb.rs:52:17 [INFO] [stdout] | [INFO] [stdout] 52 | / self.find_muc_mcb_for_cycle( [INFO] [stdout] 53 | | idx, [INFO] [stdout] 54 | | &cycle_graph, [INFO] [stdout] 55 | | &mut visit_markers [INFO] [stdout] 56 | | ); [INFO] [stdout] | |_________________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 52 | let _ = self.find_muc_mcb_for_cycle( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_muc_mcb.rs:62:9 [INFO] [stdout] | [INFO] [stdout] 62 | self.find_conn_verts(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 62 | let _ = self.find_conn_verts(); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_mucs.rs:49:9 [INFO] [stdout] | [INFO] [stdout] 49 | self.find_conn_verts(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 49 | let _ = self.find_conn_verts(); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/find_mucs.rs:61:9 [INFO] [stdout] | [INFO] [stdout] 61 | self.find_mucs_fast(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 61 | let _ = self.find_mucs_fast(); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/from_filename.rs:9:9 [INFO] [stdout] | [INFO] [stdout] 9 | g.read_graph(filename); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 9 | let _ = g.read_graph(filename); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/graph.rs:84:5 [INFO] [stdout] | [INFO] [stdout] 84 | delegate_to_neighbors_map!{} [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 84 | let _ = delegate_to_neighbors_map!{} [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: eliding a lifetime that's named elsewhere is confusing [INFO] [stdout] --> src/graph.rs:188:34 [INFO] [stdout] | [INFO] [stdout] 188 | fn get_mucs<'a>(&'a self) -> &Vec> { [INFO] [stdout] | -- ^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is elided here [INFO] [stdout] | | [INFO] [stdout] | the lifetime is named here [INFO] [stdout] | [INFO] [stdout] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stdout] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stdout] help: consistently use `'a` [INFO] [stdout] | [INFO] [stdout] 188 | fn get_mucs<'a>(&'a self) -> &'a Vec> { [INFO] [stdout] | ++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/init_with_size.rs:13:9 [INFO] [stdout] | [INFO] [stdout] 13 | self.init_internals(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 13 | let _ = self.init_internals(); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_bc.rs:45:9 [INFO] [stdout] | [INFO] [stdout] 45 | self.insert_edge(&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 45 | let _ = self.insert_edge(&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_bc.rs:53:9 [INFO] [stdout] | [INFO] [stdout] 53 | self.find_edge_bcc_with_delta(&mut bcc,&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 53 | let _ = self.find_edge_bcc_with_delta(&mut bcc,&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_bc.rs:66:13 [INFO] [stdout] | [INFO] [stdout] 66 | / bcc.compute_bc_maxiter_exp( [INFO] [stdout] 67 | | &mut self.scores, [INFO] [stdout] 68 | | edge.src, [INFO] [stdout] 69 | | edge.dst, [INFO] [stdout] ... | [INFO] [stdout] 72 | | max_iter_d2 [INFO] [stdout] 73 | | ); [INFO] [stdout] | |_____________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 66 | let _ = bcc.compute_bc_maxiter_exp( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_bc.rs:77:13 [INFO] [stdout] | [INFO] [stdout] 77 | / bcc.compute_bc_exp( [INFO] [stdout] 78 | | &mut self.scores, [INFO] [stdout] 79 | | edge.src, [INFO] [stdout] 80 | | edge.dst, [INFO] [stdout] ... | [INFO] [stdout] 83 | | max_iter_d2 [INFO] [stdout] 84 | | ); [INFO] [stdout] | |_____________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 77 | let _ = bcc.compute_bc_exp( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_bc.rs:91:9 [INFO] [stdout] | [INFO] [stdout] 91 | bcc.bcc_subgraph_remove_edge(&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 91 | let _ = bcc.bcc_subgraph_remove_edge(&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:56:9 [INFO] [stdout] | [INFO] [stdout] 56 | self.mucs[src_muc_id.val()].insert_edge(&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 56 | let _ = self.mucs[src_muc_id.val()].insert_edge(&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:58:9 [INFO] [stdout] | [INFO] [stdout] 58 | self.insert_edge(&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 58 | let _ = self.insert_edge(&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:85:9 [INFO] [stdout] | [INFO] [stdout] 85 | self.insert_edge(&edge); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 85 | let _ = self.insert_edge(&edge); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:91:9 [INFO] [stdout] | [INFO] [stdout] 91 | self.find_conn_verts();; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 91 | let _ = self.find_conn_verts();; [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:93:9 [INFO] [stdout] | [INFO] [stdout] 93 | self.find_muc_subgraphs(id); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 93 | let _ = self.find_muc_subgraphs(id); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:114:13 [INFO] [stdout] | [INFO] [stdout] 114 | / self.insert_edge_and_update_muc_when_we_are_not_in_the_same_muc( [INFO] [stdout] 115 | | edge, [INFO] [stdout] 116 | | src_muc_id, [INFO] [stdout] 117 | | dst_muc_id [INFO] [stdout] 118 | | ); [INFO] [stdout] | |_____________^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 114 | let _ = self.insert_edge_and_update_muc_when_we_are_not_in_the_same_muc( [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/merge_muc_cycle.rs:32:13 [INFO] [stdout] | [INFO] [stdout] 32 | muc.insert_edge(&Edge::new(src, dst)); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 32 | let _ = muc.insert_edge(&Edge::new(src, dst)); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/subtract_edge.rs:27:9 [INFO] [stdout] | [INFO] [stdout] 27 | self.mucs[muc1_id.val()].insert_conn_vertex(bridge_edge.src, bridge_edge.dst); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 27 | let _ = self.mucs[muc1_id.val()].insert_conn_vertex(bridge_edge.src, bridge_edge.dst); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused `Result` that must be used [INFO] [stdout] --> src/subtract_edge.rs:28:9 [INFO] [stdout] | [INFO] [stdout] 28 | self.mucs[muc2_id.val()].insert_conn_vertex(bridge_edge.dst, bridge_edge.src); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stdout] help: use `let _ = ...` to ignore the resulting value [INFO] [stdout] | [INFO] [stdout] 28 | let _ = self.mucs[muc2_id.val()].insert_conn_vertex(bridge_edge.dst, bridge_edge.src); [INFO] [stdout] | +++++++ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 1.21s [INFO] [stderr] warning: the following packages contain code that will be rejected by a future version of Rust: icentral-neighbors v0.1.0 [INFO] [stderr] note: to see what the problems were, use the option `--future-incompat-report`, or run `cargo report future-incompatibilities --id 1` [INFO] running `Command { std: "docker" "inspect" "338f394dd337cff0854a0d905b29ba613aa8bc020989bfd1e9590140f76d5765", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "338f394dd337cff0854a0d905b29ba613aa8bc020989bfd1e9590140f76d5765", kill_on_drop: false }` [INFO] [stdout] 338f394dd337cff0854a0d905b29ba613aa8bc020989bfd1e9590140f76d5765 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-7-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:e90291280db7d1fac5b66fc6dad9f9662629e7365a55743daf9bdf73ebc4ea79" "/opt/rustwide/cargo-home/bin/cargo" "+caccb4d0368bd918ef6668af8e13834d07040417" "test" "--frozen", kill_on_drop: false }` [INFO] [stdout] 433bd9eba840775629b94b4cc3d0424d2277e39b3c4d3b49b01b1fe56219632c [INFO] running `Command { std: "docker" "start" "-a" "433bd9eba840775629b94b4cc3d0424d2277e39b3c4d3b49b01b1fe56219632c", kill_on_drop: false }` [INFO] [stderr] warning: unused doc comment [INFO] [stderr] --> src/create_random_connected.rs:24:9 [INFO] [stderr] | [INFO] [stderr] 24 | /// every node will at least show up once [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] 25 | / for node_idx in 0..n_vertices { [INFO] [stderr] 26 | | nodes.push(node_idx); [INFO] [stderr] 27 | | } [INFO] [stderr] | |_________- rustdoc does not generate documentation for expressions [INFO] [stderr] | [INFO] [stderr] = help: use `//` for a plain comment [INFO] [stderr] = note: `#[warn(unused_doc_comments)]` (part of `#[warn(unused)]`) on by default [INFO] [stderr] [INFO] [stderr] warning: unnecessary trailing semicolon [INFO] [stderr] --> src/find_edge_bcc_with_delta.rs:97:54 [INFO] [stderr] | [INFO] [stderr] 97 | let mut subgraph_sz_vec: Vec = vec![];; [INFO] [stderr] | ^ help: remove this semicolon [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(redundant_semicolons)]` (part of `#[warn(unused)]`) on by default [INFO] [stderr] [INFO] [stderr] warning: unnecessary trailing semicolon [INFO] [stderr] --> src/graph.rs:222:66 [INFO] [stderr] | [INFO] [stderr] 222 | builder.field("scores", &self.scores.len());; [INFO] [stderr] | ^ help: remove this semicolon [INFO] [stderr] [INFO] [stderr] warning: unnecessary trailing semicolon [INFO] [stderr] --> src/init_internals.rs:15:34 [INFO] [stderr] | [INFO] [stderr] 15 | self.bc_computed = false;; [INFO] [stderr] | ^ help: remove this semicolon [INFO] [stderr] [INFO] [stderr] warning: unused doc comment [INFO] [stderr] --> src/insert_edge_and_update_muc.rs:1:1 [INFO] [stderr] | [INFO] [stderr] 1 | / /// His disciples asked him: "What should we do for our work to be perfect?" [INFO] [stderr] 2 | | /// [INFO] [stderr] 3 | | /// The master said to them: "be ready in every circumstance. Blessed are they [INFO] [stderr] 4 | | /// who have found the strife, and who have seen the struggle with their eyes. [INFO] [stderr] ... | [INFO] [stderr] 27 | | /// - the dialogue of the savior. [INFO] [stderr] 28 | | /// [INFO] [stderr] | |_--^ [INFO] [stderr] | | [INFO] [stderr] | rustdoc does not generate documentation for macro invocations [INFO] [stderr] | [INFO] [stderr] = help: to document an item produced by a macro, the macro must produce the documentation as part of its expansion [INFO] [stderr] [INFO] [stderr] warning: unnecessary trailing semicolon [INFO] [stderr] --> src/insert_edge_and_update_muc.rs:91:32 [INFO] [stderr] | [INFO] [stderr] 91 | self.find_conn_verts();; [INFO] [stderr] | ^ help: remove this semicolon [INFO] [stderr] [INFO] [stderr] warning: unused variable: `item` [INFO] [stderr] --> src/build_graph_hash_mapping_for_conn_vertex.rs:11:9 [INFO] [stderr] | [INFO] [stderr] 11 | item: (NodeId, &Vec), [INFO] [stderr] | ^^^^ help: if this is intentional, prefix it with an underscore: `_item` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default [INFO] [stderr] [INFO] [stderr] warning: unused variable: `muc_id` [INFO] [stderr] --> src/build_graph_hash_mapping_for_conn_vertex.rs:12:9 [INFO] [stderr] | [INFO] [stderr] 12 | muc_id: MinimumUnionCycleId) [INFO] [stderr] | ^^^^^^ help: if this is intentional, prefix it with an underscore: `_muc_id` [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/connected_component_size.rs:16:13 [INFO] [stderr] | [INFO] [stderr] 16 | let mut stack: Stack = default!(); [INFO] [stderr] | ----^^^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default [INFO] [stderr] [INFO] [stderr] warning: unused variable: `e` [INFO] [stderr] --> src/find_edge_bcc_with_component.rs:28:9 [INFO] [stderr] | [INFO] [stderr] 28 | e: &Edge) [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_e` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `edge` [INFO] [stderr] --> src/find_edge_bcc_with_delta.rs:94:9 [INFO] [stderr] | [INFO] [stderr] 94 | edge: &Edge) [INFO] [stderr] | ^^^^ help: if this is intentional, prefix it with an underscore: `_edge` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `edge` [INFO] [stderr] --> src/find_edge_bcc_with_scratch.rs:89:9 [INFO] [stderr] | [INFO] [stderr] 89 | edge: &Edge) [INFO] [stderr] | ^^^^ help: if this is intentional, prefix it with an underscore: `_edge` [INFO] [stderr] [INFO] [stderr] warning: irrefutable `if let` pattern [INFO] [stderr] --> src/find_muc_subgraphs.rs:54:12 [INFO] [stderr] | [INFO] [stderr] 54 | if let conn_vertex_map = muc.vertex_map()? { [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this pattern will always match, so the `if let` is useless [INFO] [stderr] = help: consider replacing the `if let` with a `let` [INFO] [stderr] = note: `#[warn(irrefutable_let_patterns)]` on by default [INFO] [stderr] [INFO] [stderr] warning: variable does not need to be mutable [INFO] [stderr] --> src/find_mucs.rs:37:13 [INFO] [stderr] | [INFO] [stderr] 37 | let mut bridge_vec: Vec = self.find_bridge_edges::(); [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/find_mucs.rs:43:13 [INFO] [stderr] | [INFO] [stderr] 43 | let mut conn_comp_vec: Vec = gh.find_conn_comp()?; [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/insert_edge_and_update_muc.rs:73:13 [INFO] [stderr] | [INFO] [stderr] 73 | let mut shortest_path = self.get_shortest_path( [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/merge_muc_cycle.rs:29:17 [INFO] [stderr] | [INFO] [stderr] 29 | let mut src: NodeId = cycle[i].src; [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/merge_muc_cycle.rs:30:17 [INFO] [stderr] | [INFO] [stderr] 30 | let mut dst: NodeId = cycle[i].dst; [INFO] [stderr] | ----^^^ [INFO] [stderr] | | [INFO] [stderr] | help: remove this `mut` [INFO] [stderr] [INFO] [stderr] warning: unused variable: `i` [INFO] [stderr] --> src/read_graph.rs:29:13 [INFO] [stderr] | [INFO] [stderr] 29 | for i in 0..m { [INFO] [stderr] | ^ help: if this is intentional, prefix it with an underscore: `_i` [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/approx_brandes_iteration_runtime_on_bcc_subgraph.rs:49:9 [INFO] [stderr] | [INFO] [stderr] 49 | self.find_edge_bcc_with_scratch(&mut bcc, &Edge::new(src,dst)); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] = note: `#[warn(unused_must_use)]` (part of `#[warn(unused)]`) on by default [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 49 | let _ = self.find_edge_bcc_with_scratch(&mut bcc, &Edge::new(src,dst)); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/approx_brandes_iteration_runtime_on_bcc_subgraph.rs:60:9 [INFO] [stderr] | [INFO] [stderr] 60 | bcc.compute_bc(&mut scores, Some(num_iter)); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 60 | let _ = bcc.compute_bc(&mut scores, Some(num_iter)); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/build_graph_hash_mapping_for_conn_vertex.rs:49:25 [INFO] [stderr] | [INFO] [stderr] 49 | gh.insert_edge(&Edge::new(node, bfs_nbr)); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 49 | let _ = gh.insert_edge(&Edge::new(node, bfs_nbr)); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/connect_node_ids.rs:10:9 [INFO] [stderr] | [INFO] [stderr] 10 | self.insert_edge(&Edge::new(src,dst)); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 10 | let _ = self.insert_edge(&Edge::new(src,dst)); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/create_and_push_new_muc.rs:34:9 [INFO] [stderr] | [INFO] [stderr] 34 | / merge_mucs( [INFO] [stderr] 35 | | &mut self.nodes_to_mucs, [INFO] [stderr] 36 | | &mut new_muc, [INFO] [stderr] 37 | | &mut self.mucs[dst_muc_id.val()] [INFO] [stderr] 38 | | ); [INFO] [stderr] | |_________^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 34 | let _ = merge_mucs( [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/create_and_push_new_muc.rs:40:9 [INFO] [stderr] | [INFO] [stderr] 40 | / merge_mucs( [INFO] [stderr] 41 | | &mut self.nodes_to_mucs, [INFO] [stderr] 42 | | &mut new_muc, [INFO] [stderr] 43 | | &mut self.mucs[src_muc_id.val()] [INFO] [stderr] 44 | | ); [INFO] [stderr] | |_________^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 40 | let _ = merge_mucs( [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/create_and_push_new_muc.rs:52:17 [INFO] [stderr] | [INFO] [stderr] 52 | / merge_mucs( [INFO] [stderr] 53 | | &mut self.nodes_to_mucs, [INFO] [stderr] 54 | | &mut new_muc, [INFO] [stderr] 55 | | &mut self.mucs[node_muc_id.val()] [INFO] [stderr] 56 | | ); [INFO] [stderr] | |_________________^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 52 | let _ = merge_mucs( [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/create_and_push_new_muc.rs:60:9 [INFO] [stderr] | [INFO] [stderr] 60 | new_muc.insert_edge(&edge); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 60 | let _ = new_muc.insert_edge(&edge); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/create_random_connected.rs:46:13 [INFO] [stderr] | [INFO] [stderr] 46 | graph.insert_edge(&rand_edge); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 46 | let _ = graph.insert_edge(&rand_edge); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/find_all_muc_subgraphs.rs:35:13 [INFO] [stderr] | [INFO] [stderr] 35 | self.find_muc_subgraphs(mucid![m]); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 35 | let _ = self.find_muc_subgraphs(mucid![m]); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/find_edge_bcc_with_component.rs:88:9 [INFO] [stderr] | [INFO] [stderr] 88 | self.insert_edge(e); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 88 | let _ = self.insert_edge(e); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/find_edge_bcc_with_component.rs:94:9 [INFO] [stderr] | [INFO] [stderr] 94 | self.find_edge_bcc_subgraph(&mut gh, e); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 94 | let _ = self.find_edge_bcc_subgraph(&mut gh, e); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/find_edge_bcc_with_component.rs:126:9 [INFO] [stderr] | [INFO] [stderr] 126 | gh.remove_edge(e); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 126 | let _ = gh.remove_edge(e); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/find_edge_bcc_with_component.rs:132:9 [INFO] [stderr] | [INFO] [stderr] 132 | self.remove_edge(e); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 132 | let _ = self.remove_edge(e); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/find_edge_bcc_with_delta.rs:40:9 [INFO] [stderr] | [INFO] [stderr] 40 | self.find_edge_bcc_subgraph(bcc.bcc_subgraph_mut(), &edge); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 40 | let _ = self.find_edge_bcc_subgraph(bcc.bcc_subgraph_mut(), &edge); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/find_edge_bcc_with_scratch.rs:35:9 [INFO] [stderr] | [INFO] [stderr] 35 | self.find_edge_bcc_subgraph(bcc.bcc_subgraph_mut(), &edge); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 35 | let _ = self.find_edge_bcc_subgraph(bcc.bcc_subgraph_mut(), &edge); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/find_muc_mcb.rs:52:17 [INFO] [stderr] | [INFO] [stderr] 52 | / self.find_muc_mcb_for_cycle( [INFO] [stderr] 53 | | idx, [INFO] [stderr] 54 | | &cycle_graph, [INFO] [stderr] 55 | | &mut visit_markers [INFO] [stderr] 56 | | ); [INFO] [stderr] | |_________________^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 52 | let _ = self.find_muc_mcb_for_cycle( [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/find_muc_mcb.rs:62:9 [INFO] [stderr] | [INFO] [stderr] 62 | self.find_conn_verts(); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 62 | let _ = self.find_conn_verts(); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/find_mucs.rs:49:9 [INFO] [stderr] | [INFO] [stderr] 49 | self.find_conn_verts(); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 49 | let _ = self.find_conn_verts(); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/find_mucs.rs:61:9 [INFO] [stderr] | [INFO] [stderr] 61 | self.find_mucs_fast(); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 61 | let _ = self.find_mucs_fast(); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/from_filename.rs:9:9 [INFO] [stderr] | [INFO] [stderr] 9 | g.read_graph(filename); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 9 | let _ = g.read_graph(filename); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/graph.rs:84:5 [INFO] [stderr] | [INFO] [stderr] 84 | delegate_to_neighbors_map!{} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 84 | let _ = delegate_to_neighbors_map!{} [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: eliding a lifetime that's named elsewhere is confusing [INFO] [stderr] --> src/graph.rs:188:34 [INFO] [stderr] | [INFO] [stderr] 188 | fn get_mucs<'a>(&'a self) -> &Vec> { [INFO] [stderr] | -- ^^^^^^^^^^^^^^^^^^^^^^^^^^^ the same lifetime is elided here [INFO] [stderr] | | [INFO] [stderr] | the lifetime is named here [INFO] [stderr] | [INFO] [stderr] = help: the same lifetime is referred to in inconsistent ways, making the signature confusing [INFO] [stderr] = note: `#[warn(mismatched_lifetime_syntaxes)]` on by default [INFO] [stderr] help: consistently use `'a` [INFO] [stderr] | [INFO] [stderr] 188 | fn get_mucs<'a>(&'a self) -> &'a Vec> { [INFO] [stderr] | ++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/init_with_size.rs:13:9 [INFO] [stderr] | [INFO] [stderr] 13 | self.init_internals(); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 13 | let _ = self.init_internals(); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/insert_edge_and_update_bc.rs:45:9 [INFO] [stderr] | [INFO] [stderr] 45 | self.insert_edge(&edge); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 45 | let _ = self.insert_edge(&edge); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/insert_edge_and_update_bc.rs:53:9 [INFO] [stderr] | [INFO] [stderr] 53 | self.find_edge_bcc_with_delta(&mut bcc,&edge); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 53 | let _ = self.find_edge_bcc_with_delta(&mut bcc,&edge); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/insert_edge_and_update_bc.rs:66:13 [INFO] [stderr] | [INFO] [stderr] 66 | / bcc.compute_bc_maxiter_exp( [INFO] [stderr] 67 | | &mut self.scores, [INFO] [stderr] 68 | | edge.src, [INFO] [stderr] 69 | | edge.dst, [INFO] [stderr] ... | [INFO] [stderr] 72 | | max_iter_d2 [INFO] [stderr] 73 | | ); [INFO] [stderr] | |_____________^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 66 | let _ = bcc.compute_bc_maxiter_exp( [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/insert_edge_and_update_bc.rs:77:13 [INFO] [stderr] | [INFO] [stderr] 77 | / bcc.compute_bc_exp( [INFO] [stderr] 78 | | &mut self.scores, [INFO] [stderr] 79 | | edge.src, [INFO] [stderr] 80 | | edge.dst, [INFO] [stderr] ... | [INFO] [stderr] 83 | | max_iter_d2 [INFO] [stderr] 84 | | ); [INFO] [stderr] | |_____________^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 77 | let _ = bcc.compute_bc_exp( [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/insert_edge_and_update_bc.rs:91:9 [INFO] [stderr] | [INFO] [stderr] 91 | bcc.bcc_subgraph_remove_edge(&edge); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 91 | let _ = bcc.bcc_subgraph_remove_edge(&edge); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/insert_edge_and_update_muc.rs:56:9 [INFO] [stderr] | [INFO] [stderr] 56 | self.mucs[src_muc_id.val()].insert_edge(&edge); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 56 | let _ = self.mucs[src_muc_id.val()].insert_edge(&edge); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/insert_edge_and_update_muc.rs:58:9 [INFO] [stderr] | [INFO] [stderr] 58 | self.insert_edge(&edge); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 58 | let _ = self.insert_edge(&edge); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/insert_edge_and_update_muc.rs:85:9 [INFO] [stderr] | [INFO] [stderr] 85 | self.insert_edge(&edge); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 85 | let _ = self.insert_edge(&edge); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/insert_edge_and_update_muc.rs:91:9 [INFO] [stderr] | [INFO] [stderr] 91 | self.find_conn_verts();; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 91 | let _ = self.find_conn_verts();; [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/insert_edge_and_update_muc.rs:93:9 [INFO] [stderr] | [INFO] [stderr] 93 | self.find_muc_subgraphs(id); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 93 | let _ = self.find_muc_subgraphs(id); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/insert_edge_and_update_muc.rs:114:13 [INFO] [stderr] | [INFO] [stderr] 114 | / self.insert_edge_and_update_muc_when_we_are_not_in_the_same_muc( [INFO] [stderr] 115 | | edge, [INFO] [stderr] 116 | | src_muc_id, [INFO] [stderr] 117 | | dst_muc_id [INFO] [stderr] 118 | | ); [INFO] [stderr] | |_____________^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 114 | let _ = self.insert_edge_and_update_muc_when_we_are_not_in_the_same_muc( [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/merge_muc_cycle.rs:32:13 [INFO] [stderr] | [INFO] [stderr] 32 | muc.insert_edge(&Edge::new(src, dst)); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 32 | let _ = muc.insert_edge(&Edge::new(src, dst)); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/subtract_edge.rs:27:9 [INFO] [stderr] | [INFO] [stderr] 27 | self.mucs[muc1_id.val()].insert_conn_vertex(bridge_edge.src, bridge_edge.dst); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 27 | let _ = self.mucs[muc1_id.val()].insert_conn_vertex(bridge_edge.src, bridge_edge.dst); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: unused `Result` that must be used [INFO] [stderr] --> src/subtract_edge.rs:28:9 [INFO] [stderr] | [INFO] [stderr] 28 | self.mucs[muc2_id.val()].insert_conn_vertex(bridge_edge.dst, bridge_edge.src); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] | [INFO] [stderr] = note: this `Result` may be an `Err` variant, which should be handled [INFO] [stderr] help: use `let _ = ...` to ignore the resulting value [INFO] [stderr] | [INFO] [stderr] 28 | let _ = self.mucs[muc2_id.val()].insert_conn_vertex(bridge_edge.dst, bridge_edge.src); [INFO] [stderr] | +++++++ [INFO] [stderr] [INFO] [stderr] warning: `icentral-graph` (lib) generated 57 warnings (run `cargo fix --lib -p icentral-graph` to apply 7 suggestions) [INFO] [stderr] warning: `icentral-graph` (lib test) generated 57 warnings (57 duplicates) [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.22s [INFO] [stderr] warning: the following packages contain code that will be rejected by a future version of Rust: icentral-neighbors v0.1.0 [INFO] [stderr] note: to see what the problems were, use the option `--future-incompat-report`, or run `cargo report future-incompatibilities --id 1` [INFO] [stderr] Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/icentral_graph-80d62c9f0398bd16) [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] [stderr] Doc-tests icentral_graph [INFO] [stderr] warning: unnecessary trailing semicolon [INFO] [stderr] --> src/find_edge_bcc_with_delta.rs:97:54 [INFO] [stderr] | [INFO] [stderr] 97 | let mut subgraph_sz_vec: Vec = vec![];; [INFO] [stderr] | ^ help: remove this semicolon [INFO] [stderr] | [INFO] [stderr] = note: `#[warn(redundant_semicolons)]` (part of `#[warn(unused)]`) on by default [INFO] [stderr] [INFO] [stderr] warning: unnecessary trailing semicolon [INFO] [stderr] --> src/graph.rs:222:66 [INFO] [stderr] | [INFO] [stderr] 222 | builder.field("scores", &self.scores.len());; [INFO] [stderr] | ^ help: remove this semicolon [INFO] [stderr] [INFO] [stderr] warning: unnecessary trailing semicolon [INFO] [stderr] --> src/init_internals.rs:15:34 [INFO] [stderr] | [INFO] [stderr] 15 | self.bc_computed = false;; [INFO] [stderr] | ^ help: remove this semicolon [INFO] [stderr] [INFO] [stderr] warning: unnecessary trailing semicolon [INFO] [stderr] --> src/insert_edge_and_update_muc.rs:91:32 [INFO] [stderr] | [INFO] [stderr] 91 | self.find_conn_verts();; [INFO] [stderr] | ^ help: remove this semicolon [INFO] [stderr] [INFO] [stderr] warning: 4 warnings emitted [INFO] [stderr] [INFO] [stdout] [INFO] [stdout] running 1 test [INFO] [stdout] test src/insert_edge_and_update_muc.rs - insert_edge_and_update_muc::Graph::insert_edge_and_update_muc_when_full_edge_contained_in_muc (line 45) ... FAILED [INFO] [stdout] [INFO] [stdout] failures: [INFO] [stdout] [INFO] [stdout] ---- src/insert_edge_and_update_muc.rs - insert_edge_and_update_muc::Graph::insert_edge_and_update_muc_when_full_edge_contained_in_muc (line 45) stdout ---- [INFO] [stdout] error: expected one of `!` or `::`, found `just` [INFO] [stdout] --> src/insert_edge_and_update_muc.rs:46:10 [INFO] [stdout] | [INFO] [stdout] 1 | then just update the graph and the [INFO] [stdout] | ^^^^ expected one of `!` or `::` [INFO] [stdout] [INFO] [stdout] error: aborting due to 1 previous error [INFO] [stdout] [INFO] [stdout] Couldn't compile the test. [INFO] [stdout] [INFO] [stdout] failures: [INFO] [stdout] src/insert_edge_and_update_muc.rs - insert_edge_and_update_muc::Graph::insert_edge_and_update_muc_when_full_edge_contained_in_muc (line 45) [INFO] [stdout] [INFO] [stdout] test result: FAILED. 0 passed; 1 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.03s [INFO] [stdout] [INFO] [stderr] error: doctest failed, to rerun pass `--doc` [INFO] running `Command { std: "docker" "inspect" "433bd9eba840775629b94b4cc3d0424d2277e39b3c4d3b49b01b1fe56219632c", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "433bd9eba840775629b94b4cc3d0424d2277e39b3c4d3b49b01b1fe56219632c", kill_on_drop: false }` [INFO] [stdout] 433bd9eba840775629b94b4cc3d0424d2277e39b3c4d3b49b01b1fe56219632c