[INFO] fetching crate saboten 0.1.2-alpha.3...
[INFO] testing saboten-0.1.2-alpha.3 against beta-2025-10-28 for beta-1.92-2
[INFO] extracting crate saboten 0.1.2-alpha.3 into /workspace/builds/worker-4-tc2/source
[INFO] started tweaking crates.io crate saboten 0.1.2-alpha.3
[INFO] finished tweaking crates.io crate saboten 0.1.2-alpha.3
[INFO] tweaked toml for crates.io crate saboten 0.1.2-alpha.3 written to /workspace/builds/worker-4-tc2/source/Cargo.toml
[INFO] validating manifest of crates.io crate saboten 0.1.2-alpha.3 on toolchain beta-2025-10-28
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+beta-2025-10-28" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+beta-2025-10-28" "generate-lockfile" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Updating crates.io index
[INFO] [stderr]      Locking 89 packages to latest compatible versions
[INFO] [stderr]       Adding criterion v0.3.6 (available: v0.7.0)
[INFO] [stderr]       Adding indicatif v0.15.0 (available: v0.18.2)
[INFO] [stderr]       Adding petgraph v0.5.1 (available: v0.8.3)
[INFO] [stderr]       Adding rustc-hash v1.1.0 (available: v2.1.1)
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+beta-2025-10-28" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/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:4848fb76d95f26979359cc7e45710b1dbc8f3acb7aeedee7c460d7702230f228" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2025-10-28" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 80b47778819054b394219e9a21a9468d162a50cdf690ff935d300c2b8e2c5b19
[INFO] running `Command { std: "docker" "start" "-a" "80b47778819054b394219e9a21a9468d162a50cdf690ff935d300c2b8e2c5b19", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "80b47778819054b394219e9a21a9468d162a50cdf690ff935d300c2b8e2c5b19", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "80b47778819054b394219e9a21a9468d162a50cdf690ff935d300c2b8e2c5b19", kill_on_drop: false }`
[INFO] [stdout] 80b47778819054b394219e9a21a9468d162a50cdf690ff935d300c2b8e2c5b19
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:4848fb76d95f26979359cc7e45710b1dbc8f3acb7aeedee7c460d7702230f228" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2025-10-28" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 17f9252984dd0cc15ac10839c8ad795e4bb21fa1c2cc4471e74724e4c6fdb8b4
[INFO] running `Command { std: "docker" "start" "-a" "17f9252984dd0cc15ac10839c8ad795e4bb21fa1c2cc4471e74724e4c6fdb8b4", kill_on_drop: false }`
[INFO] [stderr]    Compiling memchr v2.7.6
[INFO] [stderr]    Compiling lexical-core v0.7.6
[INFO] [stderr]    Compiling nom v5.1.3
[INFO] [stderr]    Compiling arrayvec v0.5.2
[INFO] [stderr]    Compiling bytemuck_derive v1.10.2
[INFO] [stderr]    Compiling regex-automata v0.1.10
[INFO] [stderr]    Compiling memmap v0.7.0
[INFO] [stderr]    Compiling fixedbitset v0.2.0
[INFO] [stderr]    Compiling petgraph v0.5.1
[INFO] [stderr]    Compiling aho-corasick v1.1.4
[INFO] [stderr]    Compiling bstr v0.2.17
[INFO] [stderr]    Compiling bytemuck v1.24.0
[INFO] [stderr]    Compiling regex-automata v0.4.13
[INFO] [stderr]    Compiling regex v1.12.2
[INFO] [stderr]    Compiling gfa v0.10.1
[INFO] [stderr]    Compiling three-edge-connected v0.2.2
[INFO] [stderr]    Compiling saboten v0.1.2-alpha.3 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `id_to_black_edge`
[INFO] [stdout]  --> src/biedgedgraph.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::projection::{id_to_black_edge, Projection};
[INFO] [stdout]   |                         ^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Biedged`
[INFO] [stdout]  --> src/biedgedgraph.rs:7:21
[INFO] [stdout]   |
[INFO] [stdout] 7 | use crate::snarls::{Biedged, Node};
[INFO] [stdout]   |                     ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `SnarlMapIter` and `SnarlType`
[INFO] [stdout]   --> src/cactusgraph.rs:14:57
[INFO] [stdout]    |
[INFO] [stdout] 14 |         Biedged, Bridge, Cactus, Node, Snarl, SnarlMap, SnarlMapIter, SnarlType,
[INFO] [stdout]    |                                                         ^^^^^^^^^^^^  ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `ChainEdges`
[INFO] [stdout]  --> src/netgraph.rs:4:38
[INFO] [stdout]   |
[INFO] [stdout] 4 | use crate::cactusgraph::{CactusTree, ChainEdges};
[INFO] [stdout]   |                                      ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `debug` and `trace`
[INFO] [stdout]  --> src/snarls.rs:1:11
[INFO] [stdout]   |
[INFO] [stdout] 1 | use log::{debug, trace};
[INFO] [stdout]   |           ^^^^^  ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `b_inv`
[INFO] [stdout]    --> src/cactusgraph.rs:212:21
[INFO] [stdout]     |
[INFO] [stdout] 212 |                 let b_inv = inv_proj.get(&b.id).unwrap();
[INFO] [stdout]     |                     ^^^^^ help: if this is intentional, prefix it with an underscore: `_b_inv`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `vertices`
[INFO] [stdout]    --> src/cactusgraph.rs:877:9
[INFO] [stdout]     |
[INFO] [stdout] 877 |         vertices: &FxHashSet<Node>,
[INFO] [stdout]     |         ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_vertices`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `cactus_tree`
[INFO] [stdout]   --> src/netgraph.rs:33:9
[INFO] [stdout]    |
[INFO] [stdout] 33 |         cactus_tree: &CactusTree,
[INFO] [stdout]    |         ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_cactus_tree`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `black_edge_cycle_rank` is never used
[INFO] [stdout]    --> src/cactusgraph.rs:502:8
[INFO] [stdout]     |
[INFO] [stdout] 104 | impl<'a> CactusGraph<'a> {
[INFO] [stdout]     | ------------------------ method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 502 |     fn black_edge_cycle_rank(&self, x: Node) -> Option<usize> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 17.00s
[INFO] running `Command { std: "docker" "inspect" "17f9252984dd0cc15ac10839c8ad795e4bb21fa1c2cc4471e74724e4c6fdb8b4", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "17f9252984dd0cc15ac10839c8ad795e4bb21fa1c2cc4471e74724e4c6fdb8b4", kill_on_drop: false }`
[INFO] [stdout] 17f9252984dd0cc15ac10839c8ad795e4bb21fa1c2cc4471e74724e4c6fdb8b4
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:4848fb76d95f26979359cc7e45710b1dbc8f3acb7aeedee7c460d7702230f228" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2025-10-28" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] cb39c0dfc884e332cb5ef32bebe36e908ba8c57d37396a516ff0e44cd1c02107
[INFO] running `Command { std: "docker" "start" "-a" "cb39c0dfc884e332cb5ef32bebe36e908ba8c57d37396a516ff0e44cd1c02107", kill_on_drop: false }`
[INFO] [stderr]    Compiling serde_core v1.0.228
[INFO] [stderr]    Compiling plotters-backend v0.3.7
[INFO] [stderr]    Compiling itertools v0.10.5
[INFO] [stderr]    Compiling csv-core v0.1.13
[INFO] [stderr]    Compiling cast v0.3.0
[INFO] [stderr]    Compiling clap v2.34.0
[INFO] [stderr]    Compiling oorandom v11.1.5
[INFO] [stdout] warning: unused import: `id_to_black_edge`
[INFO] [stdout]  --> src/biedgedgraph.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::projection::{id_to_black_edge, Projection};
[INFO] [stdout]   |                         ^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `Biedged`
[INFO] [stdout]  --> src/biedgedgraph.rs:7:21
[INFO] [stdout]   |
[INFO] [stdout] 7 | use crate::snarls::{Biedged, Node};
[INFO] [stdout]   |                     ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `SnarlMapIter` and `SnarlType`
[INFO] [stdout]   --> src/cactusgraph.rs:14:57
[INFO] [stdout]    |
[INFO] [stdout] 14 |         Biedged, Bridge, Cactus, Node, Snarl, SnarlMap, SnarlMapIter, SnarlType,
[INFO] [stdout]    |                                                         ^^^^^^^^^^^^  ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `ChainEdges`
[INFO] [stdout]  --> src/netgraph.rs:4:38
[INFO] [stdout]   |
[INFO] [stdout] 4 | use crate::cactusgraph::{CactusTree, ChainEdges};
[INFO] [stdout]   |                                      ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `debug` and `trace`
[INFO] [stdout]  --> src/snarls.rs:1:11
[INFO] [stdout]   |
[INFO] [stdout] 1 | use log::{debug, trace};
[INFO] [stdout]   |           ^^^^^  ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `b_inv`
[INFO] [stdout]    --> src/cactusgraph.rs:212:21
[INFO] [stdout]     |
[INFO] [stdout] 212 |                 let b_inv = inv_proj.get(&b.id).unwrap();
[INFO] [stdout]     |                     ^^^^^ help: if this is intentional, prefix it with an underscore: `_b_inv`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `vertices`
[INFO] [stdout]    --> src/cactusgraph.rs:877:9
[INFO] [stdout]     |
[INFO] [stdout] 877 |         vertices: &FxHashSet<Node>,
[INFO] [stdout]     |         ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_vertices`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `cactus_tree`
[INFO] [stdout]   --> src/netgraph.rs:33:9
[INFO] [stdout]    |
[INFO] [stdout] 33 |         cactus_tree: &CactusTree,
[INFO] [stdout]    |         ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_cactus_tree`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: method `black_edge_cycle_rank` is never used
[INFO] [stdout]    --> src/cactusgraph.rs:502:8
[INFO] [stdout]     |
[INFO] [stdout] 104 | impl<'a> CactusGraph<'a> {
[INFO] [stdout]     | ------------------------ method in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 502 |     fn black_edge_cycle_rank(&self, x: Node) -> Option<usize> {
[INFO] [stdout]     |        ^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling plotters-svg v0.3.7
[INFO] [stderr]    Compiling plotters v0.3.7
[INFO] [stderr]    Compiling criterion-plot v0.4.5
[INFO] [stderr]    Compiling serde v1.0.228
[INFO] [stderr]    Compiling serde_json v1.0.145
[INFO] [stderr]    Compiling csv v1.4.0
[INFO] [stderr]    Compiling serde_cbor v0.11.2
[INFO] [stderr]    Compiling tinytemplate v1.2.1
[INFO] [stderr]    Compiling criterion v0.3.6
[INFO] [stderr]    Compiling saboten v0.1.2-alpha.3 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `id_to_black_edge`
[INFO] [stdout]  --> src/biedgedgraph.rs:6:25
[INFO] [stdout]   |
[INFO] [stdout] 6 | use crate::projection::{id_to_black_edge, Projection};
[INFO] [stdout]   |                         ^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `SnarlMapIter` and `SnarlType`
[INFO] [stdout]   --> src/cactusgraph.rs:14:57
[INFO] [stdout]    |
[INFO] [stdout] 14 |         Biedged, Bridge, Cactus, Node, Snarl, SnarlMap, SnarlMapIter, SnarlType,
[INFO] [stdout]    |                                                         ^^^^^^^^^^^^  ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `ChainEdges`
[INFO] [stdout]  --> src/netgraph.rs:4:38
[INFO] [stdout]   |
[INFO] [stdout] 4 | use crate::cactusgraph::{CactusTree, ChainEdges};
[INFO] [stdout]   |                                      ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `debug` and `trace`
[INFO] [stdout]  --> src/snarls.rs:1:11
[INFO] [stdout]   |
[INFO] [stdout] 1 | use log::{debug, trace};
[INFO] [stdout]   |           ^^^^^  ^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0107]: struct takes 0 generic arguments but 1 generic argument was supplied
[INFO] [stdout]    --> src/biedgedgraph.rs:611:42
[INFO] [stdout]     |
[INFO] [stdout] 611 |     fn example_graph_2() -> BiedgedGraph<Node<Biedged>> {
[INFO] [stdout]     |                                          ^^^^--------- help: remove the unnecessary generics
[INFO] [stdout]     |                                          |
[INFO] [stdout]     |                                          expected 0 generic arguments
[INFO] [stdout]     |
[INFO] [stdout] note: struct defined here, with 0 generic parameters
[INFO] [stdout]    --> src/snarls.rs:20:12
[INFO] [stdout]     |
[INFO] [stdout]  20 | pub struct Node {
[INFO] [stdout]     |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0107]: missing generics for struct `biedgedgraph::BiedgedGraph`
[INFO] [stdout]    --> src/biedgedgraph.rs:640:24
[INFO] [stdout]     |
[INFO] [stdout] 640 |         let mut graph: BiedgedGraph = BiedgedGraph::new();
[INFO] [stdout]     |                        ^^^^^^^^^^^^ expected 1 generic argument
[INFO] [stdout]     |
[INFO] [stdout] note: struct defined here, with 1 generic parameter: `G`
[INFO] [stdout]    --> src/biedgedgraph.rs:99:12
[INFO] [stdout]     |
[INFO] [stdout]  99 | pub struct BiedgedGraph<G> {
[INFO] [stdout]     |            ^^^^^^^^^^^^ -
[INFO] [stdout] help: add missing generic argument
[INFO] [stdout]     |
[INFO] [stdout] 640 |         let mut graph: BiedgedGraph<G> = BiedgedGraph::new();
[INFO] [stdout]     |                                    +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0599]: no function or associated item named `new` found for struct `biedgedgraph::BiedgedGraph<G>` in the current scope
[INFO] [stdout]    --> src/biedgedgraph.rs:640:53
[INFO] [stdout]     |
[INFO] [stdout]  99 | pub struct BiedgedGraph<G> {
[INFO] [stdout]     | -------------------------- function or associated item `new` not found for this struct
[INFO] [stdout] ...
[INFO] [stdout] 640 |         let mut graph: BiedgedGraph = BiedgedGraph::new();
[INFO] [stdout]     |                                                     ^^^ function or associated item not found in `biedgedgraph::BiedgedGraph<_>`
[INFO] [stdout]     |
[INFO] [stdout] note: if you're trying to build a new `biedgedgraph::BiedgedGraph<_>` consider using one of the following associated functions:
[INFO] [stdout]       biedgedgraph::BiedgedGraph::<G>::from_directed_edges
[INFO] [stdout]       biedgedgraph::BiedgedGraph::<G>::from_bidirected_edges
[INFO] [stdout]       biedgedgraph::BiedgedGraph::<G>::from_gfa
[INFO] [stdout]    --> src/biedgedgraph.rs:291:5
[INFO] [stdout]     |
[INFO] [stdout] 291 | /     pub fn from_directed_edges<I>(i: I) -> Option<Self>
[INFO] [stdout] 292 | |     where
[INFO] [stdout] 293 | |         I: IntoIterator<Item = (u64, u64)>,
[INFO] [stdout]     | |___________________________________________^
[INFO] [stdout] ...
[INFO] [stdout] 304 | /     pub fn from_bidirected_edges<I>(i: I) -> Option<Self>
[INFO] [stdout] 305 | |     where
[INFO] [stdout] 306 | |         I: IntoIterator<Item = (u64, Orientation, u64, Orientation)>,
[INFO] [stdout]     | |_____________________________________________________________________^
[INFO] [stdout] ...
[INFO] [stdout] 359 |       pub fn from_gfa(gfa: &GFA<usize, ()>) -> Self {
[INFO] [stdout]     |       ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     = help: items from traits can only be used if the trait is implemented and in scope
[INFO] [stdout]     = note: the following traits define an item `new`, perhaps you need to implement one of them:
[INFO] [stdout]             candidate #1: `IndexType`
[INFO] [stdout]             candidate #2: `Nullable`
[INFO] [stdout]             candidate #3: `lexical_core::util::sequence::VecLike`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0107]: missing generics for struct `biedgedgraph::BiedgedGraph`
[INFO] [stdout]    --> src/biedgedgraph.rs:648:24
[INFO] [stdout]     |
[INFO] [stdout] 648 |         let mut graph: BiedgedGraph = BiedgedGraph::new();
[INFO] [stdout]     |                        ^^^^^^^^^^^^ expected 1 generic argument
[INFO] [stdout]     |
[INFO] [stdout] note: struct defined here, with 1 generic parameter: `G`
[INFO] [stdout]    --> src/biedgedgraph.rs:99:12
[INFO] [stdout]     |
[INFO] [stdout]  99 | pub struct BiedgedGraph<G> {
[INFO] [stdout]     |            ^^^^^^^^^^^^ -
[INFO] [stdout] help: add missing generic argument
[INFO] [stdout]     |
[INFO] [stdout] 648 |         let mut graph: BiedgedGraph<G> = BiedgedGraph::new();
[INFO] [stdout]     |                                    +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0599]: no function or associated item named `new` found for struct `biedgedgraph::BiedgedGraph<G>` in the current scope
[INFO] [stdout]    --> src/biedgedgraph.rs:648:53
[INFO] [stdout]     |
[INFO] [stdout]  99 | pub struct BiedgedGraph<G> {
[INFO] [stdout]     | -------------------------- function or associated item `new` not found for this struct
[INFO] [stdout] ...
[INFO] [stdout] 648 |         let mut graph: BiedgedGraph = BiedgedGraph::new();
[INFO] [stdout]     |                                                     ^^^ function or associated item not found in `biedgedgraph::BiedgedGraph<_>`
[INFO] [stdout]     |
[INFO] [stdout] note: if you're trying to build a new `biedgedgraph::BiedgedGraph<_>` consider using one of the following associated functions:
[INFO] [stdout]       biedgedgraph::BiedgedGraph::<G>::from_directed_edges
[INFO] [stdout]       biedgedgraph::BiedgedGraph::<G>::from_bidirected_edges
[INFO] [stdout]       biedgedgraph::BiedgedGraph::<G>::from_gfa
[INFO] [stdout]    --> src/biedgedgraph.rs:291:5
[INFO] [stdout]     |
[INFO] [stdout] 291 | /     pub fn from_directed_edges<I>(i: I) -> Option<Self>
[INFO] [stdout] 292 | |     where
[INFO] [stdout] 293 | |         I: IntoIterator<Item = (u64, u64)>,
[INFO] [stdout]     | |___________________________________________^
[INFO] [stdout] ...
[INFO] [stdout] 304 | /     pub fn from_bidirected_edges<I>(i: I) -> Option<Self>
[INFO] [stdout] 305 | |     where
[INFO] [stdout] 306 | |         I: IntoIterator<Item = (u64, Orientation, u64, Orientation)>,
[INFO] [stdout]     | |_____________________________________________________________________^
[INFO] [stdout] ...
[INFO] [stdout] 359 |       pub fn from_gfa(gfa: &GFA<usize, ()>) -> Self {
[INFO] [stdout]     |       ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     = help: items from traits can only be used if the trait is implemented and in scope
[INFO] [stdout]     = note: the following traits define an item `new`, perhaps you need to implement one of them:
[INFO] [stdout]             candidate #1: `IndexType`
[INFO] [stdout]             candidate #2: `Nullable`
[INFO] [stdout]             candidate #3: `lexical_core::util::sequence::VecLike`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0107]: missing generics for struct `biedgedgraph::BiedgedGraph`
[INFO] [stdout]    --> src/biedgedgraph.rs:681:24
[INFO] [stdout]     |
[INFO] [stdout] 681 |         let mut graph: BiedgedGraph = BiedgedGraph::new();
[INFO] [stdout]     |                        ^^^^^^^^^^^^ expected 1 generic argument
[INFO] [stdout]     |
[INFO] [stdout] note: struct defined here, with 1 generic parameter: `G`
[INFO] [stdout]    --> src/biedgedgraph.rs:99:12
[INFO] [stdout]     |
[INFO] [stdout]  99 | pub struct BiedgedGraph<G> {
[INFO] [stdout]     |            ^^^^^^^^^^^^ -
[INFO] [stdout] help: add missing generic argument
[INFO] [stdout]     |
[INFO] [stdout] 681 |         let mut graph: BiedgedGraph<G> = BiedgedGraph::new();
[INFO] [stdout]     |                                    +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0599]: no function or associated item named `new` found for struct `biedgedgraph::BiedgedGraph<G>` in the current scope
[INFO] [stdout]    --> src/biedgedgraph.rs:681:53
[INFO] [stdout]     |
[INFO] [stdout]  99 | pub struct BiedgedGraph<G> {
[INFO] [stdout]     | -------------------------- function or associated item `new` not found for this struct
[INFO] [stdout] ...
[INFO] [stdout] 681 |         let mut graph: BiedgedGraph = BiedgedGraph::new();
[INFO] [stdout]     |                                                     ^^^ function or associated item not found in `biedgedgraph::BiedgedGraph<_>`
[INFO] [stdout]     |
[INFO] [stdout] note: if you're trying to build a new `biedgedgraph::BiedgedGraph<_>` consider using one of the following associated functions:
[INFO] [stdout]       biedgedgraph::BiedgedGraph::<G>::from_directed_edges
[INFO] [stdout]       biedgedgraph::BiedgedGraph::<G>::from_bidirected_edges
[INFO] [stdout]       biedgedgraph::BiedgedGraph::<G>::from_gfa
[INFO] [stdout]    --> src/biedgedgraph.rs:291:5
[INFO] [stdout]     |
[INFO] [stdout] 291 | /     pub fn from_directed_edges<I>(i: I) -> Option<Self>
[INFO] [stdout] 292 | |     where
[INFO] [stdout] 293 | |         I: IntoIterator<Item = (u64, u64)>,
[INFO] [stdout]     | |___________________________________________^
[INFO] [stdout] ...
[INFO] [stdout] 304 | /     pub fn from_bidirected_edges<I>(i: I) -> Option<Self>
[INFO] [stdout] 305 | |     where
[INFO] [stdout] 306 | |         I: IntoIterator<Item = (u64, Orientation, u64, Orientation)>,
[INFO] [stdout]     | |_____________________________________________________________________^
[INFO] [stdout] ...
[INFO] [stdout] 359 |       pub fn from_gfa(gfa: &GFA<usize, ()>) -> Self {
[INFO] [stdout]     |       ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]     = help: items from traits can only be used if the trait is implemented and in scope
[INFO] [stdout]     = note: the following traits define an item `new`, perhaps you need to implement one of them:
[INFO] [stdout]             candidate #1: `IndexType`
[INFO] [stdout]             candidate #2: `Nullable`
[INFO] [stdout]             candidate #3: `lexical_core::util::sequence::VecLike`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:729:22
[INFO] [stdout]     |
[INFO] [stdout] 729 |         assert!(proj.equiv(0, 1));
[INFO] [stdout]     |                      ^^^^^ -  - expected `Node`, found integer
[INFO] [stdout]     |                            |
[INFO] [stdout]     |                            expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/projection.rs:82:12
[INFO] [stdout]     |
[INFO] [stdout]  82 |     pub fn equiv(&self, x: Node, y: Node) -> bool {
[INFO] [stdout]     |            ^^^^^        -------  -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 729 |         assert!(proj.equiv(snarls::Node { id: 0 }, 1));
[INFO] [stdout]     |                            ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 729 |         assert!(proj.equiv(0, snarls::Node { id: 1 }));
[INFO] [stdout]     |                               ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:732:27
[INFO] [stdout]     |
[INFO] [stdout] 732 |             assert!(!proj.equiv(0, i as u64));
[INFO] [stdout]     |                           ^^^^^ -  -------- expected `Node`, found `u64`
[INFO] [stdout]     |                                 |
[INFO] [stdout]     |                                 expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/projection.rs:82:12
[INFO] [stdout]     |
[INFO] [stdout]  82 |     pub fn equiv(&self, x: Node, y: Node) -> bool {
[INFO] [stdout]     |            ^^^^^        -------  -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 732 |             assert!(!proj.equiv(snarls::Node { id: 0 }, i as u64));
[INFO] [stdout]     |                                 ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 732 |             assert!(!proj.equiv(0, snarls::Node { id: i as u64 }));
[INFO] [stdout]     |                                    ++++++++++++++++++          +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:744:15
[INFO] [stdout]     |
[INFO] [stdout] 744 |         graph.contract_edge(1, 2, &mut proj);
[INFO] [stdout]     |               ^^^^^^^^^^^^^ -  - expected `Node`, found integer
[INFO] [stdout]     |                             |
[INFO] [stdout]     |                             expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/biedgedgraph.rs:552:12
[INFO] [stdout]     |
[INFO] [stdout] 552 |     pub fn contract_edge(
[INFO] [stdout]     |            ^^^^^^^^^^^^^
[INFO] [stdout] 553 |         &mut self,
[INFO] [stdout] 554 |         left: Node,
[INFO] [stdout]     |         ----------
[INFO] [stdout] 555 |         right: Node,
[INFO] [stdout]     |         -----------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 744 |         graph.contract_edge(snarls::Node { id: 1 }, 2, &mut proj);
[INFO] [stdout]     |                             ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 744 |         graph.contract_edge(1, snarls::Node { id: 2 }, &mut proj);
[INFO] [stdout]     |                                ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:745:27
[INFO] [stdout]     |
[INFO] [stdout] 745 |         let (x, y) = proj.kept_pair(1, 2);
[INFO] [stdout]     |                           ^^^^^^^^^ -  - expected `Node`, found integer
[INFO] [stdout]     |                                     |
[INFO] [stdout]     |                                     expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/projection.rs:91:12
[INFO] [stdout]     |
[INFO] [stdout]  91 |     pub fn kept_pair(&mut self, x: Node, y: Node) -> (Node, Node) {
[INFO] [stdout]     |            ^^^^^^^^^            -------  -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 745 |         let (x, y) = proj.kept_pair(snarls::Node { id: 1 }, 2);
[INFO] [stdout]     |                                     ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 745 |         let (x, y) = proj.kept_pair(1, snarls::Node { id: 2 });
[INFO] [stdout]     |                                        ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:751:15
[INFO] [stdout]     |
[INFO] [stdout] 751 |         graph.contract_edge(4, 1, &mut proj);
[INFO] [stdout]     |               ^^^^^^^^^^^^^ -  - expected `Node`, found integer
[INFO] [stdout]     |                             |
[INFO] [stdout]     |                             expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/biedgedgraph.rs:552:12
[INFO] [stdout]     |
[INFO] [stdout] 552 |     pub fn contract_edge(
[INFO] [stdout]     |            ^^^^^^^^^^^^^
[INFO] [stdout] 553 |         &mut self,
[INFO] [stdout] 554 |         left: Node,
[INFO] [stdout]     |         ----------
[INFO] [stdout] 555 |         right: Node,
[INFO] [stdout]     |         -----------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 751 |         graph.contract_edge(snarls::Node { id: 4 }, 1, &mut proj);
[INFO] [stdout]     |                             ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 751 |         graph.contract_edge(4, snarls::Node { id: 1 }, &mut proj);
[INFO] [stdout]     |                                ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:753:29
[INFO] [stdout]     |
[INFO] [stdout] 753 |         let (x_, y_) = proj.kept_pair(4, 1);
[INFO] [stdout]     |                             ^^^^^^^^^ -  - expected `Node`, found integer
[INFO] [stdout]     |                                       |
[INFO] [stdout]     |                                       expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/projection.rs:91:12
[INFO] [stdout]     |
[INFO] [stdout]  91 |     pub fn kept_pair(&mut self, x: Node, y: Node) -> (Node, Node) {
[INFO] [stdout]     |            ^^^^^^^^^            -------  -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 753 |         let (x_, y_) = proj.kept_pair(snarls::Node { id: 4 }, 1);
[INFO] [stdout]     |                                       ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 753 |         let (x_, y_) = proj.kept_pair(4, snarls::Node { id: 1 });
[INFO] [stdout]     |                                          ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:766:22
[INFO] [stdout]     |
[INFO] [stdout] 766 |         assert!(proj.equiv(1, 2));
[INFO] [stdout]     |                      ^^^^^ -  - expected `Node`, found integer
[INFO] [stdout]     |                            |
[INFO] [stdout]     |                            expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/projection.rs:82:12
[INFO] [stdout]     |
[INFO] [stdout]  82 |     pub fn equiv(&self, x: Node, y: Node) -> bool {
[INFO] [stdout]     |            ^^^^^        -------  -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 766 |         assert!(proj.equiv(snarls::Node { id: 1 }, 2));
[INFO] [stdout]     |                            ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 766 |         assert!(proj.equiv(1, snarls::Node { id: 2 }));
[INFO] [stdout]     |                               ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:767:22
[INFO] [stdout]     |
[INFO] [stdout] 767 |         assert!(proj.equiv(1, 4));
[INFO] [stdout]     |                      ^^^^^ -  - expected `Node`, found integer
[INFO] [stdout]     |                            |
[INFO] [stdout]     |                            expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/projection.rs:82:12
[INFO] [stdout]     |
[INFO] [stdout]  82 |     pub fn equiv(&self, x: Node, y: Node) -> bool {
[INFO] [stdout]     |            ^^^^^        -------  -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 767 |         assert!(proj.equiv(snarls::Node { id: 1 }, 4));
[INFO] [stdout]     |                            ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 767 |         assert!(proj.equiv(1, snarls::Node { id: 4 }));
[INFO] [stdout]     |                               ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:768:22
[INFO] [stdout]     |
[INFO] [stdout] 768 |         assert!(proj.equiv(2, 4));
[INFO] [stdout]     |                      ^^^^^ -  - expected `Node`, found integer
[INFO] [stdout]     |                            |
[INFO] [stdout]     |                            expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/projection.rs:82:12
[INFO] [stdout]     |
[INFO] [stdout]  82 |     pub fn equiv(&self, x: Node, y: Node) -> bool {
[INFO] [stdout]     |            ^^^^^        -------  -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 768 |         assert!(proj.equiv(snarls::Node { id: 2 }, 4));
[INFO] [stdout]     |                            ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 768 |         assert!(proj.equiv(2, snarls::Node { id: 4 }));
[INFO] [stdout]     |                               ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0107]: missing generics for struct `biedgedgraph::BiedgedGraph`
[INFO] [stdout]    --> src/biedgedgraph.rs:770:30
[INFO] [stdout]     |
[INFO] [stdout] 770 |         let edges_vec = |g: &BiedgedGraph, x: u64| {
[INFO] [stdout]     |                              ^^^^^^^^^^^^ expected 1 generic argument
[INFO] [stdout]     |
[INFO] [stdout] note: struct defined here, with 1 generic parameter: `G`
[INFO] [stdout]    --> src/biedgedgraph.rs:99:12
[INFO] [stdout]     |
[INFO] [stdout]  99 | pub struct BiedgedGraph<G> {
[INFO] [stdout]     |            ^^^^^^^^^^^^ -
[INFO] [stdout] help: add missing generic argument
[INFO] [stdout]     |
[INFO] [stdout] 770 |         let edges_vec = |g: &BiedgedGraph<G>, x: u64| {
[INFO] [stdout]     |                                          +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]    --> src/biedgedgraph.rs:772:24
[INFO] [stdout]     |
[INFO] [stdout] 772 |                 .edges(x)
[INFO] [stdout]     |                  ----- ^ expected `Node`, found `u64`
[INFO] [stdout]     |                  |
[INFO] [stdout]     |                  arguments to this method are incorrect
[INFO] [stdout]     |
[INFO] [stdout] help: the return type of this call is `u64` due to the type of the argument passed
[INFO] [stdout]    --> src/biedgedgraph.rs:771:13
[INFO] [stdout]     |
[INFO] [stdout] 771 | /             g.graph
[INFO] [stdout] 772 | |                 .edges(x)
[INFO] [stdout]     | |________________________-^
[INFO] [stdout]     |                          |
[INFO] [stdout]     |                          this argument influences the return type of `edges`
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/petgraph-0.5.1/src/graphmap.rs:368:12
[INFO] [stdout]     |
[INFO] [stdout] 368 |     pub fn edges(&self, from: N) -> Edges<N, E, Ty> {
[INFO] [stdout]     |            ^^^^^
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 772 |                 .edges(snarls::Node { id: x })
[INFO] [stdout]     |                        ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]    --> src/biedgedgraph.rs:777:27
[INFO] [stdout]     |
[INFO] [stdout] 777 |         let x = proj.find(4);
[INFO] [stdout]     |                      ---- ^ expected `Node`, found integer
[INFO] [stdout]     |                      |
[INFO] [stdout]     |                      arguments to this method are incorrect
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/projection.rs:51:12
[INFO] [stdout]     |
[INFO] [stdout]  51 |     pub fn find(&self, x: Node) -> Node {
[INFO] [stdout]     |            ^^^^        -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 777 |         let x = proj.find(snarls::Node { id: 4 });
[INFO] [stdout]     |                           ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:782:15
[INFO] [stdout]     |
[INFO] [stdout] 782 |         graph.contract_edge(7, 8, &mut proj);
[INFO] [stdout]     |               ^^^^^^^^^^^^^ -  - expected `Node`, found integer
[INFO] [stdout]     |                             |
[INFO] [stdout]     |                             expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/biedgedgraph.rs:552:12
[INFO] [stdout]     |
[INFO] [stdout] 552 |     pub fn contract_edge(
[INFO] [stdout]     |            ^^^^^^^^^^^^^
[INFO] [stdout] 553 |         &mut self,
[INFO] [stdout] 554 |         left: Node,
[INFO] [stdout]     |         ----------
[INFO] [stdout] 555 |         right: Node,
[INFO] [stdout]     |         -----------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 782 |         graph.contract_edge(snarls::Node { id: 7 }, 8, &mut proj);
[INFO] [stdout]     |                             ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 782 |         graph.contract_edge(7, snarls::Node { id: 8 }, &mut proj);
[INFO] [stdout]     |                                ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:783:15
[INFO] [stdout]     |
[INFO] [stdout] 783 |         graph.contract_edge(0, 7, &mut proj);
[INFO] [stdout]     |               ^^^^^^^^^^^^^ -  - expected `Node`, found integer
[INFO] [stdout]     |                             |
[INFO] [stdout]     |                             expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/biedgedgraph.rs:552:12
[INFO] [stdout]     |
[INFO] [stdout] 552 |     pub fn contract_edge(
[INFO] [stdout]     |            ^^^^^^^^^^^^^
[INFO] [stdout] 553 |         &mut self,
[INFO] [stdout] 554 |         left: Node,
[INFO] [stdout]     |         ----------
[INFO] [stdout] 555 |         right: Node,
[INFO] [stdout]     |         -----------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 783 |         graph.contract_edge(snarls::Node { id: 0 }, 7, &mut proj);
[INFO] [stdout]     |                             ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 783 |         graph.contract_edge(0, snarls::Node { id: 7 }, &mut proj);
[INFO] [stdout]     |                                ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:787:22
[INFO] [stdout]     |
[INFO] [stdout] 787 |         assert!(proj.equiv(0, 7));
[INFO] [stdout]     |                      ^^^^^ -  - expected `Node`, found integer
[INFO] [stdout]     |                            |
[INFO] [stdout]     |                            expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/projection.rs:82:12
[INFO] [stdout]     |
[INFO] [stdout]  82 |     pub fn equiv(&self, x: Node, y: Node) -> bool {
[INFO] [stdout]     |            ^^^^^        -------  -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 787 |         assert!(proj.equiv(snarls::Node { id: 0 }, 7));
[INFO] [stdout]     |                            ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 787 |         assert!(proj.equiv(0, snarls::Node { id: 7 }));
[INFO] [stdout]     |                               ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:788:22
[INFO] [stdout]     |
[INFO] [stdout] 788 |         assert!(proj.equiv(7, 8));
[INFO] [stdout]     |                      ^^^^^ -  - expected `Node`, found integer
[INFO] [stdout]     |                            |
[INFO] [stdout]     |                            expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/projection.rs:82:12
[INFO] [stdout]     |
[INFO] [stdout]  82 |     pub fn equiv(&self, x: Node, y: Node) -> bool {
[INFO] [stdout]     |            ^^^^^        -------  -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 788 |         assert!(proj.equiv(snarls::Node { id: 7 }, 8));
[INFO] [stdout]     |                            ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 788 |         assert!(proj.equiv(7, snarls::Node { id: 8 }));
[INFO] [stdout]     |                               ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:789:22
[INFO] [stdout]     |
[INFO] [stdout] 789 |         assert!(proj.equiv(0, 8));
[INFO] [stdout]     |                      ^^^^^ -  - expected `Node`, found integer
[INFO] [stdout]     |                            |
[INFO] [stdout]     |                            expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/projection.rs:82:12
[INFO] [stdout]     |
[INFO] [stdout]  82 |     pub fn equiv(&self, x: Node, y: Node) -> bool {
[INFO] [stdout]     |            ^^^^^        -------  -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 789 |         assert!(proj.equiv(snarls::Node { id: 0 }, 8));
[INFO] [stdout]     |                            ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 789 |         assert!(proj.equiv(0, snarls::Node { id: 8 }));
[INFO] [stdout]     |                               ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]    --> src/biedgedgraph.rs:791:27
[INFO] [stdout]     |
[INFO] [stdout] 791 |         let x = proj.find(7);
[INFO] [stdout]     |                      ---- ^ expected `Node`, found integer
[INFO] [stdout]     |                      |
[INFO] [stdout]     |                      arguments to this method are incorrect
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/projection.rs:51:12
[INFO] [stdout]     |
[INFO] [stdout]  51 |     pub fn find(&self, x: Node) -> Node {
[INFO] [stdout]     |            ^^^^        -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 791 |         let x = proj.find(snarls::Node { id: 7 });
[INFO] [stdout]     |                           ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:799:15
[INFO] [stdout]     |
[INFO] [stdout] 799 |         graph.contract_edge(0, 1, &mut proj);
[INFO] [stdout]     |               ^^^^^^^^^^^^^ -  - expected `Node`, found integer
[INFO] [stdout]     |                             |
[INFO] [stdout]     |                             expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/biedgedgraph.rs:552:12
[INFO] [stdout]     |
[INFO] [stdout] 552 |     pub fn contract_edge(
[INFO] [stdout]     |            ^^^^^^^^^^^^^
[INFO] [stdout] 553 |         &mut self,
[INFO] [stdout] 554 |         left: Node,
[INFO] [stdout]     |         ----------
[INFO] [stdout] 555 |         right: Node,
[INFO] [stdout]     |         -----------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 799 |         graph.contract_edge(snarls::Node { id: 0 }, 1, &mut proj);
[INFO] [stdout]     |                             ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 799 |         graph.contract_edge(0, snarls::Node { id: 1 }, &mut proj);
[INFO] [stdout]     |                                ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:801:31
[INFO] [stdout]     |
[INFO] [stdout] 801 |         let (x_2, y_2) = proj.kept_pair(8, 4);
[INFO] [stdout]     |                               ^^^^^^^^^ -  - expected `Node`, found integer
[INFO] [stdout]     |                                         |
[INFO] [stdout]     |                                         expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/projection.rs:91:12
[INFO] [stdout]     |
[INFO] [stdout]  91 |     pub fn kept_pair(&mut self, x: Node, y: Node) -> (Node, Node) {
[INFO] [stdout]     |            ^^^^^^^^^            -------  -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 801 |         let (x_2, y_2) = proj.kept_pair(snarls::Node { id: 8 }, 4);
[INFO] [stdout]     |                                         ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 801 |         let (x_2, y_2) = proj.kept_pair(8, snarls::Node { id: 4 });
[INFO] [stdout]     |                                            ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]    --> src/biedgedgraph.rs:812:31
[INFO] [stdout]     |
[INFO] [stdout] 812 |             let x = proj.find(*a);
[INFO] [stdout]     |                          ---- ^^ expected `Node`, found `u64`
[INFO] [stdout]     |                          |
[INFO] [stdout]     |                          arguments to this method are incorrect
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/projection.rs:51:12
[INFO] [stdout]     |
[INFO] [stdout]  51 |     pub fn find(&self, x: Node) -> Node {
[INFO] [stdout]     |            ^^^^        -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 812 |             let x = proj.find(snarls::Node { id: *a });
[INFO] [stdout]     |                               ++++++++++++++++++    +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]    --> src/biedgedgraph.rs:813:31
[INFO] [stdout]     |
[INFO] [stdout] 813 |             let y = proj.find(*b);
[INFO] [stdout]     |                          ---- ^^ expected `Node`, found `u64`
[INFO] [stdout]     |                          |
[INFO] [stdout]     |                          arguments to this method are incorrect
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/projection.rs:51:12
[INFO] [stdout]     |
[INFO] [stdout]  51 |     pub fn find(&self, x: Node) -> Node {
[INFO] [stdout]     |            ^^^^        -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 813 |             let y = proj.find(snarls::Node { id: *b });
[INFO] [stdout]     |                               ++++++++++++++++++    +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:826:15
[INFO] [stdout]     |
[INFO] [stdout] 826 |         graph.merge_vertices(7, 8, &mut proj);
[INFO] [stdout]     |               ^^^^^^^^^^^^^^ -  - expected `Node`, found integer
[INFO] [stdout]     |                              |
[INFO] [stdout]     |                              expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/biedgedgraph.rs:520:12
[INFO] [stdout]     |
[INFO] [stdout] 520 |     pub fn merge_vertices(
[INFO] [stdout]     |            ^^^^^^^^^^^^^^
[INFO] [stdout] 521 |         &mut self,
[INFO] [stdout] 522 |         from: Node,
[INFO] [stdout]     |         ----------
[INFO] [stdout] 523 |         to: Node,
[INFO] [stdout]     |         --------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 826 |         graph.merge_vertices(snarls::Node { id: 7 }, 8, &mut proj);
[INFO] [stdout]     |                              ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 826 |         graph.merge_vertices(7, snarls::Node { id: 8 }, &mut proj);
[INFO] [stdout]     |                                 ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:827:15
[INFO] [stdout]     |
[INFO] [stdout] 827 |         graph.merge_vertices(7, 9, &mut proj);
[INFO] [stdout]     |               ^^^^^^^^^^^^^^ -  - expected `Node`, found integer
[INFO] [stdout]     |                              |
[INFO] [stdout]     |                              expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/biedgedgraph.rs:520:12
[INFO] [stdout]     |
[INFO] [stdout] 520 |     pub fn merge_vertices(
[INFO] [stdout]     |            ^^^^^^^^^^^^^^
[INFO] [stdout] 521 |         &mut self,
[INFO] [stdout] 522 |         from: Node,
[INFO] [stdout]     |         ----------
[INFO] [stdout] 523 |         to: Node,
[INFO] [stdout]     |         --------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 827 |         graph.merge_vertices(snarls::Node { id: 7 }, 9, &mut proj);
[INFO] [stdout]     |                              ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 827 |         graph.merge_vertices(7, snarls::Node { id: 9 }, &mut proj);
[INFO] [stdout]     |                                 ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:829:28
[INFO] [stdout]     |
[INFO] [stdout] 829 |         let (x, _y) = proj.kept_pair(7, 9);
[INFO] [stdout]     |                            ^^^^^^^^^ -  - expected `Node`, found integer
[INFO] [stdout]     |                                      |
[INFO] [stdout]     |                                      expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/projection.rs:91:12
[INFO] [stdout]     |
[INFO] [stdout]  91 |     pub fn kept_pair(&mut self, x: Node, y: Node) -> (Node, Node) {
[INFO] [stdout]     |            ^^^^^^^^^            -------  -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 829 |         let (x, _y) = proj.kept_pair(snarls::Node { id: 7 }, 9);
[INFO] [stdout]     |                                      ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 829 |         let (x, _y) = proj.kept_pair(7, snarls::Node { id: 9 });
[INFO] [stdout]     |                                         ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0107]: missing generics for struct `biedgedgraph::BiedgedGraph`
[INFO] [stdout]    --> src/biedgedgraph.rs:831:30
[INFO] [stdout]     |
[INFO] [stdout] 831 |         let edges_vec = |g: &BiedgedGraph, x: u64| {
[INFO] [stdout]     |                              ^^^^^^^^^^^^ expected 1 generic argument
[INFO] [stdout]     |
[INFO] [stdout] note: struct defined here, with 1 generic parameter: `G`
[INFO] [stdout]    --> src/biedgedgraph.rs:99:12
[INFO] [stdout]     |
[INFO] [stdout]  99 | pub struct BiedgedGraph<G> {
[INFO] [stdout]     |            ^^^^^^^^^^^^ -
[INFO] [stdout] help: add missing generic argument
[INFO] [stdout]     |
[INFO] [stdout] 831 |         let edges_vec = |g: &BiedgedGraph<G>, x: u64| {
[INFO] [stdout]     |                                          +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]    --> src/biedgedgraph.rs:833:24
[INFO] [stdout]     |
[INFO] [stdout] 833 |                 .edges(x)
[INFO] [stdout]     |                  ----- ^ expected `Node`, found `u64`
[INFO] [stdout]     |                  |
[INFO] [stdout]     |                  arguments to this method are incorrect
[INFO] [stdout]     |
[INFO] [stdout] help: the return type of this call is `u64` due to the type of the argument passed
[INFO] [stdout]    --> src/biedgedgraph.rs:832:13
[INFO] [stdout]     |
[INFO] [stdout] 832 | /             g.graph
[INFO] [stdout] 833 | |                 .edges(x)
[INFO] [stdout]     | |________________________-^
[INFO] [stdout]     |                          |
[INFO] [stdout]     |                          this argument influences the return type of `edges`
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/petgraph-0.5.1/src/graphmap.rs:368:12
[INFO] [stdout]     |
[INFO] [stdout] 368 |     pub fn edges(&self, from: N) -> Edges<N, E, Ty> {
[INFO] [stdout]     |            ^^^^^
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 833 |                 .edges(snarls::Node { id: x })
[INFO] [stdout]     |                        ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:838:15
[INFO] [stdout]     |
[INFO] [stdout] 838 |         graph.merge_vertices(0, 7, &mut proj);
[INFO] [stdout]     |               ^^^^^^^^^^^^^^ -  - expected `Node`, found integer
[INFO] [stdout]     |                              |
[INFO] [stdout]     |                              expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/biedgedgraph.rs:520:12
[INFO] [stdout]     |
[INFO] [stdout] 520 |     pub fn merge_vertices(
[INFO] [stdout]     |            ^^^^^^^^^^^^^^
[INFO] [stdout] 521 |         &mut self,
[INFO] [stdout] 522 |         from: Node,
[INFO] [stdout]     |         ----------
[INFO] [stdout] 523 |         to: Node,
[INFO] [stdout]     |         --------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 838 |         graph.merge_vertices(snarls::Node { id: 0 }, 7, &mut proj);
[INFO] [stdout]     |                              ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 838 |         graph.merge_vertices(0, snarls::Node { id: 7 }, &mut proj);
[INFO] [stdout]     |                                 ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: arguments to this method are incorrect
[INFO] [stdout]    --> src/biedgedgraph.rs:839:15
[INFO] [stdout]     |
[INFO] [stdout] 839 |         graph.merge_vertices(1, 7, &mut proj);
[INFO] [stdout]     |               ^^^^^^^^^^^^^^ -  - expected `Node`, found integer
[INFO] [stdout]     |                              |
[INFO] [stdout]     |                              expected `Node`, found integer
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/biedgedgraph.rs:520:12
[INFO] [stdout]     |
[INFO] [stdout] 520 |     pub fn merge_vertices(
[INFO] [stdout]     |            ^^^^^^^^^^^^^^
[INFO] [stdout] 521 |         &mut self,
[INFO] [stdout] 522 |         from: Node,
[INFO] [stdout]     |         ----------
[INFO] [stdout] 523 |         to: Node,
[INFO] [stdout]     |         --------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 839 |         graph.merge_vertices(snarls::Node { id: 1 }, 7, &mut proj);
[INFO] [stdout]     |                              ++++++++++++++++++   +
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 839 |         graph.merge_vertices(1, snarls::Node { id: 7 }, &mut proj);
[INFO] [stdout]     |                                 ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]    --> src/biedgedgraph.rs:851:31
[INFO] [stdout]     |
[INFO] [stdout] 851 |             let x = proj.find(i);
[INFO] [stdout]     |                          ---- ^ expected `Node`, found `u64`
[INFO] [stdout]     |                          |
[INFO] [stdout]     |                          arguments to this method are incorrect
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> src/projection.rs:51:12
[INFO] [stdout]     |
[INFO] [stdout]  51 |     pub fn find(&self, x: Node) -> Node {
[INFO] [stdout]     |            ^^^^        -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 851 |             let x = proj.find(snarls::Node { id: i });
[INFO] [stdout]     |                               ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]    --> src/biedgedgraph.rs:852:21
[INFO] [stdout]     |
[INFO] [stdout] 852 |             if i == x {
[INFO] [stdout]     |                -    ^ expected `u64`, found `Node`
[INFO] [stdout]     |                |
[INFO] [stdout]     |                expected because this is `u64`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]    --> src/biedgedgraph.rs:853:51
[INFO] [stdout]     |
[INFO] [stdout] 853 |                 assert!(graph.graph.contains_node(i));
[INFO] [stdout]     |                                     ------------- ^ expected `Node`, found `u64`
[INFO] [stdout]     |                                     |
[INFO] [stdout]     |                                     arguments to this method are incorrect
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/petgraph-0.5.1/src/graphmap.rs:204:12
[INFO] [stdout]     |
[INFO] [stdout] 204 |     pub fn contains_node(&self, n: N) -> bool {
[INFO] [stdout]     |            ^^^^^^^^^^^^^
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 853 |                 assert!(graph.graph.contains_node(snarls::Node { id: i }));
[INFO] [stdout]     |                                                   ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]    --> src/biedgedgraph.rs:855:52
[INFO] [stdout]     |
[INFO] [stdout] 855 |                 assert!(!graph.graph.contains_node(i));
[INFO] [stdout]     |                                      ------------- ^ expected `Node`, found `u64`
[INFO] [stdout]     |                                      |
[INFO] [stdout]     |                                      arguments to this method are incorrect
[INFO] [stdout]     |
[INFO] [stdout] note: method defined here
[INFO] [stdout]    --> /opt/rustwide/cargo-home/registry/src/index.crates.io-1949cf8c6b5b557f/petgraph-0.5.1/src/graphmap.rs:204:12
[INFO] [stdout]     |
[INFO] [stdout] 204 |     pub fn contains_node(&self, n: N) -> bool {
[INFO] [stdout]     |            ^^^^^^^^^^^^^
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]     |
[INFO] [stdout] 855 |                 assert!(!graph.graph.contains_node(snarls::Node { id: i }));
[INFO] [stdout]     |                                                    ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0107]: missing generics for struct `biedgedgraph::BiedgedGraph`
[INFO] [stdout]     --> src/cactusgraph.rs:1919:24
[INFO] [stdout]      |
[INFO] [stdout] 1919 |         let mut graph: BiedgedGraph = BiedgedGraph::new();
[INFO] [stdout]      |                        ^^^^^^^^^^^^ expected 1 generic argument
[INFO] [stdout]      |
[INFO] [stdout] note: struct defined here, with 1 generic parameter: `G`
[INFO] [stdout]     --> src/biedgedgraph.rs:99:12
[INFO] [stdout]      |
[INFO] [stdout]   99 | pub struct BiedgedGraph<G> {
[INFO] [stdout]      |            ^^^^^^^^^^^^ -
[INFO] [stdout] help: add missing generic argument
[INFO] [stdout]      |
[INFO] [stdout] 1919 |         let mut graph: BiedgedGraph<G> = BiedgedGraph::new();
[INFO] [stdout]      |                                    +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0599]: no function or associated item named `new` found for struct `biedgedgraph::BiedgedGraph<G>` in the current scope
[INFO] [stdout]     --> src/cactusgraph.rs:1919:53
[INFO] [stdout]      |
[INFO] [stdout] 1919 |         let mut graph: BiedgedGraph = BiedgedGraph::new();
[INFO] [stdout]      |                                                     ^^^ function or associated item not found in `biedgedgraph::BiedgedGraph<_>`
[INFO] [stdout]      |
[INFO] [stdout]     ::: src/biedgedgraph.rs:99:1
[INFO] [stdout]      |
[INFO] [stdout]   99 | pub struct BiedgedGraph<G> {
[INFO] [stdout]      | -------------------------- function or associated item `new` not found for this struct
[INFO] [stdout]      |
[INFO] [stdout] note: if you're trying to build a new `biedgedgraph::BiedgedGraph<_>` consider using one of the following associated functions:
[INFO] [stdout]       biedgedgraph::BiedgedGraph::<G>::from_directed_edges
[INFO] [stdout]       biedgedgraph::BiedgedGraph::<G>::from_bidirected_edges
[INFO] [stdout]       biedgedgraph::BiedgedGraph::<G>::from_gfa
[INFO] [stdout]     --> src/biedgedgraph.rs:291:5
[INFO] [stdout]      |
[INFO] [stdout]  291 | /     pub fn from_directed_edges<I>(i: I) -> Option<Self>
[INFO] [stdout]  292 | |     where
[INFO] [stdout]  293 | |         I: IntoIterator<Item = (u64, u64)>,
[INFO] [stdout]      | |___________________________________________^
[INFO] [stdout] ...
[INFO] [stdout]  304 | /     pub fn from_bidirected_edges<I>(i: I) -> Option<Self>
[INFO] [stdout]  305 | |     where
[INFO] [stdout]  306 | |         I: IntoIterator<Item = (u64, Orientation, u64, Orientation)>,
[INFO] [stdout]      | |_____________________________________________________________________^
[INFO] [stdout] ...
[INFO] [stdout]  359 |       pub fn from_gfa(gfa: &GFA<usize, ()>) -> Self {
[INFO] [stdout]      |       ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]      = help: items from traits can only be used if the trait is implemented and in scope
[INFO] [stdout]      = note: the following traits define an item `new`, perhaps you need to implement one of them:
[INFO] [stdout]              candidate #1: `IndexType`
[INFO] [stdout]              candidate #2: `Nullable`
[INFO] [stdout]              candidate #3: `lexical_core::util::sequence::VecLike`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]     --> src/cactusgraph.rs:1965:27
[INFO] [stdout]      |
[INFO] [stdout] 1965 |         let a = proj.find(0);
[INFO] [stdout]      |                      ---- ^ expected `Node`, found integer
[INFO] [stdout]      |                      |
[INFO] [stdout]      |                      arguments to this method are incorrect
[INFO] [stdout]      |
[INFO] [stdout] note: method defined here
[INFO] [stdout]     --> src/projection.rs:51:12
[INFO] [stdout]      |
[INFO] [stdout]   51 |     pub fn find(&self, x: Node) -> Node {
[INFO] [stdout]      |            ^^^^        -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]      |
[INFO] [stdout] 1965 |         let a = proj.find(snarls::Node { id: 0 });
[INFO] [stdout]      |                           ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]     --> src/cactusgraph.rs:1966:27
[INFO] [stdout]      |
[INFO] [stdout] 1966 |         let b = proj.find(1);
[INFO] [stdout]      |                      ---- ^ expected `Node`, found integer
[INFO] [stdout]      |                      |
[INFO] [stdout]      |                      arguments to this method are incorrect
[INFO] [stdout]      |
[INFO] [stdout] note: method defined here
[INFO] [stdout]     --> src/projection.rs:51:12
[INFO] [stdout]      |
[INFO] [stdout]   51 |     pub fn find(&self, x: Node) -> Node {
[INFO] [stdout]      |            ^^^^        -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]      |
[INFO] [stdout] 1966 |         let b = proj.find(snarls::Node { id: 1 });
[INFO] [stdout]      |                           ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]     --> src/cactusgraph.rs:1967:27
[INFO] [stdout]      |
[INFO] [stdout] 1967 |         let c = proj.find(3);
[INFO] [stdout]      |                      ---- ^ expected `Node`, found integer
[INFO] [stdout]      |                      |
[INFO] [stdout]      |                      arguments to this method are incorrect
[INFO] [stdout]      |
[INFO] [stdout] note: method defined here
[INFO] [stdout]     --> src/projection.rs:51:12
[INFO] [stdout]      |
[INFO] [stdout]   51 |     pub fn find(&self, x: Node) -> Node {
[INFO] [stdout]      |            ^^^^        -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]      |
[INFO] [stdout] 1967 |         let c = proj.find(snarls::Node { id: 3 });
[INFO] [stdout]      |                           ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]     --> src/cactusgraph.rs:1968:27
[INFO] [stdout]      |
[INFO] [stdout] 1968 |         let d = proj.find(7);
[INFO] [stdout]      |                      ---- ^ expected `Node`, found integer
[INFO] [stdout]      |                      |
[INFO] [stdout]      |                      arguments to this method are incorrect
[INFO] [stdout]      |
[INFO] [stdout] note: method defined here
[INFO] [stdout]     --> src/projection.rs:51:12
[INFO] [stdout]      |
[INFO] [stdout]   51 |     pub fn find(&self, x: Node) -> Node {
[INFO] [stdout]      |            ^^^^        -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]      |
[INFO] [stdout] 1968 |         let d = proj.find(snarls::Node { id: 7 });
[INFO] [stdout]      |                           ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0107]: missing generics for struct `biedgedgraph::BiedgedGraph`
[INFO] [stdout]     --> src/cactusgraph.rs:1991:24
[INFO] [stdout]      |
[INFO] [stdout] 1991 |         let mut graph: BiedgedGraph = graph_from_paper();
[INFO] [stdout]      |                        ^^^^^^^^^^^^ expected 1 generic argument
[INFO] [stdout]      |
[INFO] [stdout] note: struct defined here, with 1 generic parameter: `G`
[INFO] [stdout]     --> src/biedgedgraph.rs:99:12
[INFO] [stdout]      |
[INFO] [stdout]   99 | pub struct BiedgedGraph<G> {
[INFO] [stdout]      |            ^^^^^^^^^^^^ -
[INFO] [stdout] help: add missing generic argument
[INFO] [stdout]      |
[INFO] [stdout] 1991 |         let mut graph: BiedgedGraph<G> = graph_from_paper();
[INFO] [stdout]      |                                    +++
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]     --> src/cactusgraph.rs:2053:39
[INFO] [stdout]      |
[INFO] [stdout] 2053 |                 let l_end = proj.find(l);
[INFO] [stdout]      |                                  ---- ^ expected `Node`, found `u64`
[INFO] [stdout]      |                                  |
[INFO] [stdout]      |                                  arguments to this method are incorrect
[INFO] [stdout]      |
[INFO] [stdout] note: method defined here
[INFO] [stdout]     --> src/projection.rs:51:12
[INFO] [stdout]      |
[INFO] [stdout]   51 |     pub fn find(&self, x: Node) -> Node {
[INFO] [stdout]      |            ^^^^        -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]      |
[INFO] [stdout] 2053 |                 let l_end = proj.find(snarls::Node { id: l });
[INFO] [stdout]      |                                       ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]     --> src/cactusgraph.rs:2054:39
[INFO] [stdout]      |
[INFO] [stdout] 2054 |                 let r_end = proj.find(r);
[INFO] [stdout]      |                                  ---- ^ expected `Node`, found `u64`
[INFO] [stdout]      |                                  |
[INFO] [stdout]      |                                  arguments to this method are incorrect
[INFO] [stdout]      |
[INFO] [stdout] note: method defined here
[INFO] [stdout]     --> src/projection.rs:51:12
[INFO] [stdout]      |
[INFO] [stdout]   51 |     pub fn find(&self, x: Node) -> Node {
[INFO] [stdout]      |            ^^^^        -------
[INFO] [stdout] help: try wrapping the expression in `snarls::Node`
[INFO] [stdout]      |
[INFO] [stdout] 2054 |                 let r_end = proj.find(snarls::Node { id: r });
[INFO] [stdout]      |                                       ++++++++++++++++++   +
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]     --> src/cactusgraph.rs:2055:59
[INFO] [stdout]      |
[INFO] [stdout] 2055 |                 let l_end = segment_split_name(&name_map, l_end).unwrap();
[INFO] [stdout]      |                             ------------------            ^^^^^ expected `u64`, found `Node`
[INFO] [stdout]      |                             |
[INFO] [stdout]      |                             arguments to this function are incorrect
[INFO] [stdout]      |
[INFO] [stdout] note: function defined here
[INFO] [stdout]     --> src/cactusgraph.rs:2006:8
[INFO] [stdout]      |
[INFO] [stdout] 2006 |     fn segment_split_name(
[INFO] [stdout]      |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 2007 |         name_map: &gfa::gfa::name_conversion::NameMap,
[INFO] [stdout] 2008 |         n: u64,
[INFO] [stdout]      |         ------
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]     --> src/cactusgraph.rs:2056:59
[INFO] [stdout]      |
[INFO] [stdout] 2056 |                 let r_end = segment_split_name(&name_map, r_end).unwrap();
[INFO] [stdout]      |                             ------------------            ^^^^^ expected `u64`, found `Node`
[INFO] [stdout]      |                             |
[INFO] [stdout]      |                             arguments to this function are incorrect
[INFO] [stdout]      |
[INFO] [stdout] note: function defined here
[INFO] [stdout]     --> src/cactusgraph.rs:2006:8
[INFO] [stdout]      |
[INFO] [stdout] 2006 |     fn segment_split_name(
[INFO] [stdout]      |        ^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 2007 |         name_map: &gfa::gfa::name_conversion::NameMap,
[INFO] [stdout] 2008 |         n: u64,
[INFO] [stdout]      |         ------
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]     --> src/cactusgraph.rs:2092:47
[INFO] [stdout]      |
[INFO] [stdout] 2092 |         let cycles = CactusGraph::find_cycles(&graph);
[INFO] [stdout]      |                      ------------------------ ^^^^^^ expected `&BiedgedGraph<Cactus>`, found `&BiedgedGraph<Biedged>`
[INFO] [stdout]      |                      |
[INFO] [stdout]      |                      arguments to this function are incorrect
[INFO] [stdout]      |
[INFO] [stdout]      = note: expected reference `&biedgedgraph::BiedgedGraph<Cactus>`
[INFO] [stdout]                 found reference `&biedgedgraph::BiedgedGraph<snarls::Biedged>`
[INFO] [stdout] note: associated function defined here
[INFO] [stdout]     --> src/cactusgraph.rs:422:8
[INFO] [stdout]      |
[INFO] [stdout]  422 |     fn find_cycles(biedged: &BiedgedGraph<Cactus>) -> Vec<Vec<(Node, Node)>> {
[INFO] [stdout]      |        ^^^^^^^^^^^ ------------------------------
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0277]: can't compare `(snarls::Node, snarls::Node)` with `({integer}, {integer})`
[INFO] [stdout]     --> src/cactusgraph.rs:2094:9
[INFO] [stdout]      |
[INFO] [stdout] 2094 | /         assert_eq!(
[INFO] [stdout] 2095 | |             cycles,
[INFO] [stdout] 2096 | |             vec![
[INFO] [stdout] 2097 | |                 vec![(1, 2), (2, 1)],
[INFO] [stdout] ...    |
[INFO] [stdout] 2106 | |         );
[INFO] [stdout]      | |_________^ no implementation for `(snarls::Node, snarls::Node) == ({integer}, {integer})`
[INFO] [stdout]      |
[INFO] [stdout]      = help: the trait `PartialEq<({integer}, {integer})>` is not implemented for `(snarls::Node, snarls::Node)`
[INFO] [stdout]      = help: the following other types implement trait `PartialEq<Rhs>`:
[INFO] [stdout]                ()
[INFO] [stdout]                (A, Z, Y, X, W, V, U, T)
[INFO] [stdout]                (B, A, Z, Y, X, W, V, U, T)
[INFO] [stdout]                (C, B, A, Z, Y, X, W, V, U, T)
[INFO] [stdout]                (D, C, B, A, Z, Y, X, W, V, U, T)
[INFO] [stdout]                (E, D, C, B, A, Z, Y, X, W, V, U, T)
[INFO] [stdout]                (T,)
[INFO] [stdout]                (U, T)
[INFO] [stdout]              and 5 others
[INFO] [stdout]      = note: required for `Vec<(snarls::Node, snarls::Node)>` to implement `PartialEq<Vec<({integer}, {integer})>>`
[INFO] [stdout]      = note: 1 redundant requirement hidden
[INFO] [stdout]      = note: required for `Vec<Vec<(snarls::Node, snarls::Node)>>` to implement `PartialEq<Vec<Vec<({integer}, {integer})>>>`
[INFO] [stdout]      = note: this error originates in the macro `assert_eq` (in Nightly builds, run with -Z macro-backtrace for more info)
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]     --> src/cactusgraph.rs:2113:47
[INFO] [stdout]      |
[INFO] [stdout] 2113 |         let cycles = CactusGraph::find_cycles(&graph);
[INFO] [stdout]      |                      ------------------------ ^^^^^^ expected `&BiedgedGraph<Cactus>`, found `&BiedgedGraph<Biedged>`
[INFO] [stdout]      |                      |
[INFO] [stdout]      |                      arguments to this function are incorrect
[INFO] [stdout]      |
[INFO] [stdout]      = note: expected reference `&biedgedgraph::BiedgedGraph<Cactus>`
[INFO] [stdout]                 found reference `&biedgedgraph::BiedgedGraph<snarls::Biedged>`
[INFO] [stdout] note: associated function defined here
[INFO] [stdout]     --> src/cactusgraph.rs:422:8
[INFO] [stdout]      |
[INFO] [stdout]  422 |     fn find_cycles(biedged: &BiedgedGraph<Cactus>) -> Vec<Vec<(Node, Node)>> {
[INFO] [stdout]      |        ^^^^^^^^^^^ ------------------------------
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] error[E0308]: mismatched types
[INFO] [stdout]     --> src/cactusgraph.rs:2116:50
[INFO] [stdout]      |
[INFO] [stdout] 2116 |             CactusTree::construct_chain_vertices(&mut graph, &cycles);
[INFO] [stdout]      |             ------------------------------------ ^^^^^^^^^^ expected `&mut BiedgedGraph<Cactus>`, found `&mut BiedgedGraph<Biedged>`
[INFO] [stdout]      |             |
[INFO] [stdout]      |             arguments to this function are incorrect
[INFO] [stdout]      |
[INFO] [stdout]      = note: expected mutable reference `&mut biedgedgraph::BiedgedGraph<Cactus>`
[INFO] [stdout]                 found mutable reference `&mut biedgedgraph::BiedgedGraph<snarls::Biedged>`
[INFO] [stdout] note: associated function defined here
[INFO] [stdout]     --> src/cactusgraph.rs:642:8
[INFO] [stdout]      |
[INFO] [stdout]  642 |     fn construct_chain_vertices(
[INFO] [stdout]      |        ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]  643 |         biedged: &mut BiedgedGraph<Cactus>,
[INFO] [stdout]      |         ----------------------------------
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `b_inv`
[INFO] [stdout]    --> src/cactusgraph.rs:212:21
[INFO] [stdout]     |
[INFO] [stdout] 212 |                 let b_inv = inv_proj.get(&b.id).unwrap();
[INFO] [stdout]     |                     ^^^^^ help: if this is intentional, prefix it with an underscore: `_b_inv`
[INFO] [stdout]     |
[INFO] [stdout]     = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `vertices`
[INFO] [stdout]    --> src/cactusgraph.rs:877:9
[INFO] [stdout]     |
[INFO] [stdout] 877 |         vertices: &FxHashSet<Node>,
[INFO] [stdout]     |         ^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_vertices`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `cactus_tree`
[INFO] [stdout]   --> src/netgraph.rs:33:9
[INFO] [stdout]    |
[INFO] [stdout] 33 |         cactus_tree: &CactusTree,
[INFO] [stdout]    |         ^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_cactus_tree`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] Some errors have detailed explanations: E0107, E0277, E0308, E0599.
[INFO] [stdout] 
[INFO] [stdout] For more information about an error, try `rustc --explain E0107`.
[INFO] [stdout] 
[INFO] [stderr] error: could not compile `saboten` (lib test) due to 55 previous errors; 7 warnings emitted
[INFO] running `Command { std: "docker" "inspect" "cb39c0dfc884e332cb5ef32bebe36e908ba8c57d37396a516ff0e44cd1c02107", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "cb39c0dfc884e332cb5ef32bebe36e908ba8c57d37396a516ff0e44cd1c02107", kill_on_drop: false }`
[INFO] [stdout] cb39c0dfc884e332cb5ef32bebe36e908ba8c57d37396a516ff0e44cd1c02107
